Search NASA⌕ Search

SEARCH · Search NASA

Results for “computable error estimate”

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 379 records · Page 21

Fisher information and asymptotic normality in system identification for quantum Markov chains

This paper deals with the problem of estimating the coupling constant {theta} of a mixing quantum Markov chain. For a repeated measurement on the chain's output we show that the outcomes' time average has an asymptotically normal (Gaussian) distribution, and we give the explicit expressions of its mean and variance. In particular, we obtain a simple estimator of {theta} whose classical Fisher information can be optimized over different choices of measured observables. We then show that the quantum state of the output together with the system is itself asymptotically Gaussian and compute its quantum Fisher information, which sets an absolute bound to the estimation error. The classical and quantum Fisher information are compared in a simple example. In the vicinity of {theta}=0 we find that the quantum Fisher information has a quadratic rather than linear scaling in output size, and asymptotically the Fisher information is localized in the system, while the output is independent of the parameter.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Dimensionality Reduction Library v 0.2

Dimensionality Reduction Library is a C++ library for dimensionality reduction. In the context of this library, dimensionality reduction is considered to consist of 1)estimation of the intrinsic dimensionality using sampled data, 2) Finding maps that reduce the dimensionality of data (forward map) or increase the dimensionality of data (reverse map) and 3) mapping arbitray coordinates to high and low dimensionalities. The library is intended to provide a consistent interface to multiple dimensionality reduction algorithms with an efficient C++ interface that runs efficiently on multicore architectures. A few routines have been optimized with an option for GPU acceleration or distributed computation. Currently the library offers intrinsic dimensionality estimation using point-PCA reconstruction error and/ residual variance. The following dimensionality reduction methods have been implemented: Principal Component Analysis Multidimensional Scaling Locally Linear Embedding IsoMap Autoencoder Neutral Networks An executable is also supplied that can be built to allow for command-line access to the library routines. A description for an application of the library for molecular structure analysis has been published.

BROWN, WILLIAM↗

Thermodynamics-informed latent space dynamics identification

This software showcases a latent space dynamics identification method, namely tLaSDI, that embeds the first and second principles of thermodynamics. The latent variables are learned through an autoencoder as a nonlinear dimension reduction model. The latent dynamics are constructed by a neural network-based model that precisely preserves certain structures for the thermodynamic laws through the GENERIC formalism. An abstract error estimate is established, which provides a new loss formulation involving the Jacobian computation of autoencoder. The autoencoder and the latent dynamics are simultaneously trained to minimize the new loss. Computational examples demonstrate the effectiveness of tLaSDI, which exhibits robust generalization ability, even in extrapolation. In addition, an intriguing correlation is empirically observed between a quantity from tLaSDI in the latent space and the behaviors of the full-state solution.

Cheung, Siu Wun↗

Finite element methods for the inhomogeneous Navier-Stokes equations

A conforming mixed finite element method for the stationary Navier-Stokes equations with inhomogeneous boundary conditions is considered. Estimates for the error in the velocity and pressure approximations are derived. A computational example is provided to illustrate the implementation of the method.

Peterson, J. S.↗

Adaptive finite difference methods in fluid dynamics

An adaptive method to solve partial differential equations in fluid mechanics is presented. The approach requires internal boundary conditions that must be conservative, data structures for keeping track of several layers of fine grid patches, error estimation, and heuristics for automatic grid generation. In practical calculations gains in computer efficiency up to 10 over nonadaptive methods are observed. The whole procedure takes 3000 lines of FORTRAN code.

Berger, Marsha J.↗

Optimum data weighting and error calibration for estimation of gravitational parameters

A new approach has been developed for determining consistent satellite-tracking data weights in solutions for the satellite-only gravitational models. The method employs subset least-squares solutions of the satellite data contained within the complete solution and requires that the differences of the parameters of subset solutions and the complete solution to be in agreement with their error estimates by adjusting the data weights. GEM-T2 model was recently computed and adjusted through a direct application of this method. The estimated data weights are markedly smaller than the weights implied by the formal uncertainties of the measurements. Orbital arc tests as well as surface gravity comparisons show significant improvements for solutions when more realistic data weighting is achieved.

