Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Algebraic structures”

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

Machine learning Frenkel Hamiltonian parameters to accelerate simulations of exciton dynamics

In this manuscript, we develop multiple machine learning (ML) models to accelerate a scheme for parameterizing site-based models of exciton dynamics from all-atom configurations of condensed phase sexithiophene systems. This scheme encodes the details of a system’s specific molecular morphology in the correlated distributions of model parameters through the analysis of many single-molecule excited-state electronic-structure calculations. These calculations yield excitation energies for each molecule in the system and the network of pair-wise intermolecular electronic couplings. In this work, we demonstrate that the excitation energies can be accurately predicted using a kernel ridge regression (KRR) model with Coulomb matrix featurization. We present two ML models for predicting intermolecular couplings. The first one utilizes a deep neural network and bi-molecular featurization to predict the coupling directly, which we find to perform poorly. The second one utilizes a KRR model to predict unimolecular transition densities, which can subsequently be analyzed to compute the coupling. We find that the latter approach performs excellently, indicating that an effective, generalizable strategy for predicting simple bimolecular properties is through the indirect application of ML to predict higher-order unimolecular properties. Such an approach necessitates a much smaller feature space and can incorporate the insight of well-established molecular physics.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Algebraic discrete quantum harmonic oscillator with dynamic resolution scaling

We develop an algebraic formulation for the discrete quantum harmonic oscillator (DQHO) from the Hamiltonian for two, coupled QHOs and provide a physical picture for the Kravchuk function eigenstates of the oscillator. The familiar $\mathfrak{su}(2)$ structure of the coupled QHO Hamiltonian divides its spectrum into sets corresponding to the DQHO at different resolutions. In addition to energy ladder operators, the formulation allows for the introduction of resolution ladder operators connecting all DQHOs with different resolutions, thus enabling the dynamic scaling of the resolution of finite degree-of-freedom quantum simulations. The coherent state of the DQHO is constructed, and its expected position is proven to oscillate as a classical harmonic oscillator. The DQHO coherent state recovers that of the quantum harmonic oscillator at large resolution.

97 MATHEMATICS AND COMPUTING↗

Kink-antikink collisions and multi-bounce resonance windows in higher-order field theories

In this work, we study collisions of coherent structures in higher-order field-theoretic models, such as the Φ 8 , Φ 10 and Φ 12 ones. The main distinguishing feature, of the example models considered herein, is that the collision arises due to the long-range interacting algebraic tails of these solitary waves. We extend the approach to suitably initialize the relevant kinks, in the additional presence of finite initial velocity, in order to minimize the dispersive wave radiation potentially created by their slow spatial decay. We find that, when suitably initialized, these models still feature the multi-bounce resonance windows earlier found in models in which the kinks bear exponential tails, such as the Φ 4 and Φ 6 field theories among others. Also present is the self-similar structure of the associated windows with three- and more-bounce windows at the edges of two- and lower-bounce ones. Moreover, phenomenological but highly accurate (and predictive), scaling relations are derived for the dependence of the time between consecutive collisions and, e.g., the difference in kinetic energy between the incoming one and the critical one for one-bounces. Such scalings are traced extensively over two-bounce collision windows throughout the three models, hinting at the possibility of an analytical theory in this direction.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Machine learning and algebraic approaches towards complete matter spectra in 4d F-theory

Motivated by engineering vector-like (Higgs) pairs in the spectrum of 4d F-theory compactifications, we combine machine learning and algebraic geometry techniques to analyze line bundle cohomologies on families of holomorphic curves. To quantify jumps of these cohomologies, we first generate 1.8 million pairs of line bundles and curves embedded in dP 3 , for which we compute the cohomologies. A white-box machine learning approach trained on this data provides intuition for jumps due to curve splittings, which we use to construct additional vector-like Higgs-pairs in an F-Theory toy model. We also find that, in order to explain quantitatively the full dataset, further tools from algebraic geometry, in particular Brill-Noether theory, are required. Using these ingredients, we introduce a diagrammatic way to express cohomology jumps across the parameter space of each family of matter curves, which reflects a stratification of the F-theory complex structure moduli space in terms of the vector-like spectrum. Furthermore, these insights provide an algorithmically efficient way to estimate the possible cohomology dimensions across the entire parameter space.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Simulating image coaddition with the Nancy Grace Roman Space Telescope – I. Simulation methodology and general results

