Divide and conquer methods for block tridiagonal systems
- 1 March 1993
- journal article
- research article
- Published by Elsevier in Parallel Computing
- Vol. 19 (3) , 257-279
- https://doi.org/10.1016/0167-8191(93)90037-l
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Convergence of block iterative methods for linear systems arising in the numerical solution of Euler equationsNumerische Mathematik, 1991
- Divide and conquer: A new parallel algorithm for the solution of a tridiagonal linear system of equationsPublished by Springer Nature ,1990
- Parallel methods for tridiagonal equationsComputing, 1988
- Solving Tridiagonal Systems on Ensemble ArchitecturesSIAM Journal on Scientific and Statistical Computing, 1987
- A Fully Parallel Algorithm for the Symmetric Eigenvalue ProblemSIAM Journal on Scientific and Statistical Computing, 1987
- Iterative Methods for the Solution of Elliptic Problems on Regions Partitioned into SubstructuresSIAM Journal on Numerical Analysis, 1986
- A parallel partition method for solving banded systems of linear equationsParallel Computing, 1985
- On classes of matrices containing M-matrices and hermitian positive semidefinite matricesLinear Algebra and its Applications, 1984
- The Solution of Tridiagonal Linear Systems on the CDC STAR 100 ComputerACM Transactions on Mathematical Software, 1975
- NOTE ON M-MATRICESThe Quarterly Journal of Mathematics, 1960