Hybrid iterative refined restarted Lanczos bidiagonalization methods
From MaRDI portal
Publication:2679823
DOI10.1007/s11075-022-01336-5zbMath1506.65060OpenAlexW4283829366MaRDI QIDQ2679823
Jennifer Picucci, Vasilije Perović, James Baglama
Publication date: 26 January 2023
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-022-01336-5
singular value decompositioniterative methodLanczos bidiagonalizationlarge-scale computationrefined Ritz
Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Eigenvalues, singular values, and eigenvectors (15A18)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A Krylov-Schur approach to the truncated SVD
- A thick-restarted block Arnoldi algorithm with modified Ritz vectors for large eigenproblems
- Generalizations of harmonic and refined Rayleigh-Ritz
- Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices
- Polynomial characterizations of the approximate eigenvectors by the refined Arnoldi method and an implicitly restarted refined Arnoldi algorithm
- Refined iterative algorithms based on Arnoldi's process for large unsymmetric eigenproblems
- Computing smallest singular triplets with implicitly restarted Lanczos bidiagonalization
- Principal component analysis.
- The refined harmonic Arnoldi method and an implicitly restarted refined algorithm for computing interior eigenpairs of large matrices
- Computing singular values of large matrices with an inverse-free preconditioned Krylov subspace method
- An implicitly restarted block Lanczos bidiagonalization method using Leja shifts
- Some theoretical comparisons of refined Ritz vectors and Ritz vectors
- Implicitly restarting the LSQR algorithm
- An implicitly restarted Lanczos bidiagonalization method with refined harmonic shifts for computing smallest singular triplets
- Harmonic and refined extraction methods for the singular value problem, with applications in least squares problems
- An analysis of the Rayleigh--Ritz method for approximating eigenspaces
- Thick-Restart Lanczos Method for Large Symmetric Eigenvalue Problems
- Matrix Algorithms
- The university of Florida sparse matrix collection
- 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
- Harmonic and refined Rayleigh–Ritz for the polynomial eigenvalue problem
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
- ARPACK Users' Guide
- An Implicitly Restarted Refined Bidiagonalization Lanczos Method for Computing a Partial Singular Value Decomposition
- The convergence of harmonic Ritz values, harmonic Ritz vectors and refined harmonic Ritz vectors
- On restarting the Arnoldi method for large nonsymmetric eigenvalue problems
- Hybrid Iterative Refined Method for Computing a Few Extreme Eigenpairs of a Symmetric Matrix
- A Golub--Kahan Davidson Method for Accurately Computing a Few Singular Triplets of Large Sparse Matrices
- PRIMME_SVDS: A High-Performance Preconditioned SVD Solver for Accurate Large-Scale Computations
- Calculating the Singular Values and Pseudo-Inverse of a Matrix
- Augmented Implicitly Restarted Lanczos Bidiagonalization Methods
This page was built for publication: Hybrid iterative refined restarted Lanczos bidiagonalization methods
