Method for extracting arbitrarily large orbital equations of the Pincherle map
Author(s) -
Jason A. C. Gallas
Publication year - 2016
Publication title -
results in physics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.743
H-Index - 56
ISSN - 2211-3797
DOI - 10.1016/j.rinp.2016.08.005
Subject(s) - chaotic , kernel (algebra) , factorization , phase space , polynomial , orbit (dynamics) , cluster (spacecraft) , mathematics , equations of motion , algorithm , computer science , mathematical analysis , discrete mathematics , artificial intelligence , physics , classical mechanics , engineering , thermodynamics , programming language , aerospace engineering
We report an algorithm to extract equations of motion for orbits of arbitrarily high periods generated by iteration of the Pincherle map, the operational kernel used in the so-called chaotic computers. The performance of the algorithm is illustrated explicitly by extracting expeditiously, among others, an orbit buried inside a polynomial cluster of equations with degree exceeding one billion, out of reach by ordinary brute-force factorization. Large polynomial clusters are responsible for the organization of the phase-space and knowledge of this organization requires decomposing such clusters. (C) 2016 The Author(s). Published by Elsevier B.V
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom