.png){kind=icon}
.png){kind=icon}
Return
Exponentially fitted variable two-step BDF algorithm for first order ODEs
.png){kind=icon}
PRE
AI
DOI：10.1016/S0010-4655(02)00676-8.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We construct the exponential fitting extension of the classical variable step-size two-step BDF algorithm and examine its properties. We give the expression of the optimal value of the associated frequency and introduce a procedure for choosing the step widths in terms of the required accuracy. The order of the new algorithm is three (that is by one unit higher than for the classical one). On three severe stiff test cases we show that the new two-step algorithm behaves much better than its classical companion and that it is as good as the classical variable three-step algorithm. (C) 2002 Elsevier Science B.V. All rights reserved.
Keywords:
exponential fitting
variable steps
multistep algorithms
frequency evaluation
error analysis
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.4
Papers:
1.2W
Citations:
3.7W
Organization
No organization information available