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

计算大型矩阵对部分广义奇异值分解的两种调和Jacobi-Davidson方法

Two harmonic Jacobi--Davidson methods for computing a partial generalized singular value decomposition of a large matrix pair

Jinzhi Huang, Zhongxiao Jia

摘要:

针对大型正则矩阵对的部分广义奇异值分解(GSVD)问题,提出了两种基于谐波提取的Jacobi-Davidson(JD)型算法.它们被称为无向量积(CPF)和无逆(IF)谐波JDGSVD算法,分别简称为CPF-HJDGSVD和IF-HJDGSVD。与基于标准提取的JDGSVD算法相比,基于谐波提取的算法收敛更有规律,更适合于计算内部广义奇异值对应的GSVD分量。提出了一种基于压缩和净化技术的厚重启动CPF-HJDGSVD和IF-HJDGSVD算法,用于计算多个GSVD分量。数值实验证实了CPF-HJDGSVD和IF-HJDGSVD算法优于基于标准抽取的JDGSVD算法。

英文摘要:

Two harmonic extraction based Jacobi--Davidson (JD) type algorithms are proposed to compute a partial generalized singular value decomposition (GSVD) of a large regular matrix pair. They are called cross product-free (CPF) and inverse-free (IF) harmonic JDGSVD algorithms, abbreviated as CPF-HJDGSVD and IF-HJDGSVD, respectively. Compared with the standard extraction based JDGSVD algorithm, the harmonic extraction based algorithms converge more regularly and suit better for computing GSVD components corresponding to interior generalized singular values. Thick-restart CPF-HJDGSVD and IF-HJDGSVD algorithms with some deflation and purgation techniques are developed to compute more than one GSVD components. Numerical experiments confirm the superiority of CPF-HJDGSVD and IF-HJDGSVD to the standard extraction based JDGSVD algorithm.

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

↑