Lerch, Francis J.↗

An Automated Mapping Processor using C-Band Interferometric SAR Data

We describe a processor which has been implemented to generate map products starting from C-band interferometric data. The first stage of the processor consists of the conventional interferometric synthetic aperture radar (SAR) processing producing a digital elevation model (DEM) and a SAR brightness image in sensor coordinates. In the second stage of processing, a land use classification map is obtained by using the DEM, brightness, and interferometric correlation layers. Auxiliary layers which include a drainage layer, a height gradient layer, a height error layer, an estimated penetration layer, and a shaded relief layer are also computed. In the final step, all UTM collocated layers are combined in a geographical information system (GIS) which allows for both hard copy map products and digital applications.

Rodriguez, E.↗

An Automated Mapping Processor Using C-Band Interferometric SAR Data

We present the description of a processor which has been implemented to generate map products starting from C-band interferometric data. The first stage of the processor consists of the conventional interferometric SAR processing producing a Digital Elevation Model (DEMs) and a SAR brightness image in sensor coordinates. In the second stage of processing, a land use classification map is obtained by using the DEM, brightness, and interferometric correlation layers. Auxiliary layers which include a drainage layer, a height gradient layer, a height error layer, an estimated penetration layer, and a shaded relief layer are also computed. In the final step, all UTM collocated layers are combined in a GIS system which allows for both hard copy map products and for digital applications.

Rodriguez, E.↗

Detection of Chemical Precursors of Explosives

Certain selected chemicals associated with terrorist activities are too unstable to be prepared in final form. These chemicals are often prepared as precursor components, to be combined at a time immediately preceding the detonation. One example is a liquid explosive, which usually requires an oxidizer, an energy source, and a chemical or physical mechanism to combine the other components. Detection of the oxidizer (e.g. H2O2) or the energy source (e.g., nitromethane) is often possible, but must be performed in a short time interval (e.g., 5 15 seconds) and in an environment with a very small concentration (e.g.,1 100 ppm), because the target chemical(s) is carried in a sealed container. These needs are met by this invention, which provides a system and associated method for detecting one or more chemical precursors (components) of a multi-component explosive compound. Different carbon nanotubes (CNTs) are loaded (by doping, impregnation, coating, or other functionalization process) for detecting of different chemical substances that are the chemical precursors, respectively, if these precursors are present in a gas to which the CNTs are exposed. After exposure to the gas, a measured electrical parameter (e.g. voltage or current that correlate to impedance, conductivity, capacitance, inductance, etc.) changes with time and concentration in a predictable manner if a selected chemical precursor is present, and will approach an asymptotic value promptly after exposure to the precursor. The measured voltage or current are compared with one or more sequences of their reference values for one or more known target precursor molecules, and a most probable concentration value is estimated for each one, two, or more target molecules. An error value is computed, based on differences of voltage or current for the measured and reference values, using the most probable concentration values. Where the error value is less than a threshold, the system concludes that the target molecule is likely. Presence of one, two, or more target molecules in the gas can be sensed from a single set of measurements.

Li, Jing↗

Toward Automatic Verification of Goal-Oriented Flow Simulations

We demonstrate the power of adaptive mesh refinement with adjoint-based error estimates in verification of simulations governed by the steady Euler equations. The flow equations are discretized using a finite volume scheme on a Cartesian mesh with cut cells at the wall boundaries. The discretization error in selected simulation outputs is estimated using the method of adjoint-weighted residuals. Practical aspects of the implementation are emphasized, particularly in the formulation of the refinement criterion and the mesh adaptation strategy. Following a thorough code verification example, we demonstrate simulation verification of two- and three-dimensional problems. These involve an airfoil performance database, a pressure signature of a body in supersonic flow and a launch abort with strong jet interactions. The results show reliable estimates and automatic control of discretization error in all simulations at an affordable computational cost. Moreover, the approach remains effective even when theoretical assumptions, e.g., steady-state and solution smoothness, are relaxed.

Simulations↗

Sketch-to-Solution: A Case Study in RCS Aerodynamic Interaction

