Skip to main content
SpringerPlus logoLink to SpringerPlus
. 2016 Jul 7;5(1):1013. doi: 10.1186/s40064-016-2422-z

Analysis of backward differentiation formula for nonlinear differential-algebraic equations with 2 delays

Leping Sun 1,
PMCID: PMC4937010  PMID: 27441132

Abstract

This paper is concerned with the backward differential formula or BDF methods for a class of nonlinear 2-delay differential algebraic equations. We obtain two sufficient conditions under which the methods are stable and asymptotically stable. At last, examples show that our methods are true.

Keywords: Stability, Backward differential formula, Delay differential-algebraic equations, Perturbations

Background

For a system of differential-algebraic equations (DDAEs) (Brenan et al. 1996),

F(t,y(t),y(t))=0,

F and y are vector valued and F/y may be singular. In some cases, time delays appear in variables of unknown functions so that the differential-algebraic equations (DAEs) are converted to delay differential-algebraic equations (DDAEs) (Ascher and Petzold 1995),

F(t,y(t),y(t-τ),y(t),y(t-τ))=0,

where F and y are vector valued, τ>0 is a constant, F/y may be singular. If y(t-τ) does not vanish, it is actually called neutral delay differential-algebraic equations (NDDAEs), otherwise it is called delay differential-algebraic equations (DDADs). In 1995, authors in Ascher and Petzold (1995) discussed the convergence of BDF methods and Runge–Kutta methods solving initial-value differential-algebraic equations of retarded and neutral types, corresponding to the structure of Hessenberg forms; in 1997, authors Zhu and Petzold (1997) considered the asymptotic stability of linear constant coefficient differential-algebraic equations and obtained numerical results on θ-methods, Runge–Kutta methods and linear multistep methods to these systems. In 1998, Zhu and Petzold (1998) got further results on stability of Hessenberg DDAEs of retarded or neutral type. In 2005, stability of Rosenbrock methods for neutral delay differential-algebraic equatuons was discussed in Zhao and Xu (2005). Earlier, authors of Torelli (1989), Mechee et al. (2013) were interested in the numerical treatments on delay differential equations which are delay differential-algebraic equations with F/y nonsingular. Authors in Fan et al. (2013), Liu et al. (2014) gave criteria for stability of neutral delay differential-algebraic equations geometrically and obtained stable regions over which numerical methods could be used effectively. Among these results, there are few achievements on nonlinear systems. In fact, the solution of nonlinear system depends on a nonlinear manifold of a product space and on consistent initial valued-vectors over a space of continuous functions so that research on nonlinear DDAEs is more complicated and still remains investigated.

Authors in Kuang and Cong (2005), Ascher and Petzold (1998) denote that numerical approaches for the solution of differential-algebraic equations (DAEs) can be divided roughly into two classes. One is direct discretizations of the given system, the other is involving a reformulation, combined with a discretization. Practically all the winning methods have stiff decay. For initial value DAEs which are cumbersome and especially for DAEs whose underlying ODEs are stiff, the backward differentiation formulae (BDF) and Radau collocation methods are the overall methods of choice.

In this paper, we investigate a class of nonlinear DDAE system, and show the conditions under which two-step BDF methods are stable and asymptotically stable.

Asymptotic behavior of 2-delay differential-algebraic equations

Now we consider the following nonlinear system of delay differential-algebraic equations,

u(t)=f(t,u(t),u(t-τ),v(t),v(t-τ)),t>0,(τ>0) 1
0=φ(u(t),u(t-τ),v(t)),t>0, 2

According to Ascher and Petzold (1995) the assumption that φv is nonsingular allows one to solve the constraint equations (2) for v(t) using the implicit theorem, yielding

v(t)=g(u(t),u(t-τ)),t>0, 3

by substituting (3) into (1) we obtain the DODE

u(t)=f(t,u(t),u(t-τ),g(u(t),u(t-τ),u(t-2τ))), 4

Thus, the DDAEs (1) and (2) are stable if the DODE (4) is stable. Note that if all the delay terms are present in this retarded DODE, then the initial conditions need to be defined for t on [-2τ,0]. So in fact, we will investigate (1) and (2) by following nonlinear system of delay differential-algebraic equations,

