Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Adaptive Sampling”

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 73 records · Page 4
All sourcesNASA NTRSDOE OSTI
DOE OSTI2018

Convergence and Efficiency of Adaptive Importance Sampling Techniques with Partial Biasing

We propose a new Monte Carlo method to efficiently sample a multimodal distribution (known up to a normalization constant). We consider a generalization of the discrete-time Self Healing Umbrella Sampling method, which can also be seen as a generalization of well-tempered metadynamics. The dynamics is based on an adaptive importance technique. The importance function relies on the weights (namely the relative probabilities) of disjoint sets which form a partition of the space. These weights are unknown but are learnt on the fly yielding an adaptive algorithm. In the context of computational statistical physics, the logarithm of these weights is, up to an additive constant, the free-energy, and the discrete valued function defining the partition is called the collective variable. The algorithm falls into the general class of Wang–Landau type methods, and is a generalization of the original Self Healing Umbrella Sampling method in two ways: (i) the updating strategy leads to a larger penalization strength of already visited sets in order to escape more quickly from metastable states, and (ii) the target distribution is biased using only a fraction of the free-energy, in order to increase the effective sample size and reduce the variance of importance sampling estimators. We prove the convergence of the algorithm and analyze numerically its efficiency on a toy example.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Autonomous adaptive data acquisition for scanning hyperspectral imaging

Non-invasive and label-free spectral microscopy (spectromicroscopy) techniques can provide quantitative biochemical information complementary to genomic sequencing, transcriptomic profiling, and proteomic analyses. However, spectromicroscopy techniques generate high-dimensional data; acquisition of a single spectral image can range from tens of minutes to hours, depending on the desired spatial resolution and the image size. This substantially limits the timescales of observable transient biological processes. To address this challenge and move spectromicroscopy towards efficient real-time spatiochemical imaging, we developed a grid-less autonomous adaptive sampling method. Our method substantially decreases image acquisition time while increasing sampling density in regions of steeper physico-chemical gradients. When implemented with scanning Fourier Transform infrared spectromicroscopy experiments, this grid-less adaptive sampling approach outperformed standard uniform grid sampling in a two-component chemical model system and in a complex biological sample, Caenorhabditis elegans. We quantitatively and qualitatively assess the efficiency of data acquisition using performance metrics and multivariate infrared spectral analysis, respectively.

47 OTHER INSTRUMENTATION↗
DOE OSTI2023

Sample Type Adaptable RNA depletion performance data [Slides]

Sequencing data was aligned to rRNA data sets QIIME_16S_MiDAS_4.8.1 and SILVA_138.1_LSURef_NR99 using BWA. RNA used was a composite (pool) of wastewater RNA samples collected at LANL between April 2022 and December 2022. RNA sample was split into four aliquots (STAR depletion and STAR depletion no-probe-control as well as RiboZero and RiboZero no-probe-control). All sequencing libraries were prepared from the depleted RNA samples using the same library prep method and sequenced on Illumina platforms.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2021

Comprehensive Material Characterization and Simultaneous Model Calibration for Improved Computational Simulation Credibility

Computational simulation is increasingly relied upon for high-consequence engineering decisions, and a foundational element to solid mechanics simulations is a credible material model. Our ultimate vision is to interlace material characterization and model calibration in a real-time feedback loop, where the current model calibration results will drive the experiment to load regimes that add the most useful information to reduce parameter uncertainty. The current work investigated one key step to this Interlaced Characterization and Calibration (ICC) paradigm, using a finite load-path tree to incorporate history/path dependency of nonlinear material models into a network of surrogate models that replace computationally-expensive finite-element analyses. Our reference simulation was an elastoplastic material point subject to biaxial deformation with a Hill anisotropic yield criterion. Training data was generated using either a space-filling or adaptive sampling method, and surrogates were built using either Gaussian process or polynomial chaos expansion methods. Surrogate error was evaluated to be on the order of 10 ⁻5 and 10 ⁻3 percent for the space-filling and adaptive sampling training data, respectively. Direct Bayesian inference was performed with the surrogate network and with the reference material point simulator, and results agreed to within 3 significant figures for the mean parameter values, with a reduction in computational cost over 5 orders of magnitude. These results bought down risk regarding the surrogate network and facilitated a successful FY22-24 full LDRD proposal to research and develop the complete ICC paradigm.

36 MATERIALS SCIENCE↗
DOE OSTI2022

Sample-Efficient Adaptive Calibration of Quantum Networks Using Bayesian Optimization

