Search NASA⌕ Search

SEARCH · Search NASA

Results for “Physics - Plasma physics , Mathematics and Computing”

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 757 records · Page 42

Modeling multiple scattering transient of an ultrashort laser pulse by spherical particles

The multiple scattering of an ultrashort laser pulse by a turbid dispersive medium (namely a cloud of bubbles in water) is investigated by means of Monte Carlo simulations. The theory of Gouesbet and Gréhan (2000) is used to derive an energetic model of the scattering transient. It is shown that the spreading and extinction of the pulse can be decoupled from the transient of scattering, which allows to describe each phenomenon individually. The transient of scattering is modeled with the Lorenz-Mie Theory and thus is also valid for a relative refractive index lower than one, contrary to the Debye series expansion which does not converge close to the critical angle. This is made possible after the introduction of a new physical object, the Scattering Impulse Response Function (SIRF) which allows to detect the different modes of scattering transient, in time and direction. Here the present approach is more generic, as it enables to simulate clouds of air bubbles in water, which was not possible previously. Two different approaches are proposed within the Monte Carlo framework. The first is a pure Monte Carlo approach where the delay due to the scattering is randomly drawn at each event, while the second is based on the transport of the whole scattering signal. They are both embedded in the Monte Carlo code Scatter3D. Both models produce equivalent trends and are validated against published numerical results. They are then applied to the multiple scattering of ultra short pulse by a cloud of bubble in water in the forward direction. The pulse spread due to the propagation in water is computed for a wide range of traveled distances and pulse durations, and the optimal pulse duration is given to minimize the pulse spread at a given distance. The main result is that the scattered photons exit the turbid medium earlier than the ballistic photons and produce a double peak related to the refraction in the bubble. This demonstrates the possibility to develop new diagnostics to characterize dynamic bubbly flows.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

MCNPs Easy Sources for (α,n) (MESA):Verification with Sources4c

MESA is intended to be a direct re-implementation of the algorithms documented in the Sources manual in C++. However, some fundamental changes to the computational structure and logic were made to avoid the use of goto, require consistency in input definition, and reduce computational approximations in later steps of three-layer problems. In addition, MESA uses α-decay information from ISC libraries (based on ENDF). In most cases, differences between Sources4c and MESA are dominated by differences in decay energy spectra and intensities. To verify this we have reproduced 6 problems that are documented examples or samples in Sources4c. These problems cover the three types of problems MESA currently supports: homogeneous, interface, and three-layer.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Incompact3d: A powerful tool to tackle turbulence problems with up to O(105) computational cores

Understanding the nature of complex turbulent flows remains one of the most challenging problems in classical physics. Significant progress has been made recently using high performance computing, and computational fluid dynamics is now a credible alternative to experiments and theories in order to understand the rich physics of turbulence. In this paper, we present an efficient numerical tool called Incompact3d that can be coupled with massive parallel platforms in order to simulate turbulence problems with as much complexity as possible, using up to O(105) computational cores by means of direct numerical simulation (DNS). DNS is the simplest approach conceptually to investigate turbulence, featuring the highest temporal and spatial accuracy and it requires extraordinary powerful resources. This paper is an extension of Laizet et al.(Comput. Fluids 2010; 39(3):471–484) where the authors proposed a strategy to run DNS with up to 1024 computational cores. Copyright © 2010 John Wiley & Sons, Ltd.

Computer Science↗

Study of Whisper Statistics for Criticality Safety Code Validation

Whisper is computational software designed to assist with validation studies with the Monte Carlo particle transport package MCNP. Historical approaches rely on expert based judgment to select benchmarks while Whisper uses sensitivity/uncertainty (S/U) methods to select relevant benchmarks to a particular application model. Whisper will also derive a calculational margin and margin of subcriticality (MOS) that may be used to generate an upper subcritical limit (USL) for a particular application model. Whisper finds benchmark experiments whose isotope sensitivity profiles align best with the MCNP model in question, and assign a correlation coefficient ('ck' in Whisper parlance) to each selected benchmark as a measure of how closely those profiles agree. When ck values are high, there is less uncertainty between model and benchmarks and a higher USL is possible, relative to cases when ck values are low. The default Whisper settings recommends a 100,000 particles per cycle run for 500 active cycles, resulting in 50 M active neutron histories per application run. This is computationally intensive and may not be necessary to produce accurate results. A Whisper statistical study was done varying the neutron histories per cycle from 10,000 to the default 100,000. A lower number of neutron histories will allow Whisper to be used on low memory systems such as laptops. The intent of this paper is to present the changes in the Whisper results as the number of neutrons histories run is varied.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

