Search NASA⌕ Search

SEARCH · Search NASA

Results for “Error estimation”

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 181 records · Page 10

Solution-Based Adaptivity as a Paradigm for Computational Fluid Dynamics

This is the final report for the DOE Early Career award. Through innovation in error estimation and solution-based adaptation methods we strive to dramatically improve the efficiency and robustness of computational science and engineering simulations. By solution-based error estimation and adaptation we refer to techniques for estimating numerical error and efficiently reducing it through targeted discretization changes. In such a setting, high-order methods play a key role, though they are just one mechanism for efficient accuracy improvement. Other mechanisms include well known mesh size and stretching optimization, as well as less-practiced mesh motion and basis optimization. With additional work on the latter, we are integrating these techniques into one adaptive suite that maximizes efficiency and robustness of Computational Fluid Dynamics (CFD) calculations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Posteriori Analysis for Hydrodynamic Simulations Using Adjoint Methodologies

This report contains results of analysis done during an FY08 feasibility study investigating the use of adjoint methodologies for a posteriori error estimation for hydrodynamics simulations. We developed an approach to adjoint analysis for these systems through use of modified equations and viscosity solutions. Targeting first the 1D Burgers equation, we include a verification of the adjoint operator for the modified equation for the Lax-Friedrichs scheme, then derivations of an a posteriori error analysis for a finite difference scheme and a discontinuous Galerkin scheme applied to this problem. We include some numerical results showing the use of the error estimate. Lastly, we develop a computable a posteriori error estimate for the MAC scheme applied to stationary Navier-Stokes.

99 GENERAL AND MISCELLANEOUS↗

Estimating pixel variances in the scenes of staring sensors

A technique for detecting changes in a scene perceived by a staring sensor is disclosed. The technique includes acquiring a reference image frame and a current image frame of a scene with the staring sensor. A raw difference frame is generated based upon differences between the reference image frame and the current image frame. Pixel error estimates are generated for each pixel in the raw difference frame based at least in part upon spatial error estimates related to spatial intensity gradients in the scene. The pixel error estimates are used to mitigate effects of camera jitter in the scene between the current image frame and the reference image frame.

47 OTHER INSTRUMENTATION↗

Parity Violating Electron Scattering Measurements of Neutron Densities

Parity violating electron scattering allows model independent measurements of neutron densities that are free from most strong interaction uncertainties. In this paper we present statistical error estimates for a variety of experiments. The neutron radius $R_n$ can be measured in several nuclei, as long as the nuclear excited states are not too low in energy. We present error estimates for $R_n$ measurements in $^{40}$Ca, $^{48}$Ca, $^{112}$Sn, $^{120}$Sn, $^{124}$Sn, and $^{208}$Pb. In general, we find that the smaller the nucleus, the easier the measurement. This is because smaller nuclei can be measured at higher momentum transfers where the parity violating asymmetry $A_{pv}$ is larger. Also in general, the more neutron rich the isotope, the easier the measurement, because neutron rich isotopes have larger weak charges and larger $A_{pv}$. Measuring $R_n$ in $^{48}$Ca appears very promising because it has a higher figure of merit than $^{208}$Pb. In addition, $R_n(^{48}$Ca) may be more easily related to two nucleon and three nucleon interactions, including very interesting three neutron forces, than $R_n(^{208}$Pb). After measuring $R_n$, one can constrain the surface thickness of the neutron density $a_n$ with a second measurement at somewhat higher momentum transfers. We present statistical error estimates for measuring $a_n$ in $^{48}$Ca, $^{120}$Sn, and $^{208}$Pb. Again, we find that $a_n$ is easier to measure in smaller nuclei.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Interpolating moving least-squares methods for fitting potential energy surfaces : using classical trajectories to explore configuration space.

