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 307 records · Page 17

Program Analyzes Errors In STAGS

EAC computer program designed for analysis of errors in results of STAGS computer program (COSMIC Program HQN-10967). Requires input data for geometry of plate, properties of material, and set of boundary conditions. These input data come from STAGS code. (The specific link between input and output data from STAGS and input data for EAC is POSTP, postprocessor program in STAGS processors.) EAC computes continuous solution from discrete results of STAGS in order to estimate error of results of STAGS. Written in FORTRAN 77.

Thurston, Gaylen A.↗

Regularized Differentiation for Bioburden Density Estimation in Planetary Protection

In this paper, we propose and investigate the performance of two novel shrinkage estimators for bioburden density estimation in planetary protection. The estimators are based on the regularized differentiation of a cumulative count of colony forming units collected throughout the data collecting session or the life cycle of the entire mission. The regularized differentiation recasts the problem of bioburden density estimation as a linear least squares problem. The least squares problem is then solved through regularization techniques, such as truncated singular value decomposition and penalized least squares. The regularization is necessary to avoid noise amplification during the differentiation of noisy data. The two regularization estimators are compared with four other commonly used estimators to simultaneously evaluate the means of multivariable independent Poisson distributions: the maximum likelihood, noninformative Bayes estimator with Jeffreys prior, Empirical Bayes using conjugate gamma-Poisson model with gamma parameters selected by method of moments, and the Clevenson-Zidek estimator. It is shown through computer-simulated data that the regularized differentiation based on ridge regression has the smallest mean-squared error among all estimators. The analysis of shrinkage mechanism implemented by regularized differentiation is performed, and it is shown that the regularized differentiation amounts to performing a weighted averaging of all the samples. The weights are determined by the regularization parameter automatically selected by the L-curve technique. Since the method of least squares makes no distributional assumptions about the data, it presents an attractive technique for bioburden density estimation when there are concerns about the misspecification of the distributional model. The paper concludes with the analysis of the bioburden data collected during InSight mission and directions for future work.

97 - MATHEMATICS AND COMPUTING↗

Postprocessing Mixed Finite Element Methods For Solving Cahn–Hilliard Equation: Methods and Error Analysis

A postprocessing technique for mixed finite element methods for the Cahn-Hilliard equation is developed and analyzed. Once the mixed finite element approximations have been computed at a fixed time on the coarser mesh, the approximations are postprocessed by solving two decoupled Poisson equations in an enriched finite element space (either on a finer grid or a higher-order space) for which many fast Poisson solvers can be applied. The nonlinear iteration is only applied to a much smaller size problem and the computational cost using Newton and direct solvers is negligible compared with the cost of the linear problem. The analysis presented here shows that this technique remains the optimal rate of convergence for both the concentration and the chemical potential approximations. The corresponding error estimate obtained in our paper, especially the negative norm error estimates, are non-trivial and different with the existing results in the literatures.

97 MATHEMATICS AND COMPUTING↗

Effective noise-suppressed and artifact-reduced reconstruction of SPECT data using a preconditioned alternating projection algorithm

