On Jacobi and Jacobi-Like Algorithms for a Parallel Computer
Open Access
- 1 July 1971
- journal article
- Published by JSTOR in Mathematics of Computation
- Vol. 25 (115) , 579-590
- https://doi.org/10.2307/2005221
Abstract
Many existing algorithms for obtaining the eigenvalues and eigenvectors of matrices would make poor use of such a powerful parallel computer as the ILLIAC IV. In this paper, Jacobi’s algorithm for real symmetric or complex Hermitian matrices, and a Jacobi-like algorithm for real nonsymmetric matrices developed by P. J. Eberlein, are modified so as to achieve maximum efficiency for the parallel computations.Keywords
This publication has 5 references indexed in Scilit:
- The Algebraic Eigenvalue ProblemMathematics of Computation, 1966
- A Jacobi-Like Method for the Automatic Computation of Eigenvalues and Eigenvectors of an Arbitrary MatrixJournal of the Society for Industrial and Applied Mathematics, 1962
- A Procedure for the Diagonalization of Normal MatricesJournal of the ACM, 1959
- On the Speed of Convergence of Cyclic and Quasicyclic Jacobi Methods for Computing Eigenvalues of Hermitian MatricesJournal of the Society for Industrial and Applied Mathematics, 1958
- On the Minimization of Matrix NormsThe American Mathematical Monthly, 1958