Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “deterministic method”

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 55 records · Page 3

Optimizing the Smoothness and Thickness Uniformity of Thin-Film Parylene-N Vapor-Deposited Coatings for Inertial Confinement Fusion Experiments

Polymer coatings with submicrometer smoothness and constant thickness are a required component in a variety of inertial confinement fusion experiments. Smoothness is important for minimizing Rayleigh-Taylor-driven hydrodynamic instabilities, and uniform thickness is important for uniform shock propagation and shell convergence, both of which are critical phenomena that affect the experiment. The preferred polymer coating method is to vapor deposit the parylene-N polymer because it provides nominally smooth conformal coatings. As the coating thickness exceeds 5 µm, however, dome-shaped nodular growth defects develop and the thickness will vary by up to 17% over a distance of 3 cm. This study presents a deterministic method for achieving uniform film thicknesses with ±2% variability over 3 cm and a predictive method to control the thickness to within 5% of the desired value. A coating smoothness of ∼50 nm rms, measured over 40 000 µm 2 , was achieved by adding additional surfaces near the substrates. This additional area improved the thickness uniformity, an effect that is attributed to the low sticking coefficient of the parylene monomer.

chemical vapor deposition (CVD)↗

Alternate Methods in Refining the SLS Nozzle Plug Loads

Numerical analysis has shown that the SLS nozzle environmental barrier (nozzle plug) design is inadequate for the prelaunch condition, which consists of two dominant loads: 1) the main engines startup pressure and 2) an environmentally induced pressure. Efforts to reduce load conservatisms included a dynamic analysis which showed a 31% higher safety factor compared to the standard static analysis. The environmental load is typically approached with a deterministic method using the worst possible combinations of pressures and temperatures. An alternate probabilistic approach, utilizing the distributions of pressures and temperatures, resulted in a 54% reduction in the environmental pressure load. A Monte Carlo simulation of environmental load that used five years of historical pressure and temperature data supported the results of the probabilistic analysis, indicating the probabilistic load is reflective of a 3-sigma condition (1 in 370 probability). Utilizing the probabilistic load analysis eliminated excessive conservatisms and will prevent a future overdesign of the nozzle plug. Employing a similar probabilistic approach to other design and analysis activities can result in realistic yet adequately conservative solutions.

Burbank, Scott↗

Navier-Stokes Dynamics by a Discrete Boltzmann Model

This work investigates the possibility of particle-based algorithms for the Navier-Stokes equations and higher order continuum approximations of the Boltzmann equation; such algorithms would generalize the well-known Pullin scheme for the Euler equations. One such method is proposed in the context of a discrete velocity model of the Boltzmann equation. Preliminary results on shock structure are consistent with the expectation that the shock should be much broader than the near discontinuity predicted by the Pullin scheme, yet narrower than the prediction of the Boltzmann equation. We discuss the extension of this essentially deterministic method to a stochastic particle method that, like DSMC, samples the distribution function rather than resolving it completely.

Rubinstein, Robet↗

Dynamic Routing of Aircraft in the Presence of Adverse Weather Using a POMDP Framework

Each year weather-related airline delays result in hundreds of millions of dollars in additional fuel burn, maintenance, and lost revenue, not to mention passenger inconvenience. The current approaches for aircraft route planning in the presence of adverse weather still mainly rely on deterministic methods. In contrast, this work aims to deal with the problem using a Partially Observable Markov Decision Processes (POMDPs) framework, which allows for reasoning over uncertainty (including uncertainty in weather evolution over time) and results in solutions that are more robust to disruptions. The POMDP-based decision support system is demonstrated on several scenarios involving convective weather cells and is benchmarked against a deterministic planning system with functionality similar to those currently in use or under development.

Decision making↗

The application of structural reliability techniques to plume impingement loading of the Space Station Freedom Photovoltaic Array

