SEARCH · Engineering Papers

Results for “distributed algorithm”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 379 records · Page 21

All sources NASA NTRS DOE OSTI

DOE OSTI2025

Optimal Operation and Impact Assessment of Distributed Wind for Improving Efficiency and Resilience of Rural Electricity Systems

This project aims to empower rural utilities by developing advanced optimization models and algorithms for effectively integrating distributed wind energy alongside battery storage and other distributed energy resources (DERs). The primary objectives are to reduce peak demand, ensure reliable emergency power supply, and regulate voltage and frequency. To address operational challenges, the project introduces innovative mitigation strategies and ultrafast assessment frameworks to evaluate the impacts of distributed wind and DERs on rural grids, offering actionable solutions to potential issues. Economic viability is assessed through cost-benefit analysis using real rural utility data, ensuring the practical application of the project outcomes.

17 WIND ENERGY↗

DOE OSTI2022

Physics-assisted generative adversarial network for X-ray tomography

X-ray tomography is capable of imaging the interior of objects in three dimensions non-invasively, with applications in biomedical imaging, materials science, electronic inspection, and other fields. The reconstruction process can be an ill-conditioned inverse problem, requiring regularization to obtain satisfactory results. Recently, deep learning has been adopted for tomographic reconstruction. Unlike iterative algorithms which require a distribution that is known a priori , deep reconstruction networks can learn a prior distribution through sampling the training distributions. In this work, we develop a Physics-assisted Generative Adversarial Network (PGAN), a two-step algorithm for tomographic reconstruction. In contrast to previous efforts, our PGAN utilizes maximum-likelihood estimates derived from the measurements to regularize the reconstruction with both known physics and the learned prior. Compared with methods with less physics assisting in training, PGAN can reduce the photon requirement with limited projection angles to achieve a given error rate. The advantages of using a physics-assisted learned prior in X-ray tomography may further enable low-photon nanoscale imaging.

47 OTHER INSTRUMENTATION↗

NASA NTRS2009

Overview of Figure of Merit Analyses of Simulants and the Fit-to-Use Matrix

This slide slide presentation reviews the lunar regolith simulants and presents a comparison of the different types and their uses. Figures of Merit (FoM) algorithms have been developed to quantitatively compare the distributions in different granular materials. These algorithms have been used to compare the different lunar regolith simulants to the Apollo 16 reference material for composition and particle size distribution. The results of this comparison of the various forms of lunar regolith simulants are examined.

Schrader, Christian M.↗

DOE OSTI2022

Performance Evaluation of Peer-to-Peer Distributed Microgrids Coordination for Voltage Regulation

This paper presents the performance evaluation of a peer-to-peer microgrids coordination algorithm for sub-transmission systems. As distributed energy resources (DERs) in distribution system start to show negative impact to the bulk power system, a paradigm shift is needed for transmission planning and operation. Because distribution substations are located far from the sub-transmission system, and it is hard to use traditional centralized control for real-time control and coordination. Thus, distributed control is a natural choice because it requires less communication and central computation. In this paper, each distribution substation is treated as a microgrid, and the peer-to-peer distributed microgrids control is formulated as a real-time optimal power flow problem to reduce the negative impact in sub-transmission systems. A distributed primal-dual optimization algorithm is adopted to solve the problem. Validation of the peer-to-peer algorithm is performed through the simulation of a real-world sub-transmission system composing of many distribution systems with high renewable penetration. Simulation results show that the peer-to-peer algorithm can achieve satisfactory performance (e.g., voltage regulation) in sub-transmission system by coordinating and controlling DERs in distribution systems.

distributed control↗

DOE OSTI2025

Clustering at Massive Scale

ClaMS provides hierarchical clustering technology for use on massive, high-dimensional datasets that require distributed memory for processing. The algorithm employed is inspired by the popular HDBSCAN algorithm but makes use of computational kernels better suited for distributed computing. ClaMS is built on scalable nearest neighbor graph construction, metric forest completion, and approximate minimum spanning tree techniques.

