Search NASA⌕ Search

SEARCH · Search NASA

Results for “Computationally efficient surrogate modeling”

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 289 records · Page 16

A Bayesian Approach to Real-Time Dynamic Parameter Estimation Using Phasor Measurement Unit Measurement

Here, we develop a polynomial-chaos-expansion (PCE)-based approach for decentralized dynamic parameter estimation through Bayesian inference. Using this approach, the non-Gaussian distribution of the inverted parameters is obtained. More specifically, we first represent the decentralized generator model with the PCE-based surrogate. This surrogate allows us to efficiently evaluate the time-consuming dynamic solver at parameter values through Metropolis-Hastings (M-H)-based Markov chain Monte Carlo (MCMC). Then, we propose a two-stage hybrid Markov chain Monte Carlo (MCMC) to recover a posteriori distribution of the decentralized generator model parameters. In the first stage, we use the gradient-enhanced Langevin MCMC algorithm to characterize an intermediate posterior parameter distribution. This algorithm is computationally scalable to the high-dimensional parameter space. Based on the intermediate posterior distribution, during the second stage, we use the adaptive MCMC algorithm to fine-tune the strong correlations between the parameters. Finally, the fully recovered a posterior distribution is obtained in the end. The simulation results show that the proposed PCE-based hybrid MCMC algorithm can accurately and efficiently estimate the high-dimensional generator dynamic model parameters with full probabilistic distribution provided.

42 ENGINEERING↗

A Strategy for NACS investment in Machine Learning

The Nuclear and Chemical Sciences (NACS) Division furnishes the expertise in the scientific areas of chemical, nuclear and isotopic sciences that are foundational in the Laboratory’s national security missions. This expertise is maintained and advanced through identification, development and application of state-of-the-art theoretical, computational and experimental methods and tools. Recent developments in artificial intelligence and machine learning (AI/ML) techniques enabled by advances in computing capabilities and widespread availability of powerful software implementations have made use of these techniques ubiquitous across both science and industry. While the scope of AI/ML applications is incredibly large and evolves very rapidly, the topics most relevant to NACS missions fall into the general category of detecting, categorizing or identifying features in large, complex datasets using either supervised or unsupervised learning. This covers both basic scientific data analysis and the development of efficient surrogate models of real-life technological systems, experimental detectors, or theoretical models. To remain at the forefront of its core scientific disciplines, NACS must both cultivate ML expertise as well as continuously explore applying this expertise to new problems or utilizing new methods. This document identifies the key areas where this support is critical and provides a strategy for investing in them.

38 RADIATION CHEMISTRY, RADIOCHEMISTRY, AND NUCLEA↗

Enhancing Lattice Kinetic Schemes for Fluid Dynamics with Lattice-Equivariant Neural Networks

A new class of equivariant neural networks is presented, hereby dubbed lattice-equivariant neural networks (LENNs), designed to satisfy local symmetries of a lattice structure. The approach develops within a recently introduced framework aimed at learning neural network-based surrogate models’ lattice Boltzmann collision operators. Whenever neural networks are employed to model physical systems, respecting symmetries and equivariance properties has been shown to be key for accuracy, numerical stability, and performance. Here, hinging on ideas from group representation theory, trainable layers are defined whose algebraic structure is equivariant with respect to the symmetries of the lattice cell. In this work, the presented method naturally allows for efficient implementations, in terms of both memory usage and computational costs, supporting scalable training/testing for lattices in two spatial dimensions and higher (in which the size of symmetry group grows). The approach is validated and tested considering 2D and 3D flowing dynamics, both in laminar and turbulent regimes. It is compared with group-averaged-based symmetric networks and with plain, nonsymmetric, networks, showing how the presented approach unlocks the (a posteriori) accuracy and training stability of the former models and the train/inference speed of the latter networks. (LENNs are about one order of magnitude faster than group-averaged networks in 3D.) The work in this paper opens toward practical use of machine learning-augmented lattice Boltzmann CFD in real-world simulations.

97 MATHEMATICS AND COMPUTING↗

A framework for strategic discovery of credible neural network surrogate models under uncertainty

