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 1,405 records · Page 78

The Continual Intercomparison of Radiation Codes (CIRC) Assessing Anew the Quality of GCM Radiation Algorithms

The simulation of changes in the Earth's climate due to solar and thermal radiative processes with global climate models (GCMs) is highly complex, depending on the parameterization of a multitude of nonlinearly coupled physical processes. In contrast, the germ of global climate change, the radiative forcing from enhanced abundances of greenhouse gases, is relatively well understood. The impressive agreement between detailed radiation calculations and highly resolved spectral radiation measurements in the thermal infrared under cloudless conditions (see, for example, Fig. 1) instills confidence in our knowledge of the sources of gaseous absorption. That the agreement spans a broad range of temperature and humidity regimes using instruments mounted on surface, aircraft, and satellite platforms not only attests to our capability to accurately calculate radiative fluxes under present conditions, but also provides confidence in the spectroscopic basis for computation of fluxes under conditions that might characterize future global climate (e.g., radiative forcing). Alas, the computational costs of highly resolved spectral radiation calculations cannot be afforded presently in GCMs. Such calculations have instead been used as the foundation for approximations implemented in fast but generally less accurate algorithms performing the needed radiative transfer (RT) calculations in GCMs. Credible climate simulations by GCMs cannot be ensured without accurate solar and thermal radiative flux calculations under all types of sky conditions: pristine cloudless, aerosol-laden, and cloudy. The need for accuracy in RT calculations is not only important for greenhouse gas forcing scenarios, but is also profoundly needed for the robust simulation of many other atmospheric phenomena, such as convective processes.

Oreopoulos, Lazaros↗

Momentum conservation and unitarity in parton showers and NLL resummation

We present a systematic study of differences between NLL resummation and parton showers. We first construct a Markovian Monte-Carlo algorithm for resummation of additive observables in electron-positron annihilation. Approximations intrinsic to the pure NLL result are then removed, in order to obtain a traditional, momentum and probability conserving parton shower based on the coherent branching formalism. The impact of each approximation is studied, and an overall comparison is made between the parton shower and pure NLL resummation. Differences compared to modern parton-shower algorithms formulated in terms of color dipoles are analyzed.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Computing Free Energies with Fluctuation Relations on Quantum Computers

As a central thermodynamic property, free energy enables the calculation of virtually any equilibrium property of a physical system, allowing for the construction of phase diagrams and predictions about transport, chemical reactions, and biological processes. Thus, methods for efficiently computing free energies, which in general is a difficult problem, are of great interest to broad areas of physics and the natural sciences. The majority of techniques for computing free energies target classical systems, leaving the computation of free energies in quantum systems less explored. Recently developed fluctuation relations enable the computation of free energy differences in quantum systems from an ensemble of dynamic simulations. While performing such simulations is exponentially hard on classical computers, quantum computers can efficiently simulate the dynamics of quantum systems. Here, we present an algorithm utilizing a fluctuation relation known as the Jarzynski equality to approximate free energy differences of quantum systems on a quantum computer. In this work we discuss under which conditions our approximation becomes exact, and under which conditions it serves as a strict upper bound. Furthermore, we successfully demonstrate a proof of concept of our algorithm using the transverse field Ising model on a real quantum processor. As quantum hardware continues to improve, we anticipate that our algorithm will enable computation of free energy differences for a wide range of quantum systems useful across the natural sciences.

97 MATHEMATICS AND COMPUTING↗

Computing region moments from boundary representations

The class of all possible formulas for computing arbitrary moments of a region from the region's boundary is derived. The selection of a particular formula depends on the choice of an independent parameter. Several choices of this parameter are explored for region boundaries approximated by polygons. The parameter choice that minimizes computation time for boundaries represented by chain code is derived. Algorithms are presented for computing arbitrary moments for a region from a polygonal approximation of its boundary and for computing low order moments from chain encoded boundaries.

Wilf, J. M.↗

Application of two-point implicit central-difference methods to hyperbolic systems

This paper presents a general solution algorithm for the set of difference equations that arise when two-point central differences are used to approximate the flux difference terms in systems of hyperbolic differential equations. The general algorithm eliminates the weak points associated with the nonstandard algorithm reported by Wornom and Hafez (1986). The disadvantages of their algorithm relate to its implementation. It consists of separate algorithms for subsonic, supersonic, sonic and shock cells, applied individually, which presents a major bookkeeping problem when multiple sonic and shock cells are present. The general algorithm eliminates this problem and introduces an improved shock treatment which produces shocks with at most one interior shock point.