u(t)=f(t,u(t),u(t-τ),v(t),v(t-τ)),t>0,(τ>0) 5
0=φ(u(t),u(t-τ),v(t)),t>0, 6
u(t)=φ1(t),v(t)=ψ1(t),-τt0, 7
u(t)=φ2(t),v(t)=ψ2(t),-2τt-τ, 8

and its perturbed equations

u~(t)=f(t,u~(t),u~(t-τ),v~(t),v~(t-τ)),t>0,(τ>0) 9
0=φ(u~(t),u~(t-τ),v~(t)),t>0, 10
u~(t)=φ~1(t),v~(t)=ψ~1(t),-τt0, 11
u~(t)=φ~2(t),v~(t)=ψ~2(t),-2τt-τ, 12

From results of Torelli (1989), we hope the estimations on u(t)-u~(t) and v(t)-v~(t) satisfy

u(t)-u~(t)max-τt0Φ(t)-Φ~(t),t0,v(t)-v~(t)max-τt0Ψ(t)-Ψ~(t),t0,

In practice, the following definition is to be considered.

Definition 1

Liu et al. (2014) System (1)–(2) is said to be stable, if the follow inequalities are satisfied,

u(t)-u~(t)max-2τt0Φ(t)-Φ~(t), 13
v(t)-v~(t)Mmax-2τt0Φ(t)-Φ~(t), 14

where M > 0 is a constant,

Φ=φ1(t),-τt0,φ2(t),-2τt-τ,Φ~=φ~1(t),-τt0,φ~2(t),-2τt-τ. 15

To study the stability of DDAE (1)–(2), we can investigate equations (5)–(8) and the perturbations (9)–(12). Ascher and Petzold (1995) showed that under some conditions the analytical solutions of the system is stable and asymptotically stable. In the next section, we will discuss the stability behavior of 2-step BDF methods for a class of the system based on the assumption that the analytical solution exists uniquely and stable.

The stability and asymptotic stability of 2-step BDF methods

Firstly, the 2-step BDF methods are introduced as follows.

Backward differentiation formula

For the differential equation

y(t)=f(t,y),

the Backward Differentiation Formula or BDF methods are derived by differentiating the polynomial which interpolates past values of y, each step is h, and setting the derivative at tn to f(tn,yn). This yields the k-step BDF, which has order p = k,

i=1k1iiyn=hf(tn,yn),

this can be written in scaled form where α0=1,

i=1kαiyn-i=hβ0f(tn,yn),

here we apply 2-step BDF, the formula can be written as

yn-43yn-1+13yn-2=23hf(tn,yn),

For the initial value problem of the ordinary differential equations

x(t)=f(t,x(t)),t>0, 16
x(0)=x0, 17

The 2-setp BDF methods can be written as:

xn+2=43xn+1-13xn+23hf(tn+2,xn+2),n=0,1,2,, 18
x0=x(0), 19

where xnx(tn), h>0 is the step size. To solve (5)–(8) and (9)–(12) by (18)–(19), we get

un+2=43un+1-13un+23hf(tn+2,un+2,un+2-m,vn+2,vn+2-m),n=0,1,2,, 20
0=φ(un+1,un+1-m,vn+1), 21
un=φ1(tn),vn=ψ1(tn),-mn0, 22
un=φ2(tn),vn=ψ2(tn),-2mn-m,(mh=τ,m1). 23

The perturbations of (20)–(21) are

u~n+2=43u~n+1-13u~n+23hf(tn+2,u~n+2,u~n+2-m,v~n+2,v~n+2-m),n=0,1,2,, 24
0=φ(u~n+1,u~n+1-m,v~n+1), 25
u~n=φ~1(tn),v~n=ψ~1(tn),-mn0, 26
u~n=φ~2(tn),v~n=ψ~2(tn),-2mn-m,(mh=τ,m1). 27

If the step size is h>0 and tn=nh and the numerical approximations are unu(tn), it should be note that ti-τ may not be a grid point tj for any j. Then a function interpolation is needed so that

