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 181 records · Page 10

Algebraic Bethe Circuits

The Algebraic Bethe Ansatz (ABA) is a highly successful analytical method used to exactly solve several physical models in both statistical mechanics and condensed-matter physics. Here we bring the ABA into unitary form, for its direct implementation on a quantum computer. This is achieved by distilling the non-unitary R matrices that make up the ABA into unitaries using the QR decomposition. Our algorithm is deterministic and works for both real and complex roots of the Bethe equations. We illustrate our method on the spin-$\frac{1}{2}$ XX and XXZ models. We show that using this approach one can efficiently prepare eigenstates of the XX model on a quantum computer with quantum resources that match previous state-of-the-art approaches. We run small-scale error mitigated implementations on the IBM quantum computers, including the preparation of the ground state for the XX and XXZ models on 4 sites. Finally, we derive a new form of the Yang-Baxter equation using unitary matrices, and also verify it on a quantum computer.

97 MATHEMATICS AND COMPUTING↗

Integrable deformation of $\mathbb{C}$P n and generalised Kähler geometry

We build on the results of [1] for generalised frame fields on generalised quotient spaces and study integrable deformations for CP n . In particular we show how, when the target space of the Principal Chiral Model is a complex projective space, a two-parameter deformation can be introduced in principle. The second parameter can however be removed via a diffeomorphism, which we construct explicitly, in accordance with the results stemming from a thorough integrability analysis we carry out. We also elucidate how the deformed target space can be seen as an instance of generalised Kähler, or equivalently bi-Hermitian, geometry. In this respect, we find the generic form of the pure spinors for CP n and the explicit expression for the generalised Kähler potential for n = 1, 2.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Factorization of Binary Matrices: Rank Relations, Uniqueness and Model Selection of Boolean Decomposition

The application of binary matrices are numerous. Representing a matrix as a mixture of a small collection of latent vectors via low-rank decomposition is often seen as an advantageous method to interpret and analyze data. In this work, we examine the factorizations of binary matrices using standard arithmetic (real and nonnegative) and logical operations (Boolean and $\mathbb{Z}$ 2 ). We examine the relationships between the different ranks, and discuss when factorization is unique. In particular, we characterize when a Boolean factorization X = W$\land$H has a unique W, a unique H (for a fixed W), and when both W and H are unique, given a rank constraint. We introduce a method for robust Boolean model selection, called BMFk, and show on numerical examples that BMFk not only accurately determines the correct number of Boolean latent features but reconstruct the pre-determined factors accurately.

97 MATHEMATICS AND COMPUTING↗

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↗

A symbolic framework to obtain mid-fidelity models of flexible multibody systems with application to horizontal-axis wind turbines

Abstract. The article presents a symbolic framework (also called computer algebra program) that is used to obtain, in symbolic mathematical form, the linear and nonlinear equations of motion of a mid-fidelity multibody system including rigid and flexible bodies. Our approach is based on Kane's method and a nonlinear shape function representation for flexible bodies. The shape function approach does not represent the state of the art for flexible multibody dynamics but is an effective trade-off to obtain mid-fidelity models with few degrees of freedom, taking advantage of the separation of space and time. The method yields compact symbolic equations of motion with implicit account of the constraints. The general and automatic framework facilitates the creation and manipulation of models with various levels of complexity by adding or removing degrees of freedom. The symbolic treatment allows for analytical gradients and linearized equations of motion. The linear and nonlinear equations can be exported to Python code or dedicated software. There are multiple applications, such as time domain simulation, stability analyses, frequency domain analyses, advanced controller design, state observers, and digital twins. In this article, we describe the method we used to systematically generate the equations of motion of multibody systems and present the implementation of the framework using the Python package SymPy. We apply the framework to generate illustrative land-based and offshore wind turbine models. We compare our results with OpenFAST simulations and discuss the advantages and limitations of the method. The Python implementation is provided as an open-source project.

Branlard, Emmanuel (ORCID:0000000277506128)↗

Evaluation of data driven low-rank matrix factorization for accelerated solutions of the Vlasov equation

