Please use this identifier to cite or link to this item: http://hdl.handle.net/1813/6529
 Title: On The Schur Decomposition of a Matrix for Parallel Computation Authors: Eberlein, Patricia J. Keywords: computer sciencetechnical report Issue Date: Jun-1985 Publisher: Cornell University Citation: http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR85-689 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. URI: http://hdl.handle.net/1813/6529 Appears in Collections: Computer Science Technical Reports

Files in This Item:

File Description SizeFormat