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.
A. S. Krishnakumar,
"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