Constructing Permutations that Approximate Lebesgue Measure Preserving Dynamical Systems Under Spatial Discretization

A discrete-time dynamical system can sometimes display quite different dynamical behavior under spatial discretization. Systems generated by maps for which the Lebesgue measure is invariant are, however, robust in the sense that they can be approximated by permutations on a uniform lattice. A fast algorithm to construct such permutations is presented here and its implementation is illustrated with several examples of well–known one and two dimensional systems.