Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “approximation 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 685 records · Page 38
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Generalized quasiharmonic approximation via space group irreducible derivatives

The quasiharmonic approximation (QHA) is the simplest nontrivial approximation for interacting phonons under constant pressure, bringing the effects of anharmonicity into temperature-dependent observables. Nonetheless, the QHA is often implemented with additional approximations due to the complexity of computing phonons under arbitrary strains, and the generalized QHA, which employs constant stress boundary conditions, has not been completely developed. In this work we formulate the generalized QHA, providing a practical algorithm for computing the strain state and other observables as a function of temperature and true stress. We circumvent the complexity of computing phonons under arbitrary strains by employing irreducible second-order displacement derivatives of the Born-Oppenheimer potential and their strain dependence, which are efficiently and precisely computed using the lone irreducible derivative approach. We formulate two complementary strain parametrizations: a discretized strain grid interpolation and a Taylor series expansion in symmetrized strain. We illustrate our approach by evaluating the temperature and pressure dependence of select elastic constants and the thermal expansion in thoria (ThO 2 ) using density functional theory with three exchange-correlation functionals. The QHA results are compared to our measurements of the elastic constant tensor using time-domain Brillouin scattering and inelastic neutron scattering. Our irreducible derivative approach simplifies the implementation of the generalized QHA, which will facilitate reproducible, data-driven applications.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2020

Low-Memory, Discrete Ordinates, Discontinuous Galerkin Methods for Radiative Transport

The discrete ordinates discontinuous Galerkin (SN-DG) method is a well-established and practical approach for solving the radiative transport equation. In this paper, we study a low-memory variation of the upwind SN-DG method. The proposed method uses a smaller finite element space that is constructed by coupling spatial unknowns across collocation angles, thereby yielding an approximation with fewer degrees of freedom than the standard method. Like the original SN-DG method, the low-memory variation still preserves the asymptotic diffusion limit and maintains the characteristic structure needed for mesh sweeping algorithms. While we observe second-order convergence in the scattering dominated, diffusive regime, the low-memory method is in general only first-order accurate. To address this issue, we use upwind reconstruction to recover second-order accuracy. Finally, for both methods, numerical procedures based on upwind sweeps are proposed to reduce the system dimension in the underlying Krylov solver strategy.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Analysis of a Computational Framework for Bayesian Inverse Problems: Ensemble Kalman Updates and MAP Estimators under Mesh Refinement

This paper analyzes a popular computational framework to solve infinite-dimensional Bayesian inverse problems, discretizing the prior and the forward model in a finite-dimensional weighted inner product space. We demonstrate the benefit of working on a weighted space by establishing operator-norm bounds for finite element and graph-based discretizations of Matérn-type priors and deconvolution forward models. For linear-Gaussian inverse problems, we develop a general theory to characterize the error in the approximation to the posterior. We also embed the computational framework into ensemble Kalman methods and MAP estimators for nonlinear inverse problems. Furthermore, our operator-norm bounds for prior discretizations guarantee the scalability and accuracy of these algorithms under mesh refinement.

Bayesian inverse problem↗
DOE OSTI2024

Recent Advances of PyROS: A Pyomo Solver for Nonconvex Two-Stage Robust Optimization in Process Systems Engineering

The document presents recent algorithmic and implementation advances of the two-stage robust optimization (RO) solver PyROS, and a benchmarking study which demonstrates the utility of PyROS for two-stage RO problems. The advances include extensions of the scope of PyROS to models with uncertain variable bounds, improvements to the initializations of the subproblems used by the underlying cutting set algorithm, and extensions of the uncertainty set interfaces. The benchmarking study is performed on a library of over 8,500 instances, with variations in the nonlinearities, degree-of-freedom partitioning, uncertainty sets, and polynomial decision rule approximations. An amine-based CO2 capture case study is presented to demonstrate the utility of PyROS for large-scale process models. Overall, the results highlight the effectiveness of PyROS for obtaining robust solutions to optimization problems with uncertain equality constraints.

Sherman, Jason↗
DOE OSTI2023

