Analyzing vector orthogonalization algorithms
DOI10.1137/22M1519523zbMATH Open1539.65055MaRDI QIDQ6540314FDOQ6540314
Authors: Christopher C. Paige
Publication date: 15 May 2024
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Recommendations
- scientific article; zbMATH DE number 766216
- The Lanczos Algorithm With Partial Reorthogonalization
- Analysis of the symmetric Lanczos algorithm with reorthogonalization methods
- Rounding error analysis of the classical Gram-Schmidt orthogonalization process
- When does the Lanczos algorithm compute exactly?
sparse matricesconjugate gradientKrylov subspaceLanczos processvector orthogonalizationiterative solution of equationsfinite-precision
Computational methods for sparse matrices (65F50) Factorization of matrices (15A23) Roundoff error (65G50) Iterative numerical methods for linear systems (65F10) Orthogonalization in numerical linear algebra (65F25)
Cites Work
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- MINRES-QLP: a Krylov subspace method for indefinite or singular symmetric systems
- LSMR: An Iterative Algorithm for Sparse Least-Squares Problems
- Title not available (Why is that?)
- Calculating the Singular Values and Pseudo-Inverse of a Matrix
- Methods of conjugate gradients for solving linear systems
- Accuracy and Stability of Numerical Algorithms
- Solution of Sparse Indefinite Systems of Linear Equations
- Scaled total least squares fundamentals
- Improved backward error bounds for LU and Cholesky factorizations
- The Lanczos and conjugate gradient algorithms in finite precision arithmetic
- Error Analysis of the Lanczos Algorithm for Tridiagonalizing a Symmetric Matrix
- The Lanczos and Conjugate Gradient Algorithms
- Computational Variants of the Lanczos Method for the Eigenproblem
- Accuracy of the $s$-Step Lanczos Method for the Symmetric Eigenproblem in Finite Precision
- Krylov subspace methods. Principles and analysis.
- Solution of sparse rectangular systems using LSQR and Craig
- Modified Gram-Schmidt (MGS), Least Squares, and Backward Stability of MGS-GMRES
- Accuracy and effectiveness of the Lanczos algorithm for the symmetric eigenproblem
- Estimating the Attainable Accuracy of Recursively Computed Residual Methods
- Loss and Recapture of Orthogonality in the Modified Gram–Schmidt Algorithm
- Two Conjugate-Gradient-Type Methods for Unsymmetric Linear Equations
- A useful form of unitary matrix obtained from any sequence of unit 2-norm \(n\)-vectors
- Structure in loss of orthogonality
- Properties of a unitary matrix obtained from a sequence of normalized vectors
- An augmented stability result for the Lanczos Hermitian matrix tridiagonalization process
- Accuracy of the Lanczos process for the eigenproblem and solution of equations
- Numerical equivalences among Krylov subspace algorithms for skew-symmetric matrices
Cited In (1)
This page was built for publication: Analyzing vector orthogonalization algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6540314)