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: The Solution of Singular-Value and Symmetric Eigenvalue Problems on Multiprocessor Arrays
Authors: Brent, Richard P.
Luk, Franklin T.
Keywords: computer science
technical report
Issue Date: Jul-1983
Publisher: Cornell University
Abstract: Parallel Jacobi-like algorithms are presented for computing a singular-value decomposition of an $mxn$ matrix $(m \geq n)$ and an eigenvalue decomposition of an $n x n$ symmetric matrix. A linear array of $O(n)$ processors is proposed for the singular-value problem and the associated algorithm requires time $O(mnS)$, where $S$ is the number of sweeps (typically $S \leq 10)$. A square array of $O(n^{2})$ processors with nearest-neighbor communication is proposed for the eigenvalue problem; the associated algorithm requires time $O(nS)$. Key Words And Phrases: Multiprocessor arrays, systolic arrays, singular-value decomposition, eigenvalue decomposition, real symmetric matrices, Hestenes method, Jacobi method, VLSI, real-time computation, parallel algorithms.
Appears in Collections:Computer Science Technical Reports

Files in This Item:

File Description SizeFormat
83-562.pdf1.91 MBAdobe PDFView/Open
83-562.ps743.67 kBPostscriptView/Open

Refworks Export

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


© 2014 Cornell University Library Contact Us