On choices of formulations of computing the generalized singular value decomposition of a large matrix pair

DOI10.1007/S11075-020-00984-9MaRDI QIDQ2028035zbMATH OpenOpenAlexFDO

Authors Jinzhi Huang, Zhongxiao Jia

Publication date 31 May 2021

Published in Numerical Algorithms (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1907.10392

zbMATH Keywords

condition numbereigensolvergeneralized eigenpairgeneralized singular value decompositionperturbation analysis

Mathematics Subject Classification ID

Conditioning of matrices (15A12) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical computation of matrix norms, conditioning, scaling (65F35)

Abstract: For the computation of the generalized singular value decomposition (GSVD) of a large matrix pair $(A,B)$ of full column rank, the GSVD is commonly formulated as two mathematically equivalent generalized eigenvalue problems, so that a generalized eigensolver can be applied to one of them and the desired GSVD components are then recovered from the computed generalized eigenpairs. Our concern in this paper is, in finite precision arithmetic, which generalized eigenvalue formulation is numerically preferable to compute the desired GSVD components more accurately. We make a detailed perturbation analysis on the two formulations and show how to make a suitable choice between them. Numerical experiments illustrate the results obtained.

Recommendations

• scientific article; zbMATH DE number 4143344
• Computing the Generalized Singular Value Decomposition
• A Tangent Algorithm for Computing the Generalized Singular Value Decomposition
• Generalizing the GSVD
• Two harmonic Jacobi-Davidson methods for computing a partial generalized singular value decomposition of a large matrix pair

Cites work

• A Jacobi-Davidson type method for the generalized singular value problem
• A joint bidiagonalization based iterative algorithm for large scale general-form Tikhonov regularization
• A refined harmonic Lanczos bidiagonalization method and an implicitly restarted algorithm for computing the smallest singular triplets of large matrices
• A Relationship between Linear Discriminant Analysis and the Generalized Minimum Squared Error Solution
• An Implicitly Restarted Refined Bidiagonalization Lanczos Method for Computing a Partial Singular Value Decomposition
• Computing the generalized singular values/vectors of large sparse or structured matrix pairs
• Generalizing the Singular Value Decomposition
• Harmonic and refined extraction methods for the singular value problem, with applications in least squares problems
• scientific article; zbMATH DE number 47363 (Why is no real title available?)
• scientific article; zbMATH DE number 1049353 (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 6159604 (Why is no real title available?)
• Matrix algorithms. Vol. 2: Eigensystems
• Numerical methods for large eigenvalue problems
• 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
• Spectral condition-number estimation of large sparse matrices.
• 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 general (A- B)-problem
• The Generalized Singular Value Decomposition and the Method of Particular Solutions
• The University of Florida sparse matrix collection
• Towards a Generalized Singular Value Decomposition
• Using cross-product matrices to compute the SVD

Cited in

(10)

• 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
• The Joint Bidiagonalization Method for Large GSVD Computations in Finite Precision
• Thick-restarted joint Lanczos bidiagonalization for the GSVD
• An Augmented Matrix-Based CJ-FEAST SVDsolver for Computing a Partial Singular Value Decomposition with the Singular Values in a Given Interval
• A CJ-FEAST GSVDsolver for computing a partial gsvd of a large matrix pair with the generalized singular values in a given interval
• Refined and refined harmonic Jacobi-Davidson methods for computing several GSVD components of a large regular matrix pair
• Characterizing GSVD by singular value expansion of linear operators and its computation
• A contour integral-based algorithm for computing generalized singular values
• An implicitly restarted joint bidiagonalization algorithm for large GSVD computations

Describes a project that uses

Uses Software

• JDQR
• UTV
• SparseMatrix
• JDQZ

This page was built for publication: On choices of formulations of computing the 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 Q2028035)