Recurrence relations for the coefficients of expansions in classical orthogonal polynomials of a discrete variable (Q4425010)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1978391
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Recurrence relations for the coefficients of expansions in classical orthogonal polynomials of a discrete variable |
scientific article; zbMATH DE number 1978391 |
Statements
Recurrence relations for the coefficients of expansions in classical orthogonal polynomials of a discrete variable (English)
0 references
9 September 2003
0 references
Fourier coefficients
0 references
recurrence relations
0 references
difference equations
0 references
orthogonal polynomials of a discrete variable
0 references
0.8765071034431458
0 references
0.8651204109191895
0 references
0.8617031574249268
0 references
0.8557266592979431
0 references
Exploiting a method that has been described in detail in the author's thesis (in Polish), a method is given to derive a recurrence relation for the coefficients in the Fourier series of a function \[ f(x)=\sum_k a_k[f]P_k(x), \] where \((P_k)\) is a sequence of classical orthogonal polynomials in a discrete variable (Charlier, Meixner, Krawtchouk, Hahn; in case of the latter two, the function \(f\) is assumed to be a polynomial). The recurrence relation takes the form \[ \sum_{k=0}^r A_i(k)a_{k+i}[f]=B(k), \] where the \(A_i, B\) are function of \(k\). The method of proof uses a plethora of heavily indexed and suffixed operators and is reminiscent of a previous publication by the author and \textit{S. Lewanowicz} [Inst. Comput. Sci., Univ. of Wrocław (2001) \url{http://www.ii.uni.wroc.pl/~sle/publ/}].
0 references