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

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↗

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↗

Parallel Multigrid in Time and Space for Extreme-Scale Computational Science: Chaotic and Hyperbolic Problems

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 stateof-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, we take inspiration from the Least Squares Shadowing (LSS by Wang) approach for solving chaotic problems. Here, an optimization approach is able to find “well-conditioned” shadow trajectories/solutions to the original “ill-conditioned” chaotic problem. Thus, the new multigrid methods researched here also arise in an optimization context.

97 MATHEMATICS AND COMPUTING↗

Parallel Multigrid in Time and Space for Extreme-Scale Computational Science

The coming massive parallelism of exascale computing presents a pressing challenge for the many DOE simulations of time-dependent partial differential equations, 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 programmatic interest to DOE, with the goal of enabling scalable simulations of time-dependent hyperbolic and chaotic problems on future architectures.

97 MATHEMATICS AND COMPUTING↗

Approximate models for the study of exponential changed quantities: Application on the plasma waves growth rate or damping

Many physical phenomena that concern the research these days are basically complicated because of being multi-parametric. Thus, their study and understanding meets with big if not unsolved obstacles. Such complicated and multi-parametric is the plasmatic state as well, where the plasma and the physical quantities that appear along with it have chaotic behavior. Many of those physical quantities change exponentially and at most times they are stabilized by presenting wavy behavior. Mostly in the transitive state rather than the steady state, the exponentially changing quantities (Growth, Damping etc) depend on each other in most cases. Thus, it is difficult to distinguish the cause from the result. The present paper attempts to help this difficult study and understanding by proposing mathematical exponential models that could relate with the study and understanding of the plasmatic wavy instability behavior. Such instabilities are already detected, understood and presented in previous publications of our laboratory. In other words, our new contribution is the study of the already known plasmatic quantities by using mathematical models (modeling and simulation). These methods are both useful and applicable in the chaotic theory. In addition, our ambition is to also conduct a list of models useful for the study of chaotic problems, such as those that appear into the plasma, starting with this paper's examples.

36 MATERIALS SCIENCE↗

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↗

Nearly discontinuous chaotic mixing

A new scientific approach is presented for a broad class of chaotic problems involving a high degree of mixing over rapid time scales. Rayleigh-Taylor and Richtmyer-Meshkov unstable flows are typical of such problems. Microscopic mixing properties such as chemical reaction rates for turbulent mixtures can be obtained with feasible grid resolution. The essential dependence of (some) fluid mixing observables on transport phenomena is observed. This dependence includes numerical as well as physical transport and it includes laminar as well as turbulent transport. A new approach to the mathematical theory for the underlying equations is suggested.

47 OTHER INSTRUMENTATION↗

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↗

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↗

Newton versus the machine: solving the chaotic three-body problem using deep neural networks

ABSTRACT Since its formulation by Sir Isaac Newton, the problem of solving the equations of motion for three bodies under their own gravitational force has remained practically unsolved. Currently, the solution for a given initialization can only be found by performing laborious iterative calculations that have unpredictable and potentially infinite computational cost, due to the system’s chaotic nature. We show that an ensemble of converged solutions for the planar chaotic three-body problem obtained using an arbitrarily precise numerical integrator can be used to train a deep artificial neural network (ANN) that, over a bounded time interval, provides accurate solutions at a fixed computational cost and up to 100 million times faster than the numerical integrator. In addition, we demonstrate the importance of training an ANN using converged solutions from an arbitrary precise integrator, relative to solutions computed by a conventional fixed precision integrator, which can introduce errors in the training data, due to numerical round-off and time discretization, that are learned by the ANN. Our results provide evidence that, for computationally challenging regions of phase space, a trained ANN can replace existing numerical solvers, enabling fast and scalable simulations of many-body systems to shed light on outstanding phenomena such as the formation of black hole binary systems or the origin of the core collapse in dense star clusters.

Breen, Philip G.↗

Compact finite difference relaxation method for chaotic and hyperchaotic initial value systems

