By Topic

A parallel algorithm for the diagonalization of symmetric matrices

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Cernuschi-Frias, B. ; Fac. de Ingenieria, Buenos Aires Univ., Argentina ; Lew, S.E. ; Gonzalez, H.J. ; Pfefferman, J.D.

A parallel algorithm for the diagonalization of symmetric matrices is presented. The Givens-Jacobi rotator method is extended and modified to solve the eigensystem problem of symmetric matrices in a full parallel way. The algorithm solves the diagonalization of symmetric matrices in approximately N “parallel” iterations for large N, while the Givens-Jacobi algorithm requires 3N to 5N “parallel” iterations. A proof of the convergence for small rotation angles is presented. Preliminary simulations done with arbitrary randomly generated symmetric matrices sustain the efficiency of the algorithm

Published in:

Circuits and Systems, 2000. Proceedings. ISCAS 2000 Geneva. The 2000 IEEE International Symposium on  (Volume:5 )

Date of Conference: