๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An accelerated subspace iteration method for generalized eigenproblems

โœ Scribed by Xuelin Wang; Ji Zhou


Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
211 KB
Volume
71
Category
Article
ISSN
0045-7949

No coin nor oath required. For personal study only.

โœฆ Synopsis


An accelerated subspace iteration for generalized eigenproblems is proposed by combining the repeated inverse iteration with the over-relaxation technique. Two schemes are developed to obtain an over-relaxation factor. Numerical results show that the proposed acceleration is ecient and numerically stable for eigenproblems with a large number of eigenpairs required or with close eigenvalues.


๐Ÿ“œ SIMILAR VOLUMES


An accelerated subspace iteration method
โœ S. Rajendran; M. V. Narasimhan ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 652 KB
Subspace iteration for complex symmetric
โœ A.Y.T. Leung ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 886 KB

For a heavily damped system, either viscous or hysteretic or both, the homogeneous solution constitutes a generalized complex symmetric eigenproblem [A][x] = l[B]{x}, where [A] and [B] are sparse complex symmetric matrices. The general method to solve the transformed eigenproblem [B] -1 [A]{x} = l{x

An improved subspace iteration method wi
โœ Hyung-Jo Jung; Man-Cheol Kim; In-Won Lee ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 292 KB

An ecient and stable technique to remove the limitation in choosing a shift in the subspace iteration method with shifting is presented. A major diculty of the subspace iteration method with shifting is that, because of the singularity problem, a shift close to an eigenvalue cannot be used, resultin