Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Algebraic models”

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 1,189 records · Page 66
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

CSPlib: A performance portable parallel software toolkit for analyzing complex kinetic mechanisms

Computational singular perturbation (CSP) is a method to analyze dynamical systems. It targets the decoupling of fast and slow dynamics using an alternate linear expansion of the right-hand side of the governing equations based on eigenanalysis of the associated Jacobian matrix. This representation facilitates diagnostic analysis, detection and control of stiffness, and the development of simplified models. For this work, we have implemented CSP in a C++ open-source library CSPlib using the Kokkos parallel programming model to address portability across diverse heterogeneous computing platforms, i.e., multi/many-core CPUs and GPUs. We describe the CSPlib implementation and present its computational performance across different computing platforms using several test problems. Specifically, we test the CSPlib performance for a constant pressure ignition reactor model on different architectures, including IBM Power 9, Intel Xeon Skylake, and NVIDIA V100 GPU. The size of the chemical kinetic mechanism is varied in these tests. As expected, the Jacobian matrix evaluation, the eigensolution of the Jacobian matrix, and matrix inversion are the most expensive computational tasks. When considering the higher throughput characteristic of GPUs, GPUs performs better for small matrices with higher occupancy rate. CPUs gain more advantages from the higher performance of well-tuned and optimized linear algebra libraries such as OpenBLAS.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Scalable learning of potentials to predict time-dependent Hartree–Fock dynamics

We propose a framework to learn the time-dependent Hartree–Fock (TDHF) inter-electronic potential of a molecule from its electron density dynamics. Although the entire TDHF Hamiltonian, including the inter-electronic potential, can be computed from first principles, we use this problem as a testbed to develop strategies that can be applied to learn a priori unknown terms that arise in other methods/approaches to quantum dynamics, e.g., emerging problems such as learning exchange–correlation potentials for time-dependent density functional theory. We develop, train, and test three models of the TDHF inter-electronic potential, each parameterized by a four-index tensor of size up to 60 × 60 × 60 × 60. Two of the models preserve Hermitian symmetry, while one model preserves an eight-fold permutation symmetry that implies Hermitian symmetry. Across seven different molecular systems, we find that accounting for the deeper eight-fold symmetry leads to the best-performing model across three metrics: training efficiency, test set predictive power, and direct comparison of true and learned inter-electronic potentials. All three models, when trained on ensembles of field-free trajectories, generate accurate electron dynamics predictions even in a field-on regime that lies outside the training set. To enable our models to scale to large molecular systems, we derive expressions for Jacobian-vector products that enable iterative, matrix-free training.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Fast explicit solutions for neutrino-electron scattering: Explicit asymptotic methods

Here, we present results of explicit asymptotic approximations applied to neutrino-electron scattering in a representative model of neutrino population evolution under conditions characteristic of core-collapse supernova explosions or binary neutron star mergers. It is shown that this approach provides stable solutions of these stiff systems of equations, with accuracy and time stepping comparable to that for standard implicit treatments such as backward Euler, fixed point iteration, and Anderson-accelerated fixed point iteration. Because each time step can be computed more rapidly with the explicit asymptotic approximation than with implicit methods, this suggests that algebraically stabilized explicit integration methods could be used to compute neutrino evolution coupled to hydrodynamics more efficiently in stellar explosions and mergers than the methods currently in use.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2024

Semicoherent symmetric quantum processes: Theory and applications

Discovering pragmatic and efficient approaches to construct ε-approximations of quantum operators such as real (imaginary) time-evolution propagators in terms of the basic quantum operations (gates) is challenging. Prior ε-approximations are invaluable, in that they enable the compilation of classical and quantum algorithm modeling of, e.g., dynamical and thermodynamic quantum properties. In parallel, symmetries are powerful tools concisely describing the fundamental laws of nature; the symmetric underpinnings of physical laws have consistently provided profound insights and substantially increased predictive power. In this work, we consider the interplay between the ε-approximate processes and the exact symmetries in a semicoherent context—where measurements occur at each logical clock cycle. Here we draw inspiration from Pascual Jordan's groundbreaking formulation of nonassociative, but commutative, symmetric algebraic form. Our symmetrized formalism is then applied in various domains such as quantum random walks, real-time evolutions, variational algorithm ansatzes, and efficient entanglement verification. Our work paves the way for a deeper understanding and greater appreciation of how symmetries can be used to control quantum dynamics in settings where coherence is a limited resource.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2026

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↗
NASA NTRS1994

Parallel grid generation algorithm for distributed memory computers

