Name
Title | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1007/s11075-020-00984-9 | NUMERICAL ALGORITHMS |
Keywords | DocType | Volume |
Generalized singular value decomposition, Generalized singular value, Generalized singular vector, Generalized eigenpair, Eigensolver, Perturbation analysis, Condition number | Journal | 87 |
Issue | ISSN | Citations |
2 | 1017-1398 | 1 |
PageRank | References | Authors |
0.36 | 0 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jinzhi Huang | 1 | 2 | 0.72 |
| Zhongxiao Jia | 2 | 121 | 18.57 |