Stanley, ThomasA [Lawrence Livermore National Labo↗

DOE OSTI2022

Performance Evaluation of Peer-to-Peer Distributed Microgrids Coordination for Voltage Regulation: Preprint

distributed control↗

DOE OSTI2026

Particle Tracking Methods for Battery Precipitation Reactions

Precipitation and deposition reactions at solid–liquid interfaces play a key role in a number of battery chemistries, including Li-ion, so-called “anode free” batteries, zinc-based battery chemistries, and lithium–sulfur, among others. Although models with heterogeneous nucleation and growth phenomena are present in the literature, papers have not to date provided much detail on the numerical algorithms used to track the temporal evolution of the particle size distribution of deposits on electrode surfaces. In this paper we examine several approaches to discretize and track the particle size distribution, demonstrating that common approaches lead to anomalous flattening of the particle size distribution. We conclude by presenting an algorithm that preserves the appropriate particle size distribution during particle growth.

Algorithms↗

DOE OSTI2026

Beam loss modeling and mitigation due to intra-beam stripping

Intra-Beam Stripping (IBS) is a critical beam loss mechanism in high-intensity H- linacs and presents a significant limitation to increasing beam power. This work presents a computational framework to evaluate and mitigate IBS-induced beam loss along the Spallation Neutron Source (SNS) LINAC. Our calculation is based on an analytic theory and involves evaluation of a 9D integral using the Monte-Carlo technique. We first benchmarked our calculations against simplified, analytically solvable cases. We then applied our algorithm to Gaussian bunches with a known probability density function (PDF). We next expanded our algorithm to arbitrary bunch distributions using the Neural Spline Flow (NSF) models trained on PyORBIT tracking data. In the future, we plan to validate our algorithm experimentally and apply it to design IBS mitigation strategies.

Nln, Shivam [ORNL]↗

NASA NTRS1991

Structural factoring approach for analyzing stochastic networks

The problem of finding the distribution of the shortest path length through a stochastic network is investigated. A general algorithm for determining the exact distribution of the shortest path length is developed based on the concept of conditional factoring, in which a directed, stochastic network is decomposed into an equivalent set of smaller, generally less complex subnetworks. Several network constructs are identified and exploited to reduce significantly the computational effort required to solve a network problem relative to complete enumeration. This algorithm can be applied to two important classes of stochastic path problems: determining the critical path distribution for acyclic networks and the exact two-terminal reliability for probabilistic networks. Computational experience with the algorithm was encouraging and allowed the exact solution of networks that have been previously analyzed only by approximation techniques.

Hayhurst, Kelly J.↗

NASA NTRS2009

On Applying the Prognostic Performance Metrics

Prognostics performance evaluation has gained significant attention in the past few years. As prognostics technology matures and more sophisticated methods for prognostic uncertainty management are developed, a standardized methodology for performance evaluation becomes extremely important to guide improvement efforts in a constructive manner. This paper is in continuation of previous efforts where several new evaluation metrics tailored for prognostics were introduced and were shown to effectively evaluate various algorithms as compared to other conventional metrics. Specifically, this paper presents a detailed discussion on how these metrics should be interpreted and used. Several shortcomings identified, while applying these metrics to a variety of real applications, are also summarized along with discussions that attempt to alleviate these problems. Further, these metrics have been enhanced to include the capability of incorporating probability distribution information from prognostic algorithms as opposed to evaluation based on point estimates only. Several methods have been suggested and guidelines have been provided to help choose one method over another based on probability distribution characteristics. These approaches also offer a convenient and intuitive visualization of algorithm performance with respect to some of these new metrics like prognostic horizon and alpha-lambda performance, and also quantify the corresponding performance while incorporating the uncertainty information.

Saxena, Abhinav↗

DOE OSTI2021

TPCPF: Three-Phase Continuation Power Flow Tool for Voltage Stability Assessment of Distribution Networks With Distributed Energy Resources

This article presents a three-phase unbalanced continuation power flow algorithm for voltage stability assessment of distribution systems with high penetration of distributed energy resources (DERs). Analyzing distribution system voltage stability with DER will allow high penetration of renewable energy necessary for the sustainability goals. The developed algorithm can analyze voltage stability for both the meshed and radial systems and the balanced and unbalanced three-phase distribution systems. The developed tool allows the voltage stability analysis to facilitate the planning, operation, control, and distribution system management. The impact of DER on the voltage stability of several test cases has been analyzed considering constant power (P Q) and regulated-voltage (P V ) modes of operation for DER units. Moreover, different voltage stability case studies are presented to demonstrate the impact of unbalance, load increment, and network topology on the maximum loading capacity. Finally, results using the IEEE 13-node feeder, the 18-bus balanced shipboard system, the 13-node CIGRE benchmark system, and the 136-bus redial distribution feeder demonstrate that the developed continuation power flow tool can efficiently perform voltage stability analysis for active distribution systems.

42 ENGINEERING↗

NASA NTRS1997

Technical Report Series on Global Modeling and Data Assimilation: Comparison of Satellite Global Rainfall Algorithms - Volume 12

Seventeen months of rainfall data (August 1987-December 1988) from nine satellite rainfall algorithms (Adler, Chang, Kummerow, Prabhakara, Huffman, Spencer, Susskind, and Wu) were analyzed to examine the uncertainty of satellite-derived rainfall estimates. The variability among algorithms, measured as the standard deviation computed from the ensemble of algorithms, shows regions of high algorithm variability tend to coincide with regions of high rain rates. Histograms of pattern correlation (PC) between algorithms suggest a bimodal distribution, with separation at a PC-value of about 0.85. Applying this threshold as a criteria for similarity, our analyses show that algorithms using the same sensor or satellite input tend to be similar, suggesting the dominance of sampling errors in these satellite estimates.

Suarez, Max J.↗

NASA NTRS2012

Wavespace-Based Coherent Deconvolution

Array deconvolution is commonly used in aeroacoustic analysis to remove the influence of a microphone array's point spread function from a conventional beamforming map. Unfortunately, the majority of deconvolution algorithms assume that the acoustic sources in a measurement are incoherent, which can be problematic for some aeroacoustic phenomena with coherent, spatially-distributed characteristics. While several algorithms have been proposed to handle coherent sources, some are computationally intractable for many problems while others require restrictive assumptions about the source field. Newer generalized inverse techniques hold promise, but are still under investigation for general use. An alternate coherent deconvolution method is proposed based on a wavespace transformation of the array data. Wavespace analysis offers advantages over curved-wave array processing, such as providing an explicit shift-invariance in the convolution of the array sampling function with the acoustic wave field. However, usage of the wavespace transformation assumes the acoustic wave field is accurately approximated as a superposition of plane wave fields, regardless of true wavefront curvature. The wavespace technique leverages Fourier transforms to quickly evaluate a shift-invariant convolution. The method is derived for and applied to ideal incoherent and coherent plane wave fields to demonstrate its ability to determine magnitude and relative phase of multiple coherent sources. Multi-scale processing is explored as a means of accelerating solution convergence. A case with a spherical wave front is evaluated. Finally, a trailing edge noise experiment case is considered. Results show the method successfully deconvolves incoherent, partially-coherent, and coherent plane wave fields to a degree necessary for quantitative evaluation. Curved wave front cases warrant further investigation. A potential extension to nearfield beamforming is proposed.

Bahr, Christopher J.↗

NASA NTRS1996

Research in Parallel Algorithms and Software for Computational Aerosciences

Phase I is complete for the development of a Computational Fluid Dynamics parallel code with automatic grid generation and adaptation for the Euler analysis of flow over complex geometries. SPLITFLOW, an unstructured Cartesian grid code developed at Lockheed Martin Tactical Aircraft Systems, has been modified for a distributed memory/massively parallel computing environment. The parallel code is operational on an SGI network, Cray J90 and C90 vector machines, SGI Power Challenge, and Cray T3D and IBM SP2 massively parallel machines. Parallel Virtual Machine (PVM) is the message passing protocol for portability to various architectures. A domain decomposition technique was developed which enforces dynamic load balancing to improve solution speed and memory requirements. A host/node algorithm distributes the tasks. The solver parallelizes very well, and scales with the number of processors. Partially parallelized and non-parallelized tasks consume most of the wall clock time in a very fine grain environment. Timing comparisons on a Cray C90 demonstrate that Parallel SPLITFLOW runs 2.4 times faster on 8 processors than its non-parallel counterpart autotasked over 8 processors.

Domel, Neal D.↗

NASA NTRS1996

Research in Parallel Algorithms and Software for Computational Aerosciences

Phase 1 is complete for the development of a computational fluid dynamics CFD) parallel code with automatic grid generation and adaptation for the Euler analysis of flow over complex geometries. SPLITFLOW, an unstructured Cartesian grid code developed at Lockheed Martin Tactical Aircraft Systems, has been modified for a distributed memory/massively parallel computing environment. The parallel code is operational on an SGI network, Cray J90 and C90 vector machines, SGI Power Challenge, and Cray T3D and IBM SP2 massively parallel machines. Parallel Virtual Machine (PVM) is the message passing protocol for portability to various architectures. A domain decomposition technique was developed which enforces dynamic load balancing to improve solution speed and memory requirements. A host/node algorithm distributes the tasks. The solver parallelizes very well, and scales with the number of processors. Partially parallelized and non-parallelized tasks consume most of the wall clock time in a very fine grain environment. Timing comparisons on a Cray C90 demonstrate that Parallel SPLITFLOW runs 2.4 times faster on 8 processors than its non-parallel counterpart autotasked over 8 processors.

