Deakin University
Browse

File(s) not publicly available

Constructing permutations that approximate lebesgue measure preserving dynamical systems under spatial discretization

Version 2 2024-06-04, 02:37
Version 1 2021-10-21, 17:09
journal contribution
posted on 2024-06-04, 02:37 authored by PE Kloeden, Jamie MustardJamie Mustard
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.

History

Journal

International Journal of Bifurcation and Chaos

Volume

07

Pagination

401-406

Location

Singapore

ISSN

0218-1274

eISSN

1793-6551

Language

eng

Publication classification

C1.1 Refereed article in a scholarly journal

Issue

02

Publisher

World Scientific Publishing

Usage metrics

    Research Publications

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC