A sorted partial jacobi method and its convergence analysis
β Scribed by Hongyuan Zha; Zhenyue Zhang
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 961 KB
- Volume
- 270
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
β¦ Synopsis
Jacobi methods for computing the eigendecomposition of a class of so-called low-rank-plus-shift symmetric matrices are investigated. An order-of-magnitude reduction in the computational complexity can be achieved for this special class of matrices by terminating the Jacobi sweep early in a cyclic ordering. It is proved that these partial sweeps combined with sorting the diagonals still deliver quadratic convergence. It is also shown that useful results can still be obtained even if the low-rank-plus-shift structure only holds approximately.
π SIMILAR VOLUMES
A central problem in the Jacobi-Davidson method is to expand a projection subspace by solving a certain correction equation. It has been commonly accepted that the correction equation always has a solution. However, it is proved in this paper that this is not true. Conditions are given to decide whe