Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “APPROXIMATIONS”

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 829 records · Page 46
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Optimization models for integrated biorefinery operations

Variations of physical and chemical characteristics of biomass lead to an uneven flow of biomass in a biorefinery, which reduces equipment utilization and increases operational costs. Uncertainty of biomass supply and high processing costs increase the risk of investing in the US’s cellulosic biofuel industry. We propose a stochastic programming model to streamline processes within a biorefinery. A chance constraint models system’s reliability requirement that the reactor is operating at a high utilization rate given uncertain biomass moisture content, particle size distribution, and equipment failure. The model identifies operating conditions of equipment and inventory level to maintain a continuous flow of biomass to the reactor. Furthermore, the sample average approximation method approximates the chance constraint and a bisection search-based heuristic solves this approximation. A case study is developed using real-life data collected at Idaho National Laboratory’s biomass processing facility. An extensive computational analysis indicates that sequencing of biomass bales based on moisture level, increasing storage capacity, and managing particle size distribution, increases utilization of the reactor and reduces operational costs.

09 BIOMASS FUELS↗
DOE OSTI2025

A randomized sketching trust-region secant method for low-memory dynamic optimization

The numerical solution of dynamic optimization problems is often limited by the memory required to store the state trajectory, which is used to evaluate the objective function and its derivatives. Recently, [R. Muthukumar et al., SIAM Journal on Optimization 31(2), pp. 1242–1275 (2021)] introduced a trust-region method for dynamic optimization that employs randomized sketching to compress the state trajectory, resulting in inexact derivative computations. By adaptively learning the sketch rank, the trust-region algorithm achieves rigorous convergence guarantees. Here, we extend this approach to use secant Hessian approximations. Due to the randomness introduced by the sketch, the traditional secant update formulae can produce poor Hessian approximations. In particular, the difference of two gradients, computed from two different sketches, may be inconsistent. To overcome this, we employ a sketched approximation of the Hessian application, in lieu of computing the gradient difference. We numerically demonstrate the improved stability of this approach on an example from PDE-constrained optimization.

dynamic optimization↗
DOE OSTI2023

Control of Fractional Diffusion Problems via Dynamic Programming Equations

In this study, we explore the approximation of feedback control of integro-differential equations containing a fractional Laplacian term. To obtain feedback control for the state variable of this nonlocal equation, we use the Hamilton–Jacobi–Bellman equation. It is well known that this approach suffers from the curse of dimensionality, and to mitigate this problem we couple semi-Lagrangian schemes for the discretization of the dynamic programming principle with the use of Shepard approximation. This coupling enables approximation of high-dimensional problems. Numerical convergence toward the solution of the continuous problem is provided together with linear and nonlinear examples. The robustness of the method with respect to disturbances of the system is illustrated by comparisons with an open-loop control approach.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Deep Koopman learning of nonlinear time-varying systems

Here this paper presents a data-driven approach to approximate the dynamics of a nonlinear time-varying system (NTVS) by a linear time-varying system (LTVS), which results from the Koopman operator and deep neural networks. Analysis of the approximation error between states of the NTVS and the resulting LTVS is presented. Simulations on a representative NTVS show that the proposed method achieves small approximation errors, even when the system changes rapidly. Furthermore, simulations in an example of quadcopters demonstrate the computational efficiency of the proposed approach.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Regional difference and related cooling electricity savings of air pollutant affected natural ventilation in commercial buildings across the US

Maintaining indoor air pollutants under acceptable levels is significant to protect occupants from exposure to excessive air pollutants in natural ventilation. In this paper, using the representative air pollutant concentration data, we present the natural ventilation usability with associated cooling energy saving potentials in different location settings (urban and city center, suburban and rural) of the US under the influence of local weather conditions and major outdoor air pollutants, i.e. PM2.5, PM10 and ozone. It is found that the impacts of air pollutants on natural ventilation are usually higher in urban/suburban areas than rural areas (up to 25% difference) with the PM2.5 being the most significant outdoor air pollutant affecting natural ventilation usage. Furthermore, ozone could become increasingly influential on natural ventilation as moving from urban to suburban/rural areas. As to the cooling energy saving considering the impacts of outdoor air pollutants, natural ventilation is estimated to save approximately 10%–40% cooling energy (800–2600 kWh per small commercial building) annually in different location settings of investigated areas across the US. The following economic analysis demonstrates that these electricity savings lead to approximately 80–540 dollars annual savings of building operation cost per building. If the time of use rate is adopted, these cost savings could further increase by approximately 20% (Los Angeles) to more than 50% (Albuquerque) depending on different rate structures, which further demonstrates the potential of adopting natural ventilation as a sustainability measurement with benefits for building owners without compromising occupants health.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2020

