Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “scalable algorithms”

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 541 records · Page 30
All sourcesNASA NTRSDOE OSTI
DOE OSTI2026

Scalable multiplexed machine learning gas sensor chips for food classification

Multiplexed gas sensor arrays combined with machine learning have unlocked previously inaccessible applications for scent-based sensing. Current platforms are limited by overlapping sensing materials with similar compositions, leading to highly correlated responses, or multistep deposition processes that hinder scalability. In this work, we developed a 16-element monolithic chip with fully distinct sensing layers, enabling a truly heterogeneous array. The system consists of highly sensitive carbon nanotube field effect transistors that are functionalized through a single-step microdispensing method compatible with automated pipetting systems. The resulting chip produces characteristic signal patterns in response to object-specific scent profiles and, when combined with machine learning algorithms, can perform automated object identification. We demonstrate the classification of 16 different objects, including food spoilage and nut allergens, with a 92.6% overall prediction accuracy.

Bassil, Carla [University of California, Berkeley,↗
DOE OSTI2022

Tensor Network Quantum Virtual Machine for Simulating Quantum Circuits at Exascale

The numerical simulation of quantum circuits is an indispensable tool for development, verification, and validation of hybrid quantum-classical algorithms intended for near-term quantum co-processors. The emergence of exascale high-performance computing (HPC) platforms presents new opportunities for pushing the boundaries of quantum circuit simulation. Here, we present a modernized version of the Tensor Network Quantum Virtual Machine (TNQVM) that serves as the quantum circuit simulation backend in the eXtreme-scale ACCelerator (XACC) framework. The new version is based on the scalable tensor network processing library ExaTN (Exascale Tensor Networks). It provides multiple configurable quantum circuit simulators that perform either an exact quantum circuit simulation via the full tensor network contraction or an approximate simulation via a suitably chosen tensor factorization scheme. Upon necessity, stochastic noise modeling from real quantum processors is incorporated into the simulations by modeling quantum channels with Kraus tensors. By combining the portable XACC quantum programming frontend and the scalable ExaTN numerical processing backend, we introduce an end-to-end virtual quantum development environment that can scale from laptops to future exascale platforms. We report initial benchmarks of our framework, which include a demonstration of the distributed execution, incorporation of quantum decoherence models, and simulation of the random quantum circuits used for the certification of quantum supremacy on Google’s Sycamore superconducting architecture.

Nguyen, Thien↗
DOE OSTI2025

Fusing Edge Computing with Transport Security by Leveraging the Controller Area Network Transport Security Tracking and Reporting (C-STAR) Unit

Rapid advances in embedded system complexity and capability provides exciting opportunities for transportation security deployment. Manufacturers and developers of these embedded systems continue to provide lower cost and more powerful solutions that can be leveraged by researchers and engineers. Furthermore, deploying these devices at the “edge” of the Internet-of-Things (IoT) infrastructure provides opportunities for highly capable applications in transport security. In an edge computation architecture, the device is co-located at the source of the data in the larger IoT structure – this provides computational capability at the location directly where the data is collected. For shipment transport security, this provides a direct compute node for digestion of data and mitigation actions in real-time. In our application, the vehicle provides a significant amount of this data that can be processed in real-time via the Controller Area Network Transport Security Tracking and Reporting (C-STAR) edge device. Utilization of a computational node located on the vehicle, such as the C-STAR, capitalizes on previously discussed opportunities of edge architectures. In this paper, we will discuss this security solution’s usability, current deployments, and scalability to further applications in transport security. First, we will cover the supported vehicle platforms that can leverage the C-STAR technology. This will be particularly relevant to medium- and heavy-duty vehicles transporting high-risk shipments. Second, we will speak to current deployments of the C-STAR that are ongoing. Finally, we will discuss additional areas for expansion such as maturing the onboard algorithms through continuing collaborations.

Cook, Adian [ORNL] (ORCID:0000000160825395)↗
DOE OSTI2024

ARQUIN: Architectures for Multinode Superconducting Quantum Computers

Many proposals to scale quantum technology rely on modular or distributed designs wherein individual quantum processors, called nodes, are linked together to form one large multinode quantum computer (MNQC). One scalable method to construct an MNQC is using superconducting quantum systems with optical interconnects. However, internode gates in these systems may be two to three orders of magnitude noisier and slower than local operations. Surmounting the limitations of internode gates will require improvements in entanglement generation, use of entanglement distillation, and optimized software and compilers. Still, it remains unclear what performance is possible with current hardware and what performance algorithms require. In this article, we employ a systems analysis approach to quantify overall MNQC performance in terms of hardware models of internode links, entanglement distillation, and local architecture. We show how to navigate tradeoffs in entanglement generation and distillation in the context of algorithm performance, lay out how compilers and software should balance between local and internode gates, and discuss when noisy quantum internode links have an advantage over purely classical links. Here, we find that a factor of 10–100× better link performance is required and introduce a research roadmap for the co-design of hardware and software towards the realization of early MNQCs. While we focus on superconducting devices with optical interconnects, our approach is general across MNQC implementations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Physics Informed Neural Networks as Computational Physics Emulators

This report is a brief overview and evaluation of Physics Informed Neural Networks (PINNs). Karniadakis and co-workers, e.g., Karniadakis et al. (2021) assert that the PINNs approach integrates seamlessly both data and mathematical physics models, even in partially understood, uncertain and high-dimensional contexts. They further claim that PINNs are effective and efficient for ill-posed and inverse problems, and when combined with domain decomposition, are scalable to large problems and a tool to discover hidden physics. While they demonstrate the capabilities in specific academic instances, their overarching claims about PINNs seem to be an overstatement, at least at the current time. We have briefly considered a few of the limitations of PINNs in this investigation. It is not clear to us if the PINNs approach can ever be competitive with approaches that use specialized algorithms to achieve high-accuracy solutions of governing equations and other techniques that can combine observational data with such solutions. As an example of the latter, consistent with the principles of Bayesian inference, data assimilation, or more generally data-model fusion, is a process that fuses observational data typically with a computational model that respects certain constraints such as conservation laws. For example, improvements in observational network combined with data assimilation have been key in improving weather predictions over the past four decades Kalnay (2003).

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Automated processing of environmental transmission electron microscopy images for quantification of thin film dewetting and carbon nanotube nucleation dynamics

We report scalable production of carbon nanotubes (CNTs) requires catalysts and reaction conditions that provide high nucleation efficiency. In situ characterization methods such as environmental transmission electron microscopy (ETEM) can reveal fundamental mechanisms of synthesis, but to date have primarily provided qualitative observations on small sample sizes. Here, quantitative analysis is performed using high-resolution, high-rate video capture of ETEM experimentation coupled with automated image processing, involving computer vision algorithms and convolutional neural networks. By this approach, we detect distinct nanoparticle formation from an alumina-supported iron thin film and subsequent CNT nucleation from the nanoparticles. The statistical summary of particles in each video shows that, compared to a H 2 -only atmosphere, pretreatment of the catalyst with carbon added to the H 2 atmosphere results in a smaller average particle diameter, a 2-fold increase in particle density (to 5300 particles/μm 2 ), a 3-fold increase in CNT nucleation efficiency (to 92%), and more than a 5-fold increase in CNT density (to 4800/μm 2 ). Addition of carbon during exposure to H 2 is also more effective than NH 3 at dewetting the catalyst film and increasing the CNT nucleation efficiency, in spite of NH 3 being a stronger reducing agent for iron. Insights from this study are applicable to improving CNT yield and productivity in both batch-style and continuous processes.

25 ENERGY STORAGE↗
DOE OSTI2023

BiG-SLiCE 2 v1.0.0

BiG-SLiCE was originally an open source Python-based command line bioinformatics software that offers a highly scalable clustering analysis on biosynthetic gene clusters (BGC) data. It allows a simultaneous analysis of millions of BGCs, exceeding the capability of other existing tools (around one hundred thousands). As a tradeoff, the clustering accuracy is relatively lower and sometimes fall short in corner cases and specific BGC classes such as the RiPPs (Ribosomally-translated, Post-translationally modified Peptides). In BiG-SLiCE V2 (developed in LBNL), the clustering algorithm has been significantly improved to deliver a much accurate result even for RiPPs and other previous corner case classes. Moreover, the speed of the overall pipeline has been improved by 50-100%. Finally, additional features were implemented to support downstream analyses of BiG-SLiCE results, such as customized tabular (TSV/CSV) and columnar (Parquet) outputs.

Kautsar, Satria↗
DOE OSTI2024

TrustDER: Trusted, Private and Scalable Coordination of Distributed Energy Resources

In this project, the Stanford and SLAC Teams have developed a Trusted, Private and Scalable platform for coordinating Coordination of Distributed Energy Resources (TrustDER). This is a layered system that ensures private, trusted and scalable coordination and monitoring of DERs. It accommodates a variety of resources, such as solar generation, gensets and loads, with a particular focus on battery systems-based resources, as they are a transformational technology experiencing fast growth in adoption by large critical facilities. The platform can be used as standalone or added to existing aggregation systems to enable trust, privacy and resilience. TrustDER consists of layers that address each of the shortcomings of the existing state of the art. Each layer in the platform can operate independently but provides information to the layers above it to enable a novel form of overall coordination architecture. The project consists of several tasks, with each task dedicated to the design of each layer. Task 2 Resource Virtualization defined a software abstraction layer for distributed energy resources (DERs). The goal of this abstraction was to simplify the implementation of algorithms utilizing cooperation of DERs resources in a variety of use cases. Task 3 is on Secure ID for Asset Authentication. Identity Management Systems (IDMS) are a foundational infrastructure for interactions between entities (organizations, users, devices, and services). Secure ID is blockchain-based a distributed identity management system allowing (1) identity provisioning, (2) authentication, (3) authorization, and (4) identity data sharing for IoT-enabled assets on the electricity grid. In this project, the SLAC team focused on designing and testing Keymaker, a protocol for authenticating device identity managed by Secure ID. Task 5 Private and Safe Integration is focused on the design and evaluation of a DER cooperation scheme which allows for the aggregation of DERs without impacting network reliability. The approach is designed based on realistic assumptions regarding data availability, communication infrastructure limitations, and privacy. Task 6 Scalable Distributed Privacy for Information explored how virtualized batteries could be managed privately. Specifically, it examined the case in which a principal provides a partitioned battery to multiple clients. Task 7 Use Cases was to ensure that this technology was applied in relevant situations and scenarios. Primarily, this means that virtualization needed to be employed in a manner that either improved flexibility, bolstered security or privacy, or decreased costs.

25 ENERGY STORAGE↗
DOE OSTI2020

Low synchronization Gram–Schmidt and generalized minimal residual algorithms

The Gram–Schmidt process uses orthogonal projection to construct the A = QR factorization of a matrix. When Q has linearly independent columns, the operator P = I - Q(QTQ)-1QT defines an orthogonal projection onto Q⊥. In finite precision, Q loses orthogonality as the factorization progresses. A family of approximate projections is derived with the form P = I - QTQT, with correction matrix T. When T = (QTQ)-1, and T is triangular, it is postulated that the best achievable orthogonality is $\mathcal{O}(ε)\mathcal{K}(A)$. We present new variants of modified (MGS) and classical Gram–Schmidt algorithms that require one global reduction step. An interesting form of the projector leads to a compact WY representation for MGS. In particular, the inverse compact WY MGS algorithm is equivalent to a lower triangular solve. Our main contribution is to introduce a backward normalization lag into the compact WY representation, resulting in a $\mathcal{O}(ε)\mathcal{K}[r_0, AV_m])$ stable Generalized Minimal Residual Method (GMRES) algorithm that requires only one global reduce per iteration. Finally, further improvements in performance are achieved by accelerating GMRES on GPUs.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Automated Construction of Artificial Lattice Structures with Designer Electronic States

