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 775 records · Page 43
All sourcesNASA NTRSDOE OSTI
NASA NTRSDate not supplied

Formalized Reasoning of Operational Volumes for Wildland Fire Fighting

This work is focused on the formalized reasoning of operational volumes as it relates to the current and future technologies developed by NASA to aid in wildfire fighting operations. One such technology is the unmanned aircraft system pilot kit (UASP-kit) developed by the Scalable Traffic Management for Emergency Response Operations (STEReO) project at NASA, which is used to increase situation awareness for a ground operator in the field. The UASP-kit utilizes operational volumes which represent mission areas and alerting volumes, to alert when another aircraft is within one of these volumes from received ADS-B data. This work is focused on developing a rigorous foundation for the concept of operational volumes for modeling and prototyping operations in such a tool as the UASP-kit. This includes establishing a class of algorithms to detect when an object is in an operational volume, and when an operational volume is intersecting or contained within another. Additionally, this work is focused on providing rigorous proof in an interactive theorem prover that the algorithms work as intended. Scenarios are presented that model current UASP-kit operations and extend past the current capabilities of the technology to modeling more complex scenarios such as mission planning.

Operational Volumes↗
DOE OSTI2020

A massively parallel and scalable multi-CPU material point method

Harnessing the power of modern multi-GPU architectures, we present a massively parallel simulation system based on the Material Point Method (MPM) for simulating physical behaviors of materials undergoing complex topological changes, self-collision, and large deformations. Our system makes three critical contributions. First, we introduce a new particle data structure that promotes coalesced memory access patterns on the GPU and eliminates the need for complex atomic operations on the memory hierarchy when writing particle data to the grid. Second, we propose a kernel fusion approach using a new Grid-to-Particles-to-Grid (G2P2G) scheme, which efficiently reduces GPU kernel launches, improves latency, and significantly reduces the amount of global memory needed to store particle data. Finally, we introduce optimized algorithmic designs that allow for efficient sparse grids in a shared memory context, enabling us to best utilize modern multi-GPU computational platforms for hybrid Lagrangian-Eulerian computational patterns. We demonstrate the effectiveness of our method with extensive benchmarks, evaluations, and dynamic simulations with elastoplasticity, granular media, and fluid dynamics. In comparisons against an open-source and heavily optimized CPU-based MPM codebase [Fang et al. 2019] on an elastic sphere colliding scene with particle counts ranging from 5 to 40 million, our GPU MPM achieves over 100x per-time-step speedup on a workstation with an Intel 8086K CPU and a single Quadro P6000 GPU, exposing exciting possibilities for future MPM simulations in computer graphics and computational science. Moreover, compared to the state-of-the-art GPU MPM method [Hu et al. 2019a], we not only achieve 2x acceleration on a single GPU but our kernel fusion strategy and Array-of-Structs-of-Array (AoSoA) data structure design also generalizes to multi-GPU systems. Our multi-GPU MPM exhibits near-perfect weak and strong scaling with 4 GPUs, enabling performant and large-scale simulations on a 10243 grid with close to 100 million particles with less than 4 minutes per frame on a single 4-GPU workstation and 134 million particles with less than 1 minute per frame on an 8-GPU workstation.

Wang, Xinlei↗
DOE OSTI2025

NEXT Generation Energy Technologies for Connected and Automated On-Road Vehicles (NEXTCAR Phase I & II)

The Ohio State University’s ARPA-E NEXTCAR project was a multi-phase, multi-year research, development, and demonstration program focused on improving the energy efficiency of connected and automated vehicles (CAVs). The team developed and validated advanced vehicle motion and powertrain control algorithms that coordinate propulsion and automation systems to optimize energy use. Key technologies included Dynamic Skip Fire engine control, predictive eco-driving functions such as Eco-Approach and Departure (Eco-AND) and Eco-Adaptive Cruise Control (Eco-ACC), and powertrain-agnostic optimization frameworks for hybrid, plug-in hybrid, and battery electric vehicles. The project successfully demonstrated up to 30% energy-efficiency improvement during real-world testing at the Transportation Research Center and the American Center for Mobility. The outcomes provide a foundation for scalable, cost-effective deployment of energy-optimized CAV technologies across the automotive industry.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2022

