skip to content
The solution of singular-value and symmetric eigenvalue problems on multiprocessor arrays Preview this item
ClosePreview this item
Checking...

The solution of singular-value and symmetric eigenvalue problems on multiprocessor arrays

Author: R P Brent; Franklin T Luk; Mathematical Sciences Research Centre.; Australian National University. Centre for Mathematical Analysis.; Cornell University. Department of Computer Science.
Publisher: Ithaca, NY : Cornell University, 1983.
Edition/Format:   Book : EnglishView all editions and formats
Database:WorldCat
Summary:
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[superscript]{2})$
Rating:

(not yet rated) 0 with reviews - Be the first.

 

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Document Type: Book
All Authors / Contributors: R P Brent; Franklin T Luk; Mathematical Sciences Research Centre.; Australian National University. Centre for Mathematical Analysis.; Cornell University. Department of Computer Science.
OCLC Number: 10649105
Notes: "TR 83-562."
"July 1983."
Description: 34 pages ; 28 cm
Responsibility: R.P. Brent, F.T. Luk.

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[superscript]{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.

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


<http://www.worldcat.org/oclc/10649105>
library:oclcnum"10649105"
library:placeOfPublication
library:placeOfPublication
rdf:typeschema:Book
schema:contributor
<http://viaf.org/viaf/262885239>
rdf:typeschema:Organization
schema:name"Cornell University. Department of Computer Science."
schema:contributor
<http://viaf.org/viaf/124394293>
rdf:typeschema:Organization
schema:name"Australian National University. Centre for Mathematical Analysis."
schema:contributor
schema:contributor
schema:creator
schema:datePublished"1983"
schema:description"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[superscript]{2})$ processors with nearest-neighbor communication is proposed for the eigenvalue problem; the associated algorithm requires time $O(nS)$."@en
schema:description"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."@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/3417483>
schema:inLanguage"en"
schema:name"The solution of singular-value and symmetric eigenvalue problems on multiprocessor arrays"@en
schema:publication
schema:publisher
wdrs:describedby

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.