Search NASA⌕ Search

SEARCH · Search NASA

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 127 records · Page 7
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

A Machine Learning Framework for Modeling Ensemble Properties of Atomically Disordered Materials

Atomic disorder can strongly influence material properties such as charge transport, optical response, and catalytic activity. However, efficiently modeling these disorder effects remains challenging for first-principles methods due to the cost of sampling large configurational spaces and computing complex physical quantities. Recent advances of machine learning techniques, particularly graph neural networks (GNNs), has enabled the efficient and accurate predictions of complex material properties, offering promising tools for studying disordered systems. In this work, we present a general machine-learning-assisted computational framework that integrates equivariant GNNs with Monte Carlo simulations to compute the thermodynamic and ensemble-averaged functional properties of disordered materials. Using the surface-termination-disordered MXene monolayer Ti 3 C 2 T 2–x as a representative system, we find that electrical conductivity exhibits an emergent peak near the order–disorder phase transition temperature due to the interplay between electron scattering and doping. In contrast, optical conductivity remains largely insensitive to local atomic disorder and reflects the global surface chemical composition. These results highlight the role of atomic disorder in affecting material properties and demonstrate the potential of our approach for statistically modeling disorder effects in a wide range of materials such as high-entropy alloys and spin liquids.

MXene↗
DOE OSTI2023

End-to-end GPU acceleration of low-order-refined preconditioning for high-order finite element discretizations

In this article, we present algorithms and implementations for the end-to-end GPU acceleration of matrix-free low-order-refined preconditioning of high-order finite element problems. The methods described here allow for the construction of effective preconditioners for high-order problems with optimal memory usage and computational complexity. The preconditioners are based on the construction of a spectrally equivalent low-order discretization on a refined mesh, which is then amenable to, for example, algebraic multigrid preconditioning. The constants of equivalence are independent of mesh size and polynomial degree. For vector finite element problems in H(curl) and H(div) (e.g., for electromagnetic or radiation diffusion problems), a specially constructed interpolation–histopolation basis is used to ensure fast convergence. Detailed performance studies are carried out to analyze the efficiency of the GPU algorithms. The kernel throughput of each of the main algorithmic components is measured, and the strong and weak parallel scalability of the methods is demonstrated. The different relative weighting and significance of the algorithmic components on GPUs and CPUs is discussed. Results on problems involving adaptively refined nonconforming meshes are shown, and the use of the preconditioners on a large-scale magnetic diffusion problem using all spaces of the finite element de Rham complex is illustrated.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Cation-π Bonding in Actinides: UO x + (Benzene) ( x = 0, 1, 2) Complexes Studied with Threshold Photodissociation Spectroscopy and Theory

Cation-π complexes of the form UO x + (benzene) (x = 0, 1, 2) are produced by laser vaporization and cooled in a supersonic molecular beam. These ions are mass selected and studied with UV–visible laser photodissociation spectroscopy. Each of these complexes photodissociates by elimination of the benzene ligand. Above an energetic threshold, the absorption and photodissociation are continuous, indicating a high density of strongly coupled electronic states. The thresholds for the dissociation of each of these three complexes are measured and assigned as their respective bond dissociation energies. The bond energies determined [U + –(benzene): 42.5 ± 0.3 kcal/mol; UO + –(benzene): 41.0 ± 0.3 kcal/mol; UO 2 + –(benzene): 39.7 ± 0.3 kcal/mol] are comparable to those of transition metal ion-benzene complexes. Computational studies at the DFT/B3LYP level complement the experiments, predicting dissociation energies in reasonably good agreement with the experiments. Experiments and theory agree that the U+(benzene) complex is more strongly bound than its corresponding oxide ions. This new thermochemistry on actinide cation-π bonding should stimulate higher-level computational studies on these systems.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2024

Autonomous hybrid optimization of a SiO 2 plasma etching mechanism

Computational modeling of plasma etching processes at the feature scale relevant to the fabrication of nanometer semiconductor devices is critically dependent on the reaction mechanism representing the physical processes occurring between plasma produced reactant fluxes and the surface, reaction probabilities, yields, rate coefficients, and threshold energies that characterize these processes. The increasing complexity of the structures being fabricated, new materials, and novel gas mixtures increase the complexity of the reaction mechanism used in feature scale models and increase the difficulty in developing the fundamental data required for the mechanism. This challenge is further exacerbated by the fact that acquiring these fundamental data through more complex computational models or experiments is often limited by cost, technical complexity, or inadequate models. In this paper, we discuss a method to automate the selection of fundamental data in a reduced reaction mechanism for feature scale plasma etching of SiO 2 using a fluorocarbon gas mixture by matching predictions of etch profiles to experimental data using a gradient descent (GD)/Nelder–Mead (NM) method hybrid optimization scheme. These methods produce a reaction mechanism that replicates the experimental training data as well as experimental data using related but different etch processes.

