Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “approximation algorithms”

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 739 records · Page 41

Moment transport equations for the primordial curvature perturbation

In a recent publication, we proposed that inflationary perturbation theory can be reformulated in terms of a probability transport equation, whose moments determine the correlation properties of the primordial curvature perturbation. In this paper we generalize this formulation to an arbitrary number of fields. We deduce ordinary differential equations for the evolution of the moments of ζ on superhorizon scales, which can be used to obtain an evolution equation for the dimensionless bispectrum, f{sub NL}. Our equations are covariant in field space and allow identification of the source terms responsible for evolution of f{sub NL}. In a model with M scalar fields, the number of numerical integrations required to obtain solutions of these equations scales like O(M{sup 3}). The performance of the moment transport algorithm means that numerical calculations with M >> 1 fields are straightforward. We illustrate this performance with a numerical calculation of f{sub NL} in Nflation models containing M ∼ 10{sup 2} fields, finding agreement with existing analytic calculations. We comment briefly on extensions of the method beyond the slow-roll approximation, or to calculate higher order parameters such as g{sub NL}.

79 ASTRONOMY AND ASTROPHYSICS↗

Spectral density reconstruction with Chebyshev polynomials

Accurate calculations of the spectral density in a strongly correlated quantum many-body system are of fundamental importance to study its dynamics in the linear response regime. Typical examples are the calculation of inclusive and semiexclusive scattering cross sections in atomic nuclei and transport properties of nuclear and neutron star matter. Integral transform techniques play an important role in accessing the spectral density in a variety of nuclear systems. However, their accuracy is in practice limited by the need to perform a numerical inversion which is often ill-conditioned. Here, in the present work we extend a recently proposed quantum algorithm which circumvents this problem. We show how to perform controllable reconstructions of the spectral density over a finite energy resolution with rigorous error estimates. An appropriate expansion in Chebyshev polynomials allows for efficient simulations also on classical computers. We apply our idea to obtain the local density of states for graphene in a magnetic field as a proof of principle. This paves the way for future applications in nuclear and condensed matter physics.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Current Regulation in Contact Welding

Algorithms for current stabilization in the control of contact welding are considered. The proposed method for specifying and maintaining the welding current permits correction of the thyristor firing angle by means of an approximate formula taking account of the measured current-pulse parameters in phase regulation. The proposed method simplifies the equipment and increases the efficiency of regulation.

42 ENGINEERING↗

Direct and inverse theorems of rational approximation in the Bergman space

For positive numbers p and {mu} let A{sub p,{mu}} denote the Bergman space of analytic functions in the half-plane {Pi}:={l_brace}z element of C:Imz>0{r_brace}. For f element of A{sub p,{mu}} let R{sub n} (f){sub p,{mu}} be the best approximation by rational functions of degree at most n. Also let {alpha} element of R and {tau}>0 be numbers such that {alpha}+{mu}=1/{tau}-1/p and 1/p+{mu} not element of N. Then the main result of the paper claims that the set of functions f element of A{sub p,{mu}} such that {Sigma}{sub n=1}{sup {infinity}} 1/n (n{sup {alpha}}+{mu}R{sub n} (f){sub p,{mu}}){sup {tau}}<{infinity} is precisely the Besov space B{sub {tau}}{sup {alpha}} of analytic functions in {Pi}. Bibliography: 23 titles.

97 MATHEMATICS AND COMPUTING↗

Multi-reference approach to the calculation of photoelectron spectra including spin-orbit coupling

X-ray photoelectron spectra provide a wealth of information on the electronic structure. The extraction of molecular details requires adequate theoretical methods, which in case of transition metal complexes has to account for effects due to the multi-configurational and spin-mixed nature of the many-electron wave function. Here, the restricted active space self-consistent field method including spin-orbit coupling is used to cope with this challenge and to calculate valence- and core-level photoelectron spectra. The intensities are estimated within the frameworks of the Dyson orbital formalism and the sudden approximation. Thereby, we utilize an efficient computational algorithm that is based on a biorthonormal basis transformation. The approach is applied to the valence photoionization of the gas phase water molecule and to the core ionization spectrum of the [Fe(H{sub 2}O){sub 6}]{sup 2+} complex. The results show good agreement with the experimental data obtained in this work, whereas the sudden approximation demonstrates distinct deviations from experiments.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Neutrino Oscillations in Supernovae