Wornom, Stephen F.↗

A Collisional Algorithm for Modeling Circumstellar Debris Disks

Many planetary systems harbor circumstellar disks of dust and planetesimals thought to be debris left over from planet formation. These debris disks exhibit a range of morphological features which can arise from the gravitational perturbations of planets. Accurate models of these features, accounting for the interactions of the particles in a disk with each other and with whatever planets they contain, can act as signposts for planets in debris disks that otherwise could not be detected. Such models can also constrain the planet's mass and orbital parameters. Current models for many disks consider the gravitational and radiative effects of the star and planets on the disk, but neglect the morphological consequences of collisional interactions between the planetesimals. Many observed disk features are not satisfactorily explained by the current generation of models. I am developing a new kind of debris disk model that considers both the gravitational shaping of the disk by planets and the inelastic collisions between particles. I will use a hybrid N-body integrator to numerically solve the equations of motion for the particles and planets in the disk. To include the collisional effects, I begin with an algorithm that tests for collisions at each step of the orbit integration and readjusts the velocities of colliding particles. I am adapting this algorithm to the problem at hand by allowing each particle to represent a "swarm" of planetesimals with a range of masses. When the algorithm detects an encounter between swarms, two or three swarms are produced to approximate the range of possible trajectories of the daughter planetesimals. Here I present preliminary results from my collisional algorithm.

Nesvold, Erika↗

A Method for Dimensionally Adaptive Sparse Trigonometric Interpolation of Periodic Functions

We present a method for dimensionally adaptive sparse trigonometric interpolation of multidimensional periodic functions belonging to a smoothness class of finite order. This method targets applications where periodicity must be preserved and the precise anisotropy is not known a priori. To the authors' knowledge, this is the first instance of a dimensionally adaptive sparse interpolation algorithm that uses a trigonometric interpolation basis. The motivating application behind this work is the adaptive approximation of a multi-input model for a molecular potential energy surface (PES) where each input represents an angle of rotation. Our method is based on an anisotropic quasi-optimal estimate for the decay rate of the Fourier coefficients of the model; a least-squares fit to the coefficients of the interpolant is used to estimate the anisotropy. Thus, our adaptive approximation strategy begins with a coarse isotropic interpolant, which is gradually refined using the estimated anisotropic rates. The procedure takes several iterations where ever-more accurate interpolants are used to generate ever-improving anisotropy rates. We present several numerical examples of our algorithm where the adaptive procedure successfully recovers the theoretical “best” convergence rate, including an application to a periodic PES approximation. An open-source implementation of our algorithm resides in the Tasmanian UQ library developed at Oak Ridge National Laboratory.

97 MATHEMATICS AND COMPUTING↗

Kravchuk functions for the finite oscillator approximation

Kravchuk orthogonal functions - Kravchuk polynomials multiplied by the square root of the weight function - simplify the inversion algorithm for the analysis of discrete, finite signals in harmonic oscillator components. They can be regarded as the best approximation set. As the number of sampling points increases, the Kravchuk expansion becomes the standard oscillator expansion.

Atakishiyev, Natig M.↗

Implicit Extrapolation Methods for Variable Coefficient Problems

Implicit extrapolation methods for the solution of partial differential equations are based on applying the extrapolation principle indirectly. Multigrid tau-extrapolation is a special case of this idea. In the context of multilevel finite element methods, an algorithm of this type can be used to raise the approximation order, even when the meshes are nonuniform or locally refined. Here previous results are generalized to the variable coefficient case and thus become applicable for nonlinear problems. The implicit extrapolation multigrid algorithm converges to the solution of a higher order finite element system. This is obtained without explicitly constructing higher order stiffness matrices but by applying extrapolation in a natural form within the algorithm. The algorithm requires only a small change of a basic low order multigrid method.

Jung, M.↗

Space-Split Algorithm for Sensitivity Analysis of Discrete Chaotic Systems With Multidimensional Unstable Manifolds

