Search NASA⌕ Search

SEARCH · Search NASA

Results for “error bound”

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 163 records · Page 9

Component-wise reduced order model lattice-type structure design

Lattice-type structures can provide a combination of stiffness with light weight that is desirable in a variety of applications. Design optimization of these structures must rely on approximations of the governing physics to render solution of a mathematical model feasible. In this paper, we propose a topology optimization (TO) formulation that approximates the governing physics using component-wise reduced order modeling as introduced in Huynh et al. (2013); Eftang and Patera (2013), which can reduce solution time by multiple orders of magnitude over a full-order finite element model while providing a relative error in the solution of 1%. In addition, the offline training data set from such component-wise models is reusable, allowing its application to many design problems for only the cost of a single offline training phase, and the component-wise method is nearly embarrassingly parallel. We also show how the parameterization chosen in our optimization allows a simplification of the component-wise reduced order model (CWROM) not noted in previous literature, for further speedup of the optimization process. Furthermore, the sensitivity of the compliance with respect to the particular parameterization is derived solely at the component level. In numerical examples, we demonstrate a 1000x speedup over a full-order FEM model with relative error of 1% and show minimum compliance designs for two different cantilever beam examples, one smaller and one larger. Finally, error bounds for the displacement field, compliance, and compliance sensitivity of the CWROM are derived.

97 MATHEMATICS AND COMPUTING↗

Reduced order models for Lagrangian hydrodynamics

It is reported, as a mathematical model of high-speed flow and shock wave propagation in a complex multimaterial setting, Lagrangian hydrodynamics is characterized by moving meshes, advection-dominated solutions, and moving shock fronts with sharp gradients. These challenges hinder the existing projection-based model reduction schemes from being practical. We develop several variations of projection-based reduced order model techniques for Lagrangian hydrodynamics by introducing three different reduced bases for position, velocity, and energy fields. A time-windowing approach is also developed to address the challenge imposed by the advection-dominated solutions. Lagrangian hydrodynamics is formulated as a nonlinear problem, which requires a proper hyper-reduction technique. Therefore, we apply the over-sampling DEIM and SNS approaches to reduce the complexity due to the nonlinear terms. Finally, we also present both a posteriori and a priori error bounds associated with our reduced order model. We compare the performance of the spatial and time-windowing reduced order modeling approaches in terms of accuracy and speed-up with respect to the corresponding full order model for several numerical examples, namely Sedov blast, Gresho vortices, Taylor-Green vortices, and triple-point problems.

97 MATHEMATICS AND COMPUTING↗

Uncertainty quantification of graph convolution neural network models of evolving processes

The application of neural network models to scientific machine learning tasks has proliferated in recent years. In particular, neural networks have proved to be adept at modeling processes with spatial–temporal complexity. Nevertheless, these highly parameterized models have garnered skepticism in their ability to produce outputs with quantified error bounds over the regimes of interest. Hence there is a need to find uncertainty quantification methods that are suitable for neural networks. In this work we present comparisons of the parametric uncertainty quantification of neural networks modeling complex spatial–temporal processes with Hamiltonian Monte Carlo and Stein variational gradient descent and its projected variant. Specifically we apply these methods to graph convolutional neural network models of evolving systems modeled with recurrent neural network and neural ordinary differential equations architectures. We show that Stein variational inference is a viable alternative to Monte Carlo methods with some clear advantages for complex neural network models. For our exemplars, Stein variational interference gave similar pushed forward uncertainty profiles through time compared to Hamiltonian Monte Carlo, albeit with generally more generous variance. As a result, projected Stein variational gradient descent also produced similar uncertainty profiles to the non-projected counterpart, but large reductions in the active weight space were confounded by the stability of the neural network predictions and the convoluted likelihood landscape.

36 MATERIALS SCIENCE↗

Applications of aggregation theory to sustainability assessment

