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.

SourceResearch connectionFrom yearThrough year

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

At least 271 records · Page 15

All sources NASA NTRS DOE OSTI

DOE OSTI2021

Optimal renormalization of multiscale systems

While model order reduction is a promising approach in dealing with multi-scale time-dependent systems that are too large or too expensive to simulate for long times, the resulting reduced order models can suffer from instabilities. We have recently developed a time-dependent renormalization approach to stabilize such reduced models. In the current work, we extend this framework by introducing a parameter that controls the time-decay of the memory of such models and optimally selecting this parameter based on limited fully resolved simulations. First, we demonstrate our framework on the inviscid Burgers equation whose solution develops a finite-time singularity. Our renormalized reduced order models are stable and accurate for long times while using for their calibration only data from a full order simulation before the occurrence of the singularity. Furthermore, we apply this framework to the 3D Euler equations of incompressible fluid flow, where the problem of finite-time singularity formation is still open and where brute force simulation is only feasible for short times. Our approach allows us to obtain for the first time a perturbatively renormalizable model which is stable for long times and includes all the complex effects present in the 3D Euler dynamics. We find that, in each application, the renormalization coefficients display algebraic decay with increasing resolution, and that the parameter which controls the time-decay of the memory is problem-dependent.

Price, Jacob↗

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 OSTI2020

SO(3)-invariance of informed-graph-based deep neural network for anisotropic elastoplastic materials

This work examines the frame-invariance (and the lack thereof) exhibited in simulated anisotropic elasto-plastic responses generated from supervised machine learning of classical multi-layer and informed-graph-based neural networks, and proposes different remedies to fix this drawback. The inherent hierarchical relations among physical quantities and state variables in an elasto-plasticity model are first represented as informed, directed graphs, where three variations of the graph are tested. While feed-forward neural networks are used to train path-independent constitutive relations (e.g., elasticity), recurrent neural networks are used to replicate responses that depends on the deformation history, i.e. or path dependent. In dealing with the objectivity deficiency, we use the spectral form to represent tensors and, subsequently, three metrics, the Euclidean distance between the Euler Angles, the distance from the identity matrix, and geodesic on the unit sphere in Lie algebra, can be employed to constitute objective functions for the supervised machine learning. In this, the aim is to minimize the measured distance between the true and the predicted 3D rotation entities. Following this, we conduct numerical experiments on how these metrics, which are theoretically equivalent, may lead to differences in the efficiency of the supervised machine learning as well as the accuracy and robustness of the resultant models. Neural network models trained with tensors represented in component form for a given Cartesian coordinate system are used as a benchmark. Our numerical tests show that, even given the same amount of information and data, the quality of the anisotropic elasto-plasticity model is highly sensitive to the way tensors are represented and measured. The results reveal that using a loss function based on geodesic on the unit sphere in Lie algebra together with an informed, directed graph yield significantly more accurate rotation prediction than the other tested approaches.

42 ENGINEERING↗

DOE OSTI2023

Burns space and holography

We elaborate on various aspects of our top-down celestial holographic duality wherein the semiclassical bulk spacetime is a 4d asymptotically flat, self-dual Kähler geometry known as Burns space. The bulk theory includes an open string sector comprising a 4d WZW model and a closed string sector called “Mabuchi gravity” capturing fluctuations of the Kähler potential. Starting with the type I topological B-model on the twistor space of flat space, we obtain the twistor space of Burns space from the backreaction of a stack of N coincident D1 branes, while the chiral algebra is obtained from (a twist of) the brane worldvolume theory. One striking consequence of this duality is that all loop-level scattering amplitudes of the theory on Burns space can be expressed as correlation functions of an explicit 2d chiral algebra.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2023

Inexact iterative numerical linear algebra for neural network-based spectral estimation and rare-event prediction

