Newton-Raphson iteration speed-up algorithm for the solution of nonlinear circuit equations in general-purpose CAD programs

The Newton-Raphson method is usually adopted for the solution of nonlinear circuit equations. However, it is well known that convergence of Newton's scheme is highly dependent on the initial guess, and often fails when convenient modifications are lacking. Typical Newton convergence problems in...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on computer-aided design of integrated circuits and systems 1997-06, Vol.16 (6), p.638-644
Main Authors: Ngoya, E., Rousset, J., Obregon, J.J.
Format: Article
Language:English
Subjects:
Applied sciences
Circuit analysis
Circuit simulation
Damping
Electric, optical and optoelectronic circuits
Electronic circuits
Electronics
Engineering Sciences
Error correction
Exact sciences and technology
Jacobian matrices
Nonlinear circuits
Nonlinear equations
Optimization methods
Theoretical study. Circuits analysis and design
Voltage
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The Newton-Raphson method is usually adopted for the solution of nonlinear circuit equations. However, it is well known that convergence of Newton's scheme is highly dependent on the initial guess, and often fails when convenient modifications are lacking. Typical Newton convergence problems in electronic circuits analysis are identified. An algorithm speeding up the convergence of the Newton scheme and making it less dependent on the initial guess is presented. The method is simple and a general-purpose one, applicable to all kinds of circuit equations. Numerical results are presented, and a comparison with previous work is done.
ISSN:0278-0070
1937-4151
DOI:10.1109/43.640621