A non-linear absolutely-stable explicit numerical integration algorithm for stiff initial-value problems

Research output: Contribution to journalArticlepeer-review

7 Scopus citations

Abstract

The time-step in integration process has two restrictions. The first one is the time step restriction due to accuracy requirement τac and the second one is the time-step restriction due to stability requirement τst. The most of explicit methods have small stability regions and consequently small τst. It obliges us to solve stiff problems with small step size τst << τac. The implicit methods work well with stiff problems but these methods require more work per step than the explicit methods. In this study, a non-linear absolutly stable explicit one step numerical integration algorithm is proposed for solving non linear stiff initial-value problems in ordinary differential equations. The algorithm is based on deriving a non-linear relation between the dependent variable and its derivatives from the well known Taylor expansion. The accuracy of the method depends on some unknown parameter inserted in Taylor expansion and determined from the error analysis. The accuracy and stability properties of the method are investigated and shown to yield at least thirdorder and A-stable. The results obtained in the numerical experiments show the efficiency of the present method in solving stiff initial value problems.

Original languageEnglish
Pages (from-to)1363-1370
Number of pages8
JournalAmerican Journal of Applied Sciences
Volume10
Issue number11
DOIs
StatePublished - 11 Sep 2013

Keywords

  • A-stability
  • Explicit methods
  • Initial-value problems
  • Non-linear methods
  • Stiff problems

Fingerprint

Dive into the research topics of 'A non-linear absolutely-stable explicit numerical integration algorithm for stiff initial-value problems'. Together they form a unique fingerprint.

Cite this