The upcoming Nancy Grace Roman Space Telescope will carry out a wide-area survey in the near-infrared. A key science objective is the measurement of cosmic structure via weak gravitational lensing. Roman data will be undersampled, which introduces new challenges in the measurement of source galaxy shapes; a potential solution is to use linear algebra-based coaddition techniques such as imcom that combine multiple undersampled images to produce a single oversampled output mosaic with a desired ‘target’ point spread function (PSF). We present here an initial application of imcom to 0.64 square degrees of simulated Roman data, based on the Roman branch of the Legacy Survey of Space and Time (LSST) Dark Energy Science Collaboration (DESC) Data Challenge 2 (DC2) simulation. We show that imcom runs successfully on simulated data that includes features such as plate scale distortions, chip gaps, detector defects, and cosmic ray masks. We simultaneously propagate grids of injected sources and simulated noise fields as well as the full simulation. We quantify the residual deviations of the PSF from the target (the ‘leakage’), as well as noise properties of the output images; we discuss how the overall tiling pattern as well as Moiré patterns appear in the final leakage and noise maps. We include appendices on interpolation algorithms and the interaction of undersampling with image processing operations that may be of broader applicability. The companion paper (‘Paper II’) explores the implications for weak lensing analyses.

79 ASTRONOMY AND ASTROPHYSICS↗

Tools for analysis of optimization models

The software is code for analyzing, debugging, and solving optimization models. The code implements several algorithms and provides convenient APIs to apply these algorithms to optimization models. The algorithms are primarily based on graph theory. They compute well-known partitions of graphs, and use these partitions to provide the user information about their optimization model, including diagnosing certain types of structural modeling errors. Some algorithms may be used as a subroutine to solve an optimization problem, and may call an optimization solver to facilitate this. Well-known linear algebra routines are called to provide further diagnostics. The software contains no data and no models other than toy models used for testing.

Parker, Robert↗

Improving scalability of electronic structure code for molecular simulations in the presence of environment

A scalable density functional electronic code with Gaussian basis set, called UTEP-NRLMOL, is developed to perform simulations of molecular systems in the presence of the environment with particular attention to the memory requirements. In the electronic structure calculations, the memory and computation time are proportional to the number of atoms. Memory requirements for density functional calculations scale as N*N, where N is the number of atoms. While the recent advances in HPC offer platforms with large numbers of cores, the limited amount of memory available on a given node and poor scalability of the electronic structure codes hinder their efficient usage of these platforms. We have introduced new scaling and parallelization paradigms using MPI-3 shared-memory functionality combined with usage of sparse algebra and storage of matrices in sparse format. This extends the range of applicability of the UTEP-NRLMOL code to large systems over 10,000 atoms, or using up to 67,000 basis functions, and making use of HPC architectures using over 6,000 processors utilizing all available cores. We have also interfaced code with effective fragment potential and polarizable continuum model libraries. The code was used in simulations of several applications which are published in reputed scientific journals.

74 ATOMIC AND MOLECULAR PHYSICS↗

SCF Framework, HF Stability, and RPA Correlation for Jordan–Wigner-Transformed Spin Hamiltonians on Arbitrary Coupling Topologies

Mapping spins to fermions via the Jordan–Wigner (JW) transformation can render mean-field (Hartree–Fock, HF) descriptions effective for strongly correlated spin systems. As established in recent work, the application of such approaches is not limited by the nonlocal structure of JW strings or by site ordering because string operators can be absorbed into Thouless rotations of a Slater determinant, and the variational optimization of a unitary Lie-algebraic similarity transformation removes any ordering dependence. Leveraging these ideas, we develop a self-consistent field (SCF) scheme that expresses the mean-field energy as a functional of the single-particle density matrix, providing an alternative to gradient-based optimization of Thouless parameters. We derive the analytical orbital Hessian to diagnose HF stability and compute the ground-state correlation energy through the random-phase approximation (RPA). Benchmark results for the XXZ and J 1 –J 2 model on one- and two-dimensional lattices demonstrate that RPA significantly improves mean-field accuracy.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

