Two classes of implicit–explicit multistep methods for nonlinear stiff initial-value problems

2014 ◽  
Vol 247 ◽  
pp. 47-60 ◽  
Author(s):  
Aiguo Xiao ◽  
Gengen Zhang ◽  
Xing Yi
2021 ◽  
Vol 5 (2) ◽  
pp. 442-446
Author(s):  
Muhammad Abdullahi ◽  
Hamisu Musa

This paper studied an enhanced 3-point fully implicit super class of block backward differentiation formula for solving stiff initial value problems developed by Abdullahi & Musa and go further to established the necessary and sufficient conditions for the convergence of the method. The method is zero stable, A-stable and it is of order 5. The method is found to be suitable for solving first order stiff initial value problems


Mathematics ◽  
2019 ◽  
Vol 7 (12) ◽  
pp. 1197
Author(s):  
Changbum Chun ◽  
Beny Neta

Numerical methods for the solution of ordinary differential equations are based on polynomial interpolation. In 1952, Brock and Murray have suggested exponentials for the case that the solution is known to be of exponential type. In 1961, Gautschi came up with the idea of using information on the frequency of a solution to modify linear multistep methods by allowing the coefficients to depend on the frequency. Thus the methods integrate exactly appropriate trigonometric polynomials. This was done for both first order systems and second order initial value problems. Gautschi concluded that “the error reduction is not very substantial unless” the frequency estimate is close enough. As a result, no other work was done in this direction until 1984 when Neta and Ford showed that “Nyström’s and Milne-Simpson’s type methods for systems of first order initial value problems are not sensitive to changes in frequency”. This opened the flood gates and since then there have been many papers on the subject.


Sign in / Sign up

Export Citation Format

Share Document