A fast algorithm for the inversion of general Toeplitz matrices

Computers and Mathematics with Applications

Volumn 50, Issue 5-6, 2005, Pages 741-752

  Martinsson, P G ^a   Rokhlin, V ^a   Tygert, M ^a  

^a YALE UNIVERSITY   (United States)

Author keywords

Direct inversion; Fast algorithm; Toeplitz matrix

Indexed keywords

ASYMPTOTIC STABILITY; COMPUTATIONAL METHODS; COSTS; FAST FOURIER TRANSFORMS; INVERSE PROBLEMS; MATRIX ALGEBRA;

COMPUTATIONAL COSTS; DIRECT INVERSION; FAST ALGORITHM; TOEPLITZ MATRIX;

ALGORITHMS;

EID: 26444607857     PISSN: 08981221     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.camwa.2005.03.011     Document Type: Article

References (16)

1. W.R. Trench An algorithm for the inversion of finite Toeplitz matrices J. Soc. Indust. Appl. Math. 12 1964 515
2. S. Zohar Toeplitz matrix inversion: The algorithm of W.F. Trench J. Assoc. Comput. Mach. 16 1969 592 601
3. G. Ammar Classical foundations of algorithms for solving positive definite Toeplitz equations Calcolo 33 1996 99 113
4. M. VanBarel, G. Heinig, and P. Kravanja A stabilized superfast solver for nonsymmetric Toeplitz systems SIAM Journal on Matrix Analysis and Applications 93 2 2001 494 510
5. M. Stewart A superfast Toeplitz solver with improved numerical stability SIAM Journal on Matrix Analysis and Applications 25 3 2003 669 693
6. J.-P. Cardinal On a property of Cauchy-like matrices C. R. Acad. Sci. Paris Sér. I Math. 328 11 1999 1089 1093
7. S. Chandrasekaran, T. Pals, M. Gu, P. Dewilde, and A.-J. van der Veen Fast and stable direct solvers for PDEs and integral equations Colloquium Talk, Summer 2002 Lawrence Livermore National Laboratory New York
8. T. Kailath, and V. Olshevsky Diagonal pivoting for partially reconstructible Cauchy-like matrices, with applications to Toeplitz-like linear equations and to boundary rational matrix interpolation problems Proceedings of the Fifth Conference of the International Linear Algebra Society Atlanta, GA Special Issue of Linear Algebra Appl. 254 1995 1997 251 302
9. Fast algorithms for structured matrices: Theory and applications V. Olahevksy Papers from the AMS-IMS-SIAM Joint Summer Research Conference on Fast Algorithms in Mathematics, Computer Science and Engineering held at MountHolyoke College South Hadley, MA, August 5-9, 2001 Contemporary Mathematics Volume 323 2003 American Mathematical Society viii
10. V.Y. Pan, and A. Zheng Superfast algorithms for Cauchy-like matrix computations and extensions Linear Algebra Appl. 310 1-3 2000 83 108
11. P.G. Martineson, and V. Rokhlin A fast direct solver for boundary integral equations in two dimensions J. Comp. Phys. 205 1 2005 1 23
12. S. Chandrasekaran, and M. Gu A fast and stable sower for recursively semi-separable systems of equations V. Olshevsky Proceedings of an AMS-IMS-SIAM Joint Summer Research Conference University of Colorado, Boulder, June 27-July 1, 1999 Structured Matrices in Mathematics, Computer Science, and Engineering, Contemporary Mathematics Volume II 2001 AMS Publications Providence, RI, U.S.A.
13. A. Dutt, and V. Rokhlin Fast Fourier transforms for nonequispaced data. II Appl. Comput. Harmon. Anal. 2 1 1995 85 100
14. M. Gu, and S.C. Eisenetat Efficient algorithms for computing a strong rank-revealing QR factorization SIAM J. Sci. Comput. 17 4 1996 848 869
15. H. Cheng, Z. Gimbutas, P.G. Martinsson, and V. Rokhlin On the compression of low-rank matrices SIAM J. Sci. Comp. 26 2005 1389 1404
16. G.H. Golub, and C.F. Van Loan Matrix Computations, Johns Hopkins Studies in the Mathematical Sciences Third Edition 1996 Johns Hopkins University Press Providence, RI, U.S.A.