Low-rank methods have shown success in accelerating simulations of a collisionless plasma described by the Vlasov equation, but still rely on computationally costly linear algebra every time step. We propose a data-driven factorization method using artificial neural networks, specifically with convolutional layer architecture, that trains on existing simulation data. At inference time, the model outputs a low-rank decomposition of the distribution field of the charged particles, and we demonstrate that this step is faster than the standard linear algebra technique. Numerical experiments show that the method achieves comparable reconstruction accuracy for interpolation tasks, generalizing to unseen test data in a manner beyond just memorizing training data; patterns in factorization also inherently followed the same numerical trend as those within algebraic methods (e.g., truncated singular-value decomposition). However, when training on the first 70% of a time-series data and testing on the remaining 30%, the method fails to meaningfully extrapolate. Despite this limiting result, the technique may have benefits for simulations in a statistical steady-state or otherwise showing temporal stability. These results suggest that while the model offers a computationally efficient alternative for datasets with temporal stability, its current formulation is best suited for interpolation rather than for predicting future states in time-evolving systems. This study thus lays the groundwork for further refinement of neural network-based approaches to low-rank matrix factorization in high-dimensional plasma simulations.

97 MATHEMATICS AND COMPUTING↗

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↗

Uranium hydride corrosion. I New insights into the Condon-Kirkpatrick model of uranium hydride formation rate

An analytic solution to the uranium hydride formation rate equation of Condon and Kirkpatrick (CK) has been developed, which is directly solved via algebraic operations and requires only gaseous hydrogen (H 2 ) pressure and temperature as inputs. The solution does not depend on the specific functional forms of the hydriding and dehydriding rate constants, nor of key physical parameters. Furthermore, a modified form of the CK model has also been developed, where replacement of the hydrogen solubility function results in an improved fit to published experimental data as H 2 pressure decreases toward the corrosion threshold value.

36 MATERIALS SCIENCE↗

Using computational singular perturbation as a diagnostic tool in ODE and DAE systems: a case study in heterogeneous catalysis

We have extended the computational singular perturbation (CSP) method to differential algebraic equation (DAE) systems and demonstrated its application in a heterogeneous-catalysis problem. The extended method obtains the CSP basis vectors for DAEs from a reduced Jacobian matrix that takes the algebraic constraints into account. Here we use a canonical problem in heterogeneous catalysis, the transient continuous stirred tank reactor (T-CSTR), for illustration. The T-CSTR problem is modelled fundamentally as an ordinary differential equation (ODE) system, but it can be transformed to a DAE system if one approximates typically fast surface processes using algebraic constraints for the surface species. We demonstrate the application of CSP analysis for both ODE and DAE constructions of a T-CSTR problem, illustrating the dynamical response of the system in each case. We also highlight the utility of the analysis in commenting on the quality of any particular DAE approximation built using the quasi-steady state approximation (QSSA), relative to the ODE reference case.

97 MATHEMATICS AND COMPUTING↗

The five-point bootstrap

We study five-point correlation functions of scalar operators in d-dimensional conformal field theories. We develop a new approach to computing the five-point conformal blocks for exchanged primary operators of arbitrary spin by introducing a generalization of radial coordinates, using an appropriate ansatz, and perturbatively solving two quadratic Casimir differential equations. We then study five-point correlators 〈σσϵσσ〉 in the critical 3d Ising model. We truncate the operator product expansions (OPEs) in the correlator by including a finite number of primary operators with conformal dimension below a cutoff ∆ ⩽ ∆ cutoff . We then compute several OPE coefficients involving ϵ and two spinning operators by demanding that the truncated correlator approximately satisfies the crossing relation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

One dimensional staggered bosons, clock models, and their noninvertible symmetries

We study systems of staggered boson Hamiltonians in a one dimensional lattice and in particular how the translation symmetry by one unit in these systems is in reality a noninvertible symmetry closely related to T-duality. We also study the simplest systems of clock models derived from these staggered boson Hamiltonians. We show that the noninvertible symmetries of these lattice models together with the discrete Z N symmetry predict that these are critical points with a U ( 1 ) current algebra at c = 1 and radius 2 N whenever N > 4 . We also present an independent computation of this value that arises directly from the staggered boson variables and does not use these additional symmetries. We also present a theoretical estimate of the values of critical coupling constants away from the self-dual symmetry point in these clock models. Published by the American Physical Society 2024

Astronomy & Astrophysics↗

Sampling-based Sublinear Low-rank Matrix Arithmetic Framework for Dequantizing Quantum Machine Learning

