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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 109 records · Page 6

All sources NASA NTRS DOE OSTI

DOE OSTI2026

An algebraic convolution formulation for multiple-scattering correction in small-angle neutron scattering

Multiple scattering in small-angle neutron scattering (SANS) redistributes spectral weight and distorts structural interpretation, particularly for thick or strongly scattering samples. We develop a finite-dimensional spectral desmearing framework that corrects multiple scattering without resorting to integral transforms or model-dependent extrapolation. The primary intensity is expanded in an orthonormal basis adapted to the isotropic transverse-momentum measure, under which convolution reduces to a recursive tensor contraction, allowing the Poisson-weighted multiple-scattering series to be evaluated directly in a finite-dimensional basis representation. This formulation yields a stable forward–inverse mapping between apparent and primary spectra. Numerical tests demonstrate convergence under repeated convolution and accurate recovery of the single-scattering intensity. Application to SANS measurements collected at multiple neutron facilities, including the Spallation Neutron Source, the High Flux Isotope Reactor, and the Institut Laue-Langevin, shows the quantitative reconstruction of the underlying primary spectrum across a wide range of transmission conditions, including strongly attenuating samples. Here, the method provides a stable, model-agnostic framework for multiple-scattering correction in SANS and enables consistent structural interpretation across instruments and scattering regimes.

