Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “approximate 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 1,225 records · Page 68

Assessing the Optimality of LinDist3Flow for Optimal Tap Selection of Step Voltage Regulators in Unbalanced Distribution Networks

The adoption of distributed energy resources such as photovoltaics (PVs) has increased dramatically during the previous decade. The increased penetration of PVs into distribution networks (DNs) can cause voltage fluctuations that have to be mitigated. One of the key utility assets employed to this end are step-voltage regulators (SVRs). It is desirable to include tap selection of SVRs in optimal power flow (OPF) routines, a task that turns out to be challenging because the resultant OPF problem is nonconvex with added complexities stemming from accurate SVR modeling. While several convex relaxations based on semi-definite programming (SDP) have been presented in the literature for optimal tap selection, SDP based schemes do not scale well and are challenging to implement in large-scale planning or operational frameworks. This paper deals with the optimal tap selection (OPTS) problem for wye-connected SVRs using linear approximations of power flow equations. Specifically, the LinDist3Flow model is adopted and the effective SVR ratio is assumed to be continuous- enabling the formulation of a problem called LinDist3Flow-OPTS, which amounts to a linear program. The scalability and optimality gap of LinDist3Flow-OPTS are evaluated with respect to existing SDP-based and nonlinear programming techniques for optimal tap selection in three standard feeders, namely, the IEEE 13-bus, 123-bus, and 8500-node DNs. For all DNs considered, LinDist3Flow-OPTS achieves an optimality gap of approximately 1% or less while significantly lowering the computational burden.

linear approximations↗

Adaptive mesh refinement and turbulence modeling

Adaptive mesh refinement is shown to be essential in turbulence modeling. Adaptive Mesh Refinement (AMR) is a more computationally efficient means to obtain a discrete approximation to a continuous boundary value problem of a specified accuracy than classic isotropic grid refinement. Previous application of this methodology in the assessment of turbulence models suggested that the field variable solution on the interior of the domain was more sensitive to grid refinement than would be suggested by the sensitivity to grid refinement of surface quantities. Revisiting challenging high speed flow field revealed that issues believed to be fundamental turbulence model issues appear to be related to an under-resolved boundary layer edge – a flow detail previously considered unimportant.

Hypersonics↗

A General Framework for Bounding Approximate Dynamic Programming Schemes

For years, there has been interest in approximation methods for solving dynamic programming problems, because of the inherent complexity in computing optimal solutions characterized by Bellman’s principle of optimality. A wide range of approximate dynamic programming (ADP) methods now exists. It is of great interest to guarantee that the performance of an ADP scheme be at least some known fraction, say ß , of optimal. This letter introduces a general approach to bounding the performance of ADP methods, in this sense, in the stochastic setting. The approach is based on new results for bounding greedy solutions in string optimization problems, where one has to choose a string (ordered set) of actions to maximize an objective function. This bounding technique is inspired by submodularity theory, but submodularity is not required for establishing bounds. Instead, the bounding is based on quantifying certain notions of curvature of string functions; the smaller the curvatures the better the bound. The key insight is that any ADP scheme is a greedy scheme for some surrogate string objective function that coincides in its optimal solution and value with those of the original optimal control problem. The ADP scheme then yields to the bounding technique mentioned above, and the curvatures of the surrogate objective determine the value ß of the bound. The surrogate objective and its curvatures depend on the specific ADP.

discrete event systems↗

Evaluating Space Object Conjunction Probabilities Using Characteristic Function Inversion

