Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “complex computing”

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 595 records · Page 33

Tree tensor network hierarchical equations of motion based on time-dependent variational principle for efficient open quantum dynamics in structured thermal environments

In this work, we introduce an efficient method, TTN-HEOM, for exactly calculating the open quantum dynamics for driven quantum systems interacting with highly structured bosonic baths by combining the tree tensor network (TTN) decomposition scheme with the bexcitonic generalization of the numerically exact hierarchical equations of motion (HEOM). The method yields a series of quantum master equations for all core tensors in the TTN that efficiently and accurately capture the open quantum dynamics for non-Markovian environments to all orders in the system–bath interaction. These master equations are constructed based on the time-dependent Dirac–Frenkel variational principle, which isolates the optimal dynamics for the core tensors given the TTN ansatz. The dynamics converges to the HEOM when increasing the rank of the core tensors, a limit in which the TTN ansatz becomes exact. We introduce TENSO, tensor equations for non-Markovian structured open systems, as a general-purpose Python code to propagate the TTN-HEOM dynamics. We implement three general propagators for the coupled master equations: two fixed-rank methods that require a constant memory footprint during the dynamics and one adaptive-rank method with a variable memory footprint controlled by the target level of computational error. We exemplify the utility of these methods by simulating a two-level system coupled to a structured bath containing one Drude–Lorentz component and eight Brownian oscillators, which is beyond what can presently be computed using the standard HEOM. Our results show that the TTN-HEOM is capable of simulating both dephasing and relaxation dynamics of driven quantum systems interacting with structured baths, even those of chemical complexity, with an affordable computational cost.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Preparation and Characterization of Inclusion Complexes of β-Cyclodextrin and Phenolics from Wheat Bran by Combination of Experimental and Computational Techniques

Bitterness often associated with whole wheat products may be related to phenolics in the bran. Cyclodextrins (CDs) are known to form inclusion complexes. The objective was to form inclusion complexes between β-CD and wheat phenolics. Pure phenolic acids (trans-ferulic acid (FA), caffeic acid (CA), and p-coumaric acid (CO)) and phenolic acids from wheat bran were used to investigate complex formation potential. Complexes were characterized by spectroscopy techniques, and a computational and molecular modeling study was carried out. The relative amount of complex formation between β-CD and wheat bran extract was CA > CO > FA. The phenolic compounds formed inclusion complexes with β-CDs by non-covalent bonds. The quantum-mechanical calculations supported the experimental results. The most stable complex was CO/β-CD complex. The ΔH value for CO/β-CD complex was -11.72 kcal/mol and was about 3 kcal/mol more stable than the other complexes. The QSPR model showed good correlation between binding energy and 1H NMR shift for the H5 signal. This research shows that phenolics and β-CD inclusion complexes could be utilized to improve the perception of whole meal food products since inclusion complexes have the potential to mask the bitter flavor and enhance the stability of the phenolics in wheat bran.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Seven open problems in applied combinatorics

We present and discuss seven different open problems in applied combinatorics. Additionally, the application areas relevant to this compilation include quantum computing, algorithmic differentiation, topological data analysis, iterative methods, hypergraph cut algorithms, and power systems.

97 MATHEMATICS AND COMPUTING↗

Can machine learning accelerate process understanding and decision‐relevant predictions of river water quality?

Abstract The global decline of water quality in rivers and streams has resulted in a pressing need to design new watershed management strategies. Water quality can be affected by multiple stressors including population growth, land use change, global warming, and extreme events, with repercussions on human and ecosystem health. A scientific understanding of factors affecting riverine water quality and predictions at local to regional scales, and at sub‐daily to decadal timescales are needed for optimal management of watersheds and river basins. Here, we discuss how machine learning (ML) can enable development of more accurate, computationally tractable, and scalable models for analysis and predictions of river water quality. We review relevant state‐of‐the art applications of ML for water quality models and discuss opportunities to improve the use of ML with emerging computational and mathematical methods for model selection, hyperparameter optimization, incorporating process knowledge into ML models, improving explainablity, uncertainty quantification, and model‐data integration. We then present considerations for using ML to address water quality problems given their scale and complexity, available data and computational resources, and stakeholder needs. When combined with decades of process understanding, interdisciplinary advances in knowledge‐guided ML, information theory, data integration, and analytics can help address fundamental science questions and enable decision‐relevant predictions of riverine water quality.

54 ENVIRONMENTAL SCIENCES↗

A Fast Algorithm for Computing Zigzag Representatives