Accurate approximations of the change of a system's output and its statistics with respect to the input are highly desired in computational dynamics. Ruelle's linear response theory provides breakthrough mathematical machinery for computing the linear response of chaotic dynamical systems. In this paper, we propose an algorithm for sensitivity analysis of discrete chaos with an arbitrary number of positive Lyapunov exponents. We combine the concept of perturbation space-splitting, which regularizes Ruelle's original expression, together with measure-based parameterization of the expanding subspace. We use these tools to rigorously derive trajectory-following recursive relations that converge exponentially fast, and construct a memory-efficient Monte Carlo scheme for derivatives of the output statistics. Thanks to the regularization and lack of simplifying assumptions on the system's behavior, our method is immune to the common problems of other popular methods such as the exploding tangent solutions and unphysical shadowing directions. Here, we provide a ready-to-use algorithm, analyze its complexity, and demonstrate several numerical examples of sensitivity computation using physically-inspired low-dimensional systems.

97 MATHEMATICS AND COMPUTING↗

A direct Vlasov code to study the non-stationary current collection by a cylindrical Langmuir probe

The time-dependent current collection by a cylindrical Langmuir probe, whose bias is suddenly changed from zero to a positive or negative finite value, is studied with a novel direct Vlasov code. The numerical algorithm is based on finite-difference formulas to approximate spatial and velocity derivatives and the time integration is carried out with an explicit Runge-Kutta method, or in the case of probe radius small compared with the Debye length, by using the unconditionally stable backward Euler scheme. Both electrons and ions are treated kinetically by the code, which implements initial and boundary conditions that are consistent with the presence of the probe. Within the considered parameter range, the plasma sheath around the probe exhibited an overshoot and it later recovered a steady state. Phase space diagrams of the particle trajectories revealed the presence of a trapped population of particles. The dependence of this population as a function of the probe radius is presented as well as a comparison with the stationary theory. The performance of the code and a comparison with previously used particle-in-cell algorithms are discussed.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Discrete-Time Demodulator Architectures for Free-Space Broadband Optical Pulse-Position Modulation

The objective of this work is to develop discrete-time demodulator architectures for broadband optical pulse-position modulation (PPM) that are capable of processing Nyquist or near-Nyquist data rates. These architectures are motivated by the numerous advantages of realizing communications demodulators in digital very large scale integrated (VLSI) circuits. The architectures are developed within a framework that encompasses a large body of work in optical communications, synchronization, and multirate discrete-time signal processing and are constrained by the limitations of the state of the art in digital hardware. This work attempts to create a bridge between theoretical communication algorithms and analysis for deep-space optical PPM and modern digital VLSI. The primary focus of this work is on the synthesis of discrete-time processing architectures for accomplishing the most fundamental functions required in PPM demodulators, post-detection filtering, synchronization, and decision processing. The architectures derived are capable of closely approximating the theoretical performance of the continuous-time algorithms from which they are derived. The work concludes with an outline of the development path that leads to hardware.

Gray, A. A.↗

Learning planar Ising models

Inference and learning of graphical models are both well-studied problems in statistics and machine learning that have found many applications in science and engineering. However, exact inference is intractable in general graphical models, which suggests the problem of seeking the best approximation to a collection of random variables within some tractable family of graphical models. In this paper, we focus on the class of planar Ising models, for which exact inference is tractable using techniques of statistical physics. Based on these techniques and recent methods for planarity testing and planar embedding, we propose a greedy algorithm for learning the best planar Ising model to approximate an arbitrary collection of binary random variables (possibly from sample data). Given the set of all pairwise correlations among variables, we select a planar graph and optimal planar Ising model defined on this graph to best approximate that set of correlations. Finally, we demonstrate our method in simulations and for two applications: modeling senate voting records and identifying geo-chemical depth trends from Mars rover data.

97 MATHEMATICS AND COMPUTING↗

A Hybrid Monte Carlo-Deterministic Method for Global Binary Stochastic Medium Transport Problems