This report discusses an approach to computing the probability of a conjunction between two space objects in the short-term encounter scenario. A conjunction is defined here as an event where the miss distance between the objects is less than some specified value. The scenario assumptions are that the motion of the objects is linear, their positions are Gaussian distributed, and their velocities are known and constant. Under these assumptions, the squared-miss distance is shown to have the generalized chi-square distribution. An established statistical technique called characteristic function inversion is employed to evaluate the distribution and obtain conjunction probabilities. The method is closely related to a recent approach based on moment generating function inversion, and a qualitative comparison of the approaches is provided. Last, the method is tested on several benchmark test cases where it agrees with numerical integration on the cases with conjunction probabilities above 10 –12 . However, the exact probability in these cases is usually not needed and this probability can be bounded above using an independent Gaussian approximation. Overall, the report shows how to compute conjunction probabilities using a standard statistical method, though numerical integration seems to perform equally well.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Gradient Coding With Iterative Block Leverage Score Sampling

Gradient coding is a method for mitigating straggling servers in a centralized computing network that uses erasure-coding techniques to distributively carry out first-order optimization methods. Randomized numerical linear algebra uses randomization to develop improved algorithms for large-scale linear algebra computations. In this study, we propose a method for distributed optimization that combines gradient coding and randomized numerical linear algebra. The proposed method uses a randomized ℓ 2 -subspace embedding and a gradient coding technique to distribute blocks of data to the computational nodes of a centralized network, and at each iteration the central server only requires a small number of computations to obtain the steepest descent update. The novelty of our approach is that the data is replicated according to importance scores, called block leverage scores, in contrast to most gradient coding approaches that uniformly replicate the data blocks. Furthermore, we do not require a decoding step at each iteration, avoiding a bottleneck in previous gradient coding schemes. We show that our approach results in a valid ℓ 2 -subspace embedding, and that our resulting approximation converges to the optimal solution.

97 MATHEMATICS AND COMPUTING↗

Numerical simulation of viscous vortex rings

Vortex interactions and their role in turbulent flow are examined. The objectives are twofold. First, to use the existing axisymmetric code to study the annihilation process of colliding vortex rings and determine the relevance of this problem to similar 3-D phenomena. The second objective is to extend the code to three dimensions. The code under development is unique in that it can compute flows in a truly infinite domain (i.e., without periodic boundary conditions or approximations from truncating the domain). Because of this, the far field sound can be computed, and therefore, contribute to improved models of turbulence generated noise for this class of flows. Issues which can be addressed by the code include: effects of viscosity on mode selection in azimuthal breakdown of vortex rings (i.e., the Widnall instability); reconnection, the associated production of small scales, and the time scale of the process.

Stanaway, Sharon Kay↗

Minimum-fuel, power-limited transfers between coplanar elliptical orbits

Two techniques of computing coplanar, minimum-fuel, power-limited transfers are presented, based on approximate solutions obtained by the averaging method. For the first technique, the average solution provides estimates of the initial adjoint variables, and the second provides approximations of the optimal controls in feedback form. The accuracy of the techniques for computing coplanar, minimum-fuel, power-limited transfers is evaluated for a number of initial and final orbits.

Mease, Kenneth D.↗

Lumped-Parameter Representation of Wind Tunnel

Mathematical model of proposed wind-tunnel facility represents wind-tunnel circuit and associated equipment in terms of lumped-parameter components. Requires less computational effort and computing time than full three-dimensional aerodynamic computer analysis of system with many volume elements. Approximates distributed nature of wind tunnel well enough to simulate steady-state and transient behavior for analysis of proposed control subsystems and for training of operators. Lumped-parameter circuit model represents wind tunnel and associated equipment. Implemented on analog or digital computers to simulate wind-tunnel performance without risk to operators or equipment.

Krosel, Susan M.↗

A guide to the design of the virtual element methods for second- and fourth-order partial differential equations

Here we discuss the design and implementation details of two conforming virtual element methods for the numerical approximation of two partial differential equations that emerge in phase-field modeling of fracture propagation in elastic material. The two partial differential equations are: (i) a linear hyperbolic equation describing the momentum balance and (ii) a fourth-order elliptic equation modeling the damage of the material. Inspired by, we develop a new conforming VEM for the discretization of the two equations, which is implementation-friendly, i.e., different terms can be implemented by exploiting a single projection operator. We use C 0 and C 1 virtual elements for the second-and fourth-order partial differential equation, respectively. For both equations, we review the formulation of the virtual element approximation and discuss the details pertaining the implementation.

