Abstract
The serial Jacobi algorithm (either one-sided or two-sided) for the computation of a singular value decomposition (SVD) of a general matrix has excellent numerical properties and parallelization potential, but it is considered to be the slowest method for computing the SVD. Even its parallelization with some parallel cyclic (static) ordering of subproblems does not lead to much improvement when comparing with parallel methods based on the matrix bi-diagonalization principle. However, in the last 10 years some progress has been achieved in increasing the efficiency of the parallel block-Jacobi SVD method by using two new ideas: (i) the new parallel dynamic ordering of subproblems, and, (ii) the matrix pre-processing by QR iterations. For the parallel two-sided block-Jacobi algorithm, these ideas were already thoroughly tested on various parallel platforms, and our implementation can be faster than the ScaLAPACK routine PDGESVD for some distributions of singular values. With respect to the one-sided variant, the new parallel dynamic ordering, when compared to parallel cyclic ordering, can substantially decrease the number of parallel iteration steps needed for the convergence. However, its more scalable implementation is desirable because currently it occupies a relatively high portion of the total parallel execution time.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Barrett, R., Berry, M., Chan, T., Demmell, J., Donato, J., Dongarra, J., Eijkhout, V., Pozo, R., Romine, C., van der Vorst, H.: Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods. SIAM, Philadelphia (1993)
Bečka, M., Okša, G., Vajteršic, M., Grigori, L.: On iterative QR pre-processing in the parallel block-Jacobi SVD algorithm. Parallel Comput. 36, 297–307 (2010)
Bečka, M., Okša, G.: On variable blocking factor in a parallel dynamic block-Jacobi SVD algorithm. Parallel Comput. 28, 1153–1174 (2003)
Bečka, M., Okša, G., Vajteršic, M.: Dynamic ordering for a parallel block-Jacobi SVD algorithm. Parallel Comput. 28, 243–262 (2002)
Bečka, M., Vajteršic, M.: Block-Jacobi SVD algorithms for distributed memory systems: I. hypercubes and rings. Parallel Algorithms Appl. 13, 265–287 (1999)
Bečka, M., Vajteršic, M.: Block-Jacobi SVD algorithms for distributed memory systems: II. meshes. Parallel Algorithms Appl. 14, 37–56 (1999)
Demmel, J.: Applied Numerical Linear Algebra, 1st edn. Philadelphia, SIAM (1997)
Demmel, J., Kahan, W.: Accurate singular values of bidiagonal matrices. SIAM J. Sci. Stat. Comput. 11, 873–912 (1990)
Demmel, J., Veselić, K.: Jacobi’s method is more accurate than QR. SIAM J. Matrix Anal. Appl. 13, 1204–1245 (1992)
Dhillon, I.: Current inverse iteration software can fail. BIT Numer. Math. 38, 685–704 (1998)
Drmač, Z., Veselić, K.: New fast and accurate Jacobi SVD algorithm: I. Tech. rep. (2005)
Drmač, Z., Veselić, K.: New fast and accurate Jacobi SVD algorithm: II. Tech. rep. (2005)
Golub, G., Van Loan, C.: Matrix Computations, 3rd edn. Johns Hopkins University Press, Baltimore (1996)
Jacobi, C.: Über ein leichtes verfahren die in der theorie der säculärstörungen vorkom menden gleichungen numerisch aufzulösen. Crelle’s J. für reine und angewandte Mathematik 30, 51–94 (1846)
Okša, G., Vajteršic, M.: Efficient preprocessing in the parallel block-Jacobi SVD algorithm. Parallel Comput. 31, 166–176 (2005)
Stewart, G.: Matrix Algorithms, vol. II: Eigensystems, 1st edn. SIAM, Philadelphia (2001)
Acknowledgements
The authors were supported by the VEGA grant no. 2/0003/11 from the Scientific Grant Agency of the Ministry of Education and Slovak Academy of Sciences, Slovakia.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag London Limited
About this chapter
Cite this chapter
Bečka, M., Okša, G., Vajteršic, M. (2012). Parallel Block-Jacobi SVD Methods. In: Berry, M., et al. High-Performance Scientific Computing. Springer, London. https://doi.org/10.1007/978-1-4471-2437-5_9
Download citation
DOI: https://doi.org/10.1007/978-1-4471-2437-5_9
Publisher Name: Springer, London
Print ISBN: 978-1-4471-2436-8
Online ISBN: 978-1-4471-2437-5
eBook Packages: Computer ScienceComputer Science (R0)