Search NASA⌕ Search

SEARCH · Search NASA

Results for “symplectic integrators”

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

Terrestrial Planet Formation in Binary Star Systems

Most stars reside in multiple star systems; however, virtually all models of planetary growth have assumed an isolated single star. Numerical simulations of the collapse of molecular cloud cores to form binary stars suggest that disks will form within such systems. Observations indirectly suggest disk material around one or both components within young binary star systems. If planets form at the right places within such circumstellar disks, they can remain in stable orbits within the binary star systems for eons. We are simulating the late stages of growth of terrestrial planets within binary star systems, using a new, ultrafast, symplectic integrator that we have developed for this purpose. We show that the late stages of terrestrial planet formation can indeed take place in a wide variety of binary systems and we have begun to delineate the range of parameter space for which this statement is true. Results of our initial simulations of planetary growth around each star in the alpha Centauri system and other 'wide' binary systems, as well as around both stars in very close binary systems, will be presented.

Lissauer, Jack J.↗

Terrestrial Planet Formation Around Close Binary Stars

Most stars reside in multiple star systems; however, virtually all models of planetary growth have assumed an isolated single star. Numerical simulations of the collapse of molecular cloud cores to form binary stars suggest that disks will form within such systems. Observations indirectly suggest disk material around one or both components within young binary star systems. If planets form at the right places within such circumstellar disks, they can remain in stable orbits within the binary star systems for eons. We are simulating the late stages of growth of terrestrial planets around close binary stars, using a new, ultrafast, symplectic integrator that we have developed for this purpose. The sum of the masses of the two stars is one solar mass, and the initial disk of planetary embryos is the same as that used for simulating the late stages of terrestrial planet growth within our Solar System and in the Alpha Centauri wide binary star system. Giant planets &are included in the simulations, as they are in most simulations of the late stages of terrestrial planet accumulation in our Solar System. When the stars travel on a circular orbit with semimajor axis of up to 0.1 AU about their mutual center of mass, the planetary embryos grow into a system of terrestrial planets that is statistically identical to those formed about single stars, but a larger semimajor axis and/or a significantly eccentric binary orbit can lead to significantly more dynamically hot terrestrial planet systems.

Lissauer, Jack J.↗

The Detectability of Exo-Earths and Super-Earths via Resonant Signatures in Exozodiacal Clouds

Directly imaging extrasolar terrestrial planets necessarily means contending with the astrophysical noise of exozodiacal dust and the resonant structures created by these planets in exozodiacal clouds. Using a custom tailored hybrid symplectic integrator we have constructed 120 models of resonant structures created by exo-Earths and super-Earths on circular orbits interacting with collisionless steady-state dust clouds around a Sun-like star. Our models include enough particles to overcome the limitations of previous simulations that were often dominated by a handful of long-lived particles, allowing us to quantitatively study the contrast of the resulting ring structures. We found that in the case of a planet on a circular orbit, for a given star and dust source distribution, the morphology and contrast of the resonant structures depend on only two parameters: planet mass and (square root)ap/Beta, where ap is the planet's semi-major axis and Beta is the ratio of radiation pressure force to gravitational force on a grain. We constructed multiple-grain-size models of 25,000 particles each and showed that in a collisionless cloud, a Dohnanyi crushing law yields a resonant ring whose optical depth is dominated by the largest grains in the distribution, not the smallest. We used these models to estimate the mass of the lowest-mass planet that can be detected through observations of a resonant ring for a variety of assumptions about the dust cloud and the planet's orbit. Our simulations suggest that planets with mass as small as a few times Mars' mass may produce detectable signatures in debris disks at ap greater than or approximately equal to 10 AU.

Stark, Christopher C.↗

A Survey of Symplectic and Collocation Integration Methods for Orbit Propagation