In this paper, we present a new application of higher order compact finite differences to solve nonlinear initial value problems exhibiting chaotic behaviour. The method involves dividing the domain of the problem into multiple sub-domains, with each sub-domain integrated using higher order compact finite difference schemes. The nonlinearity is dealt using a Gauss–Seidel-like relaxation. The method is, therefore, referred to as the multi-domain compact finite difference relaxation method (MD-CFDRM). In this new application, the MD-CFDRM is used to solve famous chaotic systems and hyperchaotic systems. The main advantage of the new approach is that it offers better accuracy on coarser grids which significantly improves the computational speed of the method. The results are compared with spectral-based multi-domain method.

97 MATHEMATICS AND COMPUTING↗

Period and phase of the 88-year solar cycle and the Maunder minimum - Evidence for a chaotic sun

The problem of whether the solar dynamo is quasi-periodic or chaotic is addressed by examining 1500 years of sunspot, geomagnetic, and auroral activity cycles. Sub-harmonics were found of the fundamental solar cycle period during the years preceding the Maunder minimum and loss of phase of the subharmonic on emergence from it. These phenomena are indicative of chaos. They indicate that the solar dynamo is chaotic and is operating in a region close to the transition between period doubling and chaos. Since Maunder-type minima reoccur irregularly for millennia, it appears that the sun remains close to this transition to and from chaos. This is postulated to be a universal characteristic of solar type stars caused by feedback in the dynamo number.

Feynman, J.↗

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↗

Leapfrogging of multiple coaxial viscous vortex rings

A recent theoretical study [Borisov, Kilin, and Mamaev, “The dynamics of vortex rings: Leapfrogging, choreographies and the stability problem,” Regular Chaotic Dyn. 18, 33 (2013); Borisov et al., “The dynamics of vortex rings: Leapfrogging in an ideal and viscous fluid,” Fluid Dyn. Res. 46, 031415 (2014)] shows that when three coaxial vortex rings travel in the same direction in an incompressible ideal fluid, each of the vortex rings alternately slips through (or leapfrogs) the other two ahead. Here, we use a lattice Boltzmann method to simulate viscous vortex rings with an identical initial circulation, radius, and separation distance with the aim of studying how viscous effect influences the outcomes of the leapfrogging process. For the case of two identical vortex rings, our computation shows that leapfrogging can be achieved only under certain favorable conditions, which depend on Reynolds number, vortex core size, and initial separation distance between the two rings. For the case of three coaxial vortex rings, the result differs from the inviscid model and shows that the second vortex ring always slips through the leading ring first, followed by the third ring slipping through the other two ahead. A simple physical model is proposed to explain the observed behavior.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Numerical Scheme for Ordinary Differential Equations Having Time Varying and Nonlinear Coefficients Based on the State Transition Matrix

A variable order method of integrating initial value ordinary differential equations that is based on the state transition matrix has been developed. The method has been evaluated for linear time variant and nonlinear systems of equations. While it is more complex than most other methods, it produces exact solutions at arbitrary time step size when the time variation of the system can be modeled exactly by a polynomial. Solutions to several nonlinear problems exhibiting chaotic behavior have been computed. Accuracy of the method has been demonstrated by comparison with an exact solution and with solutions obtained by established methods.

Bartels, Robert E.↗

Model of a SiGe 130-nm 10- to 30-GHz Chaotic Self-Oscillating System

The problem of generation of utlrawideband chaotic oscillations in the frequency range of 10–30 GHz is considered. This problem is relevant to fifth-generation communication systems. A generator model designed for the silicon–germanium 130-nm process technology is proposed and studied.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

The chaotic dynamics of comets and the problems of the Oort cloud

The dynamic properties of comets entering the planetary zone from the Oort cloud are discussed. Even a very slight influence of the large planets can trigger stochastic cometary dynamics. Multiple interactions of comets with the large planets produce diffusion of the parameters of cometary orbits and a mean increase in the semi-major axis of comets. Comets are lifted towards the Oort cloud, where collisions with stars begin to play a substantial role. The transport of comets differs greatly from the customary law of diffusion and noticeably alter cometary distribution.

Sagdeev, Roald Z.↗

Generation of magnetic fields by chaotic fluid convection - The fast dynamo problem

In the kinematic fast dynamo problem, the underlying nonlinear dynamics of the flow play a critical role in the behavior of a dynamo field. It is presently noted that the two important facets of the problem are the approximately lognormal distribution of vector lengths, and the presence of partial cancellation. It is suggested that these features may be reflected in the magnetic fields observed on the sun.

Finn, John M.↗