Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Symplectic integration”

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 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Giant gravitons, Harish-Chandra integrals, and BPS states in symplectic and orthogonal $\mathcal{N}$ = 4 SYM

We find generating functions for half BPS correlators in $\mathcal{N}$ = 4 SYM theories with gauge groups Sp(2N), SO(2N + 1), and SO(2N) by computing the norms of a class of BPS coherent states. These coherent states are built from operators involving Harish-Chandra integrals. Such operators have an interpretation as localized giant gravitons in the bulk of anti-de-Sitter space. This extends the analysis of [1] to Sp(2N), SO(2N + 1), and SO(2N) gauge theories. We show that we may use ordinary Schur functions as a basis for the sector of states with no cross-caps in these theories. This is consistent with the construction of these theories as orientifold projections of an SU(2N) theory. We make note of some relations between the symmetric functions that appear in the expansion of these coherent states and symplectic Schur functions. We also comment on some connections to Schubert calculus and Gromov-Witten invariants, which suggest that the Harish-Chandra integral may be extended to such problems.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2022

Physics-Informed Machine Learning of Dynamical Systems for Efficient Bayesian Inference

Although the no-u-turn sampler (NUTS) is a widely adopted method for performing Bayesian inference, it requires numerous posterior gradients which can be expensive to compute in practice. Recently, there has been a significant interest in physics-based machine learning of dynamical (or Hamiltonian) systems and Hamiltonian neural networks (HNNs) is a noteworthy architecture. But these types of architectures have not been applied to solve Bayesian inference problems efficiently. We propose the use of HNNs for performing Bayesian inference efficiently without requiring numerous posterior gradients. We introduce latent variable outputs to HNNs (L-HNNs) for improved expressivity and reduced integration errors. We integrate L-HNNs in NUTS and further propose an online error monitoring scheme to prevent sampling degeneracy in regions where L-HNNs may have little training data. We demonstrate L-HNNs in NUTS with online error monitoring consider several complex high-dimensional posterior densities and compare its performance to NUTS.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Efficient Subset Simulation using Hamiltonian Neural Network enhanced Markov Chain Monte Carlo Methods

The Monte Carlo method delivers an unbiased estimate of the probability of failure. However, the variance of the estimate depends on the number of evaluated samples. This number must be very large for estimations of a low probability of failure. If the evaluation of each sample is computationally expensive, the crude Monte Carlo simulation strategy is impracticable. Therefore, subset simulations are used to reduce the required number of evaluations. Subset simulations require a Markov Chain Monte Carlo sampler, such as the random walk Metropolis-Hastings algorithm. The algorithm, however, struggles with sampling in low-probability regions, especially if they are narrow. As a consequence, advanced Markov Chain Monte Carlo simulations have been developed. In particular, the Hamiltonian Monte Carlo method explores the target distribution rapidly. Driven by the idea of Hamiltonian dynamics, this sampler provides a non-random walk through the target distribution. The incorporation of subset simulation and Hamiltonian Monte Carlo methods has shown promising results for reliability analysis. One downside of the Hamiltonian Monte Carlo method is that gradient evaluations are computationally expensive, especially when dealing with high-dimensional problems and evaluating long trajectories. We show that integrating Hamiltonian neural networks in Hamiltonian Monte Carlo simulations significantly speeds up the sampling task. Furthermore, the enhancement of adaptive trajectory length within the Hamiltonian Monte Carlo results in the efficient proposal of the following states. Based on this recent enhancement, we provide a fast sampling strategy for subset simulations using Hamiltonian neural networks to replace the evaluation of the gradient and significantly speed up the Hamiltonian Monte Carlo simulation.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Bayesian Inference with Latent Hamiltonian Neural Networks (L-HNNs)

