A Parallel Sewing Method for Solving Tridiagonal Toeplitz Strictly Diagonally Dominant Systems

摘要

The large scale of linear systems of equations results in costly solving time. These systems usually have specific properties that can be used for designing fast algorithms. In addition, using parallel programming on distributed memory clusters enables us to get the results even faster. This work introduces a new fast parallel algorithm for solving systems with a strictly diagonally dominant three-band Toeplitz coefficient matrix. We call this new method the sewing method because the boundaries sew the adjacent subsystems together.