A parallel grid-generation algorithm and its implementation on the Intel iPSC/860 computer are described. The grid-generation scheme is based on an algebraic formulation of homotopic relations. Methods for utilizing the inherent parallelism of the grid-generation scheme are described, and implementation of multiple levELs of parallelism on multiple instruction multiple data machines are indicated. The algorithm is capable of providing near orthogonality and spacing control at solid boundaries while requiring minimal interprocessor communications. Results obtained on the Intel hypercube for a blended wing-body configuration are used to demonstrate the effectiveness of the algorithm. Fortran implementations bAsed on the native programming model of the iPSC/860 computer and the Express system of software tools are reported. Computational gains in execution time speed-up ratios are given.

Moitra, Stuti↗
DOE OSTI2020

Twisted circle compactifications of 6 d SCFTs

We study 6d superconformal field theories (SCFTs) compactified on a circle with arbitrary twists. The theories obtained after compactification, often referred to as 5d Kaluza-Klein (KK) theories, can be viewed as starting points for RG flows to 5d SCFTs. According to a conjecture, all 5d SCFTs can be obtained in this fashion. We compute the Coulomb branch prepotential for all 5d KK theories obtainable in this manner and associate to these theories a smooth local genus one fibered Calabi-Yau threefold in which is encoded information about all possible RG flows to 5d SCFTs. These Calabi-Yau threefolds provide hitherto unknown M-theory duals of F-theory configurations compactified on a circle with twists. For certain exceptional KK theories that do not admit a standard geometric description we propose an algebraic description that appears to retain the properties of the local Calabi-Yau threefolds necessary to determine RG flows to 5d SCFTs, along with other relevant physical data.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Scattering equations in AdS: scalar correlators in arbitrary dimensions

We introduce a bosonic ambitwistor string theory in AdS space. Even though the theory is anomalous at the quantum level, one can nevertheless use it in the classical limit to derive a novel formula for correlation functions of boundary CFT operators in arbitrary space-time dimensions. The resulting construction can be treated as a natural extension of the CHY formalism for the flat-space S-matrix, as it similarly expresses tree-level amplitudes in AdS as integrals over the moduli space of Riemann spheres with punctures. These integrals localize on an operator-valued version of scattering equations, which we derive directly from the ambitwistor string action on a coset manifold. As a testing ground for this formalism we focus on the simplest case of ambitwistor string coupled to two cur- rent algebras, which gives bi-adjoint scalar correlators in AdS. In order to evaluate them directly, we make use of a series of contour deformations on the moduli space of punctured Riemann spheres and check that the result agrees with tree level Witten diagram computations to all multiplicity. We also initiate the study of eigenfunctions of scattering equations in AdS, which interpolate between conformal partial waves in different OPE channels, and point out a connection to an elliptic deformation of the Calogero-Sutherland model.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2021

Discriminating Quantum States with Quantum Machine Learning

Quantum machine learning (QML) algorithms have obtained great relevance in the machine learning (ML) field due to the promise of quantum speedups when performing basic linear algebra subroutines (BLAS), a fundamental element in most ML algorithms. By making use of BLAS operations, we propose, implement and analyze a quantum k-means (qk-means) algorithm with a low time complexity of O(NKlog(D)I/C) to apply it to the fundamental problem of discriminating quantum states at readout. Discriminating quantum states allows the identification of quantum states |0⟩ and |1⟩ from low-level in-phase and quadrature signal (IQ) data, and can be done using custom ML models. In order to reduce dependency on a classical computer, we use the qk-means to perform state discrimination on the IBMQ Bogota device and managed to find assignment fidelities of up to 98.7% that were only marginally lower than that of the k-means algorithm. We also performed a cross-talk benchmark on the quantum device by applying both algorithms to perform state discrimination on a combination of quantum states and using Pearson Correlation coefficients and assignment fidelities of discrimination results to conclude on the presence of cross-talk on qubits. Evidence shows cross-talk in the (1, 2) and (2, 3) neighboring qubit couples for the analyzed device.

Quiroga, David↗
NASA NTRS1996

Towards and FVE-FAC Method for Determining Thermocapillary Effects on Weld Pool Shape

Several practical materials processes, e.g., welding, float-zone purification, and Czochralski crystal growth, involve a pool of molten metal with a free surface, with strong temperature gradients along the surface. In some cases, the resulting thermocapillary flow is vigorous enough to convect heat toward the edges of the pool, increasing the driving force in a sort of positive feedback. In this work we examine this mechanism and its effect on the solid-liquid interface through a model problem: a half space of pure substance with concentrated axisymmetric surface heating, where surface tension is strong enough to keep the liquid free surface flat. The numerical method proposed for this problem utilizes a finite volume element (FVE) discretization in cylindrical coordinates. Because of the axisymmetric nature of the model problem, the control volumes used are torroidal prisms, formed by taking a polygonal cross-section in the (r, z) plane and sweeping it completely around the z-axis. Conservation of energy (in the solid), and conservation of energy, momentum, and mass (in the liquid) are enforced globally by integrating these quantities and enforcing conservation over each control volume. Judicious application of the Divergence Theorem and Stokes' Theorem, combined with a Crank-Nicolson time-stepping scheme leads to an implicit algebraic system to be solved at each time step. It is known that near the boundary of the pool, that is, near the solid-liquid interface, the full conduction-convection solution will require extremely fine length scales to resolve the physical behavior of the system. Furthermore, this boundary moves as a function of time. Accordingly, we develop the foundation of an adaptive refinement scheme based on the principles of Fast Adaptive Composite Grid methods (FAC). Implementation of the method and numerical results will appear in a later report.

