Restarted block Lanczos bidiagonalization methods
From MaRDI portal
Publication:870765
DOI10.1007/S11075-006-9057-ZzbMATH Open1110.65027OpenAlexW2047811252MaRDI QIDQ870765FDOQ870765
Authors: James Baglama, Lothar Reichel 
Publication date: 15 March 2007
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-006-9057-z
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
Krylov subspacesnumerical examplessingular vectorspartial singular value decompositionaugmentationRitz vectorsimplicit shiftsrestarted iterative method
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical solutions to overdetermined systems, pseudoinverses (65F20)
Cites Work
- IRBL: An Implicitly Restarted Block-Lanczos Method for Large-Scale Hermitian Eigenproblems
- Title not available (Why is that?)
- Computing interior eigenvalues of large matrices
- Augmented Implicitly Restarted Lanczos Bidiagonalization Methods
- Harmonic and refined extraction methods for the singular value problem, with applications in least squares problems
- An Implicitly Restarted Refined Bidiagonalization Lanczos Method for Computing a Partial Singular Value Decomposition
- Title not available (Why is that?)
- Thick-restart Lanczos method for large symmetric eigenvalue problems
- Approximate solutions and eigenvalue bounds from Krylov subspaces
- Restarted block-GMRES with deflation of eigenvalues
- Title not available (Why is that?)
- Using Linear Algebra for Intelligent Information Retrieval
- Computing smallest singular triplets with implicitly restarted Lanczos bidiagonalization
- A Jacobi--Davidson type SVD method
- Implicitly restarted Arnoldi methods and subspace iteration
- Low-Rank Matrix Approximation Using the Lanczos Bidiagonalization Process with Applications
- A Block Lanczos Method for Computing the Singular Values and Corresponding Singular Vectors of a Matrix
- Numerical methods for large eigenvalue problems
- An implicit shift bidiagonalization algorithm for ill-posed systems
Cited In (33)
- An implicitly restarted Lanczos bidiagonalization method with refined harmonic shifts for computing smallest singular triplets
- The minimal-norm Gauss-Newton method and some of its regularized variants
- 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
- Two refined Lanczos algorithms for computing the largest/smallest singular values and associated singular vectors of a large matrix
- A harmonic Lanczos bidiagonalization method for computing interior singular triplets of large matrices
- GCV for Tikhonov regularization by partial SVD
- A compact heart iteration for low-rank approximations of large matrices
- Computing the smallest singular triplets of a large matrix
- On the computation of a truncated SVD of a large linear discrete ill-posed problem
- Title not available (Why is that?)
- Split-and-combine singular value decomposition for large-scale matrix
- A cross-product approach for low-rank approximations of large matrices
- Explicit deflation in Golub-Kahan-Lanczos bidiagonalization methods
- na26
- Augmented block Householder Arnoldi method
- 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
- Title not available (Why is that?)
- An implicitly restarted bidiagonal Lanczos method for large-scale singular value problems
- 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
- Title not available (Why is that?)
- 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
Uses Software
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)
