Algorithms using the second order of B -splines [B (x)] and the third order of B -splines [B,3(x)] are derived to solve 1' , 2nd and 3rd linear Fredholm integro-differential equations (F1DEs). These new procedures have all the useful properties of B -spline function and can be used comparatively greater computational ease and efficiency.The results of these algorithms are compared with the cubic spline function.Two numerical examples are given for conciliated the results of this method.
This paper demonstrates a new technique based on a combined form of the new transform method with homotopy perturbation method to find the suitable accurate solution of autonomous Equations with initial condition. This technique is called the transform homotopy perturbation method (THPM). It can be used to solve the problems without resorting to the frequency domain.The implementation of the suggested method demonstrates the usefulness in finding exact solution for linear and nonlinear problems. The practical results show the efficiency and reliability of technique and easier implemented than HPM in finding exact solutions.Finally, all algorithms in this paper implemented in MATLAB version 7.12.
Oscillation criteria are obtained for all solutions of the first-order linear delay differential equations with positive and negative coefficients where we established some sufficient conditions so that every solution of (1.1) oscillate. This paper generalized the results in [11]. Some examples are considered to illustrate our main results.
The nonhomogeneous higher order linear complex differential equation (HOLCDE) with meromorphic (or entire) functions is considered in this paper. The results are obtained by putting some conditions on the coefficients to prove that the hyper order of any nonzero solution of this equation equals the order of one of its coefficients in case the coefficients are meromorphic functions. In this case, the conditions were put are that the lower order of one of the coefficients dominates the maximum of the convergence exponent of the zeros sequence of it, the lower order of both of the other coefficients and the nonhomogeneous part and that the solution has infinite order. Whiles in case the coefficients are entire functions, any nonzero solutio
... Show MoreWe present a reliable algorithm for solving, homogeneous or inhomogeneous, nonlinear ordinary delay differential equations with initial conditions. The form of the solution is calculated as a series with easily computable components. Four examples are considered for the numerical illustrations of this method. The results reveal that the semi analytic iterative method (SAIM) is very effective, simple and very close to the exact solution demonstrate reliability and efficiency of this method for such problems.
In this paper, a new analytical method is introduced to find the general solution of linear partial differential equations. In this method, each Laplace transform (LT) and Sumudu transform (ST) is used independently along with canonical coordinates. The strength of this method is that it is easy to implement and does not require initial conditions.
Many of the dynamic processes in different sciences are described by models of differential equations. These models explain the change in the behavior of the studied process over time by linking the behavior of the process under study with its derivatives. These models often contain constant and time-varying parameters that vary according to the nature of the process under study in this We will estimate the constant and time-varying parameters in a sequential method in several stages. In the first stage, the state variables and their derivatives are estimated in the method of penalized splines(p- splines) . In the second stage we use pseudo lest square to estimate constant parameters, For the third stage, the rem
... Show MoreIn this paper, several types of space-time fractional partial differential equations has been solved by using most of special double linear integral transform â€double Sumudu â€. Also, we are going to argue the truth of these solutions by another analytically method “invariant subspace methodâ€. All results are illustrative numerically and graphically.
The aim of this paper is to propose an efficient three steps iterative method for finding the zeros of the nonlinear equation f(x)=0 . Starting with a suitably chosen , the method generates a sequence of iterates converging to the root. The convergence analysis is proved to establish its five order of convergence. Several examples are given to illustrate the efficiency of the proposed new method and its comparison with other methods.