Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “algorithms scalability”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

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

At least 1,459 records · Page 81

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↗

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↗

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↗

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↗

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↗

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↗

Improvements to the APBS biomolecular solvation software suite: Improvements to the APBS Software Suite

The Adaptive Poisson-Boltzmann Solver (APBS) software was developed to solve the equations of continuum electrostatics for large biomolecular assemblages that has provided impact in the study of a broad range of chemical, biological, and biomedical applications. APBS addresses three key technology challenges for understanding solvation and electrostatics in biomedical applications: accurate and efficient models for biomolecular solvation and electrostatics, robust and scalable software for applying those theories to biomolecular systems, and mechanisms for sharing and analyzing biomolecular electrostatics data in the scientific community. To address new research applications and advancing computational capabilities, we have continually updated APBS and its suite of accompanying software since its release in 2001. In this manuscript, we discuss the models and capabilities that have recently been implemented within the APBS software package including: a Poisson-Boltzmann analytical and a semi-analytical solver, an optimized boundary element solver, a geometry-based geometric flow solvation model, a graph theory based algorithm for determining pKa values, and an improved web-based visualization tool for viewing electrostatics.

Biomedical applications↗

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↗

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↗

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↗

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↗

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↗

A Computationally Efficient Algorithm for Computing Convex Hull Prices

Electricity markets worldwide allow participants to bid non-convex production offers. While non-convex offers can more accurately reflect a resource's capabilities, they create challenges for market clearing processes. For example, system operators may execute side payments when a participant’s cost is not covered through energy sale settlements from locational marginal pricing schemes, or when a participant incurs lost opportunity costs to follow the dispatch signal. Convex hull pricing minimizes these and other types of side payments while providing uniform (i.e., locationally and temporally consistent) prices. However, computing convex hull prices involves solving either a large-scale linear program - which in turn requires explicit descriptions of market participants’ convex hulls -or the Lagrangian dual of the corresponding non-convex scheduling problem. Here, we propose a computationally feasible and industrially scalable Benders decomposition approach to computing convex hull prices at least an order of magnitude faster than the current state-of-the-art while leveraging recent advances in convex hull formulations for thermal generating units.

61 RADIATION PROTECTION AND DOSIMETRY↗

A Modular and Transferable Reinforcement Learning Framework for the Fleet Rebalancing Problem

Mobility on demand (MoD) systems show great promise in realizing flexible and efficient urban transportation. However, significant technical challenges arise from operational decision making associated with MoD vehicle dispatch and fleet rebalancing. For this reason, operators tend to employ simplified algorithms that have been demonstrated to work well in a particular setting. To help bridge the gap between novel and existing methods, we propose a modular framework for fleet rebalancing based on model-free reinforcement learning (RL) that can leverage an existing dispatch method to minimize system cost. In particular, by treating dispatch as part of the environment dynamics, a centralized agent can learn to intermittently direct the dispatcher to reposition free vehicles and mitigate against fleet imbalance. We formulate RL state and action spaces as distributions over a grid partitioning of the operating area, making the framework scalable and avoiding the complexities associated with multiagent RL. Numerical experiments, using real-world trip and network data, demonstrate that RL reduces waiting time by 28% to 38% for the same-day evaluation, 17% to 44% for cross-day evaluation, and 22% to 25% for cross-season evaluation compared with no rebalancing scenarios. This approach has several distinct advantages over baseline methods including: improved system cost; high degree of adaptability to the selected dispatch method; and the ability to perform scale-invariant transfer learning between problem instances with similar vehicle and request distributions.

33 ADVANCED PROPULSION SYSTEMS↗

Reverse-Mode Algorithmic Differentiation of an OpenMP-Parallel Compressible Flow Solver

y Reverse-mode algorithmic differentiation (AD) is an established method for obtaining adjoint derivatives of computer simulation applications. In computational fluid dynamics (CFD), adjoint derivatives of a cost function output such as drag or lift with respect to design parameters such as surface coordinates or geometry control points are a key ingredient for shape optimization, uncertainty quantification and flow control. The computational cost of CFD applications and their derivatives makes it essential to use high-performance computing hardware efficiently, including multi- and many-core architectures. Nevertheless, OpenMP is not supported in most AD tools, and previously shown methods achieve poor scalability of the derivative code. We present the AD of an OpenMP-parallelized finite volume compressible flow solver for unstructured meshes. Our approach enables us to reuse the parallelization of the original code in the computation of adjoint derivatives. The method works by identifying code segments that can be differentiated in reverse-mode without changing their memory access pattern. The OpenMP parallelization is integrated into the derivative code during the build process in a way that is robust to modifications of the original code and independent of the OpenMP support of the differentiation tool. We show the scalability of our adjoint CFD solver on test cases ranging from thousands to millions of finite volume mesh cells on CPUs with up to 16 threads as well as on an Intel XeonPhi card with 236 threads. We demonstrate that our approach is more practical to implement for production-sized CFD codes and produces more efficient adjoint derivative code than previously shown AD methods.

