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 1,657 records · Page 92

Semioptimal practicable algorithmic cooling

Algorithmic cooling (AC) of spins applies entropy manipulation algorithms in open spin systems in order to cool spins far beyond Shannon's entropy bound. Algorithmic cooling of nuclear spins was demonstrated experimentally and may contribute to nuclear magnetic resonance spectroscopy. Several cooling algorithms were suggested in recent years, including practicable algorithmic cooling (PAC) and exhaustive AC. Practicable algorithms have simple implementations, yet their level of cooling is far from optimal; exhaustive algorithms, on the other hand, cool much better, and some even reach (asymptotically) an optimal level of cooling, but they are not practicable. We introduce here semioptimal practicable AC (SOPAC), wherein a few cycles (typically two to six) are performed at each recursive level. Two classes of SOPAC algorithms are proposed and analyzed. Both attain cooling levels significantly better than PAC and are much more efficient than the exhaustive algorithms. These algorithms are shown to bridge the gap between PAC and exhaustive AC. In addition, we calculated the number of spins required by SOPAC in order to purify qubits for quantum computation. As few as 12 and 7 spins are required (in an ideal scenario) to yield a mildly pure spin (60% polarized) from initial polarizations of 1% and 10%, respectively. In the latter case, about five more spins are sufficient to produce a highly pure spin (99.99% polarized), which could be relevant for fault-tolerant quantum computing.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Digraph reliability model processing advances and applications

This paper describes a new algorithm, called SourceDoubls, which efficiently solves for singletons and doubletons of a digraph reliability model. Compared with previous methods, the SourceDoubls algorithm provides up to a two order of magnitude reduction in the amount of time required to solve large digraph models. This significant increase in model solution speed allows complex digraphs containing thousands of nodes to be used as knowledge bases for real time automated monitoring and diagnosis applications. Currently, an application to provide monitoring and diagnosis of the Space Station Freedom Data Management System is under development at NASA/Ames Research Center and NASA/Johnson Space Center. This paper contains an overview of this system and provides details of how it will use digraph models processed by the SourceDoubls algorithm to accomplish its task.

Iverson, D. L.↗

A high-speed, high-efficiency phase controller for coherent beam combining based on SPGD algorithm

A phase controller for coherent beam combining (CBC) of fibre lasers has been designed and manufactured based on a stochastic parallel gradient descent (SPGD) algorithm and a field programmable gate array (FPGA). The theoretical analysis shows that the iteration rate is higher than 1.9 MHz, and the average compensation bandwidth of CBC for 5 or 20 channels is 50 kHz or 12.5 kHz, respectively. The tests show that the phase controller ensures reliable phase locking of lasers: When the phases of five lasers are locked by the improved control strategy with a variable gain, the energy encircled in the target is increased by 23 times than that in the single output, the phase control accuracy is better than λ/20, and the combining efficiency is 92%. (control of laser radiation parameters)

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Analysis of multigrid methods on massively parallel computers: Architectural implications

We study the potential performance of multigrid algorithms running on massively parallel computers with the intent of discovering whether presently envisioned machines will provide an efficient platform for such algorithms. We consider the domain parallel version of the standard V cycle algorithm on model problems, discretized using finite difference techniques in two and three dimensions on block structured grids of size 10(exp 6) and 10(exp 9), respectively. Our models of parallel computation were developed to reflect the computing characteristics of the current generation of massively parallel multicomputers. These models are based on an interconnection network of 256 to 16,384 message passing, 'workstation size' processors executing in an SPMD mode. The first model accomplishes interprocessor communications through a multistage permutation network. The communication cost is a logarithmic function which is similar to the costs in a variety of different topologies. The second model allows single stage communication costs only. Both models were designed with information provided by machine developers and utilize implementation derived parameters. With the medium grain parallelism of the current generation and the high fixed cost of an interprocessor communication, our analysis suggests an efficient implementation requires the machine to support the efficient transmission of long messages, (up to 1000 words) or the high initiation cost of a communication must be significantly reduced through an alternative optimization technique. Furthermore, with variable length message capability, our analysis suggests the low diameter multistage networks provide little or no advantage over a simple single stage communications network.

Matheson, Lesley R.↗

Efficient matrix partitioning for optical computing