Scalable branching on dual decomposition of stochastic mixed-integer programming problems

In this work, we present a scalable branching method for the dual decomposition of stochastic mixed-integer programming. Our new branching method is based on the branching method proposed by Caroe and Schultz that creates branching disjunctions on first-stage variables only. We propose improvements to the process for creating branching disjunctions, including (1) branching on the optimal solutions of the Dantzig-Wolfe reformulation of the restricted master problem and (2) using a more comprehensive (yet simple) measure for the dispersions associated with subproblem solution infeasibility. We prove that the proposed branching process leads to an algorithm that terminates finitely, and we provide conditions under which globally optimal solutions can be identified after termination. We have implemented our new branching method, as well as the Caroe-Schultz method and a branch-and-price method, in the open-source software package DSP. Using SIPLIB test instances, we present extensive numerical results to demonstrate that the proposed branching method significantly reduces the number of node subproblems and solution times.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Anomaly Detection in Electronic Health Records Across Hospital Networks: Integrating Machine Learning With Graph Algorithms

In a large hospital system, a network of hospitals relies on electronic health records (EHRs) to make informed decisions regarding their patients in various clinical domains. Consequently, the dependability of the health information technology (HIT) systems responsible for collecting EHR data is of utmost importance for patient safety. Recently, novel methods and tools aimed at identifying anomalies in EHR data to bolster the reliability of HIT systems have been introduced. However, these existing methods and tools primarily concentrate on individual hospitals, which limits our understanding of system-wide anomalous events and their potential impact on patient safety across multiple hospitals. In this article, we introduce a new approach to detecting anomalies in EHR data within a network of hospitals. This is achieved by combining advanced machine learning techniques with graph algorithms to create a tool capable of swiftly identifying and responding to deviations. Our proposed approach employs a combination of five machine learning models, harnessing the unique strengths of each model to provide a more robust detection system. The detected anomalies are then represented as graphs, allowing us to recognize patterns across the hospital network. This aids in identifying anomalies that span multiple medical facilities, potentially indicating broader system-level risks. Extensive real-world testing of our approach demonstrated its ability to offer actionable insights compared to existing methods. Additionally, its scalable design ensures seamless integration into existing HIT infrastructures.