A new aerospace application of structural reliability techniques is presented, where the applied forces depend on many probabilistic variables. This application is the plume impingement loading of the Space Station Freedom Photovoltaic Arrays. When the space shuttle berths with Space Station Freedom it must brake and maneuver towards the berthing point using its primary jets. The jet exhaust, or plume, may cause high loads on the photovoltaic arrays. The many parameters governing this problem are highly uncertain and random. An approach, using techniques from structural reliability, as opposed to the accepted deterministic methods, is presented which assesses the probability of failure of the array mast due to plume impingement loading. A Monte Carlo simulation of the berthing approach is used to determine the probability distribution of the loading. A probability distribution is also determined for the strength of the array. Structural reliability techniques are then used to assess the array mast design. These techniques are found to be superior to the standard deterministic dynamic transient analysis, for this class of problem. The results show that the probability of failure of the current array mast design, during its 15 year life, is minute.

Yunis, Isam S.↗

The Application of Structural Reliability Techniques to Plume Impingement Loading of the Space Station Freedom Photovoltaic Array

A new aerospace application of structural reliability techniques is presented, where the applied forces depend on many probabilistic variables. This application is the plume impingement loading of the Space Station Freedom Photovoltaic Arrays. When the space shuttle berths with Space Station Freedom it must brake and maneuver towards the berthing point using its primary jets. The jet exhaust, or plume, may cause high loads on the photovoltaic arrays. The many parameters governing this problem are highly uncertain and random. An approach, using techniques from structural reliability, as opposed to the accepted deterministic methods, is presented which assesses the probability of failure of the array mast due to plume impingement loading. A Monte Carlo simulation of the berthing approach is used to determine the probability distribution of the loading. A probability distribution is also determined for the strength of the array. Structural reliability techniques are then used to assess the array mast design. These techniques are found to be superior to the standard deterministic dynamic transient analysis, for this class of problem. The results show that the probability of failure of the current array mast design, during its 15 year life, is minute.

Yunis, Isam S.↗

Exhaustive Versus Randomized Searchers for Nonlinear Optimization in 21st Century Computing: Solar Application

We present a simple multi-dimensional exhaustive search method to obtain, in a reasonable time, the optimal solution of a nonlinear programming problem. It is more relevant in the present day non-mainframe computing scenario where an estimated 95% computing resources remains unutilized and computing speed touches petaflops. While the processor speed is doubling every 18 months, the band width is doubling every 12 months, and the hard disk space is doubling every 9 months. A randomized search algorithm or, equivalently, an evolutionary search method is often used instead of an exhaustive search algorithm. The reason is that a randomized approach is usually polynomial-time, i.e., fast while an exhaustive search method is exponential-time i.e., slow. We discuss the increasing importance of exhaustive search in optimization with the steady increase of computing power for solving many real-world problems of reasonable size. We also discuss the computational error and complexity of the search algorithm focusing on the fact that no measuring device can usually measure a quantity with an accuracy greater than 0.005%. We stress the fact that the quality of solution of the exhaustive search - a deterministic method - is better than that of randomized search. In 21 st century computing environment, exhaustive search cannot be left aside as an untouchable and it is not always exponential. We also describe a possible application of these algorithms in improving the efficiency of solar cells - a real hot topic - in the current energy crisis. These algorithms could be excellent tools in the hands of experimentalists and could save not only large amount of time needed for experiments but also could validate the theory against experimental results fast.

Sen, Syamal K.↗

Probabilistic Path Planning of Montgolfier Balloons in Strong, Uncertain Wind Fields

Lighter-than-air vehicles such as hot-air balloons have been proposed for exploring Saturn s moon Titan, as well as other bodies with significant atmospheres. For these vehicles to navigate effectively, it is critical to incorporate the effects of surrounding wind fields, especially as these winds will likely be strong relative to the control authority of the vehicle. Predictive models of these wind fields are available, and previous research has considered problems of planning paths subject to these predicted forces. However, such previous work has considered the wind fields as known a priori, whereas in practical applications, the actual wind vector field is not known exactly and may deviate significantly from the wind velocities estimated by the model. A probabilistic 3D path-planning algorithm was developed for balloons to use uncertain wind models to generate time-efficient paths. The nominal goal of the algorithm is to determine what altitude and what horizontal actuation, if any is available on the vehicle, to use to reach a particular goal location in the least expected time, utilizing advantageous winds. The solution also enables one to quickly evaluate the expected time-to-goal from any other location and to avoid regions of large uncertainty. This method is designed for balloons in wind fields but may be generalized for any buoyant vehicle operating in a vector field. To prepare the planning problem, the uncertainty in the wind field is modeled. Then, the problem of reaching a particular goal location is formulated as a Markov decision process (MDP) using a discretized space approach. Solving the MDP provides a policy of what actuation option (how much buoyancy change and, if applicable, horizontal actuation) should be selected at any given location to minimize the expected time-to-goal. The results provide expected time-to-goal values from any given location on the globe in addition to the action policy. This stochastic approach can also provide insights not accessible by deterministic methods; for example, one can evaluate variability and risk associated with different scenarios, rather than only viewing the expected outcome.

