Abstract
Parallel complexity results for designing banded triangular solvers are provided. In particular, several lower bounds based on data layout and communication along a ring are derived based on solving such systems using substitution. Lastly, a near-optimal solver for a ring is discussed and provided.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 169-180 |
| Number of pages | 12 |
| Journal | Journal of Mathematical Modelling and Algorithms |
| Volume | 1 |
| Issue number | 3 |
| DOIs | |
| State | Published - 2002 |
| Externally published | Yes |
Keywords
- algorithms and complexity
- banded systems
- numerical linear algebra
- ring topology
- triangular solvers
ASJC Scopus subject areas
- Modeling and Simulation
- Applied Mathematics