Continued Fractions

Lecture notes

Continued fractions built from convex sets and convex functions

In a partially ordered semigroup with the duality (or polarity) transform, it is pos- sible to define a generalisation of continued fractions. General sufficient conditions for convergence of continued fractions are provided. Two particular applications concern the cases of convex sets with the Minkowski addition and the polarity transform and the family of non-negative convex functions with the Legendre–Fenchel and Artstein-Avidan–Milman transforms.

An algorithm for the solution of a quadratic equation using continued fractions /

Thesis (M. S.)--University of Illinois at Urbana-Champaign, 1972.

Further negative results regarding the use of continued fractions for digital computer arithmetic /

Mode of access: Internet.

On a negative result regarding the use of continued fractions for digital computer arithmetic /

Includes bibliographical references.

The status of investigations into the use of continued fractions for computer hardware /

Bibliography: p. 29.

A method for solving polynomial equations by continued fractions.

Bibliography: p. 16.

Application of continued fractions for fast evaluation of certain functions on a digital computer.

Bibliography: p. 23.

Optimization of Rational Approximations by Continued Fractions

The paper has been presented at the 12th International Conference on Applications of Computer Algebra, Varna, Bulgaria, June, 2006.

Polynomials of Pellian Type and Continued Fractions

We investigate infinite families of integral quadratic polynomials {fk (X)} k∈N and show that, for a fixed k ∈ N and arbitrary X ∈ N, the period length of the simple continued fraction expansion of √fk (X) is constant. Furthermore, we show that the period lengths of √fk (X) go to infinity with k. For each member of the families involved, we show how to determine, in an easy fashion, the fundamental unit of the underlying quadratic field. We also demonstrate how the simple continued fraction ex- pansion of √fk (X) is related to that of √C, where √fk (X) = ak*X^2 +bk*X + C. This continues work in [1]–[4].

The Q-D algorithm for transforming series expansions into a corresponding continued fraction: an extension to cope with zero coefficients

An algorithm for deriving a continued fraction that corresponds to two series expansions simultaneously, when there are zero coefficients in one or both series, is given. It is based on using the Q-D algorithm to derive the corresponding fraction for two related series, and then transforming it into the required continued fraction. Two examples are given. (C) 2003 Elsevier B.V. All rights reserved.

Some Extensions of M-Fractions Related to Strong Stieltjes Distributions

The purpose of this paper is to show the symmetric relations that appear between the coefficients of some even and odd extensions of the M-fractions related to a certain kind of symmetric strong Stieltjes distribution.

Converse results to the Wiener attack on RSA

A well-known attack on RSA with low secret-exponent d was given by Wiener about 15 years ago. Wiener showed that using continued fractions, one can efficiently recover the secret-exponent d from the public key (N,e) as long as d < N 1/4. Interestingly, Wiener stated that his attack may sometimes also work when d is slightly larger than N 1/4. This raises the question of how much larger d can be: could the attack work with non-negligible probability for d=N 1/4 + ρ for some constant ρ > 0? We answer this question in the negative by proving a converse to Wiener’s result. Our result shows that, for any fixed ε > 0 and all sufficiently large modulus lengths, Wiener’s attack succeeds with negligible probability over a random choice of d < N δ (in an interval of size Ω(N δ )) as soon as δ > 1/4 + ε. Thus Wiener’s success bound d 1/4. The known attacks in this class (by Verheul and Van Tilborg and Dujella) run in exponential time, so it is natural to ask whether there exists an attack in this class with subexponential run-time. Our second converse result answers this question also in the negative.

反射地震转换波成像方法研究

Multi-waves and multi-component get more and more attentions from oil industry. On the basis of existent research results, My research focuses on some key steps of OBC 4C datum processing. OBC datum must be preprocessed quite well for getting a good image. We show a flow chart of preprocess including attenuation of noise on multi-component datum、elimination ghost by summing P and Z and rotation of horizontal components. This is a good foundation for the coming steps about OBC processing. How to get exact converted point location and to analyze velocity are key points in processing reflection seismic converted wave data. This paper includes computing converted point location, analyzing velocity and nonhyperbolic moveout about converted waves. Anisotropic affects deeply the location of converted wave and the nonhyperbolic moveout. Supposed VTI, we research anisotropic effect on converted wave location and the moveout. Since Vp/Vs is important, we research the compute method of Vp/Vs from post-stack data and pre-stack data. It is a part of the paper that inversing anisotropic parameter by traveltime. Pre-stack time migration of converted wave is an focus, using common-offset Kirchhoff migration, we research the velocity model updating in anisotropic media. I have achieved the following results: 1) using continued Fractions, we proposed a new converted point approximate equation, when the offset is long enough ,the thomsen’s 2 order equation can’t approximate to the exact location of converted point, our equation is a good approximate for the exact location. 2) our new methods about scanning nonhyperbolic velocity and Vp/Vs can get a high quality energy spectrum. And the new moveout can fit the middle and long offset events. Processing the field data get a good result. 3) a new moveout equation, which have the same form as Alkhalifah’s long offset P wave moveout equation, have the same degree preciseness as thomsen’s moveout equation by testing model data. 4) using c as a function of the ratio offset to depth, we can uniform the Li’s and thomsen’s moveout equation in a same equation, the model test tell us choice the reasonable function C can improve the exact degree of Li’s and thomsen’s equation. 5) using traveltime inversion ,we can get anisotropic parameter, which can help to flat the large offset event and propose a model of anisotropic parameter which will useful for converted wave pre-stack time migration in anisotropic media. 6）using our pre-stack time migration method and flow, we can update the velocity model and anisotropic parameter model then get good image. Key words: OBC, Common converted Point (CCP), Nonhyperbolic moveout equation, Normal moveout correction, Velocity analysis, Anisotropic parameters inversion, Kirchhoff anisotropic pre-stack time migration, migration velocity model updating

Escape times for rigid Brownian rotators in a bistable potential from the time evolution of the Green function and the characteristic time of the probability evolution

The greatest relaxation time for an assembly of three- dimensional rigid rotators in an axially symmetric bistable potential is obtained exactly in terms of continued fractions as a sum of the zero frequency decay functions (averages of the Legendre polynomials) of the system. This is accomplished by studying the entire time evolution of the Green function (transition probability) by expanding the time dependent distribution as a Fourier series and proceeding to the zero frequency limit of the Laplace transform of that distribution. The procedure is entirely analogous to the calculation of the characteristic time of the probability evolution (the integral of the configuration space probability density function with respect to the position co-ordinate) for a particle undergoing translational diffusion in a potential; a concept originally used by Malakhov and Pankratov (Physica A 229 (1996) 109). This procedure allowed them to obtain exact solutions of the Kramers one-dimensional translational escape rate problem for piecewise parabolic potentials. The solution was accomplished by posing the problem in terms of the appropriate Sturm-Liouville equation which could be solved in terms of the parabolic cylinder functions. The method (as applied to rotational problems and posed in terms of recurrence relations for the decay functions, i.e., the Brinkman approach c.f. Blomberg, Physica A 86 (1977) 49, as opposed to the Sturm-Liouville one) demonstrates clearly that the greatest relaxation time unlike the integral relaxation time which is governed by a single decay function (albeit coupled to all the others in non-linear fashion via the underlying recurrence relation) is governed by a sum of decay functions. The method is easily generalized to multidimensional state spaces by matrix continued fraction methods allowing one to treat non-axially symmetric potentials, where the distribution function is governed by two state variables. (C) 2001 Elsevier Science B.V. All rights reserved.