Huckelheim, Jan↗

Very Large Scale Optimization

The purpose of this research under the NASA Small Business Innovative Research program was to develop algorithms and associated software to solve very large nonlinear, constrained optimization tasks. Key issues included efficiency, reliability, memory, and gradient calculation requirements. This report describes the general optimization problem, ten candidate methods, and detailed evaluations of four candidates. The algorithm chosen for final development is a modern recreation of a 1960s external penalty function method that uses very limited computer memory and computational time. Although of lower efficiency, the new method can solve problems orders of magnitude larger than current methods. The resulting BIGDOT software has been demonstrated on problems with 50,000 variables and about 50,000 active constraints. For unconstrained optimization, it has solved a problem in excess of 135,000 variables. The method includes a technique for solving discrete variable problems that finds a "good" design, although a theoretical optimum cannot be guaranteed. It is very scalable in that the number of function and gradient evaluations does not change significantly with increased problem size. Test cases are provided to demonstrate the efficiency and reliability of the methods and software.

Vanderplaats, Garrett↗

Python & Qt, Powerful Tools for Technical Computing

The objective of this presentation is to give a brief overview of Python computer language and Qt for Python which provides an interface to Python for building graphical applications. The Qt language provides a method for rapid programming of Graphical User Interfaces (GUIs) that are highly scalable, robust and platform independent. Both Python and Qt provide a powerful set of tools for Dynamic Analysis which are based on Open-Source software. Many problems and calculations in Structural Dynamics such as Power Spectral Density, Shock Response Spectrum and Vibration Response Spectrum can be easily calculated using these tools. The advantage of using Open-Source software is the ability to create custom graphical user interfaces similar to Matlab without the expense of software licensing and the ability to customize the software to an organization's specific needs. Also, another advantage is the ability to know which algorithms are being used by the GUI, know the numerical limitations and scale to large size data sets. I will end the presentation by demonstrating a Structural Dynamics GUI I created that was designed primarily to interactively analyze Post Flight high speed data provided by the ground station telemetry networks.

Grillo, Vincent↗

Final report of a scalable, automated, semipermanent seismic array (SASSA) method for detecting CO 2 extent during geologic CO 2 injection

The scalable, automated, semipermanent seismic array (SASSA) project led and managed by the Energy & Environmental Research Center (EERC) was designed as a 3-year proof-of-concept study to evaluate and demonstrate an innovative application of the seismic method. The concept was to use a sparse surface array of 96 nodal seismic sensors paired with a single, remotely operated active seismic source at a fixed location to monitor for CO 2 saturation changes in a subsurface reservoir by processing the data for time-lapse changes at individual, strategically chosen reservoir reflection points. The combination of autonomous equipment and modern processing algorithms was used to apply the seismic method in a manner different from the normal paradigm of collecting a spatially dense data set to produce an image. It was used instead to monitor individual, strategically chosen reservoir reflection points for detectable signal character changes that could be attributed to the passing of a CO 2 saturation front or, possibly, changes in reservoir pressure. Data collection occurred over the course of 1 year at an oil field undergoing CO 2 injection for enhanced oil recovery (EOR) and focused on four overlapping “five-spot” EOR injector–producer patterns. Selection, procurement, configuration, installation, and testing of project equipment and collection of five baseline data sets were completed in advance of CO 2 injection within the study area. Weekly remote data collection produced 41 incremental time-lapse records for each of the 96 nodes. Validation was provided by two methods: 1) a conventional 2-D seismic line acquired through the center of the study area before injection started and again after the project ended and processed in a time-lapse manner and 2) by CO 2 saturation maps created from reservoir simulations based on injection and production history matching. Interpreted results were encouraging but mixed, with indications of changes likely due to the presence of CO 2 on some node reflection points where and when effects would be expected and noneffects where no CO 2 was expected, while results at some locations where simulation outputs suggested CO 2 should be present were ambiguous. Acquisition noise impacted interpretation of data at several locations. Many lessons learned were generated by the study to inform and improve results on a follow-up study. The ultimate aim of the project was to evaluate whether deployment of a SASSA technology can provide a useful and cost-effective monitoring solution for future CO 2 injection projects. The answer appears to be affirmative, with the expectation that lessons learned applied to future iterations, together with technology advances, will likely result in significant improvements.

58 GEOSCIENCES↗