A (core-collapse) supernova is the final death call of a massive star during which a gigantic amount of a special kind of elementary particles known as neutrinos are released for a brief period of time. An earlier work by the PI and his collaborators has shown that the dense neutrino gas deep inside the supernova can experience "flavor transformation" or "oscillations" in a collective fashion, a macroscopic quantum phenomenon spanning over distances of 100-1000 kilometers. During this process neutrinos of different energies and propagation directions change their identities simultaneously. This phenomenon may be a key to understanding the mechanism of supernova explosion and the origin of many of the chemical elements found on the earth which were produced in the supernovae exploded in the past. The previous understanding of neutrino oscillations in supernovae was based on a stationary 3-dimensional model with 1 spatial dimension and 2 momentum dimensions. In this "neutrino bulb model" neutrinos are emitted from a spherically symmetric surface and they are decoupled from the motion of matter and the production of chemical elements. In order to accurately model the neutrino oscillations in supernovae and determine its physical consequences, sophisticated 7-dimensional (1 temporal dimension + 3 spatial dimensions + 3 momentum dimensions) modelling of neutrino transport must be performed self-consistently together with the hydrodynamic simulation of the flow of energy and matter inside the supernova and with the calculation of the production and destruction of chemical elements through a large nucleosynthesis network. Although it will be long journey to achieve the lofty goal, our project has made important progress in three different fronts towards this goal. In the first front we explored new computing hardware on which the next generation simulation codes may be run. We ported the neutrino bulb code to the platform of Graphics Processing Unit (GPU) and then later developed a new bulb code that can be run on supercomputers equipped with the Intel Xeon CPUs and/or the Xeon Phi coprocessors. In the second front we developed new algorithms that can be used towards computing neutrino oscillations in multi-dimensional models. We have developed a moment expansion method which is approximately 10 times more efficient than the old algorithm. We have also developed numerical codes to solve neutrino oscillations in toy models with two spatial dimensions. In the last front we used analytic methods to study neutrino oscillations in more sophisticated models, e.g. of multiple spatial dimensions and/or with time dependence. By analyzing the neutrino oscillations in toy models with two spacial dimensions we found that the approximate spacial translation symmetry, which is similar to the spherical symmetry in the neutrino bulb model, can be broken spontaneously as neutrino oscillations begin. By analyzing a time-dependent neutrino bulb model we found that certain modes of neutrino oscillations that are suppressed in the stationary model can become active in the time-dependent model. We have also developed theories which give insights to how ordinary matter may affect neutrino oscillations in supernovae and other astrophysical environments.

Duan, Huaiyu↗

Asynchronous τ-leaping

Stochastic simulation of cell signaling pathways and genetic regulatory networks has contributed to the understanding of cell function; however, investigation of larger, more complicated systems requires computationally efficient algorithms. τ-leaping methods, which improve efficiency when some molecules have high copy numbers, either use a fixed leap size, which does not adapt to changing state, or recalculate leap size at a heavy computational cost. We present a hybrid simulation method for reaction-diffusion systems which combines exact stochastic simulation and τ-leaping in a dynamic way. Putative times of events are stored in a priority queue, which reduces the cost of each step of the simulation. For every reaction and diffusion channel at each step of the simulation the more efficient of an exact stochastic event or a τ-leap is chosen. This new approach removes the inherent trade-off between speed and accuracy in stiff systems which was present in all τ-leaping methods by allowing each reaction channel to proceed at its own pace. Both directions of reversible reactions and diffusion are combined in a single event, allowing bigger leaps to be taken. This improves efficiency for systems near equilibrium where forward and backward events are approximately equally frequent. Comparison with existing algorithms and behaviour for five test cases of varying complexity shows that the new method is almost as accurate as exact stochastic simulation, scales well for large systems, and for various problems can be significantly faster than τ-leaping.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Application of the GBFP Method to Electron Partial-Wave Expansion Elastic Scattering Differential Cross Sections Within the Geant4 Toolkit - Paper 69

