Generalized biorthogonal bases and tridiagonalisation of matrices (Q1365846)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1058837
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Generalized biorthogonal bases and tridiagonalisation of matrices |
scientific article; zbMATH DE number 1058837 |
Statements
Generalized biorthogonal bases and tridiagonalisation of matrices (English)
0 references
9 September 1997
0 references
A minimal Lanczos algorithm is constructed. It computes a block tridiagonal Hessenberg matrix with diagonal blocks of Frobenius form and nondiagonal blocks with a single nonzero number. It needs storage of fewer basis vectors than previous implementations of look ahead. The theory is based on the equivalence between the nonsymmetric Lanczos algorithm with look ahead and biorthogonal Gram Schmidt. Relations to minimal realizations of rational functions are discussed.
0 references
minimal Lanczos algorithm
0 references
tridiagonal Hessenberg matrix
0 references
biorthogonal Gram Schmidt
0 references
minimal realizations of rational functions
0 references
0.7856398820877075
0 references
0.780236005783081
0 references
0.7801824808120728
0 references