Implementation of the singular-value decomposition on the Connection Machine CM-2
Technical Report
·
OSTI ID:5439679
In modern digital signal processing, the singular value decomposition is increasingly recognized as an important mathematical tool. The true measure of usefulness of such a tool is very much dependent on the ability to compute it at supercomputer throughput rates. This report describes an implementation of the singular value decomposition (SVD) on the Connection Machine CM-2 using parallel Fortran. The algorithm is based on Hestenes's, which is a Jacobi iteration in which pairs of rows are rotated to become orthogonal. The Fortran implementation of this algorithm on a full CM-2 is comparable in execution speed to the Linpack implementation on a Convex C220 processor.
- Research Organization:
- Naval Research Lab., Washington, DC (United States)
- OSTI ID:
- 5439679
- Report Number(s):
- AD-A-234124/6/XAB; NRL--9318
- Country of Publication:
- United States
- Language:
- English
Similar Records
A multiprocessor scheme for the singular value decomposition
Modifying the singular value decompositions on the connection machine
Finite-precision arithmetic in singular-value decomposition architectures
Conference
·
Sat Aug 01 00:00:00 EDT 1987
·
OSTI ID:5576354
Modifying the singular value decompositions on the connection machine
Conference
·
Thu Nov 30 23:00:00 EST 1995
·
OSTI ID:125463
Finite-precision arithmetic in singular-value decomposition architectures
Thesis/Dissertation
·
Wed Dec 31 23:00:00 EST 1986
·
OSTI ID:6818788