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 217 records · Page 12

Computational Data Associated with the publication: Formation of a Decanuclear Organometallic Dysprosium Complex via a Radical–Radical Cross–Coupling Reaction

Over the years, polynuclear cyclic or torus complexes have attracted increasing interest due to their unique metal topologies and properties. However, the isolation of polynuclear cyclic organometallic complexes is extremely challenging due to their inherent reactivity, which stems from the labile and reactive metal‐carbon bonds. In this study, the pyrazine ligand undergoes a radical‐radical cross‐coupling reaction leading to the formation of a decanuclear [(Cp*)20Dy10(L1)10] ⋅ 12(C7H8) (1; where L1 = anion of 2‐prop‐2‐enyl‐2H‐pyrazine; Cp* = pentamethylcyclopentadienyl) complex, where all DyIII metal centres are bridged by the anionic L1 ligand. Amongst the family of polynuclear Ln organometallic complexes bearing CpR2Lnx units (CpR = substituted cyclopentadienyl), 1 features the highest nuclearity obtained to date. In‐depth computational studies were conducted to elucidate the proposed reaction mechanism and formation of L1, while probing of the magnetic properties of 1, revealed slow magnetic relaxation upon application of a static dc field.

Bajaj, Neha↗

CG-Kit: Code Generation Toolkit for performant and maintainable variants of source code applied to Flash-X hydrodynamics simulations

CG-Kit is a new Code Generation tool-Kit that we have developed as a part of the solution for portability and maintainability for multiphysics computing applications. The development of CG-Kit is rooted in the urgent need created by the shifting landscape of high-performance computing platforms and the algorithmic complexities of a particular large-scale multiphysics application: Flash-X. To efficiently use computing resources on a heterogeneous node, an application must have a map of computation to resources and a mechanism to move the data and computation to the resources according to the map. Most existing performance portability solutions are focussed on abstracting the expression of computations so that a unified source code can be specialized to run on different resources. However, such an approach is insufficient for a code like Flash-X, which has a multitude of code components that can be assembled in various permutations and combinations to form different instances of applications. Similar challenges apply to any code that has composability, where a single specified way of apportioning work among devices may not be optimal. Additionally, use cases arise where the optimal control flow of computation may differ for different devices while the underlying numerics remain identical. This combination leads to unique challenges including handling an existing large code base in Fortran and/or C/C++, subdivision of code into a great variety of units supporting a wide range of physics and numerical methods, different parallelization techniques for distributed and shared memory systems and accelerator devices, and heterogeneity of computing platforms requiring coexisting variants of parallel algorithms. All of these challenges demand that scientific software developers apply existing knowledge about domain applications, algorithms, and computing platforms to determine custom abstractions and granularity for code generation. There is a critical lack of tools to tackle those problems. CG-Kit is designed to fill this gap by providing a user with the ability to express their desired control flow and computation-to-resource map in the form a pseudocode-like recipe. It consists of standalone tools that can be combined into highly specific and, we argue, highly effective portability and maintainability toolchains. Here we present the design of our new tools: parametrized source trees, control flow graphs, and recipes. The tools are implemented in Python. They are agnostic to the programming language of the source code targeted for code generation. In conclusion, we demonstrate the capabilities of the toolkit with two examples, first, multithreaded variants of the basic AXPY operation, and second, variants of parallel algorithms within a hydrodynamics solver, called Spark, from Flash-X that operates on block-structured adaptive meshes.

Algorithmic portability↗

Sentinel

Network intrusion detection systems (NIDS) are commonplace in network security but they frequently employ algorithms that are computational demanding requiring hardware and software with significant power requirements. Two examples of such resource-intensive algorithms used for network security are regular expression matching and broader signature pattern matching which are commonly used in deep packet inspection (DPI). Network security algorithms that have large power requirements may be a challenge for low-power internet-of-things (IoT) environments, which generally lack the power resources to implement complex security measures like computationally expensive DPI at the edge. Furthermore, IoT environments incorporating 5G standalone networks have network latency constraints beyond just power that make DPI at the edge even more difficult. Programmable logic is ideally suited for machine learning inference for DPI because of its deep instruction level parallelism and single-cycle memory access. Machine learning approaches for DPI have been explored before using the programmable logic of field programmable gate arrays (FPGA) as a potential solution for NIDS approaches that would be power-suitable for IoT. However, those previous programmable logic NIDS approaches utilize either a supervised or unsupervised learning model. Sentinel utilizes the ensemble of these two machine learning approaches known as a semi-supervised approach which has shown promise in NIDS implementations. Sentinel provides a programmable logic implementation of a semi-supervised approach for DPI which operates at much lower power and latency than a GPU implementation with negligible loss of accuracy due to quantization through a logistic regressor.