Techniques for partitioning optical linear algebra problems to make them amenable to solution using optical processors programmed with simple algorithms are explored. Generalized methods for splitting a linear algebra matrix into a series of submatrices are reviewed, showing that simple forms can be pipelined smoothly and that parallel accumulation can be achieved by beam combining on detectors or by summing electronically. The techniques offer simplified bookkeeping, algorithmic independence, and high efficiency. The computational speed will depend on the number of multiplier-accumulators devoted to the task.

Caulfield, H. J.↗

Sustaining Operational Efficiency of a CHP System

This chapter provides background information on why sustaining operations of combined cooling, heating and power systems is important, provides the algorithms for CHP system performance monitoring and commissioning verification, and concludes with a discussion on how these algorithms can be deployed.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Multi-Pass Sequential Mini-Batch Stochastic Gradient Descent Algorithms for Noise Covariance Estimation in Adaptive Kalman Filtering

Estimation of unknown noise covariances in a Kalman filter is a problem of significant practical interest in a wide array of applications. Although this problem has a long history, reliable algorithms for their estimation were scant, and necessary and sufficient conditions for identifiability of the covariances were in dispute until recently. Necessary and sufficient conditions for covariance estimation and a batch estimation algorithm were presented in our previous study. This paper presents stochastic gradient descent algorithms for noise covariance estimation in adaptive Kalman filters that are an order of magnitude faster than the batch method for similar or better root mean square error. More significantly, these algorithms are applicable to non-stationary systems where the noise covariances can occasionally jump up or down by an unknown magnitude. The computational efficiency of the new algorithms stems from adaptive thresholds for convergence, recursive fading memory estimation of the sample cross-correlations of the innovations, and accelerated stochastic gradient descent algorithms. The comparative evaluation of the proposed methods on a number of test cases demonstrates their computational efficiency and accuracy.

Adaptive Kalman filtering↗

New Directions for Thermoelectrics: A Roadmap from High‐Throughput Materials Discovery to Advanced Device Manufacturing

Thermoelectric materials, which can convert waste heat into electricity or act as solid‐state Peltier coolers, are emerging as key technologies to address global energy shortages and environmental sustainability. However, discovering materials with high thermoelectric conversion efficiency is a complex and slow process. The emerging field of high‐throughput material discovery demonstrates its potential to accelerate the development of new thermoelectric materials combining high efficiency and low cost. The synergistic integration of high‐throughput material processing and characterization techniques with machine learning algorithms can form an efficient closed‐loop process to generate and analyze broad datasets to discover new thermoelectric materials with unprecedented performances. Meanwhile, the recent development of advanced manufacturing methods provides exciting opportunities to realize scalable, low‐cost, and energy‐efficient fabrication of thermoelectric devices. This review provides an overview of recent advances in discovering thermoelectric materials using high‐throughput methods, including processing, characterization, and screening. Advanced manufacturing methods of thermoelectric devices are also introduced to realize the broad impacts of thermoelectric materials in power generation and solid‐state cooling. In the end, this article also discusses the future research prospects and directions.

Song, Kaidong↗

SAE2.py : a python script to automate parameter studies using SCREAMER with application to magnetic switching on Z.

The SCREAMER simulation code is widely used at Sandia National Laboratories for designing and simulating pulsed power accelerator experiments on super power accelerators. A preliminary parameter study of Z with a magnetic switching retrofit illustrates the utility of the automating script for optimizing pulsed power designs. SCREAMER is a circuit based code commonly used in pulsed-power design and requires numerous iterations to find optimal configurations. System optimization using simulations like SCREAMER is by nature inefficient and incomplete when done manually. This is especially the case when the system has many interactive elements whose emergent effects may be unforeseeable and complicated. For increased completeness, efficiency and robustness, investigators should probe a suitably confined parameter space using deterministic, genetic, cultural, ant-colony algorithms or other computational intelligence methods. I have developed SAE2 - a user-friendly, deterministic script that automates the search for optima of pulsed-power designs with SCREAMER. This manual demonstrates how to make input decks for SAE2 and optimize any pulsed-power design that can be modeled using SCREAMER. Application of SAE2 to magnetic switching on model of a potential Z refurbishment illustrates the power of SAE2. With respect to the manual optimization, the automated optimization resulted in 5% greater peak current (10% greater energy) and a 25% increase in safety factor for the most highly stressed element.

43 PARTICLE ACCELERATORS↗

Application of Hybrid Genetic Algorithm Routine in Optimizing Food and Bioengineering Processes

