Computing smallest singular triplets with implicitly restarted Lanczos bidiagonalization
From MaRDI portal
Publication:1826601
DOI10.1016/j.apnum.2003.11.011zbMath1049.65027OpenAlexW1975109850WikidataQ56659518 ScholiaQ56659518MaRDI QIDQ1826601
C. Bekas, E. Kokiopoulou, Efstratios Gallopoulos
Publication date: 6 August 2004
Published in: Applied Numerical Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apnum.2003.11.011
singular value decompositionnumerical experimentsLanczos methoddeflationharmonic Ritz valuesimplicit restarts
Computational methods for sparse matrices (65F50) Numerical solutions to overdetermined systems, pseudoinverses (65F20)
Related Items
A Preconditioned Hybrid SVD Method for Accurately Computing Singular Triplets of Large Matrices ⋮ An implicitly restarted block Lanczos bidiagonalization method using Leja shifts ⋮ Mixed and componentwise condition numbers for a linear function of the solution of the total least squares problem ⋮ Restarted block Lanczos bidiagonalization methods ⋮ An augmented LSQR method ⋮ Inverse subspace problems with applications ⋮ Hybrid iterative refined restarted Lanczos bidiagonalization methods ⋮ Harmonic multi-symplectic Lanczos algorithm for quaternion singular triplets ⋮ A Krylov-Schur approach to the truncated SVD ⋮ Explicit deflation in Golub-Kahan-Lanczos bidiagonalization methods ⋮ A harmonic Lanczos bidiagonalization method for computing interior singular triplets of large matrices ⋮ Computing the smallest singular triplets of a large matrix ⋮ An implicitly restarted Lanczos bidiagonalization method with refined harmonic shifts for computing smallest singular triplets ⋮ PRIMME_SVDS: A High-Performance Preconditioned SVD Solver for Accurate Large-Scale Computations ⋮ On computing the minimum singular value of a tensor sum ⋮ On Inner Iterations of Jacobi--Davidson Type Methods for Large SVD Computations ⋮ Harmonic and refined extraction methods for the singular value problem, with applications in least squares problems ⋮ Subspace Iteration Randomization and Singular Value Problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An algorithm for computing the distance to uncontrollability
- Rational Krylov algorithms for nonsymmetric eigenvalue problems. II: Matrix pairs
- An implicit restarted Lanczos method for large symmetric eigenvalue problems
- An implicit shift bidiagonalization algorithm for ill-posed systems
- Refined iterative algorithms based on Arnoldi's process for large unsymmetric eigenproblems
- Parallel computation of spectral portrait of large matrices by Davidson type methods
- Eigenvalue computation in the 20th century
- The trace minimization method for the symmetric generalized eigenvalue problem
- Computing the field of values and pseudospectra using the Lanczos method with continuation
- A parallel Lanczos method for symmetric generalized eigenvalue problems
- Harmonic and refined extraction methods for the singular value problem, with applications in least squares problems
- Methods for Large Scale Total Least Squares Problems
- Matrix Algorithms
- Large-Scale Computation of Pseudospectra Using ARPACK and Eigs
- A Jacobi--Davidson Type SVD Method
- The Lanczos Algorithm With Partial Reorthogonalization
- A Lanczos Algorithm for Computing Singular Values and Vectors of Large Matrices
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
- Jacobi--Davidson Style QR and QZ Algorithms for the Reduction of Matrix Pencils
- ARPACK Users' Guide
- IRBL: An Implicitly Restarted Block-Lanczos Method for Large-Scale Hermitian Eigenproblems
- An Implicitly Restarted Refined Bidiagonalization Lanczos Method for Computing a Partial Singular Value Decomposition
- A Jacobi--Davidson Iteration Method for Linear Eigenvalue Problems
- Implicitly Restarted GMRES and Arnoldi Methods for Nonsymmetric Systems of Equations
- Low-Rank Matrix Approximation Using the Lanczos Bidiagonalization Process with Applications
- Templates for the Solution of Algebraic Eigenvalue Problems
- Deflation Techniques for an Implicitly Restarted Arnoldi Iteration
- Lanczos Algorithms for Large Symmetric Eigenvalue Computations
- Approximate solutions and eigenvalue bounds from Krylov subspaces
- Calculating the Singular Values and Pseudo-Inverse of a Matrix
- Parallel computation of pseudospectra of large sparse matrices
