Efficient implementation of Jacobi's diagonalization method on the DAP
โ Scribed by J. J. Modi; J. D. Pryce
- Publisher
- Springer-Verlag
- Year
- 1985
- Tongue
- English
- Weight
- 556 KB
- Volume
- 46
- Category
- Article
- ISSN
- 0029-599X
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
The greatest emphasis has hitherto been on parallel application of Givens rotations. In this paper we show that on the Distributed Array Processor (DAP), Householder reflections turn out to be faster than Givens rotations, to perform QR factorization of an m X n matrix, especially for m >> n. Detail
The use of implicit methods for ODEs, e.g. implicit Runge-Kutta schemes, requires the solution of nonlinear systems of algebraic equations of dimension s โข m, where m is the size of the continuous differential problem to be approximated. Usually, the solution of this system represents the most time-
Evans, D.J. and M.D, Levin, A matrix-squaring variant of the power method on the DAP, Parallel Computing 17 (1991) 49-54\_ The power method and its variant matrix squaring are described, and the advantages of the strategy of matrix squaring are demonstrated on the DAP for matrices that occur freque