• Corpus ID: 119304766

An efficient method for the computation of the Feigenbaum constants to high precision

@article{Molteni2016AnEM,
  title={An efficient method for the computation of the Feigenbaum constants to high precision},
  author={Andrea Molteni},
  journal={arXiv: Dynamical Systems},
  year={2016}
}
  • A. Molteni
  • Published 7 February 2016
  • Computer Science
  • arXiv: Dynamical Systems
We propose a new practical algorithm for computing the Feigenbaum constants {\alpha} and {\delta}, having significantly lower time and space complexity than previously used methods. The algorithm builds upon well-known linear algebra techniques, and is easily parallelizable. An implementation of it has been developed and used to determine both constants to 10,000 decimal places. 
View PDF on arXiv
1 Citations
Methods Citations
1

Tables from this paper

One Citation

Citation Type

Citation Type

Rigorous computer-assisted bounds on renormalisation fixed point functions, eigenfunctions, and universal constants
We gain tight rigorous bounds on the renormalisation fixed point function for period doubling in families of unimodal maps with degree 2 critical point. By writing the relevant eigenproblems in a…

References

SHOWING 1-10 OF 23 REFERENCES
A precise calculation of the Feigenbaum constants
The Feigenbaum constants arise in the theory of iteration of real functions. We calculate here to high precision the constants ca and 5 associated with period-doubling bifurcations for maps with a…
A Polynomial Time, Numerically Stable Integer Relation Algorithm
TLDR
It is proved in this paper that the PSLQ algorithm terminates with a relation in a number of iterations that is bounded by a polynomial in it, and this stability can be used to prove that relation bounds obtained from computer runs using this algorithm are numerically accurate.
A Class of Methods for Solving Nonlinear Simultaneous Equations
solution. The functions that require zeroing are real functions of real variables and it will be assumed that they are continuous and differentiable with respect to these variables. In many practical…
MPFR: A multiple-precision binary floating-point library with correct rounding
This article presents a multiple-precision binary floating-point library, written in the ISO C language, and based on the GNU MP library. Its particularity is to extend to arbitrary-precision, ideas…
The principle of minimized iterations in the solution of the matrix eigenvalue problem
An interpretation of Dr. Cornelius Lanczos' iteration method, which he has named "minimized iterations", is discussed in this article, expounding the method as applied to the solution of the…
An inverse column-updating method for solving large–scale nonlinear systems of equations
In this paper we introduce a new quasi-Newton method for solving large-scale nonlinear systems of equations. The new method proceeds, at each iteration, changing one column of the inverse Jacobian…
Sequential estimation techniques for quasi-newton algorithms.
TLDR
Analysis is presented which shows that the algorithm implemented in this thesis is globally and Q-superlinearly convergent, and compares favorably with Powell''s very successful MINFA.
Schnelle Multiplikation großer Zahlen
ZusammenfassungEs wird ein Algorithmus zur Berechnung des Produktes von zweiN-stelligen Dualzahlen angegeben. Zwei Arten der Realisierung werden betrachtet: Turingmaschinen mit mehreren Bändern und…
Solving Systems of Nonlinear Equations by Tensor Methods.
TLDR
Computational results are presented that indicate that both tensor methods are consistently at least as reliable as the corresponding linear model based methods, and are significantly more efficient, both on nonsingular and on singular test problems.
Quantitative universality for a class of nonlinear transformations
AbstractA large class of recursion relationsxn + 1 = λf(xn) exhibiting infinite bifurcation is shown to possess a rich quantitative structure essentially independent of the recursion function. The…
...
1
2
3
...