|
|
|
|
LEADER |
02032nam a2200373Ia 4500 |
001 |
10.1155-2022-1049561 |
008 |
220718s2022 CNT 000 0 und d |
020 |
|
|
|a 10762787 (ISSN)
|
245 |
1 |
0 |
|a Semianalytical Approach for the Approximate Solution of Delay Differential Equations
|
260 |
|
0 |
|b Hindawi Limited
|c 2022
|
856 |
|
|
|z View Fulltext in Publisher
|u https://doi.org/10.1155/2022/1049561
|
520 |
3 |
|
|a In this analysis, we develop a new approach to investigate the semianalytical solution of the delay differential equations. Mohand transform coupled with the homotopy perturbation method is called Mohand homotopy perturbation transform method (MHPTM) and performs the solution results in the form of series. The beauty of this approach is that it does not need to compute the values of the Lagrange multiplier as in the variational iteration method, and also, there is no need to implement the convolution theorem as in the Laplace transform. The main purpose of this scheme is to reduce the less computational work and the error analysis of the problems than others studied in the literature. Some illustrated examples are interpreted to confirm the accuracy of the newly developed scheme. © 2022 Xiankang Luo et al.
|
650 |
0 |
4 |
|a Approximate solution
|
650 |
0 |
4 |
|a Computation theory
|
650 |
0 |
4 |
|a Convolution
|
650 |
0 |
4 |
|a Convolution theorems
|
650 |
0 |
4 |
|a Delay differential equations
|
650 |
0 |
4 |
|a Differential equations
|
650 |
0 |
4 |
|a Homotopies
|
650 |
0 |
4 |
|a Homotopy perturbation transform methods
|
650 |
0 |
4 |
|a Iterative methods
|
650 |
0 |
4 |
|a Lagrange multipliers
|
650 |
0 |
4 |
|a Laplace transforms
|
650 |
0 |
4 |
|a New approaches
|
650 |
0 |
4 |
|a Perturbation method
|
650 |
0 |
4 |
|a Perturbation techniques
|
650 |
0 |
4 |
|a Semi-analytical approaches
|
650 |
0 |
4 |
|a Semi-analytical solution
|
650 |
0 |
4 |
|a Variational iteration method
|
700 |
1 |
|
|a Habib, M.
|e author
|
700 |
1 |
|
|a Karim, S.
|e author
|
700 |
1 |
|
|a Luo, X.
|e author
|
700 |
1 |
|
|a Wahash, H.A.
|e author
|
773 |
|
|
|t Complexity
|x 10762787 (ISSN)
|g 2022
|