In this study, a brand-new double transform known as the double INEM transform is introduced. Combined with the definition and essential features of the proposed double transform, new findings on partial derivatives, Heaviside function, are also presented. Additionally, we solve several symmetric applications to show how effective the provided transform is at resolving partial differential equation.
Copula modeling is widely used in modern statistics. The boundary bias problem is one of the problems faced when estimating by nonparametric methods, as kernel estimators are the most common in nonparametric estimation. In this paper, the copula density function was estimated using the probit transformation nonparametric method in order to get rid of the boundary bias problem that the kernel estimators suffer from. Using simulation for three nonparametric methods to estimate the copula density function and we proposed a new method that is better than the rest of the methods by five types of copulas with different sample sizes and different levels of correlation between the copula variables and the different parameters for the function. The
... Show MoreM is viewed as a right module over an arbitrary ring R with identity. The essential second modules is defined in this paper. We call M is essential second when for any a bilongs to R, either Ma = 0 or Ma <e M. Number of conclusions are gained and some connections between these modules and other related modules are studied.
In this paper, as generalization of second modules we introduce type of modules namely (essentially second modules). A comprehensive study of this class of modules is given, also many results concerned with this type and other related modules presented.
This paper proves the existence of face antimagic labeling for double duplication of barycentric subdivision of cycle and some other graphs
In this article, the nonlinear problem of Jeffery-Hamel flow has been solved analytically and numerically by using reliable iterative and numerical methods. The approximate solutions obtained by using the Daftardar-Jafari method namely (DJM), Temimi-Ansari method namely (TAM) and Banach contraction method namely (BCM). The obtained solutions are discussed numerically, in comparison with other numerical solutions obtained from the fourth order Runge-Kutta (RK4), Euler and previous analytic methods available in literature. In addition, the convergence of the proposed methods is given based on the Banach fixed point theorem. The results reveal that the presented methods are reliable, effective and applicable to solve other nonlinear problems.
... Show MoreThis paper propose the semi - analytic technique using two point osculatory interpolation to construct polynomial solution for solving some well-known classes of Lane-Emden type equations which are linear ordinary differential equations, and disusse the behavior of the solution in the neighborhood of the singular points along with its numerical approximation. Many examples are presented to demonstrate the applicability and efficiency of the methods. Finally , we discuss behavior of the solution in the neighborhood of the singularity point which appears to perform satisfactorily for singular problems.
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 will investigate some Heuristic methods to solve travelling salesman problem. The discussed methods are Minimizing Distance Method (MDM), Branch and Bound Method (BABM), Tree Type Heuristic Method (TTHM) and Greedy Method (GRM).
The weak points of MDM are manipulated in this paper. The Improved MDM (IMDM) gives better results than classical MDM, and other discussed methods, while the GRM gives best time for 5≤ n ≤500, where n is the number of visited cities.