Search NASA⌕ Search

SEARCH · Search NASA

Results for “Symplectic maps”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Isochronous and period-doubling diagrams for symplectic maps of the plane

Symplectic mappings of the plane serve as key models for exploring the fundamental nature of complex behavior in nonlinear systems. Central to this exploration is the effective visualization of stability regimes, which enables the interpretation of how systems evolve under varying conditions. While the area-preserving quadratic Hénon map has received significant theoretical attention, a comprehensive description of its mixed parameter-space dynamics remain lacking. This limitation arises from early attempts to reduce the full two-dimensional phase space to a one-dimensional projection, a simplification that resulted in the loss of important dynamical features. Consequently, there is a clear need for a more thorough understanding of the underlying qualitative aspects. This paper aims to address this gap by revisiting the foundational concepts of reversibility and associated symmetries, first explored in the early works of G.D. Birkhoff. We extend the original framework proposed by Hénon by adding a period-doubling diagram to his isochronous diagram, which allows to represents the system’s bifurcations and the groups of symmetric periodic orbits that emerge in typical bifurcations of the fixed point. A qualitative and quantitative explanation of the main features of the region of parameters with bounded motion is provided, along with the application of this technique to other symplectic mappings, including cases of multiple reversibility. Modern chaos indicators, such as the Reversibility Error Method (REM) and the Generalized Alignment Index (GALI), are employed to distinguish between various dynamical regimes in the mixed space of variables and parameters. These tools prove effective in differentiating regular and chaotic dynamics, as well as in identifying twistless orbits and their associated bifurcations. Additionally, we discuss the application of these methods to real-world problems, such as visualizing dynamic aperture in accelerator physics, where our findings have direct relevance.

43 PARTICLE ACCELERATORS↗
DOE OSTI2021

A new method to compute periodic orbits in general symplectic maps

The search of high-order periodic orbits has been typically restricted to problems with symmetries that help to reduce the dimension of the search space. Well-known examples include reversible maps with symmetry lines. The present work proposes a new method to compute high-order periodic orbits in twist maps without the use of symmetries. The method is a combination of the parameterization method in Fourier space and a Newton–Gauss multiple shooting scheme. The parameterization method has been successfully used in the past to compute quasi-periodic invariant circles. However, this is the first time that this method is used in the context of periodic orbits. Numerical examples are presented showing the accuracy and efficiency of the proposed method. Furthermore, the method is also applied to verify the renormalization prediction of the residues’ convergence at criticality (extensively studied in reversible maps) in the relatively unexplored case of maps without symmetries.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2024

Machine-assisted discovery of integrable symplectic mappings

Integrable systems possess a hidden symmetry associated with the existence of conserved quantities known as integrals of motion. These systems play an important role in understanding general dynamics in accelerators and have potential for future designs. This work will cover two automated methods for finding integrable symplectic maps of the plane. The first algorithm is based on the observation that the evolution of an integrable system in phase space is confined to a lower-dimensional submanifold of a specific type. The second algorithm relies on an analysis of dynamical variables. Both methods rediscover some of the famous McMillan-Suris integrable mappings and ultra-discrete Painlev\'e equations. Over 100 new integrable families are presented and analyzed, some of which are isolated in the space of parameters, while others are families with one parameter (or the ratio of parameters) being either continuous or discrete. In addition, the newly discovered maps are related to a general 2D symplectic map through the use of discrete perturbation theory. A method is proposed for constructing smooth near-integrable dynamical systems based on mappings with polygon invariants.

43 PARTICLE ACCELERATORS↗
DOE OSTI2024

Machine-Assisted Discovery of Integrable Symplectic Mappings

Integrable systems possess a hidden symmetry associated with the existence of conserved quantities known as integrals of motion. These systems play an important role in understanding general dynamics in accelerators and have potential for future designs. This work will cover two automated methods for finding integrable symplectic maps of the plane. The first algorithm is based on the observation that the evolution of an integrable system in phase space is confined to a lower-dimensional submanifold of a specific type. The second algorithm relies on an analysis of dynamical variables. Both methods rediscover some of the famous McMillan-Suris integrable mappings and ultra-discrete Painlev\'e equations. Over 100 new integrable families are presented and analyzed, some of which are isolated in the space of parameters, while others are families with one parameter (or the ratio of parameters) being either continuous or discrete. In addition, the newly discovered maps are related to a general 2D symplectic map through the use of discrete perturbation theory. A method is proposed for constructing smooth near-integrable dynamical systems based on mappings with polygon invariants.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2025

Extracting symplectic maps for space-charge dominated beams

Symplecticity of transfer maps is important for reliable evaluation of space-charge dominated beams in accelerators. Unfortunately, most simulation codes that include collective effects, such as space charge, do not use canonical phase-space variables and therefore are not symplectic in the presence of electromagnetic fields. In this paper, we present a numerical method to extract local linear symplectic transfer maps using particle tracking simulation code for space-charge dominated beams. We demonstrate this method for the photoinjector (113 MHz SRF gun) section of the Coherent electron Cooling (CeC) Proof of Principle (POP) experiment.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2023

