The parallel recursive decoupling algorithm for solving tridiagonal linear systems
A tridiagonal equation solver is described. The method is based on a rank-one updating strategy and the repeated partitioning of the system matrix into \(2\times 2\) submatrices. The recursive decoupling algorithm is presented. This method operates on the tridiagonal linear system, enabling the solution to be expressed in explicit form and solved independently on a multiprocessor system. It is shown that the recursive decoupling method is intrinsically parallel and can be implemented as an efficient parallel algorithm. Numerical results obtained using Balance 8000 multiprocessor system are given.
- Divide and conquer: A parallel algorithm for the solution of a tridiagonal linear system of equations
- A note on the recursive decoupling method for solving tridiagonal linear systems
- An overlapped two-way method for solving tridiagonal linear systems in a BSP computer
- On recursive decoupling method for solving tridiagonal linear systems
- A recursive decoupling method for solving tridiagonal linear systems
- Existence of the new quadrant interlocking factorization for parallel solution of tridiagonal linear systems
- scientific article; zbMATH DE number 2080147 (Why is no real title available?)
- scientific article; zbMATH DE number 1484037 (Why is no real title available?)
- BLOCK PARTITIONING IN THE PARALLEL RECURSIVE DECOUPLING METHOD
- 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
- Manycore algorithms for batch scalar and block tridiagonal solvers
- A BSP recursive divide and conquer algorithm to solve a tridiagonal linear system
This page was built for publication: The parallel recursive decoupling algorithm for solving tridiagonal linear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1801376)