Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Computational Complexity”

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,207 records · Page 67

Integrative computational investigation of the spectroscopy, dynamics, and controlling of molecular excitons in complex environments (Final Technical Report)

The major goal of this research project was to advance theoretical and computational capability to describe the dynamics and the spectroscopy of molecular excitons as reliably and efficiently as possible. Outcomes of the project contributed to new understanding of the interaction between light and molecular materials and ensuing dynamics of excited electronic states. These can assist experimentalists in developing novel methods to utilize quantum properties of molecules and molecular excitons for new energy harvesting and quantum information processing.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Designing molecular qubits: computational insights into first-row and group 6 transition metal complexes

In the realm of optically addressable qubits, a previously synthesized and characterized Cr( IV ) pseudo-tetrahedral complex, featuring four strongly donating ligands surrounding the chromium center, has demonstrated potential as a qubit candidate. This study proposes analogs of this complex through a metal substitution strategy, extending the investigation to different complexes based on metal centers selected from first-row and Group 6 transition metals. Computational modeling based on multiconfigurational methods CASPT2 and MC-PDFT was utilized to calculate energy gaps between ground and excited electronic spin states, and zero-field splitting parameters. Simulations were applied to each equilibrium geometry and related deformations based on vibrational modes. All results align with previous experimental findings, but also show that qubits based on V and Ti centers could be more electronically stable than the Cr one, suggesting a lower electronic features dependency from their related geometry. In some cases geometrical deformations provide changes in relative energy gaps between triplet and singlet excited state, that could potentially swap, offering a different initialization process, and some inspiration for ligand design based on such deformations. Additionally, this study identifies an unsynthesized Ti( II ) compound as a promising candidate for molecular qubits. This finding highlights the role of computational multireference methods in the rational design of qubit systems.

Sauza-de la Vega, Arturo [Univ. of Chicago, IL (Un↗

Quantum Distributed Unit Commitment: An Application in Microgrids

The dawn of quantum computing brings on a revolution in the way combinatorially complex power system problems such as Unit Commitment are solved. The Unit Commitment problem complexity is expected to increase in the future because of the trend toward the increase of penetration of intermittent renewables. Even though quantum computing has proven effective for solving a host of problems, its applications for power systems’ problems have been rather limited. Here, in this paper, a quantum unit commitment is innovatively formulated and the quantum version of the decomposition and coordination alternate direction method of multipliers (ADMM) is established. The above is achieved by devising quantum algorithms and by exploiting the superposition and entanglement of quantum bits (qubits) for solving subproblems, which are then coordinated through ADMM to obtain feasible solutions. The main contributions of this paper include: 1) the innovative development of a quantum model for Unit Commitment; 2) development of decomposition and coordination-supported framework which paves the way for the utilization of limited quantum resources to potentially solve the large-scale discrete optimization problems; 3) devising the novel quantum distributed unit commitment (QDUC) to solve the problem in a larger scale than currently available quantum computers are capable of solving. The QDUC results are compared with those from its classical counterpart, which validate the efficacy of quantum computing.

97 MATHEMATICS AND COMPUTING↗

ECP libraries and tools: An overview