42 ENGINEERING↗

Reduced-Cost Four-Component Relativistic Double Ionization Potential Equation-of-Motion Coupled-Cluster Approaches with 4-Hole–2-Particle Excitations and Three-Body Clusters

The double ionization potential (DIP) equation-ofmotion (EOM) coupled-cluster (CC) method with 4-hole−2- particle (4h-2p) excitations on top of the CC with singles, doubles, and triples calculation, abbreviated as DIP-EOMCCSDT(4h-2p), along with its perturbative DIP-EOMCCSD(T)(a)(4h-2p) approximation, are extended to a relativistic four-component (4c) framework. In addition, we introduce and test a new computationally practical DIP-EOMCC approach, which we call DIPEOMCCSD( T)(ã)(4h-2p), that approximates the treatment of 4h- 2p correlations within the DIP-EOMCCSD(T)(a)(4h-2p) method and reduces the $\mathcal{N}$ 8 scaling characterizing DIP-EOMCCSDT(4h- 2p) and DIP-EOMCCSD(T)(a)(4h-2p) to $\mathcal{N}$ 7 with the system size $\mathcal{N}$. Further improvements in computational efficiency are obtained using the frozen natural spinor (FNS) approximation to reduce the numbers of unoccupied spinors entering the correlated steps of the DIP-EOMCC calculations according to a well-defined occupation-number-based threshold. The resulting 4c-FNS-DIPEOMCC approaches are used to compute DIPs for the series of inert gas atoms from argon to radon as well as the vertical DIPs in Cl 2 , Br 2 , HBr, and HI, which have been experimentally examined in the past. We demonstrate that, when using complete basis set extrapolations and FNS truncation threshold of 10 −4.5 , the 4c-FNS-DIP-EOMCCSD(T)(ã)(4h-2p) calculations are capable of predicting DIPs in agreement with experimental data, improving upon their nonrelativistic and spin-free scalar-relativistic counterparts, particularly when examining DIPs characterized by stronger spin−orbit coupling effects.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A diagonal algorithm for the method of pseudocompressibility

The method of pseudocompressibility has been shown to be an efficient method for obtaining a steady-state solution to the incompressible Navier-Stokes equations. Recent improvements to this method include the use of a diagonal scheme for the inversion of the equations at each iteration. The necessary transformations have been derived for the pseudocompressibility equations in generalized coordinates. The diagonal algorithm reduces the computing time necessary to obtain a steady-state solution by a factor of nearly three. Implicit viscous terms are maintained in the equations, and it has become possible to use fourth-order implicit dissipation. The steady-state solution is unchanged by the approximations resulting from the diagonalization of the equations. Computed results for flow over a two-dimensional backward-facing step and a three-dimensional cylinder mounted normal to a flat plate are presented for both the old and new algorithms. The accuracy and computing efficiency of these algorithms are compared.

Rogers, S. E.↗

Optimal Placement Of Multiple Antennas

Computer program based on pair of algorithms selects approximately optimal locations of antennas and approximately optimal number of elements in each antenna of multiple-antenna communication system. Obscuration in field of view at given antenna location taken into account in choice of number of antenna elements mounted there. Directional coverages of combinations of up to four antenna elements computed in search for combination to cover clear portion of field of view. Developed to aid design of antenna system of conceptual space station. Applied to system aboard ship or aircraft, on building in city, or in any location where transmission and reception blocked in some directions from each potential antenna-mounting point.

Shelton, Kyle W.↗

A Diagonal Algorithm for the Method of Pseudocompressibility

