Generalized Nested Dissection
From MaRDI portal
finite element problemsnested dissectionplanar graphsseparatorssparse Gaussian eliminationsparse graphssymmetric positive definite matrix
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Factorization of matrices (15A23) Direct numerical methods for linear systems and matrix inversion (65F05) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Cited in
(only showing first 100 items - show all)- Finding small simple cycle separators for 2-connected planar graphs
- Efficient solutions of hierarchical systems of linear equations
- Parallel nested dissection for path algebra computations
- The analysis of a nested dissection algorithm
- A parallel graph partitioning algorithm for a message-passing multiprocessor
- Algorithms for multicommodity flows in planar graphs
- Local optimization on graphs
- Solution of sparse positive definite systems on a hypercube
- Efficient approximate solution of sparse linear systems
- Not all planar digraphs have small cycle separators
- Edge separators for graphs of bounded genus with applications
- Testing the necklace condition for shortest tours and optimal factors in the plane
- Flow in planar graphs with vertex capacities
- Provably good mesh generation
- Supersonic viscous perfect gas flow past a circular cylinder
- Separators and structure prediction in sparse orthogonal factorization
- Treewidth for graphs with small chordality
- Refining an approximate inverse
- Numerical linear algebra algorithms and software
- Symbolic and numeric methods for exploiting structure in constructing resultant matrices
- Underestimated cost of targeted attacks on complex networks
- Planar minimally rigid graphs and pseudo-triangulations
- Dividing and conquering the square
- Steady flow with separation past a thin airfoil at high Reynolds numbers
- Efficient parallel linear programming
- Fast and efficient solution of path algebra problems
- Preconditioning techniques for large linear systems: A survey
- A new approach to solving three combinatorial enumeration problems on planar graphs
- Parallel computation of a Krylov matrix for a sparse and structured input
- Preconditioning for sparse linear systems at the dawn of the 21st century: history, current developments, and future perspectives
- Valid inequalities and lifting procedures for the shortest path problem in digraphs with negative cycles
- Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion
- Samplets: construction and scattered data compression
- A multilevel approach for trace system in HDG discretizations
- A fast direct solver for nonlocal operators in wavelet coordinates
- Planar and toroidal morphs made easier
- A Fourier-accelerated volume integral method for elastoplastic contact
- On factored discretizations of the Laplacian for the fast solution of Poisson's equation on general regions
- Minimum fill-in: inapproximability and almost tight lower bounds
- Maximum matchings in planar graphs via Gaussian elimination
- Domain decomposition based \({\mathcal H}\)-LU preconditioning
- Automating algorithm selection: checking for matrix properties that can simplify computations
- Additive preconditioning and aggregation in matrix computations
- Almost exact matchings
- Counting spanning trees using modular decomposition
- Sparse shape functions for tetrahedral \(p\)-FEM using integrated Jacobi polynomials
- Efficient parallel factorization and solution of structured and unstructured linear systems
- New shape functions for triangular \(p\)-FEM using integrated Jacobi polynomials
- Planar graphs, negative weight edges, shortest paths, and near linear time
- Fast and efficient linear programming and linear least-squares computations
- A separator theorem for string graphs and its applications
- Search-space size in contraction hierarchies
- Counting spanning trees in graphs using modular decomposition
- Resolving Loads with Positive Interior Stresses
- A Separator Theorem for Chordal Graphs
- A Separator Theorem for String Graphs and Its Applications
- É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
- Fast shortest-paths algorithms in the presence of few destinations of negative-weight arcs
- Graph bisection with Pareto optimization
- Counting and sampling minimum cuts in genus g graphs
- Transformations of matrix structures work again
- A hysteretic multiscale formulation for nonlinear dynamic analysis of composite materials
- Dynamic effective resistances and approximate Schur complement on separable graphs
- Counting shortest two disjoint paths in cubic planar graphs with an NC algorithm
- Efficient algorithms for solving systems of linear equations and path problems
- The power of vertex sparsifiers in dynamic graph algorithms
- An Algebraic Sparsified Nested Dissection Algorithm Using Low-Rank Approximations
- Solving a Bernoulli type free boundary problem with random diffusion
- Sparse Hierarchical Preconditioners Using Piecewise Smooth Approximations of Eigenvectors
- Shortest-path queries in static networks
- Customizable contraction hierarchies
- PMORSy: parallel sparse matrix ordering software for fill-in minimization
- \(\mathcal{H}\)-matrix based second moment analysis for rough random fields and finite element discretizations
- Solving graph Laplacian systems through recursive partitioning and two-grid preconditioning
- Eigenvector-based centrality measures for temporal networks
- Fast hierarchical solvers for sparse matrices using extended sparsification and low-rank approximation
- An algebraic multifrontal preconditioner that exploits the low-rank property.
- A survey of direct methods for sparse linear systems
- Global minimum cuts in surface embedded graphs
- Tractable minor-free generalization of planar zero-field Ising models
- Minimum Cuts in Surface Graphs
- Planar and Toroidal Morphs Made Easier
- On the ordering of sparse linear systems
- Faster shortest-path algorithms for planar graphs
- Convexity-increasing morphs of planar graphs
- Many distances in planar graphs
- Fast maximum likelihood estimation of very large spatial autoregressive models: a characteristic polynomial approach.
- Recursive conditioning
- Min-max-boundary domain decomposition
- A linear-time algorithm for symmetric convex drawings of internally triconnected plane graphs
- An Incomplete Cholesky Preconditioner Based on Orthogonal Approximations
- Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs
- Maximum matchings in geometric intersection graphs
- How to draw a planar clustered graph
- A note on the SDP relaxation of the minimum cut problem
- Quasiplanar graphs, string graphs, and the Erdős-Gallai problem
- Hardness of graph-structured algebraic and symbolic problems
- Fast separator decomposition for finite element meshes
- Small grid embeddings of 3-polytopes
- OBDDs of a monotone function and of its prime implicants
This page was built for publication: Generalized Nested Dissection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3875202)
