On the optimization of Gegenbauer operational matrix of integration

  • Authors:

  • Kareem T. Elgindy;Kate A. Smith-Miles

  • Affiliations:

  • School of Mathematical Sciences, Monash University, Clayton Victoria, Australia 3800 and Mathematics Department, Faculty of Science, Assiut University, Assiut, Egypt 71516;School of Mathematical Sciences, Monash University, Clayton Victoria, Australia 3800

  • Venue:
  • Advances in Computational Mathematics
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

The theory of Gegenbauer (ultraspherical) polynomial approximation has received considerable attention in recent decades. In particular, the Gegenbauer polynomials have been applied extensively in the resolution of the Gibbs phenomenon, construction of numerical quadratures, solution of ordinary and partial differential equations, integral and integro-differential equations, optimal control problems, etc. To achieve better solution approximations, some methods presented in the literature apply the Gegenbauer operational matrix of integration for approximating the integral operations, and recast many of the aforementioned problems into unconstrained/constrained optimization problems. The Gegenbauer parameter 驴 associated with the Gegenbauer polynomials is then added as an extra unknown variable to be optimized in the resulting optimization problem as an attempt to optimize its value rather than choosing a random value. This issue is addressed in this article as we prove theoretically that it is invalid. In particular, we provide a solid mathematical proof demonstrating that optimizing the Gegenbauer operational matrix of integration for the solution of various mathematical problems by recasting them into equivalent optimization problems with 驴 added as an extra optimization variable violates the discrete Gegenbauer orthonormality relation, and may in turn produce false solution approximations.