The Use of Linear Graphs in Gauss Elimination

Cited In (72)

Lex M versus MCS-M
Choosing better variable orderings for cylindrical algebraic decomposition via exploiting chordal structure
On the Number of Nonzeros Added when Gaussian Elimination is Performed on Sparse Random Matrices
A survey of direct methods for sparse linear systems
On sparse matrix orderings in interior point methods
Title not available (Why is that?)
A decomposition algorithm for optimality problems in tree-structured networks
Multiplicity adjustment for temporal and spatial scan statistics using Markov property
Numerical linear algebra algorithms and software
Tree decomposition and discrete optimization problems: a survey
Interconnected hierarchical structures for fast direct elliptic solution
Creating non-minimal triangulations for use in inference in mixed stochastic/deterministic graphical models
Weighted graph based ordering techniques for preconditioned conjugate gradient methods
Factoring matrices with a tree-structured sparsity pattern
Minimal fill in O(\(n^{2.69}\)) time
Treewidth computation and extremal combinatorics
Dynamic programming and planarity: improved tree-decomposition based algorithms
Algorithmique et calculs de complexité pour un solveur de type dissections emboîtées. (Algorithmic study and complexity bounds for a nested dissection solver)
Solution of a system of simultaneous linear equations with a sparse coefficient matrix by elimination methods
Elimination on sparse symmetric systems of a special structure
Treediagonal matrices and their inverses
Minimal triangulations of graphs: a survey
Adaptive AMG with coarsening based on compatible weighted matching
Application of graphs to the Gaussian elimination method
Minimal triangulation of a graph and optimal pivoting order in a sparse matrix
Title not available (Why is that?)
Search-space size in contraction hierarchies
The General Minimum Fill-In Problem
Decomposition in multidimensional Boolean-optimization problems with sparse matrices
Experimental study of ILU preconditioners for indefinite matrices
Performance models and workload distribution algorithms for optimizing a hybrid CPU-GPU multifrontal solver
Subexponential parameterized algorithms and kernelization on almost chordal graphs
Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion
Inherited Matrix Entries: Principal Submatrices of the Inverse
Treewidth computations. I: Upper bounds
On the minimum chordal completion polytope
Multi-core parallel robust structured multifrontal factorization method for large discretized PDEs
On the Chordality of Simple Decomposition in Top-Down Style
The elimination procedure for the competition number is not optimal
On a characterization of tridiagonal matrices by M. Fiedler
Sequential and parallel triangulating algorithms for elimination game and new insights on minimum degree
How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms
A direct active set algorithm for large sparse quadratic programs with simple bounds
Realizations of interlacing by tree-patterned matrics
Chordal graphs in triangular decomposition in top-down style
Triangulated graphs and the elimination process
Examples concerning efficient strategies for Gaussian elimination
Iterative methods for linear systems of equations: a brief historical journey
On the pressure and flow-rate distributions in tree-like and arterial-venous networks
Large Induced Subgraphs via Triangulations and CMSO
Postoptimal Analysis in Nonserial Dynamic Programming
Robust algorithm for random resistor networks using hierarchical domain structure
Exploiting chordal structure in polynomial ideals: a Gröbner bases approach
Towards a cost-effective ILU preconditioner with high level fill
Colouring the discretization graphs arising in the multigrid method
The analysis of a nested dissection algorithm
A fast direct solver for nonlocal operators in wavelet coordinates
A fast algorithm for solving systems of linear equations with two variables per equation
Calculs de complexité relatifs à une méthode de dissection emboîtée
Some Results on Sparse Matrices
Graphical Models and Message-Passing Algorithms: Some Introductory Lectures
Minimum Fill-In and Treewidth of Split+ ke and Split+ kv Graphs
Minimum fill-in and treewidth of split \(+ ke\) and split \(+kv\) graphs
Searching for better fill-in
Modifying a graph using vertex elimination
Sparse matrices, and the estimation of variance components by likelihood methods
Marginal Markov subgraph of Bayesian network and its applications
Some structural theorems for partial difference operators
Choosing the variable ordering for cylindrical algebraic decomposition via exploiting chordal structure
Algorithms for convex hull finding in undirected graphical models
Exactly solving sparse rational linear systems via roundoff-error-free Cholesky factorizations
Finding induced paths of given parity in claw-free graphs

This page was built for publication: The Use of Linear Graphs in Gauss Elimination

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3284907)