Reorthogonalization for the Golub-Kahan-Lanczos bidiagonal reduction
DOI10.1007/S00211-013-0518-8zbMATH Open1272.65034OpenAlexW2056167745MaRDI QIDQ1955641FDOQ1955641
Authors: Jesse L. Barlow 
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
Recommendations
- A new stable bidiagonal reduction algorithm
- More accurate bidiagonal reduction for computing the singular value decomposition
- Publication:4727287
- Condition numbers for Lanczos bidiagonalization with complete reorthogonalization
- An Implicitly Restarted Refined Bidiagonalization Lanczos Method for Computing a Partial Singular Value Decomposition
convergenceerror analysissingular valuesKrylov spacebidiagonalizationreorthogonalizationLanczos iterative methodGolub-Kahan-Lanczos (GKL) algorithm
Eigenvalues, singular values, and eigenvectors (15A18) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Orthogonalization in numerical linear algebra (65F25)
Cites Work
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- Functions of Matrices
- Reorthogonalization and Stable Algorithms for Updating the Gram-Schmidt QR Factorization
- Title not available (Why is that?)
- Calculating the Singular Values and Pseudo-Inverse of a Matrix
- Title not available (Why is that?)
- Accuracy and Stability of Numerical Algorithms
- Tikhonov regularization of large linear problems
- A bidiagonalization algorithm for solving large and sparse ill-posed systems of linear equations
- The regularizing effect of the Golub-Kahan iterative bidiagonalization and revealing the noise level in the data
- Low-Rank Matrix Approximation Using the Lanczos Bidiagonalization Process with Applications
- Algorithms for the regularization of ill-conditioned least squares problems
- A new stable bidiagonal reduction algorithm
- Matrices, Vector Spaces, and Information Retrieval
- Solving Generalized Least-Squares Problems with LSQR
- The Lanczos Algorithm with Selective Orthogonalization
- Loss and Recapture of Orthogonality in the Modified Gram–Schmidt Algorithm
- Accurate downdating of a modified Gram-Schmidt QR decomposition
- Improved Gram-Schmidt type downdating methods
- 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
Cited In (15)
- The joint bidiagonalization process with partial reorthogonalization
- Two projection methods for regularized total least squares approximation
- Generalized Golub-Kahan bidiagonalization and stopping criteria
- Condition numbers for Lanczos bidiagonalization with complete reorthogonalization
- Deflation for the Off-Diagonal Block in Symmetric Saddle Point Systems
- The Joint Bidiagonalization of a Matrix Pair with Inaccurate Inner Iterations
- Block Modified Gram--Schmidt Algorithms and Their Analysis
- The Joint Bidiagonalization Method for Large GSVD Computations in Finite Precision
- A Golub-Kahan-type reduction method for matrix pairs
- Singular value decomposition approximation via Kronecker summations for imaging applications
- Explicit deflation in Golub-Kahan-Lanczos bidiagonalization methods
- Weighted Golub-Kahan-Lanczos bidiagonalization algorithms
- Band generalization of the Golub-Kahan bidiagonalization, generalized Jacobi matrices, and the core problem
- Backward error analysis of the Lanczos bidiagonalization with reorthogonalization
- A preconditioned hybrid SVD method for accurately computing singular triplets of large matrices
Uses Software
This page was built for publication: Reorthogonalization for the Golub-Kahan-Lanczos bidiagonal reduction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1955641)
