A Fast Reordering Algorithm for Parallel Sparse Triangular Solution
From MaRDI portal
Recommendations
- A parallel algorithm for solving sparse triangular systems
- scientific article; zbMATH DE number 176382
- Parallel algorithms for sparse triangular system solution
- A synchronization-free algorithm for parallel sparse triangular solves
- Optimal Parallel Solution of Sparse Triangular Systems
- scientific article; zbMATH DE number 554768
- A Fast Algorithm for Reordering Sparse Matrices for Parallel Factorization
- Parallel algorithms for solving linear systems with sparse triangular matrices
- A locally optimized reordering algorithm and its application to a parallel sparse linear system solver
- SOLVING SPARSE TRIANGULAR LINEAR SYSTEMS ON PARALLEL COMPUTERS
Cited in
(12)- Partitioning a chordal graph into transitive subgraphs for parallel sparse triangular solution
- A locally optimized reordering algorithm and its application to a parallel sparse linear system solver
- A clique tree algorithm for partitioning a chordal graph into transitive subgraphs
- A parallel multithreaded sparse triangular linear system solver
- Updating incomplete factorization preconditioners for model order reduction
- Algorithmic Aspects of Elimination Trees for Sparse Unsymmetric Matrices
- scientific article; zbMATH DE number 176382 (Why is no real title available?)
- scientific article; zbMATH DE number 554768 (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
- Fast and effective reordering of columns within supernodes using partition refinement
This page was built for publication: A Fast Reordering Algorithm for Parallel Sparse Triangular Solution
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3991056)