Journal of the ACM (JACM)
Redundant and On-Line CORDIC for Unitary Transformations
IEEE Transactions on Computers
Jacobi-like Algorithms for Eigenvalue Decomposition of a Real Normal Matrix Using Real Arithmetic
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
Improving a parallel algorithm through a visual display
Journal of Computing Sciences in Colleges
An efficient method for computing eigenvalues of a real normal matrix
Journal of Parallel and Distributed Computing
A Novel Parallel QR Algorithm for Hybrid Distributed Memory HPC Systems
SIAM Journal on Scientific Computing
An efficient MAP classifier for sensornets
HiPC'06 Proceedings of the 13th international conference on High Performance Computing
| Hi-index | 14.98 |
An algorithm to solve the eigenproblem for nonsymmetric matrices on an N 脳 N array of mesh-connected processors, isomorphic to the architecture described by Brent and Luk for symmetric matrices, is presented. This algorithm is a generalization of the classical Jacobi method, and, as such, holds promise for parallel architectures. The rotational parameters for the nonsymmetric case are carefully analyzed; many examples of a working program, simulating the parallel architecture, are given with experimental evidence of quadratic convergence.