Search NASA⌕ Search

SEARCH · Search NASA

Results for “Monte Carlo estimators”

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

Downlink Receiver Algorithms for Deep Space Optical Communications

The goal of the Deep Space Optical Communications project at the Jet Propulsion Laboratory is to demonstrate laser communication links at ranges out to approximately 3 AU. In this paper, we discuss a downlink receiver concept capable of demodulating optical pulse-position modulated (PPM) waveforms with data rates varying from approximately 50 kbps up to 265 Mbps, using a range of PPM orders, slot widths, and code rates. The receiver operates on recorded timestamps corresponding to the times-of-arrival of photons detected by a photon-counting detector array followed by a commercial time-tagger. Algorithms are presented for slot, symbol, and frame synchronization as well as parameter estimation. Estimates of link performance are evaluated through Monte- Carlo simulation for an optical channel that includes optical losses, detector blocking, signal clock dynamics, and pointing-induced downlink fades. Based upon these simulation results, it is expected that link closure may be achieved with at least 3 dB of margin under a variety of relevant conditions.

Tkacenko, Andre↗

Effective Uncertainty Quantification for Multi-Angle Polarimetric Aerosol Remote Sensing Over Ocean

Multi-angle polarimetric (MAP) measurements can enable detailed characterization of aerosol microphysical and optical properties and improve atmospheric correction in ocean color remote sensing. Advanced retrieval algorithms have been developed to obtain multiple geophysical parameters in the atmosphere–ocean system. Theoretical pixel-wise retrieval uncertainties based on error propagation have been used to quantify retrieval performance and determine the quality of data products. However, standard error propagation techniques in high-dimensional retrievals may not always represent true retrieval errors well due to issues such as local minima and the nonlinear dependence of the forward model on the retrieved parameters near the solution. In this work, we analyze these theoretical uncertainty estimates and validate them using a flexible Monte Carlo approach. The Fast Multi-Angular Polarimetric Ocean coLor (FastMAPOL) retrieval algorithm, based on efficient neural network forward models, is used to conduct the retrievals and uncertainty quantification on both synthetic HARP2 (Hyper-Angular Rainbow Polarimeter 2) and AirHARP (airborne version of HARP2) datasets. In addition, for practical application of the uncertainty evaluation technique in operational data processing, we use the automatic differentiation method to calculate derivatives analytically based on the neural network models. Both the speed and accuracy associated with uncertainty quantification for MAP retrievals are addressed in this study. Pixel-wise retrieval uncertainties are further evaluated for the real AirHARP field campaign data. The uncertainty quantification methods and results can be used to evaluate the quality of data products, as well as guide MAP algorithm development for current and future satellite systems such as NASA’s Plankton, Aerosol, Cloud, ocean Ecosystem (PACE) mission.

PACE↗

Monte Carlo mixture model of lifetime cancer incidence risk from radiation exposure on shuttle and international space station

Estimating uncertainty in lifetime cancer risk for human exposure to space radiation is a unique challenge. Conventional risk assessment with low-linear-energy-transfer (LET)-based risk from Japanese atomic bomb survivor studies may be inappropriate for relativistic protons and nuclei in space due to track structure effects. This paper develops a Monte Carlo mixture model (MCMM) for transferring additive, National Institutes of Health multiplicative, and multiplicative excess cancer incidence risks based on Japanese atomic bomb survivor data to determine excess incidence risk for various US astronaut exposure profiles. The MCMM serves as an anchor point for future risk projection methods involving biophysical models of DNA damage from space radiation. Lifetime incidence risks of radiation-induced cancer for the MCMM based on low-LET Japanese data for nonleukemia (all cancers except leukemia) were 2.77 (90% confidence limit, 0.75-11.34) for males exposed to 1 Sv at age 45 and 2.20 (90% confidence limit, 0.59-10.12) for males exposed at age 55. For females, mixture model risks for nonleukemia exposed separately to 1 Sv at ages of 45 and 55 were 2.98 (90% confidence limit, 0.90-11.70) and 2.44 (90% confidence limit, 0.70-10.30), respectively. Risks for high-LET 200 MeV protons (LET=0.45 keV/micrometer), 1 MeV alpha-particles (LET=100 keV/micrometer), and 600 MeV iron particles (LET=180 keV/micrometer) were scored on a per particle basis by determining the particle fluence required for an average of one particle per cell nucleus of area 100 micrometer(2). Lifetime risk per proton was 2.68x10(-2)% (90% confidence limit, 0.79x10(-3)%-0. 514x10(-2)%). For alpha-particles, lifetime risk was 14.2% (90% confidence limit, 2.5%-31.2%). Conversely, lifetime risk per iron particle was 23.7% (90% confidence limit, 4.5%-53.0%). Uncertainty in the DDREF for high-LET particles may be less than that for low-LET radiation because typically there is very little dose-rate dependence. Probability density functions for high-LET radiation quality and dose-rate may be preferable to conventional risk assessment approaches. Nuclear reactions and track structure effects in tissue may not be properly estimated by existing data using in vitro models for estimating RBEs. The method used here is being extended to estimate uncertainty in spacecraft shielding effectiveness in various space radiation environments.