36 MATERIALS SCIENCE↗
DOE OSTI2020

Quantum complexity of time evolution with chaotic Hamiltonians

We study the quantum complexity of time evolution in large-N chaotic systems, with the SYK model as our main example. This complexity is expected to increase linearly for exponential time prior to saturating at its maximum value, and is related to the length of minimal geodesics on the manifold of unitary operators that act on Hilbert space. Using the Euler-Arnold formalism, we demonstrate that there is always a geodesic between the identity and the time evolution operator e -iHt whose length grows linearly with time. This geodesic is minimal until there is an obstruction to its minimality, after which it can fail to be a minimum either locally or globally. We identify a criterion — the Eigenstate Complexity Hypothesis (ECH) — which bounds the overlap between offdiagonal energy eigenstate projectors and the k-local operators of the theory, and use it to argue that the linear geodesic will at least be a local minimum for exponential time. We show numerically that the large-N SYK model (which is chaotic) satisfies ECH and thus has no local obstructions to linear growth of complexity for exponential time, as expected from holographic duality. In contrast, we also study the case with N = 2 fermions (which is integrable) and find short-time linear complexity growth followed by oscillations. Our analysis relates complexity to familiar properties of physical theories like their spectra and the structure of energy eigenstates and has implications for the hypothesized computational complexity class separations PSPACE * BQP/poly and PSPACE * BQSUBEXP/subexp, and the “fast-forwarding” of quantum Hamiltonians.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2017

Defect Genome of Cubic Perovskites for Fuel Cell Applications

Heterogeneities such as point defects, inherent to material systems, can profoundly influence material functionalities critical for numerous energy applications. This influence in principle can be identified and quantified through development of large defect data sets which we call the defect genome, employing high-throughput ab initio calculations. However, high-throughput screening of material models with point defects dramatically increases the computational complexity and chemical search space, creating major impediments toward developing a defect genome. In this paper, we overcome these impediments by employing computationally tractable ab initio models driven by highly scalable workflows, to study formation and interaction of various point defects (e.g., O vacancies, H interstitials, and Y substitutional dopant), in over 80 cubic perovskites, for potential proton-conducting ceramic fuel cell (PCFC) applications. The resulting defect data sets identify several promising perovskite compounds that can exhibit high proton conductivity. Furthermore, the data sets also enable us to identify and explain, insightful and novel correlations among defect energies, material identities, and defect-induced local structural distortions. Finally, such defect data sets and resultant correlations are necessary to build statistical machine learning models, which are required to accelerate discovery of new materials.

30 DIRECT ENERGY CONVERSION↗
DOE OSTI2020

Modeling and Harmonic Stability of MMC-HVDC With Passive Circulating Current Filters

A modular multilevel converter (MMC) is an emerging converter technology widely used in wind power applications using high-voltage direct current (HVDC) transmission, and it has been largely investigated in medium-voltage solar harvesting as well as electric motor drives. Different from studies dealing with active circulating current control loops, this paper focuses on impedance modeling and harmonic stability studies for MMCs with passive circulating current filters (PCCFs). A power stage circuit including a PCCF is transformed and remodeled to obtain small-signal formulations. This transformation leads to additional high-order matrix computing complexity due to the added impedance subnetwork matrix from the PCCF as well as relevant crossed-frequency impacts. To simplify the computational burden, the proposed model aims to solve one arm equation instead of all six MMC arm equations. To achieve this result, additional challenges occur when the MMC is connected to a renewable energy source instead of the grid voltage, where low-level zero-sequence components might exist in the neutral point of three phases, especially in the case of no integrated advanced modular voltage balancing control, which prevents computational simplification. To overcome this challenge, further impedance matrix adjustments are conducted in this paper to theoretically suppress the impact of zero-sequence harmonics when obtaining small-signal impedance, taking into account the frequency coupling effect. Finally, simulations are carried out to validate the developed impedance model under different operating scenarios. Harmonic stability case studies of MMCs with PCCFs connected to renewable energy current sources are also presented, where frequency-domain stability analyses based on Bode diagrams are compared to time-domain simulation waveforms and FFTs, which validate the effectiveness of the proposed impedance model.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2022

Research in Quantum Field Theory, Cosmology, and String Theory