Anderson, MatthewW [Idaho National Laboratory (INL↗

Dirac traces and the Tutte polynomial

Perturbative calculations involving fermion loops in quantum field theories require tracing over Dirac matrices. A simple way to regulate the divergences that generically appear in these calculations is dimensional regularisation, which has the consequence of replacing 4-dimensional Dirac matrices with d-dimensional counterparts for arbitrary complex values of d. In this work, a connection between traces of d-dimensional Dirac matrices and computations of the Tutte polynomial of associated graphs is proven. The time complexity of computing Dirac traces is analysed by this connection, and improvements to algorithms for computing Dirac traces are proposed.

Renormalization and Regularization↗

A Gaussian process based surrogate approach for the optimization of cylindrical targets

Simulating direct-drive inertial confinement experiments presents significant computational challenges, both due to the complexity of the codes required for such simulations and the substantial computational expense associated with target design studies. Machine learning models, and in particular, surrogate models, offer a solution by replacing simulation results with a simplified approximation. In this study, we apply surrogate modeling and optimization techniques that are well established in the existing literature to one-dimensional simulation data of a new cylindrical target design containing deuterium–tritium fuel. These models predict yields without the need for expensive simulations. We find that Bayesian optimization with Gaussian process surrogates enhances sampling efficiency in low-dimensional design spaces but becomes less efficient as dimensionality increases. Nonetheless, optimization routines within two-dimensional and five-dimensional design spaces can identify designs that maximize yield, while also aligning with established physical intuition. Optimization routines, which ignore constraints on hydrodynamic instability growth, are shown to lead to unstable designs in 2D, resulting in yield loss. However, routines that utilize 1D simulations and impose constraints on the in-flight aspect ratio converge on novel cylindrical target designs that are stable against hydrodynamic instability growth in 2D and achieve high yield.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Neutron scattering and neural-network quantum molecular dynamics investigation of the vibrations of ammonia along the solid-to-liquid transition

Abstract Vibrational spectroscopy allows us to understand complex physical and chemical interactions of molecular crystals and liquids such as ammonia, which has recently emerged as a strong hydrogen fuel candidate to support a sustainable society. We report inelastic neutron scattering measurement of vibrational properties of ammonia along the solid-to-liquid phase transition with high enough resolution for direct comparisons to ab-initio simulations. Theoretical analysis reveals the essential role of nuclear quantum effects (NQEs) for correctly describing the intermolecular spectrum as well as high energy intramolecular N-H stretching modes. This is achieved by training neural network models using ab-initio path-integral molecular dynamics (PIMD) simulations, thereby encompassing large spatiotemporal trajectories required to resolve low energy dynamics while retaining NQEs. Our results not only establish the role of NQEs in ammonia but also provide general computational frameworks to study complex molecular systems with NQEs.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Reduced salen in a monomeric Fe complex

We report the first monomeric formally M I transition metal salen complex without ion pairing. A combination of spectroscopy, crystallography, and computations indicates that reduction of an Fe II salen complex gives substantial reduced ligand character. We also present a computational method for accurately predicting 57 Fe Mössbauer parameters of Fe salen complexes.

Feldman, Dana M. [Yale University, New Haven, CT (↗

Parameterized anomalous transport model for current-carrying collisionless plasmas in pulsed power inertial confinement fusion

Current delivery in pulsed power inertial confinement fusion is influenced by collisionless current-carrying microturbulent plasmas, which are sourced from electrode surfaces. In this setting, the lower hybrid drift instability—triggered by plasma acceleration—is a leading candidate driver of difficult-to-predict momentum and energy transport. To characterize the nonlinear state of the microturbulent plasma, a parameterized anomalous transport model is developed for the instability, with analytic formulas for anomalous collision frequency, resistivity, and species heating rates. The formulas are expressed in terms of linear-theory variables and four dimensionless parameters that characterize the macroscopic plasma state. The model is built on linear theory analysis, power law analysis, and quasilinear theory analysis, and is validated using a series of nonlinear continuum kinetic Vlasov–Poisson simulations. The theoretical and computational investigation demonstrates that the anomalous collision frequency associated with the instability can be reliably approximated, within about a factor of five or better, by the unscaled linear theory growth rate of the fastest-growing wavenumber mode. This finding enables efficient calculation of anomalous resistivity and species heating rates over a wide range of plasma conditions, resulting in improved predictive capabilities.

Complex functions↗

Mixed-mode oscillations in a three-timescale coupled Morris–Lecar system

Mixed-mode oscillations (MMOs) are complex oscillatory behaviors of multiple-timescale dynamical systems in which there is an alternation of large-amplitude and small-amplitude oscillations. It is well known that MMOs in two-timescale systems can arise either from a canard mechanism associated with folded node singularities or a delayed Andronov–Hopf bifurcation (DHB) of the fast subsystem. While MMOs in two-timescale systems have been extensively studied, less is known regarding MMOs emerging in three-timescale systems. In this work, we examine the mechanisms of MMOs in coupled Morris–Lecar neurons with three distinct timescales. We investigate two kinds of MMOs occurring in the presence of a singularity known as canard-delayed-Hopf (CDH) and in cases where CDH is absent. In both cases, we examine how features and mechanisms of MMOs vary with respect to variations in timescales. Our analysis reveals that MMOs supported by CDH demonstrate significantly stronger robustness than those in its absence. Moreover, we show that the mere presence of CDH does not guarantee the occurrence of MMOs. This work yields important insights into conditions under which the two separate mechanisms in two-timescale context, canard and DHB, can interact in a three-timescale setting and produce more robust MMOs, particularly against timescale variations.

97 MATHEMATICS AND COMPUTING↗

Rigorous computation of short-range order unifies its controversial effects in complex concentrated alloys

Direct experimental observations of chemical short-range order (SRO) in complex concentrated alloys (CCAs) have triggered high interest. However, the reported effects of SRO on yield stresses are controversial, and their atomic-scale mechanisms are elusive, which limits our ability to utilize SRO in alloy design. Here we tackle this challenge using an advanced computational approach that rigorously takes into account the critical lattice distortion in CCAs and further verify our theoretical predictions with experiments. We show that the CoCrNi model alloy has a narrow temperature window around 670 °C for SRO formation. This explains why the mechanical effect of SRO is observed in some experiments but not in others. Here, we propose an effective alloy-doping method to control SRO and reveal atomic-bonding types that dominate SRO formation for different alloys. The strategies and insights generally apply to a broad spectrum of alloys, laying the foundation for designing advanced alloys by manipulating their SRO.

36 MATERIALS SCIENCE↗

Investigation of Main Bearing Fatigue Estimate Sensitivity to Synthetic Turbulence Models Using a Novel Drivetrain Model Implemented in OpenFAST

ABSTRACT A coupled medium‐fidelity drivetrain model is developed and implemented in OpenFAST for a 10‐MW land‐based reference turbine. The implementation is verified against a fully coupled multibody wind turbine model, including a detailed drivetrain. The new model can simultaneously and accurately estimate main bearing loads and represent elastic bending of the drivetrain. It has low computational cost and is useful for early design phases, sensitivity analyses and complex systems like wind farms (where computational expense must be expended elsewhere). Here, the model is implemented for a monopile offshore wind turbine and used to investigate the sensitivity of main bearing basic rating life to different synthetic turbulence models. Large‐eddy simulations (LES) targeting stable, neutral, and unstable atmospheric conditions at below‐, near‐ and above‐rated wind speeds are used as a reference. The turbulence models recommended by the International Electrotechnical Commission, the Mann spectral tensor model, and the Kaimal spectral model with exponential coherence are fitted to the LES data. Additionally, a constrained turbulence generator, PyConTurb (short for Python Constrained Turbulence ), based on LES data, is applied in the aero‐hydro‐servo‐elastic simulations. Taking PyConTurb as the baseline, the Kaimal model significantly underestimates fatigue of the downwind main bearing, with between 10% and 40% less damage. The Mann model also underestimates the downwind main bearing fatigue by up to 30%. The upwind main bearing damage is driven by mean loads, and differences between models are less significant, although the trends are similar. Reasons for these discrepancies are investigated and attributed to differences in spatial and temporal variations among the turbulence models.

17 WIND ENERGY↗

Embedded symmetric positive semi-definite machine-learned elements for reduced-order modeling in finite-element simulations with application to threaded fasteners

Here, we present a machine-learning strategy for finite element analysis of solid mechanics wherein we replace complex portions of a computational domain with a data-driven surrogate. In the proposed strategy, we decompose a computational domain into an “outer” coarse-scale domain that we resolve using a finite element method (FEM) and an “inner” fine-scale domain. We then develop a machine-learned (ML) model for the impact of the inner domain on the outer domain. In essence, for solid mechanics, our machine-learned surrogate performs static condensation of the inner domain degrees of freedom. This is achieved by learning the map from displacements on the inner-outer domain interface boundary to forces contributed by the inner domain to the outer domain on the same interface boundary. We consider two such mappings, one that directly maps from displacements to forces without constraints, and one that maps from displacements to forces by virtue of learning a symmetric positive semi-definite (SPSD) stiffness matrix. We demonstrate, in a simplified setting, that learning an SPSD stiffness matrix results in a coarse-scale problem that is well-posed with a unique solution. We present numerical experiments on several exemplars, ranging from finite deformations of a cube to finite deformations with contact of a fastener-bushing geometry. We demonstrate that enforcing an SPSD stiffness matrix drastically improves the robustness and accuracy of FEM–ML coupled simulations, and that the resulting methods can accurately characterize out-of-sample loading configurations with significant speedups over the standard FEM simulations.

97 MATHEMATICS AND COMPUTING↗

Clustering and Cliques in Preferential Attachment Random Graphs with Edge Insertion

In this paper, we investigate the global clustering coefficient (a.k.a transitivity) and clique number of graphs generated by a preferential attachment random graph model with an additional feature of allowing edge connections between existing vertices. Specifically, at each time step t, either a new vertex is added with probability f(t), or an edge is added between two existing vertices with probability 1 – f(t). We establish concentration inequalities for the global clustering and clique number of the resulting graphs under the assumption that f(t) is a regularly varying function at infinity with index of regular variation –$\gamma$, where $\gamma$ $\in$ [0, 1). Finally, we also demonstrate an inverse relation between these two statistics: the clique number is essentially the reciprocal of the global clustering coefficient.

97 MATHEMATICS AND COMPUTING↗

Surrogate modeling of Monte Carlo radiation transport with convolutional neural networks for shielding optimization

Here, we present a machine learning (ML)-based surrogate model using convolutional neural networks (CNN) designed to emulate the attenuation of neutron fields as they pass through various shielding materials. This model can compute the outgoing neutron flux almost instantaneously and achieves reasonable accuracy compared to traditional Monte Carlo (MC)-based codes, which are computationally intensive. This emulator alleviates the complexity of neutron radiation transport through shielding materials by reducing the dimensionality and enables shielding optimization for a known radiation environment. This optimization process, which would have taken an unrealistic timeline due to several complex radiation transport simulations, can now be achieved in minutes, thus increasing computational capabilities in radiation shielding assessment. We demonstrate the applications of this emulator in computing effective dose rates and optimizing shielding solutions for a heavy-ion accelerator facility, such as the Facility for Rare Isotope Beams, where secondary neutrons produced via beam interactions dominate the radiation environment.

accelerator shielding↗

Modeling Oxidative Dehydrogenation of Propane with Supported Vanadia Catalysts Using Multireference Methods

The oxidative dehydrogenation of propane over supported vanadium oxide catalysts poses significant computational challenges due to complex electronic structure changes along the reaction coordinate, driven primarily by changes in the oxidation states of vanadium. To address these challenges, we systematically test quantum chemical methods, including multireference (MR) approaches, domain-based local pair natural orbital coupled cluster theory (DLPNO-CCSD(T)), and density functional theory (DFT). The initial C–H bond-breaking transition state requires MR treatment due to its multireference character, while subsequent steps permit efficient single-reference calculations. For the rate-limiting C–H activation step mediated by the vanadyl moiety, complete 1 active space second-order perturbation theory (CASPT2) yields an apparent activation barrier (E app 600K ) of 138 kJ/mol, consistent with experimental values (134 ± 4 kJ/mol; Gruene et al. Catal. Today 2010, 157, 137). In contrast, DLPNO-CCSD(T) overestimates this barrier (198 kJ/mol), whereas DFT predictions span 125–150 kJ/mol, depending on the functional. Our multireference investigation of this transition metal oxide-catalyzed process demonstrates that an active space that incorporates the C–H σ and V=O σ/π bonding orbitals, oxygen lone pairs, and their antibonding counterparts adequately captures electronic structure changes along the chemical transformation. Furthermore, these findings provide a general strategy for active space selection in transition metal oxide-catalyzed C/O–H bond activation reactions. The reference dataset from this work, which includes MR calculations with manually selected active spaces for all intermediates and transition states in the propane ODH reaction network, will serve as a benchmark for automating active space selection in similar systems.

Catalysts↗

ALD-Derived WO 3– x Leads to Nearly Wake-Up-Free Ferroelectric Hf 0.5 Zr 0.5 O 2 at Elevated Temperatures

Breaking the memory wall in advanced computing architectures will require complex 3D integration of emerging memory materials such as ferroelectrics─either within the back-end-of-line (BEOL) of CMOS front-end processes or through advanced 3D packaging technologies. Achieving this integration demands that memory materials exhibit high thermal resilience, with the capability to operate reliably at elevated temperatures, such as 125°C, due to the substantial heat generated by front-end transistors. However, silicon-compatible HfO 2 -based ferroelectrics tend to exhibit antiferroelectric-like behavior in this temperature range, accompanied by a more pronounced wake-up effect, posing significant challenges to their thermal reliability. Here, we report that by introducing a thin tungsten oxide (WO 3–x ) layer─known as an oxygen reservoir─and carefully tuning its oxygen content, ultrathin Hf 0.5 Zr 0.5 O 2 (5 nm) films can be made robust against the ferroelectric-to-antiferroelectric transition at elevated temperatures. This approach not only minimizes polarization loss in the pristine state but also effectively suppresses the wake-up effect, reducing the required wake-up cycles from 10 5 to only 10 at 125°C, a qualifying temperature for back-end memory integrated with front-end logic, as defined by the JEDEC standard. First-principles density functional theory (DFT) calculations reveal that WO 3 enhances the stability of the ferroelectric orthorhombic phase (o-phase) at elevated temperatures by increasing the tetragonal-to-orthorhombic phase energy gap and promoting favorable phonon mode evolution, thereby supporting o-phase formation under both thermodynamic and kinetic constraints.

36 MATERIALS SCIENCE↗

A Real-Time Implementation and Validation of Federated Learning for Grid Services

Grid-edge devices are becoming increasingly important in the energy transition. Preserving privacy was not previously considered an important aspect for power grid operations, but with the increased proliferation of customer-owned assets, it is now an essential consideration. Several mechanisms have been proposed to provide privacy for non-utility owned assets in the power grid. Federated learning (FL) is one method gaining prominence in this area. Although FL has been used for other applications, such as auto-complete in phones, there has not been much investigation into whether these approaches are feasible for grid applications. In this work, we use a research platform with real-time simulators and hardware-in-the-loop capabilities to investigate how FL can be applied to grid-edge devices, and we present the potential grid services that can be derived for these devices. We discuss the computational challenges with deploying complex FL approaches, and we explore several grid services, including participation in retail electricity markets, voltage control, and resilience-driven reconfiguration.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Efficient Unitary Designs from Random Sums and Permutations

A unitary k-design is an ensemble of unitaries that matches the first k moments of the Haar measure. In this work, we provide two efficient constructions of k-designs on n-qubits using new random matrix theory techniques. Our first construction is based on exponentiating sums of random i.i.d. Hermitian matrices and uses O(k2n2)-many gates. In the spirit of central limit theorems, we show that this random sum approximates the Gaussian Unitary Ensemble (GUE). We then show that the product of just two exponentiated GUE matrices is already approximately Haar random. Our second construction is based on products of exponentiated sums of random permutations and uses Õ(k poly (n)) many gates. The k dependence is optimal (up to polylogarithmic factors) and is inherited from the efficiency of existing k-wise independent permutations. Furthermore, replacing random permutations with quantum-secure pseudorandom permutations (PRPs), we also obtain a pseudorandom unitary (PRU) ensemble that is secure under nonadaptive queries. A central feature of both proofs is a new connection between the polynomial method in quantum query complexity and the large-dimension (N) expansion in random matrix theory. In particular, the first construction uses the polynomial method to control high moments of certain random matrix ensembles without requiring delicate Weingarten calculations. In doing so, we define and solve a moment problem on the unit circle, asking whether a finite number of equally weighted points can reproduce a given set of moments. In our second construction, the key step is to exhibit an orthonormal basis for irreducible representations of the partition algebra that has a low-degree large-N expansion. This allows us to show that the distinguishing probability is a low-degree rational polynomial of the dimension N.

algebra↗