The method of pseudocompressibility has been found to be an efficient method for obtaining a steady-state solution to the incompressible Navier-Stokes equations. Recent improvements to this method include the use of a diagonal scheme for the inversion of the equations equations at each iteration. The necessary transformations have been derived for the pseudocompressibility equations in generalized coordinates. The diagonal algorithm reduces the computing time necessary to obtain a steady-state solution by a factor of nearly three. Implicit viscous terms are maintained in the equations, and it has become possible to use fourth-order implicit dissipation. The steady-state solution is unchanged by the approximations resulting from the diagonalization of the equations. Computed results for flow over a two-dimensional backward-facing step and a three-dimensional cylinder mounted normal to a flat plate are presented for both the old and new algorithms. The computing efficiency of these algorithms are compared. Identical solutions are obtained from both algorithms which compare well with experimental results.

Rogers, Stuart E.↗

Mechanical properties of zeolite-templated carbons from approximate density functional theory calculations

Zeolite-templated carbon (ZTC) is a unique porous carbonaceous material whose structure is ordered at the nanometre scale, enabling a representative periodic description at the atomistic level. Utilizing an existing, well-defined reference model for ZTCs, a structural library of varying compositions was developed by refinement using density-functional tight-binding (DFTB) potentials parameterized for materials science applications. We first determined the quantum chemical-refined structures of models with CH, CHO, CHON, CHOB, and CHOBN compositions with various degrees of heteroatom substitution. These structural models comprise the characteristic morphological features of highly porous carbon materials, such as open-blade surfaces, edges, saddles, and closed-strut formations, spanning a range of curvatures and characteristic sizes. Second, we carried out alternating compression and expansion of the CHO model unit cell to determine the lowest energy structure as well as to obtain its bulk modulus in order to demonstrate a close connection between macroscopic observations and atomic-scale structures. Further, the agreement between experimental measurements and the computational model is remarkable and demonstrates the power of approximate density functional theory as a cost-effective computational tool with chemical accuracy for the investigation of structure/property relationships in real-world carbon-based solids.

03 NATURAL GAS↗

Computational analysis of ramjet engine inlet interaction

A computational analysis of a ramjet engine at Mach 3.5 has been conducted and compared to results obtained experimentally. This study focuses on the behavior of the inlet both with and without combustor backpressure. Increased backpressure results in separation of the body side boundary layer and a resultant static pressure rise in the inlet throat region. The computational results compare well with the experimental data for static pressure distribution through the engine, inlet throat flow profiles, and mass capture. The computational analysis slightly underpredicts the thickness of the engine body surface boundary layer and the extent of the interaction caused by backpressure; however, the interaction is observed at approximately the same level of backpressure both experimentally and computationally. This study demonstrates the ability of two different Navier-Stokes codes, namely RPLUS and PARC, to calculate the flow features of this ramjet engine and to provide more detailed information on the process of inlet interaction and unstart.

Duncan, Beverly↗

Analyses of Cometary Silicate Crystals: DDA Spectral Modeling of Forsterite

