In this paper a modified approach have been used to find the approximate solution of ordinary delay differential equations with constant delay using the collocation method based on Bernstien polynomials.

In this work, an analytical approximation solution is presented, as well as a comparison of the Variational Iteration Adomian Decomposition Method (VIADM) and the Modified Sumudu Transform Adomian Decomposition Method (M STADM), both of which are capable of solving nonlinear partial differential equations (NPDEs) such as nonhomogeneous Kertewege-de Vries (kdv) problems and the nonlinear Klein-Gordon. The results demonstrate the solution’s dependability and excellent accuracy.

In this paper, we present an approximate analytical and numerical solutions for the differential equations with multiple delay using the extend differential transform method (DTM). This method is used to solve many linear and non linear problems.

Recently, the financial mathematics has been emerged to interpret and predict the underlying mechanism that generates an incident of concern. A system of differential equations can reveal a dynamical development of financial mechanism across time. Multivariate wiener process represents the stochastic term in a system of stochastic differential equations (SDE). The standard wiener process follows a Markov chain, and hence it is a martingale (kind of Markov chain), which is a good integrator. Though, the fractional Wiener process does not follow a Markov chain, hence it is not a good integrator. This problem will produce an Arbitrage (non-equilibrium in the market) in the predicted series. It is undesired property that leads to erroneous conc

in this paper the second order neutral differential equations are incestigated are were we give some new suffucient conditions for all nonoscillatory

   In this work, a novel technique to obtain an accurate solutions to nonlinear form by multi-step combination with Laplace-variational approach (MSLVIM) is introduced. Compared with the  traditional approach for variational it overcome all difficulties and enable to provide us more an accurate solutions with extended of the convergence region as well as covering to larger intervals which providing us a continuous representation of approximate analytic solution and it give more better information of the solution over the whole time interval. This technique is more easier for obtaining the general Lagrange multiplier with reduces the time and calculations. It converges rapidly to exact formula with simply computable terms wit

This study focuses on studying an oscillation of a second-order delay differential equation. Start work, the equation is introduced here with adequate provisions. All the previous is braced by theorems and examplesthat interpret the applicability and the firmness of the acquired provisions

This paper is concerned with the oscillation of all solutions of the n-th order delay differential equation . The necessary and sufficient conditions for oscillatory solutions are obtained and other conditions for nonoscillatory solution to converge to zero are established.

In this paper the Galerkin method is used to prove the existence and uniqueness theorem for the solution of the state vector of the triple linear elliptic partial differential equations for fixed continuous classical optimal control vector. Also, the existence theorem of a continuous classical optimal control vector related with the triple linear equations of elliptic types is proved. The existence of a unique solution for the triple adjoint equations related with the considered triple of the state equations is studied. The Fréchet derivative of the cost function is derived. Finally the theorem of necessary conditions for optimality of the considered problem is proved.

The method of operational matrices based on different types of polynomials such as Bernstein, shifted Legendre and Bernoulli polynomials will be presented and implemented to solve the nonlinear Blasius equations approximately. The nonlinear differential equation will be converted into a system of nonlinear algebraic equations that can be solved using Mathematica^®12. The efficiency of these methods has been studied by calculating the maximum error remainder ( ), and it was found that their efficiency increases as the polynomial degree (n) increases, since the errors decrease. Moreover, the approximate solutions obtained by the proposed methods are compared with the solution of the 4^th order Runge-Kutta meth