Share Email Print

Proceedings Paper

On The Equivalence And Convergence Of Parallel Jacobi SVD Algorithms
Author(s): Franklin T. Luk; Haesun Park
Format Member Price Non-Member Price
PDF $17.00 $21.00

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

Paper Details

Date Published: 21 January 1988
PDF: 8 pages
Proc. SPIE 0826, Advanced Algorithms and Architectures for Signal Processing II, (21 January 1988); doi: 10.1117/12.942028
Show Author Affiliations
Franklin T. Luk, Cornell University (United States)
Haesun Park, University of Minnesota (United States)

Published in SPIE Proceedings Vol. 0826:
Advanced Algorithms and Architectures for Signal Processing II
Franklin T. Luk, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?