Share Email Print
cover

Proceedings Paper

Parallel algorithm for the eigenvalues and eigenvectors of a general matrix
Author(s): Gautam M. Shroff
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

A new parallel Jacobi-like algorithm for computing the eigenvalues of a general complex matrix is presented. The asymptotic convergence rate of this algorithm is provably quadratic and this is also demonstrated in numerical experiments. The algorithm promises to be suitable for real-time signal processing applications. In particular the algorithm can be implemented using n2/4 processors taking O(n log2 n) time for random matrices.

Paper Details

Date Published: 1 November 1990
PDF: 9 pages
Proc. SPIE 1348, Advanced Signal Processing Algorithms, Architectures, and Implementations, (1 November 1990); doi: 10.1117/12.23493
Show Author Affiliations
Gautam M. Shroff, Rensselaer Polytechnic Institu (United States)


Published in SPIE Proceedings Vol. 1348:
Advanced Signal Processing Algorithms, Architectures, and Implementations
Franklin T. Luk, Editor(s)

© SPIE. Terms of Use
Back to Top