In this paper Volterra Runge-Kutta methods which include: method of order two and four will be applied to general nonlinear Volterra integral equations of the second kind. Moreover we study the convergent of the algorithms of Volterra Runge-Kutta methods. Finally, programs for each method are written in MATLAB language and a comparison between the two types has been made depending on the least square errors.
In this paper, the effective computational method (ECM) based on the standard monomial polynomial has been implemented to solve the nonlinear Jeffery-Hamel flow problem. Moreover, novel effective computational methods have been developed and suggested in this study by suitable base functions, namely Chebyshev, Bernstein, Legendre, and Hermite polynomials. The utilization of the base functions converts the nonlinear problem to a nonlinear algebraic system of equations, which is then resolved using the Mathematica®12 program. The development of effective computational methods (D-ECM) has been applied to solve the nonlinear Jeffery-Hamel flow problem, then a comparison between the methods has been shown. Furthermore, the maximum
... 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.
An approximate solution of the liner system of ntegral cquations fot both fredholm(SFIEs)and Volterra(SIES)types has been derived using taylor series expansion.The solusion is essentailly
This paper sheds the light on the vital role that fractional ordinary differential equations(FrODEs) play in the mathematical modeling and in real life, particularly in the physical conditions. Furthermore, if the problem is handled directly by using numerical method, it is a far more powerful and efficient numerical method in terms of computational time, number of function evaluations, and precision. In this paper, we concentrate on the derivation of the direct numerical methods for solving fifth-order FrODEs in one, two, and three stages. Additionally, it is important to note that the RKM-numerical methods with two- and three-stages for solving fifth-order ODEs are convenient, for solving class's fifth-order FrODEs. Numerical exa
... Show MoreIn this research, we study the classical continuous Mixed optimal control vector problem dominated by couple nonlinear elliptic PDEs. The existence theorem for the unique state vector solution of the considered couple nonlinear elliptic PDEs for a given continuous classical mixed control vector is stated and proved by applying the Minty-Browder theorem under suitable conditions. Under suitable conditions, the existence theorem of a classical continuous mixed optimal control vector associated with the considered couple nonlinear elliptic PDEs is stated and proved.
In this paper, the author established some new integral conditions for the oscillation of all solutions of nonlinear first order neutral delay differential equations. Examples are inserted to illustrate the results.
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, one of the Machine Scheduling Problems is studied, which is the problem of scheduling a number of products (n-jobs) on one (single) machine with the multi-criteria objective function. These functions are (completion time, the tardiness, the earliness, and the late work) which formulated as . The branch and bound (BAB) method are used as the main method for solving the problem, where four upper bounds and one lower bound are proposed and a number of dominance rules are considered to reduce the number of branches in the search tree. The genetic algorithm (GA) and the particle swarm optimization (PSO) are used to obtain two of the upper bounds. The computational results are calculated by coding (progr
... Show More