The following pages link to Generalized Nested Dissection (Q3875202):
Displaying 50 items.
- Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion (Q2039245) (← links)
- Samplets: construction and scattered data compression (Q2088333) (← links)
- A multilevel approach for trace system in HDG discretizations (Q2122738) (← links)
- A fast direct solver for nonlocal operators in wavelet coordinates (Q2128345) (← links)
- Planar and toroidal morphs made easier (Q2151436) (← links)
- A Fourier-accelerated volume integral method for elastoplastic contact (Q2173622) (← links)
- On factored discretizations of the Laplacian for the fast solution of Poisson's equation on general regions (Q2266361) (← links)
- Minimum fill-in: inapproximability and almost tight lower bounds (Q2304536) (← links)
- Maximum matchings in planar graphs via Gaussian elimination (Q2369872) (← links)
- Domain decomposition based \({\mathcal H}\)-LU preconditioning (Q2391123) (← links)
- Automating algorithm selection: checking for matrix properties that can simplify computations (Q2422701) (← links)
- Additive preconditioning and aggregation in matrix computations (Q2425466) (← links)
- Almost exact matchings (Q2429356) (← links)
- Counting spanning trees using modular decomposition (Q2437761) (← links)
- Sparse shape functions for tetrahedral \(p\)-FEM using integrated Jacobi polynomials (Q2457943) (← links)
- Efficient parallel factorization and solution of structured and unstructured linear systems (Q2486566) (← links)
- New shape functions for triangular \(p\)-FEM using integrated Jacobi polynomials (Q2494375) (← links)
- Planar graphs, negative weight edges, shortest paths, and near linear time (Q2496320) (← links)
- Fast and efficient linear programming and linear least-squares computations (Q3028716) (← links)
- A Separator Theorem for String Graphs and its Applications (Q3058296) (← links)
- Counting Spanning Trees in Graphs Using Modular Decomposition (Q3078398) (← links)
- Resolving Loads with Positive Interior Stresses (Q3183482) (← links)
- A Separator Theorem for Chordal Graphs (Q3344230) (← links)
- A Separator Theorem for String Graphs and Its Applications (Q3605480) (← links)
- É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 (Q3789083) (← links)
- Graph Bisection with Pareto Optimization (Q4577953) (← links)
- (Q5009600) (← links)
- (Q5091009) (← links)
- Efficient algorithms for solving systems of linear equations and path problems (Q5096775) (← links)
- (Q5111734) (← links)
- An Algebraic Sparsified Nested Dissection Algorithm Using Low-Rank Approximations (Q5113365) (← links)
- Solving a Bernoulli type free boundary problem with random diffusion (Q5126398) (← links)
- Sparse Hierarchical Preconditioners Using Piecewise Smooth Approximations of Eigenvectors (Q5147979) (← links)
- Shortest-path queries in static networks (Q5176178) (← links)
- Customizable Contraction Hierarchies (Q5266613) (← links)
- PMORSy: parallel sparse matrix ordering software for fill-in minimization (Q5268923) (← links)
- $\mathcal{H}$-Matrix Based Second Moment Analysis for Rough Random Fields and Finite Element Discretizations (Q5275048) (← links)
- Solving Graph Laplacian Systems Through Recursive Partitioning and Two-Grid Preconditioning (Q5348222) (← links)
- Eigenvector-Based Centrality Measures for Temporal Networks (Q5737762) (← links)
- Fast Hierarchical Solvers For Sparse Matrices Using Extended Sparsification and Low-Rank Approximation (Q5738178) (← links)
- An algebraic multifrontal preconditioner that exploits the low‐rank property (Q5739752) (← links)
- A survey of direct methods for sparse linear systems (Q5740079) (← links)
- (Q5743478) (← links)
- Tractable minor-free generalization of planar zero-field Ising models (Q5857455) (← links)
- Minimum Cuts in Surface Graphs (Q5885599) (← links)
- Planar and Toroidal Morphs Made Easier (Q5886038) (← links)
- On the ordering of sparse linear systems (Q5906733) (← links)
- Faster shortest-path algorithms for planar graphs (Q5906822) (← links)
- Convexity-increasing morphs of planar graphs (Q5919691) (← links)
- Many distances in planar graphs (Q5920250) (← links)
