Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “DETERMINISTIC 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 433 records · Page 24

Gaussian process hydrodynamics

Abstract We present a Gaussian process (GP) approach, called Gaussian process hydrodynamics (GPH) for approximating the solution to the Euler and Navier-Stokes (NS) equations. Similar to smoothed particle hydrodynamics (SPH), GPH is a Lagrangian particle-based approach that involves the tracking of a finite number of particles transported by a flow. However, these particles do not represent mollified particles of matter but carry discrete/partial information about the continuous flow. Closure is achieved by placing a divergence-free GP prior ξ on the velocity field and conditioning it on the vorticity at the particle locations. Known physics (e.g., the Richardson cascade and velocity increment power laws) is incorporated into the GP prior by using physics-informed additive kernels. This is equivalent to expressing ξ as a sum of independent GPs ξ l , which we call modes, acting at different scales (each mode ξ l self-activates to represent the formation of eddies at the corresponding scales). This approach enables a quantitative analysis of the Richardson cascade through the analysis of the activation of these modes, and enables us to analyze coarse-grain turbulence statistically rather than deterministically. Because GPH is formulated by using the vorticity equations, it does not require solving a pressure equation. By enforcing incompressibility and fluid-structure boundary conditions through the selection of a kernel, GPH requires significantly fewer particles than SPH. Because GPH has a natural probabilistic interpretation, the numerical results come with uncertainty estimates, enabling their incorporation into an uncertainty quantification (UQ) pipeline and adding/removing particles (quanta of information) in an adapted manner. The proposed approach is suitable for analysis because it inherits the complexity of state-of-the-art solvers for dense kernel matrices and results in a natural definition of turbulence as information loss. Numerical experiments support the importance of selecting physics-informed kernels and illustrate the major impact of such kernels on the accuracy and stability. Because the proposed approach uses a Bayesian interpretation, it naturally enables data assimilation and predictions and estimations by mixing simulation data and experimental data.

Mathematics↗

Demonstration of Optimal Benchmark Selection Website and Validation of the q c Coverage Metric Using HEU-SOL-THERM-013-003 Experiment

In the work documented in this interim report, the experiment selection toolkit web site was demonstrated and q C coverage metric methodology was validated for IEU-MET-FAST-002-001, MIX-COMP-THERM 004-004, and HEU-SOL-THERM-013-003 experiments. 𝑞 𝐶 is an information-theoretic measure based on mutual information that quantifies the ability of candidate benchmark experiments to reduce the bias and uncertainty of a target criticality safety application. The metric and an accompanying open-source Python toolkit with a web-based interface were tested against a benchmark set of 425 experiments drawn from the International Criticality Safety Benchmark Evaluation Project Handbook. The interface is hosted at https://edim.covdef.com. It accepts sensitivity data files produced by the TSUNAMI-IP module of the SCALE code system and supports both (i) deterministic analysis using the ENDF/B-VII.0 covariance library and (ii) stochastic analysis based on user-supplied keff samples. Demonstrations on representative applications across a range of material composition, spectrum, and form show that q C -guided benchmark selection achieves greater uncertainty reduction with fewer experiments and yields more stable posterior bias and uncertainty estimates than traditional similarity coefficient ( c k )–based selection, while also capturing valuable low-ck experiments that one-to-one metrics overlook.

