Search NASA⌕ Search

SEARCH · Search NASA

Results for “stochastic simulation algorithm”

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 613 records · Page 34
All sourcesNASA NTRSDOE OSTI
DOE OSTI2016

Using full configuration interaction quantum Monte Carlo in a seniority zero space to investigate the correlation energy equivalence of pair coupled cluster doubles and doubly occupied configuration interaction

Over the past few years, pair coupled cluster doubles (pCCD) has shown promise for the description of strong correlation. This promise is related to its apparent ability to match results from doubly occupied configuration interaction (DOCI), even though the latter method has exponential computational cost. Here, by modifying the full configuration interaction quantum Monte Carlo algorithm to sample only the seniority zero sector of Hilbert space, we show that the DOCI and pCCD energies are in agreement for a variety of 2D Hubbard models, including for systems well out of reach for conventional configuration interaction algorithms. Our calculations are aided by the sign problem being much reduced in the seniority zero space compared with the full space. We present evidence for this and then discuss the sign problem in terms of the wave function of the system which appears to have a simplified sign structure.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2017

Coupled land surface–subsurface hydrogeophysical inverse modeling to estimate soil organic carbon content and explore associated hydrological and thermal dynamics in the Arctic tundra

Quantitative characterization of soil organic carbon (OC) content is essential due to its significant impacts on surface–subsurface hydrological–thermal processes and microbial decomposition of OC, which both in turn are important for predicting carbon–climate feedbacks. While such quantification is particularly important in the vulnerable organic-rich Arctic region, it is challenging to achieve due to the general limitations of conventional core sampling and analysis methods, and to the extremely dynamic nature of hydrological–thermal processes associated with annual freeze–thaw events. In this study, we develop and test an inversion scheme that can flexibly use single or multiple datasets – including soil liquid water content, temperature and electrical resistivity tomography (ERT) data – to estimate the vertical distribution of OC content. Our approach relies on the fact that OC content strongly influences soil hydrological–thermal parameters and, therefore, indirectly controls the spatiotemporal dynamics of soil liquid water content, temperature and their correlated electrical resistivity. We employ the Community Land Model to simulate nonisothermal surface–subsurface hydrological dynamics from the bedrock to the top of canopy, with consideration of land surface processes (e.g., solar radiation balance, evapotranspiration, snow accumulation and melting) and ice–liquid water phase transitions. For inversion, we combine a deterministic and an adaptive Markov chain Monte Carlo (MCMC) optimization algorithm to estimate a posteriori distributions of desired model parameters. For hydrological–thermal-to-geophysical variable transformation, the simulated subsurface temperature, liquid water content and ice content are explicitly linked to soil electrical resistivity via petrophysical and geophysical models. We validate the developed scheme using different numerical experiments and evaluate the influence of measurement errors and benefit of joint inversion on the estimation of OC and other parameters. We also quantify the propagation of uncertainty from the estimated parameters to prediction of hydrological–thermal responses. We find that, compared to inversion of single dataset (temperature, liquid water content or apparent resistivity), joint inversion of these datasets significantly reduces parameter uncertainty. We find that the joint inversion approach is able to estimate OC and sand content within the shallow active layer (top 0.3 m of soil) with high reliability. Due to the small variations of temperature and moisture within the shallow permafrost (here at about 0.6 m depth), the approach is unable to estimate OC with confidence. However, if the soil porosity is functionally related to the OC and mineral content, which is often observed in organic-rich Arctic soil, the uncertainty of OC estimate at this depth remarkably decreases. Our study documents the value of the new surface–subsurface, deterministic–stochastic inversion approach, as well as the benefit of including multiple types of data to estimate OC and associated hydrological–thermal dynamics.

58 GEOSCIENCES↗
DOE OSTI2016

Bayesian inference of nonlinear unsteady aerodynamics from aeroelastic limit cycle oscillations

A Bayesian model selection and parameter estimation algorithm is applied to investigate the influence of nonlinear and unsteady aerodynamic loads on the limit cycle oscillation (LCO) of a pitching airfoil in the transitional Reynolds number regime. At small angles of attack, laminar boundary layer trailing edge separation causes negative aerodynamic damping leading to the LCO. The fluid–structure interaction of the rigid, but elastically mounted, airfoil and nonlinear unsteady aerodynamics is represented by two coupled nonlinear stochastic ordinary differential equations containing uncertain parameters and model approximation errors. Several plausible aerodynamic models with increasing complexity are proposed to describe the aeroelastic system leading to LCO. The likelihood in the posterior parameter probability density function (pdf) is available semi-analytically using the extended Kalman filter for the state estimation of the coupled nonlinear structural and unsteady aerodynamic model. The posterior parameter pdf is sampled using a parallel and adaptive Markov Chain Monte Carlo (MCMC) algorithm. The posterior probability of each model is estimated using the Chib–Jeliazkov method that directly uses the posterior MCMC samples for evidence (marginal likelihood) computation. The Bayesian algorithm is validated through a numerical study and then applied to model the nonlinear unsteady aerodynamic loads using wind-tunnel test data at various Reynolds numbers.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Modern Monte Carlo methods for efficient uncertainty quantification and propagation: A survey

Uncertainty quantification (UQ) includes the characterization, integration, and propagation of uncertainties that result from stochastic variations and a lack of knowledge or data in the natural world. Monte Carlo (MC) method is a sampling-based approach that has widely used for quantification and propagation of uncertainties. However, the standard MC method is often time-consuming if the simulation-based model is computationally intensive. This article gives an overview of modern MC methods to address the existing challenges of the standard MC in the context of UQ. Specifically, multilevel Monte Carlo (MLMC) extending the concept of control variates achieves a significant reduction of the computational cost by performing most evaluations with low accuracy and corresponding low cost, and relatively few evaluations at high accuracy and corresponding high cost. Multifidelity Monte Carlo (MFMC) accelerates the convergence of standard Monte Carlo by generalizing the control variates with different models having varying fidelities and varying computational costs. Multimodel Monte Carlo method (MMMC), having a different setting of MLMC and MFMC, aims to address the issue of UQ and propagation when data for characterizing probability distributions are limited. Multimodel inference combined with importance sampling is proposed for quantifying and efficiently propagating the uncertainties resulting from small data sets. All of these three modern MC methods achieve a significant improvement of computational efficiency for probabilistic UQ, particularly uncertainty propagation. Finally, an algorithm summary and the corresponding code implementation are provided for each of the modern MC methods. The extension and application of these methods are discussed in detail.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Modeling and Simulation of High-Frequency Solar Irradiance

As the use of solar power as a source of electricity is increasing, so is the interest in modeling radiation at high temporal resolutions. High-dimensional remote sensing data products depend on cloud cover variability, atmosphere aerosol levels, and other atmospheric parameters. Because of weather fronts and aerosols, it is difficult to quantify solar power variability based on distributed solar networks. The global horizontal irradiance (GHI) component in the National Solar Radiation Database (NSRDB) is available at a 30-min time resolution. The algorithm proposed in this paper produces 1-min-resolution GHI samples at locations where NSRDB data are available. The synthetic irradiance datasets are produced using log-additive non-Gaussian mixture models and resampling techniques. The model is trained over historical data, and predicted values are compared with in situ data. This approach allows for estimating the solar irradiance at subhourly temporal resolutions, while featuring variability for locations where measurements are otherwise not available.

14 SOLAR ENERGY↗
DOE OSTI2013

Distributed Sensor Coordination for Advanced Energy Systems

The ability to collect key system level information is critical to the safe, efficient and reliable operation of advanced energy systems. With recent advances in sensor development, it is now possible to push some level of decision making directly to computationally sophisticated sensors, rather than wait for data to arrive to a massive centralized location before a decision is made. This type of approach relies on networked sensors (called “agents” from here on) to actively collect and process data, and provide key control decisions to significantly improve both the quality/relevance of the collected data and the associating decision making. The technological bottlenecks for such sensor networks stem from a lack of mathematics and algorithms to manage the systems, rather than difficulties associated with building and deploying them. Indeed, traditional sensor coordination strategies do not provide adequate solutions for this problem. Passive data collection methods (e.g., large sensor webs) can scale to large systems, but are generally not suited to highly dynamic environments, such as advanced energy systems, where crucial decisions may need to be reached quickly and locally. Approaches based on local decisions on the other hand cannot guarantee that each agent performing its task (maximize an agent objective) will lead to good network wide solution (maximize a network objective) without invoking cumbersome coordination routines. There is currently a lack of algorithms that will enable self-organization and blend the efficiency of local decision making with the system level guarantees of global decision making, particularly when the systems operate in dynamic and stochastic environments. In this work we addressed this critical gap and provided a comprehensive solution to the problem of sensor coordination to ensure the safe, reliable, and robust operation of advanced energy systems. The differentiating aspect of the proposed work is in shifting the focus towards “what to observe” rather than “how to observe” in large sensor networks, allowing the agents to actively determine both the structure of the network and the relevance of the information they are seeking to collect. In addition to providing an implicit coordination mechanism, this approach allows the system to be reconfigured in response to changing needs (e.g., sudden external events requiring new responses) or changing sensor network characteristics (e.g., sudden changes to plant condition). Outcome Summary: All milestones associated with this project have been completed. In particular, private sensor objective functions were developed which are aligned with the global objective function, sensor effectiveness has been improved by using “sensor teams,” system efficiency has been improved by 30% using difference evaluation functions, we have demonstrated system reconfigurability for 20% changes in system conditions, we have demonstrated extreme scalability of our proposed algorithm, we have demonstrated that sensor networks can overcome disruptions of up to 20% in network conditions, and have demonstrated system reconfigurability to 20% changes in system conditions in hardware-based simulations. This final report summarizes how each of these milestones was achieved, and gives insight into future research possibilities past the work which has been completed. The following publications support these milestones [6, 8, 9, 10, 16, 18, 19].

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Mechanisms of Dynamic Near-Wake Modulation of a Utility-Scale Wind Turbine

The current study uses large eddy simulations to investigate the transient response of a utility-scale wind turbine wake to dynamic changes in atmospheric and operational conditions, as observed in previous field-scale measurements. Most wind turbine wake investigations assume quasi-steady conditions, but real wind turbines operate in a highly stochastic atmosphere, and their operation (e.g. blade pitch, yaw angle) changes constantly in response. Furthermore, dynamic control strategies have been recently proposed to optimize wind farm power generation and longevity. Therefore, improved understanding of dynamic wake behaviours is essential. First, changes in blade pitch are investigated and the wake expansion response is found to display hysteresis as a result of flow inertia. The time scales of the wake response to different pitch rates are quantified. Next, changes in wind direction with different time scales are explored. Under short time scales, the wake deflection is in the opposite direction of that observed under quasi-steady conditions. Finally, yaw changes are implemented at different rates, and the maximum inverse wake deflection and time scale are quantified, showing a clear dependence on yaw rate. To gain further physical understanding of the mechanism behind the inverse wake deflection, the streamwise vorticity in different parts of the wake is quantified. The results of this study provide guidance for the design of advanced wake flow control algorithms. The lag in wake response observed for both blade pitch and yaw changes shows that proposed dynamic control strategies must implement turbine operational changes with a time scale of the order of the rotor time scale or slower.

flow-structure interactions↗
DOE OSTI2020

Identification of hot water end-use process of electric water heaters from energy measurements

This paper presents an algorithm for the identification of parameters for a stochastic hot water end-use process that drives a homogeneous population of thermostatically controlled electric water heaters (EWH). Usually, only metered interval consumption data (kWh) is collected and the hot water end-use process is unobservable to utility and aggregators. However, the availability of EWHs for demand response (DR) is closely coupled with the hot water end-use process. In this context, the hot water end-use process is modeled as a two-state Markov chain (Use / No use), which causes the thermostatic ON-OFF switching process to behave as a Markov renewal process (MRP). A set of first passage-time problems is developed to obtain the moments of the transition probability densities of the MRP. These problems are addressed by establishing a system of coupled partial differential equations characterizing the temperature evolution of the EWH population. A key quantity in the methodology for estimating the parameters is the total time an EWH is ON within a period of interest. It is referred to as the total busy time. Total busy time in this approach is a random variable for which analytical expressions of the moments are developed as a function of the metered window length. The latter expressions become the basis of a hot water demand model identification algorithm which is validated using agent-based simulations of EWHs.

42 ENGINEERING↗
DOE OSTI2020

Probabilistic Look-ahead Contingency Analysis Integration with Commercial Tool and Practical Data

