Parallel algorithm for the eigenvalues and eigenvectors of a general matrix

Gautam M. Shroff

doi:10.1117/12.23493

1 November 1990 Parallel algorithm for the eigenvalues and eigenvectors of a general matrix

Gautam M. Shroff

Proceedings Volume 1348, Advanced Signal Processing Algorithms, Architectures, and Implementations; (1990) https://doi.org/10.1117/12.23493
Event: 34th Annual International Technical Symposium on Optical and Optoelectronic Applied Science and Engineering, 1990, San Diego, CA, United States

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.

Citation Download Citation

Gautam M. Shroff "Parallel algorithm for the eigenvalues and eigenvectors of a general matrix", Proc. SPIE 1348, Advanced Signal Processing Algorithms, Architectures, and Implementations, (1 November 1990); https://doi.org/10.1117/12.23493

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available