When sampling for Bayesian inference, one popular approach is to use Hamiltonian Monte Carlo (HMC) and the No-U-Turn Sampler (NUTS). However, HMC and NUTS can require numerous numerical gradients of the target density and can prove slow in practice. We propose Hamiltonian neural networks (HNNs) with HMC and NUTS for solving Bayesian inference problems [1, 2]. Once trained, HNNs do not require gradients of the target density while sampling. Moreover, they satisfy important properties such as perfect time reversibility and Hamiltonian conservation, making them well suited for use within HMC and NUTS because stationarity can be shown. We also propose an HNN extension called latent HNNs (L-HNNs), which predict latent variable outputs. Compared to HNNs, L-HNNs offer improved expressivity and a reduction in integration errors. Finally, we propose employing L-HNNs in NUTS with an online error monitoring scheme to prevent degeneracy of the sampling in regions of low probability density. We demonstrate L-HNNs in NUTS with online error monitoring by using several example cases involving complex, heavy-tailed, and high local curvature probability densities. Overall, L-HNNs in NUTS with online error monitoring satisfactorily inferred these probability densities. Compared to traditional NUTS, L-HNNs in NUTS with online error monitoring improved the effective sample size (ESS) per gradient by an order of magnitude.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Efficient Bayesian inference with latent Hamiltonian neural networks in No-U-Turn Sampling

When sampling for Bayesian inference, one popular approach in the computational field is to use Hamiltonian Monte Carlo (HMC) and specifically the No-U-Turn Sampler (NUTS), which automatically decides the end time of the Hamiltonian trajectory. However, HMC and NUTS can require numerous numerical gradients of the target density and can prove slow in practice when relying on computationally expensive forward models. We propose Latent Hamiltonian neural networks (L-HNNs) with HMC and NUTS for solving Bayesian inference problems. Once trained, L-HNNs do not require numerical gradients of the target density during sampling, and hence numerous evaluations of the forward computational model. Moreover, L-HNNs satisfy important properties such as perfect time reversibility and Hamiltonian conservation, making them well-suited for use within HMC and NUTS because stationarity can be shown. We also propose the integration of L-HNNs in an online error monitoring scheme, in which numerical gradients of the target density are used for a few samples whenever the L-HNNs prediction errors are large. This online error monitor scheme prevents sample degeneracy in regions of low probability density and ensures robust uncertainty quantification. We demonstrate L-HNNs in NUTS with online error monitoring on several analytical examples involving complex, heavy-tailed, and high-local-curvature probability densities. We then demonstrate the applicability of L-HNNs in NUTS to two computational case studies, namely the Allen-Cahn stochastic partial differential equation and an elliptic partial differential equation with 25 and 50 inference parameters, respectively. Overall, the L-HNNs in NUTS with online error monitoring satisfactorily inferred these probability densities. In conclusion, compared to traditional NUTS, L-HNNs in NUTS with online error monitoring required 1–2 orders of magnitude fewer numerical gradients of the target density and improved the effective sample size (ESS) per gradient (which is a measure of both the sampling quality and the computational expense) by an order of magnitude.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Symplectic Particle Tracking in a Thick Nonlinear McMillan Lens for the Fermilab Integrable Optics Test Accelerator (IOTA)

The McMillan system is a novel method to increase the tune spread of a beam without decreasing its dynamic aperture due to the systems integrability. While the ideal system is based on an infinitely thin kick, the physical design requires a thick electron lens, including a solenoid. Particle transport through the lens is difficult to simulate due to the nature of the force on the circulating beam. This paper demonstrates accurate simulation of a thick McMillan lens in a solenoid using symplectic integrators derived from Yoshidas method.

43 PARTICLE ACCELERATORS↗
NASA NTRS2002

Comet and Asteroid Hazard to the Terrestrial Planets

We made computer simulations of orbital evolution for intervals of at least 5-10 Myr of N=2000 Jupiter-crossing objects (JCOs) with initial orbits close to those of real comets with period P less than 10 yr, 500 objects with orbits close to that of Comet 10P, and the asteroids initially located at the 3:1 and 5:2 resonances with Jupiter at initial eccentricity e(sub 0)=0.15 and initial inclination i(sub 0)=10(sup 0). The gravitational influence of all planets, except for Mercury and Pluto, was taken into account (without dissipative factors). We calculated the probabilities of collisions of bodies with the terrestrial planets, using orbital elements obtained with a step equal to 500 yr, and then summarized the results for all bodies, obtaining, the total probability Psigma of collisions with a planet and the total time interval Tsigma during which perihelion distance q of bodies was less than a semimajor axis of the planet. The values of p(sub r) =10(exp 6)Psigma/N and T(sub r)=T/1000 yr (where T=Tsigma/N) are presented in a table together with the ratio r of the total time interval when orbits were of Apollo type (at a greater than 1 AU, q less than 1.017 AU, e less than 0.999) to that of Amor type (1.017 less than q less than 1.33 AU), r(sub 2) is the same as r but for Apollo objects with e less than 0.9. For asteroids we present only results obtained by direct integration, as a symplectic method can give large errors for these resonances.

