Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “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.

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

At least 721 records · Page 40
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Iterated projected position algorithm for constructing exponentially localized generalized Wannier functions for periodic and nonperiodic insulators in two dimensions and higher

Localized bases play an important role in understanding electronic structure. In periodic insulators, a natural choice of localized basis is given by the Wannier functions which depend on a choice of unitary transform known as a gauge transformation. Over the past few decades, there have been many works that have focused on optimizing the choice of the gauge so that the corresponding Wannier functions are maximally localized or reflect some symmetry of the underlying system. In this work, we consider fully nonperiodic materials where the usual Wannier functions are not well defined and gauge optimization is impractical. To tackle the problem of calculating exponentially localized generalized Wannier functions in both periodic and nonperiodic systems, we discuss the ‘iterated projected position (IPP)” algorithm. Here, the IPP algorithm is based on matrix diagonalization and therefore unlike optimization-based approaches, it does not require initialization and cannot get stuck at a local minimum. Furthermore, the IPP algorithm is guaranteed by a rigorous analysis to produce exponentially localized functions under certain mild assumptions. We numerically demonstrate that the IPP algorithm can be used to calculate exponentially localized bases for the Haldane model, the Kane-Mele model (in both Z 2 invariant even and Z 2 invariant odd phases), and the p x + ip y model on a quasicrystal lattice.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2020

Simulating pitch angle scattering using an explicitly solvable energy-conserving algorithm

Particle distribution functions evolving under the Lorentz operator can be simulated with the Langevin equation for pitch angle scattering. This approach is frequently used in particle based Monte-Carlo simulations of plasma collisions, among others. However, most numerical treatments do not guarantee energy conservation, which may lead to unphysical artifacts such as numerical heating and spectra distortions. In this paper, we present a novel structure-preserving numerical algorithm for the Langevin equation for pitch angle scattering. Similar to the well-known Boris algorithm, the proposed numerical scheme takes advantage of the structure-preserving properties of the Cayley transform when calculating the velocity-space rotations. The resulting algorithm is explicitly solvable, while preserving the norm of velocities down to machine precision. We demonstrate that the method has the same order of numerical convergence as the traditional stochastic Euler-Maruyama method. The numerical scheme is benchmarked by simulating the pitch angle scattering of a particle beam, and comparing with the analytical solution. Benchmark results show excellent agreement with theoretical predictions, showcasing the remarkable long time accuracy of the proposed algorithm.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2025

Metriplectic four-bracket algorithm for constructing thermodynamically consistent dynamical systems

A unified thermodynamic algorithm is presented for constructing thermodynamically consistent dynamical systems, i.e., systems that have Hamiltonian and dissipative parts that conserve energy while producing entropy. The algorithm is based on the metriplectic 4-bracket given in Morrison and Updike [Phys. Rev. E 109, 045202 (2024)]. A feature of the unified thermodynamic algorithm is the force-flux relation 𝐉 𝛼 =−𝐿 𝛼⁢𝛽 𝛁(𝛿⁢𝐻⁡/𝛿⁢𝜉 𝛽 ) for phenomenological coefficients 𝐿 𝛼⁢𝛽 , Hamiltonian 𝐻, and dynamical variables 𝜉 𝛽 . The algorithm is applied to the Navier-Stokes-Fourier, the Cahn-Hilliard-Navier-Stokes, and Brenner-Navier-Stokes-Fourier systems, and significant generalizations of these systems are obtained.

Multiphase flows↗
DOE OSTI2025

Nonvariational ADAPT algorithm for quantum simulations

We explore a nonvariational quantum state preparation approach combined with the ADAPT operator selection strategy in the application of preparing the ground state of a desired target Hamiltonian. In this algorithm, energy gradient measurements determine both the operators and the gate parameters in the quantum circuit construction. We compare this nonvariational algorithm with ADAPT-VQE and with feedback-based quantum algorithms in terms of the rate of energy reduction, the circuit depth, and the measurement cost in molecular simulation. We find that, despite using deeper circuits, this new algorithm reaches chemical accuracy at a similar measurement cost to ADAPT-VQE. Since it does not rely on a classical optimization subroutine, it may provide robustness against circuit parameter errors due to imperfect control or gate synthesis.

