Zobrazeno 1 - 10
of 212
pro vyhledávání: '"Just, Wolfram"'
Building on tools that have been successfully used in the study of rational billiards, such as induced maps and interval exchange transformations, we provide a construction of a one-parameter family of isosceles triangles exhibiting non-periodic traj
Externí odkaz:
http://arxiv.org/abs/2406.17734
Extended dynamic mode decomposition (EDMD) is a data-driven algorithm for approximating spectral data of the Koopman operator associated to a dynamical system, combining a Galerkin method of order N and collocation method of order M. Spectral converg
Externí odkaz:
http://arxiv.org/abs/2404.08512
We show that spectral data of the Koopman operator arising from an analytic expanding circle map $\tau$ can be effectively calculated using an EDMD-type algorithm combining a collocation method of order m with a Galerkin method of order n. The main r
Externí odkaz:
http://arxiv.org/abs/2308.01467
A complete description of resonances for rational toral Anosov diffeomorphisms preserving certain Reinhardt domains is presented. As a consequence it is shown that every homotopy class of two-dimensional Anosov diffeomorphisms contains maps with the
Externí odkaz:
http://arxiv.org/abs/2211.05925
Publikováno v:
In Applied and Computational Harmonic Analysis November 2024 73
This paper presents a framework to perform bifurcation analysis in laboratory experiments or simulations. We employ control-based continuation to study the dynamics of a macroscopic variable of a microscopically defined model, exploring the potential
Externí odkaz:
http://arxiv.org/abs/2203.02484
Extended dynamic mode decomposition (EDMD) provides a class of algorithms to identify patterns and effective degrees of freedom in complex dynamical systems. We show that the modes identified by EDMD correspond to those of compact Perron-Frobenius an
Externí odkaz:
http://arxiv.org/abs/1905.09266
Publikováno v:
In Physica D: Nonlinear Phenomena March 2023 445
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Lacasa, Lucas, Just, Wolfram
Visibility algorithms are a family of geometric and ordering criteria by which a real-valued time series of N data is mapped into a graph of N nodes. This graph has been shown to often inherit in its topology non-trivial properties of the series stru
Externí odkaz:
http://arxiv.org/abs/1704.06467