Optimization is a crucial step in the analysis of experimental results. Deterministic methods only converge on local optimums and require exponentially more time as dimensionality increases. Stochastic algorithms are capable of efficiently searching the domain space, however convergence is not guaranteed. This article demonstrates the novelty of hybrid genetic algorithm which combines both stochastic and deterministic routine for improved optimization results. A new hybrid genetic algorithm developed is applied to the Ackley benchmark function as well as case studies in foods, biofuels, and biotechnology processes. For each case study the hybrid genetic algorithm found a better optimum candidate than reported by the sources. In the case of food processing the hybrid genetic predicted 5% higher anthocyanin yield. Optimization of bio-oil production using HGA resulted in a 4.73 % higher yield. In enzyme production process HGA predicted 2.18 IU/gds of higher xylanase yield. In conclusion, hybridization of genetic algorithm with a deterministic algorithm resulted in maximum optimum compared to the statistical methods.

09 BIOMASS FUELS↗

End-to-End Network QoS via Scheduling of Flexible Resource Reservation Requests

Modern data-intensive applications move vast amounts of data between multiple locations around the world. To enable predictable and reliable data transfer, next generation networks allow such applications to reserve network resources for exclusive use. In this paper, we solve an important problem (called SMR3) to accommodate multiple and concurrent network reservation requests between a pair of end-sites. Given the varying availability of bandwidth within the network, our goal is to accommodate as many reservation requests as possible while minimizing the total time needed to complete the data transfers. We first prove that SMR3 is an NP-hard problem. Then we solve it by developing a polynomial-time heuristic, called RRA. The RRA algorithm hinges on an efficient mechanism to accommodate large number of requests by minimizing the bandwidth wastage. Finally, via numerical results, we show that RRA constructs schedules that accommodate significantly larger number of requests compared to other, seemingly efficient, heuristics.

97 MATHEMATICS AND COMPUTING↗

Efficiently sampling conformations and pathways using the concurrent adaptive sampling (CAS) algorithm

Molecular dynamics (MD) simulations are useful in obtaining thermodynamic and kinetic properties of bio-molecules but are limited by the timescale barrier, i.e., we may be unable to efficiently obtain properties because we need to run microseconds or longer simulations using femtoseconds time steps. While there are several existing methods to overcome this timescale barrier and efficiently sample thermodynamic and/or kinetic properties, problems remain in regard to being able to sample un- known systems, deal with high-dimensional space of collective variables, and focus the computational effort on slow timescales. Hence, in this work, a new sampling method, called the “Concurrent Adaptive Sampling (CAS) algorithm,” has been developed to tackle these three issues and efficiently obtain conformations and pathways. The method is not constrained to use only one or two collective variables, unlike most reaction coordinate-dependent methods. Instead, it can use a large number of collective vari- ables and uses macrostates (a partition of the collective variable space) to enhance the sampling. The exploration is done by running a large number of short simula- tions, and a clustering technique is used to accelerate the sampling. In this paper, we introduce the new methodology and show results from two-dimensional models and bio-molecules, such as penta-alanine and triazine polymer

59 BASIC BIOLOGICAL SCIENCES↗

Efficient atmospheric, solar, and supernova neutrino propagation through the Earth

Algorithms for computing neutrino oscillation probabilities in sharply varying matter potentials such as the Earth are becoming increasingly important. As the next generation of experiments, DUNE and HyperK as well as the IceCube upgrade and KM3NeT, come online, the computational cost for atmospheric and solar neutrinos will continue to increase. To address these issues, we expand upon our previous algorithm for long-baseline calculations to efficiently handle probabilities through the Earth for atmospheric, nighttime solar, and supernova neutrinos. The algorithm is fast, flexible, and accurate. It can handle arbitrary Earth models with two different schemes for varying density profiles. We also provide a c ++ implementation of the code called NUF ast- E arth along with a detailed user manual. The code intelligently keeps track of repeated calculations and only recalculates what is needed on each successive call which can also help provide significant speed-ups.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

A Stochastic Multi-Criteria Decision-Making Algorithm for Dynamic Load Prioritization in Grid-Interactive Efficient Buildings

