Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “stochastic estimation”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,045 records · Page 58

Emergency Generation Asset Positioning for Resilient Transmission Grid Operation: Preprint

In this paper we study a problem of hurricane emergency preparedness via placement of emergency generation assets prior to its strike. We present a two-stage stochastic model for choosing locations and quantities of emergency storage to help support the power grid through a hurricane event. The expectation of losses in our two-stage model is estimated using the sample average approximation. We construct damage scenarios for sample average approximation using WIND Toolkit meteorological data and fragility curves of various electric grid components. We demonstrate the efficacy of our two-stage planning model by simulating operations during Hurricane Dolly on the 2000-bus transmission test system. Our model, coupled with our scenario selection strategy, is effective at mitigating loss of load when compared to a model without emergency generation assets placed prior to an extreme event.

emergency preparedness↗

Stochastic Trust-Region Algorithm in Random Subspaces with Convergence and Expected Complexity Analyses

Here, this work proposes a framework for large-scale stochastic derivative-free optimization (DFO) by introducing STARS, a trust-region method based on iterative minimization in random subspaces. This framework is both an algorithmic and theoretical extension of a random subspace derivative-free optimization (RSDFO) framework, and an algorithm for stochastic optimization with random models (STORM). Moreover, like RSDFO, STARS achieves scalability by minimizing interpolation models that approximate the objective in low-dimensional affine subspaces, thus significantly reducing per-iteration costs in terms of function evaluations and yielding strong performance on largescale stochastic DFO problems. The user-determined dimension of these subspaces, when the latter are defined, for example, by the columns of so-called Johnson-Lindenstrauss transforms, turns out to be independent of the dimension of the problem. For convergence purposes, inspired by the analyses of RSDFO and STORM, both a particular quality of the subspace and the accuracies of random function estimates and models are required to hold with sufficiently high, but fixed, probabilities. Using martingale theory under the latter assumptions, an almost sure global convergence of STARS to a first-order stationary point is shown, and the expected number of iterations required to reach a desired first-order accuracy is proved to be similar to that of STORM and other stochastic DFO algorithms, up to constants.

97 MATHEMATICS AND COMPUTING↗

Development of global stochastic models for infrasound [Slides]

Infrasound is a ‘signature’ of energetic events in the atmosphere and shallow crust. Infrasound is the component of the CTBT monitoring framework dedicated to monitoring atmospheric explosions. Infrasound is also used by U.S. monitoring agencies for source characterization and yield estimation.

58 GEOSCIENCES↗

An adaptive algorithm for simulation of stochastic reaction-diffusion processes

We propose an adaptive hybrid method suitable for stochastic simulation of diffusion dominated reaction-diffusion processes. For such systems, simulation of the diffusion requires the predominant part of the computing time. In order to reduce the computational work, the diffusion in parts of the domain is treated macroscopically, in other parts with the tau-leap method and in the remaining parts with Gillespie's stochastic simulation algorithm (SSA) as implemented in the next subvolume method (NSM). The chemical reactions are handled by SSA everywhere in the computational domain. A trajectory of the process is advanced in time by an operator splitting technique and the timesteps are chosen adaptively. The spatial adaptation is based on estimates of the errors in the tau-leap method and the macroscopic diffusion. The accuracy and efficiency of the method are demonstrated in examples from molecular biology where the domain is discretized by unstructured meshes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Dynamic remapping of parallel computations with varying resource demands

A large class of computational problems is characterized by frequent synchronization, and computational requirements which change as a function of time. When such a problem must be solved on a message passing multiprocessor machine, the combination of these characteristics lead to system performance which decreases in time. Performance can be improved with periodic redistribution of computational load; however, redistribution can exact a sometimes large delay cost. We study the issue of deciding when to invoke a global load remapping mechanism. Such a decision policy must effectively weigh the costs of remapping against the performance benefits. We treat this problem by constructing two analytic models which exhibit stochastically decreasing performance. One model is quite tractable; we are able to describe the optimal remapping algorithm, and the optimal decision policy governing when to invoke that algorithm. However, computational complexity prohibits the use of the optimal remapping decision policy. We then study the performance of a general remapping policy on both analytic models. This policy attempts to minimize a statistic W(n) which measures the system degradation (including the cost of remapping) per computation step over a period of n steps. We show that as a function of time, the expected value of W(n) has at most one minimum, and that when this minimum exists it defines the optimal fixed-interval remapping policy. Our decision policy appeals to this result by remapping when it estimates that W(n) is minimized. Our performance data suggests that this policy effectively finds the natural frequency of remapping. We also use the analytic models to express the relationship between performance and remapping cost, number of processors, and the computation's stochastic activity.

