This work describes two efficient and useful methods for solving fractional pantograph delay equations (FPDEs) with initial and boundary conditions. These two methods depend mainly on orthogonal polynomials, which are the method of the operational matrix of fractional derivative that depends on Bernstein polynomials and the operational matrix of the fractional derivative with Shifted Legendre polynomials. The basic procedure of this method is to convert the pantograph delay equation to a system of linear equations and by using, the operational matrices we get rid of the integration and differentiation operations, which makes solving the problem easier. The concept of Caputo has been used to describe fractional derivatives. Finally, some numerical examples are identified to show the utility and capability of the two proposed approaches. Mathematica®12 program has been relied upon in the calculations.
In this paper, a new third kind Chebyshev wavelets operational matrix of derivative is presented, then the operational matrix of derivative is applied for solving optimal control problems using, third kind Chebyshev wavelets expansions. The proposed method consists of reducing the linear system of optimal control problem into a system of algebraic equations, by expanding the state variables, as a series in terms of third kind Chebyshev wavelets with unknown coefficients. Example to illustrate the effectiveness of the method has been presented.
In this paper, Touchard polynomials (TPs) are presented for solving Linear Volterra integral equations of the second kind (LVIEs-2k) and the first kind (LVIEs-1k) besides, the singular kernel type of this equation. Illustrative examples show the efficiency of the presented method, and the approximate numerical (AN) solutions are compared with one another method in some examples. All calculations and graphs are performed by program MATLAB2018b.
It is recognized that organisms live and interact in groups, exposing them to various elements like disease, fear, hunting cooperation, and others. As a result, in this paper, we adopted the construction of a mathematical model that describes the interaction of the prey with the predator when there is an infectious disease, as well as the predator community's characteristic of cooperation in hunting, which generates great fear in the prey community. Furthermore, the presence of an incubation period for the disease provides a delay in disease transmission from diseased predators to healthy predators. This research aims to examine the proposed mathematical model's solution behavior to better understand these elements' impact on an eco-epidemi
... Show MoreIn this paper the Galerkin method is used to prove the existence and uniqueness theorem for the solution of the state vector of the triple linear elliptic partial differential equations for fixed continuous classical optimal control vector. Also, the existence theorem of a continuous classical optimal control vector related with the triple linear equations of elliptic types is proved. The existence of a unique solution for the triple adjoint equations related with the considered triple of the state equations is studied. The Fréchet derivative of the cost function is derived. Finally the theorem of necessary conditions for optimality of the considered problem is proved.
The usual methods of distance determination in Astronomy parallax and Spectroscopic with Expansion Methods are seldom applicable to Nebulae. In this work determination of the distances to individual Nebulae are calculated and discussed. The distances of Nebulae to the Earth are calculated. The accuracy of the distance is tested by using Aladin sky Atlas, and comparing Nebulae properties were derived from these distance made with statistical distance determination. The results showed that angular Expansions may occur in a part of the nebulae that is moving at a velocity different than the observed velocity. Also the results of the comparison of our spectroscopic distances with the trig
To ensure fault tolerance and distributed management, distributed protocols are employed as one of the major architectural concepts underlying the Internet. However, inefficiency, instability and fragility could be potentially overcome with the help of the novel networking architecture called software-defined networking (SDN). The main property of this architecture is the separation of the control and data planes. To reduce congestion and thus improve latency and throughput, there must be homogeneous distribution of the traffic load over the different network paths. This paper presents a smart flow steering agent (SFSA) for data flow routing based on current network conditions. To enhance throughput and minimize latency, the SFSA distrib
... Show MoreIn this work, we use the explicit and the implicit finite-difference methods to solve the nonlocal problem that consists of the diffusion equations together with nonlocal conditions. The nonlocal conditions for these partial differential equations are approximated by using the composite trapezoidal rule, the composite Simpson's 1/3 and 3/8 rules. Also, some numerical examples are presented to show the efficiency of these methods.
The research aims to find a contemporary model in analyzing the reasons behind the delay of the investment plan projects suffered by the North Oil Company. This model is able to understand the environment surrounding the implementation of projects in the light of the changes facing the company at the present time, which in turn requires the need to identify the most important strengths and weaknesses Internal and external opportunities and threats using the SWOT matrix and identify the appropriate strategic alternative based on clear policy, strategies and programs to address weaknesses and look to the future prospects as the company can be stronger and more flexible environmental changes surrounding the reality of implementation
... Show MoreTraditionally, path selection within routing is formulated as a shortest path optimization problem. The objective function for optimization could be any one variety of parameters such as number of hops, delay, cost...etc. The problem of least cost delay constraint routing is studied in this paper since delay constraint is very common requirement of many multimedia applications and cost minimization captures the need to
distribute the network. So an iterative algorithm is proposed in this paper to solve this problem. It is appeared from the results of applying this algorithm that it gave the optimal path (optimal solution) from among multiple feasible paths (feasible solutions).
In this paper, we consider inequalities in which the function is an element of n-th partially order space. Local and Global uniqueness theorem of solutions of the n-the order Partial differential equation Obtained which are applications of Gronwall's inequalities.