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.

This paper presents a linear fractional programming problem (LFPP) with rough interval coefficients (RICs) in the objective function. It shows that the LFPP with RICs in the objective function can be converted into a linear programming problem (LPP) with RICs by using the variable transformations. To solve this problem, we will make two LPP with interval coefficients (ICs). Next, those four LPPs can be constructed under these assumptions; the LPPs can be solved by the classical simplex method and used with MS Excel Solver. There is also argumentation about solving this type of linear fractional optimization programming problem. The derived theory can be applied to several numerical examples with its details, but we show only two examples

In this paper, the process for finding an approximate solution of nonlinear three-dimensional (3D) Volterra type integral operator equation (N3D-VIOE) in R³ is introduced. The modelling of the majorant function (MF) with the modified Newton method (MNM) is employed to convert N3D-VIOE to the linear 3D Volterra type integral operator equation (L3D-VIOE). The method of trapezoidal rule (TR) and collocation points are utilized to determine the approximate solution of L3D-VIOE by dealing with the linear form of the algebraic system. The existence of the approximate solution and its uniqueness are proved, and illustrative examples are provided to show the accuracy and efficiency of the model.

Mathematical Subject Classificat

The peculiarity of the theater does not lie in its dramatic content because many literary genres and other artistic styles share with it in this content. The peculiarity of the theater lies in contemplating the drama through what is architectural, and this architectural axis is what distinguishes its character. It is a spatial poetry which is composed by the laws of physics and chemistry, (Weight, height, distance, rhythm, gravity, impulses and chemical excretions). i.e., what cannot be expressed in words. This is a game of space to exchange and organize energy and communicate in space by the living body, which contains the possibilities of the living drawing in space: in the time and place. This research deals with the importance of the

The study of cohomology groups is one of the most intensive and exciting researches that arises from algebraic topology. Particularly, the dimension of cohomology groups is a highly useful invariant which plays a rigorous role in the geometric classification of associative algebras. This work focuses on the applications of low dimensional cohomology groups. In this regards, the cohomology groups of degree zero and degree one of nilpotent associative algebras in dimension four are described in matrix form.

The problem of Bi-level programming is to reduce or maximize the function of the target by having another target function within the constraints. This problem has received a great deal of attention in the programming community due to the proliferation of applications and the use of evolutionary algorithms in addressing this kind of problem. Two non-linear bi-level programming methods are used in this paper. The goal is to achieve the optimal solution through the simulation method using the Monte Carlo method using different small and large sample sizes. The research reached the Branch Bound algorithm was preferred in solving the problem of non-linear two-level programming this is because the results were better.