Zigzag filtrations of simplicial complexes generalize the usual filtrations by allowing simplex deletions in addition to simplex insertions. The barcodes computed from zigzag filtrations encode the evolution of homological features. Although one can locate a particular feature at any index in the filtration using existing algorithms, the resulting representatives may not be compatible with the zigzag: a representative cycle at one index may not map into a representative cycle at its neighbor. For this, one needs to compute compatible representative cycles along each bar in the barcode. It is known that the barcode for a zigzag filtration with m insertions and deletions can be computed $O(m^ω)$ in time, where $ω < 2.373$ is the matrix multiplication exponent. However, it is not known how to compute the compatible representatives so efficiently. For a non-zigzag filtration, the classical matrix-based algorithm provides representatives in $O(m^3)$ time, which can be improved to $O(m^ω)$. However, no known algorithm for zigzag filtrations computes the representatives with the $O(m^3)$ time bound. We present an $O(m^3 n)$ time algorithm for this problem, where $n ≤ m$ is the size of the largest complex in the filtration.

Persistent homology↗

HYPPO: A Surrogate-Based Multi-Level Parallelism Tool for Hyperparameter Optimization

We present a new software, HYPPO, that enables the automatic tuning of hyperparameters of various deep learning (DL) models. Unlike other hyperparameter optimization (HPO) methods, HYPPO uses adaptive surrogate models and directly accounts for uncertainty in model predictions to find accurate and reliable models that make robust predictions. Using asynchronous nested parallelism, we are able to significantly alleviate the computational burden of training complex architectures and quantifying the uncertainty. HYPPO is implemented in Python and can be used with both TensorFlow and PyTorch libraries. We demonstrate various software features on time-series prediction and image classification problems as well as a scientific application in computed tomography image reconstruction. Finally, we show that (1) we can reduce by an order of magnitude the number of evaluations necessary to find the most optimal region in the hyperparameter space and (2) we can reduce by two orders of magnitude the throughput for such HPO process to complete.

adaptation models↗

Computing virtual dark-field X-ray microscopy images of complex discrete dislocation structures from large-scale molecular dynamics simulations

Dark-field X-ray microscopy (DFXM) is a novel diffraction-based imaging technique that non-destructively maps the local deformation from crystalline defects in bulk materials. While studies have demonstrated that DFXM can spatially map 3D defect geometries, it is still challenging to interpret DFXM images of the high-dislocation-density systems relevant to macroscopic crystal plasticity. This work develops a scalable forward model to calculate virtual DFXM images for complex discrete dislocation structure(s) (DDS) obtained from atomistic simulations. Our new DDS-DFXM model integrates a non-singular formulation for calculating the local strain from the DDS and an efficient geometrical optics algorithm for computing the DFXM image from the strain field. We apply the model to complex DDS obtained from a large-scale mol­ecular dynamics simulation of compressive loading on single-crystal silicon. Simulated DFXM images exhibit prominent contrast for dislocation features between the multiple slip systems, demonstrating the potential of DFXM to resolve features from dislocation multiplication. In conclusion, the integrated DDS-DFXM model provides a toolbox for DFXM experimental design and image interpretation in the context of bulk crystal plasticity for a range of measurements across shock plasticity and the broader materials science community.

X-ray imaging↗

Advancing Scientific Productivity through Better Scientific Software: Developer Productivity and Software Sustainability Report

The Exascale Computing Project (ECP) provides a unique opportunity to advance computational science and engineering (CSE) through an accelerated growth phase in extreme-scale computing. Central to the project is the development of next-generation applications and software technologies that can exploit emerging architectures for optimal performance and provide high-fidelity, multiphysics, multiscale capabilities. However, disruptive changes in computer architectures and the complexities of tackling new frontiers in extreme-scale modeling, simulation, and analysis present daunting challenges to the productivity of software developers and the sustainability of software artifacts. Members of the CSE community - especially at extreme scales but more broadly at all scales of computing - face an urgent need to improve developer productivity, positively impacting product quality, development time, and staffing resources, and software sustainability, reducing the cost of maintaining, sustaining, and evolving software capabilities.

97 MATHEMATICS AND COMPUTING↗

Alkali Metal Ions Dictate the Structure and Reactivity of an Iron(II) Imido Complex