Nicol, D. M.↗

Robustness of Quadratic Hedging Strategies in Finance via Backward Stochastic Differential Equations with Jumps

We consider a backward stochastic differential equation with jumps (BSDEJ) which is driven by a Brownian motion and a Poisson random measure. We present two candidate-approximations to this BSDEJ and we prove that the solution of each candidate-approximation converges to the solution of the original BSDEJ in a space which we specify. We use this result to investigate in further detail the consequences of the choice of the model to (partial) hedging in incomplete markets in finance. As an application, we consider models in which the small variations in the price dynamics are modeled with a Poisson random measure with infinite activity and models in which these small variations are modeled with a Brownian motion or are cut off. Using the convergence results on BSDEJs, we show that quadratic hedging strategies are robust towards the approximation of the market prices and we derive an estimation of the model risk.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Developing and Testing a Novel Stochastic Ice Microphysics Parameterization for Cloud and Climate Models Using ARM Field Campaign Data (Final Progress Report)

The major goals of this project were: 1) to use field campaign measurements from DOE’s Atmospheric Radiation Measurement (ARM) program to characterize variability of important parameters describing properties of ice particles in the atmosphere; 2) based on this observational analysis, to develop a parameterization scheme for weather and climate models that stochastically varies these parameters, and implement the new scheme into a weather model called the Weather Research and Forecasting model (WRF); 3) to use WRF coupled with the new stochastic scheme to simulate ARM field campaign thunderstorm cases and analyze how accounting for this parameter variability affects the model simulations. This work was performed jointly between the National Center for Atmospheric Research, University of Oklahoma, and University of Utah. To accomplish these goals, we extended an approach previously developed to characterize the variability in the size distribution of ice particles to parameters that are explicitly represented in models (i.e., relationships between ice particle mass and size, and between particle fall velocity and size). Our project was, to our knowledge, the first to apply observationally-constrained estimates of this parameter variability describing mass-size and fall velocity-size in a modeling framework. Our results showed efficacy of the approach, evaluated using ARM observations. Similarly, to our knowledge, work in this project was the first to propose and evaluate in detail a stochastic approach for unresolved turbulent mixing in high-resolution model simulations against detailed, benchmark large eddy simulations and ARM observations. Results showed some promising behavior, particularly with increased mixing and dilution of air in thunderstorm cores with surrounding environmental air, bringing the stochastic simulations closer to the benchmark large eddy simulations; however, results were somewhat degraded using stochastic mixing compared to observations from the AMIE/DYNAMO field campaign. This project also further refined and applied a modeling methodology called “piggybacking” that can robustly separate dynamical and thermodynamic impacts of model changes, and comparison studies of different models based on cases developed from ARM observations. Finally, this project directly supported three graduate students who completed their PhDs as well as a postdoctoral research fellow.

54 ENVIRONMENTAL SCIENCES↗

THE PANCHROMATIC HUBBLE ANDROMEDA TREASURY. III. MEASURING AGES AND MASSES OF PARTIALLY RESOLVED STELLAR CLUSTERS

The apparent age and mass of a stellar cluster can be strongly affected by stochastic sampling of the stellar initial mass function (IMF), when inferred from the integrated color of low-mass clusters ({approx}<10{sup 4} M {sub Sun }). We use simulated star clusters to show that these effects are minimized when the brightest, rapidly evolving stars in a cluster can be resolved, and the light of the fainter, more numerous unresolved stars can be analyzed separately. When comparing the light from the less luminous cluster members to models of unresolved light, more accurate age estimates can be obtained than when analyzing the integrated light from the entire cluster under the assumption that the IMF is fully populated. We show the success of this technique first using simulated clusters, and then with a stellar cluster in M31. This method represents one way of accounting for the discrete, stochastic sampling of the stellar IMF in less massive clusters and can be leveraged in studies of clusters throughout the Local Group and other nearby galaxies.

79 ASTRONOMY AND ASTROPHYSICS↗

Statistical analysis of the performance and simulation of a two-axis tracking PV system

The energy produced by a photovoltaic system over a given period can be estimated from the incident radiation at the site where the Grid Connected PV System (GCPVS) is located, assuming knowledge of certain basic features of the system under study. Due to the inherently stochastic nature of solar radiation, the question ''How much energy will a GCPVS produce at this location over the next few years?'' involves an exercise of prediction inevitably subjected to a degree of uncertainty. Moreover, during the life cycle of the GCPVS, another question arises: ''Is the system working correctly?''. This paper proposes and examines several methods to cope with these questions. The daily performance of a PV system is simulated. This simulation and the interannual variability of both radiation and productivity are statistically analyzed. From the results several regression adjustments are obtained. This analysis is shown to be useful both for productivity prediction and performance checking exercises. Finally, a statistical analysis of the performance of a GCPVS is carried out as a detection method of malfunctioning parts of the system. (author)

