A CORDIC-based Jacobi-like algorithm for eigenvalue computation

Author

Götze, Jürgen ; Paul, Steffen ; Sauer, Matthias

Author_Institution

Tech. Univ. Munich, Germany

Volume

3

fYear

1993

fDate

27-30 April 1993

Firstpage

296

Abstract

A very fast CORDIC (coordinate rotation digital computer)-based Jacobi-like algorithm for the parallel solution of symmetric eigenvalue problems is proposed. It becomes possible by not focusing on the realization of an exact Jacobi rotation with a CORDIC processor, but by applying approximate rotations and adjusting them to single steps of the CORDIC algorithm, i.e., only one angle of the CORDIC angle sequence is applied in each step. Although only linear convergence is obtained for the most simple version of the proposed algorithm, the overall operation count (shifts and adds) decreases dramatically. A slow increase of the number of CORDIC angles involved during the runtime retains quadratic convergence.<>

Keywords

computational complexity; convergence; digital arithmetic; eigenvalues and eigenfunctions; parallel algorithms; signal processing; CORDIC algorithm; Jacobi-like algorithm; coordinate rotation digital computer; linear convergence; operation count; quadratic convergence; symmetric eigenvalue problems;

fLanguage

English

Publisher

ieee

Conference_Titel

Acoustics, Speech, and Signal Processing, 1993. ICASSP-93., 1993 IEEE International Conference on

Conference_Location

Minneapolis, MN, USA

ISSN

1520-6149

Print_ISBN

0-7803-7402-9

Type

conf

DOI

10.1109/ICASSP.1993.319495

Filename

319495