On the Padé table for e x and the simple continued fractions for e and e L/M

A recently observed connection between some Padé approximants for the exponential series and the convergents of the simple continued fraction for e is established, leading to an alternative proof of the latter. Similar results for the simple continued fraction e ²,e ^1/M and e ^2/M , when M is a natural number greater than one, are derived.      

Representation of algebraic numbers by periodic branching continued fractions

The notion of a periodic branching continued fraction is a natural generalization of the notion of a periodic continued fraction. It is shown that for an arbitrary positive algebraic number one can construct a periodic branching continued fraction with natural elements convergent to this number.     

Lattice basis reduction algorithms and multi-dimensional continued fractions

In this paper we develop a new multi-dimensional continued fraction algorithm and three known multi-dimensional continued fraction algorithms from the lattice basis reduction multisequence synthesis (LBRMS) algorithm with respect to the different choice of a parameter and so a continued fraction expansion is associated with a basis transformation. The new algorithm is similar to Dai's continued fraction algorithm [Z.D. Dai, K.P. Wang, D.F. Ye, m-Continued fraction algorithm on multi-Laurent series, Acta Arith. (2006) 1–21] but improves the latter effectively.     

On a vector q‐d algorithm

Using the framework provided by Clifford algebras, we consider a non‐commutative quotient‐difference algorithm for obtaining the elements of a continued fraction corresponding to a given vector‐valued power series. We demonstrate that these elements are ratios of vectors, which may be calculated with the aid of a cross rule using only vector operations. For vector‐valued meromorphic functions we derive the asymptotic behaviour of these vectors, and hence of the continued fraction elements themselves. The behaviour of these elements is similar to that in the scalar case, while the vectors are linked with the residues of the given function. In the particular case of vector power series arising from matrix iteration the new algorithm amounts to a generalisation of the power method to sub‐dominant eigenvalues, and their eigenvectors. This revised version was published online in June 2006 with corrections to the Cover Date.     

A continued fraction of order twelve

In this paper, we establish several explicit evaluations, reciprocity theorems and integral representations for a continued fraction of order twelve which are analogues to Rogers-Ramanujan’s continued fraction and Ramanujan’s cubic continued fraction.      

On the Generalized Rogers–Ramanujan Continued Fraction

On page 26 in his lost notebook, Ramanujan states an asymptotic formula for the generalized Rogers–Ramanujan continued fraction. This formula is proved and made slightly more precise. A second primary goal is to prove another continued fraction representation for the Rogers–Ramanujan continued fraction conjectured by R. Blecksmith and J. Brillhart. Two further entries in the lost notebook are examined. One of them is an identity bearing a superficial resemblance to the generating function for the generalized Rogers–Ramanujan continued fraction. Thus, our third main goal is to establish, with the help of an idea of F. Franklin, a partition bijection to prove this identity.     

Shrinking the period length of quasi-periodic continued fractions

Extending the work of Burger et al., here we show that every quasi-periodic simple continued fraction α can be transformed into a quasi-periodic non-simple continued fraction having period length one. Moreover, a certain kind of quasi-periodic non-simple continued fraction is equivalent to a quasi-periodic N-continued fraction. The results of this paper follow from arguments of Burger et al. but we apply our version to offer new continued fractions for certain classes of real numbers.     

An algorithm of infinite sums representations and Tasoev continued fractions

For any given real number, its corresponding continued fraction is unique. However, given an arbitrary continued fraction, there has been no general way to identify its corresponding real number. In this paper we shall show a general algorithm from continued fractions to real numbers via infinite sums representations. Using this algorithm, we obtain some new Tasoev continued fractions.

     

用链式模型讨论圣文南原理

用泛函分析的双空间理论为计算力学构造卫一个严密的背景理论,以此在链式模型上讨论圣南原理,同时将传统的连分数扩展为算子连分式作为链式模型的本征关系式,平衡力系的影响在链式模型上由近及远扩衰减受算子边分式的收敛性的控制,所以南原理的合理成分体现为算子连分式的收敛性,发散的算子连分式对应着平衡力系的明显非零的影响可以传达到无穷远的场合,所以“圣南原理”并不是普遍成立的原理。     

THE LIMITING CASE OF THIELE'S INTERPOLATING CONTINUED FRACTION EXPANSION

1. IntroductionWhen we talk abode the interpolation by polynomials, it is natural for us to have at heatthe Lagrange interpolation, the Heedte interpolation aam the Newton interPOlation. Of theSeinterpolats, the Newton interpolating polyno~ is probably most favourite because of itsadVantages in carrying out compilations and performing ~s. As we know, a Newton interpolating polynondal is established on the basis of the divided ~, whose recursivecalculation maal it possible that the Newton i…     