In order to aid in transition towards operations that promote sustainability goals, researchers and stakeholders use sustainability assessments. Although assessments take various forms, many utilize diverse sets of indicators that can number anywhere from two to over 2000. Indices, composite indicators, or aggregate values are used to simplify high dimensional and complex data sets and to clarify assessment results. Although the choice of aggregation function is a key component in the development of the assessment, there are few examples to be found in literature to guide appropriate aggregation function selection. This paper develops a connection between the mathematical study of aggregation functions and sustainability assessment in order to aid in providing criteria for aggregation function selection. Relevant mathematical properties of aggregation functions are presented and interpreted. Lastly, we provide cases of these properties and their relation to previous sustainability assessment research. Examples show that mathematical aggregation properties can be used to address the topics of compensatory behavior and weak versus strong sustainability, aggregation of data under varying units of measurements, multiple site multiple indicator aggregation, and the determination of error bounds in aggregate output for normalized and non-normalized indicator measures.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Classification of machine learning frameworks for data-driven thermal fluid models

Thermal fluid processes are inherently multi-physics and multi-scale, involving mass-momentum-energy transport phenomena at multiple scales. Thermal fluid simulation (TFS) is based on solving conservative equations, for which – except for “first-principles” direct numerical simulation – closure relations (CRs) are required to provide microscopic interactions or so-called sub-grid-scale physics. In practice, TFS is realized through reduced-order modeling, and its CRs as low-fidelity models can be informed by observations and data from relevant and adequately evaluated experiments and high-fidelity simulations. This paper is focused on data-driven TFS models, specifically on their development using machine learning (ML). Five ML frameworks are introduced including physics-separated ML (PSML or Type I ML), physics-evaluated ML (PEML or Type II ML), physics-integrated ML (PIML or Type III ML), physics-recovered (PRML or Type IV ML), and physics-discovered ML (PDML or Type V ML). The frameworks vary in their performance for different applications depending on the level of knowledge of governing physics, source, type, amount and quality of available data for training. Notably, outlined for the first time in this paper, Type III models present stringent requirements on modeling, substantial computing resources for training, and high potential in extracting value from “big data” in thermal fluid research. Here the current paper demonstrates and investigates ML frameworks in three examples. First, we utilize the heat diffusion equation with a nonlinear conductivity model formulated by convolutional neural networks (CNNs) and feedforward neural networks (FNNs) to illustrate the applications of Type I, Type II, Type III, and Type V ML. The results indicate a preference for Type II ML under deficient data support. Type III ML can effectively utilize field data, potentially generating more robust predictions than Type I and Type II ML. CNN-based closures exhibit more predictability than FNN-based closures, but CNN-based closures require more training data to obtain accurate predictions. Second, we illustrate how to employ Type I ML and Type II ML frameworks for data-driven turbulence modeling using reference works. Third, we demonstrate Type I ML by building a deep FNN-based slip closure for two-phase flow modeling. The results show that deep FNN-based closures exhibit a bounded error in the prediction domain.

42 ENGINEERING↗

Numerical integration for ab initio many-electron self energy calculations within the GW approximation

We present a numerical integration scheme for evaluating the convolution of a Green's function with a screened Coulomb potential on the real axis in the GW approximation of the self energy. Our scheme takes the zero broadening limit in Green's function first, replaces the numerator of the integrand with a piecewise polynomial approximation, and performs principal value integration on subintervals analytically. We give the error bound of our numerical integration scheme and show by numerical examples that it is more reliable and accurate than the standard quadrature rules such as the composite trapezoidal rule. We also discuss the benefit of using different self energy expressions to perform the numerical convolution at different frequencies.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Physics-Informed CoKriging: A Gaussian-Process-Regression-Based Multifidelity Method for Data-Model Convergence

In this work, we propose a new Gaussian process regression (GPR)-based multifidelity method: physics-informed CoKriging (CoPhIK). In CoKriging-based multifidelity methods, the quantities of interest are modeled as linear combinations of multiple parameterized stationary Gaussian processes (GPs), and the hyperparameters of these GPs are estimated from data via optimization. In CoPhIK, we construct a GP representing low-fidelity data using physics-informed Kriging (PhIK), and model the discrepancy between low- and highfidelity data using a parameterized GP with hyperparameters identified via optimization. Our approach reduces the cost of optimization for inferring hyperparameters by incorporating partial physical knowledge. We prove that the physical constraints in the form of deterministic linear operators are satisfied up to an error bound. Furthermore, we combine CoPhIK with a greedy active learning algorithm for guiding the selection of additional observation locations. The eciency and accuracy of CoPhIK are demonstrated for reconstructing the partially observed modified Branin function, reconstructing the sparsely observed state of a steady state heat transport problem, and learning a conservative tracer distribution from sparse tracer concentration measurements.