Manipulating matter with a scanning tunneling microscope (STM) enables the creation of atomically defined artificial structures that host designer quantum states. However, the time-consuming nature of the manipulation process, coupled with the sensitivity of the STM tip, constrains the exploration of diverse configurations and limits the size of the designed features. In this study, we present a reinforcement learning (RL)-based framework for creating artificial structures by spatially manipulating carbon monoxide (CO) molecules on a copper substrate by using the STM tip. The automated workflow combines molecule detection and manipulation, employing deep-learning-based object detection to locate CO molecules and linear assignment algorithms to allocate these molecules to designated target sites. We initially perform molecule maneuvering based on randomized parameter sampling for sample bias, tunneling current set point, and manipulation speed. This data set is then structured into an action trajectory used to train an RL agent. The model is subsequently deployed on the STM for real-time fine-tuning of the manipulation parameters during structure construction. Our approach incorporates path-planning protocols coupled with active drift compensation to enable atomically precise fabrication of structures with significantly reduced human input while realizing larger-scale artificial lattices with the desired electronic properties. Furthermore, using our approach, we demonstrate the automated construction of an extended artificial graphene lattice and confirm the existence of a characteristic Dirac point in its electronic structure. Further challenges regarding the RL-based structural assembly scalability are discussed.

Algorithms↗
DOE OSTI2026