Some general theorems on the explicit evaluations of Ramanujan''s cubic continued fraction

In 2001, Jinhee Yi found many explicit values of the famous Rogers–Ramanujan continued fraction by using modular equations and transformation formulas for theta-functions. In this paper, we use her method to find some general theorems for the explicit evaluations of Ramanujan's cubic continued fraction.     

二元混合连分式展开的混合差商极限方法

For a univariate function given by its Taylor series expansion,a continuedfraction expansion can be obtained with the Viscovatov's algorithm,as the limitingvalue of a Thiele interpolating continued fraction or by means of the determinantalformulas for inverse and reciprocal differences with coincident data points.In thispaper,both Viscovatov-like algorithms and Taylor-like expansions are incorporatedto yield bivariate blending continued expansions which are computed as the limitingvalue of bivariate blending rational interpolants,which are constructed based on sym-metric blending differences.Numerical examples are given to show the effectivenessof our methods.     

On some generalizations of Ramanujan’s continued fraction identities

In this note we establish continued fraction developments for the ratios of the basic hypergeometric function₂ϕ₁(a,b;c;x) with several of its contiguous functions. We thus generalize and give a unified approach to establishing several continued fraction identities including those of Srinivasa Ramanujan.     

连幂式插值

根据连续幂指形式的函数,提出了连续幂指形式的函数插值的概念,简称连幂式插值,用构造式方法得到了满足插值条件的连幂式插值函数。最后,通过一个算例与连分式插值函数做了对比。     

Analysis of generalized continued fraction algorithms over polynomials

We study and compare natural generalizations of Euclid's algorithm for polynomials with coefficients in a finite field. This leads to gcd algorithms together with their associated continued fraction maps. The gcd algorithms act on triples of polynomials and rely on two-dimensional versions of the Brun, Jacobi–Perron and fully subtractive continued fraction maps, respectively. We first provide a unified framework for these algorithms and their associated continued fraction maps. We then analyse various costs for the gcd algorithms, including the number of iterations and two versions of the bit-complexity, corresponding to two representations of polynomials (the usual and the sparse one). We also study the associated two-dimensional continued fraction maps and prove the invariance and the ergodicity of the Haar measure. We deduce corresponding estimates for the costs of truncated trajectories under the action of these continued fraction maps, obtained thanks to their transfer operators, and we compare the two models (gcd algorithms and their associated continued fraction maps). Proving that the generating functions appear as dominant eigenvalues of the transfer operator allows indeed a fine comparison between the models.     

Engel连分数展式中的若干度量性质

摘要：研究了Engel连分数展式的度量性质．与普通连分数一样，证明了部分商的增长性满足0-1率．通过构造一族恰当的集合，得到了部分商增长速度的上下极限．     

The theta group and the continued fraction expansion with even partial quotients

F. Schweiger introduced the continued fraction with even partial quotients. We will show a relation between closed geodesics for the theta group (the subgroup of the modular group generated by z+2 and -1 / z) and the continued fraction with even partial quotients. Using thermodynamic formalism, Tauberian results and the above-mentioned relation, we obtain the asymptotic growth number of closed trajectories for the theta group. Several results for the continued fraction expansion with even partial quotients are obtained; some of these are analogous to those already known for the usual continued fraction expansion related to the modular group, but our proofs are by necessity in general technically more difficult.Supported by The Netherlands Organization for Scientific Research (NWO).     

On Ramanujan's continued fraction for

The continued fraction in the title is perhaps the deepest of Ramanujan's -continued fractions. We give a new proof of this continued fraction, more elementary and shorter than the only known proof by Andrews, Berndt, Jacobsen, and Lamphere. On page 45 in his lost notebook, Ramanujan states an asymptotic formula for a continued fraction generalizing that in the title. The second main goal of this paper is to prove this asymptotic formula.

     

On a New Continued Fraction Expansion with Non-Decreasing Partial Quotients

We investigate metric properties of the digits occurring in a new continued fraction expansion with non-decreasing partial quotients, the so-called Engel continued fraction (ECF) expansion.     

On a New Continued Fraction Expansion with Non-Decreasing Partial Quotients

We investigate metric properties of the digits occurring in a new continued fraction expansion with non-decreasing partial quotients, the so-called Engel continued fraction (ECF) expansion.