- 304 Downloads
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.
KeywordsNonzero Entry Polynomial Algorithm Unique Solvability Convex Polyhedron Algebraic Relation
Unable to display preview. Download preview PDF.