The Exascale Computing Project (ECP) Software Technology and Co-Design teams addressed the growing complexities in high-performance computing (HPC) by developing scalable software libraries and tools that leverage exascale system capabilities. As we enter the exascale era, the need for reusable, optimized software solutions that can handle the unique challenges posed by these systems becomes increasingly important. The primary challenges the ECP teams faced were to create software libraries and tools that are performant on exascale architectures and portable and usable across diverse hardware platforms. Efforts addressed issues related to concurrent execution, memory management, and the integration of heterogeneous computing resources, such as GPUs from multiple vendors. The ECP’s strategy involved a structured development process encompassing the creation, optimization, and deployment of software in collaboration with industry, academia, and national laboratories. The project was organized into several technical areas: co-design of domain-specific suites with target applications, programming models and runtimes, development tools, mathematical libraries, data and visualization tools, and software ecosystem and delivery mechanisms. ECP has successfully developed a large portfolio of software libraries and tools that demonstrate significant improvements in performance and scalability on exascale systems. These products have been integrated into the Department of Energy’s computing facilities, supporting various scientific applications and ensuring robust performance across different hardware setups. ECP advancements in software development for exascale computing highlight the importance of a collaborative and adaptive approach to handling next-generation HPC systems complexities. The lessons learned emphasize the need for continuous engagement with end-users and vendors, and the importance of maintaining a balance between innovation and practical implementation. Future efforts will focus on ensuring scalability, keeping pace with rapid hardware advancements, and further enhancing the interoperability and usability of the software ecosystem. In conclusion, subsequent articles in this special issue provide in-depth discussions and case studies into specific library and tool efforts.

97 MATHEMATICS AND COMPUTING↗

MSTor 2023 : A new version of the computer code for multistructural torsional anharmonicity, now with automatic torsional identification using redundant internal coordinates

The MSTor program is a computer program for calculating partition functions and thermodynamic functions of complex gas-phase molecules with multiple torsions; the multi-structural approximation with torsional anharmonicity (MS-T) can be used based on either a coupled torsional potential or an uncoupled torsional potential. The program can also carry out calculations in the multiple-structure local harmonic (MS-LH) approximation or multi-structural local quasiharmonic (MS-LQ) approximation or by the dual-level MS-T method. Furthermore, the program package includes eight utility codes that can be used as stand-alone programs to help the user to generate the input files for the code or to generate comparison results. The 2023 version of MSTor includes a new capability, namely automatic identification of torsional modes with redundant internal coordinates.

97 MATHEMATICS AND COMPUTING↗

A hydrological emulator for global applications – HE v1.0.0

Abstract. While global hydrological models (GHMs) are very useful in exploring water resources and interactions between the Earth and human systems, their use often requires numerous model inputs, complex model calibration, and high computation costs. To overcome these challenges, we construct an efficient open-source and ready-to-use hydrological emulator (HE) that can mimic complex GHMs at a range of spatial scales (e.g., basin, region, globe). More specifically, we construct both a lumped and a distributed scheme of the HE based on the monthly abcd model to explore the tradeoff between computational cost and model fidelity. Model predictability and computational efficiency are evaluated in simulating global runoff from 1971 to 2010 with both the lumped and distributed schemes. The results are compared against the runoff product from the widely used Variable Infiltration Capacity (VIC) model. Our evaluation indicates that the lumped and distributed schemes present comparable results regarding annual total quantity, spatial pattern, and temporal variation of the major water fluxes (e.g., total runoff, evapotranspiration) across the global 235 basins (e.g., correlation coefficient r between the annual total runoff from either of these two schemes and the VIC is >0.96), except for several cold (e.g., Arctic, interior Tibet), dry (e.g., North Africa) and mountainous (e.g., Argentina) regions. Compared against the monthly total runoff product from the VIC (aggregated from daily runoff), the global mean Kling–Gupta efficiencies are 0.75 and 0.79 for the lumped and distributed schemes, respectively, with the distributed scheme better capturing spatial heterogeneity. Notably, the computation efficiency of the lumped scheme is 2 orders of magnitude higher than the distributed one and 7 orders more efficient than the VIC model. A case study of uncertainty analysis for the world's 16 basins with top annual streamflow is conducted using 100 000 model simulations, and it demonstrates the lumped scheme's extraordinary advantage in computational efficiency. Our results suggest that the revised lumped abcd model can serve as an efficient and reasonable HE for complex GHMs and is suitable for broad practical use, and the distributed scheme is also an efficient alternative if spatial heterogeneity is of more interest.

Liu, Yaling↗