Thanks to recent advances in the fields of anisotropic grid adaptation, error estimation, and geometry modeling, a sketch-to-solution work flow is now possible for viscous computational fluid dynamic (CFD) simulations. With this workflow, a CFD application engineer provides geometry, boundary conditions, and flow parameters; and the sketch-to-solution process yields a CFD simulation through automatic, error-based, grid adaptation. To explore the benefits of this nascent capability, a conventional manual grid generation work flow is compared to this new automatic grid generation work flow for a given engineering question: What are the aerodynamic interactions caused by the reaction control system (RCS) on an entry vehicle? This case study indicates that while the automatic grid generation sketch-to- solution process is not yet mature, it is preferred over a manual grid generation work flow because it greatly reduces manual labor, eliminates many opportunities for human error, and provides grid sensitivity information.

Bill Kleb↗

Dimensionality Reduction Library v 0.2

Dimensionality Reduction Library is a C++ library for dimensionality reduction. In the context of this library, dimensionality reduction is considered to consist of 1)estimation of the intrinsic dimensionality using sampled data, 2) Finding maps that reduce the diemsionality of data (forward map) or increase the dimensionality of data (reverse map) and 3) mapping arbitray coordiantes to high and low dimensionalities. The library is intended toprovide a consistent interface to multiple dimensionality reduction algorithms with an efficient C++ interface that runs efficiently on multicore architectures. A few routines have been optimized with an option for GPU acceleration or distributed computation. Currently the library offers intrinsic dimensionality estimation using point-PCA reconstruction error and/ residual variance. The following dimensionality reduction methods have been implemented: Principal Component Analysis Multidimensional Scaling Locally Linear Embedding IsoMap Autoencoder Neutral Networks An executable is also supplied that can be built to allow for command-line access to the library routines. A description for an applciation of the library for molecular structure analysis has been published.

BROWN, WILLIAM↗

Generalized Perturbation Theory-Free Sensitivity Analysis for Eigenvalue Problems

Generalized perturbation theory (GPT) has been recognized as the most computationally efficient approach for performing sensitivity analysis for models with many input parameters, which renders forward sensitivity analysis computationally overwhelming. In critical systems, GPT involves the solution of the adjoint form of the eigenvalue problem with a response-dependent fixed source. Although conceptually simple to implement, most neutronics codes that can solve the adjoint eigenvalue problem do not have a GPT capability unless envisioned during code development. We introduce in this manuscript a reduced-order modeling approach based on subspace methods that requires the solution of the fundamental adjoint equations but allows the generation of response sensitivities without the need to set up GPT equations, and that provides an estimate of the error resulting from the reduction. Moreover, the new approach solves the eigenvalue problem independently of the number or type of responses. This allows for an efficient computation of sensitivities when many responses are required. This paper introduces the theory and implementation details of the GPT-free approach and describes how the errors could be estimated as part of the analysis. The applicability is demonstrated by estimating the variations in the flux distribution everywhere in the phase space of a fast critical sphere and a high-temperature gas-cooled reactor prismatic lattice. The variations generated by the GPT-free approach are benchmarked to the exact variations generated by direct forward perturbations.

99 GENERAL AND MISCELLANEOUS↗

Multiclass Bayes error estimation by a feature space sampling technique

A general Gaussian M-class N-feature classification problem is defined. An algorithm is developed that requires the class statistics as its only input and computes the minimum probability of error through use of a combined analytical and numerical integration over a sequence simplifying transformations of the feature space. The results are compared with those obtained by conventional techniques applied to a 2-class 4-feature discrimination problem with results previously reported and 4-class 4-feature multispectral scanner Landsat data classified by training and testing of the available data.

Mobasseri, B. G.↗

Probabilistic error estimation for non-intrusive reduced models learned from data of systems governed by linear parabolic partial differential equations

