In this paper, a discretization of a three-dimensional fractional-order prey-predator model has been investigated with Holling type III functional response. All its fixed points are determined; also, their local stability is investigated. We extend the discretized system to an optimal control problem to get the optimal harvesting amount. For this, the discrete-time Pontryagin’s maximum principle is used. Finally, numerical simulation results are given to confirm the theoretical outputs as well as to solve the optimality problem.

The Boltzmann equation has been solved using (EEDF) package for a pure sulfur hexafluoride (SF6) gas and its mixtures with buffer Helium (He) gas to study the electron energy distribution function EEDF and then the corresponding transport coefficients for various ratios of SF6 and the mixtures. The calculations are graphically represented and discussed for the sake of comparison between the various mixtures. It is found that the various SF6 – He content mixtures have a considerable effect on EEDF and the transport coefficients of the mixtures

The aim of this paper is to present a method for solving third order ordinary differential equations with two point boundary condition , we propose two-point osculatory interpolation to construct polynomial solution. The original problem is concerned using two-points osculatory interpolation with the fit equal numbers of derivatives at the end points of an interval [0 , 1] . Also, many examples are presented to demonstrate the applicability, accuracy and efficiency of the method by compared with conventional method .

Orthogonal polynomials and their moments serve as pivotal elements across various fields. Discrete Krawtchouk polynomials (DKraPs) are considered a versatile family of orthogonal polynomials and are widely used in different fields such as probability theory, signal processing, digital communications, and image processing. Various recurrence algorithms have been proposed so far to address the challenge of numerical instability for large values of orders and signal sizes. The computation of DKraP coefficients was typically computed using sequential algorithms, which are computationally extensive for large order values and polynomial sizes. To this end, this paper introduces a computationally efficient solution that utilizes the parall

The majority of real-world problems involve not only finding the optimal solution, but also this solution must satisfy one or more constraints. Differential evolution (DE) algorithm with constraints handling has been proposed to solve one of the most fundamental problems in cellular network design. This proposed method has been applied to solve the radio network planning (RNP) in the forthcoming 5G Long Term Evolution (5G LTE) wireless cellular network, that satisfies both deployment cost and energy savings by reducing the number of deployed micro base stations (BSs) in an area of interest. Practically, this has been implemented using constrained strategy that must guarantee good coverage for the users as well. Three differential evolution

   This paper applies the Modified Adomian Decomposition Method (MADM) for solving Integro-Differential Inequality, this method  is one of effective to construct analytic approximate solutions for linear and nonlinear integro-differential inequalities without solving many integrals and transformed or discretization. Several examples are presented, the analytic results show that this method is a promising and powerful for solving these problems.