DocumentCode :
3730736
Title :
Parallel algorithm for solving penta-diagonal linear systems
Author :
Cheng Zhu; Kenli Li; Wangdong Yang; Xu Zhou
Author_Institution :
College of Information Science and Engineering, Department of Computer Science, Hunan University, Changsha, China 410082
fYear :
2015
Firstpage :
2437
Lastpage :
2442
Abstract :
According to the parallel algorithms for solving tridiagonal linear systems, we studied the parallel algorithms for solving penta-diagonal linear systems. In the parallel solutions for tridiagonal linear systems-cyclic reduction method (CR), recursive doubling method (RD) and the partition method (PD), however, only the cyclic reduction algorithm can be used to solve the penta-diagonal linear systems. Compared with the serial algorithm of solving penta-diagonal linear systems-Gaussion elimination, cyclic reduction algorithm has obvious advantages. In this paper, we evaluated these methods by their execution time. According to the measured datas, the cyclic reduction algorithm has been implemented via multi-threads. The efficiency of Cyclic reduction algorithm is more efficient than the Gaussion algorithm by 23.74%.
Keywords :
"Algorithm design and analysis","Linear systems","Mathematical model","Parallel algorithms","Partitioning algorithms","Computers","Iterative methods"
Publisher :
ieee
Conference_Titel :
Fuzzy Systems and Knowledge Discovery (FSKD), 2015 12th International Conference on
Type :
conf
DOI :
10.1109/FSKD.2015.7382336
Filename :
7382336
Link To Document :
بازگشت