Restarted block Lanczos bidiagonalization methods
From MaRDI portal
Recommendations
- Augmented Implicitly Restarted Lanczos Bidiagonalization Methods
- Hybrid iterative refined restarted Lanczos bidiagonalization methods
- An Implicitly Restarted Refined Bidiagonalization Lanczos Method for Computing a Partial Singular Value Decomposition
- Computing smallest singular triplets with implicitly restarted Lanczos bidiagonalization
- An implicitly restarted block Lanczos bidiagonalization method using Leja shifts
Cites work
- scientific article; zbMATH DE number 4199465 (Why is no real title available?)
- scientific article; zbMATH DE number 852536 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- A Block Lanczos Method for Computing the Singular Values and Corresponding Singular Vectors of a Matrix
- A Jacobi--Davidson type SVD method
- An Implicitly Restarted Refined Bidiagonalization Lanczos Method for Computing a Partial Singular Value Decomposition
- An implicit shift bidiagonalization algorithm for ill-posed systems
- Approximate solutions and eigenvalue bounds from Krylov subspaces
- Augmented Implicitly Restarted Lanczos Bidiagonalization Methods
- Computing interior eigenvalues of large matrices
- Computing smallest singular triplets with implicitly restarted Lanczos bidiagonalization
- Harmonic and refined extraction methods for the singular value problem, with applications in least squares problems
- IRBL: An Implicitly Restarted Block-Lanczos Method for Large-Scale Hermitian Eigenproblems
- Implicitly restarted Arnoldi methods and subspace iteration
- Low-Rank Matrix Approximation Using the Lanczos Bidiagonalization Process with Applications
- Numerical methods for large eigenvalue problems
- Restarted block-GMRES with deflation of eigenvalues
- Thick-restart Lanczos method for large symmetric eigenvalue problems
- Using Linear Algebra for Intelligent Information Retrieval
Cited in
(33)- The minimal-norm Gauss-Newton method and some of its regularized variants
- An implicitly restarted Lanczos bidiagonalization method with refined harmonic shifts for computing smallest singular triplets
- Analysis of directed networks via partial singular value decomposition and Gauss quadrature
- Augmented Implicitly Restarted Lanczos Bidiagonalization Methods
- Structural Convergence Results for Approximation of Dominant Subspaces from Block Krylov Spaces
- Eigenvalue Characterization and Computation for the Laplacian on General 2-D Domains
- A harmonic Lanczos bidiagonalization method for computing interior singular triplets of large matrices
- Two refined Lanczos algorithms for computing the largest/smallest singular values and associated singular vectors of a large matrix
- GCV for Tikhonov regularization by partial SVD
- Computing the smallest singular triplets of a large matrix
- A compact heart iteration for low-rank approximations of large matrices
- On the computation of a truncated SVD of a large linear discrete ill-posed problem
- scientific article; zbMATH DE number 782066 (Why is no real title available?)
- na26
- Split-and-combine singular value decomposition for large-scale matrix
- A cross-product approach for low-rank approximations of large matrices
- Augmented block Householder Arnoldi method
- Explicit deflation in Golub-Kahan-Lanczos bidiagonalization methods
- An implicitly restarted block Lanczos bidiagonalization method using Leja shifts
- Non-monotone algorithm for minimization on arbitrary domains with applications to large-scale orthogonal Procrustes problem
- Hybrid iterative refined restarted Lanczos bidiagonalization methods
- An implicitly restarted bidiagonal Lanczos method for large-scale singular value problems
- scientific article; zbMATH DE number 6860845 (Why is no real title available?)
- Projected Tikhonov regularization of large-scale discrete ill-posed problems
- An augmented LSQR method
- Fast computation of convolution operations via low-rank approximation
- A Golub-Kahan Davidson method for accurately computing a few singular triplets of large sparse matrices
- scientific article; zbMATH DE number 782058 (Why is no real title available?)
- Probabilistic upper bounds for the matrix two-norm
- Stable Computation of Generalized Matrix Functions via Polynomial Interpolation
- A preconditioned hybrid SVD method for accurately computing singular triplets of large matrices
- PRIMME\_SVDS: a high-performance preconditioned SVD solver for accurate large-scale computations
- Dealing with linear dependence during the iterations of the restarted block Lanczos methods
This page was built for publication: Restarted block Lanczos bidiagonalization methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q870765)