Two-Level Sketching Alternating Anderson Acceleration for Complex Physics Applications

We present a novel two-level sketching extension of the Alternating Anderson–Picard (AAP) method for accelerating fixed-point iterations in challenging single- and multiphysics simulations governed by discretized PDEs. Our approach combines a static, physics-based projection that reduces the least-squares (LS) problem to the most informative field (e.g., via Schur-complement insight) with a dynamic, algebraic sketching stage driven by a backward stability analysis under Lipschitz continuity. We introduce inexpensive estimators for stability thresholds and cache-aware randomized selection strategies to balance computational cost against memory access overhead. The resulting algorithm solves reduced LS systems in place, minimizes memory footprints, and seamlessly alternates between low-cost Picard updates and Anderson mixing. Implemented in Julia, our two-level sketching AAP achieves up to 50% time-to-solution reductions compared to standard Anderson acceleration—without degrading convergence rates—on benchmark problems including Stokes, 𝑝-Laplacian, bidomain, and Navier–Stokes formulations at varying problem sizes. These results demonstrate the method’s robustness, scalability, and potential for integration into high-performance scientific computing frameworks. Our implementation is available open source in the AAP.jl library.

Barnafi, Nicolas [University of Chile, Santiago]↗
DOE OSTI2020

Scalable Wind Turbine Generator Bearing Fault Prediction Using Machine Learning: A Case Study