A fast platform for simulating semi-flexible fiber suspensions applied to cell mechanics

We present a novel platform for the large-scale simulation of three-dimensional fibrous structures immersed in a Stokesian fluid and evolving under confinement or in free-space in three dimensions. One of the main motivations for this work is to study the dynamics of fiber assemblies within biological cells. For this, we also incorporate the key biophysical elements that determine the dynamics of these assemblies, which include the polymerization and depolymerization kinetics of fibers, their interactions with molecular motors and other objects, their flexibility, and hydrodynamic coupling. This work, to our knowledge, is the first technique to include many-body hydrodynamic interactions (HIs), and the resulting fluid flows, in cellular assemblies of flexible fibers. We use non-local slender body theory to compute the fluid–structure interactions of the fibers and a second-kind boundary integral formulation for other rigid bodies and the confining boundary. A kernel-independent implementation of the fast multipole method is utilized for efficient evaluation of HIs. The deformation of the fibers is described by nonlinear Euler–Bernoulli beam theory and their polymerization is modeled by the reparametrization of the dynamic equations in the appropriate non-Lagrangian frame. We use a pseudo-spectral representation of fiber positions and implicit time-stepping to resolve large fiber deformations, and to allow time-steps not excessively constrained by temporal stiffness or fiber–fiber interactions. The entire computational scheme is parallelized, which enables simulating assemblies of thousands of fibers. We use our method to investigate two important questions in the mechanics of cell division: (i) the effect of confinement on the hydrodynamic mobility of microtubule asters; and (ii) the dynamics of the positioning of mitotic spindle in complex cell geometries. Finally to demonstrate the general applicability of the method, we simulate the sedimentation of a cloud of semi-flexible fibers.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Variational quantum algorithms

Applications such as simulating complicated quantum systems or solving large-scale linear algebra problems are very challenging for classical computers, owing to the extremely high computational cost. Quantum computers promise a solution, although fault-tolerant quantum computers will probably not be available in the near future. Current quantum devices have serious constraints, including limited numbers of qubits and noise processes that limit circuit depth. Variational quantum algorithms (VQAs), which use a classical optimizer to train a parameterized quantum circuit, have emerged as a leading strategy to address these constraints. VQAs have now been proposed for essentially all applications that researchers have envisaged for quantum computers, and they appear to be the best hope for obtaining quantum advantage. Nevertheless, challenges remain, including the trainability, accuracy and efficiency of VQAs. Here we overview the field of VQAs, discuss strategies to overcome their challenges and finally, we highlight the exciting prospects for using them to obtain quantum advantage.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Adaptive Space-Time Methods for Large Scale Optimal Design

When modeling complex physical systems with advanced dynamics, such as shocks and singularities, many classic methods for solving partial differential equations can return inaccurate or unusable results. One way to resolve these complex dynamics is through r-adaptive refinement methods, in which a fixed number of mesh points are shifted to areas of high interest. The mesh refinement map can be found through the solution of the Monge-Ampére equation, a highly nonlinear partial differential equation. Due to its nonlinearity, the numerical solution of the Monge-Ampére equation is nontrivial and has previously required computationally expensive methods. In this report, we detail our novel optimization-based, multigrid-enabled solver for a low-order finite element approximation of the Monge-Ampére equation. This fast and scalable solver makes r-adaptive meshing more readily available for problems related to large-scale optimal design. Beyond mesh adaptivity, our report discusses additional applications where our fast solver for the Monge-Ampére equation could be easily applied.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Calculation of Higher Eigenpairs of the Transport Equation Using IRAM Based on Domain Decomposition

