The Lanczos algorithm and Hankel matrix factorization (Q1194514)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The Lanczos algorithm and Hankel matrix factorization |
scientific article; zbMATH DE number 64484
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Lanczos algorithm and Hankel matrix factorization |
scientific article; zbMATH DE number 64484 |
Statements
The Lanczos algorithm and Hankel matrix factorization (English)
0 references
27 September 1992
0 references
The connection between the Lanczos algorithm for matrix tridiagonalization and fast algorithms for Hankel matrix factorization is studied. For this reason the Lanczos method for nonsymmetric matrices is discussed. Most Toeplitz solvers are based on the shift invariance of a Toeplitz matrix, and the authors note that many recursion formulae (although formulated under different guises) go all the way back to Chebyshev (1859).
0 references
Lanczos algorithm
0 references
matrix tridiagonalization
0 references
fast algorithms
0 references
Hankel matrix factorization
0 references
Toeplitz matrix
0 references
recursion formulae
0 references
0 references
0 references