Yang, Xiu↗

Model reduction of dynamical systems on nonlinear manifolds using deep convolutional autoencoders

Nearly all model-reduction techniques project the governing equations onto a linear subspace of the original state space. Such subspaces are typically computed using methods such as balanced truncation, rational interpolation, the reduced-basis method, and (balanced) proper orthogonal decomposition (POD). Unfortunately, restricting the state to evolve in a linear subspace imposes a fundamental limitation to the accuracy of the resulting reduced-order model (ROM). In particular, linear-subspace ROMs can be expected to produce low-dimensional models with high accuracy only if the problem admits a fast decaying Kolmogorov n -width (e.g., diffusion-dominated problems). Unfortunately, many problems of interest exhibit a slowly decaying Kolmogorov n-width (e.g., advection-dominated problems). To address this, we propose a novel framework for projecting dynamical systems onto nonlinear manifolds using minimum-residual formulations at the time-continuous and time-discrete levels; the former leads to manifold Galerkin projection, while the latter leads to manifold least-squares Petrov–Galerkin (LSPG) projection. We perform analyses that provide insight into the relationship between these proposed approaches and classical linear-subspace reduced-order models; we also derive a posteriori discrete-time error bounds for the proposed approaches. In addition, we propose a computationally practical approach for computing the nonlinear manifold, which is based on convolutional autoencoders from deep learning. Lastly, we demonstrate the ability of the method to significantly outperform even the optimal linear-subspace ROM on benchmark advection-dominated problems, thereby demonstrating the method's ability to overcome the intrinsic n -width limitations of linear subspaces.

97 MATHEMATICS AND COMPUTING↗

Space–time reduced order model for large-scale linear dynamical systems with application to Boltzmann transport problems

A classical reduced order model for dynamical problems involves spatial reduction of the problem size. However, temporal reduction accompanied by the spatial reduction can further reduce the problem size without losing much accuracy, which results in a considerably more speed-up than the spatial reduction only. Recently, a novel space–time reduced order model for dynamical problems has been developed [17], where the space–time reduced order model shows an order of a hundred speed-up with a relative error of 10 –4 for small academic problems. However, in order for the method to be applicable to a large-scale problem, an efficient space–time reduced basis construction algorithm needs to be developed. Here we present the incremental space–time reduced basis construction algorithm. The incremental algorithm is fully parallel and scalable. Additionally, the block structure in the space–time reduced basis is exploited, which enables the avoidance of constructing the reduced space–time basis. These novel techniques are applied to a large-scale particle transport simulation with million and billion degrees of freedom. The numerical example shows that the algorithm is scalable and practical. Also, it achieves a tremendous speed-up, maintaining a good accuracy. Finally, error bounds for space-only and space–time reduced order models are derived.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Windowed least-squares model reduction for dynamical systems

Here we propose a windowed least-squares (WLS) approach for model reduction of dynamical systems. The proposed approach sequentially minimizes the time-continuous full-order-model residual within a low-dimensional space–time trial subspace over time windows. The approach comprises a generalization of existing model reduction approaches, as particular instances of the methodology recover Galerkin, least-squares Petrov–Galerkin (LSPG), and space–time LSPG projection. In addition, the approach addresses key deficiencies in existing model reduction techniques, e.g., the dependence of LSPG and space–time LSPG projection on the time discretization and the exponential growth in time exhibited by a posteriori error bounds for both Galerkin and LSPG projection. We consider two types of space–time trial subspaces within the proposed approach: one that reduces only the spatial dimension of the full-order model, and one that reduces both the spatial and temporal dimensions of the full-order model. For each type of trial subspace, we consider two different solution techniques: direct (i.e., discretize then optimize) and indirect (i.e., optimize then discretize). Numerical experiments conducted using trial subspaces characterized by spatial dimension reduction demonstrate that the WLS approach can yield more accurate solutions with lower space–time residuals than Galerkin and LSPG projection.