Analog Monte Carlo simulation of electrons in complex material geometries is generally impractical because the long range Coulomb interactions result in highly peaked differential cross sections (DCS) for scattering and energy-loss and extremely small collision mean free paths (mfp). The condensed history (CH) Monte Carlo method attempts to alleviate this limitation by advancing electrons in fixed steps and sampling angular deflections and energy losses from precomputed distributions obtained from approximate solutions to the underlying transport equation that are valid only for thin layers. Though CH is efficient and is widely employed in production codes (ITS, MCNP, EGS, Geant), step size restrictions and inconsistent handling of material and free surface boundaries limit the ultimate accuracy possible with this approach, especially in applications to highly heterogeneous media. Recently proposed alternatives to the CH method, such as the Generalized Boltzmann Fokker-Planck (GBFP) method, restore the correct transport mechanics by simulating single events based on a Boltzmann transport equation but with efficiency and accuracy achieved through the use of reduced-physics interaction models. Motivated by Lewis theory, various moment-preserving strategies are employed in the GBFP approach to construct DCSs that are less singular, and with mfps shorter than analog. Specifically, the approximate cross sections are constructed to rigorously preserve a finite number of angular and energy-loss moments of the analog DCSs while all higher moments are approximated in terms of the exact lower moments. By systematically increasing the number of moments retained, any desired accuracy can be obtained for integrated quantities, such as dose, reflection and transmission yields, as well as distributed quantities such as energy and angular distributions. For relativistic Rutherford cross section models, the GBFP method has been demonstrated in Monte Carlo simulation to yield accuracy comparable to analog but at a fraction of the cost. One advantage of the GBFP approach is that angular deflection and energy-loss interactions depend only on Legendre moments and energy-loss moments and not the detailed form of the analog DCSs. This feature allows moment-preservation to be enforced through DCSs expressed as a superposition of discrete (i.e., using delta-functions) angular deflections and discrete energy losses. This promotes extremely efficient computation when compared to analog and completely continuous or hybrid discrete-continuous moment-based DCS reconstructions, while yielding highly accurate results for integrated and distributed quantities. In this paper, we demonstrate that the moment-preserving algorithms central to our fully discrete GBFP method can be readily extended to apply to tabulated DCS data, specifically to the partial-wave expansion (PWE) elastic scattering DCSs. Since data libraries for the PWE DCSs for energy and material combinations of interest can be prohibitively large, the GBFP method provides a means to reduce data storage requirements. We implemented our algorithm in the Geant4 Monte Carlo code and all numerical results are obtained using this implementation. (authors)

61 RADIATION PROTECTION AND DOSIMETRY↗

Estimating Higher-Order Moments Using Symmetric Tensor Decomposition

In this paper, we consider the problem of decomposing higher-order moment tensors, i.e., the sum of symmetric outer products of data vectors. Such a decomposition can be used to estimate the means in a Gaussian mixture model and for other applications in machine learning. The dth-order empirical moment tensor of a set of p observations of n variables is a symmetric d-way tensor. Our goal is to nd a low-rank tensor approximation comprising r $\ll$ p symmetric outer products. The challenge is that forming the empirical moment tensor costs O(pn d ) operations and O(n d ) storage, which may be prohibitively expensive; additionally, the algorithm to compute the low-rank approximation costs O(n d ) per iteration. Our contribution is avoiding formation of the moment tensor, computing the low-rank tensor approximation of the moment tensor implicitly using O(pnr) operations per iteration and no extra memory. This advance opens the door to more applications of higher-order moments since they can now be efficiently computed. We present numerical evidence of the computational savings and show an example of estimating the means for higher-order moments.