Understanding dynamics in complex systems is challenging because there are many degrees of freedom, and those that are most important for describing events of interest are often not obvious. The leading eigenfunctions of the transition operator are useful for visualization, and they can provide an efficient basis for computing statistics, such as the likelihood and average time of events (predictions). Here, we develop inexact iterative linear algebra methods for computing these eigenfunctions (spectral estimation) and making predictions from a dataset of short trajectories sampled at finite intervals. We demonstrate the methods on a low-dimensional model that facilitates visualization and a high-dimensional model of a biomolecular system. Implications for the prediction problem in reinforcement learning are discussed.

Chemistry↗

DOE OSTI2020

Accelerating Scientific Computing in the Post-Moore’s Era

Novel uses of graphical processing units for accelerated computation revolutionized the field of high-performance scientific computing by providing specialized workflows tailored to algorithmic requirements. As the era of Moore’s law draws to a close, many new non–von Neumann processors are emerging as potential computational accelerators, including those based on the principles of neuromorphic computing, tensor algebra, and quantum information. While development of these new processors is continuing to mature, the potential impact on accelerated computing is anticipated to be profound. We discuss how different processing models can advance computing in key scientific paradigms: machine learning and constraint satisfaction. Significantly, each of these new processor types utilizes a fundamentally different model of computation, and this raises questions about how to best use such processors in the design and implementation of applications. While many processors are being developed with a specific domain target, the ubiquity of spin-glass models and neural networks provides an avenue for multi-functional applications. Furthermore, this also hints at the infrastructure needed to integrate next-generation processing units into future high-performance computing systems.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2020

A new form of the Saint-Venant equations for variable topography

The solution stability of river models using the one-dimensional (1D) Saint-Venant equations can be easily undermined when source terms in the discrete equations do not satisfy the Lipschitz smoothness condition for partial differential equations. Although instability issues have been previously noted, they are typically treated as model implementation issues rather than as underlying problems associated with the form of the governing equations. This study proposes a new reference slope form of the Saint-Venant equations to ensure smooth slope source terms and eliminate one source of potential numerical oscillations. It is shown that a simple algebraic transformation of channel geometry provides a smooth reference slope while preserving the correct cross-section flow area and the total Piezometric pressure gradient that drives the flow. The reference slope method ensures the slope source term in the governing equations is Lipschitz continuous while maintaining all the underlying complexity of the real-world geometry. The validity of the mathematical concept is demonstrated with the open-source Simulation Program for River Networks (SPRNT) model in a series of artificial test cases and a simulation of a small urban creek. Validation comparisons are made with analytical solutions and the Hydrologic Engineering Center's River Analysis System (HEC-RAS) model. The new method reduces numerical oscillations and instabilities without requiring ad hoc smoothing algorithms.

54 ENVIRONMENTAL SCIENCES↗

DOE OSTI2024

Emergent Superconductivity and Competing Charge Orders in Hole-Doped Square-Lattice t – J Model

The square-lattice Hubbard and closely related t-J models are considered as basic paradigms for understanding strong correlation effects and unconventional superconductivity (SC). Recent large-scale density matrix renormalization group simulations on the extended t-J model have identified d-wave SC on the electron-doped side (with the next-nearest-neighbor hopping t 2 > 0) but a dominant charge density wave (CDW) order on the hole-doped side (t 2 < 0), which is inconsistent with the SC of hole-doped cuprate compounds. We re-examine the ground-state phase diagram of the extended t-J model by employing the state-of-the-art density matrix renormalization group calculations with much enhanced bond dimensions, allowing more accurate determination of the ground state. On six-leg cylinders, while different CDW phases are identified on the hole-doped side for the doping range δ = 1/16 – 1/8, a SC phase emerges at a lower doping regime, with algebraically decaying pairing correlations and d-wave symmetry. On the wider eight-leg systems, the d-wave SC also emerges on the hole-doped side at the optimal 1=8 doping, demonstrating the winning of SC over CDW by increasing the system width. Furthermore, our results not only suggest a new path to SC in general t-J model through weakening the competing charge orders, but also provide a unified understanding on the SC of both hole- and electron-doped cuprate superconductors.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

