Two sets of infinitely many exceptional orthogonal polynomials related to the Wilson and Askey-Wilson polynomials are presented. They are derived as the eigenfunctions of shape invariant and thus exactly solvable quantum mechanical Hamiltonians, which are deformations of those for the Wilson and Askey-Wilson polynomials in terms of a degree l (l = 1, 2, . . .) eigenpolynomial. These polynomials...

in this paper, we present a new computational technique for solving nonlinear fredholm integral equations of the second kind. this proposed method is based on galerkin method and is computationally very attractive. moreover, for reducing the operations in comparing similar works, we design our algorithm based on transformations of orthogonal polynomials in approximation coefficients calculating...

An elementary non-technical introduction to group representations and orthogonal polynomials is given. Orthogonality relations for the spherical functions for the rotation groups in Euclidean space (ultraspherical polynomials), and the matrix elements of SU(2) (Jacobi polynomials) are discussed. A general theory for finite groups acting on graphs, giving a finite set of discrete orthogonal poly...

In this paper, a special technique is studied by using the orthogonal Chebyshev polynomials to get approximate solutions for singular and hyper-singular integral equations of the first kind. A singular integral equation is converted to a system of algebraic equations based on using special properties of Chebyshev series. The error bounds are also stated for the regular part of approximate solut...

We compute the pointwise asymptotics of orthogonal polynomials with respect to a general class of pure point measures supported on finite sets as both the number of nodes of the measure and also the degree of the orthogonal polynomials become large. The class of orthogonal polynomials we consider includes as special cases the Krawtchouk and Hahn classical discrete orthogonal polynomials, but is...

this paper presents an operational formulation of the tau method based upon orthogonal polynomials by using a reduced set of matrix operations for the numerical solution of nonlinear multi-order fractional differential equations(fdes). the main characteristic behind the approach using this technique is that it reduces such problems to those of solving a system of non-linear algebraic equations....

In this paper we propose a method for conducting stochastic collocation on arbitrary sets of nodes. To accomplish this, we present the framework of least orthogonal interpolation, which allows one to construct interpolation polynomials based on arbitrarily located grids in arbitrary dimensions. These interpolation polynomials are constructed as a subspace of the family of orthogonal polynomials...