Preview this item
Preview this item

# 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. Ithaca, NY : Cornell University, 1983. Print book : EnglishView all editions and formats 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.  Read more... (not yet rated) 0 with reviews - Be the first.

## Find a copy in the library

Finding libraries that hold this item...

## Details

Document Type: Book R P Brent; Franklin T Luk; Mathematical Sciences Research Centre.; Australian National University. Centre for Mathematical Analysis.; Cornell University. Department of Computer Science. Find more information about: R P Brent Franklin T Luk 10649105 "TR 83-562.""July 1983." 34 pages ; 28 cm 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

## 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.

### Primary Entity

<http://www.worldcat.org/oclc/10649105> # The solution of singular-value and symmetric eigenvalue problems on multiprocessor arrays
a schema:CreativeWork, schema:Book ;
library:oclcnum "10649105" ;
library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/3417483#Place/ithaca_ny> ; # Ithaca, NY
library:placeOfPublication <http://id.loc.gov/vocabulary/countries/nyu> ;
schema:bookFormat bgn:PrintBook ;
schema:contributor <http://viaf.org/viaf/151325221> ; # Cornell University. Department of Computer Science.
schema:contributor <http://viaf.org/viaf/269016712> ; # Franklin T. Luk
schema:contributor <http://viaf.org/viaf/124394293> ; # Australian National University. Centre for Mathematical Analysis.
schema:contributor <http://experiment.worldcat.org/entity/work/data/3417483#Organization/mathematical_sciences_research_centre> ; # Mathematical Sciences Research Centre.
schema:creator <http://viaf.org/viaf/223659213> ; # Richard P. Brent
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:productID "10649105" ;
schema:publication <http://www.worldcat.org/title/-/oclc/10649105#PublicationEvent/ithaca_ny_cornell_university_1983> ;
schema:publisher <http://experiment.worldcat.org/entity/work/data/3417483#Agent/cornell_university> ; # Cornell University
wdrs:describedby <http://www.worldcat.org/title/-/oclc/10649105> ;
.

### Related Entities

<http://experiment.worldcat.org/entity/work/data/3417483#Agent/cornell_university> # Cornell University
a bgn:Agent ;
schema:name "Cornell University" ;
.

<http://experiment.worldcat.org/entity/work/data/3417483#Organization/mathematical_sciences_research_centre> # Mathematical Sciences Research Centre.
a schema:Organization ;
schema:name "Mathematical Sciences Research Centre." ;
.

<http://viaf.org/viaf/124394293> # Australian National University. Centre for Mathematical Analysis.
a schema:Organization ;
schema:name "Australian National University. Centre for Mathematical Analysis." ;
.

<http://viaf.org/viaf/151325221> # Cornell University. Department of Computer Science.
a schema:Organization ;
schema:name "Cornell University. Department of Computer Science." ;
.

<http://viaf.org/viaf/223659213> # Richard P. Brent
a schema:Person ;
schema:familyName "Brent" ;
schema:givenName "Richard P." ;
schema:givenName "R. P." ;
schema:name "Richard P. Brent" ;
.

<http://viaf.org/viaf/269016712> # Franklin T. Luk
a schema:Person ;
schema:familyName "Luk" ;
schema:givenName "Franklin T." ;
schema:name "Franklin T. Luk" ;
.

<http://www.worldcat.org/title/-/oclc/10649105>
a genont:InformationResource, genont:ContentTypeGenericResource ;
schema:about <http://www.worldcat.org/oclc/10649105> ; # The solution of singular-value and symmetric eigenvalue problems on multiprocessor arrays
schema:dateModified "2018-03-10" ;
void:inDataset <http://purl.oclc.org/dataset/WorldCat> ;
.

Content-negotiable representations