Chebyshev rational functions explained

In mathematics, the Chebyshev rational functions are a sequence of functions which are both rational and orthogonal. They are named after Pafnuty Chebyshev. A rational Chebyshev function of degree is defined as:

Rn(x)\stackrel{def

}\ T_n\left(\frac\right)

where is a Chebyshev polynomial of the first kind.

Properties

Many properties can be derived from the properties of the Chebyshev polynomials of the first kind. Other properties are unique to the functions themselves.

Recursion

Rn+1(x)=2\left(

x-1
x+1

\right)Rn(x)-Rn-1(x)forn\ge1

Differential equations

2R
(x+1)
n(x)=1
n+1
d
dx

Rn+1(x)-

1
n-1
d
dx

Rn-1(x)forn\ge2

2xd2
dx2
(x+1)
R
n(x)+(3x+1)(x+1)
2
d
dx
2R
R
n

(x)=0

Orthogonality

Defining:

\omega(x)\stackrel{def

}\ \frac

The orthogonality of the Chebyshev rational functions may be written:

infty
\int
0

Rm(x)R

n(x)\omega(x)dx=\picn
2

\deltanm

where for and for ; is the Kronecker delta function.

Expansion of an arbitrary function

For an arbitrary function the orthogonality relationship can be used to expand :

infty
f(x)=\sum
n=0

FnRn(x)

where

F
n=2
cn\pi
infty
\int
0

f(x)Rn(x)\omega(x)dx.

Particular values

\begin{align} R0(x)&=1\\ R

1(x)&=x-1
x+1
\\ R
2(x)&=x2-6x+1
(x+1)2
\\ R
3(x)&=x3-15x2+15x-1
(x+1)3
\\ R
4(x)&=x4-28x3+70x2-28x+1
(x+1)4
-n
\\ R
n(x)&=(x+1)
n
\sum
m=0

(-1)m\binom{2n}{2m}xn-m\end{align}

Partial fraction expansion

Rn(x)=\sum

n
m=0
(m!)2\binom{n+m-1}{m}\binom{n}{m}
(2m)!
(-4)m
(x+1)m

References