Abdel-khalik, Hany S. [Indiana Univ.-Purdue Univ. ↗

Development of a category 2 approach system model

An analytical model is presented which provides, as its primary output, the probability of a successful Category II approach. Typical applications are included using several example systems (manual and automatic) which are subjected to random gusts and deterministic wind shear. The primary purpose of the approach system model is to establish a structure containing the system elements, command inputs, disturbances, and their interactions in an analytical framework so that the relative effects of changes in the various system elements on precision of control and available margins of safety can be estimated. The model is intended to provide insight for the design and integration of suitable autopilot, display, and navigation elements; and to assess the interaction of such elements with the pilot/copilot.

Johnson, W. A.↗

Sensitivity analysis for dose deposition in radiotherapy via a Fokker–Planck model

In this paper, we study the sensitivities of electron dose calculations with respect to stopping power and transport coefficients. We focus on the application to radiotherapy simulations. We use a Fokker–Planck approximation to the Boltzmann transport equation. Equations for the sensitivities are derived by the adjoint method. The Fokker–Planck equation and its adjoint are solved numerically in slab geometry using the spherical harmonics expansion (P N ) and an Harten-Lax-van Leer finite volume method. Our method is verified by comparison to finite difference approximations of the sensitivities. Finally, we present numerical results of the sensitivities for the normalized average dose deposition depth with respect to the stopping power and the transport coefficients, demonstrating the increase in relative sensitivities as beam energy decreases. In conclusion, this in turn gives estimates on the uncertainty in the normalized average deposition depth, which we present.

59 BASIC BIOLOGICAL SCIENCES↗

Shape optimization under uncertainty for rotor blades of horizontal axis wind turbines

We present a computational framework for the shape optimization of a Horizontal-Axis Wind Turbine (HAWT) rotor blade under uncertainty. Our framework integrates aerodynamic simulations based on the blade element method which utilizes reduced order models of the blade structure and wind load with design sensitivity analysis and nonlinear programming. The wind velocity is modeled as a stochastic process to account for variations in time and space. An additional stochastic process accounts for uncertainties in the structural material properties. The uncertainty propagation is based on a non-intrusive polynomial chaos expansion that allows accurate estimation of stochastic performance metrics such as generated power and structural compliance. Sensitivities of cost and constraint functions with respect to shape parameters namely twist angles are computed with an efficient scheme to enable gradient based optimization. To demonstrate the effect of uncertainty, designs obtained from optimization under uncertainty are compared to those obtained from deterministic optimization.

42 ENGINEERING↗

Fermionic Partial Tomography via Classical Shadows

Here we propose a tomographic protocol for estimating any k-body reduced density matrix (k-RDM) of an n-mode fermionic state, a ubiquitous step in near-term quantum algorithms for simulating many-body physics, chemistry, and materials. Our approach extends the framework of classical shadows, a randomized approach to learning a collection of quantum-state properties, to the fermionic setting. Our sampling protocol uses randomized measurement settings generated by a discrete group of fermionic Gaussian unitaries, implementable with linear-depth circuits. We prove that estimating all k-RDM elements to additive precision ϵ requires on the order of ($^{n}_{k}$)k 3/2 log(n)/ϵ 2 repeated state preparations, which is optimal up to the logarithmic factor. Furthermore, numerical calculations show that our protocol offers a substantial improvement in constant overheads for k ≥ 2, as compared to prior deterministic strategies. We also adapt our method to particle-number symmetry, wherein the additional circuit depth may be halved at the cost of roughly 2–5 times more repetitions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Automated Detection of Clouds in Satellite Imagery

Many different approaches have been used to automatically detect clouds in satellite imagery. Most approaches are deterministic and provide a binary cloud - no cloud product used in a variety of applications. Some of these applications require the identification of cloudy pixels for cloud parameter retrieval, while others require only an ability to mask out clouds for the retrieval of surface or atmospheric parameters in the absence of clouds. A few approaches estimate a probability of the presence of a cloud at each point in an image. These probabilities allow a user to select cloud information based on the tolerance of the application to uncertainty in the estimate. Many automated cloud detection techniques develop sophisticated tests using a combination of visible and infrared channels to determine the presence of clouds in both day and night imagery. Visible channels are quite effective in detecting clouds during the day, as long as test thresholds properly account for variations in surface features and atmospheric scattering. Cloud detection at night is more challenging, since only courser resolution infrared measurements are available. A few schemes use just two infrared channels for day and night cloud detection. The most influential factor in the success of a particular technique is the determination of the thresholds for each cloud test. The techniques which perform the best usually have thresholds that are varied based on the geographic region, time of year, time of day and solar angle.

Jedlovec, Gary↗

Target Search and Selection for the DI/EPOXI Spacecraft

Upon completion of the Hartley 2 flyby in November 2010, the Deep Impact (DI) spacecraft resided in a solar orbit without possibility for gravity assist with any large body. Conservative estimates of remaining fuel were enough to provide only an 18 m/s impulse on the spacecraft. We present our method and results of our systematic scan of potential small body encounters for DI, and our criteria to narrow the selection to the asteroid 2002 GT as the target flyby body. The mission profile has two deterministic maneuvers to achieve the encounter, the first of which executed on November 25, 2011.

Deep Impact (DI)↗

Target Search & Selection for the DI/EPOXI Spacecraft

Upon completion of the Hartley 2 flyby in November 2010, the Deep Impact (DI) spacecraft resided in a solar orbit without possibility for gravity assist with any large body. Conservative estimates of remaining fuel were enough to provide only an 18 m/s impulse on the spacecraft. We present our method and results of our systematic scan of potential small body encounters for DI, and our criteria to narrow the selection to the asteroid 2002 GT as the target flyby body. The mission profile has two deterministic maneuvers to achieve the encounter, the first of which executed on November 25, 2011.

Grebow, Daniel J.↗

A comprehensive modeling procedure for estimating statistical properties of forced ignition

In this work, a comprehensive modeling procedure for estimating the probability of ignition with application to high altitude relights of aircraft combustors is developed. In these configurations, an ignitor is used to introduce high-enthalpy discharge into a fuel-laden but stratified flow. Because of the inherent variabilities inflow conditions, kernel discharge process, and the chaotic turbulent flow, ignition cannot be described deterministically, but only as a probabilistic measure. The proposed modeling framework consists of three components. The turbulent flow is represented using the large eddy simulation (LES) framework. The ignition process is modeled using a manifold approach, where the initial kernel evolution is represented using a homogeneous reactor while the latter part of the evolution is represented as a competition between diffusion and chemical reactions using a flamelet-type mapping. A combined lookup table that can track the evolution of the kernel through these two distinct reaction stages is developed. The table lookup variables are solved within the LES framework. The resulting simulation tool is then embedded within an uncertainty quantification approach, where variations in the turbulent flow, as well as operating and kernel properties, are simulated using a Monte-Carlo-based sampling approach. Techniques to reduce computational cost are used to obtain a robust, numerically accurate, and physically representative model for engine relight. The method is validated using experimental data for ignition of methane/air mixtures. Due to the comprehensive nature of the modeling procedure, it is found that the simulation tool reproduces experimentally observed ignition probabilities over a wide range of operating conditions.

42 ENGINEERING↗

Detection of chaotic determinism in time series from randomly forced maps

Time series from biological system often display fluctuations in the measured variables. Much effort has been directed at determining whether this variability reflects deterministic chaos, or whether it is merely "noise". Despite this effort, it has been difficult to establish the presence of chaos in time series from biological sytems. The output from a biological system is probably the result of both its internal dynamics, and the input to the system from the surroundings. This implies that the system should be viewed as a mixed system with both stochastic and deterministic components. We present a method that appears to be useful in deciding whether determinism is present in a time series, and if this determinism has chaotic attributes, i.e., a positive characteristic exponent that leads to sensitivity to initial conditions. The method relies on fitting a nonlinear autoregressive model to the time series followed by an estimation of the characteristic exponents of the model over the observed probability distribution of states for the system. The method is tested by computer simulations, and applied to heart rate variability data.

Non-NASA Center↗

INTEGRATION OF SYSTEM COMPONENTS AND UNCERTAINTY ANALYSIS - HANFORD EXAMPLES

{sm_bullet} Deterministic 'One Off' analyses as basis for evaluating sensitivity and uncertainty relative to reference case {sm_bullet} Spatial coverage identical to reference case {sm_bullet} Two types of analysis assumptions - Minimax parameter values around reference case conditions - 'What If' cases that change reference case condition and associated parameter values {sm_bullet} No conclusions about likelihood of estimated result other than' qualitative expectation that actual outcome should tend toward reference case estimate

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

On the Prediction of Aerosol-Cloud Interactions Within a Data-Driven Framework

Aerosol-cloud interactions (ACI) pose the largest uncertainty for climate projection. Among many challenges of understanding ACI, the question of whether ACI can be deterministically predicted has not been explicitly answered. Here we attempt to answer this question by predicting cloud droplet number concentration N c from aerosol number concentration N a and ambient conditions using a data-driven framework. We use aerosol properties, vertical velocity fluctuations, and meteorological states from the ACTIVATE field observations (2020–2022) as predictors to estimate N c . We show that the campaign-wide N c can be successfully predicted using machine learning models despite the strongly nonlinear and multi-scale nature of ACI. However, the observation-trained machine learning model fails to predict N c in individual cases while it successfully predicts N c of randomly selected data points that cover a broad spatiotemporal scale. This suggests that, within a data-driven framework, the N c prediction is uncertain at fine spatiotemporal scales.

54 ENVIRONMENTAL SCIENCES↗

Design of optimal probing signals for vector parameter estimation.

In the design of optimal inputs or probing signals for parameter estimation, it is more natural to consider functions of the Fisher information matrix as the criterion of optimality instead of some function of the error covariance matrix. The input which maximizes the Fisher information measure for efficient estimation of a scalar parameter also provides the minimum error variance. The information is thus a logical choice for the optimality criterion in scalar problems. No such obvious choice is apparent for vector parameter estimation. A number of performance measures are examined and compared in the present study, and a useful criterion is selected. The design of an optimal probing signal using this criterion is shown to be equivalent to an optimal control problem in which certain equality constraints must be satisfied. This problem may be solved by conventional techniques of deterministic or stochastic optimal control.

Nahi, N. E.↗

A GENERALIZED STOCHASTIC COLLOCATION APPROACH TO CONSTRAINED OPTIMIZATION FOR RANDOM DATA IDENTIFICATION PROBLEMS

We present a scalable, parallel mechanism for stochastic identification/control for problems constrained by partial differential equations with random input data. Several identification objectives will be discussed that either minimize the expectation of a tracking cost functional or minimize the difference of desired statistical quantities in the appropriate $L^p$ norm, and the distributed parameters/control can both deterministic or stochastic. Given an objective we prove the existence of an optimal solution, establish the validity of the Lagrange multiplier rule and obtain a stochastic optimality system of equations. The modeling process may describe the solution in terms of high dimensional spaces, particularly in the case when the input data (coefficients, forcing terms, boundary conditions, geometry, etc) are affected by a large amount of uncertainty. For higher accuracy, the computer simulation must increase the number of random variables (dimensions), and expend more effort approximating the quantity of interest in each individual dimension. Hence, we introduce a novel stochastic parameter identification algorithm that integrates an adjoint-based deterministic algorithm with the sparse grid stochastic collocation FEM approach. This allows for decoupled, moderately high dimensional, parameterized computations of the stochastic optimality system, where at each collocation point, deterministic analysis and techniques can be utilized. The advantage of our approach is that it allows for the optimal identification of statistical moments (mean value, variance, covariance, etc.) or even the whole probability distribution of the input random fields, given the probability distribution of some responses of the system (quantities of physical interest). Our rigorously derived error estimates, for the fully discrete problems, will be described and used to compare the efficiency of the method with several other techniques. Numerical examples illustrate the theoretical results and demonstrate the distinctions between the various stochastic identification objectives.

Webster, Clayton G↗

Real-time adaptive aircraft scheduling

One of the most important functions of any air traffic management system is the assignment of ground-holding times to flights, i.e., the determination of whether and by how much the take-off of a particular aircraft headed for a congested part of the air traffic control (ATC) system should be postponed in order to reduce the likelihood and extent of airborne delays. An analysis is presented for the fundamental case in which flights from many destinations must be scheduled for arrival at a single congested airport; the formulation is also useful in scheduling the landing of airborne flights within the extended terminal area. A set of approaches is described for addressing a deterministic and a probabilistic version of this problem. For the deterministic case, where airport capacities are known and fixed, several models were developed with associated low-order polynomial-time algorithms. For general delay cost functions, these algorithms find an optimal solution. Under a particular natural assumption regarding the delay cost function, an extremely fast (O(n ln n)) algorithm was developed. For the probabilistic case, using an estimated probability distribution of airport capacities, a model was developed with an associated low-order polynomial-time heuristic algorithm with useful properties.

Kolitz, Stephan E.↗

Bell's Inequality and Universal Quantum Gates in a Cold-Atom Chiral Fermionic p-Wave Superfluid

We propose and analyze a probabilistic scheme to entangle two spatially separated topological qubits in a p{sub x}+ip{sub y} superfluid using controlled collisions between atoms in movable dipole traps and unpaired atoms inside vortex cores in the superfluid. We discuss how to test the violation of Bell's inequality with the generated entanglement. A set of universal quantum gates is shown to be implementable deterministically using the entanglement despite the fact that the entangled states can be created only probabilistically.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Polynomial Chaos Surrogate Construction for Random Fields with Parametric Uncertainty

Engineering and applied science rely on computational experiments to rigorously study physical systems. The mathematical models used to probe these systems are highly complex, and sampling-intensive studies often require prohibitively many simulations for acceptable accuracy. Surrogate models provide a means of circumventing the high computational expense of sampling such complex models. In particular, polynomial chaos expansions (PCEs) have been successfully used for uncertainty quantification studies of deterministic models where the dominant source of uncertainty is parametric. We discuss an extension to conventional PCE surrogate modeling to enable surrogate construction for stochastic computational models that have intrinsic noise in addition to parametric uncertainty. We develop a PCE surrogate on a joint space of intrinsic and parametric uncertainty, enabled by Rosenblatt transformations, which are evaluated via kernel density estimation of the associated conditional cumulative distributions. Furthermore, we extend the construction to random field data via the Karhunen–Loève expansion. We then take advantage of closed-form solutions for computing PCE Sobol indices to perform a global sensitivity analysis of the model which quantifies the intrinsic noise contribution to the overall model output variance. Additionally, the resulting joint PCE is generative in the sense that it allows generating random realizations at any input parameter setting that are statistically approximately equivalent to realizations from the underlying stochastic model. The method is demonstrated on a chemical catalysis example model and a synthetic example controlled by a parameter that enables a switch from unimodal to bimodal response distributions.

97 MATHEMATICS AND COMPUTING↗