A fast parallel algorithm for solving block-tridiagonal systems of linear equations including the domain decomposition method
arXiv:1108.4181 · doi:10.1016/j.parco.2013.03.003
Abstract
In this study, we develop a new parallel algorithm for solving systems of linear algebraic equations with the same block-tridiagonal matrix but with different right-hand sides. The method is a generalization of the parallel dichotomy algorithm for solving systems of linear equations with tridiagonal matrices \cite{terekhov:Dichotomy}. Using this approach, we propose a parallel realization of the domain decomposition method (\mbox{the Schur} complement method). The calculation of acoustic wave fields using the spectral-difference technique improves the efficiency of the parallel algorithms. A near-linear dependence of the speedup with the number of processors is attained using both several and several thousands of processors. This study is innovative because the parallel algorithm developed for solving block-tridiagonal systems of equations is an effective and simple set of procedures for solving engineering tasks on a supercomputer.
The title and the abstract of the paper have been updated. The final version of the paper is published at The Parallel Computing
References in corpus (4)
- Parallel dichotomy algorithm for solving tridiagonal SLAEs
- High-performance modeling acoustic and elastic waves using the Parallel Dichotomy Algorithm
- Application of the Parallel Dichotomy Algorithm for solving Toeplitz tridiagonal systems of linear equations with one right-hand side
- High performance parallel algorithm for solving elliptic equations with non-separable variables