Analyzing vector orthogonalization algorithms

DOI10.1137/22M1519523MaRDI QIDQ6540314zbMATH OpenFDO

Authors Christopher C. Paige

Publication date 15 May 2024

Published in SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

sparse matricesconjugate gradientKrylov subspaceLanczos processvector orthogonalizationiterative solution of equationsfinite-precision

Mathematics Subject Classification ID

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)

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?

Cites work

• scientific article; zbMATH DE number 6159604 (Why is no real title available?)
• A useful form of unitary matrix obtained from any sequence of unit 2-norm \(n\)-vectors
• Accuracy and Stability of Numerical Algorithms
• Accuracy and effectiveness of the Lanczos algorithm for the symmetric eigenproblem
• Accuracy of the $s$-Step Lanczos Method for the Symmetric Eigenproblem in Finite Precision
• Accuracy of the Lanczos process for the eigenproblem and solution of equations
• An augmented stability result for the Lanczos Hermitian matrix tridiagonalization process
• Calculating the Singular Values and Pseudo-Inverse of a Matrix
• Computational Variants of the Lanczos Method for the Eigenproblem
• Error Analysis of the Lanczos Algorithm for Tridiagonalizing a Symmetric Matrix
• Estimating the Attainable Accuracy of Recursively Computed Residual Methods
• Improved backward error bounds for LU and Cholesky factorizations
• Krylov subspace methods. Principles and analysis.
• LSMR: An Iterative Algorithm for Sparse Least-Squares Problems
• LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
• Loss and Recapture of Orthogonality in the Modified Gram–Schmidt Algorithm
• MINRES-QLP: a Krylov subspace method for indefinite or singular symmetric systems
• Methods of conjugate gradients for solving linear systems
• Modified Gram-Schmidt (MGS), Least Squares, and Backward Stability of MGS-GMRES
• Numerical equivalences among Krylov subspace algorithms for skew-symmetric matrices
• Properties of a unitary matrix obtained from a sequence of normalized vectors
• Scaled total least squares fundamentals
• Solution of Sparse Indefinite Systems of Linear Equations
• Solution of sparse rectangular systems using LSQR and Craig
• Structure in loss of orthogonality
• The Lanczos and Conjugate Gradient Algorithms
• The Lanczos and conjugate gradient algorithms in finite precision arithmetic
• Two Conjugate-Gradient-Type Methods for Unsymmetric Linear Equations

Cited in

(1)

• Backward error analysis of the Lanczos bidiagonalization with reorthogonalization

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)