Search NASA⌕ Search

SEARCH · Search NASA

Results for “chaotic problems”

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 OSTI2023

Multigrid Reduction in Time for Chaotic and Hyperbolic Problems (Final Report)

The coming massive parallelism of exascale computing presents a pressing challenge for the many DOE simulations of time-dependent partial differential equations (PDEs), which typically use traditional sequential time stepping methods. Since this traditional approach is inherently serial, it presents a sequential bottleneck when moving to exascale computing, because future performance gains will come through greater concurrency, not faster clock speeds. Thus, the goal of this work is to research parallelism in time, i.e., methods that compute multiple time values simultaneously, not sequentially. The focus will be on hyperbolic and chaotic problems of interest to DOE, with the goal of enabling scalable simulations of time-dependent hyperbolic and chaotic problems on future architectures. The chosen methodology for solving these problems parallel-in-time is multigrid, because multigrid (when it works) is a powerful, optimal, and scalable solver for discretized PDEs. Multigrid is already commonly used in many DOE simulations for scalably and optimally solving space-only PDE problems. The areas of hyperbolic and chaotic problems are chosen because of their relevance to problems of programmatic interest to DOE. However, these problems are also well-known to be difficult for parallelin-time methods, with the most common method, parareal, diverging in many cases. The current state-of-the-art for parallel-in-time at LLNL is the multigrid reduction in time (MGRIT) XBraid package, which also struggles for such problems, while still showing some improvement over parareal. In summary, new methods are needed for an efficient parallel-in-time scheme for hyperbolic and chaotic problems, and this work shall research promising new multigrid methods in this area. In particular, this work shall continue researching the directions from the current collaboration with Dr. Falgout, which are laid out in the work Toward Parallel in Time for Chaotic Dynamical Systems and showed the first known results of a parallel-in-time speedup for a chaotic problem. This work outlines two key improvements to XBraid for chaotic problems, the so-called “theta” and “delta-correction” methods. Here, these two improvements will be implemented in a high-performance but general way in XBraid and explored for more complicated problems. We will additionally research, as time allows, improvements to these techniques, as well as multigrid relaxation techniques based on Least Squares Shadowing (LSS by Wang) and a nonintrusive block tridiagonal solver based on MGRIT, called TriMGRIT.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Multigrid Reduction in Time for Chaotic and Hyperbolic Problems (Final Report)

The coming massive parallelism of exascale computing presents a pressing challenge for the many DOE simulations of time-dependent partial differential equations (PDEs), which typically use traditional sequential time stepping methods. Since this traditional approach is inherently serial, it presents a sequential bottleneck when moving to exascale computing, because future performance gains will come through greater concurrency, not faster clock speeds. Thus, the goal of this work is to research parallelism in time, i.e., methods that compute multiple time values simultaneously, not sequentially. The focus will be on hyperbolic and chaotic problems of interest to DOE, with the goal of enabling scalable simulations of time-dependent hyperbolic and chaotic problems on future architectures. The chosen methodology for solving these problems parallel-in-time is multigrid, because multigrid (when it works) is a powerful, optimal, and scalable solver for discretized PDEs. Multigrid is already commonly used in many DOE simulations for scalably and optimally solving space-only PDE problems. The areas of hyperbolic and chaotic problems are chosen because of their relevance to problems of programmatic interest to DOE. However, these problems are also well-known to be difficult for parallel-in-time methods, with the most common method, parareal, diverging in many cases. The current state of-the-art for parallel-in-time at LLNL is the multigrid reduction in time (MGRIT) XBraid package, which also struggles for such problems, while still showing some improvement over parareal. In summary, new methods are needed for an efficient parallel-in-time scheme for hyperbolic and chaotic problems, and this work shall research promising new multigrid methods in this area. In particular, this work shall continue researching the directions from the current collaboration with Dr. Falgout, which are laid out in the work Toward Parallel in Time for Chaotic Dynamical Systems and showed the first known results of a parallel-in-time speedup for a chaotic problem. This work outlines two key improvements to XBraid for chaotic problems, the so-called “theta” and “delta-correction” methods. Here, these two improvements will be further researched and improved (including with a new relaxation method inspired by on Least Squares Shadowing (LSS)) and explored for more complicated problems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Determining Exact RANS Operators with the Macroscopic Forcing Method (Final Report)

