On The Schur Decomposition of a Matrix for Parallel Computation

Abstract

An algorithm to solve the eigenproblem for non-symmetric matrices on an $N \times N$ array of mesh connected processors, isomorphic to the architecture described by Brent and Luk for symmetric matrices, is presented. This algorithm is a generalization of the classical Jacobi method, which holds promise for parallel architectures. The rotational parameters for the non-symmetric case are carefully analyzed; many examples of a working program, simulating the parallel architecture, are given.