PRECONDITIONED PARALLEL BLOCK–JACOBI SVD ALGORITHM
Abstract
We show experimentally, that the QR factorization with the complete column pivoting, optionally followed by the LQ factorization of the R-factor, can lead to a substantial decrease of the number of outer parallel iteration steps in the parallel block-Jacobi SVD algorithm, whereby the details depend on the condition number and on the shape of spectrum, including the multiplicity of singular values. Best results were achieved for well-conditioned matrices with a multiple minimal singular value, where the number of parallel iteration steps has been reduced by two orders of magnitude. However, the gain in speed, as measured by the total parallel execution time, depends decisively on how efficient is the implementation of the distributed QR and LQ factorizations on a given parallel architecture. In general, the reduction of the total parallel execution time up to one order of magnitude has been achieved.
References
-
Z. Bai , Templates for the solution of algebraic eigenvalue problems: A practical guide ( SIAM , Philadelphia , 2000 ) . Crossref, Google Scholar - Parallel Computing 28, 243 (2002). Crossref, Google Scholar
- SIAM J. Matrix Anal. Appl. 13, 1204 (1992). Crossref, ISI, Google Scholar
- Z. Drmač and K. Veselić, New fast and accurate Jacobi SVD algorithm, manuscript, 2004 . Google Scholar
- SIAM J. Sci. Comput. 20, 1336 (1999). Crossref, ISI, Google Scholar


