Modified Cyclic Algorithms for Solving Triangular Systems on Distributed-Memory Multiprocessors
From MaRDI portal
Publication:3788967
DOI10.1137/0909038zbMATH Open0645.65014OpenAlexW1992421129MaRDI QIDQ3788967FDOQ3788967
Authors: Stanley C. Eisenstat, Michael T. Heath, Charles S. Henkel, Charles H. Romine
Publication date: 1988
Published in: SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0909038
Recommendations
- Cyclic block-algorithms for solving triangular systems on distributed-memory multiprocessors with mesh topology
- SOLVING SPARSE TRIANGULAR LINEAR SYSTEMS ON PARALLEL COMPUTERS
- Parallel Solution of Triangular Systems on Distributed-Memory Multiprocessors
- A New Method for Solving Triangular Systems on Distributed-Memory Message-Passing Multiprocessors
- A Parallel Triangular Solver for a Distributed-Memory Multiprocessor
Direct numerical methods for linear systems and matrix inversion (65F05) Parallel numerical computation (65Y05)
Cited In (7)
- Least squares modifications with inverse factorizations: Parallel implications
- A New Method for Solving Triangular Systems on Distributed-Memory Message-Passing Multiprocessors
- On designing optimal parallel triangular solvers.
- Coarse-grain parallelizations of interval algorithms decomposing dense matrices and solving triangular systems on multicomputers
- Solution of sparse positive definite systems on a hypercube
- A reliable linear algebra library for transputer networks
- Minimizing communication penalty of triangular solvers by runtime mesh configuration and workload redistribution
This page was built for publication: Modified Cyclic Algorithms for Solving Triangular Systems on Distributed-Memory Multiprocessors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3788967)