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={A. Molteni},
  journal={arXiv: Dynamical Systems},
  year={2016}
}
  • A. Molteni
  • Published 2016
  • Mathematics
  • 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

References

SHOWING 1-10 OF 23 REFERENCES
A precise calculation of the Feigenbaum constants
A Polynomial Time, Numerically Stable Integer Relation Algorithm
A Class of Methods for Solving Nonlinear Simultaneous Equations
MPFR: A multiple-precision binary floating-point library with correct rounding
The principle of minimized iterations in the solution of the matrix eigenvalue problem
An inverse column-updating method for solving large–scale nonlinear systems of equations
Sequential estimation techniques for quasi-newton algorithms.
Schnelle Multiplikation großer Zahlen
Solving Systems of Nonlinear Equations by Tensor Methods.
Quantitative universality for a class of nonlinear transformations
...
1
2
3
...