Abstract
A convenient graphical algorithm for searching and constructing explicit analytical representations of all hypergeometric series belonging to any given class is proposed. The algorithm is based on a set of rules that define a one-to-one correspondence between analytic representations of series and diagrams. The algorithm can be easily implemented in the form of a computer program.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
REFERENCES
Srivastava, H.M. and Karlsson, P.W., Multiple Hypergeometric Series, Chichester: Ellis Hoorwood, 1985.
Niukkanen, A.V., Extending the Factorization Principle to General Hypergeometric Series, Mat. Zametki, 2000, no. 4.
Bateman, H. and Erdelyi, A., Higher Transcendental Functions, New York: Mcraw-Hill, 1953. Translated under the title Vysshie transtsendentnye funktsii, Moscow: Mir, 1973, vol. 1.
Niukkanen, A.V. and Paramonova, O.S., Computer Generation of Complicated Transformations and Reduction Formulas for Multiple Hypergeometric Series, Comput. Phys. Commun., 2000, vol. 126, no. 2, pp. 141-148.
Niukkanen, A.V., New Theory of Hypergeometric Series and Its Use in Computer Algebra Systems, Fundam. Prikl. Mat., 1999, vol. 5, issue 3, pp. 716-745.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Niukkanen, A.V., Niukkanen, P.A. Diagram Technique for Hypergeometric Series of Several Variables. Programming and Computer Software 27, 29–34 (2001). https://doi.org/10.1023/A:1007134719285
Issue Date:
DOI: https://doi.org/10.1023/A:1007134719285