Parallelization and vectorization aspects of the solution of tridiagonal linear systems
The solution of one or several tridiagonal systems is one of the basic operations in numerical computations. The authors develop, investigate and compare some parallel tridiagonal system solvers suitable for message-based MIMD computers with vector processors. The basic idea of the algorithm presented consists in subdividing the tridiagonal system into p \((=\) number of processes) parts by splitting the ``interface equations which couple the parts, eliminating the ``inner unknowns, solving the assembled ``interface system for the coupling unknowns, and calculating back the ``inner unknowns. The elimination of the ``inner unkowns and the back-calculation can be fully done in parallel. Only the assembling and the solution of the ``interface system is connected with communication between the processors. The several solution strategies discussed in the paper were tested and compared on the iPSC2-VX.
- Parallel factorizations and parallel solvers for tridiagonal linear systems
- A parallel algorithm for solving tridiagonal linear systems
- scientific article; zbMATH DE number 1760070
- Analysis of a parallel solution method for tridiagonal linear systems
- A fast parallel algorithm for the solution of tridiagonal linear systems
- Parallel methods for tridiagonal equations
- scientific article; zbMATH DE number 624932
- Parallel solution of block tridiagonal linear systems
- scientific article; zbMATH DE number 4003350
- On optimal message vector length for block single parallel partition algorithm in a three-dimensional ADI solver
- Large tridiagonal and block tridiagonal linear systems on vector and parallel computers
- Parallel methods for tridiagonal equations
- Solving tridiagonal systems of linear equations on the IBM 3090 VF
- A fast vector algorithm for solving tridiagonal linear equations
- Performance of parallel solution of a block-tridiagonal linear system on Fujitsu VPP500
- On the parallel solution of tridiagonal systems by wrap-around partitioning and incomplete LU factorization
- Solving the tridiagonal linear system and Poisson's equation over a LAN-based computing platform using distributed shared memory
- An overlapped two-way method for solving tridiagonal linear systems in a BSP computer
- A parallel implementation of Wang's method for solving tridiagonal systems
- Accelerated Thomas Solver for (Quasi-)Block-Tridiagonal Linear Algebraic Equation Systems, Using SSE/AVX Instruction Sets for Vectorizing Dense Block Operations
- A block SPP algorithm for multidimensional tridiagonal equations with optimal message vector length
- Optimizing Tridiagonal Solvers for Alternating Direction Methods on Boolean Cube Multiprocessors
- scientific article; zbMATH DE number 3956314 (Why is no real title available?)
- A fast parallel algorithm for the solution of tridiagonal linear systems
- Existence of the new quadrant interlocking factorization for parallel solution of tridiagonal linear systems
- Generalized scans and tri-diagonal systems
- scientific article; zbMATH DE number 4003350 (Why is no real title available?)
- On the existence of the new quadrant interlocking factorization for parallel solution of tridiagonal linear systems
- A direct incomplete factorization method for parallel solution of tridiagonal linear systems
- Interlacing Properties of Tridiagonal Symmetric Matrices with Applications to Parallel Computing
- Geometric multigrid with applications to computational fluid dynamics
- Vectorized algorithms for solving special tridiagonal systems
- A tridiagonal solver for massively parallel computer systems
This page was built for publication: Parallelization and vectorization aspects of the solution of tridiagonal linear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q913446)
