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

二次特征值问题的隐式重启广义二阶Arnoldi类型算法

Implicitly Restarted Generalized Second-order Arnoldi Type Algorithms for the Quadratic Eigenvalue Problem

Tsinghua University(清华大学);BeiHang University(北京航空航天大学)

Zhongxiao Jia, Yuquan Sun

AI总结:

针对二次特征值问题,提出隐式重启的广义二阶Arnoldi(GSOAR)和精化GSOAR算法,通过特定移位策略提高计算效率和精度。

摘要:

我们研究了广义二阶Arnoldi(GSOAR)方法(Bai和Su [{\em SIAM J. Matrix Anal. Appl.}, 26 (2005): 640--659.] 提出的SOAR方法的推广)以及精化GSOAR(RGSOAR)方法用于二次特征值问题(QEP)。这两种方法使用GSOAR过程生成给定广义二阶Krylov子空间的标准正交基,并利用该基将QEP投影到子空间上,分别计算Ritz对和精化Ritz对。我们开发了隐式重启的GSOAR和RGSOAR算法,其中提出了某些精确和精化移位分别用于两种算法。在实际问题上的数值实验说明了重启算法的效率,以及重启RGSOAR相对于重启GSOAR的优越性。实验还表明,在精度和计算效率方面,IGSOAR和IRGSOAR通常比应用于相应线性化问题的隐式重启Arnoldi方法表现更好。

英文摘要:

We investigate the generalized second-order Arnoldi (GSOAR) method, a generalization of the SOAR method proposed by Bai and Su [{\em SIAM J. Matrix Anal. Appl.}, 26 (2005): 640--659.], and the Refined GSOAR (RGSOAR) method for the quadratic eigenvalue problem (QEP). The two methods use the GSOAR procedure to generate an orthonormal basis of a given generalized second-order Krylov subspace, and with such basis they project the QEP onto the subspace and compute the Ritz pairs and the refined Ritz pairs, respectively. We develop implicitly restarted GSOAR and RGSOAR algorithms, in which we propose certain exact and refined shifts for respective use within the two algorithms. Numerical experiments on real-world problems illustrate the efficiency of the restarted algorithms and the superiority of the restarted RGSOAR to the restarted GSOAR. The experiments also demonstrate that both IGSOAR and IRGSOAR generally perform much better than the implicitly restarted Arnoldi method applied to the corresponding linearization problems, in terms of the accuracy and the computational efficiency.

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

↑