Name
Abstract | ||
|---|---|---|
A parallel algorithm is proposed for the solution of narrow banded non-symmetric linear systems. The linear system is partitioned into blocks of rows with a small number of unknown ns common to multiple blocks. Our technique yields a reduced system defined only on these common unknowns which can then be solved by a direct or iterative method. A projection based extension to this approach is also proposed for computing the reduced system implicitly, which gives rise to an inner-outer iteration method. In addition, the product of a vector. with the reduced system matrix can be computed efficiently on a multiprocessor by concurrent projections onto subspaces of block rows. Scalable implementations of the algorithm can be devized for hierarchical parallel architectures by exploiting the two-level parallelism inherent in the method. Our experiments indicate that the proposed algorithm is a robust and competitive alternative to existing methods, particularly for difficult problems with strong indefinite symmetric part. Copyright (C) 2001 John Wiley & Sons, Ltd. |
Year | DOI | Venue |
|---|---|---|
2001 | 10.1002/nla.241 | NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS |
Keywords | Field | DocType |
sparse linear systems,iterative methods,inner-outer,projections,parallel computation | Row,Small number,Mathematical optimization,Linear system,Iterative method,Parallel algorithm,Multiprocessing,Linear subspace,Mathematics,Scalability | Journal |
Volume | Issue | ISSN |
8 | 5 | 1070-5325 |
Citations | PageRank | References |
4 | 0.60 | 3 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Gene H. Golub | 1 | 2558 | 856.07 |
| Ahmed H. Sameh | 2 | 297 | 139.93 |
| Vivek Sarin | 3 | 102 | 19.50 |