orthopolynom (version 1.0-6.1)

chebyshev.u.inner.products: Inner products of Chebyshev polynomials

Description

This function returns a vector with \(n + 1\) elements containing the inner product of an order \(k\) Chebyshev polynomial of the second kind, \(U_k \left( x\right)\), with itself (i.e. the norm squared) for orders \(k = 0,\;1,\; \ldots ,\;n \).

Usage

chebyshev.u.inner.products(n)

Value

A vector with \(n + 1\) elements

1

inner product of order 0 orthogonal polynomial

2

inner product of order 1 orthogonal polynomial

...

n+1

inner product of order \(n\) orthogonal polynomial

Arguments

n

integer value for the highest polynomial order

Author

Frederick Novomestky

Details

The formula used to compute the inner products is as follows.

\(h_n = \left\langle {U_n |U_n } \right\rangle = \frac{\pi }{2}\)

References

Abramowitz, M. and I. A. Stegun, 1968. Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables, Dover Publications, Inc., New York.

Courant, R., and D. Hilbert, 1989. Methods of Mathematical Physics, John Wiley, New York, NY.

Szego, G., 1939. Orthogonal Polynomials, 23, American Mathematical Society Colloquium Publications, Providence, RI.

Examples

###
### generate the inner products vector for the 
### U Chebyshev polynomials of orders 0 to 10
###
h <- chebyshev.u.inner.products( 10 )
print( h )