97 MATHEMATICS AND COMPUTING↗

A fast and accurate physics-informed neural network reduced order model with shallow masked autoencoder

Traditional linear subspace reduced order models (LS-ROMs) are able to accelerate physical simulations in which the intrinsic solution space falls into a subspace with a small dimension, i.e., the solution space has a small Kolmogorov n-width. However, for physical phenomena not of this type, e.g., any advection-dominated flow phenomena such as in traffic flow, atmospheric flows, and air flow over vehicles, a low-dimensional linear subspace poorly approximates the solution. To address cases such as these, we have developed a fast and accurate physics-informed neural network ROM, namely nonlinear manifold ROM (NM-ROM), which can better approximate high-fidelity model solutions with a smaller latent space dimension than the LS-ROMs. Our method takes advantage of the existing numerical methods that are used to solve the corresponding full order models. The efficiency is achieved by developing a hyper-reduction technique in the context of the NM-ROM. Numerical results show that neural networks can learn a more efficient latent space representation on advection-dominated data from 1D and 2D Burgers' equations. A speedup of up to 2.6 for 1D Burgers' and a speedup of 11.7 for 2D Burgers' equations are achieved with an appropriate treatment of the nonlinear terms through a hyper-reduction technique. Lastly, a posteriori error bounds for the NM-ROMs are derived that take account of the hyper-reduced operators.

97 MATHEMATICS AND COMPUTING↗

Evolution of dislocation loops and voids in post-irradiation annealed ThO 2 : A combined in-situ TEM and cluster dynamics investigation

The effect of isochronal annealing on the evolution of dislocation loop and void population in proton irradiated ThO 2 has been investigated. Post-irradiation annealing in other actinide oxides like UO 2 shows significant loop coarsening. ThO 2 samples were irradiated with 2 MeV protons up to a dose of 0.1 dpa at 600°C. Post-irradiation isochronal annealing was performed at 600, 800, 1000 and 1100°C for 1 h at each temperature using in-situ TEM. Only faulted 1/3<111> type dislocation loops were observed, and their sizes and distribution were characterized. Further, the population of self-interstitial atom (SIA) dislocation loops did not show any significant growth and coarsening. Additionally, nanometric voids were observed at annealing temperatures of 1000 and 1100°C. Using cluster dynamics (CD), we have studied the nucleation and growth of point defects and defect clusters, i.e., SIA prismatic dislocation loops and nanometric and sub-nanometric voids in proton irradiated ThO 2 . The CD model was further utilized to predict the growth and coarsening of loops and voids during isochronal annealing at the experimental and higher temperatures. The model did not predict significant SIA loop growth which closely corresponds to the TEM observations. CD predicted SIA loop coarsening is insignificant even at high annealing temperature of 1500°C because the model only considers the growth of defect clusters by absorption of like point defects, i.e., SIA loops absorb interstitials and voids absorb vacancies, and cannot account for their migration and coalescence due to elastic interaction. The CD model also predicts the evolution of nanometric voids having mean size within the error bounds of TEM observations.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Electrochemical state and internal variables estimation using a reduced-order physics-based model of a lithium-ion cell and an extended Kalman filter

This paper addresses the problem of estimating the present value of electrochemical internal variables in a lithium-ion cell in real time, using readily available measurements of cell voltage, current, and temperature. The variables that can be estimated include any desired set of reaction flux and solid and electrolyte potentials and concentrations at any set of one-dimensional spatial locations, in addition to more standard quantities such as state of charge. The method uses an extended Kalman filter along with a one-dimensional physics-based reduced-order model of cell dynamics. Simulations show excellent and robust predictions having dependable error bounds for most internal variables. (C) 2014 Elsevier B.V. All rights reserved.

