Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “algorithmic 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 37 records · Page 2

An efficient algorithm for estimating noise covariances in distributed systems

An efficient computational algorithm for estimating the noise covariance matrices of large linear discrete stochatic-dynamic systems is presented. Such systems arise typically by discretizing distributed-parameter systems, and their size renders computational efficiency a major consideration. The proposed adaptive filtering algorithm is based on the ideas of Belanger, and is algebraically equivalent to his algorithm. The earlier algorithm, however, has computational complexity proportional to p to the 6th, where p is the number of observations of the system state, while the new algorithm has complexity proportional to only p-cubed. Further, the formulation of noise covariance estimation as a secondary filter, analogous to state estimation as a primary filter, suggests several generalizations of the earlier algorithm. The performance of the proposed algorithm is demonstrated for a distributed system arising in numerical weather prediction.

Dee, D. P.↗

An accurate and efficient algorithm for detection of radio bursts with an unknown dispersion measure, for single-dish telescopes and interferometers

Astronomical radio signals are subjected to phase dispersion while traveling through the interstellar medium. To optimally detect a short-duration signal within a frequency band, we have to precisely compensate for the unknown pulse dispersion, which is a computationally demanding task. We present the “fast dispersion measure transform” algorithm for optimal detection of such signals. Our algorithm has a low theoretical complexity of 2N{sub f}N{sub t}+N{sub t}N{sub Δ}log{sub 2}(N{sub f}), where N{sub f}, N{sub t}, and N{sub Δ} are the numbers of frequency bins, time bins, and dispersion measure bins, respectively. Unlike previously suggested fast algorithms, our algorithm conserves the sensitivity of brute-force dedispersion. Our tests indicate that this algorithm, running on a standard desktop computer and implemented in a high-level programming language, is already faster than the state-of-the-art dedispersion codes running on graphical processing units (GPUs). We also present a variant of the algorithm that can be efficiently implemented on GPUs. The latter algorithm’s computation and data-transport requirements are similar to those of a two-dimensional fast Fourier transform, indicating that incoherent dedispersion can now be considered a nonissue while planning future surveys. We further present a fast algorithm for sensitive detection of pulses shorter than the dispersive smearing limits of incoherent dedispersion. In typical cases, this algorithm is orders of magnitude faster than enumerating dispersion measures and coherently dedispersing by convolution. We analyze the computational complexity of pulsed signal searches by radio interferometers. We conclude that, using our suggested algorithms, maximally sensitive blind searches for dispersed pulses are feasible using existing facilities. We provide an implementation of these algorithms in Python and MATLAB.

79 ASTRONOMY AND ASTROPHYSICS↗

Probe corrected far-field reconstruction from measurements on a cylinder: A novel formulation and efficient algorithm

A novel and numerically efficient method of far field evaluation from measurements taken on a cylinder is based on the representation of both the antenna and the probe fields as superpositions of plane waves. A system of two integral equations are established whose unknown functions are the azimuthal and elevation components of the antenna pattern and whose known terms are the set of measurement data taken with two different probes - the second probe in most practical instances being simply the same probe with a different geometrical orientation. The equations express the known data - for each angular position of the antenna under measurement - as the integrals of the products of the corresponding components of the unknown antenna and known probe patterns multiplied by a phase term. The convolutional nature of the integral equations makes their solutions straight-forward. If, as is virtually always the case, the probe is small or of moderate size so that the axis of rotation of the antenna mount is in the far field of the probe, the intervention of asymptotic techniques makes the solution numerically very efficient. The agreement of calculated and experimental patterns is excellent.

Borgiotti, G. V.↗

An efficient algorithm for the projection of a point on the intersection of two hyperplanes and a box in $\mathbb {R}^n$