NASA Center LaRC↗

Improving Multi-Model Trajectory Simulation Estimators using Model Selection and Tuning

Multi-model Monte Carlo methods have been demonstrated to be an efficient and accurate alternative to standard Monte Carlo (MC) in the model-based propagation of uncertainty in entry, descent, and landing (EDL) applications. These multi-model MC methods fuse predictions from low-fidelity models with the high-fidelity EDL model of interest to produce unbiased statistics with a fraction of the computational cost. The accuracy and efficiency of the multi-model MC methods are dependent upon the magnitude of correlations of the low-fidelity models with the high-fidelity model, but also upon the correlation amongst the low-fidelity models, and their relative computational cost. Because of this layer of complexity, the question of how to optimally select the set of low-fidelity models has remained open. In this work, methods for optimal model construction and tuning are investigated as a means to increase the speed and precision of trajectory simulation for EDL. Specifically, the focus is on the inclusion of low-fidelity model tuning within the sample allocation optimization that accompanies multi-model MC methods. Preliminary results indicate that low-fidelity model tuning can significantly improve efficiency and precision of trajectory simulations and provide an increased edge to multi-model MC methods when compared to standard MC. The challenges and potential benefits to exploring a fully iterative and comprehensive optimization strategy in future work are highlighted.

uncertainty quantification↗

Improving Multi-Model Trajectory Simulation Estimators using Model Selection and Tuning

Multi-model Monte Carlo methods have been demonstrated to be an efficient and accurate alternative to standard Monte Carlo (MC) in the model-based propagation of uncertainty in entry, descent, and landing (EDL) applications. These multi-model MC methods fuse predictions from low-fidelity models with the high-fidelity EDL model of interest to produce unbiased statistics with a fraction of the computational cost. The accuracy and efficiency of the multi-model MC methods are dependent upon the magnitude of correlations of the low-fidelity models with the high-fidelity model, but also upon the correlation among the low-fidelity models, and their relative computational cost. Because of this layer of complexity, the question of how to optimally select the set of low-fidelity models has remained open. In this work, methods for optimal model construction and tuning are investigated as a means to increase the speed and precision of trajectory simulation for EDL. Specifically, the focus is on the inclusion of low-fidelity model tuning within the sample allocation optimization that accompanies multi-model MC methods. Preliminary results indicate that low-fidelity model tuning can significantly improve efficiency and precision of trajectory simulations and provide an increased edge to multi-model MC methods when compared to standard MC. The challenges and potential benefits to exploring a fully iterative and comprehensive optimization strategy in future work are highlighted.

uncertainty quantification↗

A Fast Monte Carlo Method for Model-Based Prognostics Based on Stochastic Calculus

This work proposes a fast Monte Carlo method to solve differential equations utilized in model-based prognostics. The methodology is derived from the theory of stochastic calculus, and the goal of such a method is to speed up the estimation of the probability density functions describing the independent variable evolution over time. In the prognostic scenarios presented in this paper, the stochastic differential equations describe variables directly or indirectly related to the degradation of a monitored system. The method allows the estimation of the probability density functions by solving the deterministic equation and approximating the stochastic integrals using samples of the model noise. By so doing, the prognostic problem is solved without the Monte Carlo simulation based on Euler's forward method, which is typically the most time consuming task of the prediction stage. Three different prognostic scenarios are presented as proof of concept: (i) life prediction of electrolytic capacitors, (ii) remaining time to discharge of Lithium-ion batteries, and (iii) prognostic of cracked structures under fatigue loading. The paper shows how the method produces probability density functions that are statistically indistinguishable from the distributions estimated with Euler's forward Monte Carlo simulation. However, the proposed solution is orders of magnitude faster when computing the time-to-failure distribution of the monitored system. The approach may enable complex real-time prognostics and health management solutions with limited computing power.

Corbetta, M.↗

A Fast Monte Carlo Method for Model-Based Prognostics Based on Stochastic Calculus