Approximation of nearly-periodic symplectic maps via structure-preserving neural networks

A continuous-time dynamical system with parameter ε is nearly-periodic if all its trajectories are periodic with nowhere-vanishing angular frequency as ε approaches 0. Nearly-periodic maps are discrete-time analogues of nearly-periodic systems, defined as parameter-dependent diffeomorphisms that limit to rotations along a circle action, and they admit formal U(1) symmetries to all orders when the limiting rotation is non-resonant. For Hamiltonian nearly-periodic maps on exact presymplectic manifolds, the formal U(1) symmetry gives rise to a discrete-time adiabatic invariant. In this paper, we construct a novel structure-preserving neural network to approximate nearly-periodic symplectic maps. This neural network architecture, which we call symplectic gyroceptron, ensures that the resulting surrogate map is nearly-periodic and symplectic, and that it gives rise to a discrete-time adiabatic invariant and a long-time stability. This new structure-preserving neural network provides a promising architecture for surrogate modeling of non-dissipative dynamical systems that automatically steps over short timescales without introducing spurious instabilities.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Integrable symplectic maps with a polygon tessellation

Identifying integrable dynamics remains a formidable challenge, and despite centuries of research, only a handful of examples are known to date. In this article, we explore a distinct form of area-preserving (symplectic) mappings derived from the stroboscopic Poincaré cross section of a kicked rotator—an oscillator subjected to an external force periodically switched on in short pulses. The significance of this class of problems extends to various applications in physics and mathematics, including particle accelerators, crystallography, and studies of chaos. Notably, Suris's theorem constrains the integrability within this category of mappings, outlining potential scenarios with analytic invariants of motion. In this paper, we challenge the assumption of the analyticity of the invariant by exploring piecewise linear transformations on a torus ( T 2 ) and associated systems on the plane ( R 2 ), incorporating arithmetic quasiperiodicity and discontinuities. Introducing a new automated technique, we discovered previously unknown scenarios featuring polygonal invariants that form perfect tessellations and, moreover, fibrations of the plane or torus. This work reveals a novel category of planar tilings characterized by discrete symmetries that emerge from the invertibility of transformations and are intrinsically linked to the presence of integrability. Our algorithm relies on the analysis of the Poincaré rotation number and its piecewise monotonic nature for integrable cases, contrasting with the noisy behavior in the case of chaos, thereby allowing for clear separation. Some of the newly discovered systems exhibit the peculiar behavior of “integrable diffusion,” characterized by infinite and quasirandom hopping between tiles while being confined to a set of invariant segments. Finally, through the implementation of a smoothening procedure, all mappings can be generalized to quasi-integrable scenarios with suppressed volume occupied by chaotic trajectories, thereby opening doors to potential practical applications. Published by the American Physical Society 2024

43 PARTICLE ACCELERATORS↗
DOE OSTI2021

Transport Barriers in Symplectic Maps

Chaotic transport is a subject of paramount importance in a variety of problems in plasma physics, specially those related to anomalous transport and turbulence. On the other hand, a great deal of information on chaotic transport can be obtained from simple dynamical systems like two-dimensional area-preserving (symplectic) maps, where powerful mathematical results like KAM theory are available. In this work we review recent works on transport barriers in area-preserving maps, focusing on systems which do not obey the so-called twist property. For such systems KAM theory no longer holds everywhere and novel dynamical features show up as nonresistive reconnection, shearless curves and shearless bifurcations. After presenting some general features using a standard nontwist mapping, we consider magnetic field line maps for magnetically confined plasmas in tokamaks.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS1991

Symplectic maps for the n-body problem

The present study generalizes the mapping method of Wisdom (1982) to encompass all gravitational n-body problems with a dominant central mass. The rationale for the generalized mapping method is discussed as well as details for the mapping for the n-body problem. Some refinements of the method are considered, and the relationship of the mapping method to other symplectic integration methods is shown. The method is used to compute the evolution of the outer planets for a billion years. The resulting evolution is compared to the 845 million year evolution of the outer planets performed on the Digital Orerry using standard numerical integration techniques. This calculation provides independent numerical confirmation of the result of Sussman and Wisdom (1988) that the motion of the planet Pluto is chaotic.

Wisdom, Jack↗
DOE OSTI2023

Code Demonstration: Approximation of nearly-periodic symplectic maps via structure-preserving neural networks

In this notebook, we use the symplectic gyroceptron architecture from [Duruisseaux et al., 2022] to learn a surrogate map for the nearly-periodic symplectic flow map associated to a nearly-periodic Hamiltonian system composed of two nonlinearly coupled oscillators, where one of them oscillates significantly faster than the other: $\Big\lbrace$ $ {\dot{q}_1 = p_1 \hspace{5mm} \dot{p}_1 = -q_1 - \epsilon \partial_{q1}U(q_1 , q_2 )} \atop {\dot{q}_2 = \epsilon p_2 \hspace{4mm} \dot{p}_2 = -\epsilon q_2 - \epsilon \partial_{q2}U(q_1 , q_2 )}$. These equations of motion are the Hamilton's equations associated to the Hamiltonian $H_{\epsilon}(q_1,q_2,p_1,p_2)=\frac{1}{2}(q^2_1+p^2_1)+\frac{1}{2}\epsilon(q^2_2+p^2_2)+\epsilon$$U(q_1,q_2)$.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1992

