Pages that link to "Item:Q3284907"

The following pages link to The Use of Linear Graphs in Gauss Elimination (Q3284907):

Displaying 50 items.

• Search-space size in contraction hierarchies (Q306264) (← links)
• Performance models and workload distribution algorithms for optimizing a hybrid CPU-GPU multifrontal solver (Q316653) (← links)
• On sparse matrix orderings in interior point methods (Q402236) (← links)
• Creating non-minimal triangulations for use in inference in mixed stochastic/deterministic graphical models (Q415616) (← links)
• Factoring matrices with a tree-structured sparsity pattern (Q551257) (← links)
• A direct active set algorithm for large sparse quadratic programs with simple bounds (Q583116) (← links)
• Calculs de complexité relatifs à une méthode de dissection emboîtée (Q792734) (← links)
• Colouring the discretization graphs arising in the multigrid method (Q805184) (← links)
• Minimal triangulations of graphs: a survey (Q819823) (← links)
• Minimal fill in O(\(n^{2.69}\)) time (Q819828) (← links)
• Lex M versus MCS-M (Q819832) (← links)
• Multi-core parallel robust structured multifrontal factorization method for large discretized PDEs (Q898930) (← links)
• Treewidth computations. I: Upper bounds (Q964001) (← links)
• Minimum fill-in and treewidth of split \(+ ke\) and split \(+kv\) graphs (Q972334) (← links)
• Dynamic programming and planarity: improved tree-decomposition based algorithms (Q972340) (← links)
• The analysis of a nested dissection algorithm (Q1103322) (← links)
• Algorithmique et calculs de complexité pour un solveur de type dissections emboîtées. (Algorithmic study and complexity bounds for a nested dissection solver) (Q1114300) (← links)
• Application of graphs to the Gaussian elimination method (Q1137344) (← links)
• A fast algorithm for solving systems of linear equations with two variables per equation (Q1149227) (← links)
• Treediagonal matrices and their inverses (Q1161577) (← links)
• Towards a cost-effective ILU preconditioner with high level fill (Q1198973) (← links)
• A decomposition algorithm for optimality problems in tree-structured networks (Q1214853) (← links)
• Minimal triangulation of a graph and optimal pivoting order in a sparse matrix (Q1243572) (← links)
• Experimental study of ILU preconditioners for indefinite matrices (Q1379014) (← links)
• Numerical linear algebra algorithms and software (Q1591199) (← links)
• Decomposition in multidimensional Boolean-optimization problems with sparse matrices (Q1647455) (← links)
• Adaptive AMG with coarsening based on compatible weighted matching (Q1684418) (← links)
• On the pressure and flow-rate distributions in tree-like and arterial-venous networks (Q1817453) (← links)
• Weighted graph based ordering techniques for preconditioned conjugate gradient methods (Q1893941) (← links)
• Subexponential parameterized algorithms and kernelization on almost chordal graphs (Q2037110) (← links)
• Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion (Q2039245) (← links)
• Choosing better variable orderings for cylindrical algebraic decomposition via exploiting chordal structure (Q2100061) (← links)
• Interconnected hierarchical structures for fast direct elliptic solution (Q2113659) (← links)
• A fast direct solver for nonlocal operators in wavelet coordinates (Q2128345) (← links)
• Chordal graphs in triangular decomposition in top-down style (Q2200301) (← links)
• On a characterization of tridiagonal matrices by M. Fiedler (Q2264833) (← links)
• Multiplicity adjustment for temporal and spatial scan statistics using Markov property (Q2329846) (← links)
• Modifying a graph using vertex elimination (Q2345941) (← links)
• Sequential and parallel triangulating algorithms for elimination game and new insights on minimum degree (Q2378540) (← links)
• Treewidth computation and extremal combinatorics (Q2392037) (← links)
• Finding induced paths of given parity in claw-free graphs (Q2428656) (← links)
• Searching for better fill-in (Q2453556) (← links)
• Tree decomposition and discrete optimization problems: a survey (Q2480502) (← links)
• The elimination procedure for the competition number is not optimal (Q2499585) (← links)
• Some structural theorems for partial difference operators (Q2522565) (← links)
• Triangulated graphs and the elimination process (Q2545884) (← links)
• Examples concerning efficient strategies for Gaussian elimination (Q2550610) (← links)
• Robust algorithm for random resistor networks using hierarchical domain structure (Q2572227) (← links)
• Algorithms for convex hull finding in undirected graphical models (Q2698143) (← links)
• Exploiting Chordal Structure in Polynomial Ideals: A Gröbner Bases Approach (Q2818203) (← links)