This work proposes a fast Monte Carlo method to solve differential equations utilized in model-based prognostics. The methodology is derived from the theory of stochastic calculus, and the goal of such a method is to speed up the estimation of the probability density functions describing the independent variable evolution over time. In the prognostic scenarios presented in this paper, the stochastic differential equations describe variables directly or indirectly related to the degradation of a monitored system. The method allows the estimation of the probability density functions by solving the deterministic equation and approximating the stochastic integrals using samples of the model noise. By so doing, the prognostic problem is solved without the Monte Carlo simulation based on Euler's forward method, which is typically the most time consuming task of the prediction stage. Three different prognostic scenarios are presented as proof of concept: (i) life prediction of electrolytic capacitors, (ii) remaining time to discharge of Lithium-ion batteries, and (iii) prognostic of cracked structures under fatigue loading. The paper shows how the method produces probability density functions that are statistically indistinguishable from the distributions estimated with Euler's forward Monte Carlo simulation. However, the proposed solution is orders of magnitude faster when computing the time-to-failure distribution of the monitored system. The approach may enable complex real-time prognostics and health management solutions with limited computing power.

stochastic calculus↗

Five-Year Wilkinson Microwave Anisotropy Probe (WMAP1) Observations: Galactic Foreground Emission

We present a new estimate of foreground emission in the WMAP data, using a Markov chain Monte Carlo (MCMC) method. The new technique delivers maps of each foreground component for a variety of foreground models, error estimates of the uncertainty of each foreground component, and provides an overall goodness-of-fit measurement. The resulting foreground maps are in broad agreement with those from previous techniques used both within the collaboration and by other authors. We find that for WMAP data, a simple model with power-law synchrotron, free-free, and thermal dust components fits 90% of the sky with a reduced X(sup 2) (sub v) of 1.14. However, the model does not work well inside the Galactic plane. The addition of either synchrotron steepening or a modified spinning dust model improves the fit. This component may account for up to 14% of the total flux at Ka-band (33 GHz). We find no evidence for foreground contamination of the CMB temperature map in the 85% of the sky used for cosmological analysis.

Gold, B.↗

Implementation Recommendations and Usage Boundaries for the Two-Dimensional Probability of Collision Calculation

The two-dimensional (2D) probability of collision (𝑃𝑐) estimation method relies on several assumptions that must be satisfied for accurate results. Monte Carlo analysis of ~44,000 conjunctions indicates that 2D-𝑃(sub 𝑐) pro-vides accurate estimates for most typical conjunctions, but occasionally underestimates 𝑃(sub 𝑐) significantly, indicating an assumption violation. A test to detect large-amplitude underestimation inaccuracies can be based on how much “offset-from-TCA” 2D-𝑃(sub 𝑐) values vary during a well-defined time interval bracketing closest approach. The test successfully detects all large-amplitude 2D-𝑃(sub 𝑐) underestimations found to date, but with a high false-alarm rate. The analysis also provides implementation recommendations and usage boundaries for the 2D-𝑃(sub 𝑐) method.

Hall, Doyle T.↗

Implementation Recommendations and Usage Boundaries for the Two-Dimensional Probability of Collision Calculation

The two-dimensional (2D) probability of collision (𝑃𝑐) estimation method relies on several assumptions that must be satisfied for accurate results. Monte Carlo analysis of ~44,000 conjunctions indicates that 2D-𝑃(sub 𝑐) pro-vides accurate estimates for most typical conjunctions, but occasionally underestimates 𝑃(sub 𝑐) significantly, indicating an assumption violation. A test to detect large-amplitude underestimation inaccuracies can be based on how much “offset-from-TCA” 2D-𝑃(sub 𝑐) values vary during a well-defined time interval bracketing closest approach. The test successfully detects all large-amplitude 2D-𝑃(sub 𝑐) underestimations found to date, but with a high false-alarm rate. The analysis also provides implementation recommendations and usage boundaries for the 2D-𝑃(sub 𝑐) method.

Hall, Doyle T.↗

Machine Learning, Markov Chain Monte Carlo, and Optimal Algorithms to Characterize the AdvACT Kilopixel Transition-Edge Sensor Arrays

Next-generation focal planes comprising dozens of kilopixel transition-edge sensor (TES) arrays require new methods to rapidly screen candidate arrays, evaluate array non-idealities in the field, identify outlier devices for removal, and optimize the array performance in the field. We demonstrate robust methods to estimate TES parameters (critical temperatures and thermal conductivity parameters) and their uncertainties using a custom Markov Chain Monte Carlo (MCMC) algorithm. We also constrain systematic effects in estimating the TES parameters from non-isothermal current-voltage curves (IVs) at approximately a ~3% level. Additionally, for the first time, we have applied Machine Learning (ML) algorithms to tune detector arrays and optimize their performance.

