Graph Theory and Gaussian Elimination.

Abstract

This paper surveys graph-theoretic ideas which apply to the problem of solving a sparse system of linear equations by Gaussian elimination. Included are a discussion of bandwidth, profile, and general sparse elimination schemes, and of two graph-theoretic partitioning methods. Algorithms based on these ideas are presented. (Author)

Document Details

Document Type
Technical Report
Publication Date
Nov 01, 1975
Accession Number
ADA020848

Entities

People

  • Robert Tarjan

Organizations

  • Stanford University

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Bandwidth
  • Elimination
  • Equations
  • Graph Theory
  • Mathematics

Fields of Study

  • Computer science

Readers

  • Applied Combinatorial Optimization and Logic Circuit Design.
  • Approximation Theory.