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

A refined subspace iteration algorithm for large sparse eigenproblems

โœ Scribed by Zhongxiao Jia

Book ID
108415956
Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
138 KB
Volume
32
Category
Article
ISSN
0168-9274

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A refined iterative algorithm based on t
A refined iterative algorithm based on the block arnoldi process for large unsymmetric eigenproblems
โœ Zhongxiao Jia ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 775 KB

When the matrix in question is uns)xnmetric, the approximate eigenvectors or Ritz vectors obtained by orthogonal projection methods including Arnoldi's method and the block Arnoldi method cannot be guaranteed to converge in theory even if the corresponding approximate eigenvalues or Ritz values do.

A refined shift-and-invert arnoldi algor
A refined shift-and-invert arnoldi algorithm for large unsymmetric generalized eigenproblems
โœ Zhongxiao Jia; Yong Zhang ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 937 KB

## The shift-and-invert Arnoldi method has been popularly used for computing a number of eigenvalues close to a given shift and/or the associated eigenvectors of a large unsymmetric matrix pair, but there is no guarantee for the approximate eigenvectors, Ritz vectors, obtained by this method to co