Sparsity-Directed Decomposition for Gaussian Elimination on Matrices

  title={Sparsity-Directed Decomposition for Gaussian Elimination on Matrices},
  author={E. C. OGBUOBIRI and William F. Tinney and Senior Member and John Withers Walker},
This is a concise critical survey of the theory and practice relating to the ordered Gaussian elimination on sparse systems. A new method of renumbering by clusters is developed, and its properties described. By establishing a correspondence between matrix pattems and directed graphs, a sequential binary partition is used to decompose the nodes of a graph into clusters. By appropriate ordering of the nodes within each cluster and by selecting clusters, one at a time, both optimal ordering and a… CONTINUE READING


Publications referenced by this paper.
Showing 1-10 of 22 references

Gamm , " K voprosu ob uvelichenii effektivnosti algoritmov rascheta rezhima elektrichaskikh sistem , " Izv

  • Z. A.
  • Akad . . Nauk SSSR , Energ . i Transp no
  • 1968

Minor diagonal ordering scheme

  • B. F. Wallenberg
  • private communication, Research and Development…
  • 1968

Notes on optimally ordered triangular factorization

  • W. S. Meyer
  • University of Minnesota, Madison, Lecture Notes…
  • 1968

On the decomposition of networks in minimally inter - connected subnetworks , " presented at the IEEE Internatl

  • D. V. Steward
  • Symp . on Circuit Theory
  • 1968

Optimal ordering for sparsely coupled subnetworks

  • W. F. Tinney
  • Bonneville Power Admin., Portland, Ore., Rept…
  • 1968

Peschon , " Efficient computation of state estimates using the inverse of the Jacobian matrix

  • T. C. Hu, N. Y. Yorktown Heights, +8 authors J.
  • Tech . Memo . 2 , August
  • 1968

A unified algorithm for load flow and economic dispatch in electric power systems

  • E. C. Ogbuobiri, S. Linke
  • IFAC Symp .
  • 1967