The following pages link to Generalized Nested Dissection (Q3875202):
Displayed 50 items.
- Estimating the extremal eigenvalues of a symmetric matrix (Q753418) (← links)
- Calculs de complexité relatifs à une méthode de dissection emboîtée (Q792734) (← links)
- Drawing plane graphs nicely (Q797289) (← links)
- Convex drawings of graphs with non-convex boundary constraints (Q947122) (← links)
- Separator theorems and Turán-type results for planar intersection graphs (Q947779) (← links)
- Finding small simple cycle separators for 2-connected planar graphs (Q1085169) (← links)
- Efficient solutions of hierarchical systems of linear equations (Q1089723) (← links)
- Parallel nested dissection for path algebra computations (Q1095781) (← links)
- The analysis of a nested dissection algorithm (Q1103322) (← links)
- A parallel graph partitioning algorithm for a message-passing multiprocessor (Q1111029) (← links)
- Algorithms for multicommodity flows in planar graphs (Q1119160) (← links)
- Local optimization on graphs (Q1122503) (← links)
- Solution of sparse positive definite systems on a hypercube (Q1124265) (← links)
- Efficient approximate solution of sparse linear systems (Q1125019) (← links)
- Not all planar digraphs have small cycle separators (Q1201868) (← links)
- Edge separators for graphs of bounded genus with applications (Q1210307) (← links)
- Testing the necklace condition for shortest tours and optimal factors in the plane (Q1262765) (← links)
- Flow in planar graphs with vertex capacities (Q1317474) (← links)
- Provably good mesh generation (Q1329150) (← links)
- Supersonic viscous perfect gas flow past a circular cylinder (Q1339624) (← links)
- Separators and structure prediction in sparse orthogonal factorization (Q1361831) (← links)
- Treewidth for graphs with small chordality (Q1372729) (← links)
- Refining an approximate inverse (Q1591188) (← links)
- Numerical linear algebra algorithms and software (Q1591199) (← links)
- Symbolic and numeric methods for exploiting structure in constructing resultant matrices (Q1600039) (← links)
- Planar minimally rigid graphs and pseudo-triangulations (Q1775778) (← links)
- Dividing and conquering the square (Q1801677) (← links)
- Steady flow with separation past a thin airfoil at high Reynolds numbers (Q1815111) (← links)
- Efficient parallel linear programming (Q1821686) (← links)
- Fast and efficient solution of path algebra problems (Q1824392) (← links)
- Preconditioning techniques for large linear systems: A survey (Q1868569) (← links)
- A new approach to solving three combinatorial enumeration problems on planar graphs (Q1894355) (← links)
- Parallel computation of a Krylov matrix for a sparse and structured input (Q1900259) (← links)
- On factored discretizations of the Laplacian for the fast solution of Poisson's equation on general regions (Q2266361) (← links)
- Maximum matchings in planar graphs via Gaussian elimination (Q2369872) (← links)
- Domain decomposition based \({\mathcal H}\)-LU preconditioning (Q2391123) (← links)
- Additive preconditioning and aggregation in matrix computations (Q2425466) (← 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)
- 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)
- On the ordering of sparse linear systems (Q5906733) (← links)
- Faster shortest-path algorithms for planar graphs (Q5906822) (← links)
- Fast maximum likelihood estimation of very large spatial autoregressive models: a characteristic polynomial approach. (Q5940794) (← links)
- Recursive conditioning (Q5940818) (← links)