Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Monte Carlo Methods”

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 901 records · Page 50
All sourcesNASA NTRSDOE OSTI
DOE OSTI2018

Gas-kinetic simulation of sustained turbulence in minimal Couette flow

Here, we provide a demonstration that gas-kinetic methods incorporating molecular chaos can simulate the sustained turbulence that occurs in wall-bounded turbulent shear flows. The direct simulation Monte Carlo method, a gas-kinetic molecular method that enforces molecular chaos for gas-molecule collisions, is used to simulate the minimal Couette flow at Re = 500 . The resulting law of the wall, the average wall shear stress, the average kinetic energy, and the continually regenerating coherent structures all agree closely with corresponding results from direct numerical simulation of the Navier-Stokes equations. Finally, these results indicate that molecular chaos for collisions in gas-kinetic methods does not prevent development of molecular-scale long-range correlations required to form hydrodynamic-scale turbulent coherent structures.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2019

Data-Consistent Solutions to Stochastic Inverse Problems Using a Probabilistic Multi-Fidelity Method Based on Conditional Densities

In this work, we build upon a recently developed approach for solving stochastic inverse problems based on a combination of measure-theoretic principles and Bayes' rule. We propose a multi-fidelity method to reduce the computational burden of performing uncertainty quantification using high-fidelity models. This approach is based on a Monte Carlo framework for uncertainty quantification that combines information from solvers of various fidelities to obtain statistics on the quantities of interest of the problem. In particular, our goal is to generate samples from a high-fidelity push-forward density at a fraction of the costs of standard Monte Carlo methods, while maintaining flexibility in the number of random model input parameters. Key to this methodology is the construction of a regression model to represent the stochastic mapping between the low- and high-fidelity models, such that most of the computations can be leveraged to the low-fidelity model. To that end, we employ Gaussian process regression and present extensions to multi-level-type hierarchies as well as to the case of multiple quantities of interest. Finally, we demonstrate the feasibility of the framework in several numerical examples.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1995

Advanced Multi-phase Flow CFD Model Development for Solid Rocket Motor Flowfield Analysis

A Navier-Stokes code, finite difference Navier-Stokes (FDNS), is used to analyze the complicated internal flowfield of the SRM (solid rocket motor) to explore the impacts due to the effects of chemical reaction, particle dynamics, and slag accumulation on the solid rocket motor (SRM). The particulate multi-phase flowfield with chemical reaction, particle evaporation, combustion, breakup, and agglomeration models are included in present study to obtain a better understanding of the SRM design. Finite rate chemistry model is applied to simulate the chemical reaction effects. Hermsen correlation model is used for the combustion simulation. The evaporation model introduced by Spalding is utilized to include the heat transfer from the particulate phase to the gase phase due to the evaporation of the particles. A correlation of the minimum particle size for breakup expressed in terms of the Al/Al2O3 surface tension and shear force was employed to simulate the breakup of particles. It is assumed that the breakup occurs when the Weber number exceeds 6. A simple L agglomeration model is used to investigate the particle agglomeration. However, due to the large computer memory requirements for the agglomeration model, only 2D cases are tested with the agglomeration model. The VOF (Volume of Fluid) method is employed to simulate the slag buildup in the aft-end cavity of the redesigned solid rocket motor (RSRM). Monte Carlo method is employed to calculate the turbulent dispersion effect of the particles. The flowfield analysis obtained using the FDNS code in the present research with finite rate chemical reaction, particle evaporation, combustion, breakup, agglomeration, and VOG models will provide a design guide for the potential improvement of the SRM including the use of materials and the shape of nozzle geometry such that a better performance of the SRM can be achieved. The simulation of the slag buildup in the aft-end cavity can assist the designer to improve the design of the RSRM geometry.

Liaw, Paul↗
DOE OSTI2020

Collective mode Brownian dynamics: A method for fast relaxation of statistical ensembles

