<p>Daftardar Gejji and Hossein Jafari have proposed a new iterative method for solving many of the linear and nonlinear equations namely (DJM). This method proved already the effectiveness in solved many of the ordinary differential equations, partial differential equations and integral equations. The main aim from this paper is to propose the Daftardar-Jafari method (DJM) to solve the Duffing equations and to find the exact solution and numerical solutions. The proposed (DJM) is very effective and reliable, and the solution is obtained in the series form with easily computed components. The software used for the calculations in this study was MATHEMATICA^® 9.0.</p>

In this paper, an approximate solution of nonlinear two points boundary variational problem is presented. Boubaker polynomials have been utilized to reduce these problems into quadratic programming problem. The convergence of this polynomial has been verified; also different numerical examples were given to show the applicability and validity of this method.

The paper is concerned with the state and proof of the solvability theorem of unique state vector solution (SVS) of triple nonlinear hyperbolic boundary value problem (TNLHBVP), via utilizing the Galerkin method (GAM) with the Aubin theorem (AUTH), when the boundary control vector (BCV) is known. Solvability theorem of a boundary optimal control vector (BOCV) with equality and inequality state vector constraints (EINESVC) is proved. We studied the solvability theorem of a unique solution for the adjoint triple boundary value problem (ATHBVP) associated with TNLHBVP. The directional derivation (DRD) of the "Hamiltonian"(DRDH) is deduced. Finally, the necessary theorem (necessary conditions "NCOs") and the sufficient theorem (sufficient co

     In this paper, we introduce an approximate method for solving fractional order delay variational problems using fractional Euler polynomials operational matrices. For this purpose, the operational matrices of fractional integrals and derivatives are designed for Euler polynomials. Furthermore, the delay term in the considered functional is also decomposed in terms of the operational matrix of the fractional Euler polynomials. It is applied and substituted together with the other matrices of the fractional integral and derivative into the suggested functional. The main equations are then reduced to a system of algebraic equations. Therefore, the desired solution to the original variational problem is obtained by solving the resul

An efficient modification and a novel technique combining the homotopy concept with  Adomian decomposition method (ADM) to obtain an accurate analytical solution for Riccati matrix delay differential equation (RMDDE) is introduced  in this paper  . Both methods are very efficient and effective. The whole integral part of ADM is used instead of the integral part of homotopy technique. The major feature in current technique gives us a large convergence region of iterative approximate solutions .The results acquired by this technique give better approximations for a larger region as well as previously. Finally, the results conducted via suggesting an efficient and easy technique, and may be addressed to other non-linear problems.

       In the present paper, by making use of the new generalized operator, some results of third order differential subordination and differential superordination consequence for analytic functions are obtained. Also, some sandwich-type theorems are presented.

      This paper presents an alternative method for developing effective embedded optimized Runge-Kutta (RK) algorithms to solve oscillatory problems numerically.   The embedded scheme approach has algebraic orders of 5 and 4. By transforming second-order ordinary differential equations (ODEs) into their first-order counterpart, the suggested approach solves first-order ODEs. The amplification error, phase-lag, and first derivative of the phase-lag are all nil in the embedded pair. The alternative method’s absolute stability is demonstrated. The numerical tests are conducted to demonstrate the effectiveness of the developed approach in comparison to other RK approaches. The alternative approach outperforms the current RK methods

Orthogonal polynomials and their moments serve as pivotal elements across various fields. Discrete Krawtchouk polynomials (DKraPs) are considered a versatile family of orthogonal polynomials and are widely used in different fields such as probability theory, signal processing, digital communications, and image processing. Various recurrence algorithms have been proposed so far to address the challenge of numerical instability for large values of orders and signal sizes. The computation of DKraP coefficients was typically computed using sequential algorithms, which are computationally extensive for large order values and polynomial sizes. To this end, this paper introduces a computationally efficient solution that utilizes the parall

     This work, aims to study and examine the description f the gradient reduced order-strategic sensors of type boundary exponential (-strategic sensors) for completion gradient  order-detectability of type boundary exponential (-detectability). Thus, this concept is linked to an estimator in distributed parameter systems (DPS_S) in Neumann problem. So,we present numerous consequences regarding to diverse kinds of information, region  and conditions of boundary region to allow existence of -detectable systems. In addition,we have estimated at the junction interface that the interior solution isharmonizedwith the exterior solution for -detectable and, we give the relationship between this concept and sensors structures. F