Differential transform algorithm for functional differential equations with time-dependent delays
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F70883521%3A28140%2F20%3A63525249" target="_blank" >RIV/70883521:28140/20:63525249 - isvavai.cz</a>
Alternative codes found
RIV/00216305:26620/20:PU136085
Result on the web
<a href="https://www.hindawi.com/journals/complexity/2020/2854574/" target="_blank" >https://www.hindawi.com/journals/complexity/2020/2854574/</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1155/2020/2854574" target="_blank" >10.1155/2020/2854574</a>
Alternative languages
Result language
angličtina
Original language name
Differential transform algorithm for functional differential equations with time-dependent delays
Original language description
An algorithm using the differential transformation which is convenient for finding numerical solutions to initial value problems for functional differential equations is proposed in this paper. We focus on retarded equations with delays which in general are functions of the independent variable. The delayed differential equation is turned into an ordinary differential equation using the method of steps. The ordinary differential equation is transformed into a recurrence relation in one variable using the differential transformation. Approximate solution has the form of a Taylor polynomial whose coefficients are determined by solving the recurrence relation. Practical implementation of the presented algorithm is demonstrated in an example of the initial value problem for a differential equation with nonlinear nonconstant delay. A two-dimensional neutral system of higher complexity with constant, nonconstant, and proportional delays has been chosen to show numerical performance of the algorithm. Results are compared against Matlab function DDENSD.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10101 - Pure mathematics
Result continuities
Project
<a href="/en/project/LQ1601" target="_blank" >LQ1601: CEITEC 2020</a><br>
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2020
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
COMPLEXITY
ISSN
1076-2787
e-ISSN
—
Volume of the periodical
2020
Issue of the periodical within the volume
Neuveden
Country of publishing house
GB - UNITED KINGDOM
Number of pages
12
Pages from-to
1-12
UT code for WoS article
000522423600004
EID of the result in the Scopus database
2-s2.0-85081256974