Error bounds in the isometric Arnoldi process (Q1378993)
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 1115925
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Error bounds in the isometric Arnoldi process |
scientific article; zbMATH DE number 1115925 |
Statements
Error bounds in the isometric Arnoldi process (English)
0 references
2 September 1998
0 references
An Arnoldi algorithm is applied to a large and sparse unitary matrix. The last column of the Hessenberg matrix is modified in each step, to give a unitary Hessenberg matrix whose eigenvalues interlace those of the original matrix on the unit circle in the complex plane. Error bounds are studied, and it is shown how to do the column modification to get approximations as close to those of the original matrix as possible. Several numerical examples, coming from the analysis of perturbed periodic signals, are included.
0 references
Arnoldi algorithm
0 references
sparse unitary matrix
0 references
Hessenberg matrix
0 references
error bounds
0 references
numerical examples
0 references
0.784537672996521
0 references
0.7697373628616333
0 references