Tang'S, Ho Lun [Virginia Polytechnic Inst. and Sta↗
DOE OSTI2025

A Polynomial-Time Classical Algorithm for Noisy Quantum Circuits

We provide a polynomial-time classical algorithm for noisy quantum circuits. The algorithm computes the expectation value of any observable for any circuit, with a small average error over input states drawn from an ensemble (e.g., the computational basis). Our approach is based upon the intuition that noise exponentially damps nonlocal correlations relative to local correlations. This enables one to classically simulate a noisy quantum circuit by keeping track of only the dynamics of local quantum information. Our algorithm also enables sampling from the output distribution of a circuit in quasipolynomial time, so long as the distribution anticoncentrates. A number of implications are discussed, including a fundamental limit on the efficacy of noise mitigation strategies: For constant noise rates, any quantum circuit for which error mitigation succeeds in polynomial-time on most input states can also be classically simulated in polynomial-time on most input states. Our algorithms scale exponentially in the inverse noise rate, which is fundamental and makes them impractical for current quantum devices.

decoherence↗
DOE OSTI2018

SORA: Scalable Overlap-graph Reduction Algorithms for Genome Assembly using Apache Spark in the Cloud

The advent of high-throughput DNA sequencing techniques has permitted very high quality de novo assemblies of genomes, but raise an issue of requiring large amounts of computer memory to resolve the large genome graphs generated by most overlap graph de novo assemblers. To address these limitations, we present a novel algorithmic approach; Scalable Overlap-graph Reduction Algorithms (SORA). SORA adapts string graph reduction algorithms for the genome assembly using a distributed computing platform. To efficiently compute coverage for enormous paths in the graphs, SORA uses Apache Spark which is a cluster-based engine designed on top of Hadoop to handle very large datasets in the cloud. The experimental results show that SORA can process a nearly one billion edge graph in a distributed cloud cluster as well as smaller graphs on a local cluster with a short turnaround time. Moreover, our algorithms scale almost linearly with increasing numbers of virtual instances in the cloud. SORA is freely available for download at https://github.com/BioHPC/SORA/.

Paul, Alexander↗
DOE OSTI2017

GPU-based parallel algorithm for generating massive scale-free networks using the preferential attachment model

A novel parallel algorithm is presented for generating random scale-free networks using the preferential-attachment model. The algorithm, named cuPPA, is custom-designed for single instruction multiple data (SIMD) style of parallel processing supported by modern processors such as graphical processing units (GPUs). To the best of our knowledge, our algorithm is the first to exploit GPUs, and also the fastest implementation available today, to generate scale-free networks using the preferential attachment model. A detailed performance study is presented to understand the scalability and runtime characteristics of the cuPPA algorithm. In one of the best cases, when executed on an NVidia GeForce 1080 GPU, cuPPA generates a scale-free network of two billion edges in less than 3 seconds.

Alam, Maksudul↗
DOE OSTI2019

Fast and Scalable Implementations of Influence Maximization Algorithms

The Influence Maximization problem has been extensively studied in the past decade because of its practical applications in finding the key influencers in social networks. Due to the hardness of the underlying problem, existing algorithms have tried to trade off practical efficiency with approximation guarantees. However, even such approximate solutions take several hours of compute time on modest sized real world inputs. On the other hand, there is a lack of effective parallel and distributed algorithms to solve this problem. In this paper, we present efficient parallel algorithms for multithreaded and distributed systems to solve the influence maximization with approximation guarantee. Our algorithms extend state-of-the-art sequential approach based on computing reverse reachability sets. We present a detailed experimental evaluation, and analyze their performance and their sensitivity to input parameters, using real world inputs. Our experimental results demonstrate significant speedup on parallel architectures. We further show a speedup of up to 586X relative to the state-of-the-art sequential baseline using 1024 nodes of a supercomputer at far greater accuracy and twice the seed set size. To the best of our knowledge, this is the first effort in parallelizing the influence maximization operation at scale.