Demands on numerical integration algorithms for astrodynamics applications continue to increase. Common methods, like explicit Runge-Kutta, meet the orbit propagation needs of most scenarios, but more specialized scenarios require new techniques to meet both computational efficiency and accuracy needs. This paper provides an extensive survey on the application of symplectic and collocation methods to astrodynamics. Both of these methods benefit from relatively recent theoretical developments, which improve their applicability to artificial satellite orbit propagation. This paper also details their implementation, with several tests demonstrating their advantages and disadvantages.

integration↗

Dynamical Chaos in the Wisdom-Holman Integrator: Origins and Solutions

We examine the nonlinear stability of the Wisdom-Holman (WH) symplectic mapping applied to the integration of perturbed, highly eccentric (e-0.9) two-body orbits. We find that the method is unstable and introduces artificial chaos into the computed trajectories for this class of problems, unless the step size chosen 1s small enough that PeriaPse is always resolved, in which case the method is generically stable. This 'radial orbit instability' persists even for weakly perturbed systems. Using the Stark problem as a fiducial test case, we investigate the dynamical origin of this instability and argue that the numerical chaos results from the overlap of step-size resonances; interestingly, for the Stark-problem many of these resonances appear to be absolutely stable. We similarly examine the robustness of several alternative integration methods: a time-regularized version of the WH mapping suggested by Mikkola; the potential-splitting (PS) method of Duncan, Levison, Lee; and two original methods incorporating approximations based on Stark motion instead of Keplerian motion. The two fixed point problem and a related, more general problem are used to conduct a comparative test of the various methods for several types of motion. Among the algorithms tested, the time-transformed WH mapping is clearly the most efficient and stable method of integrating eccentric, nearly Keplerian orbits in the absence of close encounters. For test particles subject to both high eccentricities and very close encounters, we find an enhanced version of the PS method-incorporating time regularization, force-center switching, and an improved kernel function-to be both economical and highly versatile. We conclude that Stark-based methods are of marginal utility in N-body type integrations. Additional implications for the symplectic integration of N-body systems are discussed.

Rauch, Kevin P.↗

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↗

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↗

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↗

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↗

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↗

TEAM project review, year 1

This note summarizes our research activities within the TEAM project between October 2019 and November 2020, funded by the ASCR Advanced Research in Quantum Computing program. Three research efforts have begun during the review period. The first effort, resulting in the JuQBox software, implemented a novel algorithm for optimal control in closed quantum systems based on symplectic time integration and exact calculations of the gradient of the discretized objective function. In our second effort, resulting in a code called Quandary, we consider the optimal control problem for open quantum systems. Here the evolution of the quantum system is modeled by the Lindblad master equation. In this code, we are considering both the realization of quantum gates as well as the optimal reset problem in which a general mixed quantum state is driven towards its ground state. In our third research effort we have begun the development of computational software for what we call Lindblad learning, i.e. the process of characterizing the equations governing our quantum computing hardware.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

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↗

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.↗

Shadow Lagrangian dynamics for superfluidity

Motivated by a similar approach for Born-Oppenheimer molecular dynamics, this paper proposes an extended "shadow" Lagrangian density for quantum states of superfluids. The extended Lagrangian contains an additional field variable that is forced to follow the wave function of the quantum state through a rapidly oscillating extended harmonic oscillator. By considering the adiabatic limit for large frequencies of the harmonic oscillator, we can derive the two equations of motions, a Schrödinger-type equation for the quantum state and a wave equation for the extended field variable. The equations are coupled in a nonlinear way, but each equation individually is linear with respect to the variable that it defines. The computational advantage of this new system is that it can be easily discretized using linear time stepping methods, where we propose to use a Crank-Nicolson-type approach for the Schrödinger equation and an extended leapfrog scheme for the wave equation. Furthermore, the difference between the quantum state and the extended field variable defines a consistency error that should go to zero if the frequency tends to infinity. By coupling the time-step size in our discretization to the frequency of the harmonic oscillator we can extract an easily computable consistency error indicator that can be used to estimate the numerical error without additional costs. The findings are illustrated in numerical experiments.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

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↗