97 MATHEMATICS AND COMPUTING↗

A NUMERICAL ALGORITHM FOR MODELING MULTIGROUP NEUTRINO-RADIATION HYDRODYNAMICS IN TWO SPATIAL DIMENSIONS

It is now generally agreed that multidimensional, multigroup, neutrino-radiation hydrodynamics (RHD) is an indispensable element of any realistic model of stellar-core collapse, core-collapse supernovae, and proto-neutron star instabilities. We have developed a new, two-dimensional, multigroup algorithm that can model neutrino-RHD flows in core-collapse supernovae. Our algorithm uses an approach similar to the ZEUS family of algorithms, originally developed by Stone and Norman. However, this completely new implementation extends that previous work in three significant ways: first, we incorporate multispecies, multigroup RHD in a flux-limited-diffusion approximation. Our approach is capable of modeling pair-coupled neutrino-RHD, and includes effects of Pauli blocking in the collision integrals. Blocking gives rise to nonlinearities in the discretized radiation-transport equations, which we evolve implicitly in time. We employ parallelized Newton-Krylov methods to obtain a solution of these nonlinear, implicit equations. Our second major extension to the ZEUS algorithm is the inclusion of an electron conservation equation that describes the evolution of electron-number density in the hydrodynamic flow. This permits calculating deleptonization of a stellar core. Our third extension modifies the hydrodynamics algorithm to accommodate realistic, complex equations of state, including those having nonconvex behavior. In this paper, we present a description of our complete algorithm, giving sufficient details to allow others to implement, reproduce, and extend our work. Finite-differencing details are presented in appendices. We also discuss implementation of this algorithm on state-of-the-art, parallel-computing architectures. Finally, we present results of verification tests that demonstrate the numerical accuracy of this algorithm on diverse hydrodynamic, gravitational, radiation-transport, and RHD sample problems. We believe our methods to be of general use in a variety of model settings where radiation transport or RHD is important. Extension of this work to three spatial dimensions is straightforward.

79 ASTRONOMY AND ASTROPHYSICS↗

Efficient reactive Brownian dynamics

We develop a Split Reactive Brownian Dynamics (SRBD) algorithm for particle simulations of reaction-diffusion systems based on the Doi or volume reactivity model, in which pairs of particles react with a specified Poisson rate if they are closer than a chosen reactive distance. In our Doi model, we ensure that the microscopic reaction rules for various association and dissociation reactions are consistent with detailed balance (time reversibility) at thermodynamic equilibrium. The SRBD algorithm uses Strang splitting in time to separate reaction and diffusion and solves both the diffusion-only and reaction-only subproblems exactly, even at high packing densities. To efficiently process reactions without uncontrolled approximations, SRBD employs an event-driven algorithm that processes reactions in a time-ordered sequence over the duration of the time step. A grid of cells with size larger than all of the reactive distances is used to schedule and process the reactions, but unlike traditional grid-based methods such as reaction-diffusion master equation algorithms, the results of SRBD are statistically independent of the size of the grid used to accelerate the processing of reactions. We use the SRBD algorithm to compute the effective macroscopic reaction rate for both reaction-limited and diffusion-limited irreversible association in three dimensions and compare to existing theoretical predictions at low and moderate densities. We also study long-time tails in the time correlation functions for reversible association at thermodynamic equilibrium and compare to recent theoretical predictions. Finally, we compare different particle and continuum methods on a model exhibiting a Turing-like instability and pattern formation. Our studies reinforce the common finding that microscopic mechanisms and correlations matter for diffusion-limited systems, making continuum and even mesoscopic modeling of such systems difficult or impossible. We also find that for models in which particles diffuse off lattice, such as the Doi model, reactions lead to a spurious enhancement of the effective diffusion coefficients.

97 MATHEMATICS AND COMPUTING↗

