On the residue classes of integer sequences satisfying a linear three term recurrence formula

: The relations between approximants of the regular continued fraction expansion for square root of C + L and the approximations given by an extension of Newton's formula are given. The general relationship is given between the approximants of a regular periodic continued fraction expansion for square root of C + L and the approximations given by the extended Newton's formula. These formulas are modified to the case of symmetric periodic continued fraction expansions. Rules are given that relate the approximants of mixed periodic continued fraction expansions for square root of C + L to approximations given by the extended Newton's formula. (Author)

Motivated by problems in random continued fraction expansions, this research describes the design and implementation on θ-expansions of a real number, x in (0, θ) where 0 < θ < 1. Initially, for such a number θ, the convergent of θ-expansions is computed with comparison to the regular continued fraction (RCF)-convergent based on the samples of the approximated value, x. θ-expansions algorithm and continued fraction algorithm are applied in a Maple software to compute the θ-convergent and RCF-convergent. In this respect, the purpose of this research is to examine the growth rate of convergent for both expansions and provide the theoretical behaviours of θ-convergent in θ-expansions. Numerical results based on these samples show 3 conditions of convergence growth rate, which are C2 and C4 give the best decimal approximations in θ-expansions, whereas, Cn be the best approximations in RCF expansions. Therefore, this research reveals that various value of θ affect the performance on their growth rate of convergent for these two expansions. As θ approaching to 1, it reduces their convergence errors. The analysis of the experimental results reveals the RCF-convergent give a better performance compared to θ-convergent as its yield to less convergence errors. In addition, the value of convergent do converge to the approximated value, x and that is how the name of convergent comes.

The sum of all partial quotients in the regular continued fraction expansions of m/n, for 1 </= m </= n, is shown to be 6pi(-2)n(ln n)(2) + O(n log n(log log n)(2)). This result is applied to the analysis of what is perhaps the oldest non-trivial algorithm for number-theoretic computations.

A digital computer program for the design of an all-pass function, with n natural modes, to correct the phase of a prescribed transfer function is discussed. The program is based on the expansion of both the desired phase and that of the all-pass function as a Tchebycheff polynomial series, together with the selection of the all-pass natural modes, so that the first n coefficients in the two series agree. If the over-all delay is unimportant, it may be chosen either to increase the number of matched coefficients by one, or to seek a minimum peak error over the approximating bandwidth. The design process is based on a continued fraction expansion, and a detailed technique for adjusting the over-all delay is discussed. Recurrence relationships are established for expanding the phase of any transfer function as a Tchebycheff polynomial series. The dependence of peak error on approximating bandwidth is discussed, and a routine for the automatic adjustment of the bandwith to meet a specified peak error is described. The design accuracy depends primarily on the root extraction technique, and on the loss of significant figures during continued fraction expansion. Adequate results have been obtained with 8 or 10 natural modes. The speed of the program depends on the number of basic iterations of the design process, which varies from one to ten. On a Ferranti Mercury Computer with <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n = 8</tex> , the basic iteration time is 20 seconds.

In this work we deal with extreme value theory in the context of continued fractions using techniques from probability theory, ergodic theory and real analysis. We give an upper bound for the rate of convergence in the Doeblin–Iosifescu asymptotics for the exceedances of digits obtained from the regular continued fraction expansion of a number chosen randomly from$(0,1)$according to the Gauss measure. As a consequence, we significantly improve the best known upper bound on the rate of convergence of the maxima in this case. We observe that the asymptotics of order statistics and the extremal point process can also be investigated using our methods.

Let q, fj, t2, be a sequence of elements of a field F. We give a 2 3 continued fraction algorithm for t^x + txx + t2x + .If our sequence satisfies a linear recurrence, then the continued fraction algorithm is finite and produces this recurrence.More generally the algorithm produces a nontrivial solution of the system s ',+/*/.0</<*-l, /=0 for every positive integer s. 1.Let t0, tx, t2, be a sequence of elements of a field F. Set T-\ttft./=0 Let d be a nonnegative integer.We say that T* is an approximation of T of degree d if there exist polynomials V and W such that T* = V/W, deg V < d, deg W < d, x\w, and x2d\WT -V.We shall give a continued fraction expansion for xT.This yields polynomials V-, W, and integers d-, 0 = dx < d2 < d3 < , such that (V, W) = 1 and V,/W-is an approximation of T of degree d.Suppose T* is any approximation of T of some degree d.Then T* = V/W for that value of i such that d < d<di+x.If the sequence of the t satisfies a linear recurrence of degree d, but not one of smaller degree, then there is an m such that dm = d and the linear recurrence is given by the polynomial Wm.In this case, WmT = Vm, the continued fraction expansion, terminates at i = m, and we can determine Wm from the first 2d of the t:, i.e., from those t such that 0 </ < 2d.Our algorithm is closely related to Zierler's version of Berlekamp's algorithm [1].2. We consider continued fraction expansions of the form a = A, +-l A, + 2 A3+-where A,, A2, A3, are elements from some field E. We can write

It is well known that the regular continued fraction expansion of a quadratic irrational is symmetric about its centre; we refer to this symmetry as horizontal. However, an additional vertical symmetry is exhibited by the continued fraction expansions arising from a family of quadratics known as Schinzel sleepers. This paper provides a method for generating every Schinzel sleeper and investigates their period lengths as well as both their horizontal and vertical symmetries.