Efficient Reformulation of Linear and Nonlinear Solid-Phase Diffusion in Lithium-ion Battery Models using Symmetric Polynomials: Mass Conservation and Computational Efficiency

Lithium-ion batteries are typically modeled using porous electrode theory coupled with various transport and reaction mechanisms, along with suitable discretization or approximations for the solid-phase diffusion equation. The solid-phase diffusion equation represents the main computational burden for typical pseudo-2-dimensional (p2D) models since these equations in the pseudo r -dimension must be solved at each point in the computational grid. This substantially increases the complexity of the model as well as the computational time. Traditional approaches towards simplifying solid-phase diffusion possess certain significant limitations, especially in modeling emerging electrode materials which involve phase changes and variable diffusivities. A computationally efficient representation for solid-phase diffusion is discussed in this paper based on symmetric polynomials using Orthogonal Collocation and Galerkin formulation (weak form). A systematic approach is provided to increase the accuracy of the approximation (p form in finite element methods) to enable efficient simulation with a minimal number of semi-discretized equations, ensuring mass conservation even for non-linear diffusion problems involving variable diffusivities. These methods are then demonstrated by incorporation into the full p2D model, illustrating their advantages in simulating high C-rates and short-time dynamic operation of Lithium-ion batteries.

25 ENERGY STORAGE↗

Modeling Analog Tile-Based Accelerators Using SST

Analog computing has been widely proposed to improve the energy efficiency of multiple important workloads including neural network operations, and other linear algebra kernels. To properly evaluate analog computing and explore more complex workloads such as systems consisting of multiple analog data paths, system level simulations are required. Moreover, prior work on system architectures for analog computing often rely on custom simulators creating signficant additional design effort and complicating comparisons between different systems. To remedy these issues, this report describes the design and implementation of a flexible tile-based analog accelerator element for the Structural Simulation Toolkit (SST). The element focuses on heavily on the tile controller—an often neglected aspect of prior work—that is sufficiently versatile to simulate a wide range of different tile operations including neural network layers, signal processing kernels, and generic linear algebra operations without major constraints. The tile model also interoperates with existing SST memory and network models to reduce the overall development load and enable future simulation of heterogeneous systems with both conventional digital logic and analog compute tiles. Finally, both the tile and array models are designed to easily support future extensions as new analog operations and applications that can benefit from analog computing are developed.

97 MATHEMATICS AND COMPUTING↗

Information geometry of Gaussian channels

We define a local Riemannian metric tensor in the manifold of Gaussian channels and the distance that it induces. We adopt an information-geometric approach and define a metric derived from the Bures-Fisher metric for quantum states. The resulting metric inherits several desirable properties from the Bures-Fisher metric and is operationally motivated by distinguishability considerations: It serves as an upper bound to the attainable quantum Fisher information for the channel parameters using Gaussian states, under generic constraints on the physically available resources. Our approach naturally includes the use of entangled Gaussian probe states. We prove that the metric enjoys some desirable properties like stability and covariance. As a by-product, we also obtain some general results in Gaussian channel estimation that are the continuous-variable analogs of previously known results in finite dimensions. We prove that optimal probe states are always pure and bounded in the number of ancillary modes, even in the presence of constraints on the reduced state input in the channel. This has experimental and computational implications. It limits the complexity of optimal experimental setups for channel estimation and reduces the computational requirements for the evaluation of the metric: Indeed, we construct a converging algorithm for its computation. We provide explicit formulas for computing the multiparametric quantum Fisher information for dissipative channels probed with arbitrary Gaussian states and provide the optimal observables for the estimation of the channel parameters (e.g., bath couplings, squeezing, and temperature).

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Global Sensitivity Measures from Given Data

