On the rate of convergence to the neutral attractor of a family of one-dimensional maps

T. Nowicki, et al. "On the rate of convergence to the neutral attractor of a family of one-dimensional maps." Fundamenta Mathematicae 206.1 (2009): 253-269. <http://eudml.org/doc/282715>.

@article{T2009,
abstract = {For a family of maps $f_\{d\}(p) = 1 - (1-p/d)^\{d\}$, d ∈ [2,∞], p ∈ [0,1]. we analyze the speed of convergence (including constants) to the globally attracting neutral fixed point p = 0. The study is motivated by a problem in the optimization of routing. The aim of this paper is twofold: (1) to extend the usage of dynamical systems to unexplored areas of algorithms and (2) to provide a toolbox for a precise analysis of the iterates near a non-degenerate neutral fixed point.},
author = {T. Nowicki, M. Sviridenko, G. Świrszcz, S. Winograd},
journal = {Fundamenta Mathematicae},
keywords = {neutral attractor; assignment problem; dynamics in algorithms},
language = {eng},
number = {1},
pages = {253-269},
title = {On the rate of convergence to the neutral attractor of a family of one-dimensional maps},
url = {http://eudml.org/doc/282715},
volume = {206},
year = {2009},
}

TY - JOUR
AU - T. Nowicki
AU - M. Sviridenko
AU - G. Świrszcz
AU - S. Winograd
TI - On the rate of convergence to the neutral attractor of a family of one-dimensional maps
JO - Fundamenta Mathematicae
PY - 2009
VL - 206
IS - 1
SP - 253
EP - 269
AB - For a family of maps $f_{d}(p) = 1 - (1-p/d)^{d}$, d ∈ [2,∞], p ∈ [0,1]. we analyze the speed of convergence (including constants) to the globally attracting neutral fixed point p = 0. The study is motivated by a problem in the optimization of routing. The aim of this paper is twofold: (1) to extend the usage of dynamical systems to unexplored areas of algorithms and (2) to provide a toolbox for a precise analysis of the iterates near a non-degenerate neutral fixed point.
LA - eng
KW - neutral attractor; assignment problem; dynamics in algorithms
UR - http://eudml.org/doc/282715
ER -