A Jacobi-Davidson type method for the generalized singular value problem
DOI10.1016/J.LAA.2009.03.003zbMATH Open1169.65034OpenAlexW2097163624MaRDI QIDQ1025866FDOQ1025866
Authors: M. E. Hochstenbach
Publication date: 23 June 2009
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2009.03.003
Recommendations
- A Jacobi--Davidson type SVD method
- New iterative methods for generalized singular-value problems
- Jacobi-Davidson type methods for generalized eigenproblems and polynomial eigenproblems
- Two harmonic Jacobi-Davidson methods for computing a partial generalized singular value decomposition of a large matrix pair
- Subspace iteration method for generalized singular values
numerical examplesquadratic convergencecorrection equationJacobi-Davidson methodgeneralized singular value decompositionsubspace methodlarge sparse matrixaugmented matrixharmonic extractionrefined extractionaccelerated Newton method
Computational methods for sparse matrices (65F50) Numerical solutions to overdetermined systems, pseudoinverses (65F20)
Cites Work
- Title not available (Why is that?)
- Matrix algorithms. Vol. 2: Eigensystems
- Title not available (Why is that?)
- A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems
- Singular value and generalized singular value decompositions and the solution of linear matrix equations
- Harmonic and refined extraction methods for the singular value problem, with applications in least squares problems
- Generalizing the Singular Value Decomposition
- Jacobi-Davidson type methods for generalized eigenproblems and polynomial eigenproblems
- Numerical methods for large eigenvalue problems
- Title not available (Why is that?)
- Refined iterative algorithms based on Arnoldi's process for large unsymmetric eigenproblems
- Jacobi--Davidson Style QR and QZ Algorithms for the Reduction of Matrix Pencils
- A Jacobi--Davidson type SVD method
- Towards a Generalized Singular Value Decomposition
- Structure Preserving Dimension Reduction for Clustered Text Data Based on the Generalized Singular Value Decomposition
- Computing the generalized singular values/vectors of large sparse or structured matrix pairs
- Two-sided and alternating Jacobi-Davidson
- The Generalized Singular Value Decomposition and the Method of Particular Solutions
- The generalized singular value decomposition and the general (A-\(\lambda\) B)-problem
- A Relationship between Linear Discriminant Analysis and the Generalized Minimum Squared Error Solution
Cited In (10)
- New iterative methods for generalized singular-value problems
- Computing several eigenvalues of nonlinear eigenvalue problems by selection
- A Jacobi--Davidson type SVD method
- On choices of formulations of computing the generalized singular value decomposition of a large matrix pair
- Computing a partial generalized real Schur form using the Jacobi–Davidson method
- 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 of a large matrix pair
- A Generalized CUR Decomposition for Matrix Pairs
- Arnoldi and Jacobi-Davidson methods for generalized eigenvalue problems $Ax=\lambda Bx$ with singular $B$
- Thick-restarted joint Lanczos bidiagonalization for the GSVD
This page was built for publication: A Jacobi-Davidson type method for the generalized singular value problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1025866)