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 1,099 records · Page 61

An Online Joint Optimization–Estimation Architecture for Distribution Networks

Here in this article, we propose an optimal joint optimization-estimation architecture for distribution networks, which jointly solves the optimal power flow (OPF) problem and static state estimation (SE) problem through an online gradient-based feedback algorithm. The main objective is to enable a fast and timely interaction between the OPF decisions and state estimators with limited sensor measurements. First, convergence and optimality of the proposed algorithm are analytically established. Then, the proposed gradient-based algorithm is modified by introducing statistical information of the inherent estimation and linearization errors for an improved and robust performance of the online OPF decisions. Overall, the proposed method eliminates the traditional separation of operation and monitoring, where optimization and estimation usually operate at distinct layers and different time scales. Hence, it enables a computationally affordable, efficient, and robust online operational framework for distribution networks under time-varying settings.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Timestamp Shift Detection for Synchrophasor Data Based on Similarity Analysis between Relative Phase Angle and Frequency

Timestamp Shift (TS) in synchrophasor data can lead to false operation of synchrophasor-based wide-area monitoring, protection and control applications. The letter presents a method to detect TS of synchrophasor data based on similarity analysis between its own relative phase angle and frequency. Here, a linear correlation component, caused by TS, between relative phase angle and measured frequency is discovered via theoretical derivation. Then a detection method is developed utilizing this linear component for TS diagnosis. Firstly, system phase angle is leveraged as angle reference and then relative phase angle is calculated. Secondly, the correlation coefficient between relative phase angle and frequency is calculated for similarity analysis. Thirdly, the TS is detected via threshold criterion and corresponding time error is estimated. The effectiveness of this method is validated via experiments with actual synchrophasor data in FNET/Grideye.

97 MATHEMATICS AND COMPUTING↗

PUF Entropy

This note discusses aspects of fuzzy extraction: in particular, how the interplay between PUF entropy and the revelation of helper data affects the entropy of the underlying secret. We examine the theory behind a scheme by Dodis et alii to develop exact formulas for the entropy of the given seed, given that an adversary knows the helper data. We also give a simple lower bound on the security of the Dodis scheme that is achieved exactly in many instances. By way of several examples, we quantify the amount of entropy that can be lost due to interactions between imperfect PUF implementations and given error correction methods. We repeatedly show that understanding the details of the error correction scheme and the interaction with the PUF response is crucial to being able to estimate the entropy of the system.

97 MATHEMATICS AND COMPUTING↗

Computer simulation of supersonic rarefied gas flow in the transition region, about a spherical probe; a Monte Carlo approach with application to rocket-borne ion probe experiments

This report describes a Monte Carlo simulation of transition flow around a sphere. Conditions for the simulation correspond to neutral monatomic molecules at two altitudes (70 and 75 km) in the D region of the ionosphere. Results are presented in the form of density contours, velocity vector plots and density, velocity and temperature profiles for the two altitudes. Contours and density profiles are related to independent Monte Carlo and experimental studies, and drag coefficients are calculated and compared with available experimental data. The small computer used is a PDP-15 with 16 K of core, and a typical run for 75 km requires five iterations, each taking five hours. The results are recorded on DECTAPE to be printed when required, and the program provides error estimates for any flow field parameter.

Horton, B. E.↗

Experience gained from computer processing of physical experimental data during the restoration of measured values

The processing stage in which the restored values of the physical parameters are received is described. The following main steps are discussed: estimation of the state of the telemetry data, processing of the calibration data, and determination of the errors in the data; data decommutation and analysis of the structure of measurement cycles for each instrument; decoding, estimates of the reliability of the restored data, and their agreement with the models adopted for the measurement process; and analysis of errors due to deterministic and random factors. A block diagram of the method is presented.

Mamotko, Z. N.↗

Use of sensitivity analysis to predict pilot performance as a function of different displays

A technique for objectively evaluating different displays by sensitivity analysis is described. First, the mathematical model used to analyze static displays is developed. The technique is based on formulating functional relationships between the state variables and the variables observable in the display. The matrix of the partial derivatives of the display variables with respect to the state variables, together with the observer's acuity function, is used to calculate expected errors in the state vector estimation. The technique is expanded by the use of Kalman filtering to process a time series of observation vectors. This provides a tool for analyzing displays of dynamic processes by means of a dynamic display evaluation computer program. Results are reported using this program to simulate an Instrument Landing System approach.

Mout, M. L.↗

Systematic methods for knowledge acquisition and expert system development