Tung, Chi-Huan [Oak Ridge National Laboratory (ORN↗

DOE OSTI2024

Hartree–Fock–Bogoliubov theory for number-parity-violating fermionic Hamiltonians

It is usually asserted that physical Hamiltonians for fermions must contain an even number of fermion operators. This is indeed true in electronic structure theory. However, when the Jordan–Wigner (JW) transformation is used to map physical spin Hamiltonians to Hamiltonians of spinless fermions, terms that contain an odd number of fermion operators may appear. The resulting fermionic Hamiltonian thus does not have number parity symmetry and requires wave functions that do not have this symmetry either. In this work, we discuss the extension of standard Hartree–Fock–Bogoliubov (HFB) theory to the number-parity-nonconserving case. These ideas had appeared in the literature before but, perhaps for lack of practical applications, had, to the best of our knowledge, never been employed. We here present a useful application for this more general HFB theory based on coherent states of the SO(2M + 1) Lie group, where M is the number of orbitals. Here, we also show how using these unusual mean-field states can provide significant improvements when studying the JW transformation of chemically relevant spin Hamiltonians.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2024

A Provably Accurate Randomized Sampling Algorithm for Logistic Regression

In statistics and machine learning, logistic regression is a widely-used supervised learning technique primarily employed for binary classification tasks. When the number of observations greatly exceeds the number of predictor variables, we present a simple, randomized sampling-based algorithm for logistic regression problem that guarantees high-quality approximations to both the estimated probabilities and the overall discrepancy of the model. Our analysis builds upon two simple structural conditions that boil down to randomized matrix multiplication, a fundamental and well-understood primitive of randomized numerical linear algebra. We analyze the properties of estimated probabilities of logistic regression when leverage scores are used to sample observations, and prove that accurate approximations can be achieved with a sample whose size is much smaller than the total number of observations. To further validate our theoretical findings, we conduct comprehensive empirical evaluations. Overall, our work sheds light on the potential of using randomized sampling approaches to efficiently approximate the estimated probabilities in logistic regression, offering a practical and computationally efficient solution for large-scale datasets.

Chowdhury, Agniva↗

DOE OSTI2023

Beyond Generalized Eigenvalues in Lattice Quantum Field Theory

Two analysis techniques, the generalized eigenvalue method (GEM) or Prony's (or related) method (PM), are commonly used to analyze statistical estimates of correlation functions produced in lattice quantum field theory calculations. GEM takes full advantage of the matrix structure of correlation functions but only considers individual pairs of time separations when much more data exists. PM can be applied to many time separations and many individual matrix elements simultaneously but does not fully exploit the matrix structure of the correlation function. We combine both these methods into a single framework based on matrix polynomials. As these algebraic methods are well known for producing extensive spectral information about statistically-noisy data, the method should be paired with some information criteria, like the recently proposed Bayesean model averaging.

Fleming, George T.↗

DOE OSTI2025

Ensemble Simulation Techniques and Fast Randomized Algorithms

The major goals of the project were to develop and analyze new ensemble simulation techniques, including trajectory stratification and preconditioned MCMC techniques, as well as develop fast numerical linear algebra techniques closely related to ensemble simulation ideas. The trajectory stratification techniques involve simulating in parallel short trajectory fragments of a Markov process confined to a specific region of space‐time and then patching together the statistics gathered to assemble estimates of very general dynamical properties. We have also developed this approach for rare event simulation and extended the techniques to applications requiring a more general framework (such as electronic structure calculations). The preconditioned MCMC techniques involve simulating multiple Markov chains in parallel and then using information from the ensemble to speed the mixing of each individual chain. The fast randomized linear algebra methods are motivated by the diffusion Monte Carlo technique, but are applicable to finding the dominant eigenvalue of (almost) general matrices. For most non‐negative matrices, the schemes result in an error (compared to the power method) that is constant in the dimension of the problem. For more general matrices, we see a very clear sublinear cost trend in computational tests.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

DOE OSTI2022

Landau discriminants

Scattering amplitudes in quantum field theories have intricate analytic properties as functions of the energies and momenta of the scattered particles. In perturbation theory, their singularities are governed by a set of nonlinear polynomial equations, known as Landau equations, for each individual Feynman diagram. The singularity locus of the associated Feynman integral is made precise with the notion of the Landau discriminant, which characterizes when the Landau equations admit a solution. In order to compute this discriminant, we present approaches from classical elimination theory, as well as a numerical algorithm based on homotopy continuation. These methods allow us to compute Landau discriminants of various Feynman diagrams up to 3 loops, which were previously out of reach. For instance, the Landau discriminant of the envelope diagram is a reducible surface of degree 45 in the three-dimensional space of kinematic invariants. We investigate geometric properties of the Landau discriminant, such as irreducibility, dimension and degree. In particular, we find simple examples in which the Landau discriminant has codimension greater than one. Furthermore, we describe a numerical procedure for determining which parts of the Landau discriminant lie in the physical regions. In order to study degenerate limits of Landau equations and bounds on the degree of the Landau discriminant, we introduce Landau polytopes and study their facet structure. Finally, we provide an efficient numerical algorithm for the computation of the number of master integrals based on the connection to algebraic statistics.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2021

Investigating phase transitions from local crystallographic analysis based on statistical learning of atomic environments in 2D MoS 2 -ReS 2

Traditionally, phase transitions are explored using a combination of macroscopic functional characterization and scattering techniques, providing insight into the average properties and symmetries of the lattice but local atomic level mechanisms during phase transitions generally remain unknown. Here, we explore the mechanisms of a phase transition between the trigonal prismatic and distorted octahedral phases of layered chalcogenides in the 2D MoS 2 - ReS 2 system from the observations of local degrees of freedom, namely atomic positions by Scanning Transmission Electron Microscopy (STEM). We employ local crystallographic analysis based on statistical learning of atomic environments to build a picture of the transition from the atomic level up and determine local and global variables controlling the local symmetry breaking. In particular, we argue that the dependence of the average symmetry breaking distortion amplitude on global and local concentration can be used to separate local chemical as well as global electronic effects on transition. This approach allows exploring atomic mechanisms beyond the traditional macroscopic descriptions, utilizing the imaging of compositional fluctuations in solids to explore phase transitions over a range of realized and observed local stoichiometries and atomic configurations.

25 ENERGY STORAGE↗

DOE OSTI2023

Scalable computations for nonstationary Gaussian processes

Nonstationary Gaussian process models can capture complex spatially varying dependence structures in spatial datasets. However, the large number of observations in modern datasets makes fitting such models computationally intractable with conventional dense linear algebra. In addition, derivative-free or even first-order optimization methods can be very slow to converge when estimating many spatially varying parameters. In this paper, we present a computational framework which couples an algebraic block diagonal plus low-rank covariance matrix approximation with stochastic trace estimation to facilitate the efficient use of second-order solvers for maximum likelihood estimation of Gaussian process models with many parameters. We demonstrate the effectiveness of these methods by simultaneously fitting 192 parameters in the popular nonstationary model of Paciorek and Schervish using 107,600 sea surface temperature anomaly measurements.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2022

Causal diamonds, cluster polytopes and scattering amplitudes

The “amplituhedron” for tree-level scattering amplitudes in the bi-adjoint φ 3 theory is given by the ABHY associahedron in kinematic space, which has been generalized to give a realization for all finite-type cluster algebra polytopes, labelled by Dynkin diagrams. In this letter we identify a simple physical origin for these polytopes, associated with an interesting (1 + 1)-dimensional causal structure in kinematic space, along with solutions to the wave equation in this kinematic “spacetime” with a natural positivity property. The notion of time evolution in this kinematic spacetime can be abstracted away to a certain “walk”, associated with any acyclic quiver, remarkably yielding a finite cluster polytope for the case of Dynkin quivers. The A n–3 , B n–1 /C n–1 and D n polytopes are the amplituhedra for n-point tree amplitudes, one-loop tadpole diagrams, and full integrand of one-loop amplitudes. We also introduce a polytope D¯ n , which chops the D n polytope in half along a symmetry plane, capturing one-loop amplitudes in a more efficient way.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2021

A Flexible Power Method for Solving Infinite Dimensional Tensor Eigenvalue Problems

We propose a flexible power method for computing the leftmost, i.e., algebraically smallest, eigenvalue of an infinite dimensional tensor eigenvalue problem, $H x = \lambda x$, where the infinite dimensional symmetric matrix $H$ exhibits a translational invariant structure. We assume the smallest eigenvalue of $H$ is simple and apply a power iteration of $e^{-H}$ with the eigenvector represented in a compact way as a translational invariant infinite Tensor Ring (iTR). Hence, the infinite dimensional eigenvector can be represented by a finite number of iTR cores of finite rank. In order to implement this power iteration, we use a small parameter $t$ so that the infinite matrix-vector operation $e^{-Ht}x$ can efficiently be approximated by the Lie product formula, also known as Suzuki--Trotter splitting, and we employ a low rank approximation through a truncated singular value decomposition on the iTR cores in order to keep the cost of subsequent power iterations bounded. We also use an efficient way for computing the iTR Rayleigh quotient and introduce a finite size iTR residual which is used to monitor the convergence of the Rayleigh quotient and to modify the timestep $t$. In this paper, we discuss 2 different implementations of the flexible power algorithm and illustrate the automatic timestep adaption approach for several numerical examples.

Beeumen, Roel Van↗

DOE OSTI2024

Explicit Quantum Circuits for Block Encodings of Certain Sparse Matrices

Many standard linear algebra problems can be solved on a quantum computer by using recently developed quantum linear algebra algorithms that make use of block encodings and quantum eigenvalue/singular value transformations. A block encoding embeds a properly scaled matrix of interest A in a larger unitary transformation U that can be decomposed into a product of simpler unitaries and implemented efficiently on a quantum computer. Although quantum algorithms can potentially achieve exponential speedup in solving linear algebra problems compared to the best classical algorithm, such a gain in efficiency ultimately hinges on our ability to construct an efficient quantum circuit for the block encoding of A, which is difficult in general, and not trivial even for well structured sparse matrices. Here, in this paper, we give a few examples on how efficient quantum circuits can be explicitly constructed for some well structured sparse matrices and discuss a few strategies used in these constructions. We also provide implementations of these quantum circuits in MATLAB.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2022

Krylov subspace recycling for evolving structures

Krylov subspace recycling is a powerful tool when solving a long series of large, sparse linear systems that change only slowly over time. In PDE constrained shape optimization, these series appear naturally, as typically hundreds or thousands of optimization steps are needed with only small changes in the geometry. In this setting, however, applying Krylov subspace recycling can be a difficult task. As the geometry evolves, in general, so does the finite element mesh defined on or representing this geometry, including the numbers of nodes and elements and element connectivity. This is especially the case if re-meshing techniques are used. As a result, the number of algebraic degrees of freedom in the system changes, and in general the linear system matrices resulting from the finite element discretization change size from one optimization step to the next. Changes in the mesh connectivity also lead to structural changes in the matrices. In the case of re-meshing, even if the geometry changes only a little, the corresponding mesh might differ substantially from the previous one. Obviously, this prevents any straightforward mapping of the approximate invariant subspace of the linear system matrix (the focus of recycling in this work) from one optimization step to the next; similar problems arise for other selected subspaces. In this paper, we present an algorithm to map an approximate invariant subspace of the linear system matrix for the previous optimization step to an approximate invariant subspace of the linear system matrix for the current optimization step, for general meshes. This is achieved by exploiting the map from coefficient vectors to finite element functions on the mesh, combined with interpolation or approximation of functions on the finite element mesh. We demonstrate the effectiveness of our approach numerically with several proof of concept studies for a specific meshing technique.

42 ENGINEERING↗

DOE OSTI2022

Complex Fermi–Löwdin orbital self-interaction correction

Here, this paper introduces the use of complex Fermi orbital descriptors (FODs) in the Fermi–Löwdin self-interaction-corrected density functional theory (FLOSIC). With complex FODs, the Fermi–Löwdin orbitals (FLOs) that are used to evaluate the SIC correction to the total energy become complex. Complex FLO-SIC (cFLOSIC) calculations based on the local spin density approximation produce total energies that are generally lower than the corresponding energies found with FLOSIC restricted to real orbitals (rFLOSIC). The cFLOSIC results are qualitatively similar to earlier Perdew–Zunger SIC (PZ-SIC) calculations using complex orbitals. The energy lowering stems from the exchange–correlation part of the self-interaction correction. The Hartree part of the correction is more negative in rFLOSIC. The energy difference between real and complex solutions is greater for more strongly hybridized FLOs in atoms and for FLOs corresponding to double and triple bonds in molecules. The case of N2 is examined in detail to show the differences between the real and complex FLOs. We show that the complex triple-bond orbitals are simple, and physically appealing combinations of π and σ g orbitals that have not been discussed before. Consideration of complex FODs, and resulting unitary transformations, underscores the fact that FLO centroids are not necessarily good guesses for FOD positions in a FLOSIC calculation.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2026

Nonlinear causality of Israel-Stewart theory with diffusion

We present the first fully nonlinear causality constraints in D = 3 + 1 dimensions for Israel-Stewart theory in the presence of energy and number diffusion in the Eckart and Landau hydrodynamic frames, respectively. These constraints are algebraic inequalities that make no assumption on the underlying geometry of the spacetime or the equation of state. In order to highlight the distinct physical and structural behavior of the two hydrodynamic frames, we discuss the special ultrarelativistic ideal gas equation of state considered in earlier literature in D = 1 + 1 dimensions, and show that our general D = 3 + 1 constraints reduce to their results upon an appropriate choice of angles. For this equation of state in both D = 1 + 1 and D = 3 + 1 dimensions one can show that: (i) there exists a region allowed by nonlinear causality in which the baryon current transitions into a spacelike vector in the Landau frame, and (ii) an analogous argument shows that the solutions of the Eckart frame equations of motion never violate the dominant energy condition, assuming nonlinear causality holds. Furthermore, we then compare our results with those from linearized Israel-Stewart theory and show that the linear causality bounds fail to capture the new physical constraints on energy and number diffusion that are successfully obtained through our nonlinear causality approach.

Quark-gluon plasma↗

DOE OSTI2023

Tomographic optical emission spectroscopy of an atmospheric pressure plasma jet and surface ionization waves on planar and structured surfaces

Here in this paper, an approach for 3D plasma structure diagnostics using tomographic optical emission spectroscopy (Tomo-OES) of a nanosecond pulsed atmospheric pressure plasma jet (APPJ) is presented. In contrast to the well-known Abel inversion, Tomo-OES does not require cylindrical symmetry to recover 3D distributions of plasma light emission. Instead, many 2D angular projections are measured with intensified cameras and the multiplicative algebraic reconstruction technique is used to recover the 3D distribution of light emission. This approach solves the line-of-sight integration problem inherent to optical diagnostics, allowing recovery of localized OES information within the plasma that can be used to better infer plasma parameters within complex plasma structures. Here, Tomo-OES was applied to investigate an APPJ operated with helium in ambient air and impinging on planar and structured dielectric surfaces. Surface charging caused the guided streamer from the APPJ to transition to a surface ionization wave (SIW) that propagated along the surface. The SIW experienced variable geometrical and electrical material properties as it propagated, leading to 3D configurations that were non-symmetric and spatially complex. Light emission from He, N$_2^+$, and N2 were imaged at ten angular projections and the respective time-resolved 3D emission distributions in the plasma were then reconstructed. The spatial resolution of each tomographic reconstruction was 7.4 µm and the temporal resolution was 5 ns, sufficient to observe the guided streamer and the effects of the structured surface on the SIW. Emission from He showed the core of the jet and emission from N$_2^+$ and N2 indicated effects of entrainment of ambient air. Penning ionization of N2 created a ring or outer layer of N$_2^+$ that spatially converged to form the 'plasma bullet' or spatially diverged across a surface as part of a SIW. The SIW entered trenches of size 150 µm, leading to decreases in plasma light emission in regions above the trenches. The plasma light emission was higher in some regions with trenches, possibly due to effects of field enhancement.

plasma interactions with complex surfaces↗

DOE OSTI2023

Deep learning symmetries and their Lie groups, algebras, and subalgebras from first principles

Abstract We design a deep-learning algorithm for the discovery and identification of the continuous group of symmetries present in a labeled dataset. We use fully connected neural networks to model the symmetry transformations and the corresponding generators. The constructed loss functions ensure that the applied transformations are symmetries and the corresponding set of generators forms a closed (sub)algebra. Our procedure is validated with several examples illustrating different types of conserved quantities preserved by symmetry. In the process of deriving the full set of symmetries, we analyze the complete subgroup structure of the rotation groups SO (2), SO (3), and SO (4), and of the Lorentz group S O ( 1 , 3 ) . Other examples include squeeze mapping, piecewise discontinuous labels, and SO (10), demonstrating that our method is completely general, with many possible applications in physics and data science. Our study also opens the door for using a machine learning approach in the mathematical study of Lie groups and their properties.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2021

Hydrodynamics of quantum spin liquids

Quantum spin liquids are topological states of matter that arise in frustrated quantum magnets at low temperatures. At low energies, such states exhibit emergent gauge fields and fractionalized quasiparticles and can also possess enhanced global symmetries compared to their parent microscopic Hamiltonians. Here we study the consequences of this emergent gauge and symmetry structure for the hydrodynamics of quantum spin liquids. Specifically, we analyze two cases, the U(1) spin liquid with a Fermi surface and the SU(4)-symmetric “algebraic” spin liquid. We show that the emergent degrees of freedom in the spin liquid phase lead to a variety of additional hydrodynamic modes compared to the high-temperature paramagnetic phase. We identify a hydrodynamic regime for the internal U(1) gauge field common to both states, characterized by slow diffusion of the internal transverse photon.

36 MATERIALS SCIENCE↗

DOE OSTI2022

Modeling Analog Tile-Based Accelerators Using SST

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

97 MATHEMATICS AND COMPUTING↗