Here, we present an efficient strongly polynomial algorithm for the projection of a point on the intersection of two hyperplanes and a box in \(\mathbb {R}^n\) . Interior point methods are the most efficient algorithm in the literature to solve this problem. While efficient in practice, the complexity of interior-point methods is bounded by a polynomial in the dimension of the problem and in the accuracy of the solution. Moreover, their efficiency is highly dependent on a series of parameters depending on the specific method chosen (especially for nonlinear problems), such as step size, barrier parameter, accuracy, among others. We propose a new method based on the KKT optimality conditions. In this method, we write the problem as a function of the Lagrangian multipliers of the hyperplanes and seek to find the pair of multipliers that corresponds to the optimal solution. We prove that the algorithm has complexity \(O(n^2 \log n)\) .

42 ENGINEERING↗

Scalable and Memory-Efficient Algorithms for Controlling Networked Epidemic Processes Using Multiplicative Weights Update Method

We study the problem of designing scalable algorithms to find effective intervention strategies for controlling stochastic epidemic processes on networks. This is a common problem arising in agent based models for epidemic spread. Previous approaches to this problem focus on either heuristics with no guarantees or approximation algorithms that scale only to networks corresponding to county-sized populations, typically, with less than a million nodes. In particular, the mathematical-programming based approaches need to solve the Linear Program (LP) relaxation of the problem using an LP solver, which restricts the scalability of this approach. In this work, we overcome this restriction by designing an algorithm that adapts the multiplicative weights update (MWU) framework, along with the sample average approximation (SAA) technique, to approximately solve the linear program (LP) relaxation for the problem. To scale this approach further, we provide a memory-efficient algorithm that enables scaling to large networks, corresponding to country-size populations, with over 300 million nodes and 30 billion edges. Furthermore, we show that this approach provides near-optimal solutions to the LP in practice.

Sambaturu, Prathyush↗

Accuracies of three computationally efficient algorithms for computing atmospheric transmittances

Three algorithms for calculating polychromatic atmospheric transmittance functions have been tested using a set of eleven distinct temperature profiles in order to compare transmittance accuracies achievable by the three methods. The comparison of rms errors demonstrates that the iterative method of McMillin and Fleming (1976) is the most accurate of the efficient algorithms currently available for gases with constant mixing ratios; its accuracy approaches that of the spectroscopic parameters and the computational approximations used in the ground-truth line-by-line calculations. The method of Arking et al. (1974), while less accurate, has the advantage of being perfectly general and easily adapted to cases where spectral bandwidths are varied

Mcmillin, L. M.↗

Chance-Constrained AC Optimal Power Flow: Reformulations and Efficient Algorithms

Higher levels of renewable electricity generation increase uncertainty in power system operation. To ensure secure system operation, new tools that account for this uncertainty are required. Here, in this paper, we adopt a chance-constrained AC optimal power flow formulation, which guarantees that generation, power flows and voltages remain within their bounds with a pre-defined probability. We then discuss different chance-constraint reformulations and solution approaches for the problem. Additionally, we first discuss an analytical reformulation based on partial linearization, which enables us to obtain a tractable representation of the optimization problem. We then provide an efficient algorithm based on an iterative solution scheme which alternates between solving a deterministic AC OPF problem and assessing the impact of uncertainty. This more flexible computational framework enables not only scalable implementations, but also alternative chance-constraint reformulations. In particular, we suggest two sample based reformulations that do not require any approximation or relaxation of the AC power flow equations.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Efficient algorithms for dilated mappings of binary trees

The problem is addressed to find a 1-1 mapping of the vertices of a binary tree onto those of a target binary tree such that the son of a node on the first binary tree is mapped onto a descendent of the image of that node in the second binary tree. There are two natural measures of the cost of this mapping, namely the dilation cost, i.e., the maximum distance in the target binary tree between the images of vertices that are adjacent in the original tree. The other measure, expansion cost, is defined as the number of extra nodes/edges to be added to the target binary tree in order to ensure a 1-1 mapping. An efficient algorithm to find a mapping of one binary tree onto another is described. It is shown that it is possible to minimize one cost of mapping at the expense of the other. This problem arises when designing pipelined arithmetic logic units (ALU) for special purpose computers. The pipeline is composed of ALU chips connected in the form of a binary tree. The operands to the pipeline can be supplied to the leaf nodes of the binary tree which then process and pass the results up to their parents. The final result is available at the root. As each new application may require a distinct nesting of operations, it is useful to be able to find a good mapping of a new binary tree over existing ALU tree. Another problem arises if every distinct required binary tree is known beforehand. Here it is useful to hardwire the pipeline in the form of a minimal supertree that contains all required binary trees.

