scientific article; zbMATH DE number 554763
From MaRDI portal
Publication:4288579
Recommendations
- Nested-dissection orderings for sparse LU with partial pivoting
- Node Selection Strategies for Bottom-Up Sparse Matrix Ordering
- scientific article; zbMATH DE number 1617961
- Performance of Greedy Ordering Heuristics for Sparse Cholesky Factorization
- Fast Computation of Minimal Fill Inside A Given Elimination Ordering
Cited in
(21)- The analysis of a nested dissection algorithm
- Separators and structure prediction in sparse orthogonal factorization
- Hypergraph edge elimination -- a symbolic phase for Hermitian eigensolvers based on rank-1 modifications
- Minimum fill-in of sparse graphs: kernelization and approximation
- Minimum fill-in: inapproximability and almost tight lower bounds
- Searching for better fill-in
- scientific article; zbMATH DE number 1617961 (Why is no real title available?)
- Minimal orderings revisited
- Nested-dissection orderings for sparse LU with partial pivoting
- Fast Computation of Minimal Fill Inside A Given Elimination Ordering
- Performance of Greedy Ordering Heuristics for Sparse Cholesky Factorization
- Minimal elimination of planar graphs
- On the minimum chordal completion polytope
- Approximation algorithms in combinatorial scientific computing
- PMORSy: parallel sparse matrix ordering software for fill-in minimization
- Diagonal Markowitz Scheme with Local Symmetrization
- A column approximate minimum degree ordering algorithm
- scientific article; zbMATH DE number 7651159 (Why is no real title available?)
- On the ordering of sparse linear systems
- Complexity classification of some edge modification problems
- Minimizing elimination tree height can increase fill more than linearly
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4288579)