Simulation models support managers in the solution of complex problems. International agencies recommend uncertainty and global sensitivity methods as best practice in the audit, validation and application of scientific codes. However, numerical complexity, especially in the presence of a high number of factors, induces analysts to employ less informative but numerically cheaper methods. This work introduces a design for estimating global sensitivity indices from given data (including simulation input–output data), at the minimum computational cost. We address the problem starting with a statistic based on the L1-norm. A formal definition of the estimators is provided and corresponding consistency theorems are proved. The determination of confidence intervals through a bias-reducing bootstrap estimator is investigated. The strategy is applied in the identification of the key drivers of uncertainty for the complex computer code developed at the National Aeronautics and Space Administration (NASA) assessing the risk of lunar space missions. We also introduce a symmetry result that enables the estimation of global sensitivity measures to datasets produced outside a conventional input–output functional framework.

99 GENERAL AND MISCELLANEOUS↗

Performance Analysis of an Optimization Algorithm for Metamaterial Design on the Integrated High-Performance Computing and Quantum Systems

Optimizing metamaterials with complex geometries is a big challenge. Although an active learning algorithm, combining machine learning (ML), quantum computing, and optical simulation, has emerged as an efficient optimization tool, it still faces difficulties in optimizing complex structures that have potentially high performance. In this work, we comprehensively analyze the performance of an optimization algorithm for metamaterial design on the integrated HPC and quantum systems. We demonstrate significant time advantages through message-passing interface (MPI) parallelization on the high-performance computing (HPC) system showing approximately 54% faster ML tasks and 67 times faster optical simulation against serial workloads. Furthermore, we analyze the performance of a quantum algorithm designed for optimization, which runs with various quantum simulators on a local computer or HPC-quantum system. Results showcase ~24 times speedup when executing the optimization algorithm on the HPC-quantum hybrid system. This study paves a way to optimize complex metamaterials using the integrated HPC-quantum system.

Kim, Seongmin↗

Computationally Efficient Multiscale Neural Networks Applied to Fluid Flow in Complex 3D Porous Media

Abstract The permeability of complex porous materials is of interest to many engineering disciplines. This quantity can be obtained via direct flow simulation, which provides the most accurate results, but is very computationally expensive. In particular, the simulation convergence time scales poorly as the simulation domains become less porous or more heterogeneous. Semi-analytical models that rely on averaged structural properties (i.e., porosity and tortuosity) have been proposed, but these features only partly summarize the domain, resulting in limited applicability. On the other hand, data-driven machine learning approaches have shown great promise for building more general models by virtue of accounting for the spatial arrangement of the domains’ solid boundaries. However, prior approaches building on the convolutional neural network (ConvNet) literature concerning 2D image recognition problems do not scale well to the large 3D domains required to obtain a representative elementary volume (REV). As such, most prior work focused on homogeneous samples, where a small REV entails that the global nature of fluid flow could be mostly neglected, and accordingly, the memory bottleneck of addressing 3D domains with ConvNets was side-stepped. Therefore, important geometries such as fractures and vuggy domains could not be modeled properly. In this work, we address this limitation with a general multiscale deep learning model that is able to learn from porous media simulation data. By using a coupled set of neural networks that view the domain on different scales, we enable the evaluation of large ( $$>512^3$$ > 512 3 ) images in approximately one second on a single graphics processing unit. This model architecture opens up the possibility of modeling domain sizes that would not be feasible using traditional direct simulation tools on a desktop computer. We validate our method with a laminar fluid flow case using vuggy samples and fractures. As a result of viewing the entire domain at once, our model is able to perform accurate prediction on domains exhibiting a large degree of heterogeneity. We expect the methodology to be applicable to many other transport problems where complex geometries play a central role.

36 MATERIALS SCIENCE↗

Modeling of Protein Binary Complexes Using Structural Mass Spectrometry Data