14 SOLAR ENERGY↗

Tracking and predicting barges on inland waterways

We present a non-linear, probabilistic prediction model developed and implemented to track spatial location and other navigation characteristics of a barge traveling on the inland waterway system. A pre-filter, to check the validity of the measurements, a non-linear speed estimation process, and a Kalman filter to predict the navigation solution of the barge is developed in this work. Due to the complex dynamics involved in the system, a non-linear stochastic model was developed in state space using system dynamics to represent the process and measurement systems while maintaining the fidelity of an actual system. The algorithm was verified using actual measurements obtained from multiple barges on multiple rivers acquired from different sensors. The results show a reliable and robust prediction algorithm for tracking inland waterway barges.

Randeniya, Duminda I↗

Extreme-Scale Bayesian Inference for Uncertainty Quantification of Complex Simulations

Uncertainty quantification (UQ)—that is, quantifying uncertainties in complex mathematical models and their large-scale computational implementations—is widely viewed as one of the outstanding challenges facing the field of CS&E over the coming decade. The EUREKA project set to address the most difficult class of UQ problems: those for which both the underlying PDE model as well as the uncertain parameters are of extreme scale. In the project we worked on these extreme-scale challenges in the following four areas: 1. Scalable parallel algorithms for sampling and characterizing the posterior distribution that exploit the structure of the underlying PDEs and parameter-to-observable map. These include structure-exploiting versions of the randomized maximum likelihood method, which aims to overcome the intractability of employing conventional MCMC methods for solving extreme-scale Bayesian inversion problems by appealing to and adapting ideas from large-scale PDE-constrained optimization, which have been very successful at exploring high-dimensional spaces. 2. Scalable parallel algorithms for construction of prior and likelihood functions based on learning methods and non-parametric density estimation. Constructing problem-specific priors remains a critical challenge in Bayesian inference, and more so in high dimensions. Another challenge is construction of likelihood functions that capture unmodeled couplings between observations and parameters. We will create parallel algorithms for non-parametric density estimation using high dimensional N-body methods and combine them with supervised learning techniques for the construction of priors and likelihood functions. 3. Bayesian inadequacy models, which augment physics models with stochastic models that represent their imperfections. The success of the Bayesian inference framework depends on the ability to represent the uncertainty due to imperfections of the mathematical model of the phenomena of interest. This is a central challenge in UQ, especially for large-scale models. We propose to develop the mathematical tools to address these challenges in the context of extreme-scale problems. 4. Parallel scalable algorithms for Bayesian optimal experimental design (OED). Bayesian inversion yields quantified uncertainties in the model parameters, which can be propagated forward through the model to yield uncertainty in outputs of interest. This opens the way for designing new experiments to reduce the uncertainties in the model parameters and model predictions. Such experimental design problems have been intractable for large-scale problems using conventional methods; we will create OED algorithms that exploit the structure of the PDE model and the parameter-to-output map to overcome these challenges. Parallel algorithms for these four problems were created, analyzed, prototyped, implemented, tuned, and scaled up for leading-edge supercomputers, including UT-Austin’s own 10 petaflops Stampede system, ANL’s Mira system, and ORNL’s Titan system. While our focus is on fundamental mathematical/computational methods and algorithms, we will assess our methods on model problems derived from several DOE mission applications, including multiscale mechanics and ice sheet dynamics.

97 MATHEMATICS AND COMPUTING↗

Probabilistic Economic Valuation of Safety Margin Management

The goal of this project was to explore a new methodology for evaluation of potential safety margin upgrades to add a new instrument to the Risk Informed Safety Margin Characterization (RISMC) toolkit. To this end, the RAVEN code developed by the Idaho National Laboratory was used to perform a cost-benefit analysis of several potential power plant safety upgrades to compare the material cost of the upgrades with the probabilistic benefit of avoiding accident scenario consequences to find the most cost-effective safety upgrades. By coupling RAVEN to MELCOR to drive Monte-Carlo method stochastic parameter analysis and using data from existing nuclear codes, as well as MELCOR’s radionuclide relocation tracking capabilities, the radionuclide release source term activity in a severe accident scenario can be estimated. Severe Accident Mitigation upgrades were benchmarked against the Hardened Containment Ventilation upgrade mandated by the USNRC for Mk1 BWRs using dollars spent per Curie of release prevented as a metric by which to evaluate the economic efficacy of the upgrades. Additionally, Fault Tree/Event Tree-based analyses were performed to compare older methods of evaluation to the methodology pioneered in this work, and Monthly Operating Report (MORP) outage data was analyzed for insights into power plant outage optimization and reduction.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Multidimensional stochastic approximation using locally contractive functions

