Recursive computation of invariant distributions of Feller processes

This paper provides a general and abstract approach to compute invariant distributions for Feller processes. More precisely, we show that the recursive algorithm presented in Lamberton and Pagès (2002) and based on simulation algorithms of stochastic schemes with decreasing steps can be used to build invariant measures for general Feller processes. We also propose various applications: Approximation of Markov Brownian diffusion stationary regimes with a Milstein or an Euler scheme and approximation of a Markov switching Brownian diffusion stationary regimes using an Euler scheme.