Discrete orthogonal polynomials explained

In mathematics, a sequence of discrete orthogonal polynomials is a sequence of polynomials that are pairwise orthogonal with respect to a discrete measure.Examples include the discrete Chebyshev polynomials, Charlier polynomials, Krawtchouk polynomials, Meixner polynomials, dual Hahn polynomials, Hahn polynomials, and Racah polynomials.

If the measure has finite support, then the corresponding sequence of discrete orthogonal polynomials has only a finite number of elements. The Racah polynomials give an example of this.

Definition

\mu

on some set

S=\{s0,s1,...\}

with weight function

\omega(x)

.

A family of orthogonal polynomials

\{pn(x)\}

is called discrete if they are orthogonal with respect to

\omega

(resp.

\mu

), i.e.,

\sum\limitsx\inpn(x)pm(x)\omega(x)=\kappan\deltan,m,

where

\deltan,m

is the Kronecker delta.[1]

Remark

Any discrete measure is of the form

\mu=\sumiai

\delta
si
,so one can define a weight function by

\omega(si)=ai

.

References

  1. Some discrete multiple orthogonal polynomials. J.. Arvesú. J.. Coussement. Walter. Van Assche. Journal of Computational and Applied Mathematics. 2003. 153. 19–45.