Domel, Neal D.↗

NASA NTRS2016

Going the Distance: Mapping Host Galaxies of LIGO and VIRGO Sources in Three Dimensions using Local Cosmography and Targeted Follow-Up

The Advanced Laser Interferometer Gravitational-wave Observatory (LIGO) discovered gravitational waves (GWs) from a binary black hole merger in 2015 September and may soon observe signals from neutron star mergers. There is considerable interest in searching for their faint and rapidly fading electromagnetic (EM) counterparts, though GW position uncertainties are as coarse as hundreds of square degrees. Because LIGO's sensitivity to binary neutron stars is limited to the local universe, the area on the sky that must be searched could be reduced by weighting positions by mass, luminosity, or star formation in nearby galaxies. Since GW observations provide information about luminosity distance, combining the reconstructed volume with positions and redshifts of galaxies could reduce the area even more dramatically. A key missing ingredient has been a rapid GW parameter estimation algorithm that reconstructs the full distribution of sky location and distance. We demonstrate the first such algorithm, which takes under a minute, fast enough to enable immediate EM follow-up. By combining the three-dimensional posterior with a galaxy catalog, we can reduce the number of galaxies that could conceivably host the event by a factor of 1.4, the total exposure time for the Swift X-ray Telescope by a factor of 2, the total exposure time for a synoptic optical survey by a factor of 2, and the total exposure time for a narrow-field optical telescope by a factor of 3. This encourages us to suggest a new role for small field of view optical instruments in performing targeted searches of the most massive galaxies within the reconstructed volumes.