In this article, we describe a general approach to modeling the structure of binary protein complexes using structural mass spectrometry data combined with molecular docking. In the first step, hydroxyl radical mediated oxidative protein footprinting is used to identify residues that experience conformational reorganization due to binding or participate in the binding interface. In the second step, a three-dimensional atomic structure of the complex is derived by computational modeling. Homology modeling approaches are used to define the structures of the individual proteins if footprinting detects significant conformational reorganization as a function of complex formation. A three-dimensional model of the complex is constructed from these binary partners using the ClusPro program, which is composed of docking, energy filtering, and clustering steps. Footprinting data are used to incorporate constraints--positive and/or negative--in the docking step and are also used to decide the type of energy filter--electrostatics or desolvation--in the successive energy-filtering step. By using this approach, we examine the structure of a number of binary complexes of monomeric actin and compare the results to crystallographic data. Based on docking alone, a number of competing models with widely varying structures are observed, one of which is likely to agree with crystallographic data. When the docking steps are guided by footprinting data, accurate models emerge as top scoring. We demonstrate this method with the actin/gelsolin segment-1 complex. We also provide a structural model for the actin/cofilin complex using this approach which does not have a crystal or NMR structure.

59 BASIC BIOLOGICAL SCIENCES↗

Ammonia Oxidation by Abstraction of Three Hydrogen Atoms from a Mo–NH 3 Complex

We report ammonia oxidation by homolytic cleavage of all three H atoms from a Mo৶ 15 NH 3 complex using the 2,4,6-tri-tert-butylphenoxyl radical to afford a Mo-alkylimido (Mo৶ 15 NR) complex (R = 2,4,6-tri-t-butylcyclohexa-2,5-dien-1-one). Reductive cleavage of Mo৶15NR generates a terminal Mo৶N nitride, and a [Mo৶ 15 NH] + complex is formed by protonation. Computational analysis describes the energetic profile for the stepwise removal of three H atoms from the Mo৶ 15 NH 3 complex and the formation of Mo৶ 15 NR. Acknowledgment. This work was supported as part of the Center for Molecular Electrocatalysis, an Energy Frontier Re-search Center funded by the U.S. Department of Energy (U.S. DOE), Office of Science, Office of Basic Energy Sciences. EPR and mass spectrometry experiments were performed using EMSL, a national scientific user facility sponsored by the DOE’s Office of Biological and Environmental Research and located at PNNL. The authors thank Dr. Eric D. Walter and Dr. Rosalie Chu for assistance in performing EPR and mass spectroscopy analysis, respectively. Computational resources provided by the National Energy Re-search Scientific Computing Center (NERSC) at Lawrence Berkeley National Laboratory. Pacific North-west National Laboratory is operated by Battelle for the U.S. DOE.

Molybdenum, ammonia, phosphines, pendant amines, h↗

Process Image Analysis using Big Data, Machine Learning, and Computer Vision

Within the DOE complex, 3013 canisters are used to store Pu-bearing waste. Wall penetration due to corrosion, specifically stress corrosion cracking, is considered to be the most likely cause of failure over the 50-year lifetime of the canisters. This project has 2 objectives: The first is the development of machine learning algorithms to identify the presence of corrosion from a very large set of images generated by laser confocal microscope scanning of 3013 canister used to store Pu oxides. This portion of the LDRD constitutes image analysis of a metal surface for the presence of corrosion. The image processing algorithms developed for this project will provide a suitable basis for analysis of other types of corrosion data, which can be produced in vast quantities using modern devices. The second component of the LDRD consists of the development of machine learning algorithms that obtain molecular mechanics force-fields from ab-initio Density Functional Theory (DFT) calculations for corrosive attack by chlorides on 304L or 316L stainless steel. The goal of this latter component is to determine means for mitigating corrosion on a fundamental level, including coatings, welding methods, metal composition, etc. Force-field modeling is necessary for this endeavor because the incipience and progression of corrosion is the governed by molecular structures, grain boundaries, dislocations and surface structures represented by large numbers of atoms. Although DFT calculations are extremely adept at describing molecular scale processes, they are computationally expensive making them ill-suited for calculations of more than several hundred atoms, especially for the repeated applications inherent in material design. Fortunately, force-field methods provide an avenue for viable molecular-scale calculations involving the numbers of atoms involved in corrosion processes. The accuracy of the force-field calculations depends strongly on the accuracy of the force-field model, which is extremely difficult and time-consuming to derive from either data or ab-initio calculations. The use of machine learning algorithms has the potential to make the calculation of force-fields much more efficient but has not been explored significantly for corrosion processes. If shown to be viable, the technique would have wide -ranging impact on design of corrosion resistant materials and on the mitigation of corrosion in existing process systems.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

