Two harmonic Jacobi-Davidson methods for computing a partial generalized singular value decomposition of a large matrix pair
From MaRDI portal
Publication:2676809
Abstract: Two harmonic extraction based Jacobi--Davidson (JD) type algorithms are proposed to compute a partial generalized singular value decomposition (GSVD) of a large regular matrix pair. They are called cross product-free (CPF) and inverse-free (IF) harmonic JDGSVD algorithms, abbreviated as CPF-HJDGSVD and IF-HJDGSVD, respectively. Compared with the standard extraction based JDGSVD algorithm, the harmonic extraction based algorithms converge more regularly and suit better for computing GSVD components corresponding to interior generalized singular values. Thick-restart CPF-HJDGSVD and IF-HJDGSVD algorithms with some deflation and purgation techniques are developed to compute more than one GSVD components. Numerical experiments confirm the superiority of CPF-HJDGSVD and IF-HJDGSVD to the standard extraction based JDGSVD algorithm.
Recommendations
- A cross-product free Jacobi-Davidson type method for computing a partial generalized singular value decomposition of a large matrix pair
- A Jacobi-Davidson type method for the generalized singular value problem
- A Jacobi--Davidson type SVD method
- scientific article; zbMATH DE number 4143344
- On inner iterations of Jacobi-Davidson type methods for large SVD computations
Cites work
- scientific article; zbMATH DE number 47363 (Why is no real title available?)
- scientific article; zbMATH DE number 1953444 (Why is no real title available?)
- scientific article; zbMATH DE number 852536 (Why is no real title available?)
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- A Jacobi-Davidson type method for the generalized singular value problem
- A Projection‐Based Approach to General‐Form Tikhonov Regularization
- A Tangent Algorithm for Computing the Generalized Singular Value Decomposition
- A joint bidiagonalization based iterative algorithm for large scale general-form Tikhonov regularization
- A preconditioned hybrid SVD method for accurately computing singular triplets of large matrices
- A refined harmonic Lanczos bidiagonalization method and an implicitly restarted algorithm for computing the smallest singular triplets of large matrices
- Computational methods for large eigenvalue problems
- Computing the generalized singular values/vectors of large sparse or structured matrix pairs
- Diffusion maps
- Dynamic Thick Restarting of the Davidson, and the Implicitly Restarted Arnoldi Methods
- Generalizing the Singular Value Decomposition
- Geometric diffusions as a tool for harmonic analysis and structure definition of data: multiscale methods
- Harmonic and refined Rayleigh-Ritz for the polynomial eigenvalue problem
- Harmonic and refined extraction methods for the singular value problem, with applications in least squares problems
- Harmonic and refined harmonic shift-invert residual Arnoldi and Jacobi-Davidson methods for interior eigenvalue problems
- Harmonic projection methods for large non-symmetric eigenvalue problems
- Inner iterations in the shift-invert residual Arnoldi method and the Jacobi-Davidson method
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- Matrix algorithms. Vol. 2: Eigensystems
- On choices of formulations of computing the generalized singular value decomposition of a large matrix pair
- 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
- Randomized anisotropic transform for nonlinear dimensionality reduction
- Singular value and generalized singular value decompositions and the solution of linear matrix equations
- Some theoretical comparisons of refined Ritz vectors and Ritz vectors
- Templates for the Solution of Algebraic Eigenvalue Problems
- The Generalized Singular Value Decomposition and the Method of Particular Solutions
- The University of Florida sparse matrix collection
- The convergence of harmonic Ritz values, harmonic Ritz vectors and refined harmonic Ritz vectors
- The generalized singular value decomposition and the general (A- B)-problem
- The joint bidiagonalization process with partial reorthogonalization
- The refined harmonic Arnoldi method and an implicitly restarted refined algorithm for computing interior eigenpairs of large matrices
- Towards a Generalized Singular Value Decomposition
Cited in
(11)- The joint bidiagonalization process with partial reorthogonalization
- Thick-restarted joint Lanczos bidiagonalization for the GSVD
- A CJ-FEAST GSVDsolver for computing a partial gsvd of a large matrix pair with the generalized singular values in a given interval
- Characterizing GSVD by singular value expansion of linear operators and its computation
- Refined and refined harmonic Jacobi-Davidson methods for computing several GSVD components of a large regular matrix pair
- On choices of formulations of computing the generalized singular value decomposition of a large matrix pair
- The Joint Bidiagonalization Method for Large GSVD Computations in Finite Precision
- Randomized GCUR decompositions
- On inner iterations of Jacobi-Davidson type methods for large SVD computations
- A Jacobi-Davidson type method for the generalized singular value problem
- A cross-product free Jacobi-Davidson type method for computing a partial generalized singular value decomposition of a large matrix pair
This page was built for publication: Two harmonic Jacobi-Davidson methods for computing a partial generalized singular value decomposition of a large matrix pair
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2676809)
