On The Equivalence And Convergence Of Parallel Jacobi SVD Algorithms

Franklin T. Luk; Haesun Park

doi:10.1117/12.942028

21 January 1988 On The Equivalence And Convergence Of Parallel Jacobi SVD Algorithms

Franklin T. Luk, Haesun Park

Proceedings Volume 0826, Advanced Algorithms and Architectures for Signal Processing II; (1988) https://doi.org/10.1117/12.942028
Event: 31st Annual Technical Symposium on Optical and Optoelectronic Applied Sciences and Engineering, 1987, San Diego, CA, United States

Abstract

The recently exploding interest in parallel computing has given rise to many new ways to implement the Jacobi SVD algorithm. We study five new orderings for the method, and show that they are all equivalent to one another. In addition, we establish that these orderings are also equivalent to the classical cyclic-by-rows ordering and thus share the same convergence properties. To summarize, we have shown that the different researchers came up with essentially the same idea independently and concurrently, and we have proved convergence of their new methods, a hitherto open research problem.

Citation Download Citation

Franklin T. Luk and Haesun Park "On The Equivalence And Convergence Of Parallel Jacobi SVD Algorithms", Proc. SPIE 0826, Advanced Algorithms and Architectures for Signal Processing II, (21 January 1988); https://doi.org/10.1117/12.942028

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