A parallel algorithm for solving sparse triangular systems
From MaRDI portal
Publication:5375447
DOI10.1109/12.53610zbMATH Open1397.65065OpenAlexW2000414496MaRDI QIDQ5375447FDOQ5375447
Authors: Chin-Wen Ho, R. C. T. Lee
Publication date: 14 September 2018
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/12.53610
Cited In (6)
- Title not available (Why is that?)
- 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)