Nine cooperating rule-based systems, collectively called AUTOCREW, were designed to automate functions and decisions associated with a combat aircraft's subsystem. The organization of tasks within each system is described; performance metrics were developed to evaluate the workload of each rule base, and to assess the cooperation between the rule-bases. Each AUTOCREW subsystem is composed of several expert systems that perform specific tasks. AUTOCREW's NAVIGATOR was analyzed in detail to understand the difficulties involved in designing the system and to identify tools and methodologies that ease development. The NAVIGATOR determines optimal navigation strategies from a set of available sensors. A Navigation Sensor Management (NSM) expert system was systematically designed from Kalman filter covariance data; four ground-based, a satellite-based, and two on-board INS-aiding sensors were modeled and simulated to aid an INS. The NSM Expert was developed using the Analysis of Variance (ANOVA) and the ID3 algorithm. Navigation strategy selection is based on an RSS position error decision metric, which is computed from the covariance data. Results show that the NSM Expert predicts position error correctly between 45 and 100 percent of the time for a specified navaid configuration and aircraft trajectory. The NSM Expert adapts to new situations, and provides reasonable estimates of hybrid performance. The systematic nature of the ANOVA/ID3 method makes it broadly applicable to expert system design when experimental or simulation data is available.

Belkin, Brenda L.↗

Reynolds-Averaged Turbulence Model Assessment for a Highly Back-Pressured Isolator Flowfield

The use of computational fluid dynamics in scramjet engine component development is widespread in the existing literature. Unfortunately, the quantification of model-form uncertainties is rarely addressed with anything other than sensitivity studies, requiring that the computational results be intimately tied to and calibrated against existing test data. This practice must be replaced with a formal uncertainty quantification process for computational fluid dynamics to play an expanded role in the system design, development, and flight certification process. Due to ground test facility limitations, this expanded role is believed to be a requirement by some in the test and evaluation community if scramjet engines are to be given serious consideration as a viable propulsion device. An effort has been initiated at the NASA Langley Research Center to validate several turbulence closure models used for Reynolds-averaged simulations of scramjet isolator flows. The turbulence models considered were the Menter BSL, Menter SST, Wilcox 1998, Wilcox 2006, and the Gatski-Speziale explicit algebraic Reynolds stress models. The simulations were carried out using the VULCAN computational fluid dynamics package developed at the NASA Langley Research Center. A procedure to quantify the numerical errors was developed to account for discretization errors in the validation process. This procedure utilized the grid convergence index defined by Roache as a bounding estimate for the numerical error. The validation data was collected from a mechanically back-pressured constant area (1 2 inch) isolator model with an isolator entrance Mach number of 2.5. As expected, the model-form uncertainty was substantial for the shock-dominated, massively separated flowfield within the isolator as evidenced by a 6 duct height variation in shock train length depending on the turbulence model employed. Generally speaking, the turbulence models that did not include an explicit stress limiter more closely matched the measured surface pressures. This observation is somewhat surprising, given that stress-limiting models have generally been developed to better predict shock-separated flows. All of the models considered also failed to properly predict the shape and extent of the separated flow region caused by the shock boundary layer interactions. However, the best performing models were able to predict the isolator shock train length (an important metric for isolator operability margin) to within 1 isolator duct height.

Baurle, Robert A.↗

Estimation of Crop Gross Primary Production (GPP): Do Scaled (MODIS) Vegetation Indices Improve Performance? - 2

Satellite remote sensing estimates of Gross Primary Production (GPP) have routinely been made using spectral Vegetation Indices (VIs) over the past two decades. The Normalized Difference Vegetation Index (NDVI), the Enhanced Vegetation Index (EVI), the green band Wide Dynamic Range Vegetation Index (WDRVIgreen), and the green band Chlorophyll Index (CIgreen) have been employed to estimate GPP under the assumption that GPP is proportional to the product of VI and photosynthetically active radiation (PAR) (where VI is one of four VIs: NDVI, EVI, WDRVIgreen, or CIgreen). However, the empirical regressions between VI*PAR and GPP measured locally at flux towers do not pass through the origin (i.e., the zero X-Y value for regressions). Therefore they are somewhat difficult to interpret and apply. This study investigates (1) what are the scaling factors and offsets (i.e., regression slopes and intercepts) between the fraction of PAR absorbed by chlorophyll of a canopy (fAPARchl) and the VIs, and (2) whether the scaled VIs developed in (1) can eliminate the deficiency and improve the accuracy of GPP estimates. Three AmeriFlux maize and soybean fields were selected for this study, two of which are irrigated and one is rainfed. The four VIs and fAPARchl of the fields were computed with the MODerate resolution Imaging Spectroradiometer (MODIS) satellite images. The GPP estimation performance for the scaled VIs was compared to results obtained with the original VIs and evaluated with standard statistics: the coefficient of determination (R2), the root mean square error (RMSE), and the coefficient of variation (CV). Overall, the scaled EVI obtained the best performance. The performance of the scaled NDVI, EVI and WDRVIgreen was improved across sites, crop types and soil/background wetness conditions. The scaled CIgreen did not improve results, compared to the original CIgreen. The scaled green band indices (WDRVIgreen, CIgreen) did not exhibit superior performance to either the scaled EVI or NDVI in estimating crop daily GPP at these agricultural fields. The scaled VIs are more physiologically meaningful than original un-scaled VIs, but scaling factors and offsets may vary across crop types and surface conditions.

