Modified backward differentiation methods of the Adams-type based on exponential interpolation
type: Item
instance of: scholarly article
title: Modified backward differentiation methods of the Adams-type based on exponential interpolation
zbMATH Open document ID: 0729.65054
DOI: 10.1016/0898-1221(91)90096-M
author: H. De Meyer
author: G. Vanden Berghe
author: Jan Vanthournout
publication date: 1991-01-01T00:00:00Z
review text: Adams-Bashforth and Adams-Moulton finite difference schemes of the usual form \(y_{p+1}=y_ p+h\cdot \sum^{m+q}_{j=m}\beta_ jf_{p+1-j},\) \(m=0\) or 1, \(h>0\), are derived from the integral formulation of the Cauchy problem for the ordinary differential equation \(y'=f(x,y):\) \[ y(x_{p+1})=y(x_ p)+h\cdot \int^{x_{p+1}}_{x_ p}f(t,y(t))dt \] where f(t,y(t)) is replaced by its Lagrange interpolatory polynomial with nodes \(x_{p+1-j}=x_ 0+(p+1-j)h\), \(j=m,...,q\), \(m=0\) or 1, \(h>0.\) The authors propose to apply here functions of the form \(e^{kx}P_ q(x)\), where \(P_ q\) is a polynomial of degree \(\leq q\), and k is a real free parameter, instead of the usual polynomials. If calculations were performed without round-off errors, finite difference schemes of this type would fit the exact solution, provided that this last one is of the form \(y(x)=e^{kx}\sum^{q}_{j=0}a_ jx^ j.\) In this paper, coefficients \(\beta_ j\) for such schemes are derived for \(q=1,2\) and 3. In contrast to ``traditional'' multistep methods, here the coefficients \(\beta_ j\) depend on h and k. The right choice of the free parameter k is suggested by the form of the remainder term of interpolation. This term, usually expressed with an application of the ``midpoint-value theorem'', involves certain unknown point inside the interval of interpolation. The value of the remainder is expressed as the \((q+1)\)-st derivative of certain known function depending on y and k. The authors propose to make vanishing this derivative in some point of the interval. This suggests an equation from which k may be eventually found. The paper contains few numerical tests showing a real improvement of results with respect to traditional algorithms, when the proposed method is applied to Cauchy problems having solutions of exponential character.
Mathematics Subject Classification ID: 65L06
Mathematics Subject Classification ID: 65L05
Mathematics Subject Classification ID: 34A34
zbMATH DE Number: 4205896
zbMATH Keywords: backward differentiation methods
zbMATH Keywords: exponential interpolation
zbMATH Keywords: Adams- Bashforth method
zbMATH Keywords: Adams-Moulton method
zbMATH Keywords: finite difference schemes
zbMATH Keywords: Cauchy problem
zbMATH Keywords: multistep methods
zbMATH Keywords: numerical tests
zbMATH Keywords: solutions of exponential character
MaRDI profile type: Publication
cites work: On a new type of mixed interpolation
cites work: The Use of Exponential Sums in Step by Step Integration
cites work: Q3273503
cites work: Chebyshevian multistep methods for ordinary differential equations
cites work: Numerical quadrature based on an exponential type of interpolation
cites work: An \(A\)-stable extended trapezoidal rule for the integration of ordinary differential equations
cites work: Extended one-step methods for the numerical solution of ordinary differential equations
cites work: Q3992544
full work available at URL: 0898-1221(91)90096-m
OpenAlex ID: W2131785782
published in: Computers & Mathematics with Applications
description: scientific article; zbMATH DE number 4205896