Niu, Haoran [Oak Ridge National Laboratory (ORNL),↗
DOE OSTI2022

Fast increased fidelity samplers for approximate Bayesian Gaussian process regression

Gaussian processes (GPs) are common components in Bayesian non-parametric models having a rich methodological literature and strong theoretical grounding. The use of exact GPs in Bayesian models is limited to problems containing several thousand observations due to their prohibitive computational demands. We develop a posterior sampling algorithm using H-matrix approximations that scales at O(n log 2 n). We show that this approximation’s Kullback-Leibler divergence to the true posterior can be made arbitrarily small. Though multidimensional GPs could be used with our algorithm, d-dimensional surfaces are modeled as tensor products of univariate GPs to minimize the cost of matrix construction and maximize computational efficiency. We illustrate the performance of this fast increased fidelity approximate GP, FIFA-GP, using both simulated and non-synthetic data sets

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Development and Validation of a Two-Phase Thermal-Hydraulic CFD Code NEK-2P

A project is underway to develop, verify and validate an advanced two-phase flow modeling capability for the highly-scalable, high-performance Computational Fluid Dynamics (CFD) code NEK5000. The goal of this work is to verify and validate the two-phase version of the NEK5000 code, named NEK-2P, to simulate the two-phase flow and heat transfer phenomena that occur in a Boiling Water Reactor (BWR) fuel bundle under various operating conditions. The NEK-2P two-phase flow models follow the approach used for the Extended Boiling Framework (EBF) previously developed at Argonne but include more fundamental physical models of boiling phenomena and advanced numerical algorithms for improved computational accuracy, robustness, and computational speed. The development of the NEK-2P two-phase solver and the implementation of the Extended Boiling Framework two-phase models were initially supported by Argonne National Laboratory (Argonne) through a Laboratory Directed Research and Development (LDRD) project during FY2014-2016. The development and validation of the two-phase models through analyses of selected two-phase boiling flow experiments was supported by the Nuclear Energy Advanced Modeling and Simulation (NEAMS) program in FY2017-2020. This report focuses on verification and validation of the water-steam boiling model NEK-2P Two-Phase, CFD code. The NEK-2P was validated with Nuclear Power Engineering Corporation (NUPEC) Pressurized Water Reactor (PWR) Sub-channel and Bundle Test (PSBT) void distribution benchmark. Three different simulations were performed and analyzed for various operating conditions such as wall-heat flux and sub-cooled inlet temperatures. Reasonably good agreement with measured data was obtained in predicting the measured void distributions. Simulations were performed for Virginia Tech. (VT) 3x3 rod bundle geometry with and without spacers. The preliminary results were presented for Simplified Spacer Grid (SSG). In addition, the implementation of interface reconstruction model was tested with one of the Becker benchmark Critical Heat Flux (CHF) experiments.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗
DOE OSTI2023

Report for the ASCR Workshop on Basic Research Needs in Quantum Computing and Networking - 2023

Employing quantum mechanical resources in computing and networking opens the door to new computation and communication models and potential disruptive advantages over classical counterparts. However, quantifying and realizing such advantages face extensive scientific and engineering challenges. Investments by the Department of Energy (DOE) have driven progress toward addressing such challenges. Quantum algorithms have been recently developed, in some cases offering asymptotic exponential advantages in speed or accuracy, for fundamental scientific problems such as simulating physical systems, solving systems of linear equations, or solving differential equations. Empirical demonstrations on nascent quantum hardware suggest better performance than classical analogs on specialized computational tasks favorable to the quantum computing systems. However, demonstration of an end-to-end, substantial and rigorously quantifiable quantum performance advantage over classical analogs remains a grand challenge, especially for problems of practical value. The definition of requirements for quantum technologies to exhibit scalable, rigorous, and transformative performance advantages for practical applications also remains an outstanding open question, namely, what will be required to ultimately demonstrate practical quantum advantage?

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Report for the ASCR Workshop on Basic Research Needs in Quantum Computing and Networking - 2023

Employing quantum mechanical resources in computing and networking opens the door to new computation and communication models and potential disruptive advantages over classical counterparts. However, quantifying and realizing such advantages face extensive scientific and engineering challenges. Investments by the Department of Energy (DOE) have driven progress toward addressing such challenges. Quantum algorithms have been recently developed, in some cases offering asymptotic exponential advantages in speed or accuracy, for fundamental scientific problems such as simulating physical systems, solving systems of linear equations, or solving differential equations. Empirical demonstrations on nascent quantum hardware suggest better performance than classical analogs on specialized computational tasks favorable to the quantum computing systems. However, demonstration of an end-to-end, substantial and rigorously quantifiable quantum performance advantage over classical analogs remains a grand challenge, especially for problems of practical value. The definition of requirements for quantum technologies to exhibit scalable, rigorous, and transformative performance advantages for practical applications also remains an outstanding open question, namely, what will be required to ultimately demonstrate practical quantum advantage?

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

A reinforcement learning approach to long-horizon operations, health, and maintenance supervisory control of advanced energy systems

In this work, we develop a Reinforcement Learning (RL) approach to the supervisory control problem for advanced energy systems, such as novel nuclear reactors and other demand-driven, mission-critical, and component-health-sensitive energy plants. The inclusive problem landscape considered captures the stochastic confluence of plant performance, component health evolution, power demand from the grid, diverse maintenance actions, and operator-defined goals and constraints, all considered over meaningfully long-enough reasoning horizons. Key aspects of the proposed approach are a receding horizon control-inspired technique dictating time- or event-triggered supervisory policy (re-)constructions, as well as additional capability-enabling contributions such as timescale compression, to handle long reasoning horizons and uncertainty in parts of the problem, and practical yet demonstrably-effective handling of hybrid action spaces with continuous and discrete decision variables. The resulting algorithm consists of a simulation-based RL agent constructing stochastic supervisory control policies over nontrivial action spaces and for long horizons, applying the learned policy to the system for a much shorter interval, and perpetually repeating, to construct the next long-horizon policy. That next policy will only be applied, again, for a short interval, yet originally far-in-time events move progressively closer, their associated uncertainty decreases, and new events and aspects enter the reasoning horizon. The proposed methodology bridges fundamental receding horizon concepts with the unequivocally stronger and more scalable reasoning of contemporary RL. Numerical examples using Soft Actor–Critic Deep RL illustrate the operation and efficacy of the proposed technique for a power plant tasked with health-aware load following missions in a dynamic electricity market landscape.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Performance portable ice-sheet modeling with MALI

High-resolution simulations of polar ice sheets play a crucial role in the ongoing effort to develop more accurate and reliable Earth system models for probabilistic sea-level projections. These simulations often require a massive amount of memory and computation from large supercomputing clusters to provide sufficient accuracy and resolution; therefore, it has become essential to ensure performance on these platforms. Many of today’s supercomputers contain a diverse set of computing architectures and require specific programming interfaces in order to obtain optimal efficiency. In an effort to avoid architecture-specific programming and maintain productivity across platforms, the ice-sheet modeling code known as MPAS-Albany Land Ice (MALI) uses high-level abstractions to integrate Trilinos libraries and the Kokkos programming model for performance portable code across a variety of different architectures. In this article, we analyze the performance portable features of MALI via a performance analysis on current CPU-based and GPU-based supercomputers. The analysis highlights not only the performance portable improvements made in finite element assembly and multigrid preconditioning within MALI with speedups between 1.26 and 1.82x across CPU and GPU architectures but also identifies the need to further improve performance in software coupling and preconditioning on GPUs. We perform a weak scalability study and show that simulations on GPU-based machines perform 1.24–1.92x faster when utilizing the GPUs. The best performance is found in finite element assembly, which achieved a speedup of up to 8.65x and a weak scaling efficiency of 82.6% with GPUs. We additionally describe an automated performance testing framework developed for this code base using a changepoint detection method. The framework is used to make actionable decisions about performance within MALI. We provide several concrete examples of scenarios in which the framework has identified performance regressions, improvements, and algorithm differences over the course of 2 years of development.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2022

Market Barriers and Drivers for the Next Generation Fault Detection and Diagnostic Tools

Commercial buildings in the U.S. consume as much as 30% excess energy compared to buildings that operate fault free and efficiently. Fault detection and diagnostic (FDD) platforms help to continually identify operational inefficiencies and maintain low-carbon performance. However, the recommendations generated by FDD tools need to be implemented by technicians, resulting in delays or lost savings opportunities. Recent research advances showed fault AUTOcorrection integrating with commercial FDD offerings filled this gap. Seven innovative AUTOcorrection algorithms were integrated into two FDD platforms and deployed across four buildings. The enhanced tools successfully correct faults focusing on incorrectly programmed schedules, override not released, control hunting, rogue zone, and suboptimal setpoints. Although its technical efficacy has been proven in the field, fault AUTO-correction is still early in the deployment cycle and opportunities and barriers need to be understood to reach its full potential in market transformation. This paper broadly introduces the new technology that automatically corrects HVAC faults. The authors describe in detail technology potential, market barriers, and enablers for scalability based on field testing results and interviews with the FDD providers and facility managers. The interviewees agreed that AUTO-correction can reduce the extent to which savings are dependent upon human intervention, scale building operators’ ability to act on FDD findings (especially for facilities with small operation teams), and achieve significant savings. To enable scalable deployment, future efforts are needed to overcome the barriers such as cybersecurity and accountability concerns from building operators and standardization of control parameters used in building automation systems.

Pritoni, Marco↗
NASA NTRS2014

Weekly Gridded Aquarius L-band Radiometer-scatterometer Observations and Salinity Retrievals over the Polar Regions - Part 1: Product Description

Passive and active observations at L band (frequency (is) approximately 1.4 GHz) from the Aquarius/SAC-D mission offer new capabilities to study the polar regions. Due to the lack of polar-gridded products, however, applications over the cryosphere have been limited. We present three weekly polar-gridded products of Aquarius data to improve our understanding of L-band observations of ice sheets, sea ice, permafrost, and the polar oceans. Additionally, these products intend to facilitate access to L-band data, and can be used to assist in algorithm developments. Aquarius data at latitudes higher than 50 degrees are averaged and gridded into weekly products of brightness temperature (TB), normalized radar cross section (NRCS), and sea surface salinity (SSS). Each grid cell also contains sea ice fraction, the standard deviation of TB, NRCS, and SSS, and the number of footprint observations collected during the seven-day cycle. The largest 3 dB footprint dimensions are 97 km×156 km and 74 km×122 km (along × across track) for the radiometers and scatterometer, respectively. The data is gridded to the Equal-Area Scalable Earth version 2.0 (EASE2.0) grid, with a grid cell resolution of 36 km. The data sets start in August 2011, with the first Aquarius observations and will be updated on a monthly basis following the release schedule of the Aquarius Level 2 data sets. The weekly gridded products are distributed by the US National Snow and Ice Data Center at http://nsidc.org/data/aquarius/index.html

Aquarius↗
NASA NTRS2024

The Knowledge-based Digital Platform Concept for Advanced Air Mobility Research and Development

National Aeronautics and Space Administration (NASA) Langley Research Center (LaRC) is spearheading an innovative digital engineering approach to integrate, communicate, and facilitate the research of multi-modal transportation systems. The Knowledge-based Digital Platform (KbDP) is a concept being developed that ties the workflows of Project Managers (PM), Principal Investigators (PI), and System Engineers (SE) together across organizational boundaries. The overarching vision for the KbDP Concept for AAM R&D is a substantial undertaking. The initial concept and implementation will focus on UAM operations to tractably learn and adjust the concept with a manageable database. Lessons learned and best practices with a smaller scope will enable successful scalability to AAM R&D or even to the entire modes of transportation and logistics. The UAM vision is one in which advanced technologies and new operational procedures enable practical and cost-effective air transport as an integrated mode of movement of people and goods throughout metropolitan areas. Initial implementation of three KbDP concepts of use shows promising benefits to NASA’s Air Traffic Management-Exploration (ATM-X) UAM Airspace Subproject. It is envisioned that the KbDP will manage an information database defined by mathematical, data science, and system engineering principles. AIML algorithms play a vital role in this KbDP concept by extracting meaningful knowledge from the information database, which the human user leverages to improve the efficiency and effectiveness of their research greatly.

ATM↗
DOE OSTI2022

PETSc TSAdjoint: A Discrete Adjoint ODE Solver for First-Order and Second-Order Sensitivity Analysis

Here, we present a new software system PETSc TSAdjoint for first-order and second order adjoint sensitivity analysis of time-dependent nonlinear differential equations. The derivative calculation in PETSc TSAdjoint is essentially a high-level algorithmic differentiation process. The adjoint models are derived by differentiating the timestepping algorithms and implementing them based on the parallel infrastructure in PETSc. Full differentiation of the library code, including MPI routines, is avoided, and users do not need to derive their own adjoint models for their specific applications. PETSc TSAdjoint can compute the first-order derivative, that is, the gradient of a scalar functional, and the Hessian-vector product, which carries second-order derivative information, while requiring minimal input (a few callbacks) from the users. The adjoint model employs optimal checkpointing schemes in a manner that is transparent to users. Finally, usability, efficiency, and scalability are demonstrated through examples from a variety of applications.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2026

Methods development towards automated, physics-informed, quantitative quality control of TRISO-SiC

Tristructural-isotropic (TRISO) fuel particles have been developed as a high-performance fuel for use in high-temperature gas-cooled reactor (HTGR) systems due to their high efficiency and stability under both normal and off-normal conditions. Broader deployment of this technology in advanced nuclear applications may benefit from quantitative quality assurance and quality control (QA/QC) methods that directly link TRISO properties to downstream performance. A key TRISO property is the SiC layer microstructure, which influences fission product retention during irradiation. However, existing QA/QC for the TRISO-SiC microstructure comprises only a qualitative visual inspection; therefore, there is a clear opportunity for the development of quantitative methods for TRISO QA/QC. Here, to this end, previous work has demonstrated an image processing approach to grain boundary (GB) identification and subsequent extraction of microstructural metrics; however, extensive twinning within the SiC layer complicates such analyses because twin GBs significantly influence microstructural metrics but are not expected to contribute to fission product transport. This study presents the initial development, training, and testing of an ML-based image segmentation algorithm designed to identify and remove twin GBs from standard backscattered electron micrographs, providing an industrially applicable, quantitative, and physically meaningful QA/QC approach for the TRISO-SiC microstructure. Although pixel-wise performance metrics for the twin predictions are low, the change in grain area and the number of GB pixels after twin removal predicted by the ML workflow are within 1% of the true values calculated using crystallographic data. This suggests that the model is well capable of predicting overall twin boundary structures and grain morphology, and continued advancement of this approach could enable automated, scalable, and physics-informed QA/QC for TRISO-SiC microstructures, supporting the reliable qualification of coated particle fuels for next-generation reactor systems.

Computer vision↗
DOE OSTI2024

Scalable semidefinite programming approach to variational embedding for quantum many-body problems

In quantum embedding theories, a quantum many-body system is divided into localized clusters of sites which are treated with an accurate ‘high-level’ theory and glued together self-consistently by a less accurate ‘low-level’ theory at the global scale. The recently introduced variational embedding approach for quantum many-body problems combines the insights of semidefinite relaxation and quantum embedding theory to provide a lower bound on the ground-state energy that improves as the cluster size is increased. The variational embedding method is formulated as a semidefinite program (SDP), which can suffer from poor computational scaling when treated with black-box solvers. Here, we exploit the interpretation of this SDP as an embedding method to develop an algorithm which alternates parallelizable local updates of the high-level quantities with updates that enforce the low-level global constraints. Moreover, we show how translation invariance in lattice systems can be exploited to reduce the complexity of projecting a key matrix to the positive semidefinite cone.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRSDate not supplied

Formalized Reasoning of Operational Volumes for Wildland Fire Fighting

This work is focused on the formalized reasoning of operational volumes as it relates to the current and future technologies developed by NASA to aid in wildland firefighting operations. One such technology is the Unmanned Aircraft System Pilot Kit (UASP-kit) developed by the Scalable Traffic Management for Emergency Response Operations (STEReO) project at NASA, which is used to increase situational awareness for a ground operator in the field. The UASP-kit utilizes operational volumes to represent mission areas and alerting volumes; these volumes, in combinations with ADS-B data, can then be used to alert the ground operator when another aircraft has entered one of these areas. This work presents a rigorous foundation for the concept of operational volumes for modeling and prototyping operations in such a tool as the UASP-kit. This includes establishing a class of algorithms to detect when an object is in an operational volume, and when one operational volume intersects or is contained in another. Additionally, this work provides rigorous proof that the algorithms work as intended. Scenarios are presented that model current UASP-kit operations and extend past the current capabilities of the technology to modeling more complex scenarios such as mission planning.

Operational Volumes↗