Increasing deployment of advanced sensing, controls, and communication infrastructure enables buildings to provide services to the power grid, leading to the concept of grid-interactive efficient buildings. Since occupant activities and preferences primarily drive the availability and operational flexibility of building devices, there is a critical need to develop occupant-centric approaches that prioritize devices for providing grid services, while maintaining the desired end-use quality of service. In this paper, we present a decision-making framework that facilitates a building owner/operator to effectively prioritize loads for curtailment service under uncertainties, while minimizing any adverse impact on the occupants. The proposed framework uses a stochastic (Markov) model to represent the probabilistic behavior of device usage from power consumption data, and a load prioritization algorithm that dynamically ranks building loads using a stochastic multi-criteria decision-making algorithm. The proposed load prioritization framework is illustrated via numerical simulations in a residential building use-case, including plug-loads, air-conditioners, and plug-in electric vehicle chargers, in the context of load curtailment as a grid service. Suitable metrics are proposed to evaluate the closed-loop performance of the proposed prioritization algorithm under various scenarios and design choices. Scalability of the proposed algorithm is established via computational analysis, while time-series plots are used for intuitive explanation of the ranking choices.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Iterative Nonlinear Tikhonov Algorithm with Constraints for Electromagnetic Tomography

Low frequency electromagnetic tomography such as the capacitance tomography (ECT) has been proposed for monitoring and mass-gauging of gas-liquid two-phase system under microgravity condition in NASA's future long-term space missions. Due to the ill-posed inverse problem of ECT, images reconstructed using conventional linear algorithms often suffer from limitations such as low resolution and blurred edges. Hence, new efficient high resolution nonlinear imaging algorithms are needed for accurate two-phase imaging. The proposed Iterative Nonlinear Tikhonov Regularized Algorithm with Constraints (INTAC) is based on an efficient finite element method (FEM) forward model of quasi-static electromagnetic problem. It iteratively minimizes the discrepancy between FEM simulated and actual measured capacitances by adjusting the reconstructed image using the Tikhonov regularized method. More importantly, it enforces the known permittivity of two phases to the unknown pixels which exceed the reasonable range of permittivity in each iteration. This strategy does not only stabilize the converging process, but also produces sharper images. Simulations show that resolution improvement of over 2 times can be achieved by INTAC with respect to conventional approaches. Strategies to further improve spatial imaging resolution are suggested, as well as techniques to accelerate nonlinear forward model and thus increase the temporal resolution.

Xu, Feng↗

An Object-Oriented Collection of Minimum Degree Algorithms: Design, Implementation, and Experiences

The multiple minimum degree (MMD) algorithm and its variants have enjoyed 20+ years of research and progress in generating fill-reducing orderings for sparse, symmetric positive definite matrices. Although conceptually simple, efficient implementations of these algorithms are deceptively complex and highly specialized. In this case study, we present an object-oriented library that implements several recent minimum degree-like algorithms. We discuss how object-oriented design forces us to decompose these algorithms in a different manner than earlier codes and demonstrate how this impacts the flexibility and efficiency of our C++ implementation. We compare the performance of our code against other implementations in C or Fortran.

Kumfert, Gary↗

Second-order p-iterative solution of the Lambert/Gauss problem

An algorithm is presented for efficient p-iterative solution of the Lambert/Gauss orbit-determination problem using second-order Newton iteration. The algorithm is based on a universal transformation of Kepler's time-of-flight equation and approximate inverse solutions of this equation for short-way and long-way flight paths. The approximate solutions provide both good starting values for iteration and simplified computation of the second-order term in the iteration formula. Numerical results are presented which indicate that in many cases of practical significance (except those having collinear position vectors) the algorithm produces at least eight significant digits of accuracy with just two or three steps of iteration.

Boltz, F. W.↗

Real-Time Radiological Source Term Estimation for Multiple Sources in Cluttered Environments

A particle filter algorithm is presented to estimate the position, strength, and cardinality of an unknown number of radioactive point sources in an obstacle-rich environment using count measurements. The algorithm addresses gaps in the prior literature by incorporating two novel elements. The first is a precomputation step in which local terrain and obstacle data is processed to compute attenuation kernels throughout the search area. This enables rapid estimation performance in obstacle-rich environments as measurements are gathered. The second novel feature is a dynamic particle allocation technique in which the number of particles is adjusted in real time to meet convergence goals. This feature allows the algorithm to scale more efficiently to scenarios with a larger number of sources. A series of computational experiments using simulated data demonstrates the algorithm’s performance in a cluttered environment with up to eight sources.

Kemp, Samuel↗