The Lanczos algorithm and Hankel matrix factorization (Q1194514): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0024-3795(92)90022-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2072024724 / rank | |||
Normal rank | |||
Revision as of 23:53, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Lanczos algorithm and Hankel matrix factorization |
scientific article |
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
