1978
DOI: 10.1007/bfb0067469
|View full text |Cite
|
Sign up to set email alerts
|

The RKFHB4 method for delay — Differential equations

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
14
0

Year Published

1983
1983
2003
2003

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 27 publications
(14 citation statements)
references
References 8 publications
0
14
0
Order By: Relevance
“…In the general case fn is a complicated expression in 8t,tn' yn,yj' .•• ,yj-l" Alternative methods for solving (I.I) are the LMMs of Tavernini [JO] and the Runge-Kutta type methods proposed by Arndt [! ] and Oppelstrup [8].…”
Section: Linear Multistep Methodsmentioning
confidence: 99%
“…In the general case fn is a complicated expression in 8t,tn' yn,yj' .•• ,yj-l" Alternative methods for solving (I.I) are the LMMs of Tavernini [JO] and the Runge-Kutta type methods proposed by Arndt [! ] and Oppelstrup [8].…”
Section: Linear Multistep Methodsmentioning
confidence: 99%
“…Error estimates for (2.1) have been given by many authors, e.g. Oberle and Pesch [16], Oppelstrup [17,18], Tavernini [24]. These are of the form…”
Section: Global Errormentioning
confidence: 98%
“…On the other hand, Oppelstrup [17,18] has shown that with regard to the point 2 = x 0 there is an asymptotic expansion of the form…”
Section: Z'(x) =F(x Z(x)) Z(:2) = U(s H)mentioning
confidence: 99%
“…The other approach to the retarded argument is interpolation (see e.g. [11]), which we will use. Since for the numerical solution of the differential equation, the time is split into discrete time steps, labeled with index n, we have the approximated values of the solution at the discrete times t j (0 ≤ j < n), available when calculating y n = y(t n ) for n ≥ 0.…”
Section: Treatment Of the Retarded Valuementioning
confidence: 99%