Ipatov, S. I.↗
DOE OSTI2025

Symplectic neural network and its application to charged particle dynamics in electromagnetic fields

Recently, machine learning models have shown many successes in various applications in science and technology. In this work, we focus on the charged particle dynamics, with the development of a class of symplectic neural networks, including a linear version, SympMat, and a nonlinear version, HénonNet. Both are designed to preserve the structure of Hamiltonian systems. We show that they can be used to model relevant Hamiltonian systems of interest in plasma physics and astrophysics, for linear and nonlinear charged particle dynamics, with the potential to bridge multi-scale simulations. These symplectic neural networks are adapted to the applications in plasma simulations and particle-wave interaction with parametric dependence and periodicity, where we have investigated their performance and accuracy. In particular, SympMat is shown to outperform the traditional Boris particle pusher down to the sub-gyroperiod scale in the case of charged particles in uniform magnetic fields. HénonNet successfully predicts the hot electron distribution, which is validated against theoretical results. These results highlight the potential of symplectic neural networks as a trajectory integrator for particle-in-cell simulations or a fast surrogate to replace conventional numerical schemes.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2022

Geometric integration of classical spin dynamics via a mean-field Schrödinger equation

The Landau-Lifshitz equation describes the time evolution of magnetic dipoles and can be derived by taking the classical limit of a quantum mechanical spin Hamiltonian. To take this limit, one constrains the many-body quantum state to a tensor product of coherent states, thereby neglecting entanglement between sites. Expectation values of the quantum spin operators produce the usual classical spin dipoles. One may also consider expectation values of polynomials of the spin operators, leading to quadrupole and higher-order spin moments, which satisfy a dynamical equation of motion that generalizes the Landau-Lifshitz dynamics [Zhang and Batista, Phys. Rev. B 104, 104409 (2021)]. Here we reformulate the dynamics of these N 2 –1 generalized spin components as a mean-field Schrödinger equation on the N-dimensional coherent state. Furthermore, this viewpoint suggests efficient integration methods that respect the local symplectic structure of the classical spin dynamics.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2025

SDA: a symbolic differential algebra package in C++

Truncated Power Series Algebra (TPSA), or Differential Algebra (DA), is a well-established tool in accelerator physics, commonly used for generating high-order maps of dynamic systems, as well as in symplectic tracking, normal form analysis, verified integration, optimization, and fast multipole methods. This package is the first to perform symbolic DA computations, enabling traceability of initial condition contributions and runtime reduction for repeated DA calculations, potentially expanding DA’s applications.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Nearly Periodic Maps and Geometric Integration of Noncanonical Hamiltonian Systems

Abstract M. Kruskal showed that each continuous-time nearly periodic dynamical system admits a formal U (1)-symmetry, generated by the so-called roto-rate. When the nearly periodic system is also Hamiltonian, Noether’s theorem implies the existence of a corresponding adiabatic invariant. We develop a discrete-time analog of Kruskal’s theory. Nearly periodic maps are defined as parameter-dependent diffeomorphisms that limit to rotations along a U (1)-action. When the limiting rotation is non-resonant, these maps admit formal U (1)-symmetries to all orders in perturbation theory. For Hamiltonian nearly periodic maps on exact presymplectic manifolds, we prove that the formal U (1)-symmetry gives rise to a discrete-time adiabatic invariant using a discrete-time extension of Noether’s theorem. When the unperturbed U (1)-orbits are contractible, we also find a discrete-time adiabatic invariant for mappings that are merely presymplectic, rather than Hamiltonian. As an application of the theory, we use it to develop a novel technique for geometric integration of non-canonical Hamiltonian systems on exact symplectic manifolds.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Clebsch canonization of Lie–Poisson systems

