Title :
An Evaluation of Double Divide and Conquer on a Multi-core
Author :
Konda, Taro ; Toyokawa, Hiroki ; Nakamura, Yoshimasa
Author_Institution :
Kyoto Univ., Kyoto
Abstract :
For bidiagonal SVD, double Divide and Conquer was proposed. It first computes singular values by a compact version of Divide and Conquer. The corresponding singular vectors are then computed by twisted factorization. The speed and accuracy of double Divide and Conquer are as good or even better than standard algorithms such as QR and the original Divide and Conquer. Moreover, it shows high scalability even on a PC cluster, distributed memory architecture. This paper presents an evaluation of parallel double Divide and Conquer for singular value decomposition on a multi-core architecture.
Keywords :
divide and conquer methods; multiprocessing systems; singular value decomposition; PC cluster; bidiagonal SVD; distributed memory architecture; double divide and conquer; multicore architecture; singular vectors; twisted factorization; Clustering algorithms; Computer architecture; Concurrent computing; Informatics; Matrix converters; Matrix decomposition; Memory architecture; Parallel processing; Scalability; Singular value decomposition; multi-core; parallel algorithm; singular value decomposition;
Conference_Titel :
Informatics Education and Research for Knowledge-Circulating Society, 2008. ICKS 2008. International Conference on
Conference_Location :
Kyoto
Print_ISBN :
978-0-7695-3128-1
DOI :
10.1109/ICKS.2008.30