Premium
On the solvability and computation of D.C. transistor networks
Author(s) -
Tadeusiewicz Michal
Publication year - 1981
Publication title -
international journal of circuit theory and applications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.364
H-Index - 52
eISSN - 1097-007X
pISSN - 0098-9886
DOI - 10.1002/cta.4490090302
Subject(s) - computation , resistor , convergence (economics) , transistor , diode , iterative method , voltage , current (fluid) , mathematics , inverse , computer science , topology (electrical circuits) , algorithm , engineering , electrical engineering , combinatorics , geometry , economics , economic growth
A study of non‐linear d.c. networks containing transistors, diodes, linear resistors, independent voltage and current sources and linear controlled voltage and current sources, described by Tf(x) + Gx = b is presented. A few theorems concerning both the solvability and numerical computation of d.c. transistor networks are proved. The conditions sufficient for the existence of at least one solution and of a unique solution are defined. A method for numerical computation of the networks without the need to determine inverse matrices is presented and the convergence of the iterative technique is analysed. Suggestions are formulated regarding applicability of the method for computation of an approximate solution (close to the exact solution) which may subsequently be quickly corrected using the Newton‐Raphson method.