A Tree Architecture For The Symmetric Eigenproblem

A. S. Krishnakumar; Martin Morf

doi:10.1117/12.936444

28 November 1983 A Tree Architecture For The Symmetric Eigenproblem

A. S. Krishnakumar, Martin Morf

Proceedings Volume 0431, Real-Time Signal Processing VI; (1983) https://doi.org/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.

Citation Download Citation

A. S. Krishnakumar and Martin Morf "A Tree Architecture For The Symmetric Eigenproblem", Proc. SPIE 0431, Real-Time Signal Processing VI, (28 November 1983); https://doi.org/10.1117/12.936444

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