Base-p-cyclic reduction for tridiagonal systems of equations
References (5)
Divide and conquer: a new parallel algorithm for the solution of a tridiagonal linear system of equations
(1990)Bounding the error in Gaussian elimination for tridiagonal systems
SIAM J. Matrix Anal. Appl.
(1990)
There are more references available in the full text version of this article.
Cited by (11)
Developments and trends in the parallel solution of linear systems
1999, Parallel ComputingUnified framework for the parallelization of divide and conquer based tridiagonal systems
1997, Parallel ComputingReview of general and Toeplitz vector bidiagonal solvers
1996, Parallel ComputingAn implementation of a parallel iterative algorithm for the solution of large banded system on a cluster of workstations
2008, International Journal of Modelling and SimulationA data-parallel formulation for divide and conquer algorithms
2001, Computer JournalParallelization of a recursive decoupling method for solving tridiagonal linear systems on distributed memory computer
2001, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Copyright © 1991 Published by Elsevier B.V.