Aggregation Methods for Solving Sparse Triangular Systems on Multiprocessors
From MaRDI portal
Recommendations
- A parallel algorithm for solving sparse triangular systems
- Parallel algorithms for sparse triangular system solution
- Optimal Parallel Solution of Sparse Triangular Systems
- SOLVING SPARSE TRIANGULAR LINEAR SYSTEMS ON PARALLEL COMPUTERS
- scientific article; zbMATH DE number 176382
- Parallel Solution of Triangular Systems on Distributed-Memory Multiprocessors
- Parallel algorithms for solving linear systems with sparse triangular matrices
- A parallel multithreaded sparse triangular linear system solver
- A synchronization-free algorithm for parallel sparse triangular solves
- A New Method for Solving Triangular Systems on Distributed-Memory Message-Passing Multiprocessors
Cited in
(8)- Parallel processing of biological sequence comparison algorithms
- A parallel multithreaded sparse triangular linear system solver
- Factors impacting performance of multithreaded sparse triangular solve
- A New Method for Solving Triangular Systems on Distributed-Memory Message-Passing Multiprocessors
- scientific article; zbMATH DE number 554772 (Why is no real title available?)
- Fine-grained parallel incomplete LU factorization
- Linear algebra software for large-scale accelerated multicore computing
- A survey of direct methods for sparse linear systems
This page was built for publication: Aggregation Methods for Solving Sparse Triangular Systems on Multiprocessors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3034726)