1 November 1990 Parallel algorithm for the eigenvalues and eigenvectors of a general matrix
Author Affiliations +
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.
© (1990) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
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); doi: 10.1117/12.23493; https://doi.org/10.1117/12.23493
PROCEEDINGS
9 PAGES


SHARE
KEYWORDS
Matrices

Algorithm development

Signal processing

Composites

Data processing

Aluminum

Astatine

Back to Top