Generalized Nested Dissection
From MaRDI portal
sparse graphsplanar graphsseparatorsnested dissectionsymmetric positive definite matrixsparse Gaussian eliminationfinite element problems
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Direct numerical methods for linear systems and matrix inversion (65F05) Factorization of matrices (15A23) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30)
Cited in
(only showing first 100 items - show all)- Drawing plane graphs nicely
- Recursive conditioning
- Vecchia-Laplace approximations of generalized Gaussian processes for big non-Gaussian spatial data
- Efficient solutions of hierarchical systems of linear equations
- Preconditioning techniques for large linear systems: A survey
- The MIN-cut and vertex separator problem
- Quasiplanar graphs, string graphs, and the Erdős-Gallai problem
- Additive preconditioning and aggregation in matrix computations
- A survey of direct methods for sparse linear systems
- Parallel nested dissection for path algebra computations
- Numerical linear algebra algorithms and software
- Sparse linear least-squares problems
- A Fourier-accelerated volume integral method for elastoplastic contact
- Compression, inversion, and approximate PCA of dense kernel matrices at near-linear computational complexity
- Multiresolution kernel matrix algebra
- Customizable contraction hierarchies
- Finding small simple cycle separators for 2-connected planar graphs
- Symbolic matrix factorization for differential-algebraic equations index reduction
- Refining an approximate inverse
- On the ordering of sparse linear systems
- Efficient parallel factorization and solution of structured and unstructured linear systems
- A Separator Theorem for Chordal Graphs
- Fast dynamic transitive closure with lookahead
- É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
- Solving graph Laplacian systems through recursive partitioning and two-grid preconditioning
- A parallel graph partitioning algorithm for a message-passing multiprocessor
- A new approach to solving three combinatorial enumeration problems on planar graphs
- Tractable minor-free generalization of planar zero-field Ising models
- Symbolic and numeric methods for exploiting structure in constructing resultant matrices
- Convexity-increasing morphs of planar graphs
- Many distances in planar graphs
- Fast and efficient solution of path algebra problems
- OBDDs of a monotone function and of its prime implicants
- Single source shortest paths in H-minor free graphs
- A multilevel approach for trace system in HDG discretizations
- Planarity via spanning tree number: a linear-algebraic criterion
- scientific article; zbMATH DE number 7378710 (Why is no real title available?)
- On factored discretizations of the Laplacian for the fast solution of Poisson's equation on general regions
- \textsc{TrussMe-Fem}: a toolbox for symbolic-numerical analysis and solution of structures
- Fast maximum likelihood estimation of very large spatial autoregressive models: a characteristic polynomial approach.
- Valid inequalities and lifting procedures for the shortest path problem in digraphs with negative cycles
- Solving systems of linear equations through zero forcing set
- Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs
- Fast and efficient linear programming and linear least-squares computations
- Solving a Bernoulli type free boundary problem with random diffusion
- Planar minimally rigid graphs and pseudo-triangulations
- Treewidth for graphs with small chordality
- Construction of quasi-localized dual bases in reproducing kernel Hilbert spaces
- Efficient approximate solution of sparse linear systems
- Dividing and conquering the square
- Fast shortest-paths algorithms in the presence of few destinations of negative-weight arcs
- Preconditioning for sparse linear systems at the dawn of the 21st century: history, current developments, and future perspectives
- Search-space size in contraction hierarchies
- An Incomplete Cholesky Preconditioner Based on Orthogonal Approximations
- Separator theorems and Turán-type results for planar intersection graphs
- Underestimated cost of targeted attacks on complex networks
- Convergence of datalog over (pre-) semirings
- Provably good mesh generation
- Hardness of graph-structured algebraic and symbolic problems
- Planar and Toroidal Morphs Made Easier
- Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion
- Iterative methods for full-scale Gaussian process approximations for large spatial data
- An algebraic multifrontal preconditioner that exploits the low-rank property.
- A separator theorem for string graphs and its applications
- Almost exact matchings
- Fast separator decomposition for finite element meshes
- Sparse shape functions for tetrahedral \(p\)-FEM using integrated Jacobi polynomials
- Planar and toroidal morphs made easier
- The power of vertex sparsifiers in dynamic graph algorithms
- Local optimization on graphs
- Edge separators for graphs of bounded genus with applications
- Space-efficient graph coarsening with applications to succinct planar encodings
- Parallel computation of a Krylov matrix for a sparse and structured input
- Testing the necklace condition for shortest tours and optimal factors in the plane
- Planar graphs, negative weight edges, shortest paths, and near linear time
- Minimum fill-in: inapproximability and almost tight lower bounds
- On the negative cost girth problem in planar networks
- Counting and sampling minimum cuts in genus g graphs
- Transformations of matrix structures work again
- Estimating the extremal eigenvalues of a symmetric matrix
- Small grid embeddings of 3-polytopes
- Fast hierarchical solvers for sparse matrices using extended sparsification and low-rank approximation
- Shortest-path queries in static networks
- Sparse Hierarchical Preconditioners Using Piecewise Smooth Approximations of Eigenvectors
- Domain decomposition based \({\mathcal H}\)-LU preconditioning
- Efficient algorithms for solving systems of linear equations and path problems
- An Algebraic Sparsified Nested Dissection Algorithm Using Low-Rank Approximations
- Faster shortest-path algorithms for planar graphs
- Faster min-cost flow and approximate tree decomposition on bounded treewidth graphs
- PMORSy: parallel sparse matrix ordering software for fill-in minimization
- A hysteretic multiscale formulation for nonlinear dynamic analysis of composite materials
- Nested dissection meets IPMs: planar min-cost flow in nearly-linear time
- Minimum Cuts in Surface Graphs
- Maximum matchings in geometric intersection graphs
- How to draw a planar clustered graph
- scientific article; zbMATH DE number 7561373 (Why is no real title available?)
- Supersonic viscous perfect gas flow past a circular cylinder
- Eigenvector-based centrality measures for temporal networks
- Convex drawings of graphs with non-convex boundary constraints
- Randomized preprocessing of homogeneous linear systems of equations
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)
