A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
An efficient Jacobi-like algorithm for parallel eigenvalue computation
1993
IEEE transactions on computers
Preserved Fulltext
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 i Igorithm, Le., 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 mly linear
doi:10.1109/12.241595
fatcat:iagbghckbvgwbbnis7ooct7cyu