This paper presents an initial effort of integrating a smart sampling-based probabilistic look-ahead contingency analysis algorithm with General Electric (GE) Grid Solutions’ commercial energy management system (EMS) tool as a proof-of-concept for a seamless research tool integration using real world large-scale grid data. With the increasing impact of random forces such as variable generation and load, their stochastic behaviors cannot be ignored. However, the current practices are still dominated by deterministic tools. They are becoming increasingly inadequate for the future grid. The developed look-ahead contingency analysis algorithm incorporates forecast errors of variable energy and load to address the challenges brought by the increasing uncertainty of power system. The algorithm can reveal the potential violations caused by the variance of variable energy and load that are not normally detected by traditional deterministic approaches. To test its performance under practical environments ( real data with real commercial tool), significant efforts have been made to prepare test cases, modify GE EMS tool, and adapt an extreme value distribution algorithm to analyze the GE EMS’s violation-only outputs. The test results clearly demonstrate the effectiveness of the developed algorithm as new transformer violations that were not previously detected have been identified. This performance provides better situational awareness to engineers for their decision-making process under uncertainty. Moreover, with the discussion of computational performance and future work, this paper has shown a clear path for integrating the probabilistic algorithm with commercial tools to make us better equipped for the changing power system.

Modeling and simulation of power systems, constrai↗
DOE OSTI2018

Extreme-Scale Bayesian Inference for Uncertainty Quantification of Complex Simulations

Uncertainty quantification (UQ)—that is, quantifying uncertainties in complex mathematical models and their large-scale computational implementations—is widely viewed as one of the outstanding challenges facing the field of CS&E over the coming decade. The EUREKA project set to address the most difficult class of UQ problems: those for which both the underlying PDE model as well as the uncertain parameters are of extreme scale. In the project we worked on these extreme-scale challenges in the following four areas: 1. Scalable parallel algorithms for sampling and characterizing the posterior distribution that exploit the structure of the underlying PDEs and parameter-to-observable map. These include structure-exploiting versions of the randomized maximum likelihood method, which aims to overcome the intractability of employing conventional MCMC methods for solving extreme-scale Bayesian inversion problems by appealing to and adapting ideas from large-scale PDE-constrained optimization, which have been very successful at exploring high-dimensional spaces. 2. Scalable parallel algorithms for construction of prior and likelihood functions based on learning methods and non-parametric density estimation. Constructing problem-specific priors remains a critical challenge in Bayesian inference, and more so in high dimensions. Another challenge is construction of likelihood functions that capture unmodeled couplings between observations and parameters. We will create parallel algorithms for non-parametric density estimation using high dimensional N-body methods and combine them with supervised learning techniques for the construction of priors and likelihood functions. 3. Bayesian inadequacy models, which augment physics models with stochastic models that represent their imperfections. The success of the Bayesian inference framework depends on the ability to represent the uncertainty due to imperfections of the mathematical model of the phenomena of interest. This is a central challenge in UQ, especially for large-scale models. We propose to develop the mathematical tools to address these challenges in the context of extreme-scale problems. 4. Parallel scalable algorithms for Bayesian optimal experimental design (OED). Bayesian inversion yields quantified uncertainties in the model parameters, which can be propagated forward through the model to yield uncertainty in outputs of interest. This opens the way for designing new experiments to reduce the uncertainties in the model parameters and model predictions. Such experimental design problems have been intractable for large-scale problems using conventional methods; we will create OED algorithms that exploit the structure of the PDE model and the parameter-to-output map to overcome these challenges. Parallel algorithms for these four problems were created, analyzed, prototyped, implemented, tuned, and scaled up for leading-edge supercomputers, including UT-Austin’s own 10 petaflops Stampede system, ANL’s Mira system, and ORNL’s Titan system. While our focus is on fundamental mathematical/computational methods and algorithms, we will assess our methods on model problems derived from several DOE mission applications, including multiscale mechanics and ice sheet dynamics.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Randomized Algorithms for Scientific Computing (RASC)