Quantum Search Approaches to Sampling-Based Motion Planning

In this paper, we present a novel formulation of traditional sampling-based motion planners as database-oracle structures that can be solved via quantum search algorithms. We consider two complementary scenarios: for simpler sparse environments, we formulate the Quantum Full Path Search Algorithm (q-FPS), which creates a superposition of full random path solutions, manipulates probability amplitudes with Quantum Amplitude Amplification (QAA), and quantum measures a single obstacle free full path solution. For dense unstructured environments, we formulate the Quantum Rapidly Exploring Random Tree algorithm, q-RRT, that creates quantum superpositions of possible parent-child connections, manipulates probability amplitudes with QAA, and quantum measures a single reachable state, which is added to a tree. As performance depends on the number of oracle calls and the probability of measuring good quantum states, we quantify how these errors factor into the probabilistic completeness properties of the algorithm. We then numerically estimate the expected number of database solutions to provide an approximation of the optimal number of oracle calls in the algorithm. We compare the q-RRT algorithm with a classical implementation and verify quadratic run-time speedup in the largest connected component of a 2D dense random lattice. We conclude by evaluating a proposed approach to limit the expected number of database solutions and thus limit the optimal number of oracle calls to a given number.

97 MATHEMATICS AND COMPUTING↗

Quantum search algorithms on a regular lattice

Quantum algorithms for searching for one or more marked items on a d-dimensional lattice provide an extension of Grover's search algorithm including a spatial component. We demonstrate that these lattice search algorithms can be viewed in terms of the level dynamics near an avoided crossing of a one-parameter family of quantum random walks. We give approximations for both the level splitting at the avoided crossing and the effectively two-dimensional subspace of the full Hilbert space spanning the level crossing. This makes it possible to give the leading order behavior for the search time and the localization probability in the limit of large lattice size including the leading order coefficients. For d=2 and d=3, these coefficients are calculated explicitly. Closed form expressions are given for higher dimensions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Real-time dynamics of the Schwinger model as an open quantum system with Neural Density Operators

Ab-initio simulations of multiple heavy quarks propagating in a Quark-Gluon Plasma are computationally difficult to perform due to the large dimension of the space of density matrices. This work develops machine learning algorithms to overcome this difficulty by approximating exact quantum states with neural network parametrisations, specifically Neural Density Operators. As a proof of principle demonstration in a QCD-like theory, the approach is applied to solve the Lindblad master equation in the 1 + 1d lattice Schwinger Model as an open quantum system. Neural Density Operators enable the study of in-medium dynamics on large lattice volumes, where multiple-string interactions and their effects on string-breaking and recombination phenomena can be studied. Thermal properties of the system at equilibrium can also be probed with these methods by variationally constructing the steady state of the Lindblad master equation. Scaling of this approach with system size is studied, and numerical demonstrations on up to 32 spatial lattice sites and with up to 3 interacting strings are performed.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Mass inflation in Brans-Dicke gravity

A detailed nonlinear analysis of the internal structure of spherical, charged black holes that are accreting scalar matter is performed in the framework of the Brans-Dicke theory of gravity. We choose the lowest value of the Brans-Dicke parameter that is compatible with observational constraints. First, the homogeneous approximation is used. It indicates that mass inflation occurs and that the variations of the Brans-Dicke scalar inside the black hole, which could in principle be large in the absence of mass inflation, become small when mass inflation does occur. Then, a full nonlinear numerical study of the black hole interior perturbed by a self-gravitating massless uncharged scalar field is performed. We use an algorithm with adaptive mesh refinement capabilities. In this way, the changes in the internal structure of the black hole caused by mass inflation are determined, as well as the induced variations of the Brans-Dicke scalar, confirming, qualitatively, the indications given by the homogeneous approximation.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

guppy i : a code for reducing the storage requirements of cosmological simulations