We propose a systematic procedure called the Clebsch canonization for obtaining a canonical Hamiltonian system that is related to a given Lie–Poisson equation via a momentum map. We describe both coordinate and geometric versions of the procedure, the latter apparently for the first time. We also find another momentum map so that the pair of momentum maps constitute a dual pair under a certain condition. The dual pair gives a concrete realization of what is commonly referred to as collectivization of Lie–Poisson systems. It also implies that solving the canonized system by symplectic Runge–Kutta methods yields so-called collective Lie–Poisson integrators that preserve the coadjoint orbits and hence the Casimirs exactly. We give a couple of examples, including the Kida vortex and the heavy top on a movable base with controls, which are Lie–Poisson systems on $\mathfrak{so}$ (2,1)* and ($\mathfrak{se}$ (3) ⋉ $\mathbb{R}^3$)* and, respectively.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1991

Mapping the stability field of Jupiter Trojans

Jupiter Trojans are a remnant of outer solar system planetesimals captured into stable or quasistable libration about the 1:1 resonance with the mean motion of Jupiter. The observed swarms of Trojans may provide insight into the original mass of condensed solids in the zone from which the Jovian planets accumulated, provided that the mechanisms of capture can be understood. As the first step toward this understanding, the stability field of Trojans were mapped in the coordinate proper eccentricity, e(sub p), and libration amplitude, D. To accomplish this mapping, the orbits of 100 particles with e(sub p) in the range of 0 to 0.8 and D in the range 0 to 140 deg were numerically integrated. Orbits of the Sun, the four Jovian planets, and the massless particles were integrated as a full N-body system, in a barycentric frame using fourth order symplectic scheme.

Levison, H. F.↗
DOE OSTI2025

Symplectic machine learning model for fast simulation of space-charge effects

Symplectic simulation of space-charge effects is crucial for the design and operation of high-intensity particle accelerators. Traditional methods for simulating these effects are often computationally expensive, resulting in significant overhead. In this work, we introduce a generative model based on a U-Net architecture within a generative adversarial network framework to efficiently simulate space-charge effects. The model is trained to predict the transverse multiparticle space-charge Hamiltonian, which can be physically computed using a gridless spectral method. The one-step symplectic transverse transfer map for the particles is then obtained by differentiating the predicted Hamiltonian. Benchmarking results demonstrate that this generative model achieves an order of magnitude higher computational efficiency compared to the spectral method, providing a highly efficient alternative for simulating space-charge effects with a large number of particles. By maintaining symplecticity, the model effectively preserves the phase-space structure and mitigates nonphysical errors in long-term simulations. This model has been integrated into jutrack, a novel autodifferentiable accelerator modeling code developed in the julia programming language.

Beam code development & simulation techniques↗
DOE OSTI2023

The Zoo of Opers and Dualities

Abstract We investigate various spaces of $SL(r+1)$-opers and their deformations. For each type of such opers, we study the quantum/classical duality, which relates quantum integrable spin chains with classical solvable many body systems. In this context, quantum/classical dualities serve as an interplay between two different coordinate systems on the space of opers. We also establish correspondences between the underlying oper spaces, which recently had multiple incarnations in symplectic duality and bispectral duality.

Mathematics↗
DOE OSTI2026

New Time Integrators and Capabilities in SUNDIALS Versions 6.2.0-7.4.0

SUNDIALS is a well-established numerical library that provides robust and efficient time integrators and nonlinear solvers. This article overviews several significant improvements and new features added over the last 3 years to support scientific simulations run on high-performance computing systems. Notably, three new classes of one-step methods have been implemented: low storage Runge–Kutta, symplectic partitioned Runge–Kutta, and operator splitting. In addition, we describe new timestep adaptivity support for multirate methods, adjoint sensitivity analysis capabilities for explicit Runge–Kutta methods, additional options for Anderson acceleration in nonlinear solvers, and improved error handling and logging.

Computer science↗