Randomized algorithms have propelled advances in artificial intelligence (AI) and represent a foundational research area in advancing AI for Science. Future advancements in DOE Office of Science priority areas such as climate science, astrophysics, fusion, advanced materials, combustion, and quantum computing all require randomized algorithms for surmounting challenges of complexity, robustness, and scalability. Advances in data collection and numerical simulation have changed the dynamics of scientific research and motivate the need for randomized algorithms. For instance, advances in imaging technologies such as X-ray ptychography, electron microscopy, electron energy loss spectroscopy, or adaptive optics lattice light-sheet microscopy collect hyperspectral imaging and scattering data in terabytes, at breakneck speed enabled by state-of-the-art detectors. The data collection is exceptionally fast compared with its analysis. Likewise, advances in high-performance architectures have made exascale computing a reality and changed the economies of scientific computing in the process. Floating-point operations that create data are essentially free in comparison with data movement. Thus far, most approaches have focused on creating faster hardware. Ironically, this faster hardware has exacerbated the problem by making data still easier to create. Under such an onslaught, scientists often resort to heuristic deterministic sampling schemes (e.g., low-precision arithmetic, sampling every nth element) and sacrifice potentially valuable accuracy. Dramatically better results can be achieved via randomized algorithms, reducing the data size as much as or more than naive deterministic subsampling can achieve, while retaining the high accuracy of computing on the full data set. By randomized algorithms we mean those algorithms that employ some form of randomness in internal algorithmic decisions to accelerate time to solution, increase scalability, or improve reliability. Examples include matrix sketching for solving large-scale least-squares problems (see Figure 1) and stochastic gradient descent for training machine learning models. We are not recommending heuristic methods but rather randomized algorithms that have certificates of correctness and probabilistic guarantees of optimality and near-optimality. Such approaches can be useful beyond acceleration, for example, in understanding how to avoid measure zero worst-case scenarios that plague methods such as QR matrix factorization.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Ab initio molecular dynamics on quantum computers

Ab initio molecular dynamics (AIMD) is a valuable technique for studying molecules and materials at finite temperatures where the nuclei evolve on potential energy surfaces obtained from accurate electronic structure calculations. In this work, we present an approach to running AIMD simulations on noisy intermediate-scale quantum (NISQ)-era quantum computers. The electronic energies are calculated on a quantum computer using the variational quantum eigensolver (VQE) method. Algorithms for computation of analytical gradients entirely on a quantum computer require quantum fault-tolerant hardware, which is beyond NISQ-era. Therefore, we compute the energy gradients numerically using finite differences, the Hellmann-Feynman theorem, and a correlated sampling technique. This method only requires additional classical calculations of electron integrals for each degree of freedom without any additional computations on a quantum computer beyond the initial VQE run. As a proof of concept, AIMD simulations are demonstrated for the H-2 molecule on IBM quantum devices. In addition, we demonstrate the validity of the method for larger molecules using full configuration interaction wave functions. As quantum hardware and noise mitigation techniques continue to improve, the method can be utilized for studying larger molecular systems.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2017

Rapid sampling of stochastic displacements in Brownian dynamics simulations

Here, we present a new method for sampling stochastic displacements in Brownian Dynamics (BD) simulations of colloidal scale particles. The method relies on a new formulation for Ewald summation of the Rotne-Prager-Yamakawa (RPY) tensor, which guarantees that the real-space and wave-space contributions to the tensor are independently symmetric and positive-definite for all possible particle configurations. Brownian displacements are drawn from a superposition of two independent samples: a wave-space (far-field or long-ranged) contribution, computed using techniques from fluctuating hydrodynamics and non-uniform fast Fourier transforms; and a real-space (near-field or short-ranged) correction, computed using a Krylov subspace method. The combined computational complexity of drawing these two independent samples scales linearly with the number of particles. The proposed method circumvents the super-linear scaling exhibited by all known iterative sampling methods applied directly to the RPY tensor that results from the power law growth of the condition number of tensor with the number of particles. For geometrically dense microstructures (fractal dimension equal three), the performance is independent of volume fraction, while for tenuous microstructures (fractal dimension less than three), such as gels and polymer solutions, the performance improves with decreasing volume fraction. This is in stark contrast with other related linear-scaling methods such as the force coupling method and the fluctuating immersed boundary method, for which performance degrades with decreasing volume fraction. Calculations for hard sphere dispersions and colloidal gels are illustrated and used to explore the role of microstructure on performance of the algorithm. In practice, the logarithmic part of the predicted scaling is not observed and the algorithm scales linearly for up to 4×10 6 particles, obtaining speed ups of over an order of magnitude over existing iterative methods, and making the cost of computing Brownian displacements comparable to the cost of computing deterministic displacements in BD simulations. Finally, a high-performance implementation employing non-uniform fast Fourier transforms implemented on graphics processing units and integrated with the software package HOOMD-blue is used for benchmarking.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2025

Universal energy-speed-accuracy trade-offs in driven nonequilibrium systems