The widespread integration of deep neural networks in developing data-driven surrogate models for high-fidelity simulations of complex physical systems highlights the critical necessity for robust uncertainty quantification techniques and credibility assessment methodologies, ensuring the reliable deployment of surrogate models in consequential decision-making. Here, this study presents the Occam Plausibility Algorithm for surrogate models (OPAL-surrogate), providing a systematic framework to uncover predictive neural network-based surrogate models within the large space of potential models, including various neural network classes and choices of architecture and hyperparameters. The framework is grounded in hierarchical Bayesian inferences and employs model validation tests to evaluate the credibility and prediction reliability of the surrogate models under uncertainty. Leveraging these principles, OPAL-surrogate introduces a systematic and efficient strategy for balancing the trade-off between model complexity, accuracy, and prediction uncertainty. The effectiveness of OPAL-surrogate is demonstrated through two modeling problems, including the deformation of porous materials for building insulation and turbulent combustion flow for ablation of solid fuels within hybrid rocket motors.

42 ENGINEERING↗

Evaluation of Spray and Combustion Models for Simulating Dilute Combustion in a Direct-Injection Spark-Ignition Engine

Dilute combustion in spark-ignition engines has the potential to improve thermal efficiency by mitigating knock and by reducing throttling and wall heat losses. However, ignition and combustion processes can become unstable for dilute operation due to a lowered laminar flame speed, resulting in excessive cycle-to-cycle variability (CCV) of the combustion process. To compensate for the slower combustion in less reactive mixtures, a modified intake port geometry can be employed to generate a strong tumble flow in the cylinder and elevate turbulence levels around the spark plug, thereby promoting a faster transition to turbulent deflagration. Consequently, optimizing combustion chamber geometry and operating strategy is crucial to maximizing the benefits of using dilute combustion with enhanced in-cylinder turbulence across a wide range of operating conditions. Computational fluid dynamics (CFD) simulations can be utilized for virtual engine optimization tasks, but this would require the models to be truly predictive regarding the impact of changes to the engine design and operational parameters.In this study, multicycle large-eddy simulations (LES) are performed for a direct-injection spark-ignition engine to investigate the model performance in predicting engine combustion characteristics with respect to changes in the intake configuration. A tumble plate that blocks the lower part of the intake port inlet is used to vary the tumble. A set of CFD models that have been recently developed are employed, which takes into account the drag of nonspherical droplets, flash-boiling behavior of liquid sprays, spray-wall interaction, surrogate formulation of a research-grade E10 gasoline, and fast chemical kinetic solvers. Simulation results are compared to experimental engine data in terms of cylinder pressure, apparent heat release rate, mass fraction burned timing, and flame images. It is found that LES employing the state-of-the-art CFD models are capable of properly predicting the spray processes and reproducing the measured mean cylinder pressure for the case with the tumble plate. On the other hand, the LES over-predicts the combustion rate during the early combustion stage and under-estimates the CCV, and these discrepancies become larger when the tumble plate is removed.

computational fluid dynamics simulation↗

An adaptive Gaussian process-based method for efficient Bayesian experimental design in groundwater contaminant source identification problems: ADAPTIVE GAUSSIAN PROCESS-BASED INVERSION

Surrogate models are commonly used in Bayesian approaches such as Markov Chain Monte Carlo (MCMC) to avoid repetitive CPU-demanding model evaluations. However, the approximation error of a surrogate may lead to biased estimations of the posterior distribution. This bias can be corrected by constructing a very accurate surrogate or implementing MCMC in a two-stage manner. Since the two-stage MCMC requires extra original model evaluations, the computational cost is still high. If the information of measurement is incorporated, a locally accurate approximation of the original model can be adaptively constructed with low computational cost. Based on this idea, we propose a Gaussian process (GP) surrogate-based Bayesian experimental design and parameter estimation approach for groundwater contaminant source identification problems. A major advantage of the GP surrogate is that it provides a convenient estimation of the approximation error, which can be incorporated in the Bayesian formula to avoid over-confident estimation of the posterior distribution. The proposed approach is tested with a numerical case study. Without sacrificing the estimation accuracy, the new approach achieves about 200 times of speed-up compared to our previous work using two-stage MCMC.

Zhang, Jiangjiang↗

Accelerate microstructure evolution simulation using graph neural networks with adaptive spatiotemporal resolution

