arXiv subjects

Hareth M. Refat

Publications and source records attributed to Hareth M. Refat.

3 recordsLinked to original sources

arXiv2023

Direct Integral Pseudospectral and Integral Spectral Methods for Solving a Class of Infinite Horizon Optimal Output Feedback Control Problems Using Rational and Exponential Gegenbauer Polynomials

This study is concerned with the numerical solution of a class of infinite-horizon linear regulation problems with state equality constraints and output feedback control. We propose two numerical methods to convert the optimal control problem into nonlinear programming problems (NLPs) using collocations in a semi-infinite domain based on rational Gegenbauer (RG) and exponential Gegenbauer (EG) basis functions. We introduce new properties of these basis functions and derive their quadratures and associated truncation errors. A rigorous stability analysis of the RG and EG interpolations is also presented. The effects of various parameters on the accuracy and efficiency of the proposed methods are investigated. The performance of the developed integral spectral method is demonstrated using two benchmark test problems related to a simple model of a divert control system and the lateral dynamics of an F-16 aircraft. Comparisons of the results of the current study with available numerical solutions show that the developed numerical scheme is efficient and exhibits faster convergence rates and higher accuracy.

math.OC↗

arXiv2022

A Direct Integral Pseudospectral Method for Solving a Class of Infinite-Horizon Optimal Control Problems Using Gegenbauer Polynomials and Certain Parametric Maps

We present a novel direct integral pseudospectral (PS) method (a direct IPS method) for solving a class of continuous-time infinite-horizon optimal control problems (IHOCs). The method transforms the IHOCs into finite-horizon optimal control problems (FHOCs) in their integral forms by means of certain parametric mappings, which are then approximated by finite-dimensional nonlinear programming problems (NLPs) through rational collocations based on Gegenbauer polynomials and Gegenbauer-Gauss-Radau (GGR) points. The paper also analyzes the interplay between the parametric maps, barycentric rational collocations based on Gegenbauer polynomials and GGR points, and the convergence properties of the collocated solutions for IHOCs. Some novel formulas for the construction of the rational interpolation weights and the GGR-based integration and differentiation matrices in barycentric-trigonometric forms are derived. A rigorous study on the error and convergence of the proposed method is presented. A stability analysis based on the Lebesgue constant for GGR-based rational interpolation is investigated. Two easy-to-implement pseudocodes of computational algorithms for computing the barycentric-trigonometric rational weights are described. Two illustrative test examples are presented to support the theoretical results. We show that the proposed collocation method leveraged with a fast and accurate NLP solver converges exponentially to near-optimal approximations for a coarse collocation mesh grid size. The paper also shows that typical direct spectral/PS- and IPS-methods based on classical Jacobi polynomials and certain parametric maps usually diverge as the number of collocation points grow large, if the computations are carried out using floating-point arithmetic and the discretizations use a single mesh grid whether they are of Gauss/Gauss-Radau (GR) type or equally-spaced.

math.NA↗

arXiv2017

High-Order Shifted Gegenbauer Integral Pseudospectral Method for Solving Differential Equations of Lane-Emden Type

We present a novel, high-order, efficient, and exponentially convergent shifted Gegenbauer integral pseudospectral method (SGIPSM) to solve numerically Lane-Emden equations provided with some mixed Neumann and Robin boundary conditions. The framework of the proposed method includes: (i) recasting the problem into its integral formulation, (ii) collocating the latter at the shifted flipped-Gegenbauer-Gauss-Radau (SFGGR) points, and (iii) replacing the integrals with accurate and well-conditioned numerical quadratures constructed via SFGGR-based shifted Gegenbauer integration matrices. The integral formulation is eventually discretized into linear/nonlinear system of equations that can be solved easily using standard direct system solvers. The implementation of the proposed method is further illustrated through four efficient computational algorithms. Moreover, we furnish rigorous error and convergence analyses of the SGIPSM. Five numerical test examples are presented to verify the effectiveness, accuracy, exponential convergence, and numerical stability of the proposed method. The numerical simulations are associated with extensive numerical comparisons with other rival methods in the literature to demonstrate further the power of the proposed method. The SGIPSM is broadly applicable and represents a strong addition to common numerical methods for solving linear/nonlinear differential equations when high-order approximations are required using a relatively small number of collocation points.

math.NA↗