This paper is concerned with the numerical solutions of the vorticity transport equation (VTE) in two-dimensional space with homogenous Dirichlet boundary conditions. Namely, for this problem, the Crank-Nicolson finite difference equation is derived.  In addition, the consistency and stability of the Crank-Nicolson method are studied. Moreover, a numerical experiment is considered to study the convergence of the Crank-Nicolson scheme and to visualize the discrete graphs for the vorticity and stream functions. The analytical result shows that the proposed scheme is consistent, whereas the numerical results show that the solutions are stable with small space-steps and at any time levels.

In this research, Haar wavelets method has been utilized to approximate a numerical solution for Linear state space systems. The solution technique is used Haar wavelet functions and Haar wavelet operational matrix with the operation to transform the state space system into a system of linear algebraic equations which can be resolved by MATLAB over an interval from 0 to . The exactness of the state variables can be enhanced by increasing the Haar wavelet resolution. The method has been applied for different examples and the simulation results have been illustrated in graphics and compared with the exact solution.

We present a reliable algorithm for solving, homogeneous or inhomogeneous, nonlinear ordinary delay differential equations with initial conditions. The form of the solution is calculated as a series with easily computable components. Four examples are considered for the numerical illustrations of this method. The results reveal that the semi analytic iterative method (SAIM) is very effective, simple and very close to the exact solution demonstrate reliability and efficiency of this method for such problems.

This article deals with the approximate algorithm for two dimensional multi-space fractional bioheat equations (M-SFBHE). The application of the collection method will be expanding for presenting a numerical technique for solving M-SFBHE based on “shifted Jacobi-Gauss-Labatto polynomials” (SJ-GL-Ps) in the matrix form. The Caputo formula has been utilized to approximate the fractional derivative and to demonstrate its usefulness and accuracy, the proposed methodology was applied in two examples. The numerical results revealed that the used approach is very effective and gives high accuracy and good convergence.

The chemical properties of chemical compounds and their molecular structures are intimately connected. Topological indices are numerical values associated with chemical molecular graphs that help in understanding the physicochemical properties, chemical reactivity and biological activity of a chemical compound. This study obtains some topological properties of second and third dominating David derived (DDD) networks and computes several K Banhatti polynomial of second and third type of DDD.

In this paper, a new technique is offered for solving three types of linear integral equations of the 2nd kind including Volterra-Fredholm integral equations (LVFIE) (as a general case), Volterra integral equations (LVIE) and Fredholm integral equations (LFIE) (as special cases). The new technique depends on approximating the solution to a polynomial of degree  and therefore reducing the problem to a linear programming problem(LPP), which will be solved to find the approximate solution of LVFIE. Moreover, quadrature methods including trapezoidal rule (TR), Simpson 1/3 rule (SR), Boole rule (BR), and Romberg integration formula (RI) are used to approximate the integrals that exist in LVFIE. Also, a comparison between those methods i

In this paper, author’s study sub diffusion bio heat transfer model and developed explicit finite difference scheme for time fractional sub diffusion bio heat transfer equation by using caputo fabrizio fractional derivative. Also discussed conditional stability and convergence of developed scheme. Furthermore numerical solution of time fractional sub diffusion bio heat transfer equation is obtained and it is represented graphically by Python.

   The main focus of this research is to examine the Travelling Salesman Problem (TSP) and the methods used to solve this problem where this problem is considered as one of the combinatorial optimization problems which met wide publicity and attention from the researches for to it's simple formulation and important applications and engagement to the rest of combinatorial problems , which is based on finding the optimal path through known number of cities where the salesman visits each city only once before returning to the city of departure n this research , the benefits  of( FMOLP)   algorithm is employed as one of the best methods to solve the (TSP) problem and the application of the algorithm in conjun