A recursive decoupling method for solving tridiagonal linear systems
- 1 January 1990
- journal article
- research article
- Published by Taylor & Francis in International Journal of Computer Mathematics
- Vol. 33 (1-2) , 95-102
- https://doi.org/10.1080/00207169008803839
Abstract
In many numerical methods it is necessary to solve repeatedly tridiagonal linear systems of a certain form, i.e. diagonally dominant. By the use of repeated partitioning of the matrix into (2 × 2) subsystems it is shown that the linear system can be recursively decoupled into an explicit form suitable for solving on parallel or vector computers.Keywords
This publication has 2 references indexed in Scilit:
- The Solution of Two-Point Boundary Value Problems by the Alternating Group Explicit (AGE) MethodSIAM Journal on Scientific and Statistical Computing, 1988
- Note on the solution of certain tri-diagonal systems of linear equationsThe Computer Journal, 1963