The presence of redox innocent metal ions has been proposed to modulate the reactivity of metal ligand multiple bonds; however, insight from structure/function relationships is limited. Here, alkali metal reduction of the Fe(III) imido complex [Ph 2 B( t BuIm) 2 Fe=NDipp] (1) provides the series of structurally characterized Fe(II) imido complexes [Ph 2 B( t BuIm) 2 Fe=NDippLi(THF) 2 ] (2), [Ph 2 B( t BuIm) 2 Fe=NDippNa(THF) 3 ] (3), and [Ph 2 B( t BuIm) 2 Fe=NDippK] 2 (4), in which the alkali metal cations coordinate the imido ligand. Structural investigations demonstrate that the alkali metal ions modestly lengthen the Fe=N bond distance from that in the charge separated complex [Ph 2 B( t BuIm) 2 Fe=NDipp][K(18-C-6)THF 2 ] (5), with the longest bond observed for the smallest alkali metal ion. In contrast to 5, the imido ligands in 2–4 can be protonated and alkylated to afford Fe(II) amido complexes. Combined experimental and computational studies reveal that the alkali metal polarizes the Fe=N bond, and the basicity of imido ligand increases according to 5 < 4 ≈ 3 < 2. The basicity of the imido ligands influences the relative rates of reaction with 1,4-cyclohexadiene, specifically by gating access to complex 5, which is the species that is active for HAT. All complexes 2–4 react with benzophenone form metastable Fe(II) intermediates that subsequently eliminate the metathesis product Ph 2 C=NDipp, with relative rates dependent on the alkali metal ion. By contrast, the same reaction with 5 does not lead to the formation of Ph 2 C=NDipp. Furthermore, these results demonstrate that the coordination of alkali metal ions dictate both the structure and reactivity of the imido ligand and moreover can direct the reactivity of reaction intermediates.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Graph-based quantum response theory and shadow Born–Oppenheimer molecular dynamics

Graph-based linear scaling electronic structure theory for quantum-mechanical molecular dynamics simulations [A. M. N. Niklasson et al., J. Chem. Phys. 144, 234101 (2016)] is adapted to the most recent shadow potential formulations of extended Lagrangian Born–Oppenheimer molecular dynamics, including fractional molecular-orbital occupation numbers [A. M. N. Niklasson, J. Chem. Phys. 152, 104103 (2020) and A. M. N. Niklasson, Eur. Phys. J. B 94, 164 (2021)], which enables stable simulations of sensitive complex chemical systems with unsteady charge solutions. The proposed formulation includes a preconditioned Krylov subspace approximation for the integration of the extended electronic degrees of freedom, which requires quantum response calculations for electronic states with fractional occupation numbers. For the response calculations, we introduce a graph-based canonical quantum perturbation theory that can be performed with the same natural parallelism and linear scaling complexity as the graph-based electronic structure calculations for the unperturbed ground state. Further, the proposed techniques are particularly well-suited for semi-empirical electronic structure theory, and the methods are demonstrated using self-consistent charge density-functional tight-binding theory both for the acceleration of self-consistent field calculations and for quantum-mechanical molecular dynamics simulations. Graph-based techniques combined with the semi-empirical theory enable stable simulations of large, complex chemical systems, including tens-of-thousands of atoms.

74 ATOMIC AND MOLECULAR PHYSICS↗

Improving Schrödinger Equation Implementations with Gray Code for Adiabatic Quantum Computers

We reformulate the continuous-space Schrödinger equation in terms of spin Hamiltonians. For the kinetic energy operator, the critical concept facilitating the reduction in model complexity is the idea of position encoding. A binary encoding of position produces a spin-1/2 Heisenberg-like model and yields exponential improvement in space complexity when compared to classical computing. Encoding with a binary reflected Gray code (BRGC), and a Hamming-distance-2 Gray code (H2GC) reduces the model complexity down to the 𝑋⁢𝑍 and transverse Ising model, respectively. For 𝐴 qubits BRGC yields 2 𝐴 positions and is reduced to its 2-local form with O⁡(𝐴) ancillary qubits. H2GC yields 2 𝐴/2+1 positions with O⁡(𝐴 2 ) three-local penalty terms. We also identify the bijective mapping between diagonal unitaries and the Walsh series, producing the mapping of any real potential to a series of 𝑘 -local Ising models through the fast Walsh transform. Finally, in a finite volume, we provide some numerical evidence to support the claim that the total time needed for adiabatic evolution is protected by the infrared cutoff of the system. As a result, initial state preparation from a free-field wave function to an interacting system is expected to exhibit polynomial time complexity with volume and constant scaling with respect to lattice discretization for all encodings. For H2GC, if the evolution starts with the transverse Hamiltonian due to hardware restrictions, then penalties are dynamically introduced such that the low-lying spectrum reproduces the energy levels of the Laplacian. The adiabatic evolution of the penalty Hamiltonian is therefore sensitive to the ultraviolet scale. It is expected to exhibit polynomial time complexity with lattice discretization, or exponential time complexity with respect to the number of qubits given a fixed volume.

97 MATHEMATICS AND COMPUTING↗

Preparing angular momentum eigenstates using engineered quantum walks