Sampling equilibrium configurations of correlated systems of particles with long relaxation times (e.g., polymeric solutions) using conventional molecular dynamics and Monte Carlo methods can be challenging. This is especially true for systems with complicated, extended bond network topologies and other interactions that make the use and design of specialized relaxation protocols infeasible. We introduce a method based on Brownian dynamics simulations that can reduce the computational time it takes to reach equilibrium and draw decorrelated samples. Importantly, the method is completely agnostic to the particle configuration and the specifics of interparticle forces. In particular, we develop a mobility matrix that excites non-local, collective motion of N particles and can be computed efficiently in $\mathcal{O}(N)$ time. Particle motion in this scheme is computed by integrating the overdamped Langevin equation with an Euler–Maruyama scheme, in which Brownian displacements are drawn efficiently using a low-rank representation of the mobility matrix in position and wave space. We demonstrate the efficacy of the method with various examples from the realm of soft condensed matter and release a massively parallel implementation of the code as a plugin for the open-source package HOOMD-blue [J. A. Anderson et al., J. Comput. Phys. 227, 5342 (2008) and J. Glaser et al., Comput. Phys. Commun. 192, 97 (2015)] which runs on graphics processing units

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2022

Accelerating astronomical and cosmological inference with preconditioned Monte Carlo

ABSTRACT We introduce preconditioned Monte Carlo (PMC), a novel Monte Carlo method for Bayesian inference that facilitates efficient sampling of probability distributions with non-trivial geometry. PMC utilizes a Normalizing Flow (NF) in order to decorrelate the parameters of the distribution and then proceeds by sampling from the preconditioned target distribution using an adaptive Sequential Monte Carlo (SMC) scheme. The results produced by PMC include samples from the posterior distribution and an estimate of the model evidence that can be used for parameter inference and model comparison, respectively. The aforementioned framework has been thoroughly tested in a variety of challenging target distributions achieving state-of-the-art sampling performance. In the cases of primordial feature analysis and gravitational wave inference, PMC is approximately 50 and 25 times faster, respectively, than nested sampling (NS). We found that in higher dimensional applications, the acceleration is even greater. Finally, PMC is directly parallelisable, manifesting linear scaling up to thousands of CPUs.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2023

Similarity Downselection: Finding the n Most Dissimilar Molecular Conformers for Reference-Free Metabolomics

Computational methods for creating in silico libraries of molecular descriptors (e.g., collision cross sections) are becoming increasingly prevalent due to the limited number of authentic reference materials available for traditional library building. These so-called “reference-free metabolomics” methods require sampling sets of molecular conformers in order to produce high accuracy property predictions. Due to the computational cost of the subsequent calculations for each conformer, there is a need to sample the most relevant subset and avoid repeating calculations on conformers that are nearly identical. The goal of this study is to introduce a heuristic method of finding the most dissimilar conformers from a larger population in order to help speed up reference-free calculation methods and maintain a high property prediction accuracy. Finding the set of the n items most dissimilar from each other out of a larger population becomes increasingly difficult and computationally expensive as either n or the population size grows large. Because there exists a pairwise relationship between each item and all other items in the population, finding the set of the n most dissimilar items is different than simply sorting an array of numbers. For instance, if you have a set of the most dissimilar n = 4 items, one or more of the items from n = 4 might not be in the set n = 5. An exact solution would have to search all possible combinations of size n in the population exhaustively. We present an open-source software called similarity downselection (SDS), written in Python and freely available on GitHub. SDS implements a heuristic algorithm for quickly finding the approximate set(s) of the n most dissimilar items. We benchmark SDS against a Monte Carlo method, which attempts to find the exact solution through repeated random sampling. We show that for SDS to find the set of n most dissimilar conformers, our method is not only orders of magnitude faster, but it is also more accurate than running Monte Carlo for 1,000,000 iterations, each searching for set sizes n = 3–7 out of a population of 50,000. We also benchmark SDS against the exact solution for example small populations, showing that SDS produces a solution close to the exact solution in these instances. Using theoretical approaches, we also demonstrate the constraints of the greedy algorithm and its efficacy as a ratio to the exact solution.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

