Multigrid Algorithms on the Hypercube Multiprocessor
IEEE Transactions on Computers
SIAM Journal on Scientific and Statistical Computing
Solving problems on concurrent processors. Vol. 1: General techniques and regular problems
Solving problems on concurrent processors. Vol. 1: General techniques and regular problems
Scientific computing: an introduction with parallel computing
Scientific computing: an introduction with parallel computing
Domain-Based Parallelism and Problem Decomposition Methods in Computational Science and Engineering
Domain-Based Parallelism and Problem Decomposition Methods in Computational Science and Engineering
Iterative Methods for Sparse Linear Systems
Iterative Methods for Sparse Linear Systems
| Hi-index | 0.00 |
Iterative schemes for solving sparse linear systems arising from elliptic PDEs are very suitable for efficient implementation on large scale multiprocessors. However, these methods rely heavily on effective preconditioners which must also be amenable to parallelization. In this paper, we present a novel method to obtain a preconditioned linear system which is solved using an iterative method. Each iteration comprises of a matrix-vector product with k sparse matrices (k