The connection between measure theoretic optimal transport and dissipative nonequilibrium dynamics provides a language for quantifying nonequilibrium control costs, leading to a collection of thermodynamic speed limits, which rely on the assumption that the target probability distribution is perfectly realized. This is almost never the case in experiments or numerical simulations, so here we address the situation in which the external controller is imperfect. We obtain a lower bound for the dissipated work in generic nonequilibrium control problems that (1) is asymptotically tight and (2) matches the thermodynamic speed limit in the case of optimal driving. Along with analytically solvable examples, we refine this imperfect driving notion to systems in which the controlled degrees of freedom are slow relative to the nonequilibrium relaxation rate, and identify independent energy contributions from fast and slow degrees of freedom. Furthermore, we develop a strategy for optimizing minimally dissipative protocols based on optimal transport flow matching, a generative machine learning technique. Furthermore, this latter approach ensures the scalability of both the theoretical and computational framework we put forth. Crucially, we demonstrate that we can compute the terms in our bound numerically using efficient algorithms from the computational optimal transport literature and that the protocols we learn saturate the bound.

59 BASIC BIOLOGICAL SCIENCES↗
NASA NTRS1999

Computer Modeling of Sand Transport on Mars Using a Compart-Mentalized Fluids Algorithm (CFA)

It has been postulated that aeolian transport on Mars may be significantly different from that on Earth. From laboratory experiments simulating martian grain transport [2], it has been observed that (saltating) grains striking the bed can cause hundreds of secondary reptation trajectories when impact occurs at speeds postulated for Mars. Some of the ballistically induced trajectories "die ouf' and effectively join the ranks on the creep population that is merely nudged along by impact. Many of the induced reptation trajectories, however, are sufficiently high for the grains to become part of the saltation load (it is irrelevant to the boundary layer how a grain attained its initial lift force). When these grains, in turn, strike the surface, they too are capable of inducing more reptating grains. This cascading effect has been discussed in connection with terrestrial aeolian transport in an attempt to dispel the notion that sand motion is divisible only into creep and saltation loads. On Earth, only a few grains are splashed by impact. On Mars, it may be hundreds. We developed a computer model to address this phenomenon because there are some important ramifications: First, this ratio may mean that martian aeolian transport is dominated by reptation flux rather than saltation. On Earth, the flux would be a roughly balanced mixture between reptation/creep and saltation. On Venus, there would be no transport other than by saltation. In other words, an understanding of planetary aeolian processes may not be necessarily understood by extrapolating from the "Earth case", with only gravity and atmospheric density/viscosity being considered as variables. Second, the reptation flux on Mars may be self sustaining, so that little input is required by the wind once transport has been initiated. The number of grains saturating the boundary layer near the bed may mean that average grain speed on Mars might conceivably be less than that on Earth. This would say much for models of sand comminution on Mars. A multiple-grain transport model using just the equations of grain motion describing lift and drag is impossible to develop owing to stochastic effects --the very effects we wish to model. Also, unless we were to employ supercomputing techniques and extremely complex computer codes that could deal with millions of grains simultaneously, it would also be difficult to model grain transport if we attempted to consider every grain in motion. No existing computer models were found that satisfactorily used the equations of motion to arrive at transport flux numbers for the different populations of saltation and reptation. Modeling all the grains in a transport system was an intractable problem within our resources, and thus we developed what we believe to be a new modeling approach to simulating grain transport. The CFA deals with grain populations, but considers them to belong to various compartmentalized fluid units in the boundary layer. In this way, the model circumvents the multigrain problem by dealing primarily with the consequences of grain transport --momentum transfer between air and grains, which is the physical essence of a dynamic grain-fluid mixture. We thus chose to model the aeolian transport process as a superposition of fluids. These fluids include the air as well as particle populations of various properties. The prime property distinguishing these fluids is upward and downward grain motion. In a normal saltation trajectory, a grain's downwind velocity increases with time, so a rising grain will have a smaller downwind velocity than a failing grain. Because of this disparity in rising and falling grain proper-ties, it seemed appropriate to track these as two separate grain populations within the same physical space. The air itself can be considered a separate fluid superimposed within and interacting with the various grain-cloud "fluids". Additional informaiton is contained in the original.

Marshall, J.↗
DOE OSTI2022

Flame acceleration and transition to detonation in a pre-/main-chamber combustion system