Global deep-penetration transport problems are difficult to solve using traditional Monte Carlo techniques. In these problems, the scalar flux distribution is desired at all points in the spatial domain (global nature), and the scalar flux typically drops by several orders of magnitude across the problem (deep-penetration nature). As a result, few particle histories may reach certain regions of the domain, producing a relatively large variance in tallies in those regions. Implicit capture (also known as survival biasing or absorption suppression) can be used to increase the efficiency of the Monte Carlo transport algorithm to some degree. A hybrid Monte Carlo-deterministic technique has previously been developed by Cooper and Larsen to reduce variance in global problems by distributing particles more evenly throughout the spatial domain. This hybrid method uses an approximate deterministic estimate of the forward scalar flux distribution to automatically generate weight windows for the Monte Carlo transport simulation, avoiding the necessity for the code user to specify the weight window parameters. In a binary stochastic medium, the material properties at a given spatial location are known only statistically. The most common approach to solving particle transport problems involving binary stochastic media is to use the atomic mix (AM) approximation in which the transport problem is solved using ensemble-averaged material properties. The most ubiquitous deterministic model developed specifically for solving binary stochastic media transport problems is the Levermore-Pomraning (L-P) model. Zimmerman and Adams proposed a Monte Carlo algorithm (Algorithm A) that solves the Levermore-Pomraning equations and another Monte Carlo algorithm (Algorithm B) that is more accurate as a result of improved local material realization modeling. Recent benchmark studies have shown that Algorithm B is often significantly more accurate than Algorithm A (and therefore the L-P model) for deep penetration problems such as examined in this paper. In this research, we investigate the application of a variant of the hybrid Monte Carlo-deterministic method proposed by Cooper and Larsen to global deep penetration problems involving binary stochastic media. To our knowledge, hybrid Monte Carlo-deterministic methods have not previously been applied to problems involving a stochastic medium. We investigate two approaches for computing the approximate deterministic estimate of the forward scalar flux distribution used to automatically generate the weight windows. The first approach uses the atomic mix approximation to the binary stochastic medium transport problem and a low-order discrete ordinates angular approximation. The second approach uses the Levermore-Pomraning model for the binary stochastic medium transport problem and a low-order discrete ordinates angular approximation. In both cases, we use Monte Carlo Algorithm B with weight windows automatically generated from the approximate forward scalar flux distribution to obtain the solution of the transport problem.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Application of integration algorithms in a parallel processing environment for the simulation of jet engines

The application of Predictor corrector integration algorithms developed for the digital parallel processing environment are investigated. The algorithms are implemented and evaluated through the use of a software simulator which provides an approximate representation of the parallel processing hardware. Test cases which focus on the use of the algorithms are presented and a specific application using a linear model of a turbofan engine is considered. Results are presented showing the effects of integration step size and the number of processors on simulation accuracy. Real time performance, interprocessor communication, and algorithm startup are also discussed.

Krosel, S. M.↗

Efficient Fourier basis particle simulation

The standard particle-in-cell algorithm suffers from grid heating. There exists a gridless alternative which bypasses the deposition step and calculates each Fourier mode of the charge density directly from the particle positions. We show that a gridless method can be computed efficiently through the use of an Unequally Spaced Fast Fourier Transform (USFFT) algorithm. After a spectral field solve, the forces on the particles are calculated via the inverse USFFT (a rapid solution of an approximate linear system). We provide one and two dimensional implementations of this algorithm with an asymptotic runtime of O ( N p + N m D log ⁡ N m D ) for each iteration, identical to the standard PIC algorithm (where N p is the number of particles, N m is the number of Fourier modes, and D is the spatial dimensionality of the problem). We demonstrate superior energy conservation and reduced noise, as well as convergence of the energy conservation at small time steps.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

THE FIRST GALAXIES: CHEMICAL ENRICHMENT, MIXING, AND STAR FORMATION

Using three-dimensional cosmological simulations, we study the assembly process of one of the first galaxies, with a total mass of {approx}10{sup 8} M {sub sun}, collapsing at z {approx_equal} 10. Our main goal is to trace the transport of the heavy chemical elements produced and dispersed by a pair-instability supernova exploding in one of the minihalo progenitors. To this extent, we incorporate an efficient algorithm into our smoothed particle hydrodynamics code that approximately models turbulent mixing as a diffusion process. We study this mixing with and without the radiative feedback from Population III (Pop III) stars that subsequently form in neighboring minihalos. Our simulations allow us to constrain the initial conditions for second-generation star formation, within the first galaxy itself, and inside of minihalos that virialize after the supernova explosion. We find that most minihalos remain unscathed by ionizing radiation or the supernova remnant, while some are substantially photoheated and enriched to supercritical levels, likely resulting in the formation of low-mass Pop III or even Population II (Pop II) stars. At the center of the newly formed galaxy, {approx}10{sup 5} M {sub sun} of cold, dense gas uniformly enriched to {approx}10{sup -3} Z {sub sun} is in a state of collapse, suggesting that a cluster of Pop II stars will form. The first galaxies, as may be detected by the James Webb Space Telescope, would therefore already contain stellar populations familiar from lower redshifts.

79 ASTRONOMY AND ASTROPHYSICS↗