A cross-product free Jacobi-Davidson type method for computing a partial generalized singular value decomposition of a large matrix pair
From MaRDI portal
Publication:2680320
Recommendations
- Two harmonic Jacobi-Davidson methods for computing a partial generalized singular value decomposition of a large matrix pair
- A Jacobi-Davidson type method for the generalized singular value problem
- scientific article; zbMATH DE number 4143344
- A Jacobi--Davidson type SVD method
- On choices of formulations of computing the generalized singular value decomposition of a large matrix pair
Cites work
- scientific article; zbMATH DE number 47363 (Why is no real title available?)
- scientific article; zbMATH DE number 1049350 (Why is no real title available?)
- scientific article; zbMATH DE number 1953444 (Why is no real title available?)
- scientific article; zbMATH DE number 1748536 (Why is no real title available?)
- scientific article; zbMATH DE number 852536 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- A Jacobi-Davidson type method for the generalized singular value problem
- A Relationship between Linear Discriminant Analysis and the Generalized Minimum Squared Error Solution
- A joint bidiagonalization based iterative algorithm for large scale general-form Tikhonov regularization
- An analysis of the Rayleigh-Ritz method for approximating eigenspaces
- Computational methods for large eigenvalue problems
- Computing the generalized singular values/vectors of large sparse or structured matrix pairs
- Dynamic Thick Restarting of the Davidson, and the Implicitly Restarted Arnoldi Methods
- Generalizing the Singular Value Decomposition
- Harmonic and refined harmonic shift-invert residual Arnoldi and Jacobi-Davidson methods for interior eigenvalue problems
- Inner iterations in the shift-invert residual Arnoldi method and the Jacobi-Davidson method
- Matrix algorithms. Vol. 2: Eigensystems
- New iterative methods for generalized singular-value problems
- 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
- Preconditioning
- Rank-Deficient and Discrete Ill-Posed Problems
- Regularization, GSVD and truncated GSVD
- Singular value and generalized singular value decompositions and the solution of linear matrix equations
- Structure Preserving Dimension Reduction for Clustered Text Data Based on the Generalized Singular Value Decomposition
- 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 generalized singular value decomposition and the general (A- B)-problem
- The joint bidiagonalization process with partial reorthogonalization
- Towards a Generalized Singular Value Decomposition
- Two harmonic Jacobi-Davidson methods for computing a partial generalized singular value decomposition of a large matrix pair
Cited in
(4)- Thick-restarted joint Lanczos bidiagonalization for the GSVD
- The Joint Bidiagonalization Method for Large GSVD Computations in Finite Precision
- Two harmonic Jacobi-Davidson methods for computing a partial generalized singular value decomposition of a large matrix pair
- A cross-product free Jacobi-Davidson type method for computing a partial generalized singular value decomposition (GSVD) of a large matrix pair
This page was built for publication: A cross-product free Jacobi-Davidson type method 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 Q2680320)
