Advertisement

Applications

  • András Recski
Chapter
  • 304 Downloads
Part of the Algorithms and Combinatorics book series (AC, volume 6)

Abstract

A necessary condition for the unique solvability of multiport networks was given in Theorem 12.2.2. This condition was not always sufficient, see Exercise 12.2.5 and Problem 12.2.8. Prescribing some “generality”-type condition (i.e., ensuring that the nonzero expansion members of det W cannot cancel out each other) we may hope to make this condition sufficient as well.

Keywords

Nonzero Entry Polynomial Algorithm Unique Solvability Convex Polyhedron Algebraic Relation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • András Recski
    • 1
  1. 1.Eötvös Loránd UniversityBudapest VIIIHungary

Personalised recommendations