Let pn/qn = [a0;a1,…,an] be the n‐th convergent of the continued fraction expansion of [a0;a1,a2,…]. Leaping convergents are those of every r‐th convergent prn+i/qrn+i(n = 0,1,2,…) for fixed integers r and i with r⩾2 and i = 0,1,…,r−1. The leaping convergents for the e‐type Hurwitz continued fractions have been studied. In special, recurrence relations and explicit forms of such leaping convergents have been treated. In this paper, we consider recurrence relations and explicit forms of the leaping convergents for some different types of Hurwitz continued fractions.

On the metric theory of [formula omitted]-adic continued fractions

The analytic solution for the power series expansion of Heun function

The paper is related to the classical problem of the rational approximation of analytic functions of one or several variables, particulary the issues that arise in the construction and studying of continued fraction expansions and their multidimensional generalizations—branched continued fraction expansions. We used combinations of three- and four-term recurrence relations of the generalized hypergeometric function 3F2 to construct the branched continued fraction expansions of the ratios of this function. We also used the concept of correspondence and the research method to extend convergence, already known for a small region, to a larger region. As a result, we have established some convergence criteria for the expansions mentioned above. It is proved that the branched continued fraction expansions converges to the functions that are an analytic continuation of the ratios mentioned above in some region. The constructed expansions can approximate the solutions of certain differential equations and analytic functions, which are represented by generalized hypergeometric function 3F2. To illustrate this, we have given a few numerical experiments at the end.

The obvious way to compute the continued fraction of a real number α > 1 is to compute a very accurate numerical approximation of α, and then to iterate the well-known truncate-and-invert step which computes the next partial quotient a = bαc and the next complete quotient α′ = 1/(α − a). This method is called the basic method. In the course of this process precision is lost, and one has to take precautions to stop before the partial quotients become incorrect. Lehmer [6] gives a safe stopping-criterion, and a trick to reduce the amount of multi-length arithmetic. Schonhage [12] describes an algorithm for computing the greatest common divisor of u and v and the related continued fraction expansion of u/v in O(n log n log log n) steps if both u and v do not exceed 2. A disadvantage of this approach is that if we wish to extend the list of partial quotients computed from an initial approximation of α, we have to compute a more accurate initial approximation of α, compute the new complete quotient using this new approximation and the partial quotients already computed from the old approximation, and then extend the list of partial quotients using that new complete quotient (we notice that Shiu in [13, p.1312] incorrectly states that all the previous calculations have to be repeated, but the partial quotients computed so far don’t have to be recomputed). Bombieri and Van der Poorten [1], and Shiu [13] have recently proposed a remedy for this problem. They give a formula for computing a rational approximation of the next complete convergent from the first n partial quotients. From that complete convergent about n new partial quotients can be computed. So each step gives an approximate doubling of the number of partial quotients. To start the method, a few partial quotients have to be computed with the basic or indirect method. In [1] this method is proposed for algebraic numbers (which are zeros of polynomials) of degree ≥ 3, whereas Shiu also applies it to more general numbers, namely to transcendental numbers that can be defined as the zero of a function for which the logarithmic derivative at a rational point can be computed with arbitrary precision. This includes numbers like π, log π, and log 2. For each of thirteen different numbers, Shiu computes 10000 partial quotients. Their frequency distributions are compared with the one which almost all numbers should obey, according to the Khintchine– Levy theory [3, 7]. No significant deviations from this theory are reported. Shiu calls his method the direct method. Curiously, Shiu does not refer to what we would call the polynomial method for algebraic numbers [2, 5, 11] of degree ≥ 3, which computes the partial quotients of α using only the coefficients of its defining polynomial. Moreover, Shiu gives neither implementational

The development of bounds on the complex effective conductivity tensor σ* (that relates the average current to the average electric field in a multicomponent composite) has been hindered by lack of a suitable continued-fraction representation for σ*. Here a new field equation recursion method is developed which gives an expression for σ* as a continued fraction of a novel form incorporating as coefficients the component conductivities and a set of fundamental geometric parameters reflecting the composite geometry. A hierarchy of field equations is set up such that the solutions of the (j+1)th-order equation generate the solutions of thejth-order equation. Consequently the effective tensor Ω(j) associated with thejth-order field equation is expressible as a fractional linear matrix transformation of Ω(j+1). These transformations combine to form the continued fraction expansion for σ*=Ω(0) which is exploited in the following paper, Part II, to obtain bounds: crude bounds on Ω(j), forj≧1, give narrow bounds on σ*. The continued fraction is a generalization to multivariate functions of the continued fraction expansion of single variable Stieltjes functions that proved important in the development of the theory of Páde approximants, asymptotic analysis, and the theory of orthogonal polynomials in the last century. The results extend to other transport problems, including conduction in polycrystalline media, the viscoelasticity of composites, and the response of multicomponent, multiterminal linear electrical networks.

Hausdorff dimension of certain sets arising in continued fraction expansions

In this paper, the design of half sample delay IIR filter is presented. First, the continued fraction expansion (CFE) and its recursive computation are reviewed briefly. Then, the CFE of square root function is applied to design half sample delay IIR filters with various orders. Next, the comparison with conventional maximally flat IIR allpass filter is made and implementation issue is also addressed. Finally, several design examples are illustrated to demonstrate the effectiveness of the proposed method.