PARTITIONING AND TEARING SYSTEMS OF EQUATIONS.

Abstract

Partitioning refers to partitioning systems of equations, linear or non-linear, into subsets of equations, i.e., blocks, such that the blocks can be solved one at a time sequentially, but that the equations within a block must be solved simultaneously. Tearing refers to identifying dependencies, i.e., the appearance of certain variables in certain equations, such that by special handling of these dependencies blocks can be partitioned into yet smaller blocks. Algorithms for partitioning and tearing are given. (Author)

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 1965
Accession Number
AD0620110

Entities

People

  • Donald V. Steward

Organizations

  • University of Wisconsin–Madison

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Equations

Fields of Study

  • Mathematics

Readers

  • Computational Fluid Dynamics (CFD)
  • Statistical inference.
  • Vision Science/Vision Psychology/Cognitive Neuroscience.