Online adaptive basis refinement and compression for reduced-order models via vector-space sieving

In many applications, projection-based reduced-order models (ROMs) have demonstrated the ability to provide rapid approximate solutions to high-fidelity full-order models (FOMs). However, there is no a priori assurance that these approximate solutions are accurate; their accuracy depends on the ability of the low-dimensional trial basis to represent the FOM solution. As a result, ROMs can generate inaccurate approximate solutions, e.g., when the FOM solution at the online prediction point is not well represented by training data used to construct the trial basis. To address this fundamental deficiency of standard model-reduction approaches, this work proposes a novel online-adaptive mechanism for efficiently enriching the trial basis in a manner that ensures convergence of the ROM to the FOM, yet does not incur any FOM solves. The mechanism is based on the previously proposed adaptive $h$-refinement method for ROMs, but improves upon this work in two crucial ways. First, the proposed method enables basis refinement with respect to any orthogonal basis (not just the Kronecker basis), thereby generalizing the refinement mechanism and enabling it to be tailored to the physics characterizing the problem at hand. Second, the proposed method provides a fast online algorithm for periodically compressing the enriched basis via an efficient proper orthogonal decomposition (POD) method, which does not incur any operations that scale with the FOM dimension. We report these two features allow the proposed method to serve as (1) a failsafe mechanism for ROMs, as the method enables the ROM to satisfy any prescribed error tolerance online (even in the case of inadequate training), and (2) an efficient online basis-adaptation mechanism, as the combination of basis enrichment and compression enables the basis to adapt online while controlling its dimension.

42 ENGINEERING↗
DOE OSTI2020

hp -VPINNs: Variational physics-informed neural networks with domain decomposition

We formulate a general framework for hp-variational physics-informed neural networks (hp-VPINNs) based on the nonlinear approximation of shallow and deep neural networks and hp-refinement via domain decomposition and projection onto the space of high-order polynomials. The trial space is the space of neural network, which is defined globally over the entire computational domain, while the test space contains piecewise polynomials. Specifically in this study, the hp-refinement corresponds to a global approximation with a local learning algorithm that can efficiently localize the network parameter optimization. Here, we demonstrate the advantages of hp-VPINNs in both accuracy and training cost for several numerical examples of function approximation and in solving differential equations.

42 ENGINEERING↗
DOE OSTI2022

Fracture-based shape optimization built upon the topological derivative

In Silva et al. (2011) and Alidoost et al. (2020), the authors developed an approximation of the energy release rate field associated with a small edge or surface crack at any boundary location and with any orientation using the topological derivative. The approximation is computationally attractive because it requires only a single analysis on the non-cracked domain in contrast with conventional boundary-element and finite-element-based methods, which require a separate and costlier analysis for each crack length-location-orientation combination. Here, a shape optimization scheme for fracture-resistant structures is developed using the energy release rate approximation. In the gradient-based optimization scheme, the domain and its boundary are defined implicitly using level-set functions. The level-set functions of arbitrary geometries are constructed using Boolean operations from the level-set functions of simple primitives. This geometrical representation has the dual advantage of (i) allowing shapes to intersect and/or separate during the optimization and (ii) simplifying the computation of the shape sensitivities.

42 ENGINEERING↗
DOE OSTI2022

Operator inference for non-intrusive model reduction with quadratic manifolds

This paper proposes a novel approach for learning a data-driven quadratic manifold from high-dimensional data, then employing this quadratic manifold to derive efficient physics-based reduced-order models. The key ingredient of the approach is a polynomial mapping between high-dimensional states and a low-dimensional embedding. This mapping consists of two parts: a representation in a linear subspace (computed in this work using the proper orthogonal decomposition) and a quadratic component. The approach can be viewed as a form of data-driven closure modeling, since the quadratic component introduces directions into the approximation that lie in the orthogonal complement of the linear subspace, but without introducing any additional degrees of freedom to the low-dimensional representation. Combining the quadratic manifold approximation with the operator inference method for projection-based model reduction leads to a scalable non-intrusive approach for learning reduced-order models of dynamical systems. Further, applying the new approach to transport-dominated systems of partial differential equations illustrates the gains in efficiency that can be achieved over approximation in a linear subspace.

