Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “computational efficiency”

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,765 records · Page 98

Adaptive DIT-Based Fringe Tracking and Prediction at IOTA

An automatic fringe tracking system has been developed and implemented at the Infrared Optical Telescope Array (IOTA). In testing during May 2002, the system successfully minimized the optical path differences (OPDs) for all three baselines at IOTA. Based on sliding window discrete Fourier transform (DFT) calculations that were optimized for computational efficiency and robustness to atmospheric disturbances, the algorithm has also been tested extensively on off-line data. Implemented in ANSI C on the 266 MHZ PowerPC processor running the VxWorks real-time operating system, the algorithm runs in approximately 2.0 milliseconds per scan (including all three interferograms), using the science camera and piezo scanners to measure and correct the OPDs. Preliminary analysis on an extension of this algorithm indicates a potential for predictive tracking, although at present, real-time implementation of this extension would require significantly more computational capacity.

Wilson, Edward↗

Transfer matrix computation of generalized critical polynomials in percolation

Percolation thresholds have recently been studied by means of a graph polynomial PB(p), henceforth referred to as the critical polynomial, that may be defined on any periodic lattice. The polynomial depends on a finite subgraph B, called the basis, and the way in which the basis is tiled to form the lattice. The unique root of P B (p) in [0, 1] either gives the exact percolation threshold for the lattice, or provides an approximation that becomes more accurate with appropriately increasing size of B. Initially P B (p) was defined by a contraction-deletion identity, similar to that satisfied by the Tutte polynomial. Here, we give an alternative probabilistic definition of P B (p), which allows for much more efficient computations, by using the transfer matrix, than was previously possible with contraction-deletion. We present bond percolation polynomials for the (4, 82), kagome, and (3, 122) lattices for bases of up to respectively 96, 162, and 243 edges, much larger than the previous limit of 36 edges using contraction-deletion. We discuss in detail the role of the symmetries and the embedding of B. For the largest bases, we obtain the thresholds p c (4, 82) = 0.676 803 329 · · ·, p c (kagome) = 0.524 404 998 · · ·, p c (3, 122) = 0.740 420 798 · · ·, comparable to the best simulation results. We also show that the alternative definition of P B (p) can be applied to study site percolation problems.

97 MATHEMATICS AND COMPUTING↗

Probing universalities in d > 2 CFTs: from black holes to shockwaves

Gravitational shockwaves are insensitive to higher-curvature corrections in the action. Recent work found that the OPE coefficients of lowest-twist multi-stress-tensor operators, computed holographically in a planar black hole background, are insensitive as well. In this paper, we analyze the relation between these two limits. We explicitly evaluate the two-point function on a shockwave background to all orders in a large central charge expansion. In the geodesic limit, we find that the ANEC exponentiates in the multi-stress-tensor sector. To compare with the black hole limit, we obtain a recursion relation for the lowest-twist products of two stress tensors in a spherical black hole background, letting us efficiently compute their OPE coefficients and prove their insensitivity to higher curvature terms. After resumming the lowest-twist stress-tensors and analytically continuing their contributions to the Regge limit, we find a perfect agreement with the shockwave computation. We also discuss the role of double-trace operators, global degenerate states, and multi-stress-tensor conformal blocks. These holographic results suggest the existence of a larger universal structure in higher-dimensional CFTs.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Efficient algorithm for locating and sizing series compensation devices in large power transmission grids: II. Solutions and applications

In a companion manuscript, we developed a novel optimization method for placement, sizing, and operation of Flexible Alternating Current Transmission System (FACTS) devices to relieve transmission network congestion. Specifically, we addressed FACTS that provide Series Compensation (SC) via modification of line inductance. In this manuscript, this heuristic algorithm and its solutions are explored on a number of test cases: a 30-bus test network and a realistically-sized model of the Polish grid (~ 2700 nodes and ~ 3300 lines). The results on the 30-bus network are used to study the general properties of the solutions including non-locality and sparsity. The Polish grid is used as a demonstration of the computational efficiency of the heuristics that leverages sequential linearization of power flow constraints and cutting plane methods that take advantage of the sparse nature of the SC placement solutions. Using these approaches, the algorithm is able to solve an instance of Polish grid in tens of seconds. We explore the utility of the algorithm by analyzing transmission networks congested by (a) uniform load growth, (b) multiple overloaded configurations, and (c) sequential generator retirements.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Additive Polynomial Time Integrators, Part I: Framework and Fully Implicit-Explicit Collocation Methods

