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

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.

25 pages, 5 figures

Cited by in corpus (5)

• 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
• An augmented matrix-based CJ-FEAST SVDsolver for computing a partial singular value decomposition with the singular values in a given interval
• Refined and refined harmonic Jacobi--Davidson methods for computing several GSVD components of a large regular matrix pair
• A CJ-FEAST GSVDsolver for computing a partial GSVD of a large matrix pair with the generalized singular values in a given interval