un+i-m=δuun+i+1-m+(1-δu)un+i-m,vn+j-m=δvvn+j+1-m+(1-δv)vn+j-m,

here 0<δu,δv<1, the convergence order of interpolation is 2 and the local truncation error of the method is 3, then the convergence order of the iteration by BDF method is two (Kuang and Cong 2005). For simplicity, we just consider un+i-m,vn+j-m are on grid points or obtained by interpolations.

The stability of 2-step BDF methods

Let uτ=u(t-τ),vτ=v(t-τ). We require that f, φ in (5), (6), (9), and (10) satisfy the following Lipschitz conditions (1)–(4):

  1. f(t,u,uτ,v,vτ)-f(t,u~,uτ,v,vτ),u-u~σ(t)u-u~2,
  2. f(t,u,uτ,v,vτ)-f(t,u,u~τ,v,vτ)γ1(t)uτ-u~τ,f(t,u,uτ,v,vτ)-f(t,u,uτ,v~,vτ)γ2(t)v-v~,f(t,u,uτ,v,vτ)-f(t,u,uτ,v,v~τ)γ3(t)vτ-v~τ,
  3. φv is nonsingular, so that for g(uv) in (3), there exist L>0, K>0, such that
    g(u,v)-g(u~,v)Lu-u~,g(u,v)-g(u,v~)Kv-v~,σ(t)<0,12σ1(t)+γ1(t)+(L+K)γ2(t)+(L+K)γ3(t)-σ(t),t>0,
    where σ1(t) is an increasing function described in the following Theorem 1.

    Note: σ(t)<0 means the right side of function in condition (1) is negative, examples in the last section show the situation exists.

  4. The Frechet derivatives of g(uv) with regard to u, v, gu, gv exist in the product space Rd×Rd, gv is continuous, (gu)-1 exists, and
    supu,vRdgv-1gu=L<,
    where u=(u1,u2,,ud)T, v=(v1,v2,,vd)T, u,v=i=1duivi, u2=u,u,
    gu=supωRd,ω=1guω.

Here |σ(t)|,σ1(t),γi(t),i=1,2,3,t>0 are increasing functions defined on time. The Frechet derivatives are described as follows, If

x=(x1,x2,,xn)TRn,F(x)=(f1(x),f2(x),,fm(x))TRm,fj(x)=fj(x1,x2,,xn)R,j=1,,m,

fj(x)(j=1,2,,m) has first-order continuous partial derivative at x=x0, then the Frechet derivative F(x) can be expressed by the following matrix:

F(x0)=f1x1f1x2f1xnf2x1f2x2f2xnfmx1fmx2fmxnx=x0

Definition 2

A numerical method for solving DDAEs is called stable, if for every consistent initial value functions Φ, Φ~, and each step h>0, the solution sequences {un,vn}, {u~n,v~n} for (5)–(8) and (9)–(12) in which f,φ satisfy conditions (1)–(4), satisfy

un-u~nmax-2τt0Φ(t)-Φ~(t),n=0,1,2,,vn-v~nMmax-2τt0Φ(t)-Φ~(t),n=0,1,2,,

for some M>0. Now the sufficient condition with which the DDAEs are stable is as follows.

Theorem 1

The 2-step BDF methods are stable for DDAEs iff,φsatisfy conditions (1)–(4) and

f(t,u,uτ,v,vτ)-f(t,u~,u~τ,v~,v~τ)σ1(t)u-u~,

Note: it seems more natural iff(t,u,uτ,v,vτ)-f(t,u~,uτ,v,vτ)σ1(t)u-u~is true, but we find proofs are analogous with this condition but only cumbersome and results are true without this assumption throughout the discussion in this paper.

Proof

Let V¯n=un-u~n. Substituted into (20) and (24),

