A quadratically convergent Jacobi-like method for real matrices with complex eigenvalues
✍ Scribed by K. Veselić; H. J. Wenzel
- Publisher
- Springer-Verlag
- Year
- 1979
- Tongue
- English
- Weight
- 360 KB
- Volume
- 33
- Category
- Article
- ISSN
- 0029-599X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
We propose a new QR-like algorithm, symmetric squared QR (SSQR) method, that can be readily parallelized using commonly available parallel computational primitives such as matrix-matrix multiplication and QR decomposition. The algorithm converges quadratically and the quadratic convergence is achiev
New methods for the iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of a generalized eigenvalue problem are proposed. These methods use only multiplication of the A and B matrices on a vector. 0 1994 by John Wiley & Sons, Inc.