The Use of Linear Graphs in Gauss Elimination

DOI10.1137/1003021zbMath0102.11302OpenAlexW2061782500MaRDI QIDQ3284907

Seymour V. Parter

Publication date: 1961

Published in: SIAM Review (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1003021

zbMATH Keywords

numerical analysis

Related Items (70)

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

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