Parallel dichotomy algorithm for solving tridiagonal SLAEs
12
TL;DR: A parallel algorithm for solving a series of matrix equations with a constant tridiagonal matrix and different right-hand sides is proposed and studied in this article, where the process of solving the problem is represented in two steps.
read more
Abstract: 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.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
A fast parallel algorithm for solving block-tridiagonal systems of linear equations including the domain decomposition method
TL;DR: This study develops a new parallel algorithm for solving systems of linear algebraic equations with the same block-tridiagonal matrix but with different right-hand sides and proposes a parallel realization of the domain decomposition method (the Schur complement method).
High-performance modeling acoustic and elastic waves using the parallel Dichotomy Algorithm
TL;DR: The proposed parallel fine-mesh algorithm enabled to solve real application seismic problems in acceptable time and with high accuracy and was demonstrated that the considered parallel algorithm possesses high performance and efficiency over a wide range of the number of processors.
24
A fast parallel algorithm for solving block-tridiagonal systems of linear equations including the domain decomposition method
Andrew V. Terekhov
- 01 Jun 2013
TL;DR: In this paper, a parallel algorithm for solving block-tridiagonal systems of equations is presented, which is an effective and simple set of procedures for solving engineering tasks on a supercomputer.
24
A highly scalable parallel algorithm for solving Toeplitz tridiagonal systems of linear equations
TL;DR: A modification of the "Dichotomy Algorithm" (Terekhov, 2010) is proposed, aimed at parallel realization of a broad class of numerical methods including the inversion of Toeplitz and quasi-Toeplitzer tridiagonal matrices.
The Laguerre finite difference one-way equation solver
TL;DR: A new finite difference algorithm for solving the 2D one-way wave equation with a preliminary approximation of a pseudo-differential operator by a system of partial differential equations using the integral Laguerre transform instead of Fourier transform is presented.
11
References
A Fast Direct Solution of Poisson's Equation Using Fourier Analysis
TL;DR: This work has developed a direct method of solution involving Fourier analysis which can solve Poisson''s equation in a square region covered by a 48 x 48 mesh in 0.9 seconds on the IBM 7090.
715
A parallel algorithm for solving general tridiagonal equations
TL;DR: A parallel algorithm for the solution of the general tridiagonal system is presented, based on an efficient implementation of Cramer's rule, in which the only divisions are by the determinant of the matrix.
The explicit inverse of a tridiagonal matrix
TL;DR: In this paper, it was shown that the closed form inverse of a tridiagonal matrix can be computed by integer arithmetic without machine roundoff error, without machine rounding off error.
34
A parallel and scalable algorithm for ADI method with pre-propagation and message vectorization
Akiyoshi Wakatani
- 01 Dec 2004
TL;DR: An improved version of the P-scheme with "message vectorization" which aggregates several communication messages into one and alleviates the communication cost of the propagation phase of the scheme is proposed.
18