Wolf, Michael↗

Multigroup Constant Calculation with Static α-Eigenvalue Monte Carlo for Time-Dependent Neutron Transport Simulations

Herein, multigroup constants for deterministic methods that preserve the time-dependent physics of the neutron transport equations are derived. Alternative multigroup constant weighting spectra are discussed: (1) the fundamental k-eigenfunction, (2) the fundamental α-eigenfunction, and (3) a composite of several α-modes. To generate the fundamental α-eigenfunction for calculating the multigroup constants, a static fundamental α-eigenvalue method is implemented into the open source Monte Carlo code OpenMC. Several static and kinetic problems are devised to verify the implementations and to investigate the relative performance of the alternative multigroup constant weighting spectra. Results emphasize that as a multigroup constant weighting spectrum, the fundamental α-eigenfunction offers physical characteristics that make it advantageous (in producing accurate solutions) over the typically used fundamental k-eigenfunction.

42 ENGINEERING↗

Simultaneous inversion of shear modulus and traction boundary conditions in biomechanical imaging

We present a formulation to simultaneously invert for a heterogeneous shear modulus field and traction boundary conditions in an incompressible linear elastic plane stress model. Our approach utilizes scalable deterministic methods, including adjoint-based sensitivities and quasi-Newton optimization, to reduce the computational requirements for large-scale inversion with partial differential equation (PDE) constraints. Here, we address the use of regularization for such formulations and explore the use of different types of regularization for the shear modulus and boundary traction. We apply this PDE-constrained optimization algorithm to a synthetic dataset to verify the accuracy in the reconstructed parameters, and to experimental data from a tissue-mimicking ultrasound phantom. In all of these examples, we compare inversion results from full-field and sparse data measurements.

42 ENGINEERING↗

Deterministic Quantum Trajectory via Imaginary Time Evolution

Stochastic quantum trajectories, such as pure state evolutions under unitary dynamics and random measurements, offer a crucial ensemble description of many-body open system dynamics. Recent studies have highlighted that individual quantum trajectories also encode essential physical information. Prominent examples include measurement-induced phase transitions, where a pure quantum state corresponding to fixed measurement outcomes (trajectories) exhibits distinct entanglement phases, depending on the measurement rate. However, direct observation of this effect is hindered by an exponential postselection barrier, whereby the probability of realizing a specific trajectory is exponentially small. We propose a deterministic method to efficiently prepare quantum trajectories in polynomial time using imaginary time evolution and, thus, overcome this fundamental challenge. Here, we demonstrate that our method applies to a certain class of quantum states, and argue that universal approaches do not exist for any quantum trajectories. Our result paves the way for experimentally exploring the physics of individual quantum trajectories at scale and enables direct observation of certain postselection-dependent phenomena.