A Visual Comparison of Silent Error Propagation

High-performance computing (HPC) systems play a critical role in facilitating scientific discoveries. Their scale and complexity (e.g., the number of computational units and software stack) continue to grow as new systems are expected to process increasingly more data and reduce computing time. However, with more processing elements, the probability that these systems will experience a random bit-flip error that corrupts a program's output also increases, which is often recognized as silent data corruption. Analyzing the resiliency of HPC applications in extreme-scale computing to silent data corruption is crucial but difficult. An HPC application often contains a large number of computation units that need to be tested, and error propagation caused by error corruption is complex and difficult to interpret. Here, to accommodate this challenge, we propose an interactive visualization system that helps HPC researchers understand the resiliency of HPC applications and compare their error propagation. Our system models an application's error propagation to study a program's resiliency by constructing and visualizing its fault tolerance boundary. Coordinating with multiple interactive designs, our system enables domain experts to efficiently explore the complicated spatial and temporal correlation between error propagations. At the end, the system integrated a nonmonotonic error propagation analysis with an adjustable graph propagation visualization to help domain experts examine the details of error propagation and answer such questions as why an error is mitigated or amplified by program execution.

97 MATHEMATICS AND COMPUTING↗

Scalable Computation of 2D-Minkowski Sum of Arbitrary Non-Convex Domains: Modeling Flexibility in Energy Resources

The flexibility of active ($p$) and reactive power ($q$) consumption in distributed energy resources (DERs) can be represented as a (potentially non-convex) set of points in the $p$-$q$ plane. Modeling of the aggregated flexibility in a heterogeneous ensemble of DERs as a Minkowski sum (M-sum) is computationally intractable even for moderately sized populations. In this article, we propose a scalable method of computing the M-sum of the flexibility domains of a heterogeneous ensemble of DERs, which are allowed to be non-convex, non-compact. In particular, the proposed algorithm computes a guaranteed superset of the true M-sum, with desired accuracy. The worst-case complexity of the algorithm is computed. Special cases are considered, and it is shown that under certain scenarios, it is possible to achieve a complexity that is linear with the size of the ensemble. Numerical examples are provided by computing the aggregated flexibility of different mix of DERs under varying scenarios.

Kundu, Soumya↗

Accelerating Instanton Theory with the Line Integral Nudged Elastic Band Method and Gaussian Process Regression

Quantum tunneling plays a fundamental role in many chemical reactions, particularly proton transfer processes. Ring polymer instanton theory offers a practical framework for computing tunneling rates in complex molecular systems. However, applying the ring polymer instanton method with a potential energy surface generated on-the-fly using electronic structure calculations can be computationally demanding. Here, in this work, we present a new efficient implementation of the ring polymer instanton method by combining the Line Integral Nudged Elastic Band (LI-NEB) approach with Gaussian Process Regression (GPR). We benchmarked this method on prototypical ground-state proton transfer systems, including the benchmark gas-phase hydrogen abstraction reaction H + CH 4 → H 2 + CH 3 , malonaldehyde, and Z-3-amino-propenal (aminopropenal). Our results show that this approach is an order of magnitude faster than traditional instanton algorithms while maintaining excellent agreement with their tunneling rates. This development opens the door to studying proton transfer in larger systems with improved efficiency.

chemical physics↗