Los Alamos National Laboratory
Phone| Search
T-7 HomeResearchHighlights › Parallel Line Solve
› Contact › People › Research
› Projects › Highlights
› Publications
› LANL/DOE AMR › Summer Programs › Jobs › Visitor Info

A Memory Efficient Parallel Tridiagonal Solver

Travis Austin
Markus Berndt
David Moulton

Large tridiagonal systems of linear equations appear in many numerical analysis applications. In our work, they arise in line relaxations needed by robust multigrid methods, such as the parallel BoxMG code, for structured grid problems. We present a new memory efficient partitioning algorithm for the solution of diagonally dominant tridiagonal linear systems of equations that scales well on distributed memory parallel computers. This algorithm is in the class of partitioning algorithms. Its multi-level recursive design makes it well suited for distributed memory parallel computers with very large numbers of processors.