Search NASA⌕ Search

SEARCH · Search NASA

Results for “equation free”

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

Verification of an improved equation-free projective integration method for neoclassical plasma-profile evolution in tokamak geometry

A brute-force, long-time gyrokinetic simulation of plasma profile evolution in magnetic fusion devices is not desirable due to large computational resource requirements and a possible accumulation of numerical error. The equation-free projective integration method of Keverekidis et al. [Commun. Math. Sci. 1(4), 715–762 (2003)] is one of the outstanding candidates in projecting micro-scale simulations to a longer timescale. However, its application to tokamak plasma has not been fruitful due to the appearance of spurious transient oscillations in the lifting process, which are present when the kinetic simulations are initialized with a simplified model distribution function and which make the kinetic simulations to deviate from the desired paths. In this work, a kinetically informed lifting algorithm is added to the equation-free projective integration method, which is then verified in the electrostatic gyrokinetic particle-in-cell code XGCa [R. Hager and C. S. Chang, Phys. Plasmas 23, 042503 (2016)] for a neoclassical ion heat transport problem with adiabatic electrons. This new lifting operator is demonstrated to control spurious transients, enabling an over four-times reduction in the overall computing time in the time-evolution of the ion temperature profile in an axisymmetric toroidal plasma. Further reduction in the computing time is found to be limited due to the stability properties of the linear least squares projective integrator.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Data-driven equation-free dynamics applied to many-protein complexes: The microtubule tip relaxation

Microtubules (MTs) constitute the largest components of the eukaryotic cytoskeleton and play crucial roles in various cellular processes, including mitosis and intracellular transport. The property allowing MTs to cater to such diverse roles is attributed to dynamic instability, which is coupled to the hydrolysis of GTP (guanosine-5'-triphosphate) to GDP (guanosine-5'-diphosphate) within the β-tubulin monomers. Understanding the equilibrium dynamics and the structural features of both GDP- and GTP-complexed MT tips, especially at an all-atom level, remains challenging for both experimental and computational methods because of their dynamic nature and the prohibitive computational demands of simulating large, many-protein systems. This study employs the “equation-free” multiscale computational method to accelerate the relaxation of all-atom simulations of MT tips toward their putative equilibrium conformation. Using large MT lattice systems (14 protofilaments × 8 heterodimers) comprising ~21-38 million atoms, we applied this multiscale approach to leapfrog through time and nearly double the computational efficiency in realizing relaxed all-atom conformations of GDP- and GTP-complexed MT tips. Commencing from an initial 4 μs unbiased all-atom simulation, we interleave coarse projective “equation-free” jumps with short bursts of all-atom molecular dynamics simulation to realize an additional effective simulation time of 1.875 μs. Our 5.875 μs of effective simulation trajectories for each system expose the subtle yet essential differences in the structures of MT tips as a function of whether β-tubulin monomer is complexed with GDP or GTP, as well as the lateral interactions within the MT tip, offering a refined understanding of features underlying MT dynamic instability. Furthermore, the approach presents a robust and generalizable framework for future explorations of large biomolecular systems at atomic resolution.