Vegetation Index↗

Comparing Anisotropic Output-Based Grid Adaptation Methods by Decomposition

Anisotropic grid adaptation is examined by decomposing the steps of flow solution, ad- joint solution, error estimation, metric construction, and simplex grid adaptation. Multiple implementations of each of these steps are evaluated by comparison to each other and expected analytic results when available. For example, grids are adapted to analytic metric fields and grid measures are computed to illustrate the properties of multiple independent implementations of grid adaptation mechanics. Different implementations of each step in the adaptation process can be evaluated in a system where the other components of the adaptive cycle are fixed. Detailed examination of these properties allows comparison of different methods to identify the current state of the art and where further development should be targeted.

Park, Michael A.↗

FUN3D Manual: 14.0.2

This manual describes the installation and execution of FUN3D version 14.0.2, including optional dependent packages. FUN3D is a suite of computational fluid dynamics simulation and design tools that uses mixed-element unstructured grids in a large number of formats, including structured multiblock and overset grid systems. A discretely-exact adjoint solver may be used for formal design optimization, error estimation, and mesh adaptation. FUN3D also offers a reacting, real-gas capability and provides GPU acceleration of many common simulation options.

William K Anderson↗

FUN3D Manual: 14.1

This manual describes the installation and execution of FUN3D version 14.1, including optional dependent packages. FUN3D is a suite of computational fluid dynamics simulation and design tools that uses mixed-element unstructured grids in a large number of formats, including structured multiblock and overset grid systems. A discretely-exact adjoint solver may be used for formal design optimization, error estimation, and mesh adaptation. FUN3D also offers a reacting, real-gas capability and provides GPU acceleration of many common simulation options.

William K Anderson↗

Multilevel Convergence Analysis of Multigrid-Reduction-in-Time

This study presents a multilevel convergence framework for multigrid-reduction-in-time (MGRIT) as a generalization of previous two-grid estimates. The framework provides a priori upper bounds on the convergence of MGRIT V- and F-cycles, with different relaxation schemes, by deriving the respective residual and error propagation operators. The residual and error operators are functions of the time-stepping operator, analyzed directly and bounded in the norm, both numerically and analytically. We present various upper bounds of different computational cost and varying sharpness. These upper bounds are complemented by proposing analytic formulae for the approximate convergence factor of V-cycle algorithms that take the number of fine grid time points, the temporal coarsening factors, and the eigenvalues of the time-stepping operator as parameters. The paper concludes with supporting numerical investigations of parabolic (anisotropic diffusion) and hyperbolic (wave equation) model problems. We assess the sharpness of the bounds and the quality of the approximate convergence factors. Observations from these numerical investigations demonstrate the value of the proposed multilevel convergence framework for estimating MGRIT convergence a priori and for the design of a convergent algorithm. We further highlight that observations in the literature are captured by the theory, including that two-level Parareal and multilevel MGRIT with F-relaxation do not yield scalable algorithms and the benefit of a stronger relaxation scheme. An important observation is that with increasing numbers of levels MGRIT convergence deteriorates for the hyperbolic model problem, while constant convergence factors can be achieved for the diffusion equation. The theory also indicates that L-stable Runge--Kutta schemes are more amendable to multilevel parallel-in-time integration with MGRIT than A-stable Runge--Kutta schemes.

97 MATHEMATICS AND COMPUTING↗

PARAMETER ESTIMATION FROM TIME-SERIES DATA WITH CORRELATED ERRORS: A WAVELET-BASED METHOD AND ITS APPLICATION TO TRANSIT LIGHT CURVES

We consider the problem of fitting a parametric model to time-series data that are afflicted by correlated noise. The noise is represented by a sum of two stationary Gaussian processes: one that is uncorrelated in time, and another that has a power spectral density varying as 1/f{sup g}amma. We present an accurate and fast [O(N)] algorithm for parameter estimation based on computing the likelihood in a wavelet basis. The method is illustrated and tested using simulated time-series photometry of exoplanetary transits, with particular attention to estimating the mid-transit time. We compare our method to two other methods that have been used in the literature, the time-averaging method and the residual-permutation method. For noise processes that obey our assumptions, the algorithm presented here gives more accurate results for mid-transit times and truer estimates of their uncertainties.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Mastering HPC Runtime Prediction: From Observing Patterns to a Methodological Approach

