DocumentCode :
1184363
Title :
An efficient algorithm reduces computing time in solving a system of stiff ordinary differential equations
Author :
Gambart-ducros, Danièle ; Maral, Gerard
Volume :
27
Issue :
9
fYear :
1980
fDate :
9/1/1980 12:00:00 AM
Firstpage :
747
Lastpage :
755
Abstract :
The problem of stiff differential equations arises in many computer-aided design techniques, particularly in the transient analysis of network simulation. Special multistep methods are used to solve the first-order stiff nonlinear differential equations. Instability and a large number of steps are encountered during simulation. Different techniques such as step and order selection schemes, procedures for changing step and order, may reduce the number of steps while preserving stability. An improved algorithm is presented using BDF formulas given by Brayton et at. and leads to reducing computer time by controlling the number of integration steps, but also the number of Newton iterations, the number of Jacobian matrix evaluations and other parameters, without producing additional errors or instability phenomena. Experimental results are shown.
Keywords :
Computer-aided circuit analysis and design; Differential equations; Network transient analysis; Stability; Analytical models; Computational modeling; Computer errors; Computer simulation; Design automation; Differential equations; Error correction; Jacobian matrices; Stability; Transient analysis;
fLanguage :
English
Journal_Title :
Circuits and Systems, IEEE Transactions on
Publisher :
ieee
ISSN :
0098-4094
Type :
jour
DOI :
10.1109/TCS.1980.1084888
Filename :
1084888
Link To Document :
بازگشت