| dc.date.accessioned | 2014-07-16T10:47:08Z | |
| dc.date.available | 2014-07-16T10:47:08Z | |
| dc.date.issued | 2014-07-16 | |
| dc.identifier.uri | urn:nbn:de:hebis:34-2014071645714 | |
| dc.identifier.uri | http://hdl.handle.net/123456789/2014071645714 | |
| dc.language.iso | eng | |
| dc.rights | Urheberrechtlich geschützt | |
| dc.rights.uri | https://rightsstatements.org/page/InC/1.0/ | |
| dc.subject | Connection coefficients | eng |
| dc.subject | Linearization coefficients | eng |
| dc.subject | Duplications coefficients | eng |
| dc.subject | Classical orthogonal polynomials | eng |
| dc.subject | Askey-Wilson scheme | eng |
| dc.subject.ddc | 510 | |
| dc.title | On Connection, Linearization and Duplication Coefficients of Classical Orthogonal Polynomials | eng |
| dc.type | Dissertation | |
| dcterms.abstract | In this work, we have mainly achieved the following:
1. we provide a review of the main methods used for the computation of the connection and linearization coefficients between orthogonal polynomials of a continuous variable, moreover using a new approach, the duplication problem of these polynomial families is solved;
2. we review the main methods used for the computation of the connection and linearization coefficients of orthogonal polynomials of a discrete variable, we solve the duplication and linearization problem of all orthogonal polynomials of a discrete variable;
3. we propose a method to generate the connection, linearization and duplication coefficients for q-orthogonal polynomials;
4. we propose a unified method to obtain these coefficients in a generic way for orthogonal polynomials on quadratic and q-quadratic lattices.
Our algorithmic approach to compute linearization, connection and duplication coefficients is based on the one used by Koepf and Schmersau and on the NaViMa algorithm. Our main technique is to use explicit formulas for structural identities of classical orthogonal polynomial systems. We find our results by an application of computer algebra. The major algorithmic tools for our development are Zeilberger’s algorithm, q-Zeilberger’s algorithm, the Petkovšek-van-Hoeij algorithm, the q-Petkovšek-van-Hoeij algorithm, and Algorithm 2.2, p. 20 of Koepf's book "Hypergeometric Summation" and it q-analogue. | eng |
| dcterms.accessRights | open access | |
| dcterms.creator | Tcheutia, Daniel Duviol | |
| dc.contributor.corporatename | Universität, Kassel, Fachbereich Mathematik und Naturwissenschaften | |
| dc.contributor.referee | Koepf, Wolfram | |
| dc.contributor.referee | Foupouagnigni, Mama | |
| dc.subject.msc | 33C45 | ger |
| dc.subject.msc | 33D45 | ger |
| dc.subject.swd | Orthogonale Polynome | ger |
| dc.date.examination | 2014-07-14 | |