42 ENGINEERING↗
DOE OSTI2022

Learning high-dimensional parametric maps via reduced basis adaptive residual networks

We propose a scalable framework for the learning of high-dimensional parametric maps via adaptively constructed residual network (ResNet) maps between reduced bases of the inputs and outputs. When just few training data are available, it is beneficial to have a compact parametrization in order to ameliorate the ill-posedness of the neural network training problem. By linearly restricting high-dimensional maps to informed reduced bases of the inputs, one can compress high-dimensional maps in a constructive way that can be used to detect appropriate basis ranks, equipped with rigorous error estimates. A scalable neural network learning framework is thus to learn the nonlinear compressed reduced basis mapping. Unlike the reduced basis construction, however, neural network constructions are not guaranteed to reduce errors by adding representation power, making it difficult to achieve good practical performance. Inspired by recent approximation theory that connects ResNets to sequential minimizing flows, we present an adaptive ResNet construction algorithm. This algorithm allows for depth-wise enrichment of the neural network approximation, in a manner that can achieve good practical performance by first training a shallow network and then adapting. We prove universal approximation of the associated neural network class for $L^2_v$ functions on compact sets. Our overall framework allows for constructive means to detect appropriate breadth and depth, and related compact parametrizations of neural networks, significantly reducing the need for architectural hyperparameter tuning. Numerical experiments for parametric PDE problems and a 3D CFD wing design optimization parametric map demonstrate that the proposed methodology can achieve remarkably high accuracy for limited training data, and outperformed other neural network strategies we compared against.

42 ENGINEERING↗
DOE OSTI2023

Projection pursuit adaptation on polynomial chaos expansions

Here, the present work addresses the issue of accurate stochastic approximations in high-dimensional parametric space using tools from uncertainty quantification (UQ). The basis adaptation method and its accelerated algorithm in polynomial chaos expansions (PCE) were recently proposed to construct low-dimensional approximations adapted to specific quantities of interest (QoI). The present paper addresses one difficulty with these adaptations, namely their reliance on quadrature point sampling, which limits the reusability of potentially expensive samples. Projection pursuit (PP) is a statistical tool to find the “interesting” projections in high-dimensional data and thus bypass the curse-of-dimensionality. In the present work, we combine the fundamental ideas of basis adaptation and projection pursuit regression (PPR) to propose a novel method to simultaneously learn the optimal low-dimensional spaces and PCE representation from given data. While this projection pursuit adaptation (PPA) can be entirely data-driven, the constructed approximation exhibits mean-square convergence to the solution of an underlying governing equation and thus captures the supports and probability distributions associated with the physics constraints. The proposed approach is demonstrated on a borehole problem and a structural dynamics problem, demonstrating the versatility of the method and its ability to discover low-dimensional manifolds with high accuracy with limited data. In addition, the method can learn surrogate models for different quantities of interest while reusing the same data set.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Generative learning for slow manifolds and bifurcation diagrams