The higher eigenpairs of the neutron transport (or diffusion) equation are useful in core flux distribution reconstruction, transient analysis, stability analysis, and loading pattern optimization. There are various methods for the calculation of higher eigenpairs, such as the power iteration method with filtering technique, the Generalized Modified Power Method (GMPM), the power iteration method with innovative boundary conditions for symmetric cores, and Krylov subspace methods. In regard to Krylov subspace methods, the Implicitly Restarted Arnoldi Method (IRAM) and ORTHOMIN were implemented to calculate higher eigenpairs for both transport and diffusion equations. In Warsa's work, however, there was a significant drawback that problems with energy upscatter could not be treated efficiently. In Modak's work, the mode to which his method was likely to converge depended on the shape of initial guess flux, and only one mode could be computed each time, making it impractical for real use. Furthermore, the computational burden for higher eigenpairs is generally much larger than for only the first eigenpair, especially for neutron transport equations. Therefore, the implementation of parallel computation for higher eigenpairs is essential to improve the efficiency, and no such work has been reported in literature so far. In this summary, we propose an innovative method to calculate higher eigenpairs of the neutron transport equation based on high performance computation. In this method, 2D Matrix Method of Characteristic (MMOC) is used to discretize the neutron transport equation; IRAM is used to evaluate higher eigenpairs; spatial domain decomposition is used to realize parallel computation. The highlight of this method is using the MGMD PGMRES (Multi-Group and Multi-Domain coupled Parallel Generalized Minimal Residual Method) algorithm to simultaneously accelerate the upscatter iterations and the inner interface angular fluxes iterations, avoiding the drawback in Warsa's method and the efficiency problem of conventional Jacobi iteration. To the best of our knowledge, our work represents the first application of IRAM based on domain decomposition for higher eigenpairs.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Particle Resuspension Simulation Capability to Substantiate DOE-HDBK-3010 Data

The data provided in the U.S. Department of Energy (DOE) Handbook, DOE-HDBK-3010 provides data such as airborne release fractions and respirable fractions which are widely used in safety analysis and facility design. These fractions are often used as conservative bounds, despite the fact that the original data may have been obtained at a different scale or in a different configuration than the end application. The use of computational techniques to augment these data can be used to extend laboratory-scale data applicability to facility-scale decisions. Our prior report described an approach using Sandia National Laboratories (SNL) computer codes to simulate particle releases from various accident scenarios. The relevant physics controlling the particle resuspension phenomena can be highly problem-dependent. They can include surface tension for particles or surfaces with liquid present, van der Waals forces for small particles, electrostatic forces for charged particles, and mechanical interactions with surface features larger than the particles sizes. The complexity of this phenomenon and recent developments have been described in a recent review by Henry and Minier. (authors)

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

S/U Comparison Study with a Focus on USLs

Under a DOE Nuclear Criticality Safety Program (NCSP) task involving Analytical Methods, three Laboratories collaborated in a comparison of results obtained from Sensitivity/Uncertainty (S/U) packages relevant to validation of transport codes. The task involves Institut de Radioprotection et de Sûreté Nucléaire (IRSN), Los Alamos National Laboratory (LANL), and Oak Ridge National Laboratory (ORNL) comparing results of MORET 5/MACSENS V3.0, MCNP6.2/Whisper-1.1, and SCALE 6.2.3/TSUNAMI/USLSTATS respectively. All Monte Carlo transport code results utilize ENDF/B-VII.1. Four cases from the International Handbook of Evaluated Criticality Safety Benchmark Experiments (ICSBEP Handbook) were selected as application models: HEU-MET-FAST-013-001, HEU-SOL-THERM 001-008, PU-MET-FAST-022-001, and PU-SOL-THERM 001-001. Ultimately, comparison is made between Upper Subcritical Limits (USLs) obtained using each code package for each application case. Since differences exist in whether packages take into account margin of subcriticality (MOS), the USL may be computed using bias and bias uncertainty, also known as the calculational margin (CM) in ANSI/ANS 8.24. Application of portions of MOS to the USL for nuclear data uncertainty of and potential code margin is referred to as USL herein. In either case, additional MOS is considered for actual application cases.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Parallel adaptive wavelet collocation method for PDEs

A parallel adaptive wavelet collocation method for solving a large class of Partial Differential Equations is presented. The parallelization is achieved by developing an asynchronous parallel wavelet transform, which allows one to perform parallel wavelet transform and derivative calculations with only one data synchronization at the highest level of resolution. The data are stored using tree-like structure with tree roots starting at a priori defined level of resolution. Both static and dynamic domain partitioning approaches are developed. For the dynamic domain partitioning, trees are considered to be the minimum quanta of data to be migrated between the processes. This allows fully automated and efficient handling of non-simply connected partitioning of a computational domain. Dynamic load balancing is achieved via domain repartitioning during the grid adaptation step and reassigning trees to the appropriate processes to ensure approximately the same number of grid points on each process. The parallel efficiency of the approach is discussed based on parallel adaptive wavelet-based Coherent Vortex Simulations of homogeneous turbulence with linear forcing at effective non-adaptive resolutions up to 2048{sup 3} using as many as 2048 CPU cores.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Neutron Number Probability Distributions in a Subcritical System Using the Forward Master Equation