Mittal, Shivan [Los Alamos National Laboratory (LA↗

Improvements to the macroscopic-microscopic approach of nuclear fission

The well-established macroscopic-microscopic (mac-mic) description of nuclear fission enables the prediction of fission-fragment yields for a broad range of fissioning systems. In this work, we present several key enhancements to this approach. We improve upon the microscopic sector of nuclear potential-energy surfaces by magnifying the resolution of the Lipkin-Nogami equations and strengthening the Strutinsky procedure, thus reducing spurious effects from the continuum. We further present a novel deterministic method for calculating fission dynamics under the assumption of strongly damped nucleonic motion. Our technique directly determines the evolution of the scissioned shape distribution according to the number of random-walk steps rather than the statistical accumulation of fission events. We show that our new technique is equivalent to the Metropolis random walk pioneered over the past decade by Randrup and colleagues. It further improves upon it because we remove the need for altering the nuclear landscape via a biased potential. With our final improvement, we calculate fission fragments mass and charge distributions using particle number projection, which affords the simultaneous calculation of both mass- and charge-yield distributions. Fission fragments are thus calculated from the quantum-mechanical A -body states of the potential-energy surface rather than from the collective mass asymmetry variable α g of the finite-range liquid-drop model used in past work. We highlight the success of our enhancements by predicting the odd-even staggering and the charge polarization for the neutron-induced fission of 233 U and 235 U .

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Variance Reduction within Implicit Monte Carlo Thermal Radiation Transport using the Local Importance Function Transform [Slides]

System of equations derived by Fleck and Cummings to model time-dependent thermal radiative transfer (TRT) problems: Solution of radiation specific intensity (I), non-linearly coupled to material internal energy (U); Absorption and re-emission approximated by effective scattering events. Useful for high-energy density physics simulations: i.e., astrophysics, inertial confinement fusion (ICF). Whereas deterministic methods are fully discretized and free of statistical noise, Monte Carlo methods allow for dynamic sampling of the phase space at the price of statistical noise; Monte Carlo methods are also characterized by a slow $\frac{1}{√Ν}$ convergence rate.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Parameter identification using a creeping-random-search algorithm

A creeping-random-search algorithm is applied to different types of problems in the field of parameter identification. The studies are intended to demonstrate that a random-search algorithm can be applied successfully to these various problems, which often cannot be handled by conventional deterministic methods, and, also, to introduce methods that speed convergence to an extremal of the problem under investigation. Six two-parameter identification problems with analytic solutions are solved, and two application problems are discussed in some detail. Results of the study show that a modified version of the basic creeping-random-search algorithm chosen does speed convergence in comparison with the unmodified version. The results also show that the algorithm can successfully solve problems that contain limits on state or control variables, inequality constraints (both independent and dependent, and linear and nonlinear), or stochastic models.

Parrish, R. V.↗

On stochastic control and optimal measurement strategies

The control of stochastic dynamic systems is studied with particular emphasis on those which influence the quality or nature of the measurements which are made to effect control. Four main areas are discussed: (1) the meaning of stochastic optimality and the means by which dynamic programming may be applied to solve a combined control/measurement problem; (2) a technique by which it is possible to apply deterministic methods, specifically the minimum principle, to the study of stochastic problems; (3) the methods described are applied to linear systems with Gaussian disturbances to study the structure of the resulting control system; and (4) several applications are considered.

Kramer, L. C.↗

A new technique for predicting geosynchronous satellite collision probability

A new technique has been developed to predict the probability of an expired geosynchronous satellite colliding with an active satellite. This new technique employs deterministic methods for modeling the motion of satellites and applies statistical techniques to estimate the collision probability. The collision probability is used to estimate the expected time between collisions based on realistic distributions of expired and active satellites. The primary advantage of this new technique is that realistic distributions can be used in the prediction process instead of uniform distributions as has been used in previous techniques. The expected time between collisions based on a current NORAD database is estimated to be in the hundreds of years.

Mccormick, B.↗

Construction of dynamic stochastic simulation models using knowledge-based techniques

Over the past three decades, computer-based simulation models have proven themselves to be cost-effective alternatives to the more structured deterministic methods of systems analysis. During this time, many techniques, tools and languages for constructing computer-based simulation models have been developed. More recently, advances in knowledge-based system technology have led many researchers to note the similarities between knowledge-based programming and simulation technologies and to investigate the potential application of knowledge-based programming techniques to simulation modeling. The integration of conventional simulation techniques with knowledge-based programming techniques is discussed to provide a development environment for constructing knowledge-based simulation models. A comparison of the techniques used in the construction of dynamic stochastic simulation models and those used in the construction of knowledge-based systems provides the requirements for the environment. This leads to the design and implementation of a knowledge-based simulation development environment. These techniques were used in the construction of several knowledge-based simulation models including the Advanced Launch System Model (ALSYM).

Williams, M. Douglas↗

Determining design gust loads for nonlinear aircraft similarity between methods based on matched filter theory and on stochastic simulation

This is a work-in-progress paper. It explores the similarity between the results from two different analysis methods - one deterministic, the other stochastic - for computing maximized and time-correlated gust loads for nonlinear aircraft. To date, numerical studies have been performed using two different nonlinear aircraft configurations. These studies demonstrate that results from the deterministic analysis method are realizable in the stochastic analysis method.

Scott, Robert C.↗