Development of an interatomic potential for the simulation of defects, plasticity, and phase transformations in titanium

New interatomic potentials describing defects, plasticity, and high temperature phase transitions for Ti are presented. Fitting the martensitic hcp-bcc phase transformation temperature requires an efficient and accurate method to determine it. We apply a molecular dynamics method based on determination of the melting temperature of competing solid phases, and Gibbs-Helmholtz integration, and a lattice-switch Monte Carlo method: these agree on the hcp-bcc transformation temperatures to within 2 K. We were able to develop embedded atom potentials which give a good fit to either low or high temperature data, but not both. The first developed potential (Ti1) reproduces the hcp-bcc transformation and melting temperatures and is suitable for the simulation of phase transitions and bcc Ti. Two other potentials (Ti2 and Ti3) correctly describe defect properties and can be used to simulate plasticity or radiation damage in hcp Ti. The fact that a single embedded atom method potential cannot describe both low and high temperature phases may be attributed to neglect of electronic degrees of freedom, notably bcc has a much higher electronic entropy. As a result, a temperature-dependent potential obtained from the combination of potentials Ti1 and Ti2 may be used to simulate Ti properties at any temperature.

36 MATERIALS SCIENCE↗
NASA NTRS2017

Planetary Crater Detection and Registration Using Marked Point Processes, Multiple Birth and Death Algorithms, and Region-Based Analysis

Because of the large variety of sensors and spacecraft collecting data, planetary science needs to integrate various multi-sensor and multi-temporal images. These multiple data represent a precious asset, as they allow the study of targets spectral responses and of changes in the surface structure; because of their variety, they also require accurate and robust registration. A new crater detection algorithm, used to extract features that will be integrated in an image registration framework, is presented. A marked point process-based method has been developed to model the spatial distribution of elliptical objects (i.e. the craters) and a birth-death Markov chain Monte Carlo method, coupled with a region-based scheme aiming at computational efficiency, is used to find the optimal configuration fitting the image. The extracted features are exploited, together with a newly defined fitness function based on a modified Hausdorff distance, by an image registration algorithm whose architecture has been designed to minimize the computational time.

Image Processing; Pattern Recognition↗
NASA NTRS2018

Planetary Crater Detection and Registration Using Marked Point Processes, Multiple Birth and Death Algorithms, and Region-Based Analysis

Because of the large variety of sensors and spacecraft collecting data, planetary science needs to integrate various multi-sensor and multi-temporal images. These multiple data represent a precious asset, as they allow the study of targets spectral responses and of changes in the surface structure; because of their variety, they also require accurate and robust registration. A new crater detection algorithm, used to extract features that will be integrated in an image registration framework, is presented. A marked point process-based method has been developed to model the spatial distribution of elliptical objects (i.e. the craters) and a birth-death Markov chain Monte Carlo method, coupled with a region-based scheme aiming at computational efficiency, is used to find the optimal configuration fitting the image. The extracted features are exploited, together with a newly defined fitness function based on a modified Hausdorff distance, by an image registration algorithm whose architecture has been designed to minimize the computational time.

Image Processing:Pattern Recognition↗
NASA NTRS2020

A Digital Twin Feasibility Study (Part II):Non-Deterministic Predictions of Fatigue Life Using In-Situ Diagnostics and Prognostics

The Digital Twin (DT) concept has the potential to revolutionize the way systems and their components are designed, managed, maintained, and operated across a vast number of fields from engineering to healthcare. The focus of this work is the implementation of DT for the health management of fatigue critical structures. This paper is the second part of a two-part series. The first of the series demonstrated the use of multi-scale, initiation-to-failure crack growth modeling to form non-deterministic predictions of fatigue life. In this second part, a general method for reducing uncertainty in fatigue life predictions is presented that couples in-situ diagnostics and prognostics in a probabilistic framework. Monte Carlo methods and high-fidelity finite element models are used to (i) generate probabilistic estimates of crack state throughout the life of the same geometrically complex test specimen and (ii) predict fatigue life with decreasing uncertainty as more of these diagnoses are obtained. The ability to predict accurately and in the presence of uncertainty is demonstrated, suggesting that the proposed DT method is feasible for fatigue life prognosis and should be pursued further with a focus on increasing application realism.