In this paper we generalize the polynomial time integration framework to additively partitioned initial value problems. The framework we present is general and enables the construction of many new families of additive integrators with arbitrary order-of-accuracy and varying degree of implicitness. In this first work, we focus on a new class of implicit-explicit polynomial block methods that are based on fully implicit Runge–Kutta methods with Radau nodes and that possess high stage order. Here, we show that the new fully implicit-explicit (FIMEX) integrators have improved stability compared to existing IMEX Runge–Kutta methods, while also being more computationally efficient due to recent developments in preconditioning techniques for solving the associated systems of nonlinear equations. For PDEs on periodic domains where the implicit component is trivial to invert, we will show how parallelization of the right-hand side evaluations can be exploited to obtain significant speedup compared to existing serial IMEX Runge–Kutta methods. For parallel (in space) finite element discretizations, the new methods can achieve orders of magnitude better accuracy than existing IMEX Runge–Kutta methods and/or achieve a given accuracy several times times faster in terms of computational runtime.

97 MATHEMATICS AND COMPUTING↗

Ising-Traffic: Using Ising Machine Learning to Predict Traffic Congestion under Uncertainty

This paper addresses the challenges in accurate and realtime traffic congestion prediction with uncertainty by proposing Ising-Traffic, a novel quantum-inspired dual-model Ising based traffic prediction framework which delivers higher accuracy and lower latency than SOTA solutions. While traditional and deep learning methods face the trade-off between algorithm complexity and computational efficiency, our Ising-based method leverages Ising’s inherent and unique capability of finding the state of a system with the lowest energy and applying it to traffic prediction. In this work, traffic prediction under uncertainty is formulated into two separate Ising models: Reconstruct-Ising and Predict-Ising. Reconstruct-Ising is mapped onto modern Ising machine and handles uncertainty in traffic accurately with negligible latency and energy consumption, while Predict-Ising is mapped onto traditional processors and predicts future congestion precisely with only at most 1.8% computational demands of existing solutions. Our evaluation shows Ising-Traffic delivers on average 98× speedups and 5% accuracy improvement over SOTA.

traffic flow control, Ising↗

RADSAT Benchmarks for Prompt Gamma Neutron Activation Analysis Measurements

The accurate and efficient simulation of coupled neutron-photon problems is necessary for several important radiation detection applications. Examples include the detection of nuclear threats concealed in cargo containers and prompt gamma neutron activation analysis for nondestructive determination of elemental composition of unknown samples. High-resolution gamma-ray spectrometers are used in these applications to measure the spectrum of the emitted photon flux, which consists of both continuum and characteristic gamma rays with discrete energies. Monte Carlo transport is the most commonly used simulation tool for this type of problem, but computational times can be prohibitively long. This work explores the use of multi-group deterministic methods for the simulation of coupled neutron-photon problems. The main purpose of this work is to benchmark several problems modeled with RADSAT and MCNP to experimental data. Additionally, the cross section libraries for RADSAT are updated to include ENDF/B-VII cross sections. Preliminary findings show promising results when compared to MCNP and experimental data, but also areas where additional inquiry and testing are needed. The potential benefits and shortcomings of the multi-group-based approach are discussed in terms of accuracy and computational efficiency.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Efficient Algorithm for Locating and Sizing Series Compensation Devices in Large Transmission Grids: Solutions and Applications (PART II)

In a companion manuscript, we developed a novel optimization method for placement, sizing, and operation of Flexible Alternating Current Transmission System (FACTS) devices to relieve transmission network congestion. Specifically, we addressed FACTS that provide Series Compensation (SC) via modification of line inductance. In this manuscript, this heuristic algorithm and its solutions are explored on a number of test cases: a 30-bus test network and a realistically-sized model of the Polish grid (~2700 nodes and ~3300 lines). The results on the 30-bus network are used to study the general properties of the solutions including non-locality and sparsity. The Polish grid is used as a demonstration of the computational efficiency of the heuristics that leverages sequential linearization of power flow constraints and cutting plane methods that take advantage of the sparse nature of the SC placement solutions. Using these approaches, the algorithm is able to solve an instance of Polish grid in tens of seconds. We explore the utility of the algorithm by analyzing transmission networks congested by (a) uniform load growth, (b) multiple overloaded configurations, and (c) sequential generator retirements

25 ENERGY STORAGE↗

Differentiable McCormick relaxations

McCormick's classical relaxation technique constructs closed-form convex and concave relaxations of compositions of simple intrinsic functions. These relaxations have several properties which make them useful for lower bounding problems in global optimization: they can be evaluated automatically, accurately, and computationally inexpensively, and they converge rapidly to the relaxed function as the underlying domain is reduced in size. They may also be adapted to yield relaxations of certain implicit functions and differential equation solutions. However, McCormick's relaxations may be nonsmooth, and this nonsmoothness can create theoretical and computational obstacles when relaxations are to be deployed. This article presents a continuously differentiable variant of McCormick's original relaxations in the multivariate McCormick framework of Tsoukalas and Mitsos. Gradients of the new differentiable relaxations may be computed efficiently using the standard forward or reverse modes of automatic differentiation. Furthermore, extensions to differentiable relaxations of implicit functions and solutions of parametric ordinary differential equations are discussed. A C++ implementation based on the library MC++ is described and applied to a case study in nonsmooth nonconvex optimization.

