Computational complexity of iterated maps on the interval

Christoph Spandl

Mathematics and Computers in Simulation (MATCOM), 2012, vol. 82, issue 8, 1459-1477

Abstract: 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 analysis is chosen and a general algorithm is presented. The correctness of the algorithm is shown and the computational complexity is analyzed. There are two main results. First, the computational complexity measure considered here is related to the Lyapunov exponent of the dynamical system under consideration. Second, the presented algorithm is optimal with regard to that complexity measure.

Keywords: Discrete dynamical systems; Lyapunov exponent; Arbitrary-precision floating-point arithmetic (search for similar items in EconPapers)
Date: 2012
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378475412000274
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:matcom:v:82:y:2012:i:8:p:1459-1477

DOI: 10.1016/j.matcom.2012.02.003

Access Statistics for this article

Mathematics and Computers in Simulation (MATCOM) is currently edited by Robert Beauwens

More articles in Mathematics and Computers in Simulation (MATCOM) from Elsevier
Bibliographic data for series maintained by Catherine Liu ().