The subject of this paper is the determination of the equilibrium probability distribution function (PDF) of the neutron population within a subcritical multiplying system in the presence of an intrinsic random source as a result of spontaneous fission (SF). Such systems are strongly stochastic and low order moments such as the mean and variance of the neutron number are not sufficient to characterize the true state of the neutron population. We base our work on the forward Master equation in a lumped model formulation for P{sub n} (t), n = 0, 1, 2,..., the probability of there existing η neutrons at time t and obtain solutions for the steady state distributions. The key parameters in this model, neutron lifetime and fission probability, are rigorously obtained by numerically solving the k-eigenvalue problem in a one-dimensional spherical system and using standard definitions of lumped parameters in terms of production and loss rates in finite systems. Previous work has examined single-chain PDFs (a single fission and the resulting progeny) for neutrons, uncoupled neutron-photon single-chain PDFs, both using a lumped backward Master equation formulation, as well as neutron PDFs in supercritical systems. In this paper, we analyze strictly subcritical systems, for which we compare analytically derived solutions with numerical computations for different multiplicity distribution models. For subcritical systems where the neutron population remains finite at steady state, we show that the forward Master equation can be very efficiently solved numerically to obtain the equilibrium distributions. Finally, this work is motivated by potential application to passive interrogation for detection of diverted nuclear materials as well to criticality safety. The equilibrium neutron number probability distribution in subcritical systems has been numerically investigated for several models of the induced and spontaneous fission multiplicity distribution. A well known approximate but closed form solution, namely the quadratic model, was shown to be unacceptably accurate for subcritical media. The matrix inversion and the recursion methods agree well and were benchmarked with the binary fission model, but the recursion formulation proves far more computationally efficient. A qualitative change in the shape of the neutron PDF is observed for increasing source strength, as expected, and a transition from a stochastic to a deterministic system is expected for a sufficiently strong source. We are currently extending this approach to obtain the equilibrium joint distribution of neutrons within the system and those that have leaked, to explicitly represent the neutron PDF as observed by an external detector. (authors)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Structure identification methods for atomistic simulations of crystalline materials

Here, we discuss existing and new computational analysis techniques to classify local atomic arrangements in large-scale atomistic computer simulations of crystalline solids. This article includes a performance comparison of typical analysis algorithms such as common neighbor analysis (CNA), centrosymmetry analysis, bond angle analysis, bond order analysis and Voronoi analysis. In addition we propose a simple extension to the CNA method that makes it suitable for multi-phase systems. Finally, we introduce a new structure identification algorithm, the neighbor distance analysis, which is designed to identify atomic structure units in grain boundaries.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Bayesian approach for parameter estimation and prediction using a computationally intensive model

Bayesian methods have been successful in quantifying uncertainty in physics-based problems in parameter estimation and prediction. In these cases, physical measurements y are modeled as the best fit of a physics-based model eta(theta), where theta denotes the uncertain, best input setting. Hence the statistical model is of the form y = eta(theta) + c, where epsilon accounts for measurement, and possibly other, error sources. When nonlinearity is present in eta(center dot), the resulting posterior distribution for the unknown parameters in the Bayesian formulation is typically complex and nonstandard, requiring computationally demanding computational approaches such as Markov chain Monte Carlo (MCMC) to produce multivariate draws from the posterior. Although generally applicable, MCMC requires thousands (or even millions) of evaluations of the physics model eta(center dot). This requirement is problematic if the model takes hours or days to evaluate. To overcome this computational bottleneck, we present an approach adapted from Bayesian model calibration. This approach combines output from an ensemble of computational model runs with physical measurements, within a statistical formulation, to carry out inference. A key component of this approach is a statistical response surface, or emulator, estimated from the ensemble of model runs. We demonstrate this approach with a case study in estimating parameters for a density functional theory model, using experimental mass/binding energy measurements from a collection of atomic nuclei. We also demonstrate how this approach produces uncertainties in predictions for recent mass measurements obtained at Argonne National Laboratory.

Higdon, Dave↗

Use of Criticality Eigenvalue Simulations for Subcritical Benchmark Evaluations

Subcritical multiplication experiments and simulations are important for a variety of applications including nonproliferation, safeguards, and criticality safety monitoring. Recently, subcritical experiments have been evaluated for inclusion in the International Criticality Safety Benchmark Evaluation Process (ICSBEP). In addition, new subcritical experiments have recently been designed. In these experiments, list-mode data (a list of each absorption in the neutron detector) is recorded and neutron noise analysis is used to determine the leakage multiplication (ML) of each configuration. One downside to the simulation of these types of experiments is that they are computationally expensive. This is because analog Monte Carlo with no variance reduction must be performed in order to maintain the time accuracy required in the measurement analysis. This work demonstrates that criticality eigenvalue simulations can be used to estimate sensitivities and uncertainties for three parameters: singles count rate (R{sub 1}), doubles count rate (R{sub 2}), and leakage multiplication (M{sub L}). This will provide a useful aid both in the design and evaluation of new subcritical measurements. (authors)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Precision and Accuracy in PDV and VISAR

