By Topic

An efficient algorithm reduces computing time in solving a system of stiff ordinary differential equations

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)

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.

Published in:

IEEE Transactions on Circuits and Systems  (Volume:27 ,  Issue: 9 )