Minutoli, Marco↗
DOE OSTI2021

Electromagnetic Transient Simulation Algorithms for Evaluation of Large-Scale Extreme Fast Charging Systems (Distribution Grid Models)

The distribution and transmission grids are observing an increased penetration of power electronics in loads and generations. For example, there is increasing interest in integrating in extreme fast charging (XFC) systems for fast charging of electrical vehicles. As these systems are integrated, developing high-fidelity electromagnetic transient model of XFC systems in distribution grids and evaluating their interactions with the power grid would be of significant interest. This model will be utilized for design of XFC systems, to identify upgrades in distribution and/or transmission grids, for planning purposes by transmission planners or operators or owners, among others. It can also be utilized in operations for improved reliable performance of the grid and/or XFC station. The challenge with simulating these models is the high computational complexity introduced by the large number of states present in the system and the time-step needed to simulate the system. In this paper, advanced simulations algorithms are applied to reduce the computational complexity of simulating large-scale XFC systems. The algorithms include numerical stiffness-based segregation, time constant-based segregation, clustering and aggregation on differential algebraic equations (DAEs), and multi-order integration approaches. While the first three algorithms split the matrix that needs to be inverted from a large matrix to much smaller matrices, the final algorithm reduces the computational burden of applying higher-order integration approaches in the complete system. The comparison made in the previous sentence is with respect to use of homogeneous integration approaches used in conventional electromagnetic transient simulators like power systems computer aided design (PSCAD). The approaches mentioned here have resulted in speed-up of 36x in the simulation of a single distribution system with 15 XFCs.

Debnath, Suman↗
DOE OSTI2024

Development of a Hardware-in-The-Loop Testbed for a Decentralized, Data-Driven Electric Vehicle Charging Control Algorithm

This study presents the design of an electric vehicle (EV)-grid integration (EVGI) hardware test-bed to implement smart EV charging algorithms. Here, the proposed test-bed also allows to create different grid events via flexible integration of other power hardware (e.g., controllable loads and battery energy storage systems) and test their impacts on EV charging. The design uses a real-time digital simulator to realize a complex distribution grid model with primary and secondary networks. A grid simulator physically realizes the selected nodes of the simulated grid to power an actual EV, forming a hardware-in-the-loop (HIL) test setup. The EV-grid integration is demonstrated based on the custom hardware and software implementation of the J1772 charging protocol using dSPACE MicroLabBox, operating as a custom EV Supply Equipment (EVSE). The HIL test-bed features a novel testing platform for accurate implementation and analysis of scalable charging algorithms. To this end, a data-driven, decentralized, model-free charging controller based on the Additive Increase and Multiplicative Decrease (AIMD) algorithm is presented and validated on an EV using the HIL test-bed. We tested the proposed algorithm under various case studies, and presented a comparison study with an existing droop-based, decentralized charging solution. The results showed that the EV successfully performed charging commands generated by the EVSE and regulated its charging power to effectively reduce the system loading caused by high EV penetration.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2016

A Comparison of the Detection Sensitivity of the Poisson Clutter Split and Region of Interest Algorithms on the RadMAP Mobile System

This analysis uses source injection into background data collected by the Radiological Multi-sensor Analysis Platform (RadMAP) to characterize the performance of the Poisson Clutter Split algorithm and compare it with a region-of-interest algorithm. This comparison is performed for varying detector array sizes and false alarm rates using data from Sodium Iodide and High Purity Germanium detector arrays. The application of the Poisson Clutter Split algorithm is found to yield significant performance gains for both medium- and high-resolution detector arrays. Furthermore, trade-offs between energy resolution, array size, cost, and detection performance are explored. In doing so, it is shown that the choice of detection algorithm is a key factor in determining the overall system performance and should be an important consideration in system design.

Joshi, T. H.↗
DOE OSTI2026

RADAI: A Large-Scale Realistic Dataset for Radiation Detection Algorithm Development

