A Memory Efficient Parallel Tridiagonal Solver

June 3, 2017 | Autor: Markus Berndt | Categoría: Distributed Shared Memory System, Linear Algebra, Linear System, Parallel Algorithm, Gaussian Elimination, Numerical Stability, Communication Complexity, Parallel Computer, Linear Equations, Coarse Grained Soil, Divide and Conquer, Numerical Stability, Communication Complexity, Parallel Computer, Linear Equations, Coarse Grained Soil, Divide and Conquer

Share Embed

Laporkan tautan ini

Descripción

We present a memory ecient 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. partitioning

Lihat lebih banyak...

A Memory Efficient Parallel Tridiagonal Solver

Descripción

Comentarios