This project covered research in theoretical high energy physics at Brandeis University by PI Albion Lawrence and Co-PIs Matthew Headrick and Howard Schnitzer. The work of Albion Lawrence covered quantum field theoretic models of cosmic inflation and of quintessence-type dark energy, consistent with constraints on quantum gravity; the dynamics of open quantum systems, with an eye towards applications to holography; and the application of quantum information theory – particularly measures of quantum entanglement – to quantum field theories and quantum gravity. The work of Matthew Headrick covered the intersection of quantum information theory and quantum gravity, with a focus on the holographic encoding of quantum information theoretic concepts such as entanglement and computational complexity in field theory. Headrick also achieved significant technical results in closed string field theory. The work of Howard Schnitzer covered the computation of quantum information theoretic quantities in quantum field theories.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2022

Evolution of HEP Processing Frameworks

HEP data-processing software must support the disparate physics needs of many experiments. For both collider and neutrino environments, HEP experiments typically use data-processing frameworks to manage the computational complexities of their large-scale data processing needs. Data-processing frameworks are being faced with new challenges this decade. The computing landscape has changed from the past three decades of homogeneous single-core x86 batch jobs running on grid sites. Frameworks must now work on a heterogeneous mixture of different platforms: multi-core machines, different CPU architectures, and computational accelerators; and different computing sites: grid, cloud, and high-performance computing. We describe these challenges in more detail and how frameworks may confront them. Given their historic success, frameworks will continue to be critical software systems that enable HEP experiments to meet their computing needs. Frameworks have weathered computing revolutions in the past; they will do so again with support from the HEP community

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2019

DiaMonD: An Integrated Multifaceted Approach to Mathematics at the Interfaces of Data, Models, and Decisions

DiaMonD is a multi-institutional DOE MMICC effort that aims to address the challenges of end-to-end, data-to-decisions modeling and simulation for complex computational science and engineering problems in a unified, systematic, and integrated fashion. Institutions involved are Colorado State, Florida State, Los Alamos, MIT, Oak Ridge, Stanford, and UT-Austin. The goals of DiaMonD are (1) to develop advanced mathematical methods and analysis for multimodel, multiphysics, multiscale model problems driven by frontier DOE applications, including those in subsurface energy and environmental flows, materials for energy storage and conversion, and ice sheet dynamics; (2) to create theory and algorithms for integrated inversion, optimization, and uncertainty quantification for these complex problems; and (3) to disseminate the philosophy of an integrated end-to-end, data-to-decisions approach to modeling and simulation of complex problems to the broader applied math and computational science communities through workshops and other outreach.

42 ENGINEERING↗
DOE OSTI2021

Efficient Computation Of Surface Sunlit Fractions In Urban-Scale Building Modeling Using Ray-Tracing Techniques

For building energy simulation at an urban-scale, solar shading calculations can be significantly slow when a large number of shading surfaces are considered in the solar shading calculations, due to the computational complexity of the geometry calculations. We developed a new algorithm using the ray-tracing technique to pre-calculate the sunlit fractions of all exterior surfaces in an urban district altogether. The ray tracing-based calculator is accelerated using General Purpose Graphics Processing Units (GPGPUs) and the Optix ray tracing library, and provides an efficient, flexible, and robust means for computing the sunlit fraction of large numbers of urban surfaces of complex geometries.

Luo, Xuan↗
DOE OSTI2018

Improve the efficiency of the Cartesian tensor based fast multipole method for Coulomb interaction using the traces

To compute the non-oscillating mutual interaction for a systems with N points, the fast multipole method (FMM) has an efficiency that scales linearly with the number of points. Specifically, for Coulomb interaction, FMM can be constructed using either the spherical harmonic functions or the totally symmetric Cartesian tensors. In this paper, we will present that the effciency of the Cartesian tensor-based FMM for the Coulomb interaction can be significantly improved by implementing the traces of the Cartesian tensors in calculation to reduce the independent elements of the n-th rank totally symmetric Cartesian tensor from (n + 1)(n + 2)=2 to 2n + 1. The computation complexity for the operations in FMM are analyzed and expressed as polynomials of the highest rank of the Cartesian tensors. For most operations, the complexity is reduced by one order. Numerical examples regarding the convergence and the effciency of the new algorithm are demonstrated. As a result, a reduction of computation time up to 50% has been observed for a moderate number of points and rank of tensors.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

A divergence-free constrained magnetic field interpolation method for scattered data