Maria Salatino↗

Stochastic robustness of linear control systems

A simple numerical procedure for estimating the stochastic robustness of a linear, time-invariant system is described. Monte Carlo evaluation of the system's eigenvalues allows the probability of instability and the related stochastic root locus to be estimated. This definition of robustness is an alternative to existing deterministic definitions that address both structured and unstructured parameter variations directly. This analysis approach treats not only Gaussian parameter uncertainties but non-Gaussian cases, including uncertain-but-bounded variations. Trivial extensions of the procedure admit alternate discriminants to be considered. Thus, the probabilities that stipulated degrees of instability will be exceeded or that closed-loop roots will leave desirable regions also can be estimated. Results are particularly amenable to graphical presentation.

Stengel, Robert F.↗

Stochastic robustness of linear time-invariant control systems

A simple numerical procedure for estimating the stochastic robustness of a linear, time-invariant system is described. Monte Carlo evaluation of the system's eigenvalues allows the probability of instability and the related stochastic root locus to be estimated. This definition of robustness is an alternative to existing deterministic definitions that address both structured and unstructured parameter variations directly. This analysis approach treats not only Gaussian parameter uncertainties but also non-Gaussian cases, including uncertain-but-bounded variations. Trivial extensions of the procedure permit alternate discriminants to be considered. Thus the probabilities that stipulated degrees of instability will be exceeded or that closed-loop roots will leave desirable regions can also be estimated. Results are particularly amenable to graphical presentation.

Stengel, Robert F.↗

Dynamic Adjustment of Simulation Parameters for Efficient Vehicle Prognostics

Model-based diagnostics and prognostics rely on state estimation and uncertainty management algorithms to produce useful information for system operators and maintainers. This information enables more informed operational decisions, condition-based maintenance, and overall mission safety assurance. Typically, uncertainty is associated with vehicle state-of-health estimation and prediction results because of modeling errors, internal or external sources of noise, and sensor inaccuracy. Probabilistic uncertainty management methods including Sequential Monte Carlo simulation are commonly used to reason about state-of-health estimates and predictions in the presence of these sources of uncertainty. However, such algorithms can be computationally expensive as they require a very large number of samples to obtain a sufficiently accurate quantification of the end of life probability distribution. As a result, highly mobile autonomous systems that leverage the prognostic results for mission-level replanning are often constrained in their processing capability because of these computationally expensive simulation approaches. Therefore, in this paper, we investigate algorithmic methods for dynamically adjusting simulation time step as well as number of samples to achieve highly efficient prognostic results while maintaining results accuracy. Results obtained from simulated flight experiments of an electric unmanned aerial vehicle are presented to verify the efficacy of such algorithms.

Prognostics↗

Likelihood Analysis for Mega Pixel Maps

The derivation of cosmological parameters from astrophysical data sets routinely involves operations counts which scale as O(N(exp 3) where N is the number of data points. Currently planned missions, including MAP and Planck, will generate sky maps with N(sub d) = 10(exp 6) or more pixels. Simple "brute force" analysis, applied to such mega-pixel data, would require years of computing even on the fastest computers. We describe an algorithm which allows estimation of the likelihood function in the direct pixel basis. The algorithm uses a conjugate gradient approach to evaluate X2 and a geometric approximation to evaluate the determinant. Monte Carlo simulations provide a correction to the determinant, yielding an unbiased estimate of the likelihood surface in an arbitrary region surrounding the likelihood peak. The algorithm requires O(N(sub d)(exp 3/2) operations and O(Nd) storage for each likelihood evaluation, and allows for significant parallel computation.

Kogut, Alan J.↗

Effects of flight instrumentation errors on the estimation of aircraft stability and control derivatives

An error analysis program based on an output error estimation method was used to evaluate the effects of sensor and instrumentation errors on the estimation of aircraft stability and control derivatives. A Monte Carlo analysis was performed using simulated flight data for a high performance military aircraft, a large commercial transport, and a small general aviation aircraft for typical cruise flight conditions. The effects of varying the input sequence and combinations of the sensor and instrumentation errors were investigated. The results indicate that both the parameter accuracy and the corresponding measurement trajectory fit error can be significantly affected. Of the error sources considered, instrumentation lags and control measurement errors were found to be most significant.

Bryant, W. H.↗