REALIZABILITY CONDITIONS OF SINGLE-CONTACT NETWORKS

Abstract

I ENTIFIERS: Single-contact networks.A selected set of necessary realizabili y conditions are derived from which a testing method is developed, so that one can apply it to a given function either to det ct its nonrealizability or to simplify it before known sy thesis procedures are employed. This investig tion also shows that there exist certain clas es of functions. They can be detected by the esting methods developed, as shown by various examples. The non-tree matrices and the no realizabl matric s are inves igated. A LSO THE CORRELATIO S BET EE HE NON- REE MATRICES AND THE NONREALIZABLE FUNCTIONS ARE GIVEN AND ARE VERIFIED BY EXAMPLES W ICH ILLUSTRATE THE REASONS FOR THEIR NONREALIZABILITY. (Author)

Document Details

Document Type
Technical Report
Publication Date
Dec 01, 1962
Accession Number
AD0293103

Entities

People

  • Shu-park Chan

Organizations

  • University of Illinois Urbana–Champaign

Tags

DTIC Thesaurus Topics

  • Test Methods

Readers

  • Graph Algorithms and Convex Optimization.
  • Snow Cover Descriptors for Reptiles and Their Illustrations.
  • Systems Analysis and Design