The aim of this paper is to present a semi - analytic technique for solving singular initial value problems of ordinary differential equations with a singularity of different kinds to construct polynomial solution using two point osculatory interpolation. The efficiency and accuracy of suggested method is assessed by comparisons with exact and other approximate solutions for a wide classes of non–homogeneous, non–linear singular initial value problems. A new, efficient estimate of the global error is used for adaptive mesh selection. Also, analyze some of the numerical aspects relevant for the implementation, describe measures to increase the efficiency of the code and compare its performance with the performance of established standard codes for singular initial value problems. Many examples are presented to demonstrate the applicability and efficiency of the suggested method on one hand and to confirm the convergence order on the other hand.
In this article, a new efficient approach is presented to solve a type of partial differential equations, such (2+1)-dimensional differential equations non-linear, and nonhomogeneous. The procedure of the new approach is suggested to solve important types of differential equations and get accurate analytic solutions i.e., exact solutions. The effectiveness of the suggested approach based on its properties compared with other approaches has been used to solve this type of differential equations such as the Adomain decomposition method, homotopy perturbation method, homotopy analysis method, and variation iteration method. The advantage of the present method has been illustrated by some examples.
In this study, an efficient novel technique is presented to obtain a more accurate analytical solution to nonlinear pantograph differential equations. This technique combines the Adomian decomposition method (ADM) with the homotopy analysis method concepts (HAM). The whole integral part of HAM is used instead of an integral part of ADM approach to get higher accurate results. The main advantage of this technique is that it gives a large and more extended convergent region of iterative approximate solutions for long time intervals that rapidly converge to the exact solution. Another advantage is capable of providing a continuous representation of the approximate solutions, which gives better information over whole time interv
... Show MoreThe swarm intelligence and evolutionary methods are commonly utilized by researchers in solving the difficult combinatorial and Non-Deterministic Polynomial (NP) problems. The N-Queen problem can be defined as a combinatorial problem that became intractable for the large ‘n’ values and, thereby, it is placed in the NP class of problems. In the present study, a solution is suggested for the N-Queen problem, on the basis of the Meerkat Clan Algorithm (MCA). The problem of n-Queen can be mainly defined as one of the generalized 8-Queen problem forms, for which the aim is placing 8 queens in a way that none of the queens has the ability of killing the others with the use of the standard moves of the chess queen. The Meerkat Clan environm
... Show MoreIn this paper, we studied the scheduling of jobs on a single machine. Each of n jobs is to be processed without interruption and becomes available for processing at time zero. The objective is to find a processing order of the jobs, minimizing the sum of maximum earliness and maximum tardiness. This problem is to minimize the earliness and tardiness values, so this model is equivalent to the just-in-time production system. Our lower bound depended on the decomposition of the problem into two subprograms. We presented a novel heuristic approach to find a near-optimal solution for the problem. This approach depends on finding efficient solutions for two problems. The first problem is minimizing total completi
... Show MoreThis paper studies a novel technique based on the use of two effective methods like modified Laplace- variational method (MLVIM) and a new Variational method (MVIM)to solve PDEs with variable coefficients. The current modification for the (MLVIM) is based on coupling of the Variational method (VIM) and Laplace- method (LT). In our proposal there is no need to calculate Lagrange multiplier. We applied Laplace method to the problem .Furthermore, the nonlinear terms for this problem is solved using homotopy method (HPM). Some examples are taken to compare results between two methods and to verify the reliability of our present methods.
The main object of this study is to solve a system of nonlinear ordinary differential equations (ODE) of the first order governing the epidemic model using numerical methods. The application under study is a mathematical epidemic model which is the influenza model at Australia in 1919. Runge-kutta methods of order 4 and of order 45 for solving this initial value problem(IVP) problem have been used. Finally, the results obtained have been discussed tabularly and graphically.
In this paper, we apply a new technique combined by a Sumudu transform and iterative method called the Sumudu iterative method for resolving non-linear partial differential equations to compute analytic solutions. The aim of this paper is to construct the efficacious frequent relation to resolve these problems. The suggested technique is tested on four problems. So the results of this study are debated to show how useful this method is in terms of being a powerful, accurate and fast tool with a little effort compared to other iterative methods.
In this paper, cubic trigonometric spline is used to solve nonlinear Volterra integral equations of second kind. Examples are illustrated to show the presented method’s efficiency and convenience.
Many numerical approaches have been suggested to solve nonlinear problems. In this paper, we suggest a new two-step iterative method for solving nonlinear equations. This iterative method has cubic convergence. Several numerical examples to illustrate the efficiency of this method by Comparison with other similar methods is given.