Operation and maintenance (O&M) costs for wind turbines pose a risk to competitiveness and asset owners. With machine-learning technologies and digitalization rapidly maturing, the wind industry is actively investigating these new technologies to optimize O&M practices and reduce costs. This paper reviews recent work on machine-learning approaches to generator bearing failure prediction and presents a relevant real-world case study through a collaboration between the National Renewable Energy Laboratory and Envision Digital Corporation. In the case study, we evaluate the performance of representative machine-learning algorithms for predicting wind turbine generator bearing failures. Operational supervisory control and data acquisition data from one wind power plant was used to train and test the machine-learning models. The investigated data channels are chosen based on whether physically they reflect the failed generator bearing conditions and the component historical usage, including both environmental and operational conditions. Benefits and drawbacks of different methods are identified.

generator bearing failures↗
DOE OSTI2020

Process optimization of complex geometries using feed forward control for laser powder bed fusion additive manufacturing

Additive manufacturing (AM) enables the fabrication of complex designs that are difficult to create by other means. Metal parts manufactured by laser powder bed fusion (LPBF) can incorporate intricate design features and demonstrate desirable mechanical properties. However, printing a part that is qualified for its intended application often involves reprinting and discarding many parts to eliminate defects, improve dimensional accuracy, and increase repeatability. The process of iteratively converging on the appropriate build parameters increases the time and cost of creating functional LPBF manufactured parts. This work describes a fast, scalable method for part-scale process optimization of arbitrary geometries. Additionally, the computational approach uses feature extraction to identify scan vectors in need of parameter adaptation and applies results from simulation-based feed forward control models. This method provides a framework to quickly optimize complex parts through the targeted application of models with a range of fidelity and by automating the transfer of optimization strategies to new part designs. The computational approach and algorithmic framework are described, a software package is implemented, the method is applied to parts with complex features, and parts are printed on a customized open architecture LPBF machine.

3D printing↗
DOE OSTI2026

