A memory efficient parallel tridiagonal solver

Cite Details

Travis Austin, Markus Berndt and David Moulton, "A memory efficient parallel tridiagonal solver", Preprint LA-UR-03-4149, 2004

PDF

HTML

Abstract

We present a memory efficient parallel algorithm for the solution of tridiagonal linear systems of equations that are diagonally dominant on a very large number of processors. Our algorithm can be viewed as a parallel partitioning algorithm. We illustrate its performance using some examples. Based on this partitioning algorithm, we introduce a recursive version that has logarithmic communication complexity.

BibTeX Entry

@unpublished{austin-2004-linesolver,

author = {Travis Austin and Markus Berndt and David Moulton},

title = {A memory efficient parallel tridiagonal solver},

year = {2004},

urlpdf = {http://math.lanl.gov/~berndt/Papers/parallel-line-solver.pdf},

urlps = {http://math.lanl.gov/~berndt/Papers/parallel-line-solver.ps},

note = {Preprint LA-UR-03-4149}

}