Computing the smallest singular triplets of a large matrix
From MaRDI portal
Publication:2211056
DOI10.1016/j.rinam.2019.100006zbMath1452.65065WikidataQ127845578 ScholiaQ127845578MaRDI QIDQ2211056
Publication date: 10 November 2020
Published in: Results in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.rinam.2019.100006
large sparse matrices; smallest singular values; restarted Krylov methods; inexact inversions; inner-outer methods
65F50: Computational methods for sparse matrices
65F15: Numerical computation of eigenvalues and eigenvectors of matrices
65F25: Orthogonalization in numerical linear algebra
Related Items
A compact heart iteration for low-rank approximations of large matrices, Computing interior eigenvalues of large sparse symmetric matrices
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- PRIMME
- A harmonic Lanczos bidiagonalization method for computing interior singular triplets of large matrices
- Fast inexact subspace iteration for generalized eigenvalue problems with spectral transformation
- Inexact inverse subspace iteration for generalized eigenvalue problems
- On extremum properties of orthogonal quotients matrices
- Restarted block Lanczos bidiagonalization methods
- The effects of inexact solvers in algorithms for symmetric eigenvalue problems
- An implicit restarted Lanczos method for large symmetric eigenvalue problems
- Inexact inverse iteration for generalized eigenvalue problems
- Inexact Rayleigh quotient-type methods for eigenvalue computations
- Computing smallest singular triplets with implicitly restarted Lanczos bidiagonalization
- Large sparse symmetric eigenvalue problems with homogeneous linear constraints: The Lanczos process with inner-outer iterations
- Computing singular values of large matrices with an inverse-free preconditioned Krylov subspace method
- An implicitly restarted block Lanczos bidiagonalization method using Leja shifts
- Rayleigh quotient iteration and simplified Jacobi-Davidson method with preconditioned iterative solves
- Inexact inverse iteration for symmetric matrices
- An implicitly restarted Lanczos bidiagonalization method with refined harmonic shifts for computing smallest singular triplets
- Thick-Restart Lanczos Method for Large Symmetric Eigenvalue Problems
- Matrix Algorithms
- Toward the Optimal Preconditioned Eigensolver: Locally Optimal Block Preconditioned Conjugate Gradient Method
- A Thick-Restart Lanczos Algorithm with Polynomial Filtering for Hermitian Eigenvalue Problems
- Fast Inexact Implicitly Restarted Arnoldi Method for Generalized Eigenvalue Problems with Spectral Transformation
- Adaptive Projection Subspace Dimension for the Thick-Restart Lanczos Method
- Numerical Methods for Large Eigenvalue Problems
- A Refined Harmonic Lanczos Bidiagonalization Method and an Implicitly Restarted Algorithm for Computing the Smallest Singular Triplets of Large Matrices
- A restarted Krylov method with inexact inversions
- A Preconditioned Hybrid SVD Method for Accurately Computing Singular Triplets of Large Matrices
- A tuned preconditioner for inexact inverse iteration applied to Hermitian eigenvalue problems
- Block Locally Optimal Preconditioned Eigenvalue Xolvers (BLOPEX) in Hypre and PETSc
- Convergence Analysis of Iterative Solvers in Inexact Rayleigh Quotient Iteration
- Shift-Invert Arnoldi's Method with Preconditioned Iterative Solves
- Matrix Analysis
- Inexact Newton Methods
- Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
- Numerical Linear Algebra for High-Performance Computers
- Iterative Solution Methods
- Inner and Outer Iterations for the Chebyshev Algorithm
- IRBL: An Implicitly Restarted Block-Lanczos Method for Large-Scale Hermitian Eigenproblems
- Theory of Inexact Krylov Subspace Methods and Applications to Scientific Computing
- An Implicitly Restarted Refined Bidiagonalization Lanczos Method for Computing a Partial Singular Value Decomposition
- A Jacobi--Davidson Iteration Method for Linear Eigenvalue Problems
- Inexact Krylov Subspace Methods for Linear Systems
- The convergence of harmonic Ritz values, harmonic Ritz vectors and refined harmonic Ritz vectors
- An Inverse Free Preconditioned Krylov Subspace Method for Symmetric Generalized Eigenvalue Problems
- Iterative Krylov Methods for Large Linear Systems
- On restarting the Arnoldi method for large nonsymmetric eigenvalue problems
- PRIMME_SVDS: A High-Performance Preconditioned SVD Solver for Accurate Large-Scale Computations
- The Matrix Eigenvalue Problem
- Computation of Smallest Eigenvalues using Spectral Schur Complements
- Augmented Implicitly Restarted Lanczos Bidiagonalization Methods
- Matrix theory. Basic results and techniques