cuAlign: Scalable Network Alignment on GPU Accelerators

Given two graphs, the objective of network alignment is to find the best one-to-one mapping of vertices in one graph (??) to vertices in the other (??), such that the number of overlaps is maximized. We say that edges(??, ??) ???and(??', ??') ??? are overlapped if ?? is mapped to ??' and ?? is mapped to??'. Network alignment is an important optimization problem with several applications in bioinformatics, computer vision and ontology matching. Since it is an NP-hard problem, efficient heuristics and scalable implementations are necessary. In this work, we introduce a new framework that combines the concepts of intra-network proximity using vertex embedding,Belief Propagation (BP) and approximate weighted matching, and provides qualitative improvements up to22%over state-of-the-art approaches. We also provide scalable implementations on GPU accelerators, demonstrating up to19×speedup for Belief Propagation and 3× speedup for approximate weighted matching relative to previous multithreaded implementation. A combination of combinatorial and algebraic kernels within the network alignment algorithm poses significant hurdles for parallelization. Load imbalance and irregular DRAM traffic limit achievable performance on GPUs. Our novel approach identifies and exploits unique structural proper-ties of the BP-based algorithm and employs code fusion to reduce data movement between different steps of the algorithm. Using a diverse set of inputs, we demonstrate qualitative improvements of our algorithms, and performance gains of our GPU-accelerated implementation. We believe that our work will enable algorithmic improvements and practical applications of network alignment.

Xiang, Lizhi↗

Chiral soft algebras for $\mathcal{N}$ = $2$ gauge theory

Some time ago, Seiberg and Witten solved for moduli spaces of vacua parameterized by scalar vacuum expectation values in $\mathcal{N}$ = $2$ gauge theories. More recently, new vacua associated to soft theorems and asymptotic symmetries have been found. Furthermore, this paper takes some first steps towards a complete picture of the infrared geometry of $\mathcal{N}$ = $2$ gauge theory incorporating both of these infrared structures.

N = 2 gauge theory↗

GSoFa: Scalable Sparse Symbolic LU Factorization on GPUs

Decomposing a matrix $\mathbf {A}$ into a lower matrix $\mathbf {L}$ and an upper matrix $\mathbf {U}$, which is also known as LU decomposition, is an essential operation in numerical linear algebra. For a sparse matrix, LU decomposition often introduces more nonzero entries in the $\mathbf {L}$ and $\mathbf {U}$ factors than in the original matrix. A symbolic factorization step is needed to identify the nonzero structures of $\mathbf {L}$ and $\mathbf {U}$ matrices. Attracted by the enormous potentials of the Graphics Processing Units (GPUs), an array of efforts have surged to deploy various LU factorization steps except for the symbolic factorization, to the best of our knowledge, on GPUs. This article introduces gSoFa, the first GPU-based symbolic factorization design with the following three optimizations to enable scalable LU symbolic factorization for nonsymmetric pattern sparse matrices on GPUs. First, here we introduce a novel fine-grained parallel symbolic factorization algorithm that is well suited for the Single Instruction Multiple Thread (SIMT) architecture of GPUs. Second, we tailor supernode detection into a SIMT friendly process and strive to balance the workload, minimize the communication and saturate the GPU computing resources during supernode detection. Third, we introduce a three-pronged optimization to reduce the excessive space consumption problem faced by multi-source concurrent symbolic factorization. Taken together, gSoFa achieves up to 31× speedup from 1 to 44 Summit nodes (6 to 264 GPUs) and outperforms the state-of-the-art CPU project, on average, by 5×. Notably, gSoFa also achieves up to 47 percent of the peak memory throughput of a V100 GPU in the Summit Supercomputer.

