Computing the Singular Value Decomposition on the Connection Machine

Authors:
L. M. Ewerbring;F. T. Luk
Affiliations:
-;-
Venue:
IEEE Transactions on Computers
Year:
1990

Citing 5
Cited 3

The Saxpy Matrix-1: A General-Purpose Systolic Computer

Computer
A one-sided Jacobi algorithm for computing the singular value decomposition on avector computer

SIAM Journal on Scientific and Statistical Computing
A Proof of Convergence for Two Parallel Jacobi SVD Algorithms

IEEE Transactions on Computers
Computing the Singular-Value Decomposition on the ILLIAC IV

ACM Transactions on Mathematical Software (TOMS)
The Block Jacobi Method for Computing the Singular Value Decomposition

The Block Jacobi Method for Computing the Singular Value Decomposition

An algorithm for the generalized singular value decomposition on massively parallel computers

ICS '91 Proceedings of the 5th international conference on Supercomputing
An efficient method for computing eigenvalues of a real normal matrix

Journal of Parallel and Distributed Computing
Generation of Phonetic Units for Mixed-Language Speech Recognition Based on Acoustic and Contextual Analysis

IEEE Transactions on Computers

Quantified Score

Hi-index	14.98

Visualization

Abstract

Consideration is given to the computation of the singular value decomposition (SVD) on the Connection Machine (CM). Brief descriptions of the Lisp language and some typical matrix manipulating functions are given. Implementation details of various Jacobi-SVD algorithms on an 8192-processor CM are presented. For n*n matrices, where nor=64, the decomposition is computed in time O(n) per sweep.