Iqbal, M. Ashraf↗

Efficient Algorithms for Convolutional Sparse Representations

When applying sparse representation techniques to images, the standard approach is to independently compute the representations for a set of overlapping image patches. This method performs very well in a variety of applications, but results in a representation that is multi-valued and not optimized with respect to the entire image. Additionally, an alternative representation structure is provided by a convolutional sparse representation, in which a sparse representation of an entire image is computed by replacing the linear combination of a set of dictionary vectors by the sum of a set of convolutions with dictionary filters. The resulting representation is both single-valued and jointly optimized over the entire image. While this form of a sparse representation has been applied to a variety of problems in signal and image processing and computer vision, the computational expense of the corresponding optimization problems has restricted application to relatively small signals and images. Here, this paper presents new, efficient algorithms that substantially improve on the performance of other recent methods, contributing to the development of this type of representation as a practical tool for a wider range of problems.

97 MATHEMATICS AND COMPUTING↗

A Computationally Efficient Algorithm for Sampling the Rudd Differential Cross Section

Monte Carlo radiation transport codes such as RITRACKS or Geant4 are used to simulate the interaction of ions with matter. These codes rely on sampling algorithms to determine interactions and various physical properties of particles involved in the simulations. It is crucial to develop efficient sampling algorithms since Monte Carlo radiation transport simulations can be time consuming. This work presents an efficient sampling algorithm to determine the energy of secondary electrons following ion-water interactions. The applicability and intended use of the algorithm are discussed in detail, and it is shown that the new algorithm is up to 6X10 4 times faster than the method currently used in Geant4-DNA.

Floriane Poignant↗

Scalable and efficient algorithms for the propagation of uncertainty from data through inference to prediction for large-scale problems, with application to flow of the Antarctic ice sheet

The majority of research on efficient and scalable algorithms in computational science and engineering has focused on the forward problem : given parameter inputs, solve the governing equations to determine output quantities of interest. In contrast, in this paper, we consider the broader question: given a (large-scale) model containing uncertain parameters, (possibly) noisy observational data, and a prediction quantity of interest, how do we construct efficient and scalable algorithms to (1) infer the model parameters from the data (the deterministic inverse problem ), (2) quantify the uncertainty in the inferred parameters (the Bayesian inference problem), and (3) propagate the resulting uncertain parameters through the model to issue predictions with quantified uncertainties (the forward uncertainty propagation problem )? We present efficient and scalable algorithms for this end-to-end, data-to-prediction process under the Gaussian approximation and in the context of modeling the flow of the Antarctic ice sheet and its effect on loss of grounded ice to the ocean. The ice is modeled as a viscous, incompressible, creeping, shear-thinning fluid. The observational data come from satellite measurements of surface ice flow velocity, and the uncertain parameter field to be inferred is the basal sliding parameter, represented by a heterogeneous coefficient in a Robin boundary condition at the base of the ice sheet. The prediction quantity of interest is the present-day ice mass flux from the Antarctic continent to the ocean. We show that the work required for executing this data-to-prediction process—measured in number of forward (and adjoint) ice sheet model solves—is independent of the state dimension, parameter dimension, data dimension, and the number of processor cores. The key to achieving this dimension independence is to exploit the fact that, despite their large size, the observational data typically provide only sparse information on model parameters. This property can be exploited to construct a low rank approximation of the linearized parameter-to-observable map via randomized SVD methods and adjoint-based actions of Hessians of the data misfit functional.