Purpose: The authors have recently developed a preconditioned alternating projection algorithm (PAPA) with total variation (TV) regularizer for solving the penalized-likelihood optimization model for single-photon emission computed tomography (SPECT) reconstruction. This algorithm belongs to a novel class of fixed-point proximity methods. The goal of this work is to investigate how PAPA performs while dealing with realistic noisy SPECT data, to compare its performance with more conventional methods, and to address issues with TV artifacts by proposing a novel form of the algorithm invoking high-order TV regularization, denoted as HOTV-PAPA, which has been explored and studied extensively in the present work. Methods: Using Monte Carlo methods, the authors simulate noisy SPECT data from two water cylinders; one contains lumpy “warm” background and “hot” lesions of various sizes with Gaussian activity distribution, and the other is a reference cylinder without hot lesions. The authors study the performance of HOTV-PAPA and compare it with PAPA using first-order TV regularization (TV-PAPA), the Panin–Zeng–Gullberg one-step-late method with TV regularization (TV-OSL), and an expectation–maximization algorithm with Gaussian postfilter (GPF-EM). The authors select penalty-weights (hyperparameters) by qualitatively balancing the trade-off between resolution and image noise separately for TV-PAPA and TV-OSL. However, the authors arrived at the same penalty-weight value for both of them. The authors set the first penalty-weight in HOTV-PAPA equal to the optimal penalty-weight found for TV-PAPA. The second penalty-weight needed for HOTV-PAPA is tuned by balancing resolution and the severity of staircase artifacts. The authors adjust the Gaussian postfilter to approximately match the local point spread function of GPF-EM and HOTV-PAPA. The authors examine hot lesion detectability, study local spatial resolution, analyze background noise properties, estimate mean square errors (MSEs), and report the convergence speed and computation time. Results: HOTV-PAPA yields the best signal-to-noise ratio, followed by TV-PAPA and TV-OSL/GPF-EM. The local spatial resolution of HOTV-PAPA is somewhat worse than that of TV-PAPA and TV-OSL. Images reconstructed using HOTV-PAPA have the lowest local noise power spectrum (LNPS) amplitudes, followed by TV-PAPA, TV-OSL, and GPF-EM. The LNPS peak of GPF-EM is shifted toward higher spatial frequencies than those for the three other methods. The PAPA-type methods exhibit much lower ensemble noise, ensemble voxel variance, and image roughness. HOTV-PAPA performs best in these categories. Whereas images reconstructed using both TV-PAPA and TV-OSL are degraded by severe staircase artifacts; HOTV-PAPA substantially reduces such artifacts. It also converges faster than the other three methods and exhibits the lowest overall reconstruction error level, as measured by MSE. Conclusions: For high-noise simulated SPECT data, HOTV-PAPA outperforms TV-PAPA, GPF-EM, and TV-OSL in terms of hot lesion detectability, noise suppression, MSE, and computational efficiency. Unlike TV-PAPA and TV-OSL, HOTV-PAPA does not create sizable staircase artifacts. Moreover, HOTV-PAPA effectively suppresses noise, with only limited loss of local spatial resolution. Of the four methods, HOTV-PAPA shows the best lesion detectability, thanks to its superior noise suppression. HOTV-PAPA shows promise for clinically useful reconstructions of low-dose SPECT data.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Systematic estimation of forecast and observation error covariances in four-dimensional data assimilation

A two-part algorithm is presented for reliably computing weather forecast model and observational error covariances during data assimilation. Data errors arise from instrumental inaccuracies and sub-grid scale variability, whereas forecast errors occur because of modeling errors and the propagation of previous analysis errors. A Kalman filter is defined as the primary algorithm for estimating the forecast and analysis error convariance matrices. A second algorithm is described for quantifying the noise covariance matrices of any degree to obtain accurate values for the observational error covariances. Numerical results are provided from a linearized one-dimensional shallow-water model. The results cover observational noise covariances, initial instrumental errors and erroneous model values.

Dee, D. P.↗

A dual-frequency microwave technique for measuring rainwater content

This study shows that the dual-frequency (38, 25 GHz) differential attenuation (A(38-25)) coefficient can provide accurate estimates of rainwater content W potentially over a wide range of rainwater contents. While measurements along a microwave link are fairly easily implemented, radar estimates of A(38-25) can become clouded by differences between the radar reflectivity factors at the two frequencies (Z38, Z25). Root-mean-square deviations (epsilon) of the estimated W from the actual W are calculated for a wide variety of drop-size distributions and rainwater contents. The computed epsilon include the effects of standard measurement errors and differences between Z38 and Z25. Accurate estimates appear possible using a 38-25-GHz radar when W is not less than 1.5-2 g/cu m, depending upon the desired spatial resolution, and along a microwave link when W is not less than 0.5 g/cu m.

Jameson, A. R.↗