Patrick E Leser↗
NASA NTRS1988

Hypersonic shock structure with Burnett terms in the viscous stress and heat flux

The continuum Navier-Stokes and Burnett equations are solved for one-dimensional shock structure in various monatomic gases. A new numerical method is employed which utilizes the complete time-dependent continuum equations and obtains the steady-state shock structure by allowing the system to relax from arbitrary initial conditions. Included is discussion of numerical difficulties encountered when solving the Burnett equations. Continuum solutions are compared to those obtained utilizing the Direct Simulation Monte Carlo method. Shock solutions are obtained for a hard sphere gas and for argon from Mach 1.3 to Mach 50. Solutions for a Maxwellian gas are obtained from Mach 1.3 to Mach 3.8. It is shown that the Burnett equations yield shock structure solutions in much closer agreement to both Monte Carlo and experimental results than do the Navier-Stokes equations. Shock density thickness, density asymmetry, and density-temperature separation are all more accurately predicted by the Burnett equations than by the Navier-Stokes equations.

Chapman, Dean R.↗
DOE OSTI2014

MCNP6 Class

This report provides a Monte Carlo method for simulating radiation transport and provides a common sense approach for MCNP.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
NASA NTRS2022

Numerical phase space optics methods and applications to the analysis of fiber coupling efficiency in atmospheric turbulence

A fundamental requirement of free-space optical communication is the ability to efficiently couple atmospherically distorted light from a telescope to a detector. A numerical method is presented for modeling fiber-based receiver performance in atmospheric conditions based on phase space optics which does not rely on Monte Carlo methods. This method is employed to analyze the waveguide insertion loss and optimal coupling geometry in atmospheric conditions for step-index fibers, graded-index fibers, and photonic lanterns with and without tilt compensation and central obscurations in the telescope.

free-space optical communication↗
NASA NTRSDate not supplied

Numerical phase space optics methods and applications to the analysis of fiber coupling efficiency in atmospheric turbulence

A fundamental requirement of free-space optical communication is the ability to efficiently couple atmospherically distorted light from a telescope to a detector. A numerical method is presented for modeling fiber-based receiver performance in atmospheric conditions based on phase space optics which does not rely on Monte Carlo methods. This method is employed to analyze the waveguide insertion loss and optimal coupling geometry in atmospheric conditions for step-index fibers, graded-index fibers, and photonic lanterns with and without tilt compensation and central obscurations in the telescope.

free-space optical communication↗
DOE OSTI2023

Parallel simulation via SPPARKS of on-lattice kinetic and Metropolis Monte Carlo models for materials processing

Abstract SPPARKS is an open-source parallel simulation code for developing and running various kinds of on-lattice Monte Carlo models at the atomic or meso scales. It can be used to study the properties of solid-state materials as well as model their dynamic evolution during processing. The modular nature of the code allows new models and diagnostic computations to be added without modification to its core functionality, including its parallel algorithms. A variety of models for microstructural evolution (grain growth), solid-state diffusion, thin film deposition, and additive manufacturing (AM) processes are included in the code. SPPARKS can also be used to implement grid-based algorithms such as phase field or cellular automata models, to run either in tandem with a Monte Carlo method or independently. For very large systems such as AM applications, the Stitch I/O library is included, which enables only a small portion of a huge system to be resident in memory. In this paper we describe SPPARKS and its parallel algorithms and performance, explain how new Monte Carlo models can be added, and highlight a variety of applications which have been developed within the code.