The continual expansion of high-performance computing (HPC) brings with it an increasing need for efficiency. Heavy investment in energy, hardware, and software infrastructure to support peta- and exascale computing requires the optimization of existing systems and, wherever possible, the discernment and adoption of best-practices towards these goals. Such is the case for runtime prediction. When a job is submitted to an HPC system, an estimate of its runtime is provided by the user in the form of "requested wallclock". Error in this user-provided estimate can lead to jobs being prematurely killed by the scheduler, increased wait time on the queue, and decreased system utilization. More than fifteen years of research has been directed at mitigating these effects by using data-driven runtime predictions. Codified here is a set of commonalities and insights emerging from this body of work, which we present as recommendations and best practices. These practices are combined into a methodological approach described and evaluated on an 11-million-job dataset from the National Renewable Energy Laboratory's petascale HPC system, Eagle. This dataset and the accompanying codebase have been released to the public domain for the benefit of the wider HPC research community.

high performance computing↗

Mastering HPC Runtime Prediction: From Observing Patterns to a Methodological Approach: Preprint

The continual expansion of high-performance computing (HPC) brings with it an increasing need for efficiency. Heavy investment in energy, hardware, and software infrastructure to support peta- and exascale computing requires the optimization of existing systems and, wherever possible, the discernment and adoption of best-practices towards these goals. Such is the case for runtime prediction. When a job is submitted to an HPC system, an estimate of its runtime is provided by the user in the form of "requested wallclock''. Error in this user-provided estimate can lead to jobs being prematurely killed by the scheduler, increased wait time on the queue, and decreased system utilization. More than fifteen years of research has been directed at mitigating these effects by using data-driven runtime predictions. Codified here is a set of commonalities and insights emerging from this body of work, which we present as recommendations and best practices. These practices are combined into a methodological approach described and evaluated on an 11-million-job dataset from the National Renewable Energy Laboratory's petascale HPC system, Eagle. This dataset and the accompanying codebase have been released to the public domain for the benefit of the wider HPC research community.

high performance computing↗

LOCAL NON-GAUSSIANITY IN THE COSMIC MICROWAVE BACKGROUND THE BAYESIAN WAY

We introduce an exact Bayesian approach to search for non-Gaussianity of local type in cosmic microwave background (CMB) radiation data. Using simulated CMB temperature maps, the newly developed technique is compared against the conventional frequentist bispectrum estimator. Starting from the joint probability distribution, we obtain analytic expressions for the conditional probabilities of the primordial perturbations given the data, and for the level of non-Gaussianity, f{sub NL}, given the data and the perturbations. We propose Hamiltonian Monte Carlo sampling as a means to derive realizations of the primordial fluctuations from which we in turn sample f{sub NL}. Although computationally expensive, this approach allows us to construct exactly the full target posterior probability distribution. When compared to the frequentist estimator, applying the Bayesian method to Gaussian CMB maps provides consistent results. For the analysis of non-Gaussian maps, however, the error bars on f{sub NL} do not show excess variance within the Bayesian framework. This finding is of particular relevance in the light of upcoming high-precision CMB measurements obtained by the Planck satellite mission.

79 ASTRONOMY AND ASTROPHYSICS↗

Decorrelating the errors of the galaxy correlation function with compact transformation matrices

Abstract Covariance matrix estimation is a persistent challenge for cosmology, often requiring a large number of synthetic mock catalogues. The off-diagonal components of the covariance matrix also make it difficult to show representative error bars on the 2-point correlation function (2PCF) since errors computed from the diagonal values of the covariance matrix greatly underestimate the uncertainties. We develop a routine for decorrelating the projected and anisotropic 2PCF with simple and scale-compact transformations on the 2PCF. These transformation matrices are modelled after the Cholesky decomposition and the symmetric square root of the Fisher matrix. Using mock catalogues, we show that the transformed projected and anisotropic 2PCF recover the same structure as the original 2PCF while producing largely decorrelated error bars. Specifically, we propose simple Cholesky-based transformation matrices that suppress the off-diagonal covariances on the projected 2PCF by ${\sim } 95{{\ \rm per\ cent}}$ and that on the anisotropic 2PCF by ${\sim } 87{{\ \rm per\ cent}}$. These transformations also serve as highly regularized models of the Fisher matrix, compressing the degrees of freedom so that one can fit for the Fisher matrix with a much smaller number of mocks.

79 ASTRONOMY AND ASTROPHYSICS↗