catalogs â€“ galaxies: distances and redshifts â€“↗

NASA NTRSDate not supplied

Bias in Planning Algorithms

Does bias exist in planning algorithms? If so, how does bias manifest, and how important is this bias? Answering this question requires a formal, mathematical definition of bias. We formally define bias as the distance between the probability distributions of solutions returned by various algorithms, and the uniform distribution over solutions. We show in this paper that deterministic algorithms are inherently biased, as they don’t return all solutions, and that this property holds even when algorithms return a set of plans instead of just one plan. Exceptions are problem instances or problem classes for which only a single solution exists. We then discuss changing the definition of bias to compare the probability distributions of properties of sets of plans instead of individual plans. We show the property bias is smaller than the bias of actual plans. Finally, we show that entropy is a proxy for the more complex and more expensive distance measurement between pairs of probability distributions. We then describe a roadmap for future investigations of bias in planning.

Planning Scheduling Algorithms↗

NASA NTRS1987

The impact of circulation control on rotary aircraft controls systems

Application of circulation to rotary wing systems is a new development. Efforts to determine the near and far field flow patterns and to analytically predict those flow patterns have been underway for some years. Rotary wing applications present a new set of challenges in circulation control technology. Rotary wing sections must accommodate substantial Mach number, free stream dynamic pressure and section angle of attack variation at each flight condition within the design envelope. They must also be capable of short term circulation blowing modulation to produce control moments and vibration alleviation in addition to a lift augmentation function. Control system design must provide this primary control moment, vibration alleviation and lift augmentation function. To accomplish this, one must simultaneously control the compressed air source and its distribution. The control law algorithm must therefore address the compressor as the air source, the plenum as the air pressure storage and the pneumatic flow gates or valves that distribute and meter the stored pressure to the rotating blades. Also, mechanical collective blade pitch, rotor shaft angle of attack and engine power control must be maintained.

Kingloff, R. F.↗