54 ENVIRONMENTAL SCIENCES↗

Efficient algorithm for approximating one-dimensional ground states

The density-matrix renormalization-group method is very effective at finding ground states of one-dimensional (1D) quantum systems in practice, but it is a heuristic method, and there is no known proof for when it works. In this article we describe an efficient classical algorithm which provably finds a good approximation of the ground state of 1D systems under well-defined conditions. More precisely, our algorithm finds a matrix product state of bond dimension D whose energy approximates the minimal energy such states can achieve. The running time is exponential in D, and so the algorithm can be considered tractable even for D, which is logarithmic in the size of the chain. The result also implies trivially that the ground state of any local commuting Hamiltonian in 1D can be approximated efficiently; we improve this to an exact algorithm.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An efficient algorithm for choosing scattering directions in Monte Carlo work with arbitrary phase functions

This paper describes an efficient Monte Carlo algorithm for choosing a new direction of a photon after a scattering interaction. The algorithm chooses a scattering angle by linear interpolation in a table of the inverse cumulative scattering probability. A Legendre expansion of the phase function makes it easy to apply Clenshaw's algorithm to build the interpolation table. The points in the table are close enough together that linear interpolation is accurate. With a table of 100,000 entries, we can keep the absolute and relative errors in matching the probability distribution below 10(exp -5).

Barkstrom, Bruce R.↗

Efficient Algorithm for Rectangular Spiral Search

An algorithm generates grid coordinates for a computationally efficient spiral search pattern covering an uncertain rectangular area spanned by a coordinate grid. The algorithm does not require that the grid be fixed; the algorithm can search indefinitely, expanding the grid and spiral, as needed, until the target of the search is found. The algorithm also does not require memory of coordinates of previous points on the spiral to generate the current point on the spiral.

Brugarolas, Paul↗

Efficient algorithm for generating spectra using line-by-lne methods

A method is presented for efficient generation of spectra using line-by-line approaches. The only approximation is replacing the line shape function with an interpolation procedure, which makes the method independent of the line profile functional form. The resulting computational savings for large number of lines is proportional to the number of frequency points in the spectral range. Therefore, for large-scale problems the method can provide speedups of two orders of magnitude or more. A method was presented to generate line-by-line spectra efficiently. The first step was to replace the explicit calculation of the profile by the Newton divided-differences interpolating polynomial. The second step is to accumulate the lines effectively reducing their number to the number of frequency points. The final step is recognizing the resulting expression as a convolution and amenable to FFT methods. The reduction in computational effort for a configuration-to-configuration transition array with large number of lines is proportional to the number of frequency points. The method involves no approximations except for replacing the explicit profile evaluation by interpolation. Specifically, the line accumulation and convolution are exact given the interpolation procedure. Furthermore, the interpolation makes the method independent of the line profile functional form contrary to other schemes using FFT methods to generate line-by-line spectra but relying on the analytic form of the profile Fourier transform. Finally, the method relies on a uniform frequency mesh. For non-uniform frequency meshes, however, the method can be applied by using a suitable temporary uniform mesh and the results interpolated onto the final mesh with little additional cost.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

A Novel Protection Scheme for Unbalanced Faults in Inverter Dominated Networks: A Computationally Efficient Algorithm for Entry-Level Relays

Microgrids are now a common practice in distribution systems to increase resilience and reliability. However, microgrid protection remains a critical challenge, considering its requirement to operate in both grid connected and islanded, and the variability in fault characteristics under each mode of operation. This paper presents unbalanced power (S unb ) based fault detection algorithm, which considers local voltage and current unbalances to determine faults in the system. S unb is a computationally efficient fault detection algorithm that is suitable for implementation in the programmable logic of entry level protective relays. In addition, the difference in current and voltage unbalance (D n ) is used to determine the fault type. The proposed method demonstrates high sensitivity and selectivity for line-to-ground (LG), line-to-line (LL), and double line-to-ground (LLG) faults, representing the most common faults in distribution systems. It also allows relay coordination with upstream and downstream protection devices in both island and grid connected operation, while preserving grading margins. The same pickup and time multiplier settings of a particular relay for both modes of operation eliminates the need for adaptive settings, which rely on communication networks. Validation was performed with a hardware-in-the-loop (HIL) setup using Typhoon HIL real time simulator interfaced with three entry-level, SEL 751 relays. Results confirmed the algorithm’s ability to discriminate fault conditions, and determine the fault type under both operating modes, maintain fast detection times, and ensure proper protection coordination.

