Name
Abstract | ||
|---|---|---|
This paper shows a concept for paral- lelization of double Divide and Conquer and its pre- liminary result. For singular value decomposition, double Divide and Conquer was recently proposed. It first computes singular values by a compact ver- sion of Divide and Conquer. The corresponding singular vectors are then computed by twisted fac- torization. The speed and accuracy of double Divide and Conquer are as well or even better than stan- dard algorithms such as QR and Divide and Con- quer. In addition, it is expected that double Divide and Conquer has great parallelism because each step is theoretically parallel and heavy communication is no required. However, any parallel model of double Divide and Conquer has not been studied yet. In this paper, policy of the parallelization is discussed. Then, a parallel implementation with MPI is tested on a distributed memory parallel computer. It suc- cessfully shows a high parallelism. |
Year | Venue | Keywords |
|---|---|---|
2006 | PDPTA | parallel algorithm,high performance computing,singular value decomposition,numerical analysis,numerical algorithm,integrable system,distributed memory,parallel computer,divide and conquer,singular value |
Field | DocType | Citations |
Singular value decomposition,Standard algorithms,Singular value,Computer science,Parallel algorithm,Distributed memory parallel computer,Parallel computing,Factorization,Divide and conquer algorithms,Distributed computing | Conference | 1 |
PageRank | References | Authors |
0.39 | 6 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Taro Konda | 1 | 12 | 3.78 |
| Hiroaki Tsuboi | 2 | 2 | 1.11 |
| Masami Takata | 3 | 37 | 19.48 |
| Masashi Iwasaki | 4 | 27 | 9.42 |
| Yoshimasa Nakamura | 5 | 48 | 17.38 |