DOE OSTI2020

Quantum scars of bosons with correlated hopping

Abstract Recent experiments on Rydberg atom arrays have found evidence of anomalously slow thermalization and persistent density oscillations, which have been interpreted as a many-body analog of the phenomenon of quantum scars. Periodic dynamics and atypical scarred eigenstates originate from a “hard” kinetic constraint: the neighboring Rydberg atoms cannot be simultaneously excited. Here we propose a realization of quantum many-body scars in a 1D bosonic lattice model with a “soft” constraint in the form of density-assisted hopping. We discuss the relation of this model to the standard Bose-Hubbard model and possible experimental realizations using ultracold atoms. We find that this model exhibits similar phenomenology to the Rydberg atom chain, including weakly entangled eigenstates at high energy densities and the presence of a large number of exact zero energy states, with distinct algebraic structure.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2025

Almost strong zero modes at finite temperature

Interacting fermionic chains exhibit extended regions of topological degeneracy of their ground states as a result of the presence of Majorana or parafermionic zero modes localized at the edges. In the opposite limit of infinite temperature, the corresponding nonintegrable spin chains, obtained via generalized Jordan-Wigner mapping, are known to host so-called almost strong zero modes, which are long-lived with respect to any bulk excitations. Here we study the fairly unexplored territory that bridges these two extreme cases of zero and infinite temperature. We blend two established techniques for states, the Lanczos series expansion and a tensor network ansatz, uplifting them to the level of operator algebra. This allows us to efficiently simulate large system sizes for arbitrarily long timescales and to extract the temperature-dependent decay rates. We observe that for the Kitaev-Hubbard model, the decay rate of the edge mode depends exponentially on the inverse temperature 𝛽, and on an effective energy scale Δ eff that is greater than the thermodynamic gap of the system Δ.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2026

ChatMPI: LLM-Driven MPI Code Generation for HPC Workloads

The Message Passing Interface (MPI) standard plays a crucial role in enabling scientific applications for parallel computing and is an essential component in high-performance computing (HPC). However, implementing MPI code manually—especially applying a proper domain decomposition and communication pattern—is a challenging and error-prone task. We present ChatMPI, an AI assistant for MPI parallelization of sequential C codes. In our analysis, we focus on testing six essential HPC workloads, which are based on Basic Linear Algebra Subprograms levels 1, 2, and 3 as well as sparse, stencil, and iterative operations. We analyze the process of creating ChatMPI by using the ChatHPC library. This lightweight large language model (LLM)–based infrastructure enables HPC experts to efficiently create and supervise trustworthy AI capabilities for critical HPC software tasks. We study the data required for training (fine-tuning) ChatMPI to generate parallel codes that not only use MPI syntax correctly but also apply HPC techniques to reduce memory communication and maximize performance by using proper work decomposition. With a relatively small training dataset composed of a few dozen prompts and fewer than 15 minutes of fine-tuning on one node equipped with two NVIDIA H100 GPUs, ChatMPI elevates trustworthiness for MPI code generation of current LLMs (e.g., Code Llama, ChatGPT-4o and ChatGPT 5). Additionally, we evaluate the performance of the MPI codes generated by ChatMPI in comparison with the ones generated by ChatGPT-4o and ChatGPT-5. The codes generated by ChatMPI provide up to a 4 × boost in performance by using better problem decomposition, communication patterns, and HPC techniques (e.g., communication avoiding).

Valero Lara, Pedro [ORNL] (ORCID:0000000214794310)↗

DOE OSTI2020

Demonstration and performance testing of extreme-resolution simulations with static meshes on Summit (CPU & GPU) for a parked-turbine configuration and an actuator-line (mid-fidelity model) wind farm configuration (ECP-Q4 FY2020 Milestone Report)