Wu, Jiangbo [University of Chicago, IL (United Sta↗

Equation-free and variable free modeling for complex/multiscale systems. Coarse-grained computation in science and engineering using fine-grained models

The work explored the linking of modern developing machine learning techniques (manifold learning and in particular diffusion maps) with traditional PDE modeling/discretization/scientific computation techniques via the equation-free methodology developed by the PI. The result (in addition to several PhD degrees, two of them by CSGF Fellows) was a sequence of strong developments - in part on the algorithmic side, linking data mining with scientific computing, and in part on applications, ranging from PDE discretizations to molecular dynamics and complex network dynamics.

97 MATHEMATICS AND COMPUTING↗

Equation-Free Coarse Control of Distributed Parameter Systems via Local Neural Operators

The control of high-dimensional distributed parameter systems (DPS) remains a challenge when explicit coarse-grained equations are unavailable. Classical equation-free (EF) approaches rely on fine-scale simulators treated as black-box timesteppers. However, repeated simulations for steady-state computation, linearization, and control design are often computationally prohibitive, or the microscopic timestepper may not even be available, leaving us with data as the only resource. We propose a data-driven alternative that uses local neural operators, trained on spatiotemporal microscopic/mesoscopic data, to obtain efficient short-time solution operators. These surrogates are employed within Krylov subspace methods to compute coarse steady and unsteady-states, while also providing Jacobian information in a matrix-free manner. Krylov-Arnoldi iterations then approximate the dominant eigenspectrum, yielding reduced models that capture the open-loop slow dynamics without explicit Jacobian assembly. Both discrete-time Linear Quadratic Regulator (dLQR) and pole-placement (PP) controllers are based on this reduced system and lifted back to the full nonlinear dynamics, thereby closing the feedback loop.

93B52, 93C20, 47N70, 65J15, 65M32, 68T07, 68T20, 6↗

Equation‐Free Surrogate Modeling of Geophysical Flows at the Intersection of Machine Learning and Data Assimilation

Abstract There is a growing interest in developing data‐driven reduced‐order models for atmospheric and oceanic flows that are trained on data obtained either from high‐resolution simulations or satellite observations. The data‐driven models are non‐intrusive in nature and offer significant computational savings compared to large‐scale numerical models. These low‐dimensional models can be utilized to reduce the computational burden of generating forecasts and estimating model uncertainty without losing the key information needed for data assimilation (DA) to produce accurate state estimates. This paper aims at exploring an equation‐free surrogate modeling approach at the intersection of machine learning and DA in Earth system modeling. With this objective, we introduce an end‐to‐end non‐intrusive reduced‐order modeling (NIROM) framework equipped with contributions in modal decomposition, time series prediction, optimal sensor placement, and sequential DA. Specifically, we use proper orthogonal decomposition (POD) to identify the dominant structures of the flow, and a long short‐term memory network to model the dynamics of the POD modes. The NIROM is integrated within the deterministic ensemble Kalman filter (DEnKF) to incorporate sparse and noisy observations at optimal sensor locations obtained through QR pivoting. The feasibility and the benefit of the proposed framework are demonstrated for the NOAA Optimum Interpolation Sea Surface Temperature (SST) V2 data set. Our results indicate that the NIROM is stable for long‐term forecasting and can model dynamics of SST with a reasonable level of accuracy. Furthermore, the prediction accuracy of the NIROM gets improved by almost one order of magnitude by the DEnKF algorithm.

Pawar, Suraj↗

Accelerated molecular dynamics and equation-free methods for simulating diffusion in solids.

Many of the most important and hardest-to-solve problems related to the synthesis, performance, and aging of materials involve diffusion through the material or along surfaces and interfaces. These diffusion processes are driven by motions at the atomic scale, but traditional atomistic simulation methods such as molecular dynamics are limited to very short timescales on the order of the atomic vibration period (less than a picosecond), while macroscale diffusion takes place over timescales many orders of magnitude larger. We have completed an LDRD project with the goal of developing and implementing new simulation tools to overcome this timescale problem. In particular, we have focused on two main classes of methods: accelerated molecular dynamics methods that seek to extend the timescale attainable in atomistic simulations, and so-called 'equation-free' methods that combine a fine scale atomistic description of a system with a slower, coarse scale description in order to project the system forward over long times.

36 MATERIALS SCIENCE↗

Time-Harmonic Gaussian Beams: Exact Solutions of the Helmhotz Equation in Free Space

An exact solution of the Helmholtz equation u{sub xx} + u{sub yy} + u{sub zz} + k{sup 2}u = 0 is presented, which describes propagation of monochromatic waves in the free space. The solution has the form of a superposition of plane waves with a specific weight function dependent on a certain free parameter a. If ka→∞, the solution is localized in the Gaussian manner in a vicinity of a certain straight line and asymptotically coincides with the famous approximate solution known as the fundamental mode of a paraxial Gaussian beam. The asymptotics of the aforementioned exact solution does not include a backward wave.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

On coarse projective integration for atomic deposition in amorphous systems

Direct molecular dynamics simulation of atomic deposition under realistic conditions is notoriously challenging because of the wide range of time scales that must be captured. Numerous simulation approaches have been proposed to address the problem, often requiring a compromise between model fidelity, algorithmic complexity, and computational efficiency. Coarse projective integration, an example application of the “equation-free” framework, offers an attractive balance between these constraints. Here, periodically applied, short atomistic simulations are employed to compute time derivatives of slowly evolving coarse variables that are then used to numerically integrate differential equations over relatively large time intervals. A key obstacle to the application of this technique in realistic settings is the “lifting” operation in which a valid atomistic configuration is recreated from knowledge of the coarse variables. Using Ge deposition on amorphous SiO{sub 2} substrates as an example application, we present a scheme for lifting realistic atomistic configurations comprised of collections of Ge islands on amorphous SiO{sub 2} using only a few measures of the island size distribution. The approach is shown to provide accurate initial configurations to restart molecular dynamics simulations at arbitrary points in time, enabling the application of coarse projective integration for this morphologically complex system.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Projective multiscale time-integration for electrostatic particle-in-cell methods

The simulation of problems in kinetic plasma physics is often challenging due to strongly coupled phenomena across multiple scales. In this work, we propose a wavelet-based coarse-grained numerical scheme, based on the framework of Equation-Free Projective Integration, for a kinetic plasma system modeled by the Vlasov–Poisson equations. A kinetic particle-in-cell (PIC) code is used to simulate the meso scale dynamics for short time intervals. This allows the extrapolation over long time-steps of the behavior of a coarse wavelet-based discretization of the system. To validate the approach and the underlying concepts, we perform two 1D1V numerical experiments: nonlinear propagation and steepening of an ion wave, and the expansion of a plasma slab in vacuum. The direct comparisons to resolved PIC simulations show good agreement. We show that the speedup of the projective integration scheme over the full particle scheme scales linearly with the system size, demonstrating efficiency while taking into account fully kinetic, non-Maxwellian effects. This suggests that the approach is potentially interesting for kinetic plasma problems with a large separation of scales.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

The center for multiscale plasma dynamics

This final report describes research performed in Princeton University, led by Professor Yannis G. Kevrekidis, over a period of six years (August 1, 2014 to July 31, 2010, including a one-year, no-cost extension) as part of the Center for Multiscale Plasma Dynamics led by the University of Maryland. The work resulted in the development and implementation of several multiscale algorithms based on the equation-free approach pioneered by the PI, including its applications in plasma dynamics problems. These algoriithms include coarse projective integration and coarse stability/bifurcation computations. In the later stages of the work, new links were made between this multiscale, coarse-graining approach and advances in data mining/machine learning algorithms.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Coarse-grained computation for particle coagulation and sintering processes by linking Quadrature Method of Moments with Monte-Carlo

The study of particle coagulation and sintering processes is important in a variety of research studies ranging from cell fusion and dust motion to aerosol formation applications. These processes are traditionally simulated using either Monte-Carlo methods or integro-differential equations for particle number density functions. In this paper, we present a computational technique for cases where we believe that accurate closed evolution equations for a finite number of moments of the density function exist in principle, but are not explicitly available. The so-called equation-free computational framework is then employed to numerically obtain the solution of these unavailable closed moment equations by exploiting (through intelligent design of computational experiments) the corresponding fine-scale (here, Monte-Carlo) simulation. We illustrate the use of this method by accelerating the computation of evolving moments of uni- and bivariate particle coagulation and sintering through short simulation bursts of a constant-number Monte-Carlo scheme.

97 MATHEMATICS AND COMPUTING↗

Time-series learning of latent-space dynamics for reduced-order model closure

In this work, we study the performance of long short-term memory networks (LSTMs) and neural ordinary differential equations (NODEs) in learning latent-space representations of dynamical equations for an advection-dominated problem given by the viscous Burgers equation. Our formulation is devised in a nonintrusive manner with an equation-free evolution of dynamics in a reduced space with the latter being obtained through a proper orthogonal decomposition. In addition, we leverage the sequential nature of learning for both LSTMs and NODEs to demonstrate their capability for closure in systems that are not completely resolved in the reduced space. We assess our hypothesis for two advection-dominated problems given by the viscous Burgers equation. We observe that both LSTMs and NODEs are able to reproduce the effects of the absent scales for our test cases more effectively than does intrusive dynamics evolution through a Galerkin projection. This result empirically suggests that time-series learning techniques implicitly leverage a memory kernel for coarse-grained system closure as is suggested through the Mori–Zwanzig formalism.

97 MATHEMATICS AND COMPUTING↗

An artificial neural network framework for reduced order modeling of transient flows

Here, this paper proposes a supervised machine learning framework for the non-intrusive model order reduction of unsteady fluid flows to provide accurate predictions of non-stationary state variables when the control parameter values vary. Our approach utilizes a training process from full-order scale direct numerical simulation data projected on proper orthogonal decomposition (POD) modes to achieve an artificial neural network (ANN) model with reduced memory requirements. This data-driven ANN framework allows for a nonlinear time evolution of the modal coefficients without performing a Galerkin projection. Our POD-ANN framework can thus be considered an equation-free approach for latent space dynamics evolution of nonlinear transient systems and can be applied to a wide range of physical and engineering applications. Within this framework we introduce two architectures, namely sequential network (SN) and residual network (RN), to train the trajectory of modal coefficients. We perform a systematic analysis of the performance of the proposed reduced order modeling approaches on prediction of a nonlinear wave-propagation problem governed by the viscous Burgers equation, a simplified prototype setting for transient flows. We find that the POD-ANN-RN yields stable and accurate results for test problems assessed both within inside and outside of the database range and performs significantly better than the standard intrusive Galerkin projection model. Finally, our results show that the proposed framework provides a non-intrusive alternative to the evolution of transient physics in a POD basis spanned space, and can be used as a robust predictive model order reduction tool for nonlinear dynamical systems.

42 ENGINEERING↗

Task-oriented machine learning surrogates for tipping points of agent-based models

We present a machine learning framework bridging manifold learning, neural networks, Gaussian processes, and Equation-Free multiscale approach, for the construction of different types of effective reduced order models from detailed agent-based simulators and the systematic multiscale numerical analysis of their emergent dynamics. The specific tasks of interest here include the detection of tipping points, and the uncertainty quantification of rare events near them. Our illustrative examples are an event-driven, stochastic financial market model describing the mimetic behavior of traders, and a compartmental stochastic epidemic model on an Erdös-Rényi network. We contrast the pros and cons of the different types of surrogate models and the effort involved in learning them. Importantly, the proposed framework reveals that, around the tipping points, the emergent dynamics of both benchmark examples can be effectively described by a one-dimensional stochastic differential equation, thus revealing the intrinsic dimensionality of the normal form of the specific type of the tipping point. This allows a significant reduction in the computational cost of the tasks of interest.

97 MATHEMATICS AND COMPUTING↗