A parallel algorithm for solving sparse triangular systems
From MaRDI portal
Publication:5375447
Cited in
(6)- scientific article; zbMATH DE number 5722792 (Why is no real title available?)
- A New Method for Solving Triangular Systems on Distributed-Memory Message-Passing Multiprocessors
- A Fast Reordering Algorithm for Parallel Sparse Triangular Solution
- On designing optimal parallel triangular solvers.
- Aggregation Methods for Solving Sparse Triangular Systems on Multiprocessors
- Efficient parallel Gauss-Doolittle matrix triangulation
This page was built for publication: A parallel algorithm for solving sparse triangular systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5375447)