Comets are the Solar System's deep freezers of gases, ices, and particulates that were present in the outer protoplanetary disk. Where comet nuclei accreted was so cold that CO ice (approximately 50K) and other supervolatile ices like ethane (C2H2) were preserved. However, comets also accreted high temperature minerals: silicate crystals that either condensed (greater than or equal to 1400 K) or that were annealed from amorphous (glassy) silicates (greater than 850-1000 K). By their rarity in the interstellar medium, cometary crystalline silicates are thought to be grains that formed in the inner disk and were then radially transported out to the cold and ice-rich regimes near Neptune. The questions that comets can potentially address are: How fast, how far, and over what duration were crystals that formed in the inner disk transported out to the comet-forming region(s)? In comets, the mass fractions of silicates that are crystalline, f_cryst, translate to benchmarks for protoplanetary disk radial transport models. The infamous comet Hale-Bopp has crystalline fractions of over 55%. The values for cometary crystalline mass fractions, however, are derived assuming that the mineralogy assessed for the submicron to micron-sized portion of the size distribution represents the compositional makeup of all larger grains in the coma. Models for fitting cometary SEDs make this assumption because models can only fit the observed features with submicron to micron-sized discrete crystals. On the other hand, larger (0.1-100 micrometer radii) porous grains composed of amorphous silicates and amorphous carbon can be easily computed with mixed medium theory wherein vacuum mixed into a spherical particle mimics a porous aggregate. If crystalline silicates are mixed in, the models completely fail to match the observations. Moreover, models for a size distribution of discrete crystalline forsterite grains commonly employs the CDE computational method for ellipsoidal platelets (c:a:b=8.14x8.14xl in shape with geometrical factors of x:y:z=1:1:10, Fabian et al. 2001; Harker et al. 2007). Alternatively, models for forsterite employ statistical methods like the Distribution of Hollow Spheres (Min et al. 2008; Oliveira et al. 2011) or Gaussian Random Spheres (GRS) or RGF (Gielen et al. 200S). Pancakes, hollow spheres, or GRS shapes similar to wheat sheaf crystal habit (e.g., Volten et al. 2001; Veihelmann et al. 2006), however, do not have the sharp edges, flat faces, and vertices seen in images of cometary crystals in interplanetary dust particles (IDPs) or in Stardust samples. Cometary forsterite crystals often have equant or tabular crystal habit (J. Bradley). To simulate cometary crystals, we have computed absorption efficiencies of forsterite using the Discrete Dipole Approximation (DDA) DDSCAT code on NAS supercomputers. We compute thermal models that employ a size distribution of discrete irregularly shaped forsterite crystals (nonspherical shapes with faces and vertices) to explore how crystal shape affects the shape and wavelength positions of the forsterite spectral features and to explore whether cometary crystal shapes support either condensation or annealing scenarios (Lindsay et al. 2012a, b). We find forsterite crystal shapes that best-fit comet Hale-Bopp are tetrahedron, bricks or brick platelets, essentially equant or tabular (Lindsay et al. 2012a,b), commensurate with high temperature condensation experiments (Kobatake et al. 2008). We also have computed porous aggregates with crystal monomers and find that the crystal resonances are amplified. i.e., the crystalline fraction is lower in the aggregate than is derived by fitting a linear mix of spectral features from discrete subcomponents, and the crystal resonances 'appear' to be from larger crystals (Wooden et al. 2012). These results may indicate that the crystalline mass fraction in comets with comae dominated by aggregates may be lower than deduced by popular methods that only emoy ensembles of discrete crystals.

Wooden, Diane↗

Approximate quantum circuit synthesis using block encodings

One of the challenges in quantum computing is the synthesis of unitary operators into quantum circuits with polylogarithmic gate complexity. Exact synthesis of generic unitaries requires an exponential number of gates in general. We propose a novel approximate quantum circuit synthesis technique by relaxing the unitary constraints and interchanging them for ancilla qubits via block encodings. This approach combines smaller block encodings, which are easier to synthesize, into quantum circuits for larger operators. Due to the use of block encodings, our technique is not limited to unitary operators and can be applied for the synthesis of arbitrary operators. Overall, we show that operators which can be approximated by a canonical polyadic expression with a polylogarithmic number of terms can be synthesized with polylogarithmic gate complexity with respect to the matrix dimension.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A fast, exact code for scattered thermal radiation compared with a two-stream approximation

A two-stream accuracy study for internally (thermal) driven problems is presented by comparison with a recently developed 'exact' adding/doubling method. The resulting errors in external (or boundary) radiative intensity and flux are usually larger than those for the externally driven problems and vary substantially with the radiative parameters. Error predictions for a specific problem are difficult. An unexpected result is that the exact method is computationally as fast as the two-stream approximation for nonisothermal media.

Cogley, A. C.↗