Iterative Toeplitz solvers with local quadratic convergence

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 Pade 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.


Published in:
Computing, 49, 4, 339-347
Year:
1993
Keywords:
Laboratories:




 Record created 2005-04-18, last modified 2018-03-17

n/a:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)