DocumentCode
2825242
Title
A parallel algorithm to solve symmetric tridiagonal linear systems
Author
Zhong, Yan ; Luo, Zhi-Gang ; Wu, Feng
Author_Institution
Sch. of Comput., Nat. Univ. of Defense Technol., Changsha, China
Volume
2
fYear
2010
fDate
21-24 May 2010
Abstract
For linear systems with coefficient matrices of classical structure, WZ factorizations for matrices are basic mathematical theories to design a class of parallel algorithms. Based on WZ factorization, a parallel algorithm is provided for symmetric tridiagonal linear systems. The method estimates the computation task carefully so that it assigns the system skillfully to get even load balance. In addition, the algorithm makes full use of the overlap between computation and communication to reduce waiting time in each processor. Both the subsystem assigned in each processor and the reduced subsystem have the same computing logic, as a result, a two-level method forms. By theory analysis and experiment results, it can be concluded that our method is effective in load balance and efficiency.
Keywords
mathematics computing; matrix decomposition; parallel algorithms; WZ factorization; coefficient matrices; parallel algorithm; symmetric tridiagonal linear systems; Algorithm design and analysis; Concurrent computing; Difference equations; Differential equations; Linear systems; Logic; Matrix decomposition; Parallel algorithms; Partial differential equations; Symmetric matrices; WZ factorization; parallel algorithm; symmetric tridiagonal linear system; two-level method;
fLanguage
English
Publisher
ieee
Conference_Titel
Future Computer and Communication (ICFCC), 2010 2nd International Conference on
Conference_Location
Wuhan
Print_ISBN
978-1-4244-5821-9
Type
conf
DOI
10.1109/ICFCC.2010.5497408
Filename
5497408
Link To Document