Estimating unique solutions of DC transistor circuits

DOI10.1108/03321649910264163MaRDI QIDQ4255087zbMATH OpenOpenAlexFDO

Authors

Publication date 18 March 2002

Published in COMPEL: The International Journal for Computation and Mathematics in Electrical and Electronic Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1108/03321649910264163

zbMATH Keywords

Newton-Raphson algorithmnonlinear circuitstransistor circuits

Mathematics Subject Classification ID

Analytic circuit theory (94C05)

Recommendations

• Finding all the DC solutions of a certain class of piecewise-linear circuits
• Transistor circuits and potentially stable operating points
• An interval method for global non‐linear dc circuit analysis

Cites work

• Bounds on solutions of non-linear resistive networks
• Canonical piecewise-linear analysis
• D.C. ANALYSIS OF PIECEWISE LINEAR NETWORKS USING THE GAUSS‐SEIDEL METHOD
• Finding all solutions of piecewise-linear circuits
• scientific article; zbMATH DE number 3559405 (Why is no real title available?)
• Nonlinear Generalizations of Matrix Diagonal Dominance with Application to Gauss–Seidel Iterations
• Topological criteria for establishing the uniqueness of solutions to the dc equations of transistor networks

Cited in

(3)

• Transistor circuits and potentially stable operating points
• A combinatorial method for computing bounds on solutions of active non‐linear resistive networks
• Numerical existence proof of five solutions for certain two-transistor circuit equations

This page was built for publication: Estimating unique solutions of DC transistor circuits

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