Abstract
Two basic problems of dynamics, one of which was tackled in the extensive work of Z. Kopal (see e.g. Kopal, 1978, Dynamics of Close Binary Systems, D. Reidel Publication, Dordrecht, Holland.), are presented with their approximate general solutions. The ‘penetration’ into the space of solution of these non-integrable autonomous and conservative systems is achieved by application of ‘The Last Geometric Theorem of Poincare’ (Birkhoff, 1913, Am. Math. Soc. (rev. edn. 1966)) and the calculation of sub-sets of ‘solutions precieuses’ that are covering densely the spaces of all solutions (non-periodic and periodic) of these problems. The treated problems are: 1. The two-dimensional Duffing problem, 2. The restricted problem around the Roche limit. The approximate general solutions are developed by applying known techniques by means of which all solutions re-entering after one, two, three, etc, revolutions are, first, located and then calculated with precision. The properties of these general solutions, such as the morphology of their constituent periodic solutions and their stability for both problems are discussed. Calculations of Poincare sections verify the presence of chaos, but this does not bear on the computability of the general solutions of the problems treated. The procedure applied seems efficient and sufficient for developing approximate general solutions of conservative and autonomous dynamical systems that fulfil the Poincare-Birkhoff theorems. The same procedure does not apply to the sub-set of unbounded solutions of these problems.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.