97 MATHEMATICS AND COMPUTING↗

Equilibrium field theory of magnetic monopoles in degenerate square spin ice: Correlations, entropic interactions, and charge screening regimes

In this work, we describe degenerate square spin as an ensemble of magnetic monopoles coupled via an emergent entropic field that subsumes the effect of the underlying spin vacuum. We compute their effective free energy, entropic interaction, correlations, screening, and structure factor, and find that they coincide with the experimental ones. Unlike in pyrochlore ices, a dimensional mismatch between real and entropic interactions leads to weak singularities at the pinch points and algebraic correlations at long distances. This algebraic screening can be, however, camouflaged by a pseudoscreening regime.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Milestone 49 Report: Batched Sparse LA Phase 5 Implementation

Batched sparse linear algebra operations in general, and solvers in particular, have become the major algorithmic development activity and foremost performance engineering effort in the numerical software libraries work on modern hardware with accelerators such as GPUs. Many applications, ECP and non-ECP alike, require simultaneous solutions of many small linear systems of equations that are structurally sparse in one form or another. In order to move towards high hardware utilization levels, it is important to provide these applications with appropriate interface designs to be both functionally efficient and performance portable and give full access to the appropriate batched sparse solvers running on modern hardware accelerators prevalent across DOE supercomputing sites since the inception of ECP. To this end, we present here a summary of recent advances on the interface designs in use by HPC software libraries supporting batched sparse linear algebra and the development of sparse batched kernel codes for solvers and preconditioners. We also address the potential interoperability opportunities to keep the corresponding software portable between the major hardware accelerators from AMD, Intel, and NVIDIA, while maintaining the appropriate disclosure levels conforming to the active NDA agreements. The presented interface specifications include a mix of batched band, sparse iterative, and sparse direct solvers with their accompanying functionality that is already required by the application codes or we anticipated to be needed in the near future. This report summarizes progress in Kokkos Kernels and the xSDK libraries MAGMA, Ginkgo, hypre, PETSc, and SuperLU.

97 MATHEMATICS AND COMPUTING↗

RadSim: Math, Utility & RTK

This package includes three parts, (1) gov.llnl.math, (2)gov.llnl.utility and (3)gov.llnl.rtk, which are utilized in the development of Radiation Detector Simulator (RadSim) project. RadSim is being developed to provide the capability to: (1) simulate radiation source emissions, (2) interpolate results from radiation transport tools into a common format to prepare incident flux, and (3) model radiation detector response to rapidly produce synthetic radiation measurement templates. RadSim is targeted for open-source release, which will enable researchers and industry partners to model gamma-ray detectors response to simulated flux from the transport tool of their choice. The techniques and implementation will be entirely transparent, which will allow for improvements and boutique modifications by future researchers beyond the lifespan of this specific project. The first tool of the package, gov.llnl.math, includes classes and functions to define and perform basic math operations. Some of the example features available in the package include defining statistical distributions and performing algebra and matrix operations, all of which are already accessible on publicly available software packages such as MATLAB and ROOT. The second package gov.llnl.utility includes tools commonly used to enable optimization and readability of various data structures such as Java lists and external xml files. Lastly, the gov.llnl.rtk package includes classes and functions to implement methods commonly used in radiation physics, such as data structures to represent and characterize photon spectra and tools to apply well-defined and published methods to calibrate a given spectra.

Cheung, Hoi Sing↗

High Performance PEFC Electrode Structures

