zbMATH — the first resource for mathematics

Examples
Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

Operators
a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
Fields
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Segmented tau approximation for test neutral functional differential equations. (English) Zbl 1117.65102

Summary: We use the segmented formulation of the tau method to approximate the solutions of the neutral delay differential equation

y ' (t)=ay(t)+by(t-τ)+cy ' (t-τ)+f(t),t0,y(t)=Ψ(t),t0,

which represents, for different values of a,b,c and τ, a family of functional differential equations that some authors have considered as test equations in different numerical experimentations. The tau method introduced by Lanczos is an important example of how to get approximations of functions defined by a differential equation. In the formulation of a step by step tau version is expected that the error is minimized at the matching points of successive steps. Through the study of recent papers it seems to be demonstrated that the step by step tau method is a natural and promising strategy for the numerical solution of functional differential equations. In preliminary experimentation significant improvements have been obtained when compared with the numerical results obtained elsewhere.

MSC:
65L05Initial value problems for ODE (numerical methods)
34K28Numerical approximation of solutions of functional-differential equations
34K40Neutral functional-differential equations
Software:
bvp4c