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

DOI10.1002/CTA.4490090302zbMATH Open0458.94060OpenAlexW2094849388MaRDI QIDQ3908950FDOQ3908950

Authors: Michał Tadeusiewicz 

Publication date: 1981

Published in: International Journal of Circuit Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/cta.4490090302

zbMATH Keywords

numerical computationnon-linear d.c. networks

Mathematics Subject Classification ID

Analytic circuit theory (94C05)

Cites Work

• Title not available (Why is that?)
• New Theorems on the Equations of Nonlinear DC Transistor Networks
• Solving Nonlinear Network Equations Using Optimization Techniques
• Theorems on the Analysis of Nonlinear Transistor Networks*

Cited In (1)

• D.C. ANALYSIS OF PIECEWISE LINEAR NETWORKS USING THE GAUSS‐SEIDEL METHOD

This page was built for publication: On the solvability and computation of D.C. transistor networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3908950)