Continued Fraction Evaluation of the Error Function

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

continued fraction ∗

We use a continued fraction expansion of the sign-function in order to obtain a five dimensional formulation of the overlap lattice Dirac operator. Within this formulation the inverse of the overlap operator can be calculated by a single Krylov space method where nested conjugate gradient procedures are avoided. We show that the five dimensional linear system can be made well conditioned using ...

متن کامل

Continued-fraction Expansions for the Riemann Zeta Function and Polylogarithms

It appears that the only known representations for the Riemann zeta function ζ(z) in terms of continued fractions are those for z = 2 and 3. Here we give a rapidly converging continued-fraction expansion of ζ(n) for any integer n ≥ 2. This is a special case of a more general expansion which we have derived for the polylogarithms of order n, n ≥ 1, by using the classical Stieltjes technique. Our...

متن کامل

The Szekeres Multidimensional Continued Fraction

In his paper "Multidimensional continued fractions" {Ann. Univ. Sei. Budapest. EOtvOs Sect. Math., y. 13, 1970, pp. 113-140), G. Szekeres introduced a new higher dimensional analogue of the ordinary continued fraction expansion of a single real number. The Szekeres algorithm associates with each fc-tuple (a»,..., ak) of real numbers (satisfying 0 < a< 1) a sequence bx, b2,... of positive intege...

متن کامل

The Random Continued Fraction Transformation

We introduce a random dynamical system related to continued fraction expansions. It uses random combination of the Gauss map and the Rényi (or backwards) continued fraction map. We explore the continued fraction expansions that this system produces as well as the dynamical properties of the system.

متن کامل

The Hurwitz Complex Continued Fraction

The Hurwitz complex continued fraction algorithm generates Gaussian rational approximations to an arbitrary complex number α by way of a sequence (a0, a1, . . .) of Gaussian integers determined by a0 = [α], z0 = α − a0, (where [u] denotes the Gaussian integer nearest u) and for j ≥ 1, aj = [1/zj−1], zj = 1/zj−1−aj . The rational approximations are the finite continued fractions [a0; a1, . . . ,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of King Abdulaziz University-Science

سال: 2006

ISSN: 1319-1012,1658-4252

DOI: 10.4197/sci.18-1.8