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

一个用于广义特征值问题的随机FEAST算法

A randomized FEAST algorithm for generalized eigenvalue problems

School of Mathematics, Sun Yat-sen University(中山大学数学学院)

Guojian Yin

AI总结:

本文提出一种新的非厄米特FEAST算法,通过建立数学框架并分析收敛性,验证了该方法在非厄米特问题中的有效性。

摘要:

FEAST算法由Polizzi提出,是一种基于轮廓积分的特征值求解器,用于计算复平面上给定区域内的特征值及其特征向量。该算法在厄米特特征问题中被提出,具有稳定性和准确性,近年来受到广泛关注。然而,当应用于非厄米特问题时,FEAST算法可能无法找到目标特征对。为此,本文开发了一种新的非厄米特FEAST算法方案,建立了数学框架并研究了该方法的收敛性分析。通过数值实验验证了该方法的有效性,并验证了收敛性质。

英文摘要:

The FEAST algorithm, due to Polizzi, is a typical contour-integral based eigensolver for computing the eigenvalues, along with their eigenvectors, inside a given region in the complex plane. It was formulated under the circumstance that the considered eigenproblem is Hermitian. The FEAST algorithm is stable and accurate, and has attracted much attention in recent years. However, it was observed that the FEAST algorithm may fail to find the target eigenpairs when applying it to the non-Hermitian problems. Efforts have been made to adapt the FEAST algorithm to non-Hermitian cases. In this work, we develop a new non-Hermitian scheme for the FEAST algorithm. The mathematical framework will be established, and the convergence analysis of our new method will be studied. Numerical experiments are reported to demonstrate the effectiveness of our method and to validate the convergence properties.

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

↑