We present an algorithmic framework for quantum-inspired classical algorithms on close-to-low-rank matrices, generalizing the series of results started by Tang’s breakthrough quantum-inspired algorithm for recommendation systems [STOC’19]. Motivated by quantum linear algebra algorithms and the quantum singular value transformation (SVT) framework of Gilyén et al. [STOC’19], we develop classical algorithms for SVT that run in time independent of input dimension, under suitable quantum-inspired sampling assumptions. Our results give compelling evidence that in the corresponding QRAM data structure input model, quantum SVT does not yield exponential quantum speedups. Since the quantum SVT framework generalizes essentially all known techniques for quantum linear algebra, our results, combined with sampling lemmas from previous work, suffice to generalize all prior results about dequantizing quantum machine learning algorithms. In particular, our classical SVT framework recovers and often improves the dequantization results on recommendation systems, principal component analysis, supervised clustering, support vector machines, low-rank regression, and semidefinite program solving. We also give additional dequantization results on low-rank Hamiltonian simulation and discriminant analysis. Our improvements come from identifying the key feature of the quantum-inspired input model that is at the core of all prior quantum-inspired results: ℓ 2 -norm sampling can approximate matrix products in time independent of their dimension. We reduce all our main results to this fact, making our exposition concise, self-contained, and intuitive.

Computer Science↗

Learning physics-based reduced-order models from data using nonlinear manifolds

Here we present a novel method for learning reduced-order models of dynamical systems using nonlinear manifolds. First, we learn the manifold by identifying nonlinear structure in the data through a general representation learning problem. The proposed approach is driven by embeddings of low-order polynomial form. A projection onto the nonlinear manifold reveals the algebraic structure of the reduced-space system that governs the problem of interest. The matrix operators of the reduced-order model are then inferred from the data using operator inference. Numerical experiments on a number of nonlinear problems demonstrate the generalizability of the methodology and the increase in accuracy that can be obtained over reduced-order modeling methods that employ a linear subspace approximation.

97 MATHEMATICS AND COMPUTING↗

Novel superposed kinklike and pulselike solutions for several nonlocal nonlinear equations

In this work, we show that a number of nonlocal nonlinear equations, including the Ablowitz–Musslimani and Yang variant of the nonlocal nonlinear Schrödinger (NLS) equation, the nonlocal modified Korteweg de Vries (mKdV) equation, and the nonlocal Hirota equation, admit novel kinklike and pulselike superposed periodic solutions. Furthermore, we show that the nonlocal mKdV equation also admits the superposed (hyperbolic) kink–antikink solution. In addition, we show that while the nonlocal Ablowitz–Musslimani variant of the NLS admits complex parity-time reversal-invariant kink and pulse solutions, neither the local NLS nor the Yang variant of the nonlocal NLS admits such solutions. Finally, except for the Yang variant of the nonlocal NLS, we show that the other three nonlocal equations admit both the kink and pulse solutions in the same model.

97 MATHEMATICS AND COMPUTING↗

Lie-algebraic classical simulations for quantum computing

The classical simulation of quantum dynamics plays an important role in our understanding of quantum complexity and in the development of quantum technologies. Efficient techniques such as those based on the Gottesman-Knill theorem for Clifford circuits, tensor networks for low entanglement-generating circuits, or Wick's theorem for fermionic Gaussian states have become central tools in quantum computing. In this work, we contribute to this body of knowledge by presenting a framework for classical simulations, dubbed “𝔤-sim”, which is based on the underlying Lie algebraic structure of the dynamical process. When the dimension of the algebra grows at most polynomially in the system size, there exist observables for which the simulation is efficient. Indeed, we show that 𝔤-sim enables new regimes for classical simulations, is able to deal with certain forms of noise in the evolution, as well as can be used to tackle several paradigmatic variational and nonvariational quantum computing tasks. For the former, we perform Lie-algebraic simulations to train and optimize parametrized quantum circuits (thus effectively showing that some variational models can be dequantized), design enhanced parameter initialization strategies, solve tasks of quantum circuit synthesis, and train a quantum-phase classifier. For the latter, we report large-scale noiseless and noisy simulations on benchmark problems. By comparing the limitations of 𝔤-sim and certain Wick's theorem-based simulations, we find that the two methods become inefficient for different types of states or observables, hinting at the existence of distinct, nonequivalent resources for classical simulation.

97 MATHEMATICS AND COMPUTING↗

A Lie algebraic theory of barren plateaus for deep parameterized quantum circuits

