Computation of Continued Fractions without Input Values
نویسندگان
چکیده
An algorithm for the computation of the continued fraction expansions of numbers which are zeros of differentiable functions is given. The method is direct in the sense that it requires function evaluations at appropriate steps, rather than the value of the number as input in order to deliver the expansion. Statistical data on the first 10000 partial quotients for various real numbers are also given.
منابع مشابه
Computing Laplace Transforms for Numerical Inversion Via Continued Fractions
It is often possible to effectively calculate probability density functions (pdf’s) and cumulative distribution functions (cdf’s ) by numerically inverting Laplace transforms. However, to do so it is necessary to compute the Laplace transform values. Unfortunately, convenient explicit expressions for required transforms are often unavailable for component pdf’s in a probability model. In that e...
متن کاملContinued Fractions, Diophantine Approximations, and Design of Color Transforms
We study a problem of approximate computation of color transforms (with real and possibly irrational factors) using integer arithmetics. We show that precision of such computations can be significantly improved if we allow input or output variables to be scaled by some constant. The problem of finding such a constant turns out to be related to the classic Diophantine approximation problem. We u...
متن کامل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...
متن کاملExplicit formula for the inverse of a tridiagonal matrix by backward continued fractions
In this paper, we consider a general tridiagonal matrix and give the explicit formula for the elements of its inverse. For this purpose, considering usual continued fraction, we define backward continued fraction for a real number and give some basic results on backward continued fraction. We give the relationships between the usual and backward continued fractions. Then we reobtain the LU fact...
متن کاملOn the 1D and 2D Rogers-Ramanujan Continued Fractions
In this paper the classical and generalized numerical Rogers Ramanujan continued fractions are extended to a polynomial continued fraction in one and two dimensions. Using the new continued fractions, the fundamental recurrence formulas and a fast algorithm, based on matrix formulations, are given for the computation of their transfer functions. The presented matrix formulations can provide a n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010