DeepSurveySim: Simulation Software and Benchmark Challenges for Astronomical Observation Scheduling

Modern astronomical surveys have multiple competing scientific goals. Optimizing the observation schedule for these goals presents significant computational and theoretical challenges, and state-of-the-art methods rely on expensive human inspection of simulated telescope schedules. Automated methods, such as reinforcement learning, have recently been explored to accelerate scheduling. However, there do not yet exist benchmark data sets or user-friendly software frameworks for testing and comparing these methods. We present DeepSurveySim -- a high-fidelity and flexible simulation tool for use in telescope scheduling. DeepSurveySim provides methods for tracking and approximating sky conditions for a set of observations from a user-supplied telescope configuration. We envision this tool being used to produce benchmark data sets and for evaluating the efficacy of ground-based telescope scheduling algorithms, particularly for machine learning algorithms that would suffer in efficacy if limited to real data for training.We introduce three example survey configurations and related code implementations as benchmark problems that can be simulated with DeepSurveySim.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2023

Recent Advances in PyROS: The Pyomo Solver for Two-Stage Nonconvex Robust Optimization

The slides present recent algorithmic and implementation advances of the two-stage robust optimization (RO) solver PyROS, and a benchmarking study which demonstrates the utility of PyROS for two-stage RO problems. The advances include extensions of the scope of PyROS to models with uncertain variable bounds, improvements to the initializations of the subproblems used by the underlying cutting set algorithm, and extensions of the uncertainty set interfaces. The benchmarking study is performed on a library of over 8,500 instances, with variations in the nonlinearities, degree-of-freedom partitioning, uncertainty sets, and polynomial decision rule approximations. Overall, the results highlight the effectiveness of PyROS for obtaining robust solutions to optimization problems with uncertain equality constraints.

Sherman, Jason↗
DOE OSTI2023

Recent Advances in PyROS: The Pyomo Solver for Two-Stage Nonconvex Robust Optimization

The slides present recent algorithmic and implementation advances of the two-stage robust optimization (RO) solver PyROS, and a benchmarking study which demonstrates the utility of PyROS for two-stage RO problems. The advances include extensions of the scope of PyROS to models with uncertain variable bounds, improvements to the initializations of the subproblems used by the underlying cutting set algorithm, and extensions of the uncertainty set interfaces. The benchmarking study is performed on a library of over 8,500 instances, with variations in the nonlinearities, degree-of-freedom partitioning, uncertainty sets, and polynomial decision rule approximations. Overall, the results highlight the effectiveness of PyROS for obtaining robust solutions to optimization problems with uncertain equality constraints.

Sherman, Jason↗
DOE OSTI2021

HAIMOS Ensemble Forecasts for Intra-day and Day- Ahead GHI, DNI and Ramps

The objective of this research is to develop a hybrid physics-based/data-driven forecast model to improve direct normal and global horizontal irradiance (DNI and GHI) prediction for horizons ranging from 1 to 72 hours. Project objectives also address key gaps in state-of-the-art solar forecasting: accurate probabilistic solar forecasts and the forecasting of large irradiance ramps (ramp onset and magnitude). The proposed model ensembles Numerical Weather Prediction (NWP) forecasts, determinist physics-based algorithms, and new-generation cloud cover products (high-resolution rapid refresh satellite images and Large Eddy Simulations). The result is the Hybrid Adaptive Input Model Objective Selection (HAIMOS) ensemble model. HAIMOS blends state of the art machine learning methodologies with physics-based models for cloud cover and cloud optical depth forecasts. The technical activities followed a two-pronged strategy. First, the preprocessing of data, the selection of inputs to the nonlinear approximators, the type of approximator and objective functions, and post-processing ensembling techniques included in HAIMOS were all optimized adaptively to find the best model for a specific goal (reduce DNI/GHI forecast error, improve the prediction of ramp onset, etc.). Second, a large effort was put in improving cloud identification and the forecast of cloud cover and cloud optical depth. To this end, new-generation cloud parametrization products were developed in this work. These include improved algorithms to assist in cloud identification, cloud classification and cloud parametrization from satellite images – three key factors in the accuracy of 1 to 6-hours irradiance forecasts and prediction of ramp onset. Furthermore, we also included cloud information extracted from high resolution rapid refresh satellite images (GOES-16) and Large Eddy Simulations (LES). LES was used to model the atmosphere in detail over locations of interest and produce cloud optical depth forecasts. Once these data streams were validated, they were used as input data to the HAIMOS forecast. The model was developed using data from several climatologically distinct locations with potential for high solar penetration. In the last year of the project, we conducted a validation campaign according to the guidelines stipulated by the Topic Area 1 project as described in the FOA. This effort brings, for the first time, proven machine-learning methodologies for generating state-of-the-art solar forecasts interweaved with detailed physics-based models for cloud detection, and cloud optical depth forecasts. HAIMOS will generate accurate irradiance probabilistic forecast to assist in reducing solar generation prediction error. Globally optimized solar forecast models are more likely to impact solar energy stakeholders. The goal of this project was to increase the state-of-the-art forecast skill from their present values of 10 to 35%. At the end of the project, we achieved between 30% and 50% forecast skill across a wide range of horizons for both GHI and DNI.

