PRIMME_SVDS: A High-Performance Preconditioned SVD Solver for Accurate Large-Scale Computations
From MaRDI portal
Publication:5372627
DOI10.1137/16M1082214zbMath1392.65100arXiv1607.01404MaRDI QIDQ5372627
Andreas Stathopoulos, Eloy Romero, Lingfei Wu
Publication date: 27 October 2017
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1607.01404
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Eigenvalues, singular values, and eigenvectors (15A18) Packaged methods for numerical algorithms (65Y15)
Related Items
Periodically driven perturbed CFTs: the sine-Gordon model, Estimating the trace of the matrix inverse by interpolating from the diagonal of an approximate inverse, A Robust Algebraic Multilevel Domain Decomposition Preconditioner for Sparse Symmetric Positive Definite Matrices, A multigrid accelerated eigensolver for the Hermitian Wilson-Dirac operator in lattice QCD, A compact heart iteration for low-rank approximations of large matrices, Two harmonic Jacobi-Davidson methods for computing a partial generalized singular value decomposition of a large matrix pair, Hybrid iterative refined restarted Lanczos bidiagonalization methods, Optimizing shift selection in multilevel Monte Carlo for disconnected diagrams in lattice QCD, Explicit deflation in Golub-Kahan-Lanczos bidiagonalization methods, Computing the smallest singular triplets of a large matrix, Sketching for Principal Component Regression, TRPL+K: Thick-Restart Preconditioned Lanczos+K Method for Large Symmetric Eigenvalue Problems, Approaching the self-dual point of the sinh-Gordon model, Sharp error bounds for Ritz vectors and approximate singular vectors, A cross-product approach for low-rank approximations of large matrices, PRIMME_SVDS, On Inner Iterations of Jacobi--Davidson Type Methods for Large SVD Computations, A Golub--Kahan Davidson Method for Accurately Computing a Few Singular Triplets of Large Sparse Matrices
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
- PRIMME
- An Analysis of the Total Least Squares Problem
- Computing interior eigenvalues of large matrices
- A robust and efficient parallel SVD solver based on restarted Lanczos bidiagonalization
- Restarted block Lanczos bidiagonalization methods
- \textit{BoomerAMG}: A parallel algebraic multigrid solver and preconditioner
- Computation of the fundamental singular subspace of a large matrix
- Refined iterative algorithms based on Arnoldi's process for large unsymmetric eigenproblems
- Estimating the trace of the matrix inverse by interpolating from the diagonal of an approximate inverse
- Computing smallest singular triplets with implicitly restarted Lanczos bidiagonalization
- Principal component analysis.
- Computing singular values of large matrices with an inverse-free preconditioned Krylov subspace method
- An implicitly restarted block Lanczos bidiagonalization method using Leja shifts
- Harmonic and refined extraction methods for the singular value problem, with applications in least squares problems
- Matrix Algorithms
- A Jacobi--Davidson Type SVD Method
- A Refined Harmonic Lanczos Bidiagonalization Method and an Implicitly Restarted Algorithm for Computing the Smallest Singular Triplets of Large Matrices
- Improving the Accuracy of Computed Singular Values
- A Preconditioned Hybrid SVD Method for Accurately Computing Singular Triplets of Large Matrices
- SLEPc
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- A Lanczos Algorithm for Computing Singular Values and Vectors of Large Matrices
- ARPACK Users' Guide
- An Implicitly Restarted Refined Bidiagonalization Lanczos Method for Computing a Partial Singular Value Decomposition
- A Case for a Biorthogonal Jacobi--Davidson Method: Restarting and Correction Equation
- An Inverse Free Preconditioned Krylov Subspace Method for Symmetric Generalized Eigenvalue Problems
- Harmonic projection methods for large non-symmetric eigenvalue problems
- Spectral condition‐number estimation of large sparse matrices
- Nearly Optimal Preconditioned Methods for Hermitian Eigenproblems under Limited Memory. Part I: Seeking One Eigenvalue
- Calculating the Singular Values and Pseudo-Inverse of a Matrix
- Augmented Implicitly Restarted Lanczos Bidiagonalization Methods