In dynamical systems characterized by separation of time scales, the approximation of so called “slow manifolds”, on which the long term dynamics lie, is a useful step for model reduction. Initializing on such slow manifolds is a useful step in modeling, since it circumvents fast transients, and is crucial in multiscale algorithms (like the equation-free approach) alternating between fine scale (fast) and coarser scale (slow) simulations. In a similar spirit, when one studies the infinite time dynamics of systems depending on parameters, the system attractors (e.g., its steady states) lie on bifurcation diagrams (curves for one-parameter continuation, and more generally, on manifolds in state parameter space. Sampling these manifolds gives us representative attractors (here, steady states of ODEs or PDEs) at different parameter values. Algorithms for the systematic construction of these manifolds (slow manifolds, bifurcation diagrams) are required parts of the “traditional” numerical nonlinear dynamics toolkit. In more recent years, as the field of Machine Learning develops, conditional score-based generative models (cSGMs) have been demonstrated to exhibit remarkable capabilities in generating plausible data from target distributions that are conditioned on some given label. It is tempting to exploit such generative models to produce samples of data distributions (points on a slow manifold, steady states on a bifurcation surface) conditioned on (consistent with) some quantity of interest (QoI, observable). In this work, we present a framework for using cSGMs to quickly (a) initialize on a low-dimensional (reduced-order) slow manifold of a multi-time-scale system consistent with desired value(s) of a QoI (a “label”) on the manifold, and (b) approximate steady states in a bifurcation diagram consistent with a (new, out-of-sample) parameter value. This conditional sampling can help uncover the geometry of the reduced slow-manifold and/or approximately “fill in” missing segments of steady states in a bifurcation diagram. Finally, the quantity of interest, which determines how the sampling is conditioned, is either known a priori or identified using manifold learning-based dimensionality reduction techniques applied to the training data.

Dynamical systems↗
DOE OSTI2023

MSTor 2023 : A new version of the computer code for multistructural torsional anharmonicity, now with automatic torsional identification using redundant internal coordinates

The MSTor program is a computer program for calculating partition functions and thermodynamic functions of complex gas-phase molecules with multiple torsions; the multi-structural approximation with torsional anharmonicity (MS-T) can be used based on either a coupled torsional potential or an uncoupled torsional potential. The program can also carry out calculations in the multiple-structure local harmonic (MS-LH) approximation or multi-structural local quasiharmonic (MS-LQ) approximation or by the dual-level MS-T method. Furthermore, the program package includes eight utility codes that can be used as stand-alone programs to help the user to generate the input files for the code or to generate comparison results. The 2023 version of MSTor includes a new capability, namely automatic identification of torsional modes with redundant internal coordinates.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Consequences of plane-strain and plane-stress assumptions in fully coupled chemo-mechanical Li-ion battery models

In Li-ion battery research, it is common to simulate chemo-mechanical phenomena in reduced dimensions (e.g., 2-D) as opposed to fully resolve these complex physics in 3-D. It is common to assume either (1) the out-of-plane strain is negligible (commonly referred to as plane-strain), or (2) the out-of-plane stress is negligible (commonly referred to as plane-stress). However, there is typically little consideration as to the quantitative consequences of these approximations. Furthermore, the influence of these out-of-plane assumptions can be compounded and convoluted when chemo-mechanics models implement so-called “fully coupled” formulations, where the local species concentrations influence the stress-state and the stress-state influences the local species fluxes. Here, the present manuscript explores the implications of using plane-stress and plane-strain assumptions in 2-D as compared to simulating a full 3-D electrode particle. This comparative study includes simulating both isotropic and anisotropic particle intercalation where the particles can be surrounded by either a liquid or solid electrolyte. Additionally, common Li-ion battery-model metrics such as the state-of-stress, intercalation fraction distribution, and specific capacity are compared, while also considering the effects of particle size and C-rate. As alternatives to the pure plane-strain and plane stress approximations, two modified plane-strain assumptions are found to better approximate the fully coupled chemo-mechanical 3-D behavior.

25 ENERGY STORAGE↗
DOE OSTI2025

Stable isotope equilibria in the dihydrogen-water-methane-ethane-propane system. Part 1: Path-integral calculations with CCSD(T) quality potentials

Isotopic compositions of alkanes are typically assumed to be kinetically controlled, but recently is has been proposed that alkanes can isotopically equilibrate for both C and H isotopes during natural gas generation. Evaluation of this requires knowledge of the isotopic equilibrium between alkanes and other common hydrogen and carbon bearing species. Here, in this study, we calculate isotopic equilibria within and between gaseous dihydrogen (H 2 ), water (H 2 O), methane (CH 4 ), ethane (C 2 H 6 ) and propane (C 3 H 8 ), including isotope fractionation among molecules, clumped isotope effects, as well as among sites of propane (i.e., the site-specific isotope effects) from 0°C to 500°C using a path-integral method paired with high-level descriptions of molecular potentials and the diagonal correction to the Born Oppenheimer approximation. While path-integral calculations with high- level CCSD(T) potentials are available for the isotopic equilibria involving methane, the path-integral calculations for ethane and propane have only been performed based on lower-level descriptions of the molecular potentials. We analyze the relative importance of various approximations that are commonly employed when isotopic equilibria are evaluated. We find that clumped isotope effects can be calculated to the same accuracy using computationally inexpensive combination of the Bigeleisen-Mayer-Urey model with the molecular potential from density functional theory. In contrast, fractionation and site preferences of both deuterium and carbon-13 benefit from the use of the higher level CCSD(T) potentials and accounting for anharmonic effects. Additionally, for fractionation and site preference of deuterium corrections to Born-Oppenheimer approximation can also be important.

03 NATURAL GAS↗
DOE OSTI2021

Alluvial fan morphology: A self-similar free boundary problem description

In this work, we examine approximate geometrically self-similar solutions to a parabolic free boundary value problem applied to alluvial fan surface morphology and growth. Alluvial fans are fan- or cone-shaped sedimentary deposits caused by the rapid deposition of sediment from a canyon discharging onto a flatter plain. Longitudinal, topographic profiles of fans can be readily described by a seemingly time independent dimensionless profile (DeChant et al., 1999). However, because an alluvial fan can be expected to grow over time, it is clear that this “steady” profile is certainly time dependent and can be described using a space-time self-similar solution. In an experimental and theory-based study, Guerit et al. (2014) developed a self-similar (or as they describe it a self-affine) linear solution based upon an approximate first order small parameter expansion solution for a 1-d homogeneous nonlinear diffusion equation. Direct substitution of this result into a linear diffusion equation suggests that this first order expression may not fully satisfy the associated governing equation. In contrast, we develop a more complete solution based upon a modeled approximation for the axi-symmetric formulation such that the associated temporal behavior is consistent with a 1/3 time power-law as described by Reitz and Jerolmack (2014). The resulting expression is an exact solution to a linear heat equation. Furthermore, we emphasize that a small parameter is not inherent to the resulting profile result and is not included in our model development. Though developed using rather different approaches, the formal solution developed here is in good agreement with the simple polynomial described by DeChant et al. (1999) suggesting that this self-similar solution is a suitable time dependent representation of alluvial fan longitudinal profile form and improves on earlier work.

58 GEOSCIENCES↗
DOE OSTI2021

Deep Learning Explicit Differentiable Predictive Control Laws for Buildings

We present a differentiable predictive control (DPC) methodology for learning constrained control laws for unknown nonlinear systems. DPC poses an approximate solution to multiparametric programming problems emerging from explicit nonlinear model predictive control (MPC). Contrary to approximate MPC, DPC does not require supervision by an expert controller. Instead, a system dynamics model is learned from a small dataset of recorded observations of the perturbed system's dynamics and the control law is optimized offline by interaction with the learned system model. The DPC method is based on two sequential steps, i) system identification using a constrained neural state-space model, and ii) optimization of an explicit control law parametrized by another neural network in closed-loop simulation with the identified neural state-space model. The combination of a differentiable closed-loop system and penalty methods for constraint handling of system outputs and inputs allows us to optimize the control law's parameters directly by backpropagating economic MPC loss through the learned system model. By incorporating domain knowledge and leveraging established techniques from optimal control, our method leverages deep neural networks as nonlinear function approximators for system identification and control while avoiding concomitant costs of intractably large datasets, and computationally expensive over-parametrized models. The scalability, data efficiency, and constrained optimal control capability of the proposed DPC method are demonstrated in simulation using a multi-zone building emulator.

Drgona, Jan↗
DOE OSTI2026

Evaluating CO 2 mitigation strategies in SAF biorefineries: Techno-economic and life cycle analysis

The aviation sector requires scalable decarbonization strategies, and lignocellulosic sustainable aviation fuel (SAF) represents a promising pathway. This study comparatively evaluates the techno-economic analysis and life cycle assessment (LCA) of three CO 2 management strategies integrated within a U.S.-based gasification–Fischer–Tropsch SAF biorefinery: (i) catalytic hydrogenation of captured CO 2 to methanol, (ii) geological CO 2 sequestration, and (iii) mineralization to sodium bicarbonate (NaHCO 3 ). Techno-economic analysis indicates that methanol synthesis requires approximately 26% higher capital investment and 33% higher operating costs than mineralization. Although methanol co-production generates the highest gross revenue, NaHCO 3 production reduces the SAF minimum selling price by approximately 38% relative to both methanol synthesis and geological sequestration pathways, reflecting a more balanced cost allocation through mineral co-product valorization. Geological sequestration lowers operating costs by nearly 50% compared with methanol synthesis but remains highly dependent on carbon credit mechanisms. LCA reveals substantial divergence in climate performance. Relative to methanol synthesis, sequestration improves net greenhouse gas performance by approximately 163%, transitioning the system from net-positive to net-negative emissions. Mineralization further enhances carbon mitigation, achieving roughly 85% greater carbon reduction than sequestration and over sixfold improvement relative to methanol synthesis within the defined system boundary. Sensitivity analysis identified hydrogen price, co-product market value, and process emissions as dominant drivers. Under baseline assumptions, CO 2 mineralization is found to offer the most balanced pathway.

Carbon capture and storage↗