Coupled angular-momentum eigenstates are widely used in atomic and nuclear physics calculations and are building blocks for spin networks and the Schur transform. To combine two angular momenta J 1 and J 2 , forming eigenstates of their total angular momentum J=J 1 +J 2 , we develop a quantum-walk scheme that does not require inputting O(j 3 ) nonzero Clebsch–Gordan (CG) coefficients classically. In fact, our scheme may be regarded as a unitary method for computing CG coefficients on quantum computers with a typical complexity of O⁡(j) and a worst-case complexity of O⁡(j 3 ). Equivalently, our scheme provides decompositions of the dense CG unitary into sparser unitary operations. Our scheme prepares angular-momentum eigenstates using a sequence of Hamiltonians to move an initial state deterministically to desired final states, which are usually highly entangled states in the computational basis. In contrast with usual quantum walks, whose Hamiltonians are prescribed, we engineer the Hamiltonians in su⁡(2)×su⁡(2), which are inspired by, but different from, Hamiltonians that govern magnetic resonances and dipole interactions. To achieve a deterministic preparation of both ket and bra states, we use projection and destructive interference to double pinch the quantum walks, such that each step is a unit-probability population transfer within a two-level system. We test our state preparation scheme on classical computers, reproducing tables of CG coefficients. Finally, we also implement small test problems on current quantum hardware.

97 MATHEMATICS AND COMPUTING↗

Insights into Constraining Rate Coefficients in Fuel Oxidation Mechanisms Using Genetic Algorithm Optimization

Accurate fuel oxidation mechanisms can enable predictive capabilities that aid in advancing combustion technologies. High-level computational kinetics can yield reasonable rate coefficients with uncertainties, in some cases, below a factor of 2. Computed rate coefficients can be constrained further by optimizing against experimental data. Here, we explore the application of genetic algorithm (GA) optimization to constrain computed rate coefficients in complex fuel oxidation mechanisms in conjunction with temperature-dependent species mole fractions from jet-stirred reactor (JSR) measurements. Cyclohexane is a model candidate for understanding the reactivity of cyclic fuels. In this work, we optimize the rate coefficients of the most recent literature cyclohexane mechanism, which incorporates theoretically computed rate coefficients for the reaction networks stemming from the first and second O 2 addition pathways, against the experimental results of two separate literature JSR studies. Optimization consistency is evaluated by carrying out three GA optimizations: fitting to the temperature-dependent species mole fractions in each JSR experiment separately and simultaneously fitting the species mole fractions in both experiments. Local sensitivity analyses are used to identify five influential low-temperature oxidation reactions for optimization. Although the three optimizations do not yield identical rate coefficients, the direction of change in all five rate coefficients is consistent among the three optimizations. Performance of the models from the three optimizations is assessed against literature ignition delay times with differences in the level of agreement observed among the different optimizations. In conclusion, comparisons are made with our recent optimization work of a cyclopentane oxidation master-equation model against time-resolved species concentrations, and insights and improvements of the strategy for constraining rate coefficients using GA optimization are discussed.

33 ADVANCED PROPULSION SYSTEMS↗

Comparison of free vortex wake and blade element momentum results against large-eddy simulation results for highly flexible turbines under challenging inflow conditions

Abstract. Throughout wind energy development, there has been a push to increase wind turbine size due to the substantial economic benefits. However, increasing turbine size presents several challenges, both physically and computationally. Modeling large, highly flexible wind turbines requires highly accurate models to capture the complicated aeroelastic response due to large deflections and nonstraight blade geometries. Additionally, the development of floating offshore wind turbines requires modeling techniques that can predict large rotor and tower motion. Free vortex wake methods model such complex physics while remaining computationally tractable to perform key simulations necessary during the turbine design process. Recently, a free vortex wake model – cOnvecting LAgrangian Filaments (OLAF) – was added to the National Renewable Energy Laboratory's engineering tool OpenFAST to allow for the aerodynamic modeling of highly flexible turbines along with the aero-hydro-servo-elastic response capabilities of OpenFAST. In this work, free vortex wake and low-fidelity blade element momentum (BEM) results are compared to high-fidelity actuator-line computational fluid dynamics simulation results via the Simulator fOr Wind Farm Applications (SOWFA) method for a highly flexible downwind turbine for varying yaw misalignment, shear exponent, and turbulence intensity conditions. Through these comparisons, it was found that for all considered quantities of interest, SOWFA, OLAF, and BEM results compare well for steady inflow conditions with no yaw misalignment. For OLAF results, this strong agreement with the SOWFA results was consistent for all yaw misalignment values. The BEM results, however, deviated significantly more from the SOWFA results with increasing absolute yaw misalignment. Differences between OLAF and BEM results were dominated by the yaw misalignment angle, with varying shear exponent and turbulence intensity leading to more subtle differences. Overall, OLAF results were more consistent than BEM results when compared to SOWFA results under challenging inflow conditions.

