Share Email Print

Proceedings Paper

Almost Linear Time Matrix Operations On The Connection Machine
Author(s): L.Magnus Ewerbring; Franklin T Luk
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

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

Paper Details

Date Published: 20 April 1988
PDF: 8 pages
Proc. SPIE 0880, High Speed Computing, (20 April 1988); doi: 10.1117/12.944052
Show Author Affiliations
L.Magnus Ewerbring, Cornell University (United States)
Franklin T Luk, Cornell University (United States)

Published in SPIE Proceedings Vol. 0880:
High Speed Computing
David P. Casasent, Editor(s)

© SPIE. Terms of Use
Back to Top