Open, realistic datasets are essential for developing and benchmarking radiation detection algorithms, yet they remain scarce. The Radiological Anomaly Detection and Identification (RADAI) project was develop to create datasets that meet the training and testing needs for sophisticated radiation detection algorithms. The RADAI dataset is a large-scale synthetic resource that integrates high-fidelity Monte Carlo simulations with realistic urban scenarios to capture both background variability and source signatures. RADAI models construction-material NORM, people and vehicles, urban clutter, and dynamic environmental effects such as cosmic-ray and rain-induced transients, and they provide list-mode detector data with motion and response modeling suitable for algorithm training and evaluation. The RADAI project resulted in three publicly-released complementary datasets together with an online scoring portal for standardized performance assessment and an open software toolkit that supports data access, augmentation, model development, and evaluation. These resources enable reproducible comparisons across methods and promote rigorous studies at the scale required by contemporary machine learning. By grounding algorithm development in realistic, well-documented conditions, RADAI supports progress toward more robust detection, identification, and localization in complex urban environments.

Ghawaly, James M. [Division of Computer Science an↗
DOE OSTI2015

Multi-jagged: A scalable parallel spatial partitioning algorithm

Geometric partitioning is fast and effective for load-balancing dynamic applications, particularly those requiring geometric locality of data (particle methods, crash simulations). We present, to our knowledge, the first parallel implementation of a multidimensional-jagged geometric partitioner. In contrast to the traditional recursive coordinate bisection algorithm (RCB), which recursively bisects subdomains perpendicular to their longest dimension until the desired number of parts is obtained, our algorithm does recursive multi-section with a given number of parts in each dimension. By computing multiple cut lines concurrently and intelligently deciding when to migrate data while computing the partition, we minimize data movement compared to efficient implementations of recursive bisection. We demonstrate the algorithm's scalability and quality relative to the RCB implementation in Zoltan on both real and synthetic datasets. Our experiments show that the proposed algorithm performs and scales better than RCB in terms of run-time without degrading the load balance. Lastly, our implementation partitions 24 billion points into 65,536 parts within a few seconds and exhibits near perfect weak scaling up to 6K cores.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

A Block-Based Triangle Counting Algorithm on Heterogeneous Environments

Triangle counting is a fundamental building block in graph algorithms. In this article, we propose a block-based triangle counting algorithm to reduce data movement during both sequential and parallel execution. Our block-based formulation makes the algorithm naturally suitable for heterogeneous architectures. The problem of partitioning the adjacency matrix of a graph is well-studied. Our task decomposition goes one step further: it partitions the set of triangles in the graph. By streaming these small tasks to compute resources, we can solve problems that do not fit on a device. We demonstrate the effectiveness of our approach by providing an implementation on a compute node with multiple sockets, cores and GPUs. The current state-of-the-art in triangle enumeration processes the Friendster graph in 2.1 seconds, not including data copy time between CPU and GPU. Using that metric, our approach is 20 percent faster. When copy times are included, our algorithm takes 3.2 seconds. This is 5.6 times faster than the fastest published CPU-only time.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

A Study on Particle Trajectory Error in Finite-Element Particle-in-Cell Algorithms

Particle-in-cell (PIC) algorithms are widely used for the simulation of kinetic plasmas. PIC algorithms account for the interaction between charged particles in a plasma and the electromagnetic field in ambient space, including self-field interactions. The objective of this article is to study the error in charged particle trajectories present in finite-element (FE)-based PIC algorithms on unstructured meshes. We study how the trajectory error behaves according to the FE mesh resolution and the matrix solver employed in the FE algorithm. The study is performed by considering a trajectory established by a parabolic electric potential and an axial magnetic force acting on the charged particle. Under a proper choice combination of electric and magnetic field parameters, the 2-D particle trajectories comprise closed orbits. Numerical errors cause small perturbations on the trajectories, with cumulative effects. As a result, the resulting orbital trajectories exhibit distortions including spurious apsidal precession. These distortions provide a clear imprint of the numerical error. Here, we also study the numerical error in a quantitative fashion by computing the distance norm between the trajectories obtained by the exact fields and numerical fields.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2018

A Clarke Transformation-Based DFT Phasor and Frequency Algorithm for Wide Frequency Range

Despite its wide applications in power grid monitoring, the classic discrete Fourier transform (DFT)-based synchrophasor estimation algorithms suffer from significant errors when the power system operates under off-nominal frequency conditions. This phenomenon is caused by spectral leakage of DFT and becomes even more severe for single-phase synchrophasor estimation. To address this issue, a theory to eliminate the spectral leakage-caused errors is proposed and a Clarke transformation-based DFT synchrophasor estimation algorithm is proposed to implement the theory in this paper. The Clarke transformation constructs a second signal that has exactly 90° phase angle difference from the original single-phase input signal and helps eliminate the estimation errors for a wide frequency range. The proposed algorithm is tested under the conditions required in the phasor measurement unit standard C37.118.1-2011 and C37.118.1a-2014, as well as the harmonic and noise conditions not required in the standard to verify its performance. More importantly, the idea of using Clarke transformation can be used for other DFT-based synchrophasor algorithms in order to achieve higher synchrophasor measurement accuracy under dynamic conditions. An example is presented at last to demonstrate the expandability of the proposed idea.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2020

Diesel Generator Model Parameterization for Microgrid Simulation Using Hybrid Box-Constrained Levenberg-Marquardt Algorithm

Existing generator parameterization methods, typically developed for large turbine generator units, are difficult to apply to small kW-level diesel generators in microgrid applications. Here, this article presents a model parameterization method that estimates a complete set of kW-level diesel generator parameters simultaneously using only load-step-change tests with limited measurement points. This method provides a more cost-efficient and robust approach to achieve high-fidelity modeling of diesel generators for microgrid dynamic simulation. A two-stage hybrid box-constrained Levenberg-Marquardt (H-BCLM) algorithm is developed to search the optimal parameter set given the parameter bounds. A heuristic algorithm, namely Generalized Opposition-based Learning Genetic Algorithm (GOL-GA), is applied to identify proper initial estimates at the first stage, followed by a modified Levenberg-Marquardt algorithm designed to fine tune the solution based on the first-stage result. The proposed method is validated against dynamic simulation of a diesel generator model and field measurements from a 16kW diesel generator unit.

42 ENGINEERING↗
DOE OSTI2018

Hybrid-Electric Turbocharger and High-Speed SiC Variable-Frequency Drive Using Sensorless Control Algorithm

Electrically assisted engine boosting systems lend themselves to better throttle response, wider effective operating ranges, and can provide the ability to extract excess energy during deceleration and high-load events (and store it in a vehicle's onboard batteries). This can lead to better overall vehicle performance, emissions, and efficiency while allowing for further engine downsizing and increased power density. In this research effort, a hybrid-electric turbocharger, variable-frequency drive (VFD), and novel sensorless control algorithm were developed. An 11 kW permanent-magnet (PM) machine was coupled to a commercial turbocharger via an in-line, bolt-on housing attached to the compressor inlet. A high-efficiency, high-temperature VFD, consisting of custom control and power electronics, was also developed. The VFD uses SiC MOSFETS to achieve high-switching frequency and can be cooled using an existing engine coolant loop operating at up to 105 °C at an efficiency greater than 98%. A digital sliding mode-observer sensorless speed control algorithm was created to command and regulate speed and achieved ramp rates of over 68,000 rpm/s. A two-machine benchtop motor/generator test stand was constructed for initial testing and tuning of the VFD and sensorless control algorithm. A gas blow-down test stand was constructed to test the mechanical operation of the hybrid-electric turbocharger and speed control using the VFD. In addition, a liquid-pump cart was assembled for high-temperature testing of the VFD. Initial on-engine testing is planned for later this year. This paper intends to present a design overview of the in-line, hybrid-electric device, VFD, and performance characterization of the electronics and sensorless control algorithm.

Engineering↗