Clustering Algorithm for Generalized Recurrences using Complete Lyapunov Functions

DOI10.5220/0007934101380146OpenAlexW2967453719MaRDI QIDQ6180885FDOQ6180885

Authors: Carlos Argáez, Peter Giesl, Sigurdur Hafstein 

Publication date: 2 January 2024

Published in: Proceedings of the 16th International Conference on Informatics in Control, Automation and Robotics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.5220/0007934101380146

Recommendations

• An algorithm for clustering of the phase trajectory of a dynamic system
• Common Lyapunov function approach to matrix root clustering
• Clustering Using Cyclic Spaces of Reversible Cellular Automata
• scientific article; zbMATH DE number 3965269
• scientific article; zbMATH DE number 4045215
• On a class of dynamical systems with emerging cluster structure
• Eigenvalue clustering in subregions of the complex plane for interval dynamic systems
• Clustering and synchronization with positive Lyapunov exponents
• Clustering for algebraic \(K\)-systems

zbMATH Keywords

mathematicsdynamical systemsclustering algorithmchain-recurrent setcomplete Lyapunov functions

Mathematics Subject Classification ID

Lyapunov and storage functions (93D30) Periodic, homoclinic and heteroclinic orbits of finite-dimensional Hamiltonian systems (37J46)

Cited In (3)

• Clustering Using Cyclic Spaces of Reversible Cellular Automata
• Title not available (Why is that?)
• Cycle based clustering using reversible cellular automata

This page was built for publication: Clustering Algorithm for Generalized Recurrences using Complete Lyapunov Functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6180885)