V¯n+2=43V¯n+1-13V¯n+23h{f(tn+2,un+2,un+2-m,vn+2,vn+2-m)-f(tn+1,u~n+2,u~n+2-m,v~n+2,v~n+2-m)}=V¯n+1+13(V¯n+1-V¯n)+23h{f(tn+2,un+2,un+2-m,vn+2,vn+2-m)-f(tn+2,u~n+2,un+2-m,vn+2,vn+2-m)+f(tn+2,u~n+2,un+2-m,vn+2,vn+2-m)-f(tn+2,u~n+2,u~n+2-m,vn+2,vn+2-m)+f(tn+2,u~n+2,u~n+2-m,vn+2,vn+2-m)-f(tn+2,u~n+2,u~n+2-m,v~n+2,vn+2-m)+f(tn+2,u~n+2,u~n+2-m,v~n+2,vn+2-m)-f(tn+2,u~n+2,u~n+2-m,v~n+2,v~n+2-m}. 28

An inner product of (28) with V¯n+1=un+1-u~n+1,

V¯n+2,V¯n+2=V¯n+2,V¯n+1+13V¯n+1-V¯n,V¯n+2+23hf(tn+2,un+2,un+2-m,vn+2,vn+2-m)-f(tn+1,u~n+2,u~n+2-m,v~n+2,v~n+2-m),V¯n+2,

apply Schwartz theorem and condition (1)–(2), we obtain

V¯n+22V¯n+1V¯n+2+13V¯n+1-V¯nV¯n+2+23h(σ(tn+2)V¯n+22+γ1(tn+2)V¯n+2-m·V¯n+2+γ2(tn+2)vn+2-v~n+2·V¯n+2+γ3(tn+2)vn+2-m-v~n+2-m·V¯n+2). 29

Assume that V¯n+20 (otherwise no perturbations), note (3) and condition (3), (4), we conclude

vn+2-v~n+2Lun+2-u~n+2+Kun+2-m-u~n+2-m,vn+2-m-v~n+2-mLun+2-m-u~n+2-m+Kun+2-2m-u~n+2-2m,n=0,1,2,, 30

(29) divided by V¯n+2, and note the consistency of the initial value function, we get

V¯n+2V¯n+1+13V¯n+1-V¯n+23hω(tn+2)V¯n+2-m+23hKγ3(tn+2)V¯n+2-2m1-23h(σ(tn+2)+Lγ2(tn+2)), 31

where ω(tn+2)=γ1(tn+2)+Kγ2(tn+2)+Lγ3(tn+2),n=0,1,2,,V¯0,V¯1 are two initial values for 2-step BDF methods where V0max-2τt0Φ(t)-Φ~(t), V¯1 is evaluated by using Implicit Euler method

V¯1-V¯0=hf(t1,u1,u1-m,v1,v1-m)-f(t~1,u~1,u~1-m,v~1,v~1-m) 32

and conditions (1)–(3), by a simple induction, we get

V¯1max-2τt0Φ(t)-Φ~(t), 33

and with the condition of this theorem, yields

V¯1-V¯0hσ1(t1)u1-u~1=hσ1(t1)V¯1, 34

hence, as n=0,

V¯2V¯1+13hσ1(t1)V¯1+23hω(t2)V¯2-m+23hKγ3(t2)V¯2-2m1-13h(σ(t2)+Lγ2(t2)), 35

with condition (3) and (33) and the incretion of |σ(t)|,σ1(t),γi(t),i=1,2,3, we get

V2max-2τt0Φ(t)-Φ~(t), 36

as n=1, we evaluate V¯3 in (31) in terms of V¯2,V¯2-V¯1 in the following.

V¯2=V¯1+13(V¯1-V¯0)+23h(f(t2,u2,u2-m,v2,v2-m)-f(t2,u~2,u~2-m,v~2,v~2-m)),

then, from condition (1) and (34)

V¯2-V¯113V¯1-V¯0+23h(f(t2,u2,u2-m,v2,v2-m)-f(t2,u~2,u~2-m,v~2,v~2-m)13hσ1(t1)V¯1+23hσ1(t2)V¯2hσ1(t2)(13V¯1+23V¯2), 37

substitute (37) into (31), take n = 2, also note the incretion of |σ(t)|,σ1(t),γi(t),i=1,2,3, we get the estimation of V¯3 in the following,

V¯3V¯2+13hσ1(t3)13V¯1+23V¯2+23hω(t3)V¯3-m+23hKγ3(t3)V¯3-2m1-23h(σ(t3)+Lγ2(t3)), 38

note condition (3), (33) and (36), V¯3-m,V¯3-2m are initial valued functions with (33) or (36) satisfied too, so we get

V3max-2τt0Φ(t)-Φ~(t),

similarly, when n = 2, 3, 4,…, by iteration,

Vnmax-2τt0Φ(t)-Φ~(t),

applying mathematical induction, we conclude it is true for all n0. As for vn-v~n, just see (28)

vn-v~nMmax-2τt0Φ(t)-Φ~(t).

The asymptotic stability of 2-step BDF methods

Now we give the following definition.

Definition 3

The delay differential-algebraic equations (5)–(8) are asymptotically stable if and only if for every consistent initial value functions Φ(t), Φ~(t), solutions {u(t),v(t)}, {u~(t),v~(t)} satisfy

limtu(t)-u~(t)=0,limtv(t)-v~(t)=0,

Theorem 2

Iff,φsatisfy conditions (1)–(4) and the following (3)

σ(t)+Lγ2(t)-β<0,supt013σ1(t)+23(γ1(t)+Kγ2(t)+(L+K)γ3(t))-23(σ(t)+Lγ2(t))=q,0q<1.

Then the 2-step BDF methods are asymptotically stable for DDAEs Here|σ(t)|,σ1(t),γi(t),i=1,2,3,t0are increasing functions. Note: The system is stable ifq=1whileqstrictly less than 1 is required for asymptotic stability.

Proof

Let Vn=un-u~n, from (31) (35) (38), we have

V¯n+2V¯n+1+13hσ1(tn+1)13V¯n+23V¯n+1+23hω(tn+2)V¯n+2-m+23hKγ3(tn+2)V¯n+2-2m1-23h(σ(tn+2)+Lγ2(tn+2)). 39

Let 0n2m-1 in the above inequality, we get

V¯n+2maxt01+13hσ1(tn+2)+23h(ω(tn+2)+Kγ3(tn+2))1-23h(σ(tn+2)+Lγ2(tn+2))·max-2τt0Φ(t)-Φ~(t).

Note condition (3′), there is 0<p<1 such that

1+13hσ1(t)+23h(ω(t)+Kγ3(t))1+23h|σ(t)+Lγ2(t)|1+23hq|σ(t)+Lγ2(t)|1+23h|σ(t)+Lγ2(t)|1+23hβq1+23hβ=p<1.

Therefore, when 0n2m-1

V¯n+2pmax-2τt0Φ(t)-Φ~(t).

For the case n=2m

V¯2m+2V¯2m+1+13hσ1(t2m+1)13V¯2m+23V¯2m+1+23hω(t2m+2)V¯m+2+23hKγ3(t2m+2)V¯21-23h(σ(t2m+2)+Lγ2(t2m+2)).

As indicated above,

V¯2m+2p2max-2τt0Φ(t)-Φ~(t).

For the case 2rmn2(r+1)m-1, it can be shown by induction that

V¯n+2pr+1max-2τt0Φ(t)-Φ~(t).

When r,n

V¯n+20,(n)

Thus,

un-u~n0,vn-v~n0,(n).

Numerical examples

First, we give an example for Theorem 1.

Example 1

Let u(t), v(t)R,   f:R×R×R×R×RR,   g:R×RR.

u(t)=σ(t)u(t)+P1(t)f1(u(t-τ))+P2(t)f2(v(t))+P3(t)f3(v(t-τ)) 40
0=g(u,v) 41

where σ(t), σ1(t), P1(t), P2(t), P3(t) are polynomials of t, u(t-τ)=0. Condition (1)–(4) say if,

supu,vRgv-1guL<. 42
γi(t)=|Pi(t)|,i=1,2,3 43
|fi(u)-fi(u~)|Li|u-u~|,i=1,2,3 44
σ(t)<0,12σ1(t)+L1γ1(t)+L(L2γ2(t)+L3γ3(t))-σ(t), 45

then (40)–(41) is stable. In fact,

  1. f(t,u,uτ,v,vτ)-f(t,u~,uτ,v,vτ),u-u~=σ(t)|u-u~|2,|f(t,u,uτ,v,vτ)-f(t,u~,u~τ,v~,v~τ)|σ1(t)|u-u~|
  2. |f(t,u,uτ,v,vτ)-f(t,u,u~τ,v,vτ)|=|P1(t)|·|f1(uτ)-f1(u~τ)|L1γ1(t)|uτ-u~τ|,|f(t,u,uτ,v,vτ)-f(t,u,uτ,v~,vτ)|=|P2(t)|·|f2(v)-f2(v~)|L2γ2(t)|v-v~|,|f(t,u,uτ,v,vτ)-f(t,u,uτ,v,v~τ)|=|P3(t)|·|f3(vτ)-f3(v~τ)|L3γ3(t)|vτ-v~τ|.

Let u~=u+h, v~=v+k, using Taylor’s formula,

g(u~,v~)=g(u,v)+g~uh+g~vk, 46

where g~(u,v)=g(u+θh,v+θk), 0<θ<1.

If g(u,v)=g(u~,v~)=0, (46) results in

v~-v=g~v-1g~u(u~-u).

If (42) is true, then

|v~-v|L|u~-u|, 47

together with (43), (44), (45), (47), we know that all the conditions of Theorem (16) are satisfied. For example,

P1(t)=t,P2(t)=2t2,P3(t)=1+t,σ(t)=-(1+2t)2,

and checking the note from Theorem 1, we just take

σ1(t)=(1+2t)2,f1(uτ)=sinuτ,f2(v)=log(1+v2),f3(vτ)=cosvτ.

It can be easily verified by Lagrange mean value theorem that the Lipschitz constant,

L1=1,L2=12,L3=1,L=supu,vRgv-1gu.

Let

g(u,v)=v-arctan(1+u),

then

gu=-11+u2,|gu|1,

we get L=1 and

12σ1(t)+L1γ1(t)+L(L2γ2(t)+L3γ3(t))-σ(t),t0,t>12actually.

Conditions (1)–(4) are satisfied in the above example. Example 2 and Example 3 show the stable results, while Example 4 shows unstable results.

Example 2

Let x(t),y(t)R, f:R×R×R×R×RR,   φ:R×R×RR.

x(t)=-2x(t)+1e2(1+e2)x(t)y(t-τ)-1e2(1+e2)x(t-τ)y(t)0=12x(t)+12x(t-τ)-y(t)x(t)=e-2t,-2τt0y(t)=12(e-2t+e-2t+2),-2τt0,

Take τ=1, then σ(t)=(-2+12e-2t)<0,L=12,K=12,   σ1(t)=2

γ1(t)=e-2t2e2,γ2(t)=e-2t1+e2,γ3(t)=e-2te2(1+e2)

Therefore,

12σ1+γ1+(L+K)γ2+(L+K)γ3=1+3e-2t2e2<--2+12e-2t=σ(t).

The above results show that all the stability conditions are satisfied, so 2-step BDF methods for the system are stable and asymptotically stable. This can be seen in the following graph (Fig. 1). Table 1 lists errors between numerical solutions and the exact solutions with different step sizes. Table 2 shows numerical results made by implicit Euler method and 2-step BDF method at some time. It can be seen by comparison that BDF method converges much faster than implicit Euler method.

Fig. 1.

Fig. 1

Approximate solutions using 2-step BDF methods with h=0.01

Table 1.

Errors compared with the exact solution for Example 2

m h (mh = 1) max|xn-x(tn)| max|yn-y(tn)|
10 0.1 4.2 × 10−3 1.75 × 10−2
100 0.01 4.83 × 10−5 2.03 × 10−4
1000 0. 001 4.90 × 10−7 2.05 × 10−6
2000 0.0005 1.23 × 10−7 5.14 × 10−7
4000 0.00025 3.06 × 10−8 1.29 × 10−7
8000 0.000125 7.67 × 10−9 3.21 × 10−8
16000 0.0000625 1.92 × 10−9 8.04 × 10−9
106 10−6 9.21 × 10−12 3.86 × 10−11

Table 2.

x n and y n are numerical solutions by implicit Euler method, x~n and y~n are numerical solutions by BDF method, x(t n and y(t n) are exact solutions

n tn=nh x n x n x~n y~n x(t n) y(t n)
0 0 1.0000 0.0500 1.0000 0.5000 1.0000 0.5000
1 0.1 0.8725 0.4363 0.8607 0.4304 0.8607 0.4304
2 0.2 0.7613 0.3806 0.7403 0.3701 0.7408 0.3704
3 0.3 0.6642 0.3321 0.6371 0.3186 0.6376 0.3188
4 0.4 0.5795 0.2898 0.5484 0.2742 0.5488 0.2744
5 0.5 0.5056 0.2528 0.4720 0.2360 0.4724 0.2362
6 0.6 0.4412 0.2206 0.4063 0.2031 0.4066 0.2033
7 0.7 0.3849 0.1925 0.3497 0.1748 0.3499 0.1750
8 0.8 0.3358 0.1679 0.3010 0.1505 0.3012 0.1506
9 0.9 0.2930 0.1465 0.2590 0.1295 0.2592 0.1296
10 1.0 0.2557 0.1278 0.2230 0.1115 0.2231 0.1116
11 1.1 0.2231 0.1115 0.119 0.0960 0.1920 0.0960
12 1.2 0.1946 0.0973 0.1652 0.0826 0.1653 0.0826
13 1.3 0.1698 0.0849 0.1422 0.0711 0.1423 0.0711
14 1.4 0.1482 0.0741 0.1224 0.0612 0.1225 0.0612
15 1.5 0.1293 0.0646 0.1053 0.0527 0.1054 0.0527
16 1.6 0.1128 0.0564 0.0906 0.0453 0.0907 0.0454
17 1.7 0.0984 0.0492 0.0780 0.0390 0.0781 0.0390
18 1.8 0.0859 0.0429 0.0672 0.0336 0.0672 0.0336
19 1.9 0.0749 0.0375 0.0578 0.0289 0.0578 0.0289
20 2.0 0.0654 0.0327 0.0497 0.0249 0.0498 0.0249

All solutions are on [0, 2] with h = 0.1 and nh = 2

Example 3

Let x(t),y(t)Rf:R×R×R×R×RR,g:R×RR

x(t)=-3x(t)+e-6x(t)y(t-τ)-e-6x(t-τ)y(t)0=x(t)-2y(t)

Here we take τ=2, its initial functions are

x(t)=e-3t,y(t)=12e-3t

Obviously,

supx,yRgy-1gx=12<

Then it can be found by a simple computation and without losing generality, by taking supremum values

σ=supt0-3+12e-3t=-52,σ1=supt03-12e-3t=3,γ1=supt012e-3t-3=12e-6,γ2=supt0(e-3t)=1,γ3=supt0(e-3t-6)=e-6,

they satisfy

12σ1+σ+γ1+L(γ2+γ3)<0.

The above results show that all the stability conditions are satisfied, so 2-step BDF methods for the system are stable and asymptotically stable. The simple illustrations are shown in the following graph (Fig. 2) and we can check it by errors of the solutions listed in the following Table 3.

Fig. 2.

Fig. 2

Approximate solutions using 2-step BDF methods

Table 3.

Errors compared with the exact solution for Example 3

m h (mh = 2) max|xn-x(tn)| max|yn-y(tn)|
10 0.2 2.49 × 10−2 1.25 × 10−2
100 0.02 4.22 × 10−4 2.11 × 10−4
1000 0.002 4.39 × 10−6 2.20 × 10−6
2000 0.001 1.10 × 10−6 5.50 × 10−7
4000 0.0005 2.76 × 10−7 1.38 × 10−7
8000 0.00025 6.89 × 10−8 3.45 × 10−8
16000 0.000125 1.72 × 10−9 8.60 × 10−10
106 2 × 10−6 5.42 × 10−12 2.71 × 10−12

Example 4

x1(t)=(1+x2(t)-sint)y(t)+cost+sint-(x2(t-1)-sin(t-1))2,x2(t)=cost+x2((t-1)-sin(t-1),x3(t)=y(t)+(x2(t-1)-sin(t-1))2,0=(x1(t)-sin(t))(y(t)-exp(t)).

Here u(t)=(x1(t),x2(t),x3(t))T,v(t)=y(t). By simple calculation, we get,

f(t,x,xτ,y,yτ)-f(t,x~,xτ,y,yτ),x-x~=exp(t)(x1-x1~)(x1-x1~),

For the initial data

x1(0)=0,x2(0)=0,x3(0)=1,x2(t)=sin(t),(t0).

The solution is

x1(t)=sin(t)-cos(t)+exp(t),x2(t)=sin(t),x3(t)=exp(t),y(t)=exp(t).

Obviously, this solution is not stable. In fact, we could not find any σ(t) satisfies

f(t,x,xτ,y,yτ)-f(t,x~,xτ,y,yτ),x-x~σ(t)x(t)-x~t2,

Thus conditions of Theorem 1 are not valid.

Conclusions and notes

While investigating nonlinear 2-delayed differential-algebraic equations, we get two sufficient conditions for the stability and asymptotic stability of 2-step BDF methods and think about how to check the conditions with some example. Although it is quite an early stage, the discussion is a useful enlightenment for differential-algebraic equations with multi-delays in the future. Note the Lipschitz conditions play a key role in this research. Apparently the second inequality in condition (1) seems more nature with the form f(t,u,uτ,v,vτ)-f(t,u~,uτ,v,vτ)σ1(t)u-u~, but we find results can also be true and the proofs are analogous.

Acknowledgements

The research is supported by the scientific Computing key Laboratory of Shanghai University and the Shanghai Natural Science Foundation, No. 15ZR1431200.

Competing interests

The author declares that he has no competing interests.

References

  1. Ascher U, Petzold LR. The numerical solution of delay-differential-algebraic equations of retarded and neutral type. SIAM Numer Anal. 1995;32:1635–1657. doi: 10.1137/0732073. [DOI] [Google Scholar]
  2. Ascher UM, Petzold LR. Computer methods for ordinary differential equations and differential-algebraic equations. Philadelphia: SIAM Press; 1998. [Google Scholar]
  3. Brenan KE, Campbell SL, Petzold LR. Numerical solution of initial-value problems in differential-algebraic equations. Philadelphia: SIAM Press; 1996. [Google Scholar]
  4. Fan N, Liu L, Sun L. Stability criteria for neutral delay differential-algebraic equations. J Shanghai Norm Univ (Nat Sci) 2013;4(5):451–457. [Google Scholar]
  5. Kuang JX, Cong YH. Stability of numerical methods for delay differential equations. Beijing: Science Press; 2005. [Google Scholar]
  6. Liu L, Fan N, Sun L. Stability criteria for delay differential-algebraic equations. J Shanghai Norm Univ (Nat Sci) 2014;43(1):38–43. [Google Scholar]
  7. Mechee M, Ismail F, Senu N, Siril A. Directly solving special second order delay differential equations using Runge–Kutta–Nystrom method. Mathematical problems in engineering. Cairo: Hindawi Publishing Corporation; 2013. [Google Scholar]
  8. Torelli Lucia. Stability of numerical methods for delay differential equations. J Comput Appl Math. 1989;25:15–26. doi: 10.1016/0377-0427(89)90071-X. [DOI] [Google Scholar]
  9. Zhao JJ, Xu Y. Stability of the Rosenbrock methods for the neutral delay differential-algebraic equations. Appl Math Comput. 2005;168:1128–1144. doi: 10.1016/j.amc.2004.10.008. [DOI] [Google Scholar]
  10. Zhu W, Petzold LR (1997) Asymptotic stability of linear delay differential-algebraic equations and numerical methods*. Appl Numer Math 24:247–264
  11. Zhu W, Petzold LR (1998) Asymptotic stability of Hessenberg delay differential-algebraic equations of retarded or neutral type. Appl Numer Math 27:309–325

Articles from SpringerPlus are provided here courtesy of Springer-Verlag

RESOURCES