This report contains a compilation of key results and findings from the ACT project “Determining Exact RANS Operators with the Macroscopic Forcing Method.” The Macroscopic Forcing Method (MFM), a numerical tool for determining closure operators, is used to measure eddy diffusivity moments in Rayleigh-Taylor (RT) instability. It is first applied to low-Atwood 2D RT instability; that work is then extended to 3D RT at different finite Atwood numbers. It is found that nonlocality is important for modeling the mean scalar transport closure operator in RT mixing. Additionally, work is done to improve the statistical convergence of MFM for chaotic problems like RT mixing.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Multigrid Reduction in Time for Chaotic Dynamical Systems

As CPU clock speeds have stagnated and high performance computers continue to have ever higher core counts, increased parallelism is needed to take advantage of these new architectures. Traditional serial time-marching schemes can be a significant bottleneck, as many types of simulations require large numbers of time-steps which must be computed sequentially. Parallel-in-time schemes, such as the Multigrid Reduction in Time (MGRIT) method, remedy this by parallelizing across time-steps and have shown promising results for parabolic problems. However, chaotic problems have proved more difficult, since chaotic initial value problems (IVPs) are inherently ill-conditioned. MGRIT relies on a hierarchy of successively coarser time-grids to iteratively correct the solution on the finest time-grid, but due to the nature of chaotic systems, small inaccuracies on the coarser levels can be greatly magnified and lead to poor coarse-grid corrections. Here we introduce a modified MGRIT algorithm based on an existing quadratically converging nonlinear extension to the multigrid Full Approximation Scheme (FAS), as well as a novel time-coarsening scheme. Together, these approaches better capture long-term chaotic behavior on coarse-grids and greatly improve convergence of MGRIT for chaotic IVPs. Further, we introduce a novel low-memory variant of the algorithm for solving chaotic PDEs with MGRIT which not only solves the IVP, but also provides estimates for the unstable Lyapunov vectors of the system. Finally, we provide supporting numerical results for the Lorenz system and demonstrate parallel speedup for the chaotic Kuramoto–Sivashinsky PDE over a significantly longer time-domain than in previous works.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Exact enforcement of temporal continuity in sequential physics-informed neural networks

The use of deep learning methods in scientific computing represents a potential paradigm shift in engineering problem solving. One of the most prominent developments is Physics-Informed Neural Networks (PINNs), in which neural networks are trained to satisfy partial differential equations (PDEs). While this method shows promise, the standard version has been shown to struggle in accurately predicting the dynamic behavior of time-dependent problems. To address this challenge, methods have been proposed that decompose the time domain into multiple segments, employing a distinct neural network in each segment and directly incorporating continuity between them in the loss function of the minimization problem. In this work we introduce a method to exactly enforce continuity between successive time segments via a solution ansatz. This hard constrained sequential PINN (HCS-PINN) method is simple to implement and eliminates the need for any loss terms associated with temporal continuity. The method is tested for a number of benchmark problems involving both linear and non-linear PDEs. Examples include various first order time dependent problems in which traditional PINNs struggle, namely advection, Allen–Cahn, and Korteweg–de Vries equations. Furthermore, second and third order time-dependent problems are demonstrated via wave and Jerky dynamics examples, respectively. Notably, the Jerky dynamics problem is chaotic, making the problem especially sensitive to temporal accuracy. Finally, the numerical experiments conducted with the proposed method demonstrated superior convergence and accuracy over both traditional PINNs and the soft-constrained counterparts.

42 ENGINEERING↗
DOE OSTI2024

Accurate data-driven surrogates of dynamical systems for forward propagation of uncertainty

Stochastic collocation (SC) is a well-known non-intrusive method of constructing surrogate models for uncertainty quantification. In dynamical systems, SC is especially suited for full-field uncertainty propagation that characterizes the distributions of the high-dimensional solution fields of a model with stochastic input parameters. However, due to the highly nonlinear nature of the parameter-to-solution map in even the simplest dynamical systems, the constructed SC surrogates are often inaccurate. Here, this work presents an alternative approach, where we apply the SC approximation over the dynamics of the model, rather than the solution. By combining the data-driven sparse identification of nonlinear dynamics framework with SC, we construct dynamics surrogates and integrate them through time to construct the surrogate solutions. We demonstrate that the SC-over-dynamics framework leads to smaller errors, both in terms of the approximated system trajectories as well as the model state distributions, when compared against full-field SC applied to the solutions directly. We present numerical evidence of this improvement using three test problems: a chaotic ordinary differential equation, and two partial differential equations from solid mechanics.

