A Tree Architecture For The Symmetric Eigenproblem

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.

This publication has 0 references indexed in Scilit: