Reorthogonalization for the Golub-Kahan-Lanczos bidiagonal reduction
From MaRDI portal
Publication:1955641
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
Cites work
- scientific article; zbMATH DE number 1049353 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- A bidiagonalization algorithm for solving large and sparse ill-posed systems of linear equations
- A new stable bidiagonal reduction algorithm
- A useful form of unitary matrix obtained from any sequence of unit 2-norm \(n\)-vectors
- Accuracy and Stability of Numerical Algorithms
- Accurate downdating of a modified Gram-Schmidt QR decomposition
- Algorithms for the regularization of ill-conditioned least squares problems
- Block and Parallel Versions of One-Sided Bidiagonalization
- Calculating the Singular Values and Pseudo-Inverse of a Matrix
- Functions of Matrices
- Generalized Golub-Kahan bidiagonalization and stopping criteria
- Improved Gram-Schmidt type downdating methods
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- Loss and Recapture of Orthogonality in the Modified Gram–Schmidt Algorithm
- Low-Rank Matrix Approximation Using the Lanczos Bidiagonalization Process with Applications
- Matrices, Vector Spaces, and Information Retrieval
- Reorthogonalization and Stable Algorithms for Updating the Gram-Schmidt QR Factorization
- Solving Generalized Least-Squares Problems with LSQR
- The Lanczos Algorithm with Selective Orthogonalization
- The regularizing effect of the Golub-Kahan iterative bidiagonalization and revealing the noise level in the data
- Tikhonov regularization of large linear problems
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
- Block Modified Gram--Schmidt Algorithms and Their Analysis
- A Golub-Kahan-type reduction method for matrix pairs
- Deflation for the Off-Diagonal Block in Symmetric Saddle Point Systems
- The Joint Bidiagonalization of a Matrix Pair with Inaccurate Inner Iterations
- The Joint Bidiagonalization Method for Large GSVD Computations in Finite Precision
- Singular value decomposition approximation via Kronecker summations for imaging applications
- Weighted Golub-Kahan-Lanczos bidiagonalization algorithms
- Explicit deflation in Golub-Kahan-Lanczos bidiagonalization methods
- 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
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)
