Issue No. 09 - September (1993 vol. 42)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.241595
<p>A very fast Jacobi-like algorithm for the parallel solution of symmetric eigenvalue problems is proposed. It becomes possible by not focusing on the realization of the 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 defines the Jacobi rotation in each step. This angle can be determined by some shift, add and compare operations. Although only linear convergence is obtained for the most simple version of the new algorithm, the overall operation count (shifts and adds) decreases dramatically. A slow increase of the number of involved CORDIC angles during the runtime retains quadratic convergence.</p>
Jacobi-like algorithm; parallel eigenvalue computation; symmetric eigenvalue problems; CORDIC processor; CORDIC angle sequence; Jacobi rotation; linear convergence; quadratic convergence; approximate rotations; digital signal processing; eigenvalue computation; fast implementations; matrix computation; scaling computation; convergence of numerical methods; eigenvalues and eigenfunctions; matrix algebra; parallel algorithms; signal processing.
S. Paul, J. Gotze and M. Sauer, "An Efficient Jacobi-Like Algorithm for Parallel Eigenvalue Computation," in IEEE Transactions on Computers, vol. 42, no. , pp. 1058-1065, 1993.