Mathematics – Numerical Analysis
Scientific paper
2009-01-19
Parallel Computing , Volume 36 Issue 8, August, 2010
Mathematics
Numerical Analysis
18 pages
Scientific paper
10.1016/j.parco.2010.02.005
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 fixing some rows of the inverse matrix of SLAEs. The second step consists in calculating solutions for all right-hand sides. For reducing the communication interactions, based on the formulated and proved main parallel sweep theorem, 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 technology. Results of computational experiments on a multicomputer demonstrate a high efficiency and scalability of the parallel sweep algorithm.
No associations
LandOfFree
Parallel dichotomy algorithm for solving tridiagonal SLAEs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Parallel dichotomy algorithm for solving tridiagonal SLAEs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Parallel dichotomy algorithm for solving tridiagonal SLAEs will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-566784