Deciding the point-to-fixed-point problem for skew tent maps on an interval

We consider a family of skew tent maps f(a) on the unit interval, determined by the parameter a, with 0 < a < 1. We give a decision procedure, that on input a and a point x(0) in the unit interval, determines whether or not the sequence x(0), f(a)(x(0)), f(a)(2)(x(0)), ... of iterates of f(a) on x(0) reaches one of the two fixed points of f(a) after a finite number of iterations. (C) 2020 Elsevier Inc. All rights reserved.

Jaar van publicatie:2021

Trefwoorden:Dynamic systems, Decision algorithm, Fixed points

BOF-keylabel:ja

IOF-keylabel:ja

BOF-publication weight:0.5

Authors from:Higher Education

Toegankelijkheid:Open