97 MATHEMATICS AND COMPUTING↗

Higher-order modification of Steffensen’s method for solving system of nonlinear equations

In this work, we propose a higher-order derivative free family for solving non-linear systems. The local order of convergence of the constructed family is first determined using first-order divided difference operators for functions of several variables and direct computation by Taylor’s series expansion. Computational efficiencies of the developed scheme is considered and compared with their closest competitors. Moreover, numerical experiments are performed on several large and complex non-linear systems. The results are found to be effective and comparable to other existing methods which also support the theoretical results.

97 MATHEMATICS AND COMPUTING↗

On the growth constant for square-lattice self-avoiding walks

The growth constant for two-dimensional self-avoiding walks on the honeycomb lattice was conjectured by Nienhuis in 1982, and since that time the corresponding results for the square and triangular lattices have been sought. For the square lattice, a possible conjecture was advanced by one of us (AJG) more than 20 years ago, based on the six significant digit estimate available at the time. This estimate has improved by a further six digits over the intervening decades, and the conjectured value continued to agree with the increasingly precise estimates. Here, we discuss the three most successful methods for estimating the growth constant, including the most recently developed topological transfer-matrix method, due to another of us (JLJ). We show this to be the most computationally efficient of the three methods, and by parallelising the algorithm we have estimated the growth constant significantly more precisely, incidentally ruling out the conjecture, which fails in the 12th digit. Our new estimate of the growth constant is μ(square) = 2.63815853032790 (3).

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Verification of a specialized hydrodynamic simulation code for modeling deflagration and detonation of high explosives

A specialized hydrodynamic simulation code has been developed and verified for the simulation of one-dimensional unsteady problems involving the detonation and deflagration of high explosives. To model all the relevant physical processes in these problems, a code is required to simulate compressible hydrodynamics, unsteady thermal conduction, and chemical reactions with complex rate laws. Several verification exercises are presented which test the implementation of these capabilities. The code also requires models for physics processes such as equations of state and conductivity for pure materials and mixtures as well as rate laws for chemical reactions. Additional verification tests are required to ensure that these models are implemented correctly. Though this code is limited in the types of problems it can simulate, its computationally efficient formulation allows it to be used in calibration studies for reactive burn models for high explosives. Furthermore, this study demonstrates how a series of verification tests can be used to ensure that the various physics processes needed to simulate complex phenomenon can be tested to ensure that they are correctly implemented.

97 MATHEMATICS AND COMPUTING↗

Compositional Methods for Schrödinger's Equation with Application to Optimal Control

The evolution of the state of a quantum computer is governed by Schrödinger's equation. We introduce compositional methods, a way to increase the order of symmetric methods by replacing one timestep by multiple timesteps. We perform several numerical experiments, including a simulation of a two qubit CNOT gate, using compositional variants of Störmer-Verlet and the implicit midpoint rule. We observe that the compositional methods demonstrate greater computational efficiency than the base methods when the desired error tolerance is less than ~ 10 -4 to 10 -5 . We discuss the trade-offs of using each compositional method, as well as differences between using Störmer-Verlet or the implicit midpoint rule as the base integrator of the compositional methods.

97 MATHEMATICS AND COMPUTING↗

A dual mesh method with adaptivity for stress-constrained topology optimization

This paper is concerned with the topological optimization of elastic structures, with the goal of minimizing the compliance and/or mass of the structure, subject to a stress constraint. It is well known that depending upon the geometry and the loading conditions, the stress field can exhibit singularities, if these singularities are not adequately resolved, the topological optimization process will be ineffective. For computational efficiency, adaptive mesh refinement is required to adequately resolve the stress field. This poses a challenge for the traditional Solid Isotropic Material with Penalization (SIMP) method that employs a one-to-one correspondence between the finite element mesh and the optimization design variables because as the mesh is refined, the optimization process must somehow be re-started with a new set of design variables. The proposed solution here is a dual mesh approach, one finite element mesh defines the material distribution, a second finite element mesh is used for the computation of the displacement and stress fields. This allows for stress-based adaptive mesh refinement without modifying the definition of the optimization design variables. A second benefit of this dual mesh approach is that there is no need to apply a filter to the design variables to enforce a length scale, instead the length scale is determined by the design mesh. This reduces the number of design variables and allows the designer to apply spatially varying length scale if desired. The efficacy of this dual mesh approach is established via several stress-constrained topology optimization problems.

