arXiv:1307.5920 Abstract | arXiv Analytics

arXiv:1307.5920 [math.DS]Abstract References Reviews Resources

Random iteration and projection method

Published 2013-07-23Version 1

We show that under suitable conditions a random orbit generated by a system of nonexpansive maps recovers an invariant set via its omega-limit. In particular, this explains what happens to the Kaczmarz--von Neumann projection algorithm in the infeasible case, that is, when one deals with more than two affine varieties having empty intersection.

Comments: 4 figures

Categories: math.DS

Keywords: projection method, random iteration, kaczmarz-von neumann projection algorithm, invariant set, empty intersection

Related articles: Most relevant | Search more

arXiv:2008.04831 [math.DS] (Published 2020-08-11)

Random iterations of paracontraction maps and applications to feasibility problems

Edgar Matias, Majela Pentón Machado

arXiv:1501.03319 [math.DS] (Published 2015-01-14)

Random Iteration of Maps on a Cylinder and diffusive behavior

O. Castejón, V. Kaloshin

arXiv:2104.00110 [math.DS] (Published 2021-03-31)

Renormalization in Lorenz maps -- completely invariant sets and periodic orbits