Skip to main content

2020 | OriginalPaper | Buchkapitel

Computer Algebra, Power Series and Summation

verfasst von : Wolfram Koepf

Erschienen in: Orthogonal Polynomials

Verlag: Springer International Publishing

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Computer algebra systems can do many computations that are relevant for orthogonal polynomials and their representations. In this preliminary training we will introduce some of those important algorithms: the automatic computation of differential equations and formal power series, hypergeometric representations, and the algorithms by Fasenmyer, Gosper, Zeilberger and Petkovšek/van Hoeij.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Fußnoten
1
Please note that Maple regularly does not sort its output to save computation time so that the Taylor coefficients might appear in wrong order.
 
2
For details how to select the linearly independent functions, see [8].
 
3
We don’t print the lengthy outputs.
 
4
The commands rodriguesrecursion and rodriguesdiffequ take representation (11.1) into consideration and invoke the Almkvist–Zeilberger algorithms. For details, see [13, Chapter 13].
 
Literatur
1.
Zurück zum Zitat G. Almkvist, D. Zeilberger, The method of differentiating under the integral sign. J. Symb. Comput. 10, 571–591 (1990)MathSciNetCrossRef G. Almkvist, D. Zeilberger, The method of differentiating under the integral sign. J. Symb. Comput. 10, 571–591 (1990)MathSciNetCrossRef
2.
Zurück zum Zitat Apéry, R.: Irrationalité de ζ(2) et ζ(3). Astérisque 61, 11–13 (1979)MATH Apéry, R.: Irrationalité de ζ(2) et ζ(3). Astérisque 61, 11–13 (1979)MATH
3.
Zurück zum Zitat H. Böing, W. Koepf, Algorithms for q-hypergeometric summation in computer algebra. J. Symb. Comput. 28, 777–799 (1999)MathSciNetCrossRef H. Böing, W. Koepf, Algorithms for q-hypergeometric summation in computer algebra. J. Symb. Comput. 28, 777–799 (1999)MathSciNetCrossRef
5.
Zurück zum Zitat M.C. Fasenmyer, Some generalized hypergeometric polynomials. Ph.D. Thesis, University of Michigan (1945) M.C. Fasenmyer, Some generalized hypergeometric polynomials. Ph.D. Thesis, University of Michigan (1945)
7.
Zurück zum Zitat R.W. Gosper Jr., Decision procedure for indefinite hypergeometric summation. Proc. Natl. Acad. Sci. U. S. A. 75, 40–42 (1978)MathSciNetCrossRef R.W. Gosper Jr., Decision procedure for indefinite hypergeometric summation. Proc. Natl. Acad. Sci. U. S. A. 75, 40–42 (1978)MathSciNetCrossRef
9.
Zurück zum Zitat R. Koekoek, P.A. Lesky, R. Swarttouw, Hypergeometric Orthogonal Polynomials and Theirq-Analogues. Springer Monographs in Mathematics (Springer, Berlin, 2010)CrossRef R. Koekoek, P.A. Lesky, R. Swarttouw, Hypergeometric Orthogonal Polynomials and Theirq-Analogues. Springer Monographs in Mathematics (Springer, Berlin, 2010)CrossRef
10.
12.
Zurück zum Zitat W. Koepf, Computeralgebra. Eine algorithmisch orientierte Einführung (Springer, Berlin, 2006) W. Koepf, Computeralgebra. Eine algorithmisch orientierte Einführung (Springer, Berlin, 2006)
13.
Zurück zum Zitat W. Koepf, Hypergeometric Summation. An Algorithmic Approach to Summation and Special Function Identities, 1st edn. (Vieweg, Wiesbaden, 1998); 2nd edn. Springer Universitext (Springer, London, 2014) W. Koepf, Hypergeometric Summation. An Algorithmic Approach to Summation and Special Function Identities, 1st edn. (Vieweg, Wiesbaden, 1998); 2nd edn. Springer Universitext (Springer, London, 2014)
14.
Zurück zum Zitat M.A. Perlstadt, Some recurrences for sums of powers of binomial coefficients. J. Number Theory 27, 304–309 (1987)MathSciNetCrossRef M.A. Perlstadt, Some recurrences for sums of powers of binomial coefficients. J. Number Theory 27, 304–309 (1987)MathSciNetCrossRef
15.
Zurück zum Zitat M. Petkovšek, Hypergeometric solutions of linear recurrences with polynomial coefficients. J. Symb. Comput. 14, 243–264 (1992)MathSciNetCrossRef M. Petkovšek, Hypergeometric solutions of linear recurrences with polynomial coefficients. J. Symb. Comput. 14, 243–264 (1992)MathSciNetCrossRef
16.
Zurück zum Zitat M.S. Robertson, Complex powers of p-valent functions and subordination, in Complex Analysis, Proceedings of SUNY Conference, Brockport 1976. Lecture Notes in Mathematics, vol. 36 (1978), pp. 1–33 M.S. Robertson, Complex powers of p-valent functions and subordination, in Complex Analysis, Proceedings of SUNY Conference, Brockport 1976. Lecture Notes in Mathematics, vol. 36 (1978), pp. 1–33
17.
Zurück zum Zitat M.S. Robertson, A subordination problem and a related class of polynomials, in Univalent Functions, Fractional Calculus, and Their Applications, ed. by H.M. Srivastava, Sh. Owa (eds.) (Ellis Horwood Limited, Chichester, 1989), pp. 245–266 M.S. Robertson, A subordination problem and a related class of polynomials, in Univalent Functions, Fractional Calculus, and Their Applications, ed. by H.M. Srivastava, Sh. Owa (eds.) (Ellis Horwood Limited, Chichester, 1989), pp. 245–266
18.
Zurück zum Zitat B. Salvy, P. Zimmermann, GFUN: a Maple package for the manipulation of generating and holonomic functions in one variable. ACM Trans. Math. Softw. 20, 163–177 (1994)CrossRef B. Salvy, P. Zimmermann, GFUN: a Maple package for the manipulation of generating and holonomic functions in one variable. ACM Trans. Math. Softw. 20, 163–177 (1994)CrossRef
20.
Zurück zum Zitat M. van Hoeij, Finite singularities and hypergeometric solutions of linear recurrence equations. J. Pure Appl. Algebra 139, 109–131 (1998)MathSciNetCrossRef M. van Hoeij, Finite singularities and hypergeometric solutions of linear recurrence equations. J. Pure Appl. Algebra 139, 109–131 (1998)MathSciNetCrossRef
21.
Zurück zum Zitat D. Zeilberger, A fast algorithm for proving terminating hypergeometric identities. Discrete Math. 80, 207–211 (1990)MathSciNetCrossRef D. Zeilberger, A fast algorithm for proving terminating hypergeometric identities. Discrete Math. 80, 207–211 (1990)MathSciNetCrossRef
Metadaten
Titel
Computer Algebra, Power Series and Summation
verfasst von
Wolfram Koepf
Copyright-Jahr
2020
DOI
https://doi.org/10.1007/978-3-030-36744-2_7