17 WIND ENERGY↗

Large Hyperfine Coupling Arising from Pseudo- 2 S Ground States in a Series of Lutetium(II) Metallocene Complexes

The synthesis of molecules with strong coupling between electronic and nuclear spins represents an important challenge in molecular quantum information science. Here, we report the synthesis and characterization of the divalent lutetium metallocene complexes Lu(Cp Me 5 )(Cp iPr 5 ) (Cp Me 5 = pentamethylcyclopentadienyl; Cp iPr 5 = pentaisopropylcyclopentadienyl), Lu(Cp iPr 4 Et ) 2 (Cp iPr 4 Et = ethyltetraisopropylcyclopentadienyl), and Lu(Cp iPr 4 ) 2 (Cp iPr 4 = tetraisopropylcyclopentadienyl). The molecular structures of these complexes, as determined through singlecrystal X-ray diffraction, feature a common bent sandwich geometry, with average Cp–Lu–Cp angles ranging from 159.9° to 152.6°. Analysis of continuous-wave electron paramagnetic resonance (EPR) spectra for the complexes reveals nearly isotropic g tensors with only a slight deviation from that of a free electron. Moreover, an extremely large splitting of the eight-line spectra indicates the presence of strong hyperfine coupling, and simulations provide isotropic hyperfine coupling constants of A iso = 4.38, 4.30, and 4.17 GHz across the series, where the value of A iso is found to decrease as the Cp–Lu–Cp angle becomes more acute. Notably, these values are the largest yet observed for any lanthanide complex. Moreover, EPR and computational analysis show that the large values of A iso stem from large s-orbital character up to 41.2% in the corresponding singly occupied molecular orbitals. To our knowledge, this degree of s-character in a molecular orbital is the largest yet reported for an open-shell isolable complex. These results outline a general strategy toward the isolation of paramagnetic molecules with strong hyperfine coupling and highly isotropic doublet electronic ground states.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Direct numerical simulations of turbulent reacting flows with shock waves and stiff chemistry using many-core/GPU acceleration

Compressible reacting flows may display sharp spatial variation related to shocks, contact discontinuities or reactive zones embedded within relatively smooth regions. The presence of such phenomena emphasizes the relevance of shock-capturing schemes such as the weighted essentially non-oscillatory (WENO) scheme as an essential ingredient of the numerical solver. However, these schemes are complex and have more computational cost than the simple high-order compact or non-compact schemes. In this paper, we present the implementation of a seventh-order, minimally-dissipative mapped WENO (WENO7M) scheme in a newly developed direct numerical simulation (DNS) code called KAUST Adaptive Reactive Flows Solver (KARFS). In order to make efficient use of the computer resources and reduce the solution time, without compromising the resolution requirement, the WENO routines are accelerated via graphics processing unit (GPU) computation. The performance characteristics and scalability of the code are studied using different grid sizes and block decomposition. Furthermore, the performance portability of KARFS is demonstrated on a variety of architectures including NVIDIA Tesla P100 GPUs and NVIDIA Kepler K20X GPUs. In addition, the capability and potential of the newly implemented WENO7M scheme in KARFS to perform DNS of compressible flows is also demonstrated with model problems involving shocks, isotropic turbulence, detonations and flame propagation into a stratified mixture with complex chemical kinetics.

97 MATHEMATICS AND COMPUTING↗

hPIC2: A hardware-accelerated, hybrid particle-in-cell code for dynamic plasma-material interactions

The exascale era of high performance computing promises to bring the field of computational plasma physics ever closer to the goal of accurate multiscale modeling. Such computers will rely on hardware acceleration to offload work to dedicated components, notably general-purpose graphics processing units (GPUs). However, devices from different manufacturers require software to be written with different parallel programming models, greatly increasing the code maintenance burden of applications designed to perform on more than one such device. hPIC2 is a hybrid plasma simulation code developed with the Kokkos performance portability framework to target the architectures that will drive exascale computing for the foreseeable future. As a hybrid simulation code, hPIC2 investigates the simultaneous use of various plasma models on the same domain, at the same time. hPIC2 also optionally couples to RustBCA, which accurately models ion-material interactions using the binary collision approximation (BCA) method. In conclusion, hPIC2 therefore achieves scalable performance on a variety of computing architectures when simulating complex and diverse plasmas, particularly near plasma-material interfaces.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