arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2404.00655math.NAcs.NA
收藏

通过线性算子的奇异值展开刻画 GSVD 及其计算

Characterizing GSVD by singular value expansion of linear operators and its computation

Haibo Li

AI总结:

本文从奇异值展开视角重新刻画矩阵对的广义奇异值分解,提出广义 Golub-Kahan 双对角化算法 gGKB_GSVD,用于大规模矩阵对非平凡极端 GSVD 分量的迭代计算,并验证其有效性。

摘要:

矩阵对 $\{A, L\}$(其中 $A\in\mathbb{R}^{m\times n}$,$L\in\mathbb{R}^{p\times n}$)的广义奇异值分解(GSVD)推广了单个矩阵的奇异值分解(SVD)。本文从 SVD 的视角为 GSVD 提供了一种新的理解,并在此基础上提出了一种新的迭代方法,用于计算大规模矩阵对的非平凡 GSVD 分量。通过在两个有限维 Hilbert 空间之间引入由 $\{A, L\}$ 诱导的两个线性算子 $\mathcal{A}$ 和 $\mathcal{L}$,并应用线性紧算子的奇异值展开(SVE)理论,我们证明 $\{A, L\}$ 的 GSVD 正是 $\mathcal{A}$ 和 $\mathcal{L}$ 的 SVE。这一结果完整刻画了任意具有相同列数的矩阵对的 GSVD 结构。作为该结果的直接应用,我们将作为大规模 SVD 计算基本例程的标准 Golub-Kahan 双对角化(GKB)进行推广,使得所得的广义 GKB(gGKB)过程能够用于逼近 $\{A, L\}$ 的非平凡极端 GSVD 分量,该算法被命名为 gGKB_GSVD 算法。我们利用 $\{A, L\}$ 的 GSVD 研究了 gGKB 的若干基本性质,并给出了 gGKB_GSVD 在 GSVD 计算中收敛性与精度的初步结果。数值实验展示了该方法的有效性。

英文摘要:

The generalized singular value decomposition (GSVD) of a matrix pair $\{A, L\}$ with $A\in\mathbb{R}^{m\times n}$ and $L\in\mathbb{R}^{p\times n}$ generalizes the singular value decomposition (SVD) of a single matrix. In this paper, we provide a new understanding of GSVD from the viewpoint of SVD, based on which we propose a new iterative method for computing nontrivial GSVD components of a large-scale matrix pair. By introducing two linear operators $\mathcal{A}$ and $\mathcal{L}$ induced by $\{A, L\}$ between two finite-dimensional Hilbert spaces and applying the theory of singular value expansion (SVE) for linear compact operators, we show that the GSVD of $\{A, L\}$ is nothing but the SVEs of $\mathcal{A}$ and $\mathcal{L}$. This result characterizes completely the structure of GSVD for any matrix pair with the same number of columns. As a direct application of this result, we generalize the standard Golub-Kahan bidiagonalization (GKB) that is a basic routine for large-scale SVD computation such that the resulting generalized GKB (gGKB) process can be used to approximate nontrivial extreme GSVD components of $\{A, L\}$, which is named the gGKB\_GSVD algorithm. We use the GSVD of $\{A, L\}$ to study several basic properties of gGKB and also provide preliminary results about convergence and accuracy of gGKB\_GSVD for GSVD computation. Numerical experiments are presented to demonstrate the effectiveness of this method.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