fault classification↗

An efficient algorithm for generating diverse microstructure sets and delineating properties closures

Properties closures delineate the theoretical objective space for materials design problems, allowing designers to make informed trade-offs between competing constraints and target properties. In this paper, we present a new algorithm called hierarchical simplex sampling (HSS) that approximates properties closures more efficiently and faithfully than traditional optimization based approaches. By construction, HSS generates samples of microstructure statistics that span the corresponding microstructure hull. As a result, we also find that HSS can be coupled with synthetic polycrystal generation software to generate diverse sets of microstructures for subsequent mesoscale simulations. Finally, by more broadly sampling the space of possible microstructures, it is anticipated that such diverse microstructure sets will expand our understanding of the influence of microstructure on macroscale effective properties and inform the construction of higher-fidelity mesoscale structure-property models.

36 MATERIALS SCIENCE↗

Design, Development and Testing Plan for Energy Efficiency Algorithms Related to Building-Integrated Cooling, Heating, and Power Systems

Building-integrated cooling, heating and power (CHP) systems are more efficient than conventional systems at providing local power and thermal energy, and favorable fuel prices are bound to spur their increased adoption. It is estimated that the total CHP technical potential in the commercial building sector is approximately 76 GW, but only a small fraction of it is actually deployed. Advanced control and monitoring systems that realize the full potential of these CHP systems can transform this capacity into an asset for both the owner and the grid and also accelerate the adoption of these systems in the building sector. However, to realize the full benefit of the CHP systems, we must ensure persistence of energy efficient operations. It has been demonstrated by several studies that as much as 30% of building energy use is wasted. Much of the waste results from the inability to anticipate load variations (design day vs. non-design day operations; diurnal variation of loads), identify improper operation, and efficiently operate, control and maintain building systems. Moreover, many buildings, even those with adequate control infrastructure, lack knowledgeable staff to operate and maintain energy systems. Operators of buildings with CHP systems will constantly need to make tradeoffs (economic dispatch) between onsite power generation and purchasing power, between onsite heat production from distributed generation versus heating/cooling from conventional systems, and different passive and active load management measures. Much of the inefficiency in the current building operations can be eliminated by use of automated performance monitoring (PM), real-time commissioning verification (CxV) and automated fault detection and diagnostic (AFDD) tools. Automation can help system operators make intelligent decisions. Remote and continuous monitoring of system conditions and performance will enable better management and integration of CHP with existing building systems. Continuous PM, real-time CxV and AFDD could alleviate burdens for operations staff, enhance operations and maintenance (O&M), and improve reliability of building and CHP systems. To address the O&M challenges and to provide a means to maximize the rate-of-return of building-integrated CHP systems, the Building Technologies Office (BTO) within the U.S. Department of Energy’s (DOE’s) Office of Energy Efficiency and Renewable Energy (EERE) initiated a project to design, develop, and field test a VOLTTRON™-based supervisory controller and associated open-source algorithms. These algorithms will ensure real-time optimal operation of a building-integrated CHP system, support electric grid reliability, and lead to achieving the goal of a clean, efficient, reliable and affordable next-generation integrated energy systems. This report lists the components for which PM, real-time CxV and AFDD algorithms will be developed, how the algorithms will be tested, and metrics that will be used to validate the algorithms and easy of deployment. Deployment of these algorithms in the field will result in savings reduction in energy consumption of between 10% and 20%.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