The algebraic eigenvalue problem
The algebraic eigenvalue problem
Bit-level systolic algorithms for real symmetric and Hermitian eigenvalue problems
Journal of VLSI Signal Processing Systems - Special issue: application specific array processors
On the parallel implementation of Jacobi and Kogbetliantz algorithms
SIAM Journal on Scientific Computing
Numerical Accuracy and Hardware Tradeoffs for CORDIC Arithmetic for Special-Purpose Processors
IEEE Transactions on Computers
An Efficient Jacobi-Like Algorithm for Parallel Eigenvalue Computation
IEEE Transactions on Computers
| Hi-index | 14.98 |
The Jacobi algorithm for eigenvalue calculation of symmetric matrices can be performed with a CORDIC algorithm as its basic module. Recently, a simplified Jacobi algorithm, by employing approximate rotations based on CORDIC rotations, was proposed. It fully exploits the binary data structure and reduces the overall computational cost significantly.In this paper an error analysis of the approximate CORDIC-based Jacobi algorithm and the conventional CORDIC-based Jacobi algorithm is performed. The new algorithm behaves numerically better than the conventional CORDIC-based Jacobi algorithm for fixed as well as floating point arithmetic.