42 ENGINEERING↗
DOE OSTI2024

Resilient Consensus State Observer for Nonlinear Systems and Against Attacks

Herein, we investigate the design of a resilient consensus observer that yields correct and continuous state estimates of a nonlinear control system whose state observations are subject to attacks. The observations are assumed to be obtained from multiple sensors and/or communication channels employed to provide redundancy. It is shown that, in an attack-free setting, individual globally convergent observers can be designed for each sensor/channel using the corresponding state-dependent Jacobian system. To counter attacks, a resilient consensus observer is then designed by merging the observers estimates to produce a smooth consensus estimate. Resilient convergence of the consensus estimate to the true state is ensured under the condition that the sparsity of the attacks being less than a half of the number of redundant channels. As an illustrative example, the proposed scheme is successfully applied to the chaotic circuit synchronization problem in which their synchronization has been attacked.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Cosmological Bounces Induced by a Fermion Condensate

Here, we show that it is possible for fermion condensation of the Nambu-Jona-Lasinio type to induce a non-singular bounce that smoothly connects a phase of slow contraction to a phase of expansion. A chiral condensate—a non-zero vacuum expectation value of the spinor bilinear <Ψ¯Ψ> — can form spontaneously after a slow contraction phase smooths and flattens the universe and the Ricci-curvature exceeds a critical value. In this approach, a high density of spin-aligned free fermions is not required, which avoids the problem of generating a large anisotropy and initiating chaotic mixmaster behavior during the bounce phase.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2024

Respecting causality for training physics-informed neural networks

While the popularity of physics-informed neural networks (PINNs) is steadily rising, to this date PINNs have not been successful in simulating dynamical systems whose solution exhibits multi-scale, chaotic or turbulent behavior. In this work we attribute this shortcoming to the inability of existing PINNs formulations to respect the spatio-temporal causal structure that is inherent to the evolution of physical systems. We argue that this is a fundamental limitation and a key source of error that can ultimately steer PINN models to converge towards erroneous solutions. We address this pathology by proposing a simple re-formulation of PINNs loss functions that can explicitly account for physical causality during model training. We demonstrate that this simple modification alone is enough to introduce significant accuracy improvements, as well as a practical quantitative mechanism for assessing the convergence of a PINNs model. Here we provide state-of-the-art numerical results across a series of benchmarks for which existing PINNs formulations fail, including the chaotic Lorenz system, the Kuramoto–Sivashinsky equation in the chaotic regime, and the Navier–Stokes equations. To the best of our knowledge, this is the first time that PINNs have been successful in simulating such systems, introducing new opportunities for their applicability to problems of industrial complexity.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Chaotic and integrable magnetic fields in one-dimensional hybrid Vlasov–Maxwell equilibria

The construction of kinetic equilibrium states is important for studying stability and wave propagation in collisionless plasmas. Thus, many studies over the past decades have been focused on calculating Vlasov–Maxwell equilibria using analytical and numerical methods. However, the problem of kinetic equilibrium of hybrid models is less studied, and self-consistent treatments often adopt restrictive assumptions ruling out cases with irregular and chaotic behaviour, although such behaviour is observed in spacecraft observations of space plasmas. In this paper, we develop a one-dimensional (1-D), quasineutral, hybrid Vlasov–Maxwell equilibrium model with kinetic ions and massless fluid electrons and derive associated solutions. The model allows for an electrostatic potential that is expressed in terms of the vector potential components through the quasineutrality condition. The equilibrium states are calculated upon solving an inhomogeneous Beltrami equation that determines the magnetic field, where the inhomogeneous term is the current density of the kinetic ions and the homogeneous term represents the electron current density. We show that the corresponding 1-D system is Hamiltonian, with position playing the role of time, and its trajectories have a regular, periodic behaviour for ion distribution functions that are symmetric in the two conserved particle canonical momenta. For asymmetric distribution functions, the system is nonintegrable, resulting in irregular and chaotic behaviour of the fields. The electron current density can modify the magnetic field phase space structure, inducing orbit trapping and the organization of orbits into large islands of stability. Thus, the electron contribution can be responsible for the emergence of localized electric field structures that induce ion trapping. We also provide a paradigm for the analytical construction of hybrid equilibria using a rotating two-dimensional harmonic oscillator Hamiltonian, enabling the calculation of analytic magnetic fields and the construction of the corresponding distribution functions in terms of Hermite polynomials.