An interpolation method to evaluate magnetic fields, given its unstructured and scattered magnetic data, is presented. The method is based on the reconstruction of the global magnetic field using a superposition of orthogonal functions. The coefficients of the expansion are obtained by minimizing a cost function defined as the L2 norm of the difference between the ground truth and the reconstructed magnetic field evaluated on the training data. The divergence-free condition is incorporated as a constraint in the cost function, allowing the method to achieve arbitrarily small errors in the magnetic field divergence. An exponential decay of the approximation error is observed and compared with the less favorable algebraic decay of local splines. Compared to local methods involving computationally expensive search algorithms, the proposed method exhibits a significant reduction of the computational complexity of the field evaluation, while maintaining a small error in the divergence even in the presence of magnetic islands and stochasticity. Finally, applications to the computation of Poincaré sections using data obtained from numerical solutions of the magnetohydrodynamic equations in toroidal geometry are presented and compared with local methods currently in use.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2021

Physically regularized machine learning emulators of aerosol activation

Abstract. The activation of aerosol into cloud droplets is an important step in the formation of clouds and strongly influences the radiative budget of the Earth. Explicitly simulating aerosol activation in Earth system models is challenging due to the computational complexity required to resolve the necessary chemical and physical processes and their interactions. As such, various parameterizations have been developed to approximate these details at reduced computational cost and accuracy. Here, we explore how machine learning emulators can be used to bridge this gap in computational cost and parameterization accuracy. We evaluate a set of emulators of a detailed cloud parcel model using physically regularized machine learning regression techniques. We find that the emulators can reproduce the parcel model at higher accuracy than many existing parameterizations. Furthermore, physical regularization tends to improve emulator accuracy, most significantly when emulating very low activation fractions. This work demonstrates the value of physical constraints in machine learning model development and enables the implementation of improved hybrid physical and machine learning models of aerosol activation into next-generation Earth system models.

58 GEOSCIENCES↗
DOE OSTI2024

Enabling HPC Scientific Workflows for Serverless

The convergence of edge computing, big data analytics, and AI with traditional scientific calculations is increasingly being adopted in HPC workflows. Workflow management systems are crucial for managing and orchestrating these complex computational tasks. However, it is difficult to identify patterns within the growing population of HPC workflows. Serverless has emerged as a novel computing paradigm, offering dynamic resource allocation, quick response time, fine-grained resource management and auto-scaling. In this paper, we propose a framework to enable HPC scientific workflows on serverless. Our approach integrates a widely used traditional HPC workflow generator with an HPC serverless workflow management system to create benchmark suites of scientific workflows with diverse characteristics. These workflows can be executed on different serverless platforms. We comprehensively compare executing workflows on traditional local containers and serverless computing platforms. Our results show that serverless can reduce CPU and memory usage respectively by 78.11% and 73.92% without compromising performance.

Andrei da silva, Anderson↗
DOE OSTI2024

Utilizing HYSPLIT for Emergency Response Modeling at SRS

At SRS, emergency responders use a variety of tools to detect, track, and mitigate hazardous material releases into the atmosphere. Two models currently used at SRS are Puff-Plume and the Lagrangian Particle Dispersion Model (LPDM), a Gaussian and Lagrangian model, respectively. A decision has been made to replace LPDM with the more widely-supported Hybrid Single-Particle Lagrangian Integrated Trajectory (HYSPLIT) model for evaluating inhalation and ingestion doses following a release. HYSPLIT is designed to compute complex dispersion and deposition simulation To achieve the implementation of HYSPLIT, we have developed a preliminary UI framework that will allow HYSPLIT to be run on ATG computers without the need for active network connections, thus avoiding the loss of capabilities in the event of a network outage during an emergency.

Earley, Ian↗
DOE OSTI2023

Challenges and Opportunities in Deep Reinforcement Learning With Graph Neural Networks: A Comprehensive Review of Algorithms and Applications

Deep reinforcement learning (DRL) has empowered a variety of artificial intelligence fields, including pattern recognition, robotics, recommendation-systems, and gaming. Similarly, graph neural networks (GNN) have also demonstrated their superior performance in supervised learning for graph-structured data. In recent times, the fusion of GNN with DRL for graph-structured environments has attracted a lot of attention. Here, this paper provides a comprehensive review of these hybrid works. These works can be classified into two categories: (1) algorithmic enhancement, where DRL and GNN complement each other for better utility; (2) application-specific enhancement, where DRL and GNN support each other. This fusion effectively addresses various complex problems in engineering and life sciences. Based on the review, we further analyze the applicability and benefits of fusing these two domains, especially in terms of increasing generalizability and reducing computational complexity. Finally, the key challenges in integrating DRL and GNN, and potential future research directions are highlighted, which will be of interest to the broader machine learning community.

97 MATHEMATICS AND COMPUTING↗