36 MATERIALS SCIENCE↗
DOE OSTI2014

SU-E-T-78: Comparison of Dose-Averaged Linear Energy Transfer Calculation Methods Used in Monte Carlo Simulations of Clinical Proton Beams

Purpose: To evaluate the differences in dose-averaged linear energy transfer (LETd) maps calculated in water by means of different strategies found in the literature in proton therapy Monte Carlo simulations and to compare their values with dose-mean lineal energy microdosimetry calculations. Methods: The Geant4 toolkit (version 9.6.2) was used. Dose and LETd maps in water were scored for primary protons with cylindrical voxels defined around the beam axis. Three LETd calculation methods were implemented. First, the LETd values were computed by calculating the unrestricted linear energy transfer (LET) associated to each single step weighted by the energy deposition (including delta-rays) along the step. Second, the LETd was obtained for each voxel by computing the LET along all the steps simulated for each proton track within the voxel, weighted by the energy deposition of those steps. Third, the LETd was scored as the quotient between the second momentum of the LET distribution, calculated per proton track, over the first momentum. These calculations were made with various voxel thicknesses (0.2 – 2.0 mm) for a 160 MeV proton beamlet and spread-out Bragg Peaks (SOBP). The dose-mean lineal energy was calculated in a uniformly-irradiated water sphere, 0.005 mm radius. Results: The value of the LETd changed systematically with the voxel thickness due to delta-ray emission and the enlargement of the LET distribution spread, especially at shallow depths. Differences of up to a factor 1.8 were found at the depth of maximum dose, leading to similar differences at the central and distal depths of the SOBPs. The third LETd calculation method gave better agreement with microdosimetry calculations around the Bragg Peak. Conclusion: Significant differences were found between LETd map Monte Carlo calculations due to both the calculation strategy and the voxel thickness used. This could have a significant impact in radiobiologically-optimized proton therapy treatments.

07 ISOTOPE AND RADIATION SOURCES↗
NASA NTRS2009

Physical Principle for Generation of Randomness

A physical principle (more precisely, a principle that incorporates mathematical models used in physics) has been conceived as the basis of a method of generating randomness in Monte Carlo simulations. The principle eliminates the need for conventional random-number generators. The Monte Carlo simulation method is among the most powerful computational methods for solving high-dimensional problems in physics, chemistry, economics, and information processing. The Monte Carlo simulation method is especially effective for solving problems in which computational complexity increases exponentially with dimensionality. The main advantage of the Monte Carlo simulation method over other methods is that the demand on computational resources becomes independent of dimensionality. As augmented by the present principle, the Monte Carlo simulation method becomes an even more powerful computational method that is especially useful for solving problems associated with dynamics of fluids, planning, scheduling, and combinatorial optimization. The present principle is based on coupling of dynamical equations with the corresponding Liouville equation. The randomness is generated by non-Lipschitz instability of dynamics triggered and controlled by feedback from the Liouville equation. (In non-Lipschitz dynamics, the derivatives of solutions of the dynamical equations are not required to be bounded.)

Zak, Michail↗
DOE OSTI2020

Method of Green’s Potentials for Elliptic PDEs in Domains with Random Apertures

Problems with topological uncertainties appear in many fields ranging from nano-device engineering to the design of bridges. In many of such problems, a part of the domains boundaries is subjected to random perturbations making inefficient conventional schemes that rely on discretization of the whole domain. Here, we study elliptic PDEs in domains with boundaries comprised of a deterministic part and random apertures, and apply the method of modified potentials with Green’s kernels defined on the deterministic part of the domain. This approach allows to reduce the dimension of the original differential problem by reformulating it as a boundary integral equation posed on the random apertures only. The multilevel Monte Carlo method is then applied to this modified integral equation and its optimal ϵ -2 asymptotical complexity is shown. Finally, we provide the qualitative analysis of the proposed technique and support it with numerical results.

97 MATHEMATICS AND COMPUTING↗