Dynamic Inversion for Hydrological Process Monitoring with Electrical Resistance Tomography Under Model Uncertainty

We propose an approach for imaging the dynamics of complex hydrological processes. The evolution of electrically conductive fluids in porous media is imaged using time-lapse electrical resistance tomography. The related dynamic inversion problem is solved using Bayesian filtering techniques, that is, it is formulated as a sequential state estimation problem in which the target is an evolving posterior probability density of the system state. The dynamical inversion framework is based on the state space representation of the system, which involves the construction of a stochastic evolution model and an observation model. The observation model used in this paper consists of the complete electrode model for ERT, with Archie's law relating saturations to electrical conductivity. The evolution model is an approximate model for simulating flow through partially saturated porous media. Unavoidable modeling and approximation errors in both the observation and evolution models are considered by computing approximate statistics for these errors. These models are then included in the construction of the posterior probability density of the estimated system state. This approximation error method allows the use of approximate - and therefore computationally efficient - observation and evolution models in the Bayesian filtering. We consider a synthetic example and show that the incorporation of an explicit model for the model uncertainties in the state space representation can yield better estimates than a frame-by-frame imaging approach.

54 ENVIRONMENTAL SCIENCES↗

Estimation of the absolute position of mobile systems by an optoelectronic processor

A method that determine the absolute position of a mobile system with a hybrid optoelectronic processor has been developed. Position estimates are based on an analysis of circular landmarks that are detected by a TV camera attached to the mobile system. The difference between the known shape of the landmark and its image provides the information needed to determine the absolute position of the mobile system. For robust operation, the parameters of the landmark image are extracted at high speeds using an optical processor that performs an optical Hough transform. The coordinates of the mobile system are computed from these parameters in a digital co-processor using fast algorithms. Different sources of position estimation errors have also been analyzed, and consequent algorithms to improve the navigation performance of the mobile system have been developed and evaluated by both computer simulation and experiments.

Feng, Liqiang↗

How Well do Multisatellite Products Capture the Space-Time Dynamics of Precipitation? Part II: Building an Error Model Through Spectral System Identification

Satellite precipitation products, as all quantitative estimates, come with some inherent degree of uncertainty. To associate a quantitative value of the uncertainty to each individual estimate, error modeling is necessary. Most of the error models proposed so far compute the uncertainty as a function of precipitation intensity only, and only at one specific spatio-temporal scale. We propose a spectral error model which accounts for the neighboring space-time dynamics of precipitation into the uncertainty quantification. Systematic distortions of the precipitation signal and random errors are characterized distinctively in every frequency-wavenumber band in the Fourier domain, to accurately characterize error across scales. The systematic distortions are represented as a deterministic space-time linear filtering term. The random errors are represented as a non-stationary additive noise. The spectral error model is applied to the IMERG multi satellite precipitation product and its parameters are estimated empirically through a system identification approach using the GV-MRMS gauge-radar measurements as reference (“truth”) over the eastern United States. The filtering term is found to be essentially low-pass. While traditional error models attribute most of the error variance to random errors, it is found here that the systematic filtering term explains 48% of the error variance at the native resolution of IMERG. This fact confirms that, at high resolution, filtering effects in satellite precipitation products cannot be ignored, and that the error cannot be represented as a purely random additive or multiplicative term. An important consequence is that precipitation estimates derived from totally different sources shall not be expected to automatically have statistically independent errors.

Precipitation↗

Neural network uncertainty assessment using Bayesian statistics: a remote sensing application