14 SOLAR ENERGY↗
DOE OSTI2023

Direct stellarator coil optimization for nested magnetic surfaces with precise quasi-symmetry

We present a robust optimization algorithm for the design of electromagnetic coils that generate vacuum magnetic fields with nested flux surfaces and precise quasi-symmetry. The method is based on a bilevel optimization problem, where the outer coil optimization is constrained by a set of inner least squares optimization problems whose solutions describe magnetic surfaces. The outer optimization objective targets coils that generate a field with nested magnetic surfaces and good quasi-symmetry. The inner optimization problems identify magnetic surfaces when they exist, and approximate surfaces in the presence of magnetic islands or chaos. We show that this formulation can be used to heal islands and chaos, thus producing coils that result in magnetic fields with precise quasi-symmetry. We show that the method can be initialized with coils from the traditional two-stage coil design process, as well as coils from a near-axis expansion optimization. We present a numerical example where island chains are healed and quasi-symmetry is optimized up to surfaces with aspect ratio 6. Another numerical example illustrates that the aspect ratio of nested flux surfaces with optimized quasi-symmetry can be decreased from 6 to approximately 4. In conclusion, the last example shows that our approach is robust and a cold-start using coils from a near-axis expansion optimization.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2023

Bayesian projection pursuit regression

In projection pursuit regression (PPR), a univariate response variable is approximated by the sum of $M$ “ridge functions,” which are flexible functions of one-dimensional projections of a multivariate input variable. Traditionally, optimization routines are used to choose the projection directions and ridge functions via a sequential algorithm, and $M$ is typically chosen via cross-validation. Here, we introduce a novel Bayesian version of PPR, which has the benefit of accurate uncertainty quantification. To infer appropriate projection directions and ridge functions, we apply novel adaptations of methods used for the single ridge function case ($M$=1), called the Bayesian Single Index Model; and use a Reversible Jump Markov chain Monte Carlo algorithm to infer the number of ridge functions $M$. We evaluate the predictive ability of our model in 20 simulated scenarios and for 23 real datasets, in a bake-off against an array of state-of-the-art regression methods. Finally, we generalize this methodology and demonstrate the ability to accurately model multivariate response variables. Its effective performance indicates that Bayesian Projection Pursuit Regression is a valuable addition to the existing regression toolbox.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Crack opening calculation in phase-field modeling of fluid-filled fracture: A robust and efficient strain-based method

