The Lanczos algorithm and Hankel matrix factorization
From MaRDI portal
Publication:1194514
DOI10.1016/0024-3795(92)90022-3zbMath0754.65028OpenAlexW2072024724WikidataQ127609932 ScholiaQ127609932MaRDI QIDQ1194514
Franklin T. Luk, Tong J. Lee, Daniel L. Boley
Publication date: 27 September 1992
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(92)90022-3
fast algorithmsToeplitz matrixLanczos algorithmrecursion formulaeHankel matrix factorizationmatrix tridiagonalization
Factorization of matrices (15A23) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items
The Gauss quadrature for general linear functionals, Lanczos algorithm, and minimal partial realization ⋮ A fast method to diagonalize a Hankel matrix ⋮ Fast algorithms for Toeplitz and Hankel matrices ⋮ Krylov space methods on state-space control models
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Lanczos-Arnoldi algorithm and controllability
- The nonsymmetric Lanczos algorithm and controllability
- Parallel and superfast algorithms for Hankel systems of equations
- On the partial realization problem
- Nonsymmetric Lanczos and finding orthogonal polynomials associated with indefinite weights
- Modified moments for indefinite weight functions
- A simple Hankel interpretation of the Berlekamp-Massey algorithm
- Solution of linear equations with Hankel and Toeplitz matrices
- Fast Triangular Factorization and Inversion of Hermitian, Toeplitz, and Related Matrices with Arbitrary Rank Profile
- The Inverses of Block Hankel and Block Toeplitz Matrices
- A Look-Ahead Lanczos Algorithm for Unsymmetric Matrices
- On Generating Orthogonal Polynomials
- Algorithmic Fault Tolerance Using the Lanczos Method
- Reduction to Tridiagonal Form and Minimal Realizations
- A Completed Theory of the Unsymmetric Lanczos Process and Related Algorithms, Part I
- An Implementation of the Look-Ahead Lanczos Algorithm for Non-Hermitian Matrices
- An Algorithm for the Inversion of Finite Hankel Matrices
- Shift-register synthesis and BCH decoding
- The Triangular Decomposition of Hankel Matrices
- Algorithms for Triangular Decomposition of Block Hankel and Toeplitz Matrices with Application to Factoring Positive Matrix Polynomials