Canright, David↗
NASA NTRS2017

Color Algebras

A color algebra refers to a system for computing sums and products of colors, analogous to additive and subtractive color mixtures. We would like it to match the well-defined algebra of spectral functions describing lights and surface reflectances, but an exact correspondence is impossible after the spectra have been projected to a three-dimensional color space, because of metamerism physically different spectra can produce the same color sensation. Metameric spectra are interchangeable for the purposes of addition, but not multiplication, so any color algebra is necessarily an approximation to physical reality. Nevertheless, because the majority of naturally-occurring spectra are well-behaved (e.g., continuous and slowly-varying), color algebras can be formulated that are largely accurate and agree well with human intuition. Here we explore the family of algebras that result from associating each color with a member of a three-dimensional manifold of spectra. This association can be used to construct a color product, defined as the color of the spectrum of the wavelength-wise product of the spectra associated with the two input colors. The choice of the spectral manifold determines the behavior of the resulting system, and certain special subspaces allow computational efficiencies. The resulting systems can be used to improve computer graphic rendering techniques, and to model various perceptual phenomena such as color constancy.

color constancy↗
DOE OSTI2023

In-depth analysis on parallel processing patterns for high-performance Dataframes

The Data Science domain has expanded monumentally in both research and industry communities during the past decade, predominantly owing to the Big Data revolution. Artificial Intelligence (AI) and Machine Learning (ML) are bringing more complexities to data engineering applications, which are now integrated into data processing pipelines to process terabytes of data. Typically, a significant amount of time is spent on data preprocessing in these pipelines, and hence improving its efficiency directly impacts the overall pipeline performance. The community has recently embraced the concept of Dataframes as the de-facto data structure for data representation and manipulation. However, the most widely used serial Dataframes today (R, pandas) experience performance limitations while working on even moderately large data sets. We believe that there is plenty of room for improvement by taking a look at this problem from a high-performance computing point of view. In a prior publication, we presented a set of parallel processing patterns for distributed dataframe operators and the reference runtime implementation, Cylon. In this paper, we are expanding on the initial concept by introducing a cost model for evaluating the said patterns. Furthermore, we evaluate the performance of Cylon on the ORNL Summit supercomputer.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Entanglement entropy of a color flux tube in (2+1)D Yang-Mills theory

We construct a novel flux tube entanglement entropy (FTE 2 ), defined as the excess entanglement entropy relative to the vacuum of a region of color flux stretching between a heavy quark-anti-quark pair in pure gauge Yang-Mills theory. We show that FTE 2 can be expressed in terms of correlators of Polyakov loops, is manifestly gauge-invariant, and therefore free of the ambiguities in computations of the entanglement entropy in gauge theories related to the choice of the center algebra. Employing the replica trick, we compute FTE 2 for SU(2) Yang-Mills theory in (2+1)D and demonstrate that it is finite in the continuum limit. We explore the properties of FTE 2 for a half-slab geometry, which allows us to vary the width and location of the slab, and the extent to which the slab cross-cuts the color flux tube. Following the intuition provided by computations of FTE 2 in (1+1)D, and in a thin string model, we examine the extent to which our FTE 2 results can be interpreted as the sum of an internal color entropy and a vibrational entropy corresponding to the transverse excitations of the string.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
NASA NTRS1990

Recursive dynamics for flexible multibody systems using spatial operators

