The analysis of a nested dissection algorithm
From MaRDI portal
(Redirected from Publication:1103322)
Recommendations
- Algorithmique et calculs de complexité pour un solveur de type dissections emboîtées. (Algorithmic study and complexity bounds for a nested dissection solver)
- Calculs de complexité relatifs à une méthode de dissection emboîtée
- Fast Nested Dissection for Finite Element Meshes
- scientific article; zbMATH DE number 4074330
- scientific article; zbMATH DE number 554763
Cites work
- scientific article; zbMATH DE number 3816913 (Why is no real title available?)
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- scientific article; zbMATH DE number 3420184 (Why is no real title available?)
- A Separator Theorem for Chordal Graphs
- A Separator Theorem for Planar Graphs
- A separator theorem for graphs of bounded genus
- Algorithmic Aspects of Vertex Elimination on Graphs
- An Automatic Nested Dissection Algorithm for Irregular Finite Element Problems
- Computing the Minimum Fill-In is NP-Complete
- Decomposition of Finite Graphs Into Forests
- Generalized Nested Dissection
- Nested Dissection of a Regular Finite Element Mesh
- On the Problem of Partitioning Planar Graphs
- The Use of Linear Graphs in Gauss Elimination
Cited in
(28)- A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem
- A survey of direct methods for sparse linear systems
- scientific article; zbMATH DE number 4121291 (Why is no real title available?)
- Analysis of Dehn's algorithm by critical pairs
- Compression, inversion, and approximate PCA of dense kernel matrices at near-linear computational complexity
- Customizable contraction hierarchies
- Étude de la séparation et de l'élimination sur une famille de graphes quotients déduite d'une méthode de dissections emboîtées
- A parallel graph partitioning algorithm for a message-passing multiprocessor
- Algorithmique et calculs de complexité pour un solveur de type dissections emboîtées. (Algorithmic study and complexity bounds for a nested dissection solver)
- scientific article; zbMATH DE number 4074330 (Why is no real title available?)
- Efficient approximate solution of sparse linear systems
- On the stabbing number of a random Delaunay triangulation
- Search-space size in contraction hierarchies
- LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison
- Almost exact matchings
- Fast separator decomposition for finite element meshes
- Analysis of Knoop indentation
- Parallel computation of a Krylov matrix for a sparse and structured input
- Minimum fill-in: inapproximability and almost tight lower bounds
- Building graph separators with the recursive rotation algorithm for the nested dissection method
- Maximum matchings in geometric intersection graphs
- Communication lower bounds and optimal algorithms for numerical linear algebra
- Solution of sparse positive definite systems on a hypercube
- Matrix sparsification and nested dissection over arbitrary fields
- Tree decompositions and social graphs
- Graph bisection with Pareto optimization
- Calculs de complexité relatifs à une méthode de dissection emboîtée
- A parallel sparse direct solver via hierarchical DAG scheduling
This page was built for publication: The analysis of a nested dissection algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1103322)
