Abstract
A method for fast and highly accurate evaluation of the generalized hypergeometric function p F p−1(a 1, ..., a p ; b 1, ..., b p−1; 1) = Σ ∞ k = 0 f k by means of the Hurwitz zeta function ζ(α, s) is developed. Based on asymptotic analysis of the coefficients f k , an expansion of p F p−1 is constructed as a combination of the functions ζ(α, s) with explicit coefficients expressed in terms of the generalized Bernoulli polynomials. An appropriate selection of the parameter α and the number of terms of the asymptotic expansion makes it possible to obtain the result with any desired degree of accuracy. The use of computer algebra methods, efficient numerical algorithms, and stochastic optimization methods considerably improve the efficiency of the suggested method.
Similar content being viewed by others
References
Bateman, H. and Erdelyi, A., Higher Transcendental Functions, New York: McGraw-Hill, 1953.
Slater, L.J., Generalized Hypergeometric Functions, Cambridge: Cambridge Univ. Press, 1966.
Luke, Y., The Special Functions and Their Approximations, New York: Academic, 1969.
Knuth, D.E., The Art of Computer Programming, vol. 3: Sorting and Searching, Reading: Addison-Wesley, 1973.
Riordan, J., Combinatorial Identities, New York: Wiley, 1968.
Petkovšek, M., Wilf, H.S., and Zeilberger, D., A = B, Wellesley, Mass.: A.K. Peters, 1996.
Exton, H., Multiple Hypergeometric Functions and Applications, New York: Chichester, 1976.
Suzuki, A.T. and Schmidt, A.G.M., Loop Integrals in Three Outstanding Gauges: Feynman, Light-Cone, and Coulomb, J. Comput. Phys., 2001, vol. 168, no. 1, pp. 207–218.
Prudnikov, A.P., Brychkov, Yu.A., and Marichev, O.I., Integraly i ryady. Spetsial’nye funktsii (Integrals and Series: Special Functions), Moscow: Nauka, 1983.
Bühring, W., Partial Sums of Hypergeometric Series of Unit Argument, Proc. Am. Math. Soc., 2004, vol. 132, pp. 407–415.
Skorokhodov, S.L., A Method for Computing Generalized Hypergeometric Function p F p−1(a 1, ..., a p; b 1, ..., b p−1; 1) in Terms of the Riemann Zeta Function, Zh. Vychisl. Mat. Mat. Fiz., 2005, vol. 45, no. 4, pp. 574–586 [Comp. Math. Math. Phys. (Engl. Transl.), vol. 45, no. 4, pp. 550–562].
Olver, F., Asymptotics and Special Functions, New York: Academic, 1974.
Borwein, J.M., Bradley, D.M., and Crandall, R.E., Computational Strategies for the Riemann Zeta Function, J. Computational Applied Math., 2000, vol. 121, no. 1–2, pp. 247–296.
Odlyzko, A.M. and Schönhage, A., Fast Algorithms for Multiple Evaluations of the Riemann Zeta Function, Trans. Am. Math. Soc., 1988, vol. 309, pp. 797–809.
Skorokhodov, S.L., Padé Approximants and Numerical Analysis of the Riemann Zeta Function, Zh. Vychisl. Mat. Mat. Fiz., 2003, vol. 43, no. 9, pp. 1330–1352 [Comp. Math. Math. Phys. (Engl. Transl.), vol. 43, no. 9, pp. 1277–1298].
Schönhage, A. and Strassen, V., Schnelle Multiplikation Grosser Zahlen, Computing, 1971, vol. 7, pp. 281–292.
Prasolov, V.V., Mnogochleny (Polynomials), Moscow: MTsNMO, 2001.
Temme, N., Bernoulli Polynomials Old and New: Generalization and Asymptotic, CWI Quarterly, 1995, vol. 8, pp. 47–66.
Dilcher, K., Zeros of Bernoulli, Generalized Bernoulli, and Euler Polynomials, Memoirs Am. Math. Soc., 1998, 386. MR 89h:30005.
Arzhantsev, V.I., Bazisy Grebnera i sistemy algebraicheskikh uravnenii (Gröbner Basis and Systems of Algebraic Equations), Moscow: MTsNMO, 2003.
Henrici, P., Applied and Computational Complex Analysis, New York: Wiley, 1988, vol. 1; 1991, vol. 2; 1985, vol. 3.
Mitchell, M., An Introduction to Genetic Algorithms (Adaptive Complex Systems), MA: MIT, 1996.
Goldberg, D., Genetic Algorithms in Search, Optimization, and Machine Learning. Reading, MA: Addison-Wesley Publishing Company, 1989.
Mandelbrojt, S., Séries de Dirichlet. Principles et Méthodes, Paris: Gauthier-Villard, 1969.
Slavyanov, S. and Lay, V., Spetsial’nye funktsii: edinaya teoriya, osnovannaya na analize osobennostei (Special Functions: General Theory Based on Singularity Analysis), St. Petersburg: Nevskii dialekt, 2002.
Kormen, T., Leizerson, Ch., and Rivest, R., Algoritmy: postroenie i analiz (Algorithms: Construction and Analysis), Moscow: MTsNMO, 2004.
Author information
Authors and Affiliations
Additional information
Original Russian Text © A.I. Bogolubsky, S.L. Skorokhodov, 2006, published in Programmirovanie, 2006, Vol. 32, No. 3.
Rights and permissions
About this article
Cite this article
Bogolubsky, A.I., Skorokhodov, S.L. Fast evaluation of the hypergeometric function p F p−1(a; b; z) at the singular point z = 1 by means of the Hurwitz zeta function ζ(α, s). Program Comput Soft 32, 145–153 (2006). https://doi.org/10.1134/S0361768806030054
Received:
Issue Date:
DOI: https://doi.org/10.1134/S0361768806030054