79 research outputs found

    High-Order, Stable, And Efficient Pseudospectral Method Using Barycentric Gegenbauer Quadratures

    Full text link
    The work reported in this article presents a high-order, stable, and efficient Gegenbauer pseudospectral method to solve numerically a wide variety of mathematical models. The proposed numerical scheme exploits the stability and the well-conditioning of the numerical integration operators to produce well-conditioned systems of algebraic equations, which can be solved easily using standard algebraic system solvers. The core of the work lies in the derivation of novel and stable Gegenbauer quadratures based on the stable barycentric representation of Lagrange interpolating polynomials and the explicit barycentric weights for the Gegenbauer-Gauss (GG) points. A rigorous error and convergence analysis of the proposed quadratures is presented along with a detailed set of pseudocodes for the established computational algorithms. The proposed numerical scheme leads to a reduction in the computational cost and time complexity required for computing the numerical quadrature while sharing the same exponential order of accuracy achieved by Elgindy and Smith-Miles (2013). The bulk of the work includes three numerical test examples to assess the efficiency and accuracy of the numerical scheme. The present method provides a strong addition to the arsenal of numerical pseudospectral methods, and can be extended to solve a wide range of problems arising in numerous applications.Comment: 30 pages, 10 figures, 1 tabl

    A new approach for solving nonlinear Thomas-Fermi equation based on fractional order of rational Bessel functions

    Full text link
    In this paper, the fractional order of rational Bessel functions collocation method (FRBC) to solve Thomas-Fermi equation which is defined in the semi-infinite domain and has singularity at x=0x = 0 and its boundary condition occurs at infinity, have been introduced. We solve the problem on semi-infinite domain without any domain truncation or transformation of the domain of the problem to a finite domain. This approach at first, obtains a sequence of linear differential equations by using the quasilinearization method (QLM), then at each iteration solves it by FRBC method. To illustrate the reliability of this work, we compare the numerical results of the present method with some well-known results in other to show that the new method is accurate, efficient and applicable

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

    Full text link
    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.Comment: 36 pages, articl

    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

    Full text link
    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.Comment: 27 pages, 24 figure

    Numerical Solution of Fractional Partial Differential Equations with Normalized Bernstein Wavelet Method

    Get PDF
    In this paper, normalized Bernstein wavelets are presented. Next, the fractional order integration and Bernstein wavelets operational matrices of integration are derived and finally are used for solving fractional partial differential equations. The operational matrices merged with the collocation method are used in order to convert fractional problems to a number of algebraic equations. In the suggested method the boundary conditions are automatically taken into consideration. An assessment of the error of function approximation based on the normalized Bernstein wavelet is also presented. Some numerical instances are given to manifest the versatility and applicability of the suggested method. Founded numerical results are correlated with the best reported results in the literature and the analytical solutions in order to prove the accuracy and applicability of the suggested method

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

    Full text link
    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.Comment: 33 pages, 19 figure
    • …
    corecore