In this paper reliable computational methods (RCMs) based on the monomial stan-dard polynomials have been executed to solve the problem of Jeffery-Hamel flow (JHF). In addition, convenient base functions, namely Bernoulli, Euler and Laguerre polynomials, have been used to enhance the reliability of the computational methods. Using such functions turns the problem into a set of solvable nonlinear algebraic system that MathematicaⓇ12 can solve. The JHF problem has been solved with the help of Improved Reliable Computational Methods (I-RCMs), and a review of the methods has been given. Also, published facts are used to make comparisons. As further evidence of the accuracy and dependability of the proposed methods, the maximum error remainder (MERn) has been calculated. The results have been provided strong evidence that the RCMs and I-RCMs are credible and accurate methods for obtaining approximate solutions to this problem.
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.
The Korteweg-de Vries equation plays an important role in fluid physics and applied mathematics. This equation is a fundamental within study of shallow water waves. Since these equations arise in many applications and physical phenomena, it is officially showed that this equation has solitary waves as solutions, The Korteweg-de Vries equation is utilized to characterize a long waves travelling in channels. The goal of this paper is to construct the new effective frequent relation to resolve these problems where the semi analytic iterative technique presents new enforcement to solve Korteweg-de Vries equations. The distinctive feature of this method is, it can be utilized to get approximate solutions for travelling waves of
... Show MoreIn this paper, we consider a new approach to solve type of partial differential equation by using coupled Laplace transformation with decomposition method to find the exact solution for non–linear non–homogenous equation with initial conditions. The reliability for suggested approach illustrated by solving model equations such as second order linear and nonlinear Klein–Gordon equation. The application results show the efficiency and ability for suggested approach.
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.
The aerodynamic characteristics of the forward swept wing aircraft have been studied theoretically and experimentally. Low order panel method with the Dirichlet boundary condition have been used to solve the case of the steady, inviscid and compressible flow. Experimentally, a model was manufactured from wood to carry out the tests. The primary objective of the experimental work was the measurements of the wake dimensions and orientation, velocity defect along the wake and the wake thickness. A blower type low speed (open jet) wind tunnel was used in the experimental work. The mean velocity at the test section was (9.3 m/s) and the Reynolds number based on the mean aerodynamic chord and the mean velocity was (0.46x105). The measurements sho
... Show MoreA graph is a structure amounting to a set of objects in which some pairs of the objects are in some sense related. The objects correspond to mathematical abstractions called vertices (also called nodes or points) and each of the related pairs of vertices is called an edge (also called link or line). A directed graph is a graph in which edges have orientation. A simple graph is a graph that does not have more than one edge between any two vertices and no edge starts and ends at the same vertex. For a simple undirected graph G with order n, and let denotes its complement. Let δ(G), ∆(G) denotes the minimum degree and maximum degree of G respectively. The complement degree polynomial of G is the polynomial CD[G,x]= , where C
... Show More