Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Symbolic and Numeric Computations of the Barnes Function
 

Summary: Symbolic and Numeric Computations of the
Barnes Function
V. S. Adamchik
Department of Computer Science, Carnegie Mellon University, Pittsburgh, USA
Abstract
This paper discusses some theoretical aspects and algorithms for high-precision
computation of the Barnes gamma function.
Key words: Barnes function; Gamma function; Riemann zeta function; Hurwitz
zeta function; Stirling numbers; harmonic numbers; Glaisher's constant.
1 Introduction
In a sequence of papers published between 1899-1904, Barnes introduced and
studied (see [811]) a generalization of the classical Euler gamma function,
called the multiple gamma function n(z). The function n(z) satisfies the
following recurrence-functional equation [30,31]:
n+1(z + 1) =
n+1(z)
n(z)
, z C, n N
1(z) = (z)
n(1) = 1

  

Source: Adamchik, Victor - School of Computer Science, Carnegie Mellon University

 

Collections: Computer Technologies and Information Sciences