An algorithm for detecting Directional Quasi–Convexity
preprint
posted on 2005-07-29, 14:22 authored by Holger R. Dullin, Francesco FassoDirectional Quasi–Convexity (DQC) is a sufficient condition for Nekhoroshev stability, that
is, stability for finite but very long times, of elliptic equilibria of Hamiltonian systems. The
numerical detection of DQC is elementary for system with three degrees of freedom. In this
article, we propose a recursive algorithm to test DQC in any number n 4 of degrees of freedom.
History
School
- Science
Department
- Mathematical Sciences
Pages
242000 bytesPublication date
2003Notes
This pre-print has been submitted, and accepted to the journal, Bit Numerical Mathematics [© Kluwer (Springer)]. The definitive version: DULLIN, H. and FASSO, F., 2004. An algorithm for detecting Directional Quasi–Convexity. Bit Numerical Mathematics, 44(3), pp. 571-584, is available at: http://www.springerlink.com/openurl.asp?genre=journal&issn=0006-3835.Language
- en