ABSTRACT As cosmological simulations have grown in size, the permanent storage requirements of their particle data have also grown. Even modest simulations present a major logistical challenge for the groups which run these boxes and researchers without access to high performance computing facilities often need to restrict their analysis to lower quality data. In this paper, we present guppy, a compression algorithm and code base tailored to reduce the sizes of dark matter-only cosmological simulations by approximately an order of magnitude. guppy is a ‘lossy’ algorithm, meaning that it injects a small amount of controlled and uncorrelated noise into particle properties. We perform extensive tests on the impact that this noise has on the internal structure of dark matter haloes, and identify conservative accuracy limits which ensure that compression has no practical impact on single-snapshot halo properties, profiles, and abundances. We also release functional prototype libraries in C, Python, and Go for reading and creating guppy data.

79 ASTRONOMY AND ASTROPHYSICS↗

CHOLLA: A NEW MASSIVELY PARALLEL HYDRODYNAMICS CODE FOR ASTROPHYSICAL SIMULATION

We present Computational Hydrodynamics On ParaLLel Architectures (Cholla ), a new three-dimensional hydrodynamics code that harnesses the power of graphics processing units (GPUs) to accelerate astrophysical simulations. Cholla models the Euler equations on a static mesh using state-of-the-art techniques, including the unsplit Corner Transport Upwind algorithm, a variety of exact and approximate Riemann solvers, and multiple spatial reconstruction techniques including the piecewise parabolic method (PPM). Using GPUs, Cholla evolves the fluid properties of thousands of cells simultaneously and can update over 10 million cells per GPU-second while using an exact Riemann solver and PPM reconstruction. Owing to the massively parallel architecture of GPUs and the design of the Cholla code, astrophysical simulations with physically interesting grid resolutions (≳256{sup 3}) can easily be computed on a single device. We use the Message Passing Interface library to extend calculations onto multiple devices and demonstrate nearly ideal scaling beyond 64 GPUs. A suite of test problems highlights the physical accuracy of our modeling and provides a useful comparison to other codes. We then use Cholla to simulate the interaction of a shock wave with a gas cloud in the interstellar medium, showing that the evolution of the cloud is highly dependent on its density structure. We reconcile the computed mixing time of a turbulent cloud with a realistic density distribution destroyed by a strong shock with the existing analytic theory for spherical cloud destruction by describing the system in terms of its median gas density.

79 ASTRONOMY AND ASTROPHYSICS↗

Multilevel Convergence Analysis of Multigrid-Reduction-in-Time

This study presents a multilevel convergence framework for multigrid-reduction-in-time (MGRIT) as a generalization of previous two-grid estimates. The framework provides a priori upper bounds on the convergence of MGRIT V- and F-cycles, with different relaxation schemes, by deriving the respective residual and error propagation operators. The residual and error operators are functions of the time-stepping operator, analyzed directly and bounded in the norm, both numerically and analytically. We present various upper bounds of different computational cost and varying sharpness. These upper bounds are complemented by proposing analytic formulae for the approximate convergence factor of V-cycle algorithms that take the number of fine grid time points, the temporal coarsening factors, and the eigenvalues of the time-stepping operator as parameters. The paper concludes with supporting numerical investigations of parabolic (anisotropic diffusion) and hyperbolic (wave equation) model problems. We assess the sharpness of the bounds and the quality of the approximate convergence factors. Observations from these numerical investigations demonstrate the value of the proposed multilevel convergence framework for estimating MGRIT convergence a priori and for the design of a convergent algorithm. We further highlight that observations in the literature are captured by the theory, including that two-level Parareal and multilevel MGRIT with F-relaxation do not yield scalable algorithms and the benefit of a stronger relaxation scheme. An important observation is that with increasing numbers of levels MGRIT convergence deteriorates for the hyperbolic model problem, while constant convergence factors can be achieved for the diffusion equation. The theory also indicates that L-stable Runge--Kutta schemes are more amendable to multilevel parallel-in-time integration with MGRIT than A-stable Runge--Kutta schemes.

97 MATHEMATICS AND COMPUTING↗