The goal of the ExaWind project is to enable predictive simulations of wind farms comprised of many megawatt-scale turbines situated in complex terrain. Predictive simulations will require computational fluid dynamics (CFD) simulations for which the mesh resolves the geometry of the turbines and captures the rotation and large deflections of blades. Whereas such simulations for a single turbine are arguably petascale class, multi-turbine wind farm simulations will require exascale-class resources. The primary physics codes in the ExaWind simulation environment are Nalu-Wind, an unstructured-grid solver for the acoustically incompressible Navier-Stokes equations, AMR-Wind, a block-structured-grid solver with adaptive mesh refinement capabilities, and OpenFAST, a wind-turbine structural dynamics solver. The Nalu-Wind model consists of the mass-continuity Poisson-type equation for pressure and Helmholtz-type equations for transport of momentum and other scalars. For such modeling approaches, simulation times are dominated by linear-system setup and solution for the continuity and momentum systems. For the ExaWind challenge problem, the moving meshes greatly affect overall solver costs as reinitialization of matrices and recomputation of preconditioners is required at every time step. The choice of overset-mesh methodology to model the moving and non-moving parts of the computational domain introduces constraint equations in the elliptic pressure-Poisson solver. The presence of constraints greatly affects the performance of algebraic multigrid preconditioners.

17 WIND ENERGY↗

DOE OSTI2020

Bounded motion design in the Earth zonal problem using differential algebra based normal form methods

Establishing long-term relative bounded motion between orbits in perturbed dynamics is a key challenge in astrodynamics to enable cluster flight with minimum propellant expenditure. Herein, we present an approach that allows for the design of long-term relative bounded motion considering a zonal gravitational model. Entire sets of orbits are obtained via high-order Taylor expansions of Poincarè return maps about reference fixed points. The high-order normal form algorithm is used to determine a change in expansion variables of the map into normal form space, in which the phase space behavior is circular and can be easily parameterized by action–angle coordinates. The action–angle representation of the normal form coordinates is then used to parameterize the original Poincarè return map and average it over a full phase space revolution by a path integral along the angle parameterization. As a result, the averaged nodal period and drift in the ascending node are obtained, for which the bounded motion conditions are straightforwardly imposed. Sets of highly accurate bounded orbits are obtained, extending over several thousand kilometers, and valid for decades.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2020

Auxiliary Space Preconditioning of Finite Element Equations Using a Nonconforming Interior Penalty Reformulation and Static Condensation

We modify the well-known interior penalty finite element discretization method so that it allows for element-by-element assembly. This is possible due to the introduction of additional unknowns associated with the interfaces between neighboring elements. The resulting bilinear form, and a Schur complement (reduced) version of it, are utilized in a number of auxiliary space preconditioners for the original conforming finite element discretization problem. Furthermore, these preconditioners are analyzed on the fine scale, and their performance is illustrated on model second order scalar elliptic problems discretized with high order elements.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2023

Experimental Observations of the Topology of Convolutional Neural Network Activations

Topological data analysis (TDA) is a branch of computational mathematics, bridging algebraic topology and data science, that provides compact, noise-robust representations of complex structures. Deep neural networks (DNNs) learn millions of parameters associated with a series of transformations defined by the model architecture resulting in high-dimensional, difficult to interpret internal representations of input data. As DNNs become more ubiquitous across multiple sectors of our society, there is increasing recognition that mathematical methods are needed to aid analysts, researchers, and practitioners in understanding and interpreting how these models' internal representations relate to the final classification. In this paper we apply cutting edge techniques from TDA with the goal of gaining insight towards interpretability of convolutional neural networks used for image classification. We use two common TDA approaches to explore several methods for modeling hidden layer activations as high-dimensional point clouds, and provide experimental evidence that these point clouds capture valuable structural information about the model's process. First, we demonstrate that a distance metric based on persistent homology can be used to quantify meaningful differences between layers and discuss these distances in the broader context of existing representational similarity metrics for neural network interpretability. Second, we show that a mapper graph can provide semantic insight as to how these models organize hierarchical class knowledge at each layer. These observations demonstrate that TDA is a useful tool to help deep learning practitioners unlock the hidden structures of their models.

