Gauss matrix sweep algorithm for solving linear systems with block-fivediagonal matrices on multiCore CPU

2019 ◽  
Author(s):  
Elena N. Akimova ◽  
Arsel R. Muginov



Author(s):  
A. A. Zgirouski ◽  
N. A. Likhoded

The topic of this paper refers to efficient parallel solvers of block-tridiagonal linear systems of equations. Such systems occur in numerous modeling problems and require usage of high-performance multicore computation systems. One of the widely used methods for solving block-tridiagonal linear systems in parallel is the original block-tridiagonal sweep method. We consider the algorithm based on the partitioning idea. Firstly, the initial matrix is split into parts and transformations are applied to each part independently to obtain equations of a reduced block-tridiagonal system. Secondly, the reduced system is solved sequentially using the classic Thomas algorithm. Finally, all the parts are solved in parallel using the solutions of a reduced system. We propose a modification of this method. It was justified that if known stability conditions for the matrix sweep method are satisfied, then the proposed modification is stable as well.



Author(s):  
Olof Staffans
Keyword(s):  


Author(s):  
Philip E. Sarachik
Keyword(s):  


1992 ◽  
Vol 2 (8) ◽  
pp. 1547-1555
Author(s):  
D. M. Calistru ◽  
R. Mondescu ◽  
I. Baltog


2020 ◽  
Vol 140 (12) ◽  
pp. 832-841
Author(s):  
Lijun Liu ◽  
Kazuaki Sekiya ◽  
Masao Ogino ◽  
Koki Masui


Sign in / Sign up

Export Citation Format

Share Document