Abstract
We deal with the problem of obtaining closed formulas for the connection coefficients between orthogonal polynomial sequences and, also, the canonical sequence, using a recursive methodology based on symbolic computations, verifications and demonstrations in the Mathematica ® language. We present the corresponding software that is available in Netlib and, with it, we derive new formulas for the connection coefficients for some semi-classical of class 1 families.
Similar content being viewed by others
References
Alaya, J., Maroni, P.: Symmetric Laguerre–Hahn forms of class s = 1. Integral Transforms Spec. Funct. 4(4), 301–320 (1996)
Area, I., Godoy, E., Ronveaux, A., Zarzo, A.: Minimal recurrence relations for connection coefficients between classical orthogonal polynomials: discrete case. J. Comput. Appl. Math. 89, 309–325 (1998)
Area, I., Godoy, E., Ronveaux, A., Zarzo, A.: Inversion problems in the q-Hahn Tableau. J. Symb. Comput. 28, 767–776 (1999)
Atia, M.J.: An example of non-symmetric semi-classical form of class s = 1; generalization of a case of Jacobi sequence. Int. J. Math. Math. Sci. 24(10), 676–689 (2000)
Chagarra, H., Koepf, W.: On linearization and connection coefficients for generalized Hermite polynomials. J. Comput. Appl. Math. 236(1), 65–73 (2011)
Chihara, T.S.: An Introduction to Orthogonal Polynomials. Gordon and Breach, New York (1978)
Godoy, E., Area, I., Ronveaux, A., Zarzo, A.: Minimal recurrence relations for connection coefficients between classical orthogonal polynomials: continuous case. J. Comput. Appl. Math. 84(2), 257–275 (1997)
Lewanowicz, S.: Quick construction of recurrence relations for the Jacobi coefficients. J. Comput. Appl. Math. 43, 355–372 (1992)
Lewanowicz, S.: Recurrence relations for the connection coefficients of orthogonal polynomials of a discrete variable. J. Comput. Appl. Math. 76, 213–229 (1996)
Koepf, W., Swarttouw, R.: CAOP: Computer Algebra and Orthogonal Polynomials. http://pool-serv1.mathematik.uni-kassel.de/CAOP (2007)
Koepf, W., Schmersau, D.: Representations of orthogonal polynomials. J. Comput. Appl. Math. 90, 57–94 (1998)
Maroni, P.: Variations around classical orthogonal polynomials. Connected problems. J. Comput. Appl. Math. 48, 133–155 (1993)
Maroni, P.: Fonctions Eulériennes. Polynômes Orthogonaux Classiques. Techniques de l’Ingénieur, traité Généralités. Sciences Fondamentales (1994)
Maroni, P., da Rocha, Z.: Connection coefficients for orthogonal polynomials and the canonical sequence. Preprints CMUP, Centro de Matemática da Universidade do Porto, vol. 28, pp. 1–18 (2007). http://cmup.fc.up.pt/cmup/v2/frames/publications.htm
Maroni, P., da Rocha, Z.: Connection coefficients between orthogonal polynomials and the canonical sequence: an approach based on symbolic computation. Numer. Algor. 47(3), 291–314 (2008)
Ronveaux, A., Zarzo, A., Godoy, E.: Recurrence relation for connection coefficients between two families of orthogonal polynomials. J. Comput. Appl. Math. 62, 67–73 (1995)
Ronveaux, A., Rebillard, L.: Expansion of multivariate polynomials in products of univariate orthogonal polynomials: discrete case. J. Comput. Appl. Math. 133, 567–578 (2001)
Author information
Authors and Affiliations
Corresponding author
Additional information
Research funded by the European Regional Development Fund through the programe COMPETE and by the Portuguese Government through the FCT Fundação para a Ciência e a Tecnologia under the project PEst-C/MAT/UI0144/2011.
Rights and permissions
About this article
Cite this article
Maroni, P., da Rocha, Z. Connection coefficients for orthogonal polynomials: symbolic computations, verifications and demonstrations in the Mathematica language. Numer Algor 63, 507–520 (2013). https://doi.org/10.1007/s11075-012-9634-2
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11075-012-9634-2
Keywords
- Connection coefficients
- Orthogonal polynomials
- Symbolic computations
- Automatic demonstrations
- Mathematica ®(version 8)