This work derives a residual-based a posteriori error estimator for reduced models learned with non-intrusive model reduction from data of high-dimensional systems governed by linear parabolic partial differential equations with control inputs. It is shown that quantities that are necessary for the error estimator can be either obtained exactly as the solutions of least-squares problems in a non-intrusive way from data such as initial conditions, control inputs, and high-dimensional solution trajectories or bounded in a probabilistic sense. Here, the computational procedure follows an offline/online decomposition. In the offline (training) phase, the high-dimensional system is judiciously solved in a black-box fashion to generate data and to set up the error estimator. In the online phase, the estimator is used to bound the error of the reduced-model predictions for new initial conditions and new control inputs without recourse to the high-dimensional system. Numerical results demonstrate the workflow of the proposed approach from data to reduced models to certified predictions.

97 MATHEMATICS AND COMPUTING↗

PERIOD ERROR ESTIMATION FOR THE KEPLER ECLIPSING BINARY CATALOG

The Kepler Eclipsing Binary Catalog (KEBC) describes 2165 eclipsing binaries identified in the 115 deg{sup 2} Kepler Field based on observations from Kepler quarters Q0, Q1, and Q2. The periods in the KEBC are given in units of days out to six decimal places but no period errors are provided. We present the PEC (Period Error Calculator) algorithm, which can be used to estimate the period errors of strictly periodic variables observed by the Kepler Mission. The PEC algorithm is based on propagation of error theory and assumes that observation of every light curve peak/minimum in a long time-series observation can be unambiguously identified. The PEC algorithm can be efficiently programmed using just a few lines of C computer language code. The PEC algorithm was used to develop a simple model that provides period error estimates for eclipsing binaries in the KEBC with periods less than 62.5 days: log {sigma}{sub P} Almost-Equal-To - 5.8908 + 1.4425(1 + log P), where P is the period of an eclipsing binary in the KEBC in units of days. KEBC systems with periods {>=}62.5 days have KEBC period errors of {approx}0.0144 days. Periods and period errors of seven eclipsing binary systems in the KEBC were measured using the NASA Exoplanet Archive Periodogram Service and compared to period errors estimated using the PEC algorithm.

79 ASTRONOMY AND ASTROPHYSICS↗

Further Investigation of Employing Binomial Small-Sample Estimator in M-LROM

Reduced Order Modeling (ROM) is essential to enable the identification of the so-called active parameter subspace for high-fidelity models that are employed in computationally intensive analyses such as uncertainty characterization and data assimilation. Given the complexity of models for real-world application, brute force methods to identify the active subspace may not be computationally efficient to realize the value of reduction, since in realistic problems, the full scale model must be executed few hundred times, which may be computationally taxing. Earlier work has introduced a new approach, which represents a further development of our previous work on ROM, referred to as multi-level ROM (M-LROM). In M-LROM, approximate models are employed to identify the active subspace instead of the full scale model. In this summary, we present our recent results on M-LROM, specifically in regard to the construction of reliable error metrics that can bound the errors resulting from the reduction. The idea is to employ a lower fidelity model, i.e., an approximation of the full scale or high fidelity model, to build the active subspace, and via the proposed error bound, the quality of the active subspace can be determined by calculating an upper bound on the errors resulting from the reduction. For this approach to be practical, the error bound must be realistic, implying that it should be close to the actual errors expected, and not much higher. Therefore, an important goal of this summary is to compare different error bounds in terms of the relation between their estimated bounds to the actual errors. In particular, we compare the proposed error bound which numerically construct an estimator using binomial distribution to the widely used small-sample norm estimators. Unlike most probabilistic error estimation methods, the proposed bound employs a binomial distribution to construct the estimator whereas in other conventional methods, the distribution employed is typically the standard Gaussian, normalized over a unit hypersphere as initially proposed by the seminal paper of J. Dixon on random matrix theory. Previous publications provided evidence that the binomial distribution calculates more realistic bounds as compared to the Gaussian distribution, which tends to be conservative, implying that the bound is much bigger than the actual errors, which diminishes the value of the reduction, as now must increase the size of the active subspace to reach the desired upper bound on the reduction errors. This work has provided a rigorous approach by which error bounds on the reduction errors can be established without having to execute the high fidelity model during the construction of the active subspace. The high fidelity model is only need to test the error bound using small number of executions. This methodology paves the way for a more efficient application of ROM to complex engineering models, where standard ROM techniques may be too taxing to optimally realize their value in practical situations. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