We develop two approaches for growing a fitted potential energy surface (PES) by the interpolating moving least-squares (IMLS) technique using classical trajectories. We illustrate both approaches by calculating nitrous acid (HONO) cis {yields} trans isomerization trajectories under the control of ab initio forces from low-level HF/cc-pVDZ electronic structure calculations. In this illustrative example, as few as 300 ab initio energy/gradient calculations are required to converge the isomerization rate constant at a fixed energy to {approx}10%. Neither approach requires any preliminary electronic structure calculations or initial approximate representation of the PES (beyond information required for trajectory initial conditions). Hessians are not required. Both approaches rely on the fitting error estimation properties of IMLS fits. The first approach, called IMLS-accelerated direct dynamics, propagates individual trajectories directly with no preliminary exploratory trajectories. The PES is grown 'on the fly' with the computation of new ab initio data only when a fitting error estimate exceeds a prescribed tight tolerance. The second approach, called dynamics-driven IMLS fitting, uses relatively inexpensive exploratory trajectories to both determine and fit the dynamically accessible configuration space. Once exploratory trajectories no longer find configurations with fitting error estimates higher than the designated accuracy, the IMLS fit is considered to be complete and usable in classical trajectory calculations or other applications.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Processing Aleatory and Epistemic Uncertainties in Experimental Data From Sparse Replicate Tests of Stochastic Systems for Real-Space Model Validation

This paper presents a practical methodology for propagating and processing uncertainties associated with random measurement and estimation errors (that vary from test-to-test) and systematic measurement and estimation errors (uncertain but similar from test-to-test) in inputs and outputs of replicate tests to characterize response variability of stochastically varying test units. Also treated are test condition control variability from test-to-test and sampling uncertainty due to limited numbers of replicate tests. These aleatory variabilities and epistemic uncertainties result in uncertainty on computed statistics of output response quantities. The methodology was developed in the context of processing experimental data for “real-space” (RS) model validation comparisons against model-predicted statistics and uncertainty thereof. The methodology is flexible and sufficient for many types of experimental and data uncertainty, offering the most extensive data uncertainty quantification (UQ) treatment of any model validation method the authors are aware of. It handles both interval and probabilistic uncertainty descriptions and can be performed with relatively little computational cost through use of simple and effective dimension- and order-adaptive polynomial response surfaces in a Monte Carlo (MC) uncertainty propagation approach. A key feature of the progressively upgraded response surfaces is that they enable estimation of propagation error contributed by the surrogate model. Sensitivity analysis of the relative contributions of the various uncertainty sources to the total uncertainty of statistical estimates is also presented. Finally, the methodologies are demonstrated on real experimental validation data involving all the mentioned sources and types of error and uncertainty in five replicate tests of pressure vessels heated and pressurized to failure. Simple spreadsheet procedures are used for all processing operations.

97 MATHEMATICS AND COMPUTING↗

Adaptive Hybridizable Discontinuous Galerkin discretization of the Grad–Shafranov equation by extension from polygonal subdomains

In this work, we propose a high-order adaptive numerical solver for the semilinear elliptic boundary value problem modeling magnetic plasma equilibrium in axisymmetric confinement devices. In the fixed boundary case, the equation is posed on curved domains with piecewise smooth curved boundaries that may present corners. The solution method we present is based on the hybridizable discontinuous Galerkin method and sidesteps the need for geometry-conforming triangulations thanks to a transfer technique that allows to approximate the solution using only a polygonal subset as computational domain. Moreover, the solver features automatic mesh refinement driven by a residual-based a posteriori error estimator. As the mesh is locally refined, the computational domain is automatically updated in order to always maintain the distance between the actual boundary and the computational boundary of the order of the local mesh diameter. Numerical evidence is presented of the suitability of the estimator as an approximate error measure for physically relevant equilibria with pressure pedestals, internal transport barriers, and current holes on realistic geometries.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Uncertainty quantification for radiation measurements: Bottom-up error variance estimation using calibration information