Abstract Surrogate models driven by sizeable datasets and scientific machine-learning methods have emerged as an attractive microstructure simulation tool with the potential to deliver predictive microstructure evolution dynamics with huge savings in computational costs. Taking 2D and 3D grain growth simulations as an example, we present a completely overhauled computational framework based on graph neural networks with not only excellent agreement to both the ground truth phase-field methods and theoretical predictions, but enhanced accuracy and efficiency compared to previous works based on convolutional neural networks. These improvements can be attributed to the graph representation, both improved predictive power and a more flexible data structure amenable to adaptive mesh refinement. As the simulated microstructures coarsen, our method can adaptively adopt remeshed grids and larger timesteps to achieve further speedup. The data-to-model pipeline with training procedures together with the source codes are provided.

36 MATERIALS SCIENCE↗

Effectively using multifidelity optimization for wind turbine design

Abstract. Wind turbines are complex multidisciplinary systems that are challenging to design because of the tightly coupled interactions between different subsystems. Computational modeling attempts to resolve these couplings so we can efficiently explore new wind turbine systems early in the design process. Low-fidelity models are computationally efficient but make assumptions and simplifications that limit the accuracy of design studies, whereas high-fidelity models capture more of the actual physics but with increased computational cost. This paper details the use of multifidelity methods for optimizing wind turbine designs by using information from both low- and high-fidelity models to find an optimal solution at reduced cost. Specifically, a trust-region approach is used with a novel corrective function built from a nonlinear surrogate model. We find that for a diverse set of design problems – with examples given in rotor blade geometry design, wind turbine controller design, and wind power plant layout optimization – the multifidelity method finds the optimal design using 38 %–58 % of the computational cost of the high-fidelity-only optimization. The success of the multifidelity method in disparate applications suggests that it could be more broadly applied to other wind energy or otherwise generic applications.

17 WIND ENERGY↗

Machine learning framework for quantum sampling of highly constrained, continuous optimization problems

In recent years, there is growing interest in using quantum computers for solving combinatorial optimization problems. In this work, we developed a generic, machine learning-based framework for mapping continuous-space inverse design problems into surrogate quadratic unconstrained binary optimization (QUBO) problems by employing a binary variational autoencoder and a factorization machine. The factorization machine is trained as a low-dimensional, binary surrogate model for the continuous design space and sampled using various QUBO samplers. Using the D-Wave Advantage hybrid sampler and simulated annealing, we demonstrate that by repeated resampling and retraining of the factorization machine, our framework finds designs that exhibit figures of merit exceeding those of its training set. We showcase the framework’s performance on two inverse design problems by optimizing (i) thermal emitter topologies for thermophotovoltaic applications and (ii) diffractive meta-gratings for highly efficient beam steering. This technique can be further scaled to leverage future developments in quantum optimization to solve advanced inverse design problems for science and engineering applications.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Application and Evaluation of Surrogate Models for Radiation Source Search

Surrogate models are increasingly required for applications in which first-principles simulation models are prohibitively expensive to employ for uncertainty analysis, design, or control. They can also be used to approximate models whose discontinuous derivatives preclude the use of gradient-based optimization or data assimilation algorithms. We consider the problem of inferring the 2D location and intensity of a radiation source in an urban environment using a ray-tracing model based on Boltzmann transport theory. Whereas the code implementing this model is relatively efficient, extension to 3D Monte Carlo transport simulations precludes subsequent Bayesian inference to infer source locations, which typically requires thousands to millions of simulations. Additionally, the resulting likelihood exhibits discontinuous derivatives due to the presence of buildings. To address these issues, we discuss the construction of surrogate models for optimization, Bayesian inference, and uncertainty propagation. Specifically, we consider surrogate models based on Legendre polynomials, multivariate adaptive regression splines, radial basis functions, Gaussian processes, and neural networks. We detail strategies for computing training points and discuss the merits and deficits of each method.

Cook, Jared A.↗

GP Cosmology Surrogate v1.0

GP Cosmology Surrogate is a Python library for building and training a generalized multi-output Gaussian process (GP) framework of @takhtaganov2021cosmic. In this approach, the surrogate is constructed sequentially, guided by a Bayesian optimization acquisition function that targets reduction of emulation error in the regions most consistent with the observational data. This adaptive design concentrates computational resources where they have the greatest impact on inference accuracy. The library supports efficient training for separable GP kernels, which allows the use of Kronecker algebra to handle high-dimensional input spaces and large numbers of correlated outputs. This makes it well suited for applications such as modeling cosmological power spectra, large-scale physical simulations, and multi-output hyperparameter tuning. By combining scalable multi-output GP modeling with data-driven adaptive sampling, GPsurrogate enables parameter inference and optimization with substantially fewer simulations than conventional space-filling designs.

