The University of Southampton
University of Southampton Institutional Repository

Globally convergent algorithms for dc operating point analysis of nonlinear circuits

Globally convergent algorithms for dc operating point analysis of nonlinear circuits
Globally convergent algorithms for dc operating point analysis of nonlinear circuits
An important objective in the analysis of an electronic circuit is to find its quiescent or DC operating point. This is the starting point for performing other types of circuit analysis. The most common method for finding the DC operating point of a nonlinear electronic circuit is the Newton-Raphson method (NR), a gradient search technique. There are known convergence issues with this method. NR is sensitive to starting conditions. Hence, it is not globally convergent and can diverge or oscillate between solutions. Furthermore, NR can only find one solution of a set of equations at a time. This paper discusses and evaluates a new approach to DC operating point analysis based on evolutionary computing. Evolutionary algorithms are globally convergent and can find multiple solutions to a problem by using a parallel search. At the operating point(s) of a circuit, the equations describing the current at each node are consistent and the overall error has a minimum value. Therefore, we can use an evolutionary algorithm to search the solution space to find these minima. We discuss the development of an analysis tool based on this approach. The principles of computer-aided circuit analysis are briefly discussed, together with the Newton-Raphson method and some of its variants. Various evolutionary algorithms are described. Several such algorithms have been implemented in a full circuit analysis tool. The performance and accuracy of the evolutionary algorithms are compared with each other and with NR. Evolutionary algorithms are shown to be robust and to have an accuracy comparable to that of NR. The performance is, at best, two-orders of magnitude worse than NR, although it should be noted that time-consuming setting of initial conditions is avoided.
Circuit Simulation, DC Circuit Analysis, Evolution Strategies, Differential Evolution, Tournament Selection
2-10
Crutchley, Duncan
915eaa13-1fe0-4237-a86e-060c26b11aee
Zwolinski, Mark
adfcb8e7-877f-4bd7-9b55-7553b6cb3ea0
Crutchley, Duncan
915eaa13-1fe0-4237-a86e-060c26b11aee
Zwolinski, Mark
adfcb8e7-877f-4bd7-9b55-7553b6cb3ea0

Crutchley, Duncan and Zwolinski, Mark (2003) Globally convergent algorithms for dc operating point analysis of nonlinear circuits. IEEE Transactions on Evolutionary Computation, 7 (1), 2-10.

Record type: Article

Abstract

An important objective in the analysis of an electronic circuit is to find its quiescent or DC operating point. This is the starting point for performing other types of circuit analysis. The most common method for finding the DC operating point of a nonlinear electronic circuit is the Newton-Raphson method (NR), a gradient search technique. There are known convergence issues with this method. NR is sensitive to starting conditions. Hence, it is not globally convergent and can diverge or oscillate between solutions. Furthermore, NR can only find one solution of a set of equations at a time. This paper discusses and evaluates a new approach to DC operating point analysis based on evolutionary computing. Evolutionary algorithms are globally convergent and can find multiple solutions to a problem by using a parallel search. At the operating point(s) of a circuit, the equations describing the current at each node are consistent and the overall error has a minimum value. Therefore, we can use an evolutionary algorithm to search the solution space to find these minima. We discuss the development of an analysis tool based on this approach. The principles of computer-aided circuit analysis are briefly discussed, together with the Newton-Raphson method and some of its variants. Various evolutionary algorithms are described. Several such algorithms have been implemented in a full circuit analysis tool. The performance and accuracy of the evolutionary algorithms are compared with each other and with NR. Evolutionary algorithms are shown to be robust and to have an accuracy comparable to that of NR. The performance is, at best, two-orders of magnitude worse than NR, although it should be noted that time-consuming setting of initial conditions is avoided.

Text
01179904.pdf - Other
Download (455kB)

More information

Published date: February 2003
Keywords: Circuit Simulation, DC Circuit Analysis, Evolution Strategies, Differential Evolution, Tournament Selection
Organisations: EEE

Identifiers

Local EPrints ID: 257303
URI: http://eprints.soton.ac.uk/id/eprint/257303
PURE UUID: 3fd3bef4-6882-4988-aaa8-b731ab4914fb
ORCID for Mark Zwolinski: ORCID iD orcid.org/0000-0002-2230-625X

Catalogue record

Date deposited: 05 Mar 2003
Last modified: 15 Mar 2024 02:39

Export record

Contributors

Author: Duncan Crutchley
Author: Mark Zwolinski ORCID iD

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×