topological data analysis, deep learning↗

DOE OSTI2026

Neuralized fermionic tensor networks for quantum many-body systems

In this work, we describe a class of neuralized fermionic tensor network states (NN-fTNSs) that introduce nonlinearity into fermionic tensor networks through configuration-dependent neural network transformations of the local tensors. The construction uses the fTNS algebra to implement a natural fermionic sign structure and is compatible with standard tensor network algorithms but gains enhanced expressivity through the neural network parametrization. Using the 1D and 2D Fermi-Hubbard models as benchmarks, we demonstrate that NN-fTNSs achieve order of magnitude improvements in the ground-state energy compared to pure fTNSs with the same bond dimension and can be systematically improved through both the tensor network bond dimension and the neural network parametrization. Compared to existing fermionic neural quantum states based on Slater determinants and Pfaffians, NN-fTNSs offer a physically motivated alternative fermionic structure. Furthermore, compared to such states, NN-fTNSs naturally exhibit improved computational scaling and we demonstrate a construction that achieves linear scaling with the lattice size.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

DOE OSTI2023

Heavy-Duty Vehicle Air Drag Coefficient Estimation: From an Algebraic Perspective

When a heavy-duty vehicle (HDV) operates at the nominal highway speed, over two-thirds of its total resistive force comes from the air drag, contributing to more than half of its fuel consumption. One effective countermeasure to reduce the fuel consumption of HDVs is platooning, which employs connectivity and automated driving technologies to link two or more HDVs in convoy. Platooning allows HDVs to drive closer together and yields improved fuel economy and less CO2 emission thanks to the reduced air drag. Maximizing the energy benefits of an HDV platoon requires quantifying the drag interaction between vehicles. In practice, modeling the drag reduction in a platoon boils down to identifying the relationship between the air drag coefficient C d and the inter-vehicle distance d. Existing approaches to identify C d (d) include vehicle field tests, wind tunnel experiments, and computational fluid dynamics simulation, which can howbeit be time-consuming and cost prohibitive. In contrast, this paper proposes an algebraic approach, which relies on onboard-measurable variables, to estimate the air drag coefficient of an HDV in a platoon. Its algebraic nature avoids the classical persistence of excitation condition for parameter identification and can yield the identified parameter almost instantaneously. Simulation results demonstrate its effectiveness and the improved estimation speed over a recursive least squares identifier.

Wang, Zejiang↗

DOE OSTI2021

Single-Molecule Kinetics of Styrene Hydrogenation on Silica-Supported Vanadium: The Role of Disorder for Single-Atom Catalysts

We report a theoretical approach for the study of supported atom catalysis is developed based on recent advances in the study of single-molecule kinetics. This view is particularly useful in exhibiting the role of disorder in single-atom and single-site catalysts on amorphous supports. The distribution of passage times (or waiting times) through a complex catalytic network originating from a set of coupled active sites is described by a probability distribution function (PDF), f(t), that reflects the local environment of the reaction center. An efficient algorithm is developed based on the linear algebra of the Markov transition matrix that produces f(t) or its moments. The kinetics of the hydrogenation reaction of styrene on an organovanadium(III) catalyst supported on amorphous silica is studied. A kinetic model consisting of three intertwined catalytic cycles emanating from three chemically distinct active sites is proposed to describe the chemistry. Density functional theory (DFT) calculations are employed to determine the free energy barriers of the reactions, which are used to construct the rate coefficient matrix. The disorder induced by the amorphous support material is divided into a low-dimensional short-range component reflecting the covalent structures near the reaction center and a weaker long-range component modeling the bulk randomness. The results are computed and analyzed for a wide range of concentration values and disorder scenarios. The unusual structure in the f(t) PDF is found to occur for certain cases that reveal the contribution of multiple catalytic pathways acting in concert.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