Neural network (NN) techniques have proved successful for many regression problems, in particular for remote sensing; however, uncertainty estimates are rarely provided. In this article, a Bayesian technique to evaluate uncertainties of the NN parameters (i.e., synaptic weights) is first presented. In contrast to more traditional approaches based on point estimation of the NN weights, we assess uncertainties on such estimates to monitor the robustness of the NN model. These theoretical developments are illustrated by applying them to the problem of retrieving surface skin temperature, microwave surface emissivities, and integrated water vapor content from a combined analysis of satellite microwave and infrared observations over land. The weight uncertainty estimates are then used to compute analytically the uncertainties in the network outputs (i.e., error bars and correlation structure of these errors). Such quantities are very important for evaluating any application of an NN model. The uncertainties on the NN Jacobians are then considered in the third part of this article. Used for regression fitting, NN models can be used effectively to represent highly nonlinear, multivariate functions. In this situation, most emphasis is put on estimating the output errors, but almost no attention has been given to errors associated with the internal structure of the regression model. The complex structure of dependency inside the NN is the essence of the model, and assessing its quality, coherency, and physical character makes all the difference between a blackbox model with small output errors and a reliable, robust, and physically coherent model. Such dependency structures are described to the first order by the NN Jacobians: they indicate the sensitivity of one output with respect to the inputs of the model for given input data. We use a Monte Carlo integration procedure to estimate the robustness of the NN Jacobians. A regularization strategy based on principal component analysis is proposed to suppress the multicollinearities in order to make these Jacobians robust and physically meaningful.

Neural Networks (Computer)↗

FAST AND OPTIMAL COSMIC MICROWAVE BACKGROUND LENSING USING STATISTICAL INTERPOLATION ON THE SPHERE

We describe an accurate and fast pixel-based statistical method to interpolate fields of arbitrary spin on the sphere. We call this method Fast and Lean Interpolation on the Sphere (FLINTS). The method predicts the optimal interpolated values based on the theory of isotropic Gaussian random fields and provides an accurate error estimate at no additional cost. We use this method to compute lensed cosmic microwave background (CMB) maps precisely and quickly, achieving a relative precision of 0.02% at a HEALPIX resolution of N {sub side} = 4096, for a bandlimit of l{sub max}= 4096 in the same time it takes to simulate the original, unlensed CMB map. The method is suitable for efficient, distributed memory parallelization. The power spectra of our lensed maps are accurate to better than 0.5% at l= 3000 for the temperature, the E and B modes of the polarization. As expected theoretically, we demonstrate that, on realistic cases, this method is between two and three orders of magnitude more precise than other known interpolation methods for the same computational cost.

79 ASTRONOMY AND ASTROPHYSICS↗

Stochastic Vector Techniques in Ground-State Electronic Structure

Herein we review a suite of stochastic vector computational approaches for studying the electronic structure of extended condensed matter systems. These techniques help reduce algorithmic complexity, facilitate efficient parallelization, simplify computational tasks, accelerate calculations, and diminish memory requirements. While their scope is vast, we limit our study to ground-state and finite temperature density functional theory (DFT) and second-order many-body perturbation theory. More advanced topics, such as quasiparticle (charge) and optical (neutral) excitations and higher-order processes, are covered elsewhere. We start by explaining how to use stochastic vectors in computations, characterizing the associated statistical errors. Next, we show how to estimate the electron density in DFT and discuss effective techniques to reduce statistical errors. Finally, we review the use of stochastic vectors for calculating correlation energies within the second-order Møller-Plesset perturbation theory and its finite temperature variational form. Example calculation results are presented and used to demonstrate the efficacy of the methods.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A new linear quadratic optimal controller for the 34-meter high efficiency antenna position loop

The design of a new position loop controller for the 34-meter High Efficiency Deep Space antennas using linear quadratic (LQ) optimal control techniques is discussed. The LQ optimal control theory is reviewed, and model development and verification are discussed. Families of optimal gain vectors are generated by varying weight parameters. Performance specifications were used to select a final gain vector. Estimator dynamics were selected and the corresponding gain vectors were computed. Final estimator selection was based on position, commanded rate, and estimator error responses.

Nickerson, J. A.↗

Control of the errors of discretization and idealization in finite element analysis