Kaltsas, Dimitrios A. (ORCID:0000000300769015)↗
DOE OSTI2025

A provably stable numerical method for the anisotropic diffusion equation in confined magnetic fields

We present a novel numerical method for solving the anisotropic diffusion equation in magnetic fields confined to a periodic box which is accurate and provably stable. We derive energy estimates of the solution of the continuous initial boundary value problem. A discrete formulation is presented using operator splitting in time with the summation by parts finite difference approximation of spatial derivatives for the perpendicular diffusion operator. Weak penalty procedures are derived for implementing both boundary conditions and parallel diffusion operator obtained by field line tracing. We prove that the fully-discrete approximation is unconditionally stable. Discrete energy estimates are shown to match the continuous energy estimate given the correct choice of penalty parameters. A nonlinear penalty parameter is shown to provide an effective method for tuning the parallel diffusion penalty and significantly minimises rounding errors. Several numerical experiments, using manufactured solutions, the “NIMROD benchmark” problem and a single island problem, are presented to verify numerical accuracy, convergence, and asymptotic preserving properties of the method. Finally, we present a magnetic field with chaotic regions and islands and show the contours of the anisotropic diffusion equation reproduce key features in the field.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
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 OSTI2024

Chaotic LLM billiards

Abstract We study null geodesics of the ten-dimensional LLM geometries. In particular, we show that there are a subset of these null geodesics that are confined to the LLM plane. The effective dynamics of these in-plane geodesics is that of a Hamiltonian system with two degrees of freedom (a phase space of dimension 4). We show that these are chaotic. In the two-coloring of the LLM plane, if they start in the empty region, they cannot penetrate the filled region and viceversa. The dynamical problem is therefore very similar to that of a billiards problem with fixed obstacles. We study to what extent LLM geometries with many droplets may be treated as an incipient black hole and draw analogies with the fuzzball proposal. We argue that for in-plane null geodesics deep in the interior of a region with a lot of droplets, in order to exit towards theAdSboundary they will need to undergo a process that resembles diffusion. This mechanism can account for signals getting lost in the putative black hole for a very long time.

Physics↗
DOE OSTI2023

On the convergence of statistics in simulations of stationary incompressible turbulent flows

When reporting statistics from simulations of statistically stationary chaotic phenomenon, it is important to verify that the simulations are time-converged. This condition is connected with the statistical error or number of digits with which statistics can be reliably reported. In this work we consider numerical experiments of low Reynolds number incompressible homogeneous and isotropic turbulence as a model problem to investigate statistical convergence over finite simulation times. Specifically, we investigate the time integration requirements that allow meaningful reporting of the statistical error associated with finiteness of the temporal domain. We address two key questions: (1) How long should a simulation be performed in terms of large eddy time, and (2) How should the simulation time be divided among temporal windows over which a quantity of interest is estimated so that its statistical error could be reliably reported? We find that reliable reporting of statistical errors requires simulations on the order of 10 4 large eddy times, which is orders of magnitude longer than typically performed. Additionally, data post-processing should employ windows of at least ten times the large eddy time scale, with the most robust computation of statistical error of the mean requiring window sizes of an additional factor of ten. For practical simulations, we demonstrate that it is possible to estimate the statistical error within a factor of two under a less stringent condition in which a minimum of four windows with size at least ten large eddy times are used. In conclusion, our observations for homogeneous isotropic turbulence are also shown to hold in turbulent channel flow.

42 ENGINEERING↗
DOE OSTI2024

Predicting Critical Transitions in Multiscale Data