Symplectic maps for the n-body problem - Stability analysis

The stability of new symplectic n-body maps is examined from the point of view of nonlinear dynamics. The resonances responsible for the principal artifacts are identified. These are resonances between the stepsize and the difference of mean motions between pairs of planets. For larger stepsizes resonant perturbations are evident in the variation of the energy of the system corresponding to these stepsize resonances. It is shown that the principal instability of the method can be predicted and corresponds to the overlap of the stepsize resonances. It is noted that the analysis suggests that other artifacts will occur. For example, the overlap of a stepsize resonance with a resonance of the actual system may also give a region of chaotic behavior that is an artifact. It is pointed out that the fact that the principal artifacts corresponds to a particular set of stepsize resonances suggests that it may be possible to perturbatively remove the effect when the stepsize resonances are nonoverlapping.

Wisdom, Jack↗
DOE OSTI2023

Fringe field maps for symplectic models of general Cartesian dipoles

We present a framework with which to analyze the effects of magnetic fringe fields. The theory defines the fringe field to be the transition between two regions of nearly constant field, and can incorporate constant multipoles in the magnet body. We then analyze Cartesian dipoles and derive symplectic fringe field maps that are applicable to longitudinal and/or transverse gradient dipoles. We verify the fringe maps with tracking, and show how we incorporated the theory into the tracking code ELEGANT. The resulting elements and several supporting scripts are now available for users, and we conclude with several predictions relevant to the APS Upgrade project.

43 PARTICLE ACCELERATORS↗
DOE OSTI2020

SympNets: Intrinsic structure-preserving symplectic networks for identifying Hamiltonian systems

Here, we propose new symplectic networks (SympNets) for identifying Hamiltonian systems from data based on a composition of linear, activation and gradient modules. In particular, we define two classes of SympNets: the LA-SympNets composed of linear and activation modules, and the G-SympNets composed of gradient modules. Correspondingly, we prove two new universal approximation theorems that demonstrate that SympNets can approximate arbitrary symplectic maps based on appropriate activation functions. We then perform several experiments including the pendulum, double pendulum and three-body problems to investigate the expressivity and the generalization ability of SympNets. The simulation results show that even very small size SympNets can generalize well, and are able to handle both separable and non-separable Hamiltonian systems with data points resulting from short or long time steps. In all the test cases, SympNets outperform the baseline models, and are much faster in training and prediction. We also develop an extended version of SympNets to learn the dynamics from irregularly sampled data. This extended version of SympNets can be thought of as a universal model representing the solution to an arbitrary Hamiltonian system.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

SympGNNs: Symplectic Graph Neural Networks for identifying high-dimensional Hamiltonian systems and node classification

Existing neural network models to learn Hamiltonian systems, such as SympNets, although accurate in low-dimensions, struggle to learn the correct dynamics for high-dimensional many-body systems. Herein, we introduce Symplectic Graph Neural Networks (SympGNNs) that can effectively handle system identification in high-dimensional Hamiltonian systems, as well as node classification. SympGNNs combine symplectic maps with permutation equivariance, a property of graph neural networks. Specifically, we propose two variants of SympGNNs: (i) G-SympGNN and (ii) LA-SympGNN, arising from different parameterizations of the kinetic and potential energy. We demonstrate the capabilities of SympGNN on two physical examples: a 40-particle coupled Harmonic oscillator, and a 2000-particle molecular dynamics simulation in a two-dimensional Lennard-Jones potential. Furthermore, we demonstrate the performance of SympGNN in the node classification task, achieving accuracy comparable to the state-of-the-art. Finally, we also empirically show that SympGNN can overcome the oversmoothing and heterophily problems, two key challenges in the field of graph neural networks.

Deep learning↗
DOE OSTI2020

Fast neural Poincaré maps for toroidal magnetic fields

Poincaré maps for toroidal magnetic fields are routinely employed to study gross confinement properties in devices built to contain hot plasmas. In most practical applications, evaluating a Poincaré map requires numerical integration of a magnetic field line, a process that can be slow and that cannot be easily accelerated using parallel computations. We propose a novel neural network architecture, the HénonNet, and show that it is capable of accurately learning realistic Poincaré maps from observations of a conventional field-line-following algorithm. After training, such learned Poincaré maps evaluate much faster than the field-line integration method. Moreover, the HénonNet architecture exactly reproduces the primary physics constraint imposed on field-line Poincaré maps: flux preservation. Furthermore, this structure-preserving property is the consequence of each layer in a HénonNet being a symplectic map. We demonstrate empirically that a HénonNet can learn to mock the confinement properties of a large magnetic island by using coiled hyperbolic invariant manifolds to produce a sticky chaotic region at the desired island location. This suggests a novel approach to designing magnetic fields with good confinement properties that may be more flexible than ensuring confinement using KAM tori.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