One example of top-down uncertainty quantification (UQ) involves comparing two or more measurements on each of multiple items. One example of bottom-up UQ expresses a measurement result as a function of one or more input variables that have associated errors, such as a measured count rate, which individually (or collectively) can be evaluated for impact on the uncertainty in the resulting measured value. In practice, it is often found that top-down UQ exhibits larger error variances than bottom-up UQ because some error sources are present in the fielded assay methods used in top-down UQ that are not present (or not recognized) in the assay studies used in bottom-up UQ One would like better consistency between the two approaches in order to claim understanding of the measurement process. The purpose of this paper is to refine bottom-up uncertainty estimation by using calibration information so that if there are no unknown error sources, the refined bottom-up uncertainty estimate will agree with the top-down uncertainty estimate to within a specified tolerance. Then, in practice, if the top-down uncertainty estimate is larger than the refined bottom-up uncertainty estimate by more than the specified tolerance, there must be omitted sources of error beyond those predicted from calibration uncertainty. The paper develops a refined bottom-up uncertainty approach for four cases of simple linear calibration: (1) inverse regression with negligible error in predictors, (2) inverse regression with non negligible error in predictors, (3) classical regression followed by inversion with negligible error in predictors, and (4) classical regression followed by inversion with non-negligible errors in predictors. Our illustrations are of general interest, but are drawn from our experience with nuclear material assay by non-destructive assay. The main example we use is gamma spectroscopy that applies the enrichment meter principle. Previous papers that ignore error in predictors have shown a tendency for inverse regression to have lower error variance than classical regression followed by inversion. Our paper supports that tendency both with and without error in predictors. Furthermore, the paper shows that calibration parameter estimates using error in predictor methods perform worse than without using error in predictor methods in the case of inverse regression, but perform better than without using error in predictor methods in the case of classical regression followed by inversion. Both inverse and classical regression involve the ratio of dependent random variables; therefore, the assumed error distribution(s) will matter in parameter estimation and in uncertainty calculations. Mainly for that reason, calibration using a single predictor is distinct from simple regression, and it has not been thoroughly treated in the literature, nor in the ISO Guide to the Expression of Uncertainty in Measurements (GUM). This refined approach is based on simulation, because we illustrate that analytical approximations are not adequate when there are, for example, 10 or fewer calibration measurements, which is common in calibration applications, each consisting of measured responses from known quantities.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

A kriging and entropy-based approach to raingauge network design

Highlights: • A kriging and entropy theory-based approach is developed for gauge network design. • The method considers both minimum estimating error andoptimum rainfall information. • The best combination is verified to be effectiveto achieve final goals. Hydrological data, such as precipitation, is fundamental for planning, designing, developing, and managing water resource projects as well as for hydrologic research. An optimal raingauge network leads to more accurate estimates of mean or point precipitation at any site over the watershed. Some studies in the past have suggested increasing gauge network density for reducing the estimation error. However, more stations mean more cost of installation and monitoring. This study proposes an approach on the basis of kriging and entropy theory to determine an optimal network design in the city of Shanghai, China. Unlike the past studies using kriging interpolation and entropy theory for network design, the approach developed in the current study not only used the kriging method as an interpolator to determine rainfall data at ungauged locations but also incorporated the minimum kriging standard error (KSE) and maximum net information (NI) content. The approach would thus lead to an optimal network and would enable the reduction of kriging standard error of precipitation estimates throughout the watershed and achieve an optimum rainfall information. This study also proposed an NI-KSE-based criterion which is dependent on a single-objective optimization. To evaluate the final optimal gauge network, areal average rainfall was estimated and its accuracy was compared with that obtained with the existing rain gauge network.

54 ENVIRONMENTAL SCIENCES↗

A model and variance reduction method for computing statistical outputs of stochastic elliptic partial differential equations

We present a model and variance reduction method for the fast and reliable computation of statistical outputs of stochastic elliptic partial differential equations. Our method consists of three main ingredients: (1) the hybridizable discontinuous Galerkin (HDG) discretization of elliptic partial differential equations (PDEs), which allows us to obtain high-order accurate solutions of the governing PDE; (2) the reduced basis method for a new HDG discretization of the underlying PDE to enable real-time solution of the parameterized PDE in the presence of stochastic parameters; and (3) a multilevel variance reduction method that exploits the statistical correlation among the different reduced basis approximations and the high-fidelity HDG discretization to accelerate the convergence of the Monte Carlo simulations. The multilevel variance reduction method provides efficient computation of the statistical outputs by shifting most of the computational burden from the high-fidelity HDG approximation to the reduced basis approximations. Furthermore, we develop a posteriori error estimates for our approximations of the statistical outputs. Based on these error estimates, we propose an algorithm for optimally choosing both the dimensions of the reduced basis approximations and the sizes of Monte Carlo samples to achieve a given error tolerance. We provide numerical examples to demonstrate the performance of the proposed method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Method of Moments Wide Band Adaptive Rational Interpolation Method for High-Quality Factor Resonant Cavities

A new adaptive rational interpolation method is proposed to obtain the wideband frequency response of a resonant cavity simulated with the method of moments (MoM). This interpolation method uses both the Loewner matrix to construct a rational expression for the solution vector of MoM’s matrix system and an error estimator generated by the solution vectors and their derivatives. This error estimator is implemented in the adaptive procedure to gain a minimum set of frequencies and solution vectors required in the interpolation. The resulting set of frequencies and solution vectors is applied to interpolate other system variables, such as shielding effectiveness and input impedance. Here numerical results of a slotted cylindrical cavity supporting high-quality factor resonances are presented, showing that the new rational interpolation method is accurate and efficient in interpolating the complicated resonant response of the solution vector functions.