Stetzel, KD↗

Accelerating gradient descent and Adam via fractional gradients

Here we propose a class of novel fractional-order optimization algorithms. We define a fractional-order gradient via the Caputo fractional derivatives that generalizes integer-order gradient. We refer it to as the Caputo fractional-based gradient, and develop an efficient implementation to compute it. A general class of fractional-order optimization methods is then obtained by replacing integer-order gradients with the Caputo fractional-based gradients. To give concrete algorithms, we consider gradient descent (GD) and Adam, and extend them to the Caputo fractional GD (CfGD) and the Caputo fractional Adam (CfAdam). We demonstrate the superiority of CfGD and CfAdam on several large scale optimization problems that arise from scientific machine learning applications, such as ill-conditioned least squares problem on real-world data and the training of neural networks involving non-convex objective functions. Numerical examples show that both CfGD and CfAdam result in acceleration over GD and Adam, respectively. We also derive error bounds of CfGD for quadratic functions, which further indicate that CfGD could mitigate the dependence on the condition number in the rate of convergence and results in significant acceleration over GD.

97 MATHEMATICS AND COMPUTING↗

Shape optimization of a sheet swimming over a thin liquid layer

Motivated by the propulsion mechanisms adopted by gastropods, annelids and other invertebrates, we consider shape optimization of a flexible sheet that moves by propagating deformation waves along its body. The self-propelled sheet is separated from a rigid substrate by a thin layer of viscous Newtonian fluid. We use a lubrication approximation to model the dynamics and derive the relevant Euler-Lagrange equations to simultaneously optimize swimming speed, efficiency and fluid loss. We find that as the parameters controlling these quantities approach critical values, the optimal solutions become singular in a self-similar fashion and sometimes leave the realm of validity of the lubrication model. We explore these singular limits by computing higher order corrections to the zeroth order theory and find that wave profiles that develop cusp-like singularities are appropriately penalized, yielding non-singular optimal solutions. These corrections are themselves validated by comparison with finite element solutions of the full Stokes equations, and, to the extent possible, using recent rigorous a-priori error bounds.

97 MATHEMATICS AND COMPUTING↗

Definitive Assessment of the Accuracy, Variationality, and Convergence of Relativistic Coupled Cluster and Density Matrix Renormalization Group in 100-Orbital Space

Accuracy, variationality, and convergence underpin the reliability of modern electronic structure methods, yet definitive benchmarks in the relativistic regime remain elusive due to the absence of numerically exact full configuration interaction (CI) references. Recent algorithmic advances in the CI framework, enabled by the small-tensor-product (STP) decomposition approach, have dramatically extended the tractable size of the configuration space, making numerically exact CI calculations feasible in large active spaces previously beyond reach. In this paper, we employ the recently developed STP-CI framework to perform large-scale numerically exact CI calculations and directly benchmark relativistic coupled cluster and density matrix renormalization group methods. Definitive benchmarking of approximate relativistic electronic structure methods is ensured through the application of the gap theorem, which provides rigorous error bounds on the CI reference and establishes a controlled standard for assessing accuracy, variationality, and convergence.

Chemical calculations↗

Cross-scale covariance for material property prediction

A simulation can stand its ground against an experiment only if its prediction uncertainty is known. The unknown accuracy of interatomic potentials (IPs) is a major source of prediction uncertainty, severely limiting the use of large-scale classical atomistic simulations in a wide range of scientific and engineering applications. Here we explore covariance between predictions of metal plasticity, from 178 large-scale (~10 8 atoms) molecular dynamics (MD) simulations, and a variety of indicator properties computed at small-scales (≤10 2 atoms). All simulations use the same 178 IPs. In a manner similar to statistical studies in public health, we analyze correlations of strength with indicators, identify the best predictor properties, and build a cross-scale “strength-on-predictors” regression model. This model is then used to estimate regression error over the statistical pool of IPs. Small-scale predictors found to be highly covariant with strength are computed using expensive quantum-accurate calculations and used to predict flow strength, within the statistical error bounds established in our study.

36 MATERIALS SCIENCE↗