Due to their structural flexibility, spacecraft and space manipulators are multibody systems with complex dynamics and possess a large number of degrees of freedom. Here the spatial operator algebra methodology is used to develop a new dynamics formulation and spatially recursive algorithms for such flexible multibody systems. A key feature of the formulation is that the operator description of the flexible system dynamics is identical in form to the corresponding operator description of the dynamics of rigid multibody systems. A significant advantage of this unifying approach is that it allows ideas and techniques for rigid multibody systems to be easily applied to flexible multibody systems. The algorithms use standard finite-element and assumed modes models for the individual body deformation. A Newton-Euler Operator Factorization of the mass matrix of the multibody system is first developed. It forms the basis for recursive algorithms such as for the inverse dynamics, the computation of the mass matrix, and the composite body forward dynamics for the system. Subsequently, an alternative Innovations Operator Factorization of the mass matrix, each of whose factors is invertible, is developed. It leads to an operator expression for the inverse of the mass matrix, and forms the basis for the recursive articulated body forward dynamics algorithm for the flexible multibody system. For simplicity, most of the development here focuses on serial chain multibody systems. However, extensions of the algorithms to general topology flexible multibody systems are described. While the computational cost of the algorithms depends on factors such as the topology and the amount of flexibility in the multibody system, in general, it appears that in contrast to the rigid multibody case, the articulated body forward dynamics algorithm is the more efficient algorithm for flexible multibody systems containing even a small number of flexible bodies. The variety of algorithms described here permits a user to choose the algorithm which is optimal for the multibody system at hand. The availability of a number of algorithms is even more important for real-time applications, where implementation on parallel processors or custom computing hardware is often necessary to maximize speed.

Jain, A.↗
DOE OSTI2020

A low-rank solver for the stochastic unsteady Navier–Stokes problem

Here we study a low-rank iterative solver for the unsteady Navier–Stokes equations for incompressible flows with a stochastic viscosity. The equations are discretized using the stochastic Galerkin method, and we consider an all-at-once formulation where the algebraic systems at all the time steps are collected and solved simultaneously. The problem is linearized with Picard’s method. To efficiently solve the linear systems at each step, we use low-rank tensor representations within the Krylov subspace method, which leads to significant reductions in storage requirements and computational costs. Combined with effective mean-based preconditioners and the idea of inexact solve, we show that only a small number of linear iterations are needed at each Picard step. The proposed algorithm is tested with a model of flow in a two-dimensional symmetric step domain with different settings to demonstrate the computational efficiency.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Seniority eigenstate configuration interaction

Zero-seniority methods have shown great promise for the description of strongly correlated electronic systems. Other seniority sectors have been much less explored, and in particular, the maximal seniority sector and zero seniority have the same underlying algebraic structure. We introduce a seniority eigenstate configuration interaction in which the wave function is constrained to have good fixed local seniority for each paired orbital, by which we mean we partition orbitals into a pairing set with seniority zero, and a spin set with seniority one. Here, we show how to build the effective Hamiltonian for this ansatz, and demonstrate that high-seniority wave functions have unexpectedly excellent accuracy for strongly correlated fermionic systems, with accuracy competitive with or better than seniority zero for the Hubbard model and for the dissociation of the nitrogen molecule.

74 ATOMIC AND MOLECULAR PHYSICS↗
NASA NTRS1984

Theoretical analysis of aircraft afterbody flow

The strongly interactive flow field about aircraft afterbodies is investigated using computational techniques by which the thin-shear-layer formulation of the compressible, Reynolds-averaged Navier-Stokes equations is solved. A time-dependent implicit numerical algorithm is used to obtain solutions for a variety of afterbody and nozzle geometries, within the class of bodies of revolution, for both subsonic and supersonic external flow, and for sonic and supersonic underexpanded jets. Only centered nozzles with either a sharp lip or a blunt base are considered. In all cases, computed results are compared with experimental data taken at flight Reynolds numbers for like-flow conditions. Turbulence closure is realized using algebraic eddy-viscosity concepts. A new and unique adaptive-grid technique is used to resolve flow regimes with large gradients and to improve the accuracy and efficiency of the computational scheme. Special singular point boundary conditions are used for similar purposes, and are especially effective for highly under-expanded jets. For all cases considered, except one with a very large base-to-nozzle-exit-diameter ratio, the agreement with experimental measurements is excellent. For geometries with large base regions, enhancements in the turbulence transport model are necessary to support improvements in the flow-field simulation.

Deiwert, G. S.↗
DOE OSTI2021

The magnetic structure of long-wavelength magnetohydrodynamic modes in current-carrying stellarator plasmas

Magnetic field fluctuations are observed in current-carrying stellarator plasmas when the rotational transform is close to a rational value at the edge of the plasma. At low plasma pressure, these fluctuations are associated with perturbed currents parallel to the equilibrium magnetic field lines. A model for these magnetohydrodynamic modes in a low-β, three-dimensional stellarator equilibria has been developed. A set of helical current filaments are constrained to mimic the structure of magnetic field lines on rational surfaces derived from three-dimensional (3D) equilibrium reconstructions. Transformation to straight field line coordinates then allows fitting of the poloidal magnetic sensor data to a single harmonic function, which fixes the modeled toroidal mode structure via the field line flow geometry. The developed procedure accurately captures phase and amplitude variation for m/n = 3/2, 3/1, and 4/1 modes in the 3D equilibria of the compact toroidal hybrid experiment.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