Matrix sparsification and nested dissection over arbitrary fields
From MaRDI portal
Recommendations
- An Algebraic Sparsified Nested Dissection Algorithm Using Low-Rank Approximations
- Algorithmique et calculs de complexité pour un solveur de type dissections emboîtées. (Algorithmic study and complexity bounds for a nested dissection solver)
- Fast and Efficient Parallel Solution of Sparse Linear Systems
- Sparse Matrix Factorizations for Fast Linear Solvers with Application to Laplacian Systems
- The analysis of a nested dissection algorithm
Cited in
(11)- Planar and toroidal morphs made easier
- Efficient transitive closure of sparse matrices over closed semirings
- Cliques in graphs excluding a complete graph minor
- Nested Dissection for Sparse Nullspace Bases
- Preconditioned linear solves for parametric model order reduction
- Planar and Toroidal Morphs Made Easier
- Convexity-increasing morphs of planar graphs
- Maximum matchings in geometric intersection graphs
- Solving systems of linear equations through zero forcing set
- Shelling and sinking graphs on the sphere
- Finding nonoverlapping substructures of a sparse matrix
This page was built for publication: Matrix sparsification and nested dissection over arbitrary fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5395722)