A Robbins-Monro type multidimensional stochastic approximation algorithm which converges in mean square and with probability one to the fixed point of a locally contractive regression function is developed. The algorithm is applied to obtain maximum likelihood estimates of the parameters for a mixture of multivariate normal distributions.

Lawton, W. M.↗

Reliability and maintainability assessment factors for reliable fault-tolerant systems

A long term goal of the NASA Langley Research Center is the development of a reliability assessment methodology of sufficient power to enable the credible comparison of the stochastic attributes of one ultrareliable system design against others. This methodology, developed over a 10 year period, is a combined analytic and simulative technique. An analytic component is the Computer Aided Reliability Estimation capability, third generation, or simply CARE III. A simulative component is the Gate Logic Software Simulator capability, or GLOSS. The numerous factors that potentially have a degrading effect on system reliability and the ways in which these factors that are peculiar to highly reliable fault tolerant systems are accounted for in credible reliability assessments. Also presented are the modeling difficulties that result from their inclusion and the ways in which CARE III and GLOSS mitigate the intractability of the heretofore unworkable mathematics.

Bavuso, S. J.↗

Stochastic robustness synthesis for a benchmark problem

Stochastic robustness analysis guides the synthesis of robust linear quadratic Gaussian (LQG) regulators for a benchmark control problem. Probabilities of exceeding allowable design limits, including stability, setting time, and control usage, are estimated by Monte Carlo evaluation. Robust, low-gain compensators that fulfill objectives are designed by numerically minimizing quadratic functions of these probabilities. The method is straightforward and makes use of uncomplicated design principles.

Stengel, Robert F.↗

Integration of Uncertain Ramp Area Aircraft Trajectories and Generation of Optimal Taxiway Schedules at Charlotte Douglas (CLT) Airport

The integration of aircraft maneuver characteristics into an optimal taxiway scheduling solution is challenging due to the uncertainties that are intrinsic to ramp area aircraft trajectories. To address the challenge, we build a stochastic model of ramp area aircraft trajectories that is used to generate a probabilistic measure of conflict within the Charlotte Douglas International Airport (CLT) ramp area. Parameters of the conflict distributions are estimated and passed to a Mixed Integer Linear Program that solves for an optimal taxiway schedule constrained to be conflict free in the presence of trajectory uncertainties. Here we extend our previous research by accounting for departing and arriving aircraft whereas our prior formulation only accounted for departing aircraft.

taxiway schedule↗

Proceedings of the 2013 International Conference on Mathematics and Computational Methods Applied to Nuclear Science and Engineering - M and C 2013

The Mathematics and Computation Division of the American Nuclear (ANS) and the Idaho Section of the ANS hosted the 2013 International Conference on Mathematics and Computational Methods Applied to Nuclear Science and Engineering (M and C 2013). This proceedings contains over 250 full papers with topics ranging from reactor physics; radiation transport; materials science; nuclear fuels; core performance and optimization; reactor systems and safety; fluid dynamics; medical applications; analytical and numerical methods; algorithms for advanced architectures; and validation verification, and uncertainty quantification.

97 MATHEMATICS AND COMPUTING↗

Stochastic inverse problems: Models and metrics

In past work, we introduced model-based inverse methods, and applied them to problems in which the anomaly could be reasonably modeled by simple canonical shapes, such as rectangular solids. In these cases the parameters to be inverted would be length, width and height, as well as the occasional probe lift-off or rotation. We are now developing a formulation that allows more flexibility in modeling complex flaws. The idea consists of expanding the flaw in a sequence of basis functions, and then solving for the expansion coefficients of this sequence, which are modeled as independent random variables, uniformly distributed over their range of values. There are a number of applications of such modeling: 1. Connected cracks and multiple half-moons, which we have noted in a POD set. Ideally we would like to distinguish connected cracks from one long shallow crack. 2. Cracks of irregular profile and shape which have appeared in cold work holes during bolt-hole eddy-current inspection. One side of such cracks is much deeper than other. 3. L or C shaped crack profiles at the surface, examples of which have been seen in bolt-hole cracks. By formulating problems in a stochastic sense, we are able to leverage the stochastic global optimization algorithms in NLSE, which is resident in VIC-3D®, to answer questions of global minimization and to compute confidence bounds using the sensitivity coefficient that we get from NLSE. We will also address the issue of surrogate functions which are used during the inversion process, and how they contribute to the quality of the estimation of the bounds.

36 MATERIALS SCIENCE↗