A parallel sewing method for solving tridiagonal Toeplitz strictly diagonally dominant systems
- Resource Type
- Conference
- Authors
- Majedi, M.; Shaw, R. E.; Garey, L. E.
- Source
- 2008 IEEE International Symposium on Parallel and Distributed Processing Parallel and Distributed Processing, 2008. IPDPS 2008. IEEE International Symposium on. :1-8 Apr, 2008
- Subject
- Computing and Processing
Communication, Networking and Broadcast Technologies
Parallel algorithms
Equations
Linear systems
Matrix decomposition
Computer science
Statistical distributions
Niobium
Large-scale systems
Algorithm design and analysis
Clustering algorithms
The sewing method
tridiagonal Toeplitz systems
Tridiagonal
strictly diagonally dominant
- Language
- ISSN
- 1530-2075
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.