All physical systems employed for quantum information tasks must act as unbiased carriers of encoded quantum states. Ensuring such indistinguishability of information carriers is a major challenge in many quantum information applications, including advanced quantum communication protocols. For photons, the workhorses of quantum communication networks, it is difficult to obtain and maintain their indistinguishability because of environment-induced transformations and loss imparted by communication channels, especially in noisy scenarios. Conventional strategies to mitigate these transformations often require hardware or software overhead that is restrictive (e.g., adding noise), infeasible (e.g., on a satellite), or time-consuming for deployed networks. In this work we propose and develop resource-efficient Bayesian optimization techniques to rapidly and adaptively calibrate the indistinguishability of individual photons for quantum networks using only information derived from their measurement. To experimentally validate our approach, we demonstrate the optimization of Hong-Ou-Mandel interference between two photons-a central task in quantum networking- finding rapid, efficient, and reliable convergence towards maximal photon indistinguishability in the presence of high loss and shot noise. We expect our resource-optimized and experimentally friendly methodology will allow fast and reliable calibration of indistinguishable quanta, a necessary task in distributed quantum computing, communications, and sensing, as well as for fundamental investigations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2016

A Distributed-Memory Package for Dense Hierarchically Semi-Separable Matrix Computations Using Randomization

In this paper, we present a distributed-memory library for computations with dense structured matrices. A matrix is considered structured if its off-diagonal blocks can be approximated by a rank-deficient matrix with low numerical rank. Here, we use Hierarchically Semi-Separable (HSS) representations. Such matrices appear in many applications, for example, finite-element methods, boundary element methods, and so on. Exploiting this structure allows for fast solution of linear systems and/or fast computation of matrix-vector products, which are the two main building blocks of matrix computations. The compression algorithm that we use, that computes the HSS form of an input dense matrix, relies on randomized sampling with a novel adaptive sampling mechanism. We discuss the parallelization of this algorithm and also present the parallelization of structured matrix-vector product, structured factorization, and solution routines. The efficiency of the approach is demonstrated on large problems from different academic and industrial applications, on up to 8,000 cores. Finally, this work is part of a more global effort, the STRUctured Matrices PACKage (STRUMPACK) software package for computations with sparse and dense structured matrices. Hence, although useful on their own right, the routines also represent a step in the direction of a distributed-memory sparse solver.

98 NUCLEAR DISARMAMENT, SAFEGUARDS, AND PHYSICAL P↗
DOE OSTI2013

An Uncertainty Quantification Framework for Studying the Effect of Spatial Heterogeneity in Reservoir Permeability on CO2 Sequestration

In this paper, we introduce an uncertainty quantification (UQ) software framework for carbon sequestration, focused on the effect of spatial heterogeneity of reservoir properties on CO2 migration. We use a sequential Gaussian method (SGSIM) to generate realizations of permeability fields with various spatial statistical attributes. To deal with the computational difficulties, we integrate the following ideas/approaches. First, we use three different sampling approaches (probabilistic collocation, quasi-Monte Carlo, and adaptive sampling) to reduce the number of forward calculations while trying to explore the parameter space and quantify the input uncertainty. Second, we use eSTOMP as the forward modeling simulator. eSTOMP is implemented with the Global Arrays toolkit that is based on one-sided inter-processor communication and supports a shared memory programming style on distributed memory platforms, providing a highly-scalable performance. Third, we built an adaptive system infrastructure to select the best possible data transfer mechanisms, to optimally allocate system resources to improve performance and to integrate software packages and data for composing carbon sequestration simulation, computation, analysis, estimation and visualization. We demonstrate the framework with a given CO2 injection scenario in heterogeneous sandstone reservoirs.

Carbon sequestration, uncertainty quantification, ↗
DOE OSTI2014

Uncertainty analyses of CO2 plume expansion subsequent to wellbore CO2 leakage into aquifers

In this study, we apply an uncertainty quantification (UQ) framework to CO2 sequestration problems. In one scenario, we look at the risk of wellbore leakage of CO2 into a shallow unconfined aquifer in an urban area; in another scenario, we study the effects of reservoir heterogeneity on CO2 migration. We combine various sampling approaches (quasi-Monte Carlo, probabilistic collocation, and adaptive sampling) in order to reduce the number of forward calculations while trying to fully explore the input parameter space and quantify the input uncertainty. The CO2 migration is simulated using the PNNL-developed simulator STOMP-CO2e (the water-salt-CO2 module). For computationally demanding simulations with 3D heterogeneity fields, we combined the framework with a scalable version module, eSTOMP, as the forward modeling simulator. We built response curves and response surfaces of model outputs with respect to input parameters, to look at the individual and combined effects, and identify and rank the significance of the input parameters.

Carbon sequestration, uncertainty quantification, ↗
DOE OSTI2024

Two-Stage Estimation and Variance Modeling for Latency-Constrained Variational Quantum Algorithms

The quantum approximate optimization algorithm (QAOA) has enjoyed increasing attention in noisy, intermediate-scale quantum computing with its application to combinatorial optimization problems. QAOA has the potential to demonstrate a quantum advantage for NP-hard combinatorial optimization problems. As a hybrid quantum-classical algorithm, the classical component of QAOA resembles a simulation optimization problem in which the simulation outcomes are attainable only through a quantum computer. The simulation that derives from QAOA exhibits two unique features that can have a substantial impact on the optimization process: (i) the variance of the stochastic objective values typically decreases in proportion to the optimality gap, and (ii) querying samples from a quantum computer introduces an additional latency overhead. In this paper, we introduce a novel stochastic trust-region method derived from a derivative-free, adaptive sampling trust-region optimization method intended to efficiently solve the classical optimization problem in QAOA by explicitly taking into account the two mentioned characteristics. The key idea behind the proposed algorithm involves constructing two separate local models in each iteration: a model of the objective function and a model of the variance of the objective function. Exploiting the variance model allows us to restrict the number of communications with the quantum computer and also helps navigate the nonconvex objective landscapes typical in QAOA optimization problems. In conclusion, we numerically demonstrate the superiority of our proposed algorithm using the SimOpt library and Qiskit when we consider a metric of computational burden that explicitly accounts for communication costs.

Derivative-free Optimization↗
DOE OSTI2022

Efficient data acquisition and training of collisional-radiative model artificial neural network surrogates through adaptive parameter space sampling

Abstract Effective plasma transport modeling of magnetically confined fusion devices relies on having an accurate understanding of the ion composition and radiative power losses of the plasma. Generally, these quantities can be obtained from solutions of a collisional-radiative (CR) model at each time step within a plasma transport simulation. However, even compact, approximate CR models can be computationally onerous to evaluate, and in-situ evaluation of these models within a larger plasma transport code can lead to a rigid bottleneck. As a way to bypass this bottleneck, we propose deploying artificial neural network (ANN) surrogates to allow rapid evaluation of the necessary plasma quantities. However, one issue with training an accurate ANN surrogate is the reliance on a sufficiently large and representative training and validation data set, which can be time-consuming to generate. In this work we explore a data-driven active learning and training routine to allow autonomous adaptive sampling of the problem parameter space to ensure a sufficiently large and meaningful set of training data is assembled for the network training. As a result, we can demonstrate approximately order-of-magnitude savings in required training data samples to produce an accurate surrogate.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Enabling Scale-Up Through Multi-Fidelity Adaptive Computing

We present ideas from our ongoing work in adaptive computing - an optimization framework that allows us to strategically deploy various fidelity level experiments and simulations to guide decision making. The framework aims to enable uncertainty quantified scale-up of simulations and experiments, which causes increased complexity. A key feature of the framework is the integration of user-specified local model trustworthiness estimates. Adaptive sampling strategies allow us to optimally exploit the multiple fidelity level information and trustworthiness measures to arrive at the best decisions within a highly limited budget of objective function evaluations.

adaptive sampling↗
DOE OSTI2023

Predicting rare events using neural networks and short-trajectory data

Estimating the likelihood, timing, and nature of events is a major goal of modeling stochastic dynamical systems. When the event is rare in comparison with the timescales of simulation and/or measurement needed to resolve the elemental dynamics, accurate prediction from direct observations becomes challenging. In such cases a more effective approach is to cast statistics of interest as solutions to Feynman-Kac equations (partial differential equations). Here, we develop an approach to solve Feynman-Kac equations by training neural networks on short-trajectory data. Our approach is based on a Markov approximation but otherwise avoids assumptions about the underlying model and dynamics. This makes it applicable to treating complex computational models and observational data. Additionally, we illustrate the advantages of our method using a low-dimensional model that facilitates visualization, and this analysis motivates an adaptive sampling strategy that allows on-the-fly identification of and addition of data to regions important for predicting the statistics of interest. Finally, we demonstrate that we can compute accurate statistics for a 75-dimensional model of sudden stratospheric warming. This system provides a stringent test bed for our method.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2014

The use of discrete harmonics in direct multi-scale embedding of polycrystal plasticity

In this work, we describe an approach for directly embedding polycrystal plasticity models in component scale calculations, with an emphasis on computational tractability. Previously, we have employed adaptive sampling to mitigate the computational cost of direct embedding, achieving two or more orders of magnitude in wall-clock speedup compared to more traditional approaches. However, in our previous work the crystal orientation distribution function (crystallographic texture) was not allowed to evolve significantly. Here we discuss an approach that allows for evolving texture by employing discrete harmonics, effectively decoupling considerations related to accuracy of integrals in the homogenization from those related to adequate representation of the evolving texture. We discuss the basic behaviors and convergence of the new polycrystal plasticity framework. Specific applications focus on the deformation of titanium, including the effects of twinning. Overall, the discrete harmonic based framework offers an attractive path forward for computationally efficient multi-scale embedding of polycrystal plasticity.

36 MATERIALS SCIENCE↗
DOE OSTI2024

Advanced multimaterial shape optimization methods as applied to advanced manufacturing of wind turbine generators

Abstract Currently, many utility‐scale wind turbine generator original equipment manufacturers are dependent on imported rare earth permanent magnets, which are susceptible to market risks from cost instability. To lower the production costs of these generators and stay competitive in the market, several small wind manufacturers are pursuing continuous improvements to both generator design and manufacturing. However, traditional design and manufacturing methods have yielded marginal improvements in wind power performance. This work presents novel methods to redesign a baseline 15‐kW wind turbine generator with reduced rare‐earth permanent magnets by leveraging cutting‐edge three‐dimensional (3D) printed polymer‐bonded permanent magnets and steel. Symmetric, asymmetric, and multimaterial‐magnet parametrization methods are introduced for shape optimization. We extend the symmetric and asymmetric methods to the back iron in the stator to further investigate the impact and opportunities for performance improvements with lesser active materials. We employ a design‐of‐experiments approach with parametric computer‐aided design for shape generation and evaluate different designs by magneto‐thermal modeling and finite‐element analysis. We use adaptive sampling technique to identify better performing designs with lesser magnet mass, higher efficiency, and lower cogging torque when compared with the baseline generator. Asymmetric pole designs resulted in a magnet mass in the range of 4.77–5.37 kg, which was 27%–35% lighter than the baseline generator, suggesting that a new design freedom exists that can be enabled by advanced manufacturing, such as 3D printing. Shaping the back iron in the stator resulted in material savings in electrical steel of up to 14.62 kg, which was 20% lighter than the baseline stator. We conducted a structural analysis to evaluate an optimized asymmetric rotor design from the point of view of mechanical integrity and air‐gap stiffness. The magnetically optimal shape profile was shown as having a positive impact on the radial stiffness, and an optimal solution was discovered to reduce the structural mass by nearly 30 kg, which was 29% lighter than the baseline.

17 WIND ENERGY↗
DOE OSTI2018

Modeling Mesoscale Processes of Scalable Synthesis Final Scientific/Technical Report

This is the final scientific and technical report for this award. Molecular dynamics (MD) is a powerful tool to study biomolecules at the nanoscale. One of its main limitations however is that such simulations typically require a timestep of 1 femtosecond while reactions and conformational changes typically happen on the time scale of 1 microsecond or more. This discrepancy severely restricts the impact of this method. We have developed a series of algorithms to mitigate this problem and allow predicting long-time scale events using much shorter simulations. The method is based on the concurrent adaptive sampling method. It consists in using probabilistic weights for trajectories and biasing the sampling such that rare but important trajectories, e.g., those that go over energy barriers and lead to relevant conformational changes in the molecule, are observed with much higher frequency that in a standard MD simulation. We will demonstrate below that this approach has been very successful. In collaboration with Jay Grate at PNNL we have applied this novel method to the study the triazine polymers, which can be con gured using different types of side chains in order to adopt different 3-dimensional structures. We have found novel stable con- formations and have analyzed the impact of side chain modifcations on the native folded shape of the polymer. Direct MD simulations would have been untractable for this problem. The method of replica exchange was also used successfully to calculate free energy profiles, in particular for cis-trans torsional angle changes with high energy barriers. Studying molecules at the atomistic scale is essential to design new molecules in chemical engineering, such as the triazine polymers developed by Grate, in material science to study the strength of metals for examples (e.g., dislocation dynamics), or in biochemistry to understand how proteins fold and how they interact with ligands (a key step in designing drugs). Although new hardware makes these simulations increasingly faster (e.g., GPU, Anton from DE Shaw Research), new algorithms are key to making these methods more tractable and increase their impact. At this point, because of limitations in modeling, one of the main techniques for advancing science remains to a large extent numerous and costly experiments. For exam- ple, when designing drug, where multiple variants must be screened, the ability to run tests on a computer rather than experimentally testing with high throughput methods thousands of compounds would represent a signi cant advance with broad benefits for the public at large.

36 MATERIALS SCIENCE↗