Investigation regarding queue length dynamics have been explored using various kinds of models including ordinary differential equations (ODEs). ODEs possess the advantageous property of having a continuous-time representation of queue length dynamics, thus its adoption in this article in modelling various scenarios as system of first-order ODEs. Specifically, a multi-server queue is considered and a numerical approach for solving first-order ODEs using MATLAB is adopted to obtain approximate solutions of the resultant models. The results display the dynamics of the queue length in each scenario, thus showing the usefulness of ODEs in analysing the behaviour of queues using system of ODEs.

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.

Nonlinear differential equation stability is a very important feature of applied mathematics, as it has a wide variety of applications in both practical and physical life problems. The major object of the manuscript is to discuss and apply several techniques using modify the Krasovskii's method and the modify variable gradient method which are used to check the stability for some kinds of linear or nonlinear differential equations. Lyapunov function is constructed using the variable gradient method and Krasovskii’s method to estimate the stability of nonlinear systems. If the function of Lyapunov is positive, it implies that the nonlinear system is asymptotically stable. For the nonlinear systems, stability is still difficult even though

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.

In this paper, we study the growth of solutions of the second order linear complex differential equations  insuring that any nontrivial solutions are of infinite order. It is assumed that the coefficients satisfy the extremal condition for Yang’s inequality and the extremal condition for Denjoy’s conjecture. The other condition is that one of the coefficients itself is a solution of the differential equation .

This paper constructs a new linear operator associated with a seven parameters Mittag-Leffler function using the convolution technique. In addition, it investigates some significant second-order differential subordination properties with considerable sandwich results concerning that operator.

        In this paper, double Sumudu and double Elzaki transforms methods are used to compute the numerical solutions for some types of fractional order partial differential equations with constant coefficients and explaining the efficiently of the method by illustrating some numerical examples that are computed by using  Mathcad 15.and graphic in Matlab R2015a.

This paper aims to propose a hybrid approach of two powerful methods, namely the differential transform and finite difference methods, to obtain the solution of the coupled Whitham-Broer-Kaup-Like equations which arises in shallow-water wave theory. The capability of the method to such problems is verified by taking different parameters and initial conditions. The numerical simulations are depicted in 2D and 3D graphs. It is shown that the used approach returns accurate solutions for this type of problems in comparison with the analytic ones.

For many problems in Physics and Computational Fluid Dynamics (CFD), providing an accurate approximation of derivatives is a challenging task. This paper presents a class of high order numerical schemes for approximating the first derivative. These approximations are derived based on solving a special system of equations with some unknown coefficients. The construction method provides numerous types of schemes with different orders of accuracy. The accuracy of each scheme is analyzed by using Fourier analysis, which illustrates the dispersion and dissipation of the scheme. The polynomial technique is used to verify the order of accuracy of the proposed schemes by obtaining the error terms. Dispersion and dissipation errors are calculated