Raymond F. Boyce, Donald D. Chamberlin, et al.
CACM
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.
Raymond F. Boyce, Donald D. Chamberlin, et al.
CACM
Victor Valls, Panagiotis Promponas, et al.
IEEE Communications Magazine
Preeti Malakar, Thomas George, et al.
SC 2012
Rafae Bhatti, Elisa Bertino, et al.
Communications of the ACM