Numerical simulations are performed to study the mechanism of deflagration to detonation transition (DDT) in a pre-/main-chamber combustion system with a stoichiometric ethylene–oxygen mixture. A Godunov algorithm, fifth-order in space, and third-order in time, is used to solve the fully compressible Navier–Stokes equations on a dynamically adapting mesh. A single-step, calibrated chemical diffusive model described by Arrhenius kinetics is used for energy release and conservation between the fuel and the product. The two-dimensional simulation shows that a laminar flame grows in the pre-chamber and then develops into a jet flame as it passes through the orifice. A strong shock forms immediately ahead of the flame, reflecting off the walls and interacting with the flame front. The shock–flame interactions are crucial for the development of flame instabilities, which trigger the subsequent flame development. The DDT arises due to a shock-focusing mechanism, where multiple shocks collide at the flame front. A chemical explosive mode analysis (CEMA) criterion is developed to study the DDT ignition mode. Preliminary one-dimensional computations for a laminar propagating flame, a fast flame deflagration, and a Chapman–Jouguet detonation are conducted to demonstrate the validity of CEMA on the chemical-diffusive model, as well as to determine the proper conditioning value for CEMA diagnostic. The two-dimensional analysis with CEMA indicates that the DDT initiated by the shock-focusing mechanism can form a strong thermal expansion region at the flame front that features large positive eigenvalues for the chemical explosive mode and dominance of the local autoignition mode. Thus, the CEMA criterion proposed in this study provides a robust diagnostic for identifying autoignition-supported DDT, of which the emergence of excessive local autoignition mode is found to be a precursor. The effect of grid size, initial temperature, and orifice size are then evaluated, and results show that although the close-chamber DDT is highly stochastic, the detonation initiation mechanism remains robust.

42 ENGINEERING↗
DOE OSTI2017

Preface to the Special Issue on TOUGH Symposium 2015

The TOUGH Symposium 2015 was held in Berkeley, California, September 28-30, 2015. The TOUGH family of codes, developed at the Energy Geosciences Division of Lawrence Berkeley National Laboratory (LBNL), is a suite of computer programs for the simulation of multiphase and multicomponent fluid and heat flows in porous and fractured media with applications in many geosciences fields, such as geothermal reservoir engineering, nuclear waste disposal, geological carbon sequestration, oil and gas reservoirs, gas hydrate research, vadose zone hydrology and environmental remediation. Since the first release in the 1980s, many modifications and enhancements have been continuously made to TOUGH and its various descendants (iTOUGH2, TOUGH+, TOUGH-MP, TOUGHREACT, TOUGH+HYDRATE, TMVOC...), at LBNL and elsewhere. Today, these codes are used worldwide in academia, government organizations and private companies in problems involving coupled hydrological, thermal, biogeochemical and geomechanical processes. The Symposia, organized every 2-3 years, bring together developers and users for an open exchange on recent code enhancements and applications. In 2015, the Symposium was attended by one hundred participants, representing thirty-four nationalities. This Special Issue in Computers & Geosciences gathers extended versions of selected Symposium proceedings related to (i) recent enhancements to the TOUGH family of codes and (ii) coupled flow and geomechanics processes modeling. In this special issue, a paper by Jung et al. provides a new base version of TOUGH, TOUGH3. This latest version addresses the computational robustness and efficiency needed for the increasing complexity of the simulated processes and the growing size of model domains. Moreover, it consolidates the serial and parallel versions into a single code, hence, inconsistencies between different versions are less likely to occur, and code maintenance and development become more efficient. Finsterle et al. present a review of the capabilities of iTOUGH2 and illustrate the workflow of an integrated simulation-optimization framework. Liu et al. present an approach to reduce the computational cost of performing Bayesian inverse modeling and demonstrate their approach using a synthetic experiment simulated with TOUGH2. Regarding the mesh generation process, the paper by Doughty presents a generalization of the grid-generation algorithm embedded in TOUGH2 (MESHMAKER) to create one-column grids with fractal dimension, useful for representing flow through fractures or highly heterogeneous media with fractal geometry, and also for inverse methods. Sentís and Gable present a module to interface the open source code Lagrit with TOUGH2, that assists in the processes of mesh generation and model setup, and that can be particularly useful for complex geometries and large models. Bonduà et al. present a pre-processing tool (VORO2MESH) that features a full 3D Voronoi approach for structured and unstructured grids, and an enhanced post-processor (TOUGH2Viewer) for the visualization of 3D Voronoi grids. The literature review shows that coupled fluid flow and geomechanics has gained increasing attention in the last years in many geosciences fields. In this context, several codes of the TOUGH family have been successfully coupled with geomechanics software. The paper by Rutqvist presents a review of some of these TOUGH-based geomechanics models, of which the TOUGH-FLAC simulator – presented for the first time in the TOUGH Symposium 2003 – is well-known worldwide and has been used in a large variety of applications, encompassing the application domains of the TOUGH codes. Blanco-Martín et al. present an extension of TOUGH-FLAC to the finite strain framework, motivated by the existence of large strains associated with rock salt deformation in the context of heat-generating nuclear waste disposal. Following a paper published in the Special Issue of the TOUGH Symposium 2012 in this journal, Kim et al. present the current status of the TOUGH-RSBN simulator for coupled hydro-mechanical modeling of hydraulic fracturing using a discrete fracture network approach, and present some validation and demonstration cases. Rinaldi and Nespoli present TOUGH-SEED, an injection-induced seismicity modeling approach using TOUGH2 and a geomechanics stochastic model, and apply it to the Basel EGS project. Finally, Rinaldi et al. use the PEST protocol implemented in iTOUGH2, combined with TOUGH-FLAC as the forward model, to perform inverse modeling for the In Salah CO2 demonstration site in Algeria. Using pore pressures and InSAR displacements as observations, this approach allows for a multi-physics joint inversion and takes advantage of the inverse capabilities of iTOUGH2 (parameter estimation, sensitivity analysis, uncertainty estimation …), applied to coupled fluid flow and geomechanics. On behalf of the members of the TOUGH Symposium 2015 Organizing Committee, I hope that this collection of papers will provide the readers of Computers & Geosciences with a recent view of the capabilities of the TOUGH family of codes, as well as with current modeling research domains in the geosciences. Last but not least, I would like to express my gratitude to all the reviewers who kindly contributed to this Special Issue, as well as the Journal staff who have made this publication possible.

