A generalized isometric Arnoldi algorithm
Suppose \(A\) is an isometry on a Hilbert space. The author shows that the isometric Arnoldi algorithm yields a sequence of matrices \(M_{j}\) and can be interpreted as a structured form of a modified Gram-Schmidt process. The algorithm is described in terms of projections and inner products. Numerical experiments suggest that compared to a generalized Schur algorithm, the new one improves the numerical orthogonality of the sequence. Contents: Introduction; A general form of the isometric Arnoldi algorithm; Krylov-like sequences; Orthogonality relations; The factored algorithm; Computing QR factorization; Preliminary numerical experiments; Additional topics.
- Positive definite Toeplitz matrices, the Arnoldi process for isometric operators, and Gaussian quadrature on the unit circle
- Error bounds in the isometric Arnoldi process
- The Arnoldi process, short recursions, and displacement ranks
- scientific article; zbMATH DE number 440665
- Convergence of the Isometric Arnoldi Process
- A fast minimal residual algorithm for shifted unitary matrices
- Accuracy and Stability of Numerical Algorithms
- Fast projection methods for minimal design problems in linear system theory
- Generalized Displacement Structure for Block-Toeplitz, Toeplitz-Block, and Toeplitz-Derived Matrices
- scientific article; zbMATH DE number 3883507 (Why is no real title available?)
- Positive definite Toeplitz matrices, the Arnoldi process for isometric operators, and Gaussian quadrature on the unit circle
- The numerical stability of the lattice algorithm for least squares linear prediction problems
- The QR algorithm for unitary Hessenberg matrices
This page was built for publication: A generalized isometric Arnoldi algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q880025)