This is a technical report discussing our current level of understanding of a wide and varying distribution of uncertainties in velocity results from Photonic Doppler Velocimetry in its application to gas gun experiments. Using propagation of errors methods with statistical averaging of photon number fluctuation in the detected photocurrent and subsequent addition of electronic recording noise, we learn that the velocity uncertainty in VISAR can be written in closed form. For PDV, the non-linear frequency transform and peak fitting methods employed make propagation of errors estimates notoriously more difficult to write down in closed form expect in the limit of constant velocity and low time resolution (large analysis-window width). An alternative method of error propagation in PDV is to use Monte Carlo methods with a simulation of the time domain signal based on results from the spectral domain. A key problem for Monte Carlo estimation for an experiment is a correct estimate of that portion of the time-domain noise associated with the peak-fitting region-of-interesting in the spectral domain. Using short-time Fourier transformation spectral analysis and working with the phase dependent real and imaginary parts allows removal of amplitude-noise cross terms that invariably show up when working with correlation-based methods or FFT power spectra. Estimation of the noise associated with a given spectral region of interest is then possible. At this level of progress, we learn that Monte Carlo trials with random recording noise and initial (uncontrolled) phase yields velocity uncertainties that are not as large as those observed. In a search for additional noise sources, a speckleinterference modulation contribution with off axis rays was investigated, and was found to add a velocity variation beyond that from the recording noise (due to random interference between off axis rays), but in our experiments the speckle modulation precision was not as important as the recording noise precision. But from these investigations we do appreciate that the velocity-uncertainty itself has a wide distribution of values that varies with signal-amplitude modulation (is not a single value). To provide a rough rule of thumb for the velocity uncertainty, we computed the average of the relative standard deviation distributions from 60 recorded traces (with distributions of uncertainties roughly between 0.1 % to 1 % in each trace) and found a mean of the distribution of uncertainties for our experiments is not better than 0.4 % at an analysis window width of 5 ns (although for brief intervals it can be as good as 0.1 %). Further imagination and testing may be needed to reveal other possible hydrodynamics-related sources of velocity error in PDV.

47 OTHER INSTRUMENTATION↗

PIV Uncertainty Methodologies for CFD Code Validation at the MIR Facility

Currently, computational fluid dynamics (CFD) is widely used in the nuclear thermal hydraulics field for design and safety analyses. To validate CFD codes, high quality multi dimensional flow field data are essential. The Matched Index of Refraction (MIR) Flow Facility at Idaho National Laboratory has a unique capability to contribute to the development of validated CFD codes through the use of Particle Image Velocimetry (PIV). The significance of the MIR facility is that it permits non intrusive velocity measurement techniques, such as PIV, through complex models without requiring probes and other instrumentation that disturb the flow. At the heart of any PIV calculation is the cross-correlation, which is used to estimate the displacement of particles in some small part of the image over the time span between two images. This image displacement is indicated by the location of the largest peak. In the MIR facility, uncertainty quantification is a challenging task due to the use of optical measurement techniques. Currently, this study is developing a reliable method to analyze uncertainty and sensitivity of the measured data and develop a computer code to automatically analyze the uncertainty/sensitivity of the measured data. The main objective of this study is to develop a well established uncertainty quantification method for the MIR Flow Facility, which consists of many complicated uncertainty factors. In this study, the uncertainty sources are resolved in depth by categorizing them into uncertainties from the MIR flow loop and PIV system (including particle motion, image distortion, and data processing). Then, each uncertainty source is mathematically modeled or adequately defined. Finally, this study will provide a method and procedure to quantify the experimental uncertainty in the MIR Flow Facility with sample test results.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

p -Adic AdS/CFT

Here, we construct a p-adic analog to AdS/CFT, where an unramified extension of the p-adic numbers replaces Euclidean space as the boundary and a version of the Bruhat-Tits tree replaces the bulk. Correlation functions are computed in the simple case of a single massive scalar in the bulk, with results that are strikingly similar to ordinary holographic correlation functions when expressed in terms of local zeta functions. Furthermore, we give some brief discussion of the geometry of p-adic chordal distance and of Wilson loops. Our presentation includes an introduction to p-adic numbers.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