Numerical Continuation Scheme For Tracing The Double Bounded Homotopy For Analysing Nonlinear Circuits
Numerical Continuation Scheme For Tracing The Double Bounded Homotopy For Analysing Nonlinear Circuits
I.
INTRODUCTION
The numerical continuation methods (also called path folLowing and path tracking) are numerical tools used to trace the
homotopy trajectories. They are a combination of a variety of
numerical methods focussed on drawing a path in order to accomplish specific needs of a particular homotopy formulation.
Due to the specific features of the DBH, it becomes necessary to devise a well-suited numerical continuation method
in order to trace the homotopy trajectory having n robust stop
criterion. The next section is devoted to explain the traditional
numerical continuation methods.
Solutions
"1
I
I
H ( f ( s ) ,A) = CQ
+ eQ ln(Df2(z) + 1)
(1)
Homotopy Trijectory
Q = (A
11. NUMERICAL
CONTINUATION METHODS
- a)(A - b )
1122
fails and Ioses track on the homotopy trajectory. The other of the homotopy trajectory begins at X = 0 and ends' at X = 1.
reason is that once the numerical continuation crosses the When the tracing is close to X = 1,.the find Zem Srrategy
solution line, the algorithm fails to determine the solution takes over. The simplest example of strategy is to use [zf,A,]
because it diverges. It clearly results that it is important to (the last iteration) as the initial point to solve the equilibrium
study the characteristics of the numerical continuation in order equation f(s)with a Newton-like method.
to use them appropriately. The numerical continuation scheme
Because the Newton method possesses local convergence,
consists of a predictor, a corrector, a step control, a find zero ,it still could fail to find the solution. In [9] some techniques
strategy and a stop criterion.
are reported that implement the find Zem Strategy accurately
J ) Predictor: The predictor point for fd,
X j ) is given by: and reliably. The basic idea is to use two points (X < 1 and
X 2 1) in the vicinity of X = 1, and interpolate the point at
A = 1 in order to obtain a point close to the real solution and
(rCJ+',
= (ZJ,
A,)
h*t
use a Newton-like method to find the solution to the original
where ti is an appropriate step length and t is a normalised system f(z).
tangent vector to the homotopy trajectory (see Figure 2). This
5 ) Srop criterion: In fact, there are not stop criteria in the
predictor can be considered as a step of the Euler method traditional numerical continuation methods when applied to
(or any other integration method) for solving the diflerential homotopy trajectory tracing. The most common way to stop
equation that describes the homotopy trajectory (continuation tracing the trajectory is to set a maximum allowed number
path). Predictor steps are usually based on tangent predictions ( I T M A X ) of predictor-corrector steps without finding any
but there are several alternatives like the secant predictor 171, solution. This technique is inefficient because it usually fails
interpolation predictor [8], Taylor polynomial predictor [8].
to find some solutions on the homotopy trajectory.
xJ+l)
111. MODIFIED
NUMERICAL
CONTINUATION
Fig. 2.
Predictor-comcior steps
2 ) Corrector: When the predictor step finishes, it is necessary to rectify the homotopy trajectory by using a corrector
step. This step solves the homotopy formulaiion by starting
from (Zj+r.X,+l) (see Figure 2) , A common way io solve
this equation is by using the Newton-Gauss method [SI,which
can be solved for systems of the type RN+l3 RN.
3) Step Conrml: The Predictor-Corrector scheme can be
optimized for tracing acceleration by using a step length
control. A small constant step length can trace the curve
successfully but not efficiently, because this process involves
too many steps along flat branches. Therefore, it is necessary
to adapt the step length to the convergence behaviour at each
predictor-correclor step. The basic criterion is to control the
step by observing the convergence quality of the corrector
step. A change on the number of iterations in the corrector
step produces n compensation factor 1, which affects the step
kength as follows:
hj+l =
Chj
1123
I af symmetry
MS
I
Predictor
I
Interpolation points
e Solirfions
Fig. 3. -Find zero strategy
Sofufions
H*(f2,
IV. EXAMPLES
In order to illustratethe use of the DSH with the modifications, a first example is used JO solve the system of equations
given as:
fl(51122) =
Z.(
- 1 ) ( m- 4 ) ( q - 6 )
- 9)
fs1
=o
+2 2 = 0
1124
E3V
X = 0.5
End oftrc4iectot-y X = 0.5
v. CONCLUSIONS
0 Startingpoint
.*
I I25
YII
1
-0.2
R I , =30 k R
R y l kR
CL
Fig. I I .
1126
vcc
Clma's circuit