42 ENGINEERING↗

Learning Functions Varying along a Central Subspace

Many functions of interest are in a high-dimensional space but exhibit low-dimensional structures. This paper studies regression of an s-Hölder function in $R^D$ which varies along a central subspace of dimension $d$ while $d \ll D$. A direct approximation of $f$ in $R^D$ with an accuracy $\varepsilon$ requires the number of samples in the order of $\varepsilon^{-(2s+D)/s}$. In this paper, we analyze the generalized contour regression (GCR) algorithm for the estimation of the central subspace and use piecewise polynomials for function approximation. GCR is among the best estimators for the central subspace, but its sample complexity is an open question. In this paper, we partially answer this questions by proving that if a variance quantity is exactly known, GCR leads to a mean squared estimation error of $O(n^{-1})$ for the central subspace. The estimation error of this variance quantity is also given in this paper. The mean squared regression error of $f$ is proved to be in the order of $(n/\log n)^{-\frac{2s}{2s+d}}$, where the exponent depends on the dimension of the central subspace instead of the ambient space . This result demonstrates that GCR is effective in learning the low-dimensional central subspace. We also propose a modified GCR with improved efficiency. Here, the convergence rate is validated through several numerical experiments.

97 MATHEMATICS AND COMPUTING↗

State Space Truncation with Quantified Errors for Accurate Solutions to Discrete Chemical Master Equation

The discrete chemical master equation (dCME) provides a general framework for studying stochasticity in mesoscopic reaction networks. Since its direct solution rapidly becomes intractable due to the increasing size of the state space, truncation of the state space is necessary for solving most dCMEs. It is therefore important to assess the consequences of state space truncations so errors can be quantified and minimized. Here we describe a novel method for state space truncation. By partitioning a reaction network into multiple molecular equivalence groups (MEGs), we truncate the state space by limiting the total molecular copy numbers in each MEG. We further describe a theoretical framework for analysis of the truncation error in the steady-state probability landscape using reflecting boundaries. By aggregating the state space based on the usage of a MEG and constructing an aggregated Markov process, we show that the truncation error of a MEG can be asymptotically bounded by the probability of states on the reflecting boundary of the MEG. Furthermore, truncating states of an arbitrary MEG will not undermine the estimated error of truncating any other MEGs. We then provide an overall error estimate for networks with multiple MEGs. To rapidly determine the appropriate size of an arbitrary MEG, we also introduce an a priori method to estimate the upper bound of its truncation error. This a priori estimate can be rapidly computed from reaction rates of the network, without the need of costly trial solutions of the dCME. As examples, we show results of applying our methods to the four stochastic networks of (1) the birth and death model, (2) the single gene expression model, (3) the genetic toggle switch model, and (4) the phage lambda bistable epigenetic switch model. We demonstrate how truncation errors and steady-state probability landscapes can be computed using different sizes of the MEG(s) and how the results validate our theories. Overall, the novel state space truncation and error analysis methods developed here can be used to ensure accurate direct solutions to the dCME for a large number of stochastic networks.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Time-Reference for Measurements of Arbitrarily Shaped Pulses

This paper addresses measurements of relative timing of irregularly and differently shaped pulses (by which we mean signals that are zero beyond a finite interval). For such pulses the usual time reference points become useless: rising edges may change their slopes and shapes, and maxima might split. We propose a definition of the time reference applicable to smooth but otherwise arbitrary pulses. It is applicable to signal scaling, simplifies the covariance matrix (of parameters’ error estimates) and yields an effective analytic estimate of timing error.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Direct discontinuous Galerkin method and its variations for second order elliptic equations

