Parallel Dichotomy Algorithm for solving tridiagonal system of linear equations with multiple right-hand sides

✍ Scribed by Andrew V. Terekhov

• Publisher: Elsevier Science
• Year: 2010
• Tongue: English
• Weight: 594 KB
• Volume: 36
• Category: Article
• ISSN: 0167-8191
• DOI: 10.1016/j.parco.2010.02.005

✦ Synopsis

A parallel algorithm for solving a series of matrix equations with a constant tridiagonal matrix and different right-hand sides is proposed and studied. The process of solving the problem is represented in two steps. The first preliminary step is calculating some rows of the inverse matrix of system of linear algebraic equations. The second step consists in calculating solutions for all right-hand sides. For reducing the communication interactions, based on the formulated and proved the main Gaussian Parallel Elimination Theorem for tridiagonal system of equations, we propose an original algorithm for calculating share components of the solution vector. Theoretical estimates validating the efficiency of the approach for both the common-and distributed-memory supercomputers are obtained. Direct and iterative methods of solving a 2D Poisson equation, which include procedures of tridiagonal matrix inversion, are realized using the MPI paradigm. Results of computational experiments on a multicomputer demonstrate a high efficiency and scalability of the parallel Dichotomy Algorithm.