Lukic, Zarija [Lawrence Berkeley National Laborato↗

Uncertainty propagation of p-boxes using sparse polynomial chaos expansions

In modern engineering, physical processes are modelled and analysed using advanced computer simulations, such as finite element models. Furthermore, concepts of reliability analysis and robust design are becoming popular, hence, making efficient quantification and propagation of uncertainties an important aspect. In this context, a typical workflow includes the characterization of the uncertainty in the input variables. In this paper, input variables are modelled by probability-boxes (p-boxes), accounting for both aleatory and epistemic uncertainty. The propagation of p-boxes leads to p-boxes of the output of the computational model. A two-level meta-modelling approach is proposed using non-intrusive sparse polynomial chaos expansions to surrogate the exact computational model and, hence, to facilitate the uncertainty quantification analysis. The capabilities of the proposed approach are illustrated through applications using a benchmark analytical function and two realistic engineering problem settings. They show that the proposed two-level approach allows for an accurate estimation of the statistics of the response quantity of interest using a small number of evaluations of the exact computational model. This is crucial in cases where the computational costs are dominated by the runs of high-fidelity computational models.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Propagating Parameter Uncertainty in Power System Nonlinear Dynamic Simulations Using a Koopman Operator-Based Surrogate Model

In this work, we propose a Koopman operator-based surrogate model for propagating parameter uncertainties in power system nonlinear dynamic simulations. First, we augment a priori known state-space model by reformulating parameters deemed uncertain as pseudo-state variables. Then, we apply the Koopman operator theory to the resulting state-space model and obtain a linear dynamical system model. This transformation allows us to analyze the evolution of the system dynamics through its Koopman eigenfunctions, eigenvalues, and modes. Of particular importance for this letter, the obtained linear dynamical system is a surrogate that enables the evaluation of parameter uncertainties by simply perturbing the initial conditions of the Koopman eigenfunctions associated with the pseudo-state variables. Simulations carried out on the New England test system reveal the excellent performance of the proposed method in terms of accuracy and computational efficiency.

24 POWER TRANSMISSION AND DISTRIBUTION↗

ML-based Dimension Reduction Strategies

Deep learning (DL)--based surrogate models have achieved success in various applications in carbon capture and storage (CCS). However, the model training on high-dimensional spaces is computationally expensive and impractical for large-scale and complex geological models, because the models usually contain hundreds of thousands to millions of grid cells, each with a set of parameters. Furthermore, the high cost of generating training data with sufficient variation is another limitation of model training on high-dimensional spaces, which may result in overfitting and reduce the model efficiency and prediction performance. We proposed the workflow incorporating dimension reduction methods and deep learning models, which aim to extract the latent variables of input parameters and output state variables, and then build the mapping function at the latent spaces. The proposed workflow can significantly reduce the computational complexity in solving both forward and inverse problems compared to models trained on high-dimensional spaces. Dimensionality reduction models showed great potential in workflows for fast reservoir simulation, history matching, prior model generation, visualization, and more, ultimately enhancing DL model performance in related SMART Work Packages.

Hosseini, Seyyed↗

Fast and Precise Trajectory Simulation for Entry, Descent, and Landing Using A Multi-Model Monte Carlo Approach

Predicting landing radius and other quantities of interest (QoI) for entry, descent, and landing (EDL) applications requires a viable uncertainty propagation method for quantifying the impact of uncertainties in wind pattern variations, atmospheric uncertainties, etc. While standard MC simulation is the defacto standard for providing robust and unbiased predictions,it is often infeasible for expensive, high-fidelity EDL models. Low-fidelity models are commonly constructed to replace the high-fidelity model in MC simulation for computational speedup,but at the expense of accuracy and unbiasedness. Emerging multi-model MC methods are bridging this gap by combining predictions from two or more models of varying fidelity and computational cost for efficient and unbiased uncertainty propagation. This work explores the use of multi-model MC for increasing the speed and precision of trajectory simulation for EDL. It is shown that combining a high-fidelity EDL model with low-fidelity models (e.g,data-driven, reduced physics) yields substantial computational speedup versus standard MCwith only the high-fidelity model. Moreover, the unbiasedness of multi-model MC predictions is highlighted by showing increased accuracy versus an approach that leverages a low-fidelity surrogate model alone.

James E. Warner↗

An finite element analysis surrogate model with boundary oriented graph embedding approach for rapid design

Abstract In this work, we present a boundary oriented graph embedding (BOGE) approach for the graph neural network to assist in rapid design and digital prototyping. The cantilever beam problem has been solved as an example to validate its potential of providing physical field results and optimized designs using only 10 ms. Providing shortcuts for both boundary elements and local neighbor elements, the BOGE approach can embed unstructured mesh elements into the graph and performs an efficient regression on large-scale triangular-mesh-based finite element analysis (FEA) results, which cannot be realized by other machine-learning-based surrogate methods. It has the potential to serve as a surrogate model for other boundary value problems. Focusing on the cantilever beam problem, the BOGE approach with 3-layer DeepGCN model achieves the regression with mean square error (MSE) of 0.011 706 (2.41% mean absolute percentage error) for stress field prediction and 0.002 735 MSE (with 1.58% elements having error larger than 0.01) for topological optimization. The overall concept of the BOGE approach paves the way for a general and efficient deep-learning-based FEA simulator that will benefit both industry and Computer Aided Design (CAD) design-related areas.

42 ENGINEERING↗

ytopt: Autotuning Scientific Applications for Energy Efficiency at Large Scales

As we enter the exascale computing era, efficiently utilizing power and optimizing the performance of scientific applications under power and energy constraints has become critical and challenging. We propose a low-overhead autotuning framework to autotune performance and energy for various hybrid MPI/OpenMP scientific applications at large scales and to explore the tradeoffs between application runtime and power/energy for energy efficient application execution, then use this framework to autotune four ECP proxy applications—XSBench, AMG, SWFFT, and SW4lite. Our approach uses Bayesian optimization with a Random Forest surrogate model to effectively search parameter spaces with up to 6 million different configurations on two large-scale HPC production systems, Theta at Argonne National Laboratory and Summit at Oak Ridge National Laboratory. The experimental results show that our autotuning framework at large scales has low overhead and achieves good scalability. Using the proposed autotuning framework to identify the best configurations, we achieve up to 91.59% performance improvement, up to 21.2% energy savings, and up to 37.84% EDP (energy delay product) improvement on up to 4096 nodes.

Autotuning↗

Rigorous Data Fusion for Computationally Expensive Simulations

This manuscript comprises the final report for the 1-year, FY19 LDRD project "Rigorous Data Fusion for Computationally Expensive Simulations," wherein an alternative approach to Bayesian calibration was developed based a new sampling technique called VoroSpokes. Vorospokes is a novel quadrature and sampling framework defined with respect to Voronoi tessellations of bounded domains in $R^d$ developed within this project. In this work, we first establish local quadrature and sampling results on convex polytopes using randomly directed rays, or spokes, to approximate the quantities of interest for a specified target function. A theoretical justification for both procedures is provided along with empirical results demonstrating the unbiased convergence in the resulting estimates/samples. The local quadrature and sampling procedures are then extended to global procedures defined on more general domains by applying the local results to the cells of a Voronoi tessellation covering the domain in consideration. We then demonstrate how the proposed global sampling procedure can be used to define a natural framework for adaptively constructing Voronoi Piecewise Surrogate (VPS) approximations based on local error estimates. Finally, we show that the adaptive VPS procedure can be used to form a surrogate model approximation to a specified, potentially unnormalized, density function, and that the global sampling procedure can be used to efficiently draw independent samples from the surrogate density in parallel. The performance of the resulting VoroSpokes sampling framework is assessed on a collection of Bayesian inference problems and is shown to provide highly accurate posterior predictions which align with the results obtained using traditional methods such as Gibbs sampling and random-walk Markov Chain Monte Carlo (MCMC). Importantly, the proposed framework provides a foundation for performing Bayesian inference tasks which is entirely independent from the theory of Markov chains.

97 MATHEMATICS AND COMPUTING↗