Searcharxiv⌕ Search

arXiv subjects

Kareem T. Elgindy

Publications and source records attributed to Kareem T. Elgindy.

20 records · Page 2Linked to original sources

Optimal Control of a Parabolic Distributed Parameter System Using a Barycentric Shifted Gegenbauer Pseudospectral Method

In this paper, we introduce a novel pseudospectral method for the numerical solution of optimal control problems governed by a parabolic distributed parameter system. The infinite-dimensional optimal control problem is reduced into a finite-dimensional nonlinear programming problem through shifted Gegenbauer quadratures constructed using a stable barycentric representation of Lagrange interpolating polynomials and explicit barycentric weights for the shifted Gegenbauer-Gauss (SGG) points. A rigorous error analysis of the method is presented, and a numerical test example is given to show the accuracy and efficiency of the proposed pseudospectral method.

math.OC↗

High-Order Numerical Solution of Second-Order One-Dimensional Hyperbolic Telegraph Equation Using a Shifted Gegenbauer Pseudospectral Method

We present a high-order shifted Gegenbauer pseudospectral method (SGPM) to solve numerically the second-order one-dimensional hyperbolic telegraph equation provided with some initial and Dirichlet boundary conditions. The framework of the numerical scheme involves the recast of the problem into its integral formulation followed by its discretization into a system of well-conditioned linear algebraic equations. The integral operators are numerically approximated using some novel shifted Gegenbauer operational matrices of integration. We derive the error formula of the associated numerical quadratures. We also present a method to optimize the constructed operational matrix of integration by minimizing the associated quadrature error in some optimality sense. We study the error bounds and convergence of the optimal shifted Gegenbauer operational matrix of integration. Moreover, we construct the relation between the operational matrices of integration of the shifted Gegenbauer polynomials and standard Gegenbauer polynomials. We derive the global collocation matrix of the SGPM, and construct an efficient computational algorithm for the solution of the collocation equations. We present a study on the computational cost of the developed computational algorithm, and a rigorous convergence and error analysis of the introduced method. Four numerical test examples have been carried out in order to verify the effectiveness, the accuracy, and the exponential convergence of the method. The SGPM is a robust technique, which can be extended to solve a wide range of problems arising in numerous applications.

math.NA↗