A new interpolation procedure for adapting Runge-Kutta methods to delay differential equations
KJ In't Hout - BIT Numerical Mathematics, 1992 - Springer
BIT Numerical Mathematics, 1992•Springer
This paper deals with adapting Runge-Kutta methods to differential equations with a lagging
argument. A new interpolation procedure is introduced which leads to numerical processes
that satisfy an important asymptotic stability condition related to the class of testproblems
U′(t)= λ U (t)+ μ U (t− τ) with λ, μ ε C, Re (λ)<−| μ|, and τ> 0. If ci denotes the i th abscissa of
a given Runge-Kutta method, then in the n th step tn− 1→ tn:= tn− 1+ h of the numerical
process our interpolation procedure computes an approximation to U (tn− 1+ cih− τ) from …
argument. A new interpolation procedure is introduced which leads to numerical processes
that satisfy an important asymptotic stability condition related to the class of testproblems
U′(t)= λ U (t)+ μ U (t− τ) with λ, μ ε C, Re (λ)<−| μ|, and τ> 0. If ci denotes the i th abscissa of
a given Runge-Kutta method, then in the n th step tn− 1→ tn:= tn− 1+ h of the numerical
process our interpolation procedure computes an approximation to U (tn− 1+ cih− τ) from …
Abstract
This paper deals with adapting Runge-Kutta methods to differential equations with a lagging argument. A new interpolation procedure is introduced which leads to numerical processes that satisfy an important asymptotic stability condition related to the class of testproblemsU′(t)=λU(t)+μU(t−τ) with λ, μ ε C, Re(λ)<−|μ|, and τ>0. Ifc i denotes theith abscissa of a given Runge-Kutta method, then in thenth stept n−1→t n :=t n−1+h of the numerical process our interpolation procedure computes an approximation toU(t n−1+c i h−τ) from approximations that have already been generated by the process at pointst j−1+c i h(j=1,2,3,...). For two of these new processes and a standard process we shall consider the convergence behaviour in an actual application to a given, stiff problem.
Springer
以上显示的是最相近的搜索结果。 查看全部搜索结果