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

   The research tackled to solve Sudoku grid problem 9 ×9 , one of artificial intelligence problems. This problem has many of solutions in search space to generate Sudoku grid by using magic square of odd order as 3. This research concludes solution by proposed heuristic algorithm from magic square of odd order as 3 and no given numbers (from 1 to 9) in each cell of nine Sudoku grid cells in starting of problem solution, this is not similar the solution in old classic methods to generate all sub grids in Sudoku grid. The experimental results in this paper show the easily implementation to solve the problem to manage without manual method, additional to position of numbers (1, 2,..9) in center of each sub grid in Sudoku grid

   For a finite group G, the intersection graph   of G is the graph whose vertex set is the set of all proper non-trivial subgroups of G, where two distinct vertices are adjacent if their intersection is a non-trivial subgroup of G. In this article, we investigate the detour index, eccentric connectivity, and total eccentricity polynomials of the intersection graph  of subgroups of the dihedral group  for distinct primes . We also find the mean distance of the graph  .

This 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 

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 solution