Skip to main content


eCommons@Cornell >
College of Engineering >
Computer Science >
Computer Science Technical Reports >

Please use this identifier to cite or link to this item:
Title: A Systolic Architecture for Almost Linear-Time Solution of the Symmetric Eigenvalue Problem
Authors: Brent, Richard P.
Luk, Franklin T.
Keywords: computer science
technical report
Issue Date: Aug-1982
Publisher: Cornell University
Abstract: An algorithm is presented for computing the eigenvalues and eigenvectors of an n x n real symmetric matrix. The algorithm is essentially a Jacobi method implemented on a two-dimensional systolic array of $O(n^{2})$ processors with nearest-neighbor communication between processors. The speedup over the serial Jacobi method is $\Theta(n^{2})$, so the algorithm converges to working accuracy in time $O(nS))$, where $S$ is the number of sweeps (typically $S \leq 10)$. Key Words and Phrases: Eigenvalue decomposition, real symmetric matrices, Hermitian matrices, Jacobi method, linear-time computation, systolic arrays, VLSI, real-time computation.
Appears in Collections:Computer Science Technical Reports

Files in This Item:

File Description SizeFormat
82-525.pdf1.18 MBAdobe PDFView/Open
82-525.ps399.6 kBPostscriptView/Open

Refworks Export

Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.


© 2014 Cornell University Library Contact Us