Predicting the dynamics of complex nonlinear systems remains a challenging problem both in dynamical systems theory as well as real world science and engineering applications. Data-driven methods utilizing the latest advances in machine learning (ML) provide a promising new paradigm for this task. Our work centered on Reservoir Computing (RC), which has shown itself to be capable of skillfully predicting chaotic dynamics in multiscale systems. In the first part of the work, the focus is on how to improve predictions of critical transitions in a class of slow-fast metastable systems in which the equations are known. An additional goal was to determine whether a relationship exists between RC and Koopman operator theory, to improve the efficiency and broaden the applicability of the approach. In the second part of this work, a variation on the RC model known as Reconstructive Reservoir Computing (RRC) is applied to real-world data to identify anomalies.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Constant Overhead Entanglement Distillation via Scrambling

High-fidelity quantum entanglement enables key quantum networking capabilities such as secure communication and distributed quantum computing, but long-distance entanglement distribution is limited by noise and loss. Entanglement distillation protocols address this problem by extracting high-fidelity Bell pairs from multiple noisy ones. The primary objective is minimizing the resource overhead: the number of noisy input pairs needed to distill each high-fidelity output pair. While protocols achieving optimal overhead are known in theory, they often require complex decoding operations that make practical implementation challenging. We circumvent this challenge by introducing protocols that use quantum scrambling—the spreading of quantum information under chaotic dynamics—through random Clifford operations. Based on this scrambling mechanism, our protocol maintains asymptotically constant overhead, independent of the desired output error rate $\bar{𝜖}$ , and can be implemented with shallow quantum circuits of depth 𝑂⁡(poly log log⁡ $\bar{𝜖}$ −1 ) and memory 𝑂⁡(poly log⁡ $\bar{𝜖}$ −1 ). Our protocol remains effective even with noisy quantum gates. By incorporating error correction, our protocol achieves state-of-the-art performance: starting with pairs of 10% initial infidelity, we require only seven noisy inputs per output pair to distill a single Bell pair with infidelity $\bar{𝜖}$ =10 −12 , substantially outperforming existing schemes. We demonstrate the utility of our protocols for quantum repeater networks.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Memory-based parameterization with differentiable solver: Application to Lorenz ’96

Physical parameterizations (or closures) are used as representations of unresolved subgrid processes within weather and global climate models or coarse-scale turbulent models, whose resolutions are too coarse to resolve small-scale processes. These parameterizations are typically grounded on physically based, yet empirical, representations of the underlying small-scale processes. Machine learning-based parameterizations have recently been proposed as an alternative solution and have shown great promise to reduce uncertainties associated with the parameterization of small-scale processes. Yet, those approaches still show some important mismatches that are often attributed to the stochasticity of the considered process. This stochasticity can be due to coarse temporal resolution, unresolved variables, or simply to the inherent chaotic nature of the process. To address these issues, we propose a new type of parameterization (closure), which is built using memory-based neural networks, to account for the non-instantaneous response of the closure and to enhance its stability and prediction accuracy. We apply the proposed memory-based parameterization, with differentiable solver, to the Lorenz ’96 model in the presence of a coarse temporal resolution and show its capacity to predict skillful forecasts over a long time horizon of the resolved variables compared to instantaneous parameterizations. This approach paves the way for the use of memory-based parameterizations for closure problems.

Mathematics↗
DOE OSTI2023

Linear growth of circuit complexity from Brownian dynamics

How rapidly can a many-body quantum system generate randomness? Using path integral methods, we demonstrate that Brownian quantum systems have circuit complexity that grows linearly with time. In particular, we study Brownian clusters of N spins or fermions with time-dependent all-to-all interactions, and calculate the Frame Potential to characterize complexity growth in these models. In both cases the problem can be mapped to an effective statistical mechanics problem which we study using path integral methods. Within this framework it is straightforward to show that the kth Frame Potential comes within ϵ of the Haar value after a time of order t ~ kN + k log k + log ϵ –1 . Using a bound on the diamond norm, this implies that such circuits are capable of coming very close to a unitary k-design after a time of order t ~ kN. We also consider the same question for systems with a time-independent Hamiltonian and argue that a small amount of time-dependent randomness is sufficient to generate a k-design in linear time provided the underlying Hamiltonian is quantum chaotic. These models provide explicit examples of linear complexity growth that are analytically tractable and are directly applicable to practical applications calling for unitary k-designs.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