Raytheon Technologies Research Center (RTRC) in collaboration with Ion Power Inc. and the University of Arkansas at Little Rock and the FC-PAD consortium executed a project that: (1) developed comprehensive models of oxygen and proton transport in cathode catalyst layers that provided new insights about losses associated with reducing platinum loading to 0.1 mg/cm 2 , (2) designed, fabricated, characterized, and tested cells featuring carbon-supported catalyst layers with low platinum loadings that met efficiency and power density targets set forth by the Hydrogen and Fuel Cells Technology Office, and (3) designed, fabricated, characterized, and tested novel catalyst structures. The modeling efforts produced eight scientific publications that shared new descriptions of oxygen and proton transport in catalyst layers with the broader technical community. The key physical insights from the models are expressed in straightforward algebraic expressions, facilitating easy adoption by other researchers. The models developed during the project explain why resistance to oxygen transport is inversely proportional to interfacial area of platinum – an observation that eluded quantitative explanation for a decade. The models quantitatively predict polarization when measured morphological parameters and transport properties are input. Membrane-electrode assemblies made during the project met stated goals for current at high voltage and power density at rated voltage for transportation fuel cells at the end of budget period 2. High performance was achieved by developing a diffusion layer with low resistance to oxygen transport and a PtCo/C cathode catalyst layer capable of supporting rapid proton and oxygen transport. The project was subsequently directed to curtail experimental work and focus on modeling during budget period 3. Ion Power Inc. developed new expertise in fabricating catalyst layers containing platinum-cobalt catalysts, and processing very thin membranes. The University of Arkansas at Little Rock developed novel nanocolumnar self-supported thin film electrocatalysts that can be grown on carbon supports using a simple high pressure sputter deposition method. The nanocolumnar microstructure provides adequate surface-to-volume ratio for efficient platinum utilization, and the conformal platinum shell with larger crystal grain sizes covering the carbon support surface may eliminate durability issues associated with catalyst dissolution, agglomeration, and carbon corrosion.

08 HYDROGEN↗

Large-Scale Materials Modeling at Quantum Accuracy: Ab Initio Simulations of Quasicrystals and Interacting Extended Defects in Metallic Alloys

Ab initio electronic-structure has remained dichotomous between achievable accuracy and length-scale. Quantum many-body (QMB) methods realize quantum accuracy but fail to scale. Density functional theory (DFT) scales favorably but remains far from quantum accuracy. We present a framework that breaks this dichotomy by use of three interconnected modules: (i) invDFT: a methodological advance in inverse DFT linking QMB methods to DFT; (ii) MLXC: a machine-learned density functional trained with invDFT data, commensurate with quantum accuracy; (iii) DFT-FE-MLXC: an adaptive higher-order spectral finite-element (FE) based DFT implementation that integrates MLXC with efficient solver strategies and HPC innovations in FE-specific dense linear algebra, mixed-precision algorithms, and asynchronous compute-communication. Furthermore, we demonstrate a paradigm shift in DFT that not only provides an accuracy commensurate with QMB methods in ground-state energies, but also attains an unprecedented performance of 659.7 PFLOPS (43.1% peak FP64 performance) on 619,124 electrons using 8,000 GPU nodes of Frontier supercomputer.

density functional theory↗

Revealing topology in metals using experimental protocols inspired by K-theory

Topological metals are conducting materials with gapless band structures and nontrivial edge-localized resonances. Their discovery has proven elusive because traditional topological classification methods require band gaps to define topological robustness. Inspired by recent theoretical developments that leverage techniques from the field of C*-algebras to identify topological metals, here, we directly observe topological phenomena in gapless acoustic crystals and realize a general experimental technique to demonstrate their topology. Specifically, we not only observe robust boundary-localized states in a topological acoustic metal, but also re-interpret a composite operator—mathematically derived from the K-theory of the problem—as a new Hamiltonian whose physical implementation allows us to directly observe a topological spectral flow and measure the topological invariants. Our observations and experimental protocols may offer insights for discovering topological behaviour across a wide array of artificial and natural materials that lack bulk band gaps.

36 MATERIALS SCIENCE↗

Soft scalars in effective field theory

We derive a soft theorem for a massless scalar in an effective field theory with generic field content using the geometry of field space. This result extends the geometric soft theorem for scalar effective field theories by allowing the massless scalar to couple to other scalars, fermions, and gauge bosons. The soft theorem keeps its geometric form, but where the field-space geometry now involves the full field content of the theory. As a bonus, we also present novel double soft theorems with fermions, which mimic the geometric structure of the double soft theorem for scalars.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