David A. Selby
IBM J. Res. Dev
We study an iterative, locally quadratically convergent algorithm for solving Toeplitz systems of equations from [R. P. Brent, F. G. Gustavson and D. Y. Y. Yun. "Fast solution of Toeplitz systems of equations and computation of Padé approximations", J. Algorithms, 1:259-295, 1980]. We introduce a new iterative algorithm that is locally quadratically convergent when used to solve symmetric positive definite Toeplitz systems. We present a set of numerical experiments on randomly generated symmetric positive definite Toeplitz matrices. In these experiments, our algorithm performed significantly better than the previously proposed algorithm. © 1993 Springer-Verlag.
David A. Selby
IBM J. Res. Dev
Michael D. Moffitt
ICCAD 2009
György E. Révész
Theoretical Computer Science
John M. Boyer, Charles F. Wiecha
DocEng 2009