36 MATERIALS SCIENCE↗

Model-Free Dynamic Voltage Control of Distributed Energy Resource (DER)-Based Microgrids

In this paper, we present a new control technique for sustaining dynamic voltage stability by effective reactive power control and coordination of distributed energy resources (DERs) in microgrids. The proposed control technique is based on model-free control (MFC), which has shown successful operation and improved performance in different domains and applications. This paper presents its first use in the voltage stability of a microgrid setting employing multiple synchronous generator (SG)-based and power electronic (PE)-based DERs. MFC is a computationally efficient, data-driven control technique that does not require modelling of the different components and disturbances in the power system. It is utilized as an online controller to achieve the dynamic voltage stability of a microgrid system under different disturbances and fault conditions. A 21-bus microgrid system fed by multiple DERs is considered as a case study and the overall dynamic voltage stability is investigated using time-domain dynamic simulations. Numerical results show that the proposed MFC provides improvements on the dynamic load bus voltage profiles and requires less computational time as compared to the traditional enhanced microgrid voltage stabilizer (EMGVS) scheme. Due to its simplicity and low computational requirement, MFC can be easily implemented in resource-constrained computing devices such as smart inverters.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Flow field analysis for a class of waverider configurations

A package of computer codes for analysis of flow fields for waverider configurations is described. The package consists of a surface/volume grid generator and a finite-volume flow solver. The grid generator defines body geometries and computational grids by an algebraic homotopy procedure. The algebraic procedure is versatile in its application and can readily generate configurations in the class of blended wing-body geometries. This code has the ability to produce a wide variety of geometries in the given class with varying geometrical attributes. The flow solver employs a finite-volume formation and solves the explicit, Runge-Kutta integration technique. The method or flow simulation incorporates several techniques for acceleration of the convergence of the interaction process and an entropy corrected enthalpy damping procedure for efficient computation of high Mach number flows.

Moitra, Anutosh↗

A Plug-Loads Game Changer: Computer Gaming Energy Efficiency without Performance Compromise

Two-thirds of Americans play computer games. Although among the most complex and energy intensive plug loads, gaming has been largely overlooked in energy research and development and policy. Systems used for computer gaming in California consumed 4.1 terawatt-hours/year in 2016 or $700 million in energy bills, with emissions of 1.5 million tons carbon dioxide equivalent allocated 66 percent to consoles, 31 percent to desktop personal computers, 3 percent to laptops, and less than 1 percent to emerging media streaming devices. Key findings include: • Aggregate energy demand places gaming among the top plug loads in California, with gaming representing one-fifth of the state’s total miscellaneous residential energy use. • Market structure changes could substantially affect statewide energy use; energy demand could rise by 114 percent by 2021 under intensified desktop gaming, or fall by 24 percent given a major shift towards consoles coupled with energy efficiency gains. • Unit energy consumption is remarkably varied across gaming platform types: across 26 systems tested, client-side electricity use ranged from 5 to more than 1,200 kWh per year, reflecting equipment choice and usage patterns. • Some emerging technologies and activities are driving energy demand higher, including processor overclocking, cloud-based gaming, higher-resolution connected displays, and virtual reality gaming. • User behavior influences gaming energy use more than technology choice; duty cycle and game choice are particularly strong drivers of demand. • Energy efficiency opportunities are substantial, about 50 percent on a per-system basis for personal computers and 40 percent for consoles if past rates of improvement continue. While simultaneously quantifying efficiency and gaming performance is problematic, evidence suggests that efficiency can be improved while maintaining or improving user experience. Familiar energy policy strategies can help manage gaming energy demand, although mandatory system-level standards are not promising (component-level measures may be).

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Laser-induced breathing modes in metallic nanoparticles: A symmetric molecular dynamics study

A highly efficient simulation method based on molecular dynamics and group theory is adopted to investigate the laser-induced breathing oscillation of gold and silver nanospheres. Nanoparticles with size ranging from 5.8 to 46.2 nm are discussed. The effect due to laser-induced heating is modeled by a symmetric sudden expansion of the nanospheres by increasing the interatomic distances. A long-range empirical potential model which is capable of describing the phonon dispersion curves of noble metals in the full frequency range is established. Group theory is fully exploited to increase the computation efficiency, and the oscillation behavior of nanospheres of over 3 x 10{sup 6} atoms can be simulated efficiently. Oscillation frequencies of nanospheres are obtained by calculating the Fourier transform of the velocity autocorrelation function. The breathing modes of nanospheres are identified as the excitation of A{sub 1g} modes with in-phase radial displacement of atoms in the nanospheres. The resulting oscillation spectra are in very good agreement with experimental data.

36 MATERIALS SCIENCE↗