A Method for Solving Polynomial Equations by Continued Fractions

1974 ◽  
Vol C-23 (10) ◽  
pp. 1093-1097 ◽  
Author(s):  
A. Bracha-Barak
Author(s):  
Mykola Nedashkovskyy

A new general approach for solving matrix polynomial equations of arbitrary order with matrix or vector unknowns is proposed in the work with the use of nested continued fractions.


Mathematics ◽  
2021 ◽  
Vol 9 (3) ◽  
pp. 255
Author(s):  
Dan Lascu ◽  
Gabriela Ileana Sebe

We investigate the efficiency of several types of continued fraction expansions of a number in the unit interval using a generalization of Lochs theorem from 1964. Thus, we aim to compare the efficiency by describing the rate at which the digits of one number-theoretic expansion determine those of another. We study Chan’s continued fractions, θ-expansions, N-continued fractions, and Rényi-type continued fractions. A central role in fulfilling our goal is played by the entropy of the absolutely continuous invariant probability measures of the associated dynamical systems.


Entropy ◽  
2021 ◽  
Vol 23 (7) ◽  
pp. 840
Author(s):  
Maxim Sølund Kirsebom

The Hurwitz complex continued fraction is a generalization of the nearest integer continued fraction. In this paper, we prove various results concerning extremes of the modulus of Hurwitz complex continued fraction digits. This includes a Poisson law and an extreme value law. The results are based on cusp estimates of the invariant measure about which information is still limited. In the process, we obtained several results concerning the extremes of nearest integer continued fractions as well.


1997 ◽  
Vol 119 (2) ◽  
pp. 275-283 ◽  
Author(s):  
Takashi Maekawa ◽  
Wonjoon Cho ◽  
Nicholas M. Patrikalakis

Self-intersection of offsets of regular Be´zier surface patches due to local differential geometry and global distance function properties is investigated. The problem of computing starting points for tracing self-intersection curves of offsets is formulated in terms of a system of nonlinear polynomial equations and solved robustly by the interval projected polyhedron algorithm. Trivial solutions are excluded by evaluating the normal bounding pyramids of the surface subpatches mapped from the parameter boxes computed by the polynomial solver with a coarse tolerance. A technique to detect and trace self-intersection curve loops in the parameter domain is also discussed. The method has been successfully tested in tracing complex self-intersection curves of offsets of Be´zier surface patches. Examples illustrate the principal features and robustness characteristics of the method.


1979 ◽  
Vol 89 ◽  
pp. 95-101
Author(s):  
S. Mikkola

A continued fraction was derived for the summation of the asymptotic expansion of astronomical refraction. Using simple approximations for the last denominator of the fraction, accurate formulae, useful down to the horizon, were obtained. The method is not restricted to any model of the atmosphere and can thus be used in calculations based on actual aerological measurements.


Sign in / Sign up

Export Citation Format

Share Document