2 citations · 3 across the 2 of their papers we have counts for
3 papers
math.DS2014★ 2 cited
Computing a Solution of Feigenbaum's Functional Equation in Polynomial Time
Peter Hertling, Christoph Spandl
Lanford has shown that Feigenbaum's functional equation has an analytic solution. We show that this solution is a polynomial time computable function. This implies in particular th…
cs.MS2010★ 1 cited
Computational Complexity of Iterated Maps on the Interval (Extended Abstract)
Christoph Spandl
The exact computation of orbits of discrete dynamical systems on the interval is considered. Therefore, a multiple-precision floating point approach based on error analysis is chos…
math.NA2010
Computational Complexity of Iterated Maps on the Interval
Christoph Spandl
The correct computation of orbits of discrete dynamical systems on the interval is considered. Therefore, an arbitrary-precision floating-point approach based on automatic error an…