Two harmonic Jacobi-Davidson methods for computing a partial generalized singular value decomposition of a large matrix pair
DOI10.1007/s10915-022-01993-7zbMath1502.65014arXiv2201.02903OpenAlexW4226113869WikidataQ114225510 ScholiaQ114225510MaRDI QIDQ2676809
Publication date: 28 September 2022
Published in: Journal of Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2201.02903
generalized singular value decompositionharmonic extractiongeneralized singular valuegeneralized singular vectorJacobi-Davidson type methodstandard extraction
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Eigenvalues, singular values, and eigenvectors (15A18)
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Inner iterations in the shift-invert residual Arnoldi method and the Jacobi-Davidson method
- Randomized anisotropic transform for nonlinear dimensionality reduction
- The generalized singular value decomposition and the general (A-\(\lambda\) B)-problem
- The joint bidiagonalization process with partial reorthogonalization
- A Jacobi-Davidson type method for the generalized singular value problem
- Singular value and generalized singular value decompositions and the solution of linear matrix equations
- The refined harmonic Arnoldi method and an implicitly restarted refined algorithm for computing interior eigenpairs of large matrices
- Computing the generalized singular values/vectors of large sparse or structured matrix pairs
- On choices of formulations of computing the generalized singular value decomposition of a large matrix pair
- A joint bidiagonalization based iterative algorithm for large scale general-form Tikhonov regularization
- Harmonic and refined harmonic shift-invert residual Arnoldi and Jacobi-Davidson methods for interior eigenvalue problems
- Some theoretical comparisons of refined Ritz vectors and Ritz vectors
- Diffusion maps
- Harmonic and refined extraction methods for the singular value problem, with applications in least squares problems
- Matrix Algorithms
- The university of Florida sparse matrix collection
- A Refined Harmonic Lanczos Bidiagonalization Method and an Implicitly Restarted Algorithm for Computing the Smallest Singular Triplets of Large Matrices
- A Preconditioned Hybrid SVD Method for Accurately Computing Singular Triplets of Large Matrices
- Harmonic and refined Rayleigh–Ritz for the polynomial eigenvalue problem
- The Generalized Singular Value Decomposition and the Method of Particular Solutions
- Towards a Generalized Singular Value Decomposition
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- Generalizing the Singular Value Decomposition
- A Tangent Algorithm for Computing the Generalized Singular Value Decomposition
- Dynamic Thick Restarting of the Davidson, and the Implicitly Restarted Arnoldi Methods
- Templates for the Solution of Algebraic Eigenvalue Problems
- Geometric diffusions as a tool for harmonic analysis and structure definition of data: Multiscale methods
- The convergence of harmonic Ritz values, harmonic Ritz vectors and refined harmonic Ritz vectors
- Harmonic projection methods for large non-symmetric eigenvalue problems
- On Inner Iterations of Jacobi--Davidson Type Methods for Large SVD Computations
- PRIMME_SVDS: A High-Performance Preconditioned SVD Solver for Accurate Large-Scale Computations
- A Projection‐Based Approach to General‐Form Tikhonov Regularization
This page was built for publication: Two harmonic Jacobi-Davidson methods for computing a partial generalized singular value decomposition of a large matrix pair