Understanding of the basic principles which control errors of discretization in finite element analysis has increased very substantially since 1980. The main milestones were: (1) development of the theoretical basis of p-extensions (1981); (2) understanding of the proper interplay between mesh design and assignment of polynomial degree to elements. Practical realization of exponential convergence rates, independently of the smoothness of the exact solution (1984); and (3) industrial experience with the new finite element technology known as the p- or hp-version of the finite element method: General Dynamics reported thirty- to forty-fold savings in terms of human time and large savings in computer time (1986). Lockheed reported favorably on their evaluation of error estimation and quality control capabilities of the p-version in industrial settings (1987). The gains in our understanding of how to control the errors of discretization represent only half of the control necessary to ensure that a numerical model is in fact an accurate representation of the corresponding physical system. Control of the errors of idealization is equally important. A brief overview of the main ideas of how to ensure the quality and reliability of mathematical models of structural systems is presented.

Szabo, Barna A.↗

Optimal Communication Topology Determination and Sensor Selection for Independent Airspace Surveillance

The paper presents an approach to sensors selection and network topology determination for independent airspace surveillance with maximum outcome and minimum cost using ground based distributed sensing, computing and communication network infrastructure. The selection criteria includes minimum estimation error, maximum airspace coverage, minimum communication time and power consumption while guaranteeing the system observability and providing in-time quality information to a monitoring observer. The developed algorithm uses multi-objective optimization strategy taking into account trade-offs between conflicting objectives and relaxations for in time implementation. It is implemented utilizing graph theoretic tools. The approach is validated in a desktop simulation environment using synthetic sensors data generated for a simulated multi-vehicle flight scenario in the selected regional airspace.

Distributed sensing↗

A Parallel Ghosting Algorithm for The Flexible Distributed Mesh Database

Critical to the scalability of parallel adaptive simulations are parallel control functions including load balancing, reduced inter-process communication and optimal data decomposition. In distributed meshes, many mesh-based applications frequently access neighborhood information for computational purposes which must be transmitted efficiently to avoid parallel performance degradation when the neighbors are on different processors. This article presents a parallel algorithm of creating and deleting data copies, referred to as ghost copies, which localize neighborhood data for computation purposes while minimizing inter-process communication. The key characteristics of the algorithm are: (1) It can create ghost copies of any permissible topological order in a 1D, 2D or 3D mesh based on selected adjacencies. (2) It exploits neighborhood communication patterns during the ghost creation process thus eliminating all-to-all communication. (3) For applications that need neighbors of neighbors, the algorithm can create n number of ghost layers up to a point where the whole partitioned mesh can be ghosted. Strong and weak scaling results are presented for the IBM BG/P and Cray XE6 architectures up to a core count of 32,768 processors. The algorithm also leads to scalable results when used in a parallel super-convergent patch recovery error estimator, an application that frequently accesses neighborhood data to carry out computation.

Mubarak, Misbah↗

An adaptive mesh-moving and refinement procedure for one-dimensional conservation laws

We examine the performance of an adaptive mesh-moving and /or local mesh refinement procedure for the finite difference solution of one-dimensional hyperbolic systems of conservation laws. Adaptive motion of a base mesh is designed to isolate spatially distinct phenomena, and recursive local refinement of the time step and cells of the stationary or moving base mesh is performed in regions where a refinement indicator exceeds a prescribed tolerance. These adaptive procedures are incorporated into a computer code that includes a MacCormack finite difference scheme wih Davis' artificial viscosity model and a discretization error estimate based on Richardson's extrapolation. Experiments are conducted on three problems in order to qualify the advantages of adaptive techniques relative to uniform mesh computations and the relative benefits of mesh moving and refinement. Key results indicate that local mesh refinement, with and without mesh moving, can provide reliable solutions at much lower computational cost than possible on uniform meshes; that mesh motion can be used to improve the results of uniform mesh solutions for a modest computational effort; that the cost of managing the tree data structure associated with refinement is small; and that a combination of mesh motion and refinement reliably produces solutions for the least cost per unit accuracy.

Biswas, Rupak↗