99 GENERAL AND MISCELLANEOUS↗
DOE OSTI2020

TurboRVB: A many-body toolkit for ab initio electronic simulations by quantum Monte Carlo

TurboRVB is a computational package for ab initio Quantum Monte Carlo (QMC) simulations of both molecular and bulk electronic systems. The code implements two types of well established QMC algorithms: Variational Monte Carlo (VMC) and diffusion Monte Carlo in its robust and efficient lattice regularized variant. A key feature of the code is the possibility of using strongly correlated many-body wave functions (WFs), capable of describing several materials with very high accuracy, even when standard mean-field approaches [e.g., density functional theory (DFT)] fail. The electronic WF is obtained by applying a Jastrow factor, which takes into account dynamical correlations, to the most general mean-field ground state, written either as an antisymmetrized geminal power with spin-singlet pairing or as a Pfaffian, including both singlet and triplet correlations. This WF can be viewed as an efficient implementation of the so-called resonating valence bond (RVB) Ansatz, first proposed by Pauling and Anderson in quantum chemistry [L. Pauling, The Nature of the Chemical Bond (Cornell University Press, 1960)] and condensed matter physics [P.W. Anderson, Mat. Res. Bull 8, 153 (1973)], respectively. The RVB Ansatz implemented in TurboRVB has a large variational freedom, including the Jastrow correlated Slater determinant as its simplest, but nontrivial case. Moreover, it has the remarkable advantage of remaining with an affordable computational cost, proportional to the one spent for the evaluation of a single Slater determinant. Therefore, its application to large systems is computationally feasible. The WF is expanded in a localized basis set. Several basis set functions are implemented, such as Gaussian, Slater, and mixed types, with no restriction on the choice of their contraction. The code implements the adjoint algorithmic differentiation that enables a very efficient evaluation of energy derivatives, comprising the ionic forces. Thus, one can perform structural optimizations and molecular dynamics in the canonical NVT ensemble at the VMC level. For the electronic part, a full WF optimization (Jastrow and antisymmetric parts together) is made possible, thanks to state-of-the-art stochastic algorithms for energy minimization. In the optimization procedure, the first guess can be obtained at the mean-field level by a built-in DFT driver. The code was efficiently parallelized by using a hybrid MPI-OpenMP protocol, which is also an ideal environment for exploiting the computational power of modern Graphics Processing Unit accelerators.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