Variational quantum computing schemes train a loss function by sending an initial state through a parametrized quantum circuit, and measuring the expectation value of some operator. Despite their promise, the trainability of these algorithms is hindered by barren plateaus (BPs) induced by the expressiveness of the circuit, the entanglement of the input data, the locality of the observable, or the presence of noise. Up to this point, these sources of BPs have been regarded as independent. In this work, we present a general Lie algebraic theory that provides an exact expression for the variance of the loss function of sufficiently deep parametrized quantum circuits, even in the presence of certain noise models. Our results allow us to understand under one framework all aforementioned sources of BPs. This theoretical leap resolves a standing conjecture about a connection between loss concentration and the dimension of the Lie algebra of the circuit’s generators.

97 MATHEMATICS AND COMPUTING↗

Comments on the quantum field theory of the Coulomb gas formalism

The holomorphic Coulomb gas formalism, as developed by Feigin-Fuchs, Dotsenko-Fateev and Felder, is a set of rules for computing minimal model observables using free field techniques. We attempt to derive and clarify these rules using standard techniques of quantum field theory. We begin with a careful examination of the timelike linear dilaton. Although the background charge of the model breaks the scalar field’s continuous shift symmetry, the exponential of the action remains invariant under a discrete shift because the background charge is imaginary. Gauging this symmetry makes the dilaton compact and introduces winding modes into the spectrum. One of these winding operators corresponds to the anti-holomorphic completion of the BRST current first introduced by Felder, and the full left/right cohomology of this BRST charge isolates the irreducible representations of the Virasoro algebra within the degenerate Fock space of the linear dilaton. The “supertrace” in the BRST complex reproduces the minimal model partition function and exhibits delicate cancellations between states with both momentum and winding. The model at the radius $R=\sqrt{pp^{\prime }}$ has two marginal operators corresponding to the Dotsenko-Fateev “screening charges”. Deforming by them, we obtain a model that might be called a “BRST quotiented compact timelike Liouville theory”. The Hamiltonian of the zero-mode quantum mechanics of this model is not Hermitian, but it is PT -symmetric and exactly solvable. Its eigenfunctions have support on an infinite number of plane waves, suggesting an infinite reduction in the number of independent states in the full quantum field theory. Applying conformal perturbation theory to the exponential interactions reproduces the Coulomb gas calculations of minimal model correlation functions. In contrast to spacelike Liouville, these “resonance correlators” are finite because the zero mode is compact. We comment on subtleties regarding the reflection operator identification, as well as naive violations of truncation in correlators with multiple reflection operators inserted. This work is part of an attempt to understand the relationship between the JT model of two dimen- sional gravity and the worldsheet description of the (2 , p ) minimal string as suggested by Seiberg and Stanford.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

A gradient-based deep neural network model for simulating multiphase flow in porous media

We report simulation of multiphase flow in porous media is crucial for the effective management of subsurface energy and environment-related activities. The numerical simulators used for modeling such processes rely on spatial and temporal discretization of the governing mass and energy balance partial-differential equations (PDEs) into algebraic systems via finite-difference/volume/element methods. These simulators usually require dedicated software development and maintenance, and suffer low efficiency from a runtime and memory standpoint for problems with multi-scale heterogeneity, coupled-physics processes or fluids with complex phase behavior. Therefore, developing cost-effective, data-driven models can become a practical choice, and in this work, we choose deep learning approaches as they can handle high dimensional data and accurately predict state variables with strong nonlinearity. In this paper, we describe a gradient-based deep neural network (GDNN) constrained by the physics related to multiphase flow in porous media. We tackle the nonlinearity of flow in porous media induced by rock heterogeneity, fluid properties, and fluid-rock interactions by decomposing the nonlinear PDEs into a dictionary of elementary differential operators. We use a combination of operators to handle rock spatial heterogeneity and fluid flow by advection. Since the augmented differential operators are inherently related to the physics of fluid flow, we treat them as first principles prior knowledge to regularize the GDNN training. We use the example of pressure management at geologic CO 2 storage sites, where CO 2 is injected in saline aquifers and brine is produced, and apply GDNN to construct a predictive model that is trained with physics-based simulation data and emulates the physics process. We demonstrate that GDNN can effectively predict the nonlinear patterns of subsurface responses, including the temporal and spatial evolution of the pressure and saturation plumes. We also successfully extend the GDNN to convolutional neural network (CNN), namely gradient-based CNN (GCNN), and validate its capability to improve the prediction accuracy. GDNN has great potential to tackle challenging problems that are governed by highly nonlinear physics and enable the development of data-driven models with higher fidelity.

42 ENGINEERING↗