28 November 1983 A Tree Architecture For The Symmetric Eigenproblem
Author Affiliations +
Proceedings Volume 0431, Real-Time Signal Processing VI; (1983); doi: 10.1117/12.936444
Event: 27th Annual Technical Symposium, 1983, San Diego, United States
Abstract
In this paper we present a tree architecture for eigendecomposition based on a Divide-and-Conquer approach. A comparison of this method with the previously proposed systolic array architecture is made. Strategies for serial-parallel computation and fault-tolerant design are indicated. The suitability of this architecture for VLSI implementation is pointed out.
© (1983) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
A. S. Krishnakumar, Martin Morf, "A Tree Architecture For The Symmetric Eigenproblem", Proc. SPIE 0431, Real-Time Signal Processing VI, (28 November 1983); doi: 10.1117/12.936444; https://doi.org/10.1117/12.936444
PROCEEDINGS
7 PAGES


SHARE
KEYWORDS
Matrices

Chemical elements

Very large scale integration

Algorithms

Binary data

Defense and security

Fourier transforms

RELATED CONTENT

Multiple-tube resonance model
Proceedings of SPIE (December 06 2002)
Systolic Array For Solving Toeplitz Systems Of Equations
Proceedings of SPIE (February 23 1988)
A Real Formalism Of Discrete Fourier Transform In Terms Of...
Proceedings of SPIE (November 28 1983)
Some fast Toeplitz least-squares algorithms
Proceedings of SPIE (December 01 1991)

Back to Top