Paper
20 April 1988 Almost Linear Time Matrix Operations On The Connection Machine
L.Magnus Ewerbring, Franklin T Luk
Author Affiliations +
Proceedings Volume 0880, High Speed Computing; (1988) https://doi.org/10.1117/12.944052
Event: 1988 Los Angeles Symposium: O-E/LASE '88, 1988, Los Angeles, CA, United States
Abstract
Four matrix operations: matrix multiplication, the QR decomposition, the singular value decomposition, and the generalized singular value decomposition, form the basic tools for modern signal processing. This paper discusses their implementation on the 65,536-processor Connection Machine, and presents results showing that for n X n matrices, where n <256, an almost linear time performance is obtained. Our other major result is a novel method for computing the generalized singular value decomposition.
© (1988) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
L.Magnus Ewerbring and Franklin T Luk "Almost Linear Time Matrix Operations On The Connection Machine", Proc. SPIE 0880, High Speed Computing, (20 April 1988); https://doi.org/10.1117/12.944052
Lens.org Logo
CITATIONS
Cited by 3 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Matrices

Curium

Matrix multiplication

Signal processing

Evolutionary algorithms

Data communications

Data processing

Back to Top