On the solvability and computation of D.C. transistor networks

Michał Tadeusiewicz · International Journal of Circuit Theory and Applications · 1981

Abstract 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.

Read the paper · More papers on PaperTik