On The Systolic Arrays Of Brent, Luk, and Van Loan

Systolic architectures due to Brent, Luk, and Van Loan are today the most promising idea for computing the symmetric eigenvalue and singular value decompositions in real time. These systolic arrays, however, are only able to solve problems of a given, fixed size. Here we present two modified algorithms and a modified array that do not have this disadvantage. The results of a numerical experiment show that a combination of one of the new algorithms and the new array is just as efficient as the Brent-Luk-Van Loan method.