40 citations · 73 across the 6 of their papers we have counts for
5 papers · 1 filter
A randomized FEAST algorithm for generalized eigenvalue problems
Guojian Yin
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 comp…
A Contour-integral Based QZ Algorithm for Generalized Eigenvalue Problems
Guojian Yin
Recently, a kind of eigensolvers based on contour integral were developed for computing the eigenvalues inside a given region in the complex plane. The CIRR method is a classic exa…
Restarted Hessenberg method for solving shifted nonsymmetric linear systems
Xian-Ming Gu, Ting-Zhu Huang, Guojian Yin +3
It is known that the restarted full orthogonalization method (FOM) outperforms the restarted generalized minimum residual (GMRES) method in several circumstances for solving shifte…
A Contour-integral Based Method for Counting the Eigenvalues Inside a Region in the Complex Plane
Guojian Yin
In many applications, the information about the number of eigenvalues inside a given region is required. In this paper, we propose a contour-integral based method for this purpose.…
A FEAST Algorithm with oblique projection for generalized eigenvalue problems
Guojian Yin, Raymond H. Chan, Man-Chung Yeung
The contour-integral based eigensolvers are the recent efforts for computing the eigenvalues inside a given region in the complex plane. The best-known members are the Sakurai-Sugi…