Jacobi-like Algorithms for Eigenvalue Decomposition of a Real Normal Matrix Using Real Arithmetic

Authors:
Bing Bing Zhou;Richard P. Brent
Affiliations:
-;-
Venue:
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
Year:
1996

Citing 5
Cited 2

On the Schur Decomposition of a Matrix for Parallel Computation

IEEE Transactions on Computers
On parallel Jacobi orderings

SIAM Journal on Scientific and Statistical Computing
Hamilton and Jacobi Meet Again: Quaternions and the Eigenvalue Problem

SIAM Journal on Matrix Analysis and Applications
The Real Two-Zero Algorithm: A Parallel Algorithm to Reduce a Real Matrix to a Real Schur Form

IEEE Transactions on Parallel and Distributed Systems
On parallel implementation of the one-sided Jacobi algorithm for singular value decompositions

PDP '95 Proceedings of the 3rd Euromicro Workshop on Parallel and Distributed Processing

Improving a parallel algorithm through a visual display

Journal of Computing Sciences in Colleges
An efficient method for computing eigenvalues of a real normal matrix

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we introduce a method for designing efficient Jacobi-like algorithms for eigenvalue decomposition of a real normal matrix. The algorithms use only real arithmetic and achieve ultimate quadratic convergence. A theoretical analysis is conducted and some experimental results are presented.