Transformation techniques for Toeplitz and Toeplitz-plus-Hankel matrices. I. Transformations

Linear Algebra and Its Applications

Volumn 254, Issue 1-3, 1997, Pages 193-226

  Heinig, Georg ^a   Bojanczyk, Adam ^b  

^a KUWAIT UNIVERSITY   (Kuwait)

^b School of Operations Research and Industrial Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0011556965     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0024-3795(96)00527-7     Document Type: Article

References (28)

1. G. Sansigre and M. Alvarez, On Bezoutian reduction with the Vandermonde matrix, Linear Algebra Appl. 121:401-408 (1989).
2. E. Boman and I. Koltracht, Fast transform based preconditioners for Toeplitz matrices, SIAM J. Matrix Anal. Appl 16 (1995).
3. E. Bozzo and C. di Fiore, On the use of certain matrix algebras associated with discrete trigonometric transforms in matrix displacement decomposition, SIAM J. Matrix Anal. Appl. 16:312-326 (1995).
4. D. Bini and V. Pan, Polynomial and Matrix Computations, Vol. 1, Fundamental Algorithms, Birkhäuser, Boston, 1994.
5. S. Cabay and R. Meleshko, A weakly stable algorithm for Padé approximation and the inversion of Hankel matrices, SIAM J. Matrix Anal. Appl. 14:735-765 (1993).
6. T. Chan and P. Hansen, A look-ahead Levinson algorithm for indefinite Toeplitz systems, SIAM J. Matrix Anal. Appl. 13(2): 1079-1090 (1992).
7. W. F. Donoghue, Monotone Matrix Functions and Analytic Continuation, Springer-Verlag, New York, 1974.
8. M. Fiedler, Hankel and Loewner matrices, Linear Algebra Appl. 58:75-95 (1984).
9. I. Gohberg and V. Olshevsky, Circulants, displacements and decompositions of matrices, Integral Equations Operator Theory 15:730-743 (1992).
10. I. Gohberg, I. Koltracht, and P. Lancaster, Efficient solution of linear systems of equations with recursive structure, Linear Algebra Appl. 80:81-113 (1986).
11. I. Gohberg, T. Kailath, I. Koltracht, and P. Lancaster, Linear complexity parallel algorithms for linear systems of equations with recursive structure, Linear Algebra Appl. 88/99:271-316 (1987).
12. I. Gohberg, T. Kailath, and V. Olshevsky, Fast Gaussian elimination with partial pivoting for matrices with displacement structure, Math. Comp. 64:1557-1576 (1995).
13. M. Gutknecht, Stable row recurrences for the Padé table and generically super-fast look-ahead solvers for non-Hermitian Toeplitz systems, Linear Algebra Appl. 188/199:351-422 (1993).
14. G. Heinig, Inversion of generalized Cauchy matrices and other classes of structured matrices, in Linear Algebra in Signal Processing (A. Bojanczyk and G. Cybenko, Eds.), IMA Vol. Math. Appl. 69, Springer-Berlag, 1994, pp. 63-82.
15. G. Heinig, Inversion of Toeplitz-like matrices via generalized Cauchy matrices and rational interpolation, in Systems and Network: Mathematical Theory and Applications, Vol. 2, Akademie Verlag, Berlin, 1994, pp. 707-711.
16. G. Heinig and K. Rost, Algebraic Methods for Toeplitz-like Matrices and Operators, Birkhäuser, Boston, 1984.
17. T. Huckle, Some aspects of circulant preconditioners, SIAM J. Sci. Statist. Comput. 14:531-541 (1993).
18. T. Huckle, Cauchy matrices and iterative methods for Toeplitz matrices, Proc. SPIE 2563:281-292 (1995).
19. I. S. Iohvidov, Toeplitz and Hankel Matrices and Forms, Birkhäuser, Basel, 1982.
20. T. Kailath and A. Sayed, Displacement structure: Theory and applications, SIAM Rev. 37(3):297-386 (1995).
21. W. Press, B. Flannery, S. Teukolsky, and W. Vetterling, Numerical Recipes. The Art of Scientific Computing, Cambridge U.P., 1996.
22. K. R. Rao and P. Yip, Discrete Cosine Transform: Algorithms, Advantages, and Applications, Academic, Boston, 1990.
23. H. Sorensen, D. Jones, M. Heidman, and C. Burrus, Real-valued fast Fourier transform algorithms, Signal Process. 6:267-278 (1984).
24. G. Steidl and M. Tasche, A polynomial approach to fast algorithms for discrete Fourier-cosine and Fourier-sine transforms, Math. Comp. 56(193):281-296 (1991).
25. M. Tasche, Fast algorithms for discrete Chebyshev-Vandermonde transforms and applications, Numer. Algorithms 5:453-464 (1993).
26. M. Tismenetsky, A decomposition of Toeplitz matrices and optimal circulant preconditioning, Linear Algebra Appl. 154-156:105-121 (1991).
27. E. E. Tyrtyshnikow, Optimal and superoptimal circulant preconditioners, SIAM J. Matrix Anal. Appl. 13:459-473 (1992).
28. C. Van Loan, Computational Framework for the Fast Fourier Transform, SIAM, Philadelphia, 1992.