In this study, we study direct discontinuous Galerkin method (Liu and Yan in SIAM J Numer Anal 47(1):475–698, 2009) and its variations (Liu and Yan in Commun Comput Phys 8(3):541–564, 2010; Vidden and Yan in J Comput Math 31(6):638–662, 2013; Yan in J Sci Comput 54(2–3):663–683, 2013) for 2nd order elliptic problems. A priori error estimate under energy norm is established for all four methods. Optimal error estimate under L 2 norm is obtained for DDG method with interface correction (Liu and Yan in Commun Comput Phys 8(3):541–564, 2010) and symmetric DDG method (Vidden and Yan in J Comput Math 31(6):638–662, 2013). A series of numerical examples are carried out to illustrate the accuracy and capability of the schemes. Numerically we obtain optimal (k+1)th order convergence for DDG method with interface correction and symmetric DDG method on nonuniform and unstructured triangular meshes. An interface problem with discontinuous diffusion coefficients is investigated and optimal (k+1)th order accuracy is obtained. Peak solutions with sharp transitions are captured well. Highly oscillatory wave solutions of Helmholz equation are well resolved.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Automatic Time Stepping with Global Error Control for Groundwater Flow Models

An automatic time stepping with global error control is proposed for the time integration of the diffusion equation to simulate groundwater flow in confined aquifers. The scheme is based on an a posteriori error estimate for the discontinuous Galerkin (dG) finite element methods. A stability factor is involved in the error estimate and it is used to adapt the time step and control the global temporal error for the backward difference method. The stability factor can be estimated by solving a dual problem. The stability factor is not sensitive to the accuracy of the dual solution and the overhead computational cost can be minimized by solving the dual problem using large time steps. Numerical experiments are conducted to show the application and the performance of the automatic time stepping scheme. Implementation of the scheme can lead to improvement in accuracy and efficiency for groundwater flow models.

54 ENVIRONMENTAL SCIENCES↗

Parallel computation of three-dimensional flows using overlapping grids with adaptive mesh refinement

This paper describes an approach for the numerical solution of time-dependent partial differential equations in complex three-dimensional domains. The domains are represented by overlapping structured grids, and block-structured adaptive mesh refinement (AMR) is employed to locally increase the grid resolution. In addition, the numerical method is implemented on parallel distributed-memory computers using a domain-decomposition approach. The implementation is flexible so that each base grid within the overlapping grid structure and its associated refinement grids can be independently partitioned over a chosen set of processors. A modified bin-packing algorithm is used to specify the partition for each grid so that the computational work is evenly distributed amongst the processors. All components of the AMR algorithm such as error estimation, regridding, and interpolation are performed in parallel. The parallel time-stepping algorithm is illustrated for initial-boundary-value problems involving a linear advection-diffusion equation and the (nonlinear) reactive Euler equations. Numerical results are presented for both equations to demonstrate the accuracy and correctness of the parallel approach. Exact solutions of the advection-diffusion equation are constructed, and these are used to check the corresponding numerical solutions for a variety of tests involving different overlapping grids, different numbers of refinement levels and refinement ratios, and different numbers of processors. The problem of planar shock diffraction by a sphere is considered as an illustration of the numerical approach for the Euler equations, and a problem involving the initiation of a detonation from a hot spot in a T-shaped pipe is considered to demonstrate the numerical approach for the reactive case. For both problems, the accuracy of the numerical solutions is assessed quantitatively through an estimation of the errors from a grid convergence study. The parallel performance of the approach is examined for the shock diffraction problem.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Data-driven acoustic measurement of moisture content in flowing biomass

Measuring the moisture content in flowing biomass is critical to processes such as liquid biofuel conversion, such as biogasoline, biodiesel, bio jet kerosene, etc. However, biomass tends to flow in aggregates, which results in significant inhomogeneities in the amount of biomass flowing in front of a sensor at a given time, and there can be significant overlap in the material properties of dry vs wet biomass, leading to poor signal-to-noise ratio. We present a technique for identifying biomass moisture content using a series of acoustic pitch-catch measurements to quantify the sound speed and acoustic amplitude through the biomass, in conjunction with classical machine learning techniques, including Naive Bayes, Random Forest, and K-Nearest Neighbors classification. We amplify the differences between the acoustic measurements in different moisture levels by collecting a series of pulse-echo measurements, which we sort in order of ascending sound speed. We test the accuracy of the technique on experimentally-prepared batches of corn stover biomass with specified moisture levels and measure the average error in the estimated moisture level as a function of the number of pitch-catch measurements used. We observe average estimation errors as low as 6.7% by increasing the number of measurements and optimizing the hyperparameters. This work presents a novel method determining moisture content in flowing biomass with inhomogeneous flow. Additionally, this technique has application in optimizing biomass conversion processes, as well as other fields including, paper production, natural fiber processing, and mineral extraction.

09 BIOMASS FUELS↗