The phase-field method has become popular for the numerical modeling of fluid-filled fractures, thanks to its ability to represent complex fracture geometry without algorithms. However, the algorithm-free representation of fracture geometry poses a significant challenge in calculating the crack opening (aperture) of phase-field fracture, which governs the fracture permeability and hence the overall hydromechanical behavior. Although several approaches have been devised to compute the crack opening of phase-field fracture, they require a sophisticated algorithm for post-processing the phase-field values or an additional parameter sensitive to the element size and alignment. Here, we develop a novel method for calculating the crack opening of fluid-filled phase-field fracture, which enables one to obtain the crack opening without additional algorithms or parameters. Here we transform the displacement-jump-based kinematics of a fracture into a continuous strain-based version, insert it into a force balance equation on the fracture, and apply the phase-field approximation. Through this procedure, we obtain a simple equation for the crack opening which can be calculated with quantities at individual material points. We verify the proposed method with analytical and numerical solutions obtained based on discrete representations of fractures, demonstrating its capability to calculate the crack opening regardless of the element size or alignment.

58 GEOSCIENCES↗
DOE OSTI2021

The impacts of convex piecewise linear cost formulations on AC optimal power flow

Despite strong connections through shared application areas, research efforts on power market optimization (e.g., unit commitment) and power network optimization (e.g., optimal power flow) remain largely independent. A notable illustration of this is the treatment of power generation cost functions, where nonlinear network optimization has largely used polynomial representations and market optimization has adopted piecewise linear encodings. This work combines state-of-the-art results from both lines of research to understand the best mathematical formulations of the nonlinear AC optimal power flow problem with piecewise linear generation cost functions. An extensive numerical analysis of non-convex models, linear approximations, and convex relaxations across fifty-four realistic test cases illustrates that nonlinear optimization methods are surprisingly sensitive to the mathematical formulation of piecewise linear functions. The results indicate that a poor formulation choice can slow down algorithm performance by a factor of ten, increasing the runtime from seconds to minutes. Furthermore, these results provide valuable insights into the best formulations of nonlinear optimal power flow problems with piecewise linear cost functions, an important step towards building a new generation of energy markets that incorporate the nonlinear AC power flow model.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
DOE OSTI2022

Physics constrained learning for data-driven inverse modeling from sparse observations

Deep neural networks (DNN) have been used to model nonlinear relations between physical quantities. Those DNNs are embedded in physical systems described by partial differential equations (PDE) and trained by minimizing a loss function that measures the discrepancy between predictions and observations in some chosen norm. This loss function often includes the PDE constraints as a penalty term when only sparse observations are available. As a result, the PDE is only satisfied approximately by the solution. However, the penalty term typically slows down the convergence of the optimizer for stiff problems. We present a new approach that trains the embedded DNNs while numerically satisfying the PDE constraints. We develop an algorithm that enables differentiating both explicit and implicit numerical solvers in reverse-mode automatic differentiation. This allows the gradients of the DNNs and the PDE solvers to be computed in a unified framework. We demonstrate that our approach enjoys faster convergence and better stability in relatively stiff problems compared to the penalty method. Furthermore, our approach allows for the potential to solve and accelerate a wide range of data-driven inverse modeling, where the physical constraints are described by PDEs and need to be satisfied accurately.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

An Ab Initio Multiple Cloning Method for Non-Adiabatic Excited-State Molecular Dynamics in NWChem

The recently developed ab-initio multiple cloning (AIMC) approach based on the multicongurational Ehrenfest (MCE) method provides a powerful and accurate way of describing the excited-state dynamics of molecular systems. The AIMC method is a controlled approximation to non-adiabatic dynamics with a particular strength in the proper description of decoherence effects due to branching of vibrational wavepackets at a level crossing. In this work, we report a new implementation of the AIMC algorithm in the open source NWChem computational chemistry program. The framework combines linear-response time-dependent density functional theory with Ehrenfest mean-eld theory to determine the equations of motion for classical trajectories. The multi-dimensional wave function is decomposed into a superposition of Gaussian coherent states guided by Ehrenfest trajectories (i.e., MCE approach), which can clone with fully quantum mechanical amplitudes and phases. By using an efficient time-derivative based non-adiabatic coupling approach within the AIMC method, all observable are calculated on-the-y in the non-adiabatic molecular dynamics process. As a representative example, we apply our implementation to study the ultrafast photoinduced electronic and vibrational energy transfer in a pyridine molecule. The effects of the cloning procedure on electronic and vibrational coherence, relaxation and unidirectional energy transfer are discussed. This new AIMC implementation provides a high-level non-adiabatic molecular dynamics framework for simulating photoexcited dynamics in complex molecular systems and experimentally relevant ultrafast spectroscopic probes, such as nonlinear coherent optical and X-ray signals.

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