Quantum Computing in Next-Generation Transportation Optimization

We explore how quantum computing (QC) can advance transportation optimization, with a focus on two high-impact areas: traffic signal control and vehicle electrification with grid integration. As transportation systems grow in complexity, classical optimization methods increasingly struggle to deliver scalable and efficient solutions, particularly for real-time, data-rich environments. This work identifies key challenges within these two domains where QC may offer advantages, particularly in handling combinatorial decision spaces and dynamic constraints. We begin by outlining the limitations of classical approaches for traffic signal control optimization and electric vehicle charging coordination, highlighting where computational limitations arise. Previous quantum formulations are presented and new formulations are proposed to demonstrate how emerging quantum algorithms, including quantum annealing and the Quantum Approximation Optimization Algorithm, could be leveraged to reformulate and address these problems. We also evaluate the suitability of current quantum hardware and discuss recent trends that indicate when QC may become a viable tool for transportation applications. While acknowledging the present limitations of QC technologies, this poster emphasizes the importance of preparing quantum-compatible models today. By reviewing and establishing formulations that align with the strengths of quantum algorithms, researchers and practitioners can better position themselves to take advantage of QC advancements as they occur. This work aims to provide a practical, forward-looking perspective on the near-term potential of quantum computing in transportation optimization.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2026

A Co-Simulation Framework for Steady-State Analyses of Multiple Droop-based MTdc Grids in Continental-Scale Systems

The growing scale and complexity of planning continental hybrid ac and multi-terminal dc (MTdc) systems require scalable steady-state modeling and analysis approaches not currently available in commercial tools. This paper presents a comprehensive multi-fidelity model-conversion framework that enables the efficient transition of MTdc grid models from production cost modeling (PCM) and approximated ac power flow to detailed ac–MTdc power flow for large-scale planning studies. The core of this framework is a scalable co-simulation approach that, for the first time, enables power flow analysis in continental-scale ac–MTdc systems. It seamlessly couples commercial ac solvers with a detailed MTdc grid model that incorporates droop-based control and current-limiting strategies of multiple meshed MTdc grids. Leveraging this capability, an evaluation framework to systematically assess and compare different MTdc power redispatch strategies under ac and dc contingencies is introduced. The proposed framework and algorithm are evaluated using a combined Western and Eastern Interconnection system with 11 MTdc grids of various sizes, showing a coherent transition from PCM to detailed ac–MTdc power flow and improved system performance in voltage regulation and line overload mitigation following typical contingencies.

Nguyen, Quan H.↗
DOE OSTI2024

Uncertainty-aware Continuous Implicit Neural Representations for Remote Sensing Object Counting

Many existing object counting methods rely on density map estimation (DME) of the discrete grid representation by decoding extracted image semantic features from designed convolutional neural networks (CNNs). Relying on discrete density maps not only leads to information loss dependent on the original image resolution, but also has a scalability issue when analyzing high-resolution images with cubically increasing memory complexity. Furthermore, none of the existing methods can offer reliable uncertainty quantification (UQ) for the derived count estimates. To overcome these limitations, we design UNcertainty-aware, hypernetwork-based Implicit neural representations for Counting (UNIC) to assign probabilities and the corresponding counting confidence over continuous spatial coordinates. We derive a sampling-based Bayesian counting loss function and develop the corresponding model training algorithm. UNIC outperforms existing methods on the Remote Sensing Object Counting (RSOC) dataset with reliable UQ and improved interpretability of the derived count estimates. Our code is available at https://github.com/SiyuanXu-tamu/UNIC.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Trust-Region Approximation of Extreme Trajectories in Power System Dynamics

In this work we present a novel technique, based on a trust-region optimization algorithm and second-order trajectory sensitivities, to compute the extreme trajectories of power system dynamic simulations given a bounded set that represents parametric uncertainty. Furthermore, we show how this method, while remaining computationally efficient compared with sampling-based techniques, overcomes the limitations of previous sensitivity-based techniques to approximate the bounds of the trajectories when the local approximation loses validity because of the nonlinearity. We present several numerical experiments that showcase the accuracy and scalability of the technique, including a demonstration on the IEEE New England test system.

42 ENGINEERING↗