Almost Linear Time Matrix Operations On The Connection Machine

L.Magnus Ewerbring; Franklin T Luk

doi:10.1117/12.944052

20 April 1988 Almost Linear Time Matrix Operations On The Connection Machine

L.Magnus Ewerbring, Franklin T Luk

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.

Citation Download Citation

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

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available