Reorthogonalization for the Golub-Kahan-Lanczos bidiagonal reduction
From MaRDI portal
Publication:1955641
DOI10.1007/s00211-013-0518-8zbMath1272.65034OpenAlexW2056167745MaRDI QIDQ1955641
Publication date: 17 June 2013
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00211-013-0518-8
convergenceerror analysissingular valuesKrylov spacebidiagonalizationreorthogonalizationLanczos iterative methodGolub-Kahan-Lanczos (GKL) algorithm
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Eigenvalues, singular values, and eigenvectors (15A18) Orthogonalization in numerical linear algebra (65F25)
Related Items
The joint bidiagonalization process with partial reorthogonalization, The Joint Bidiagonalization Method for Large GSVD Computations in Finite Precision, A Preconditioned Hybrid SVD Method for Accurately Computing Singular Triplets of Large Matrices, Two projection methods for regularized total least squares approximation, Explicit deflation in Golub-Kahan-Lanczos bidiagonalization methods, Deflation for the Off-Diagonal Block in Symmetric Saddle Point Systems, The Joint Bidiagonalization of a Matrix Pair with Inaccurate Inner Iterations, Singular Value Decomposition Approximation via Kronecker Summations for Imaging Applications, Block Modified Gram--Schmidt Algorithms and Their Analysis, Band Generalization of the Golub--Kahan Bidiagonalization, Generalized Jacobi Matrices, and the Core Problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A bidiagonalization algorithm for solving large and sparse ill-posed systems of linear equations
- Tikhonov regularization of large linear problems
- A new stable bidiagonal reduction algorithm
- Accurate downdating of a modified Gram-Schmidt QR decomposition
- Improved Gram-Schmidt type downdating methods
- The regularizing effect of the Golub-Kahan iterative bidiagonalization and revealing the noise level in the data
- Generalized Golub--Kahan Bidiagonalization and Stopping Criteria
- Block and Parallel Versions of One-Sided Bidiagonalization
- A Useful Form of Unitary Matrix Obtained from Any Sequence of Unit 2-Norm n-Vectors
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- Loss and Recapture of Orthogonality in the Modified Gram–Schmidt Algorithm
- Reorthogonalization and Stable Algorithms for Updating the Gram-Schmidt QR Factorization
- Algorithms for the regularization of ill-conditioned least squares problems
- The Lanczos Algorithm with Selective Orthogonalization
- Matrices, Vector Spaces, and Information Retrieval
- Low-Rank Matrix Approximation Using the Lanczos Bidiagonalization Process with Applications
- Solving Generalized Least-Squares Problems with LSQR
- Accuracy and Stability of Numerical Algorithms
- Functions of Matrices
- Calculating the Singular Values and Pseudo-Inverse of a Matrix
