The Use of Linear Graphs in Gauss Elimination

Cited in

(72)

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

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)