Applying Constrained Bayesian Optimization to the Design of Critical Experiments

Often when planning a criticality experiment, many design configurations are iteratively investigated with a Monte Carlo transport code. The goal is that the experiment will be optimal with respect to some variable, like the fraction of fissions occurring at a certain energy range, while simultaneously being critical. Unfortunately, the Monte Carlo transport simulations are expensive, which can ultimately limit the number of configurations that can be explored. In this work, we present how Gaussian processes (GPs) can be used as a reduced-order model in a constrained Bayesian optimization (CBO) algorithm to design a criticality experiment. The GPs replace the Monte Carlo transport simulations that explore the design space. The CBO algorithm efficiently identifies new points in the design space to run the Monte Carlo transport code while respecting the criticality constraint. It does so in a manner that both improves the accuracy of the GP and finds the approximate global optimum. We demonstrate the performance of CBO with the design of a Thermal Epithermal eXperiment (TEX) for the criticality safety validation of nuclear waste models of the Hanford Tank Farm.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2022

Randomized probe imaging through deep k-learning

Randomized probe imaging (RPI) is a single-frame diffractive imaging method that uses highly randomized light to reconstruct the spatial features of a scattering object. The reconstruction process, known as phase retrieval, aims to recover a unique solution for the object without measuring the far-field phase information. Typically, reconstruction is done via time-consuming iterative algorithms. In this work, we propose a fast and efficient deep learning based method to reconstruct phase objects from RPI data. The method, which we call deep k-learning, applies the physical propagation operator to generate an approximation of the object as an input to the neural network. This way, the network no longer needs to parametrize the far-field diffraction physics, dramatically improving the results. Deep k-learning is shown to be computationally efficient and robust to Poisson noise. The advantages provided by our method may enable the analysis of far larger datasets in photon starved conditions, with important applications to the study of dynamic phenomena in physical science and biological engineering.

Guo, Zhen (ORCID:0000000213473451)↗
DOE OSTI2022

Systems and methods for direct estimation of battery parameters using only charge/discharge curves

Electrochemical models for the lithium-ion battery are useful in predicting and controlling its performance. The values of the parameters in these models are vital to their accuracy. However, not all parameters can be measured precisely, especially when destructive methods are prohibited. In some embodiments of the present disclosure, a parameter estimation approach is used to estimate the open circuit potential of the positive electrode (Up) using piecewise linear approximation together with all the other parameters of a single particle model. Up and 10 more parameters may be estimated from a single discharge curve without knowledge of the electrode chemistry using a technique such as a genetic algorithm. Different case studies were presented for estimating Up with different types of parameters of the battery model. The estimated parameters were then validated by comparing simulations at different discharge rates with experimental data.

Qi, Yanbo↗
DOE OSTI2024

Multiphysics Time-Integration for Turbulent Combustion at the Exascale

Turbulent reacting flow systems are often modeled with coupled time-dependent partial differential equations (PDEs). Solving such equations can easily tax the world's largest supercomputers. One pragmatic strategy for attacking such problems is to split the PDEs into components that can more easily be solved in isolation. This generic operator-splitting strategy leads to a set of ordinary differential equations (ODEs) that need to be solved as part of an "outer-loop" time-stepping approach. In many combustion applications, the ODEs to be solved can be very stiff, exhibiting timescales that span many orders of magnitude. The SUNDIALS library provides a plethora of robust time integration algorithms for solving these ODEs on exascale-capable computing hardware, yet for many complex applications (such multicomponent fuels or emissions predictions), the chemical models remain too complex to solve using reasonable resources. The Quasi-Steady State Approximation (QSSA) can be an effective tool for reducing the size and stiffness of the simulations. In this talk, I will discuss the use of the SUDIALS library of ODE solvers together with automatic code generation tools to solve complex turbulent reacting flow problems using QSSA models.

chemistry↗