Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “algebraic methods”

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 307 records · Page 17
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

Secondary battery management

A method of managing a battery system, the battery system including at least one battery cell, at least one sensor configured to measure at least one characteristic of the battery cell, and a battery management system including a microprocessor and a memory, the method comprising receiving by the battery management system, from the at least one sensor at least one measured characteristic of the battery cell at a first time and at least one measured characteristic of the battery cell at a second time. The battery management system estimating, at least one state of the battery cell by applying a physics-based battery model, the physics based battery model being based on differential algebraic equations; and regulating by the battery management system, at least one of charging or discharging of the battery cell based on the at least one estimated state.

25 ENERGY STORAGE↗
DOE OSTI2023

Anisotropic Melting of Frustrated Ising Antiferromagnets

Magnetic frustrations and dimensionality play an important role in determining the nature of the magnetic long-range order and how it melts at temperatures above the ordering transition T N . In this Letter, we use large-scale Monte Carlo simulations to study these phenomena in a class of frustrated Ising spin models in two spatial dimensions. Here we find that the melting of the magnetic long-range order into an isotropic gaslike paramagnet proceeds via an intermediate stage where the classical spins remain anisotropically correlated. This correlated paramagnet exists in a temperature range T N < T < T * , whose width increases as magnetic frustrations grow. This intermediate phase is typically characterized by short-range correlations; however, the two-dimensional nature of the model allows for an additional exotic feature—formation of an incommensurate liquidlike phase with algebraically decaying spin correlations. The two-stage melting of magnetic order is generic and pertinent to many frustrated quasi-2D magnets with large (essentially classical) spins.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2025

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↗
DOE OSTI2024

Strong Zero Modes in Integrable Quantum Circuits

It is a classic result that certain interacting integrable spin chains host robust edge modes known as strong zero modes (SZMs). In this Letter, we extend this result to the Floquet setting of local quantum circuits, focusing on a prototypical model providing an integrable Trotterization for the evolution of the XXZ Heisenberg spin chain. By exploiting the algebraic structures of integrability, we show that an exact SZM operator can be constructed for these integrable quantum circuits in certain regions of parameter space. Our construction, which recovers a well-known result by Paul Fendley in the continuous-time limit, relies on a set of commuting transfer matrices known from integrability, and allows us to easily prove important properties of the SZM, including normalizabilty. Our approach is different from previous methods and could be of independent interest even in the Hamiltonian setting. Furthermore, our predictions, which are corroborated by numerical simulations of infinite-temperature autocorrelation functions, are potentially interesting for implementations of the XXZ quantum circuit on available quantum platforms.

1-dimensional spin chains↗
DOE OSTI2024

Augmenting machine learning of Grad–Shafranov equilibrium reconstruction with Green's functions

This work presents a method for predicting plasma equilibria in tokamak fusion experiments and reactors. The approach involves representing the plasma current as a linear combination of basis functions using principal component analysis of plasma toroidal current densities (J t ) from the EFIT-AI equilibrium database. Then utilizing EFIT's Green's function tables, basis functions are created for the poloidal flux (ψ) and diagnostics generated from the toroidal current (J t ). Similar to the idea of a physics-informed neural network (NN), this physically enforces consistency between ψ, J t , and the synthetic diagnostics. First, the predictive capability of a least squares technique to minimize the error on the synthetic diagnostics is employed. The results show that the method achieves high accuracy in predicting ψ and moderate accuracy in predicting J t with median R 2 = 0.9993 and R 2 = 0.978, respectively. A comprehensive NN using a network architecture search is also employed to predict the coefficients of the basis functions. The NN demonstrates significantly better performance compared to the least squares method with median R 2 = 0.9997 and 0.9916 for J t and ψ, respectively. The robustness of the method is evaluated by handling missing or incorrect data through the least squares filling of missing data, which shows that the NN prediction remains strong even with a reduced number of diagnostics. Additionally, the method is tested on plasmas outside of the training range showing reasonable results.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2020

Diffusion Synthetic Acceleration for Heterogeneous Domains, Compatible with Voids

A standard approach to solving the S N transport equations is to use source iteration with diffusion synthetic acceleration (DSA). Although this approach is widely used and effective on many problems, there remain some practical issues with DSA preconditioning, particularly on highly heterogeneous domains. For large-scale parallel simulation, it is critical that both (a) preconditioned source iteration converges rapidly and (b) the action of the DSA preconditioner can be applied using fast, scalable solvers, such as algebraic multigrid (AMG). For heterogeneous domains, these two interests can be at odds. In particular, there exist DSA diffusion discretizations that can be solved rapidly using AMG, but they do not always yield robust/fast convergence of the larger source iteration. Conversely, there exist robust DSA discretizations where source iteration converges rapidly on difficult heterogeneous problems, but fast parallel solvers like AMG tend to struggle applying the action of such operators. Moreover, very few current methods for the solution of deterministic transport are compatible with voids. This paper develops a new heterogeneous DSA preconditioner based on only preconditioning the optically thick subdomains. The resulting method proves robust on a variety of heterogeneous transport problems, including a linearized hohlraum mesh related to inertial confinement fusion. Moreover, the action of the preconditioner is easily computed using O(1) AMG iterations, convergence of the transport iteration typically requires 2 to 5× fewer iterations than current state-of-the-art “full” DSA, and the proposed method is trivially compatible with voids. On the hohlraum problem, rapid convergence is obtained by preconditioning less than 3% of the mesh elements with five to ten AMG iterations.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2022

Machine-Learning Assisted Identification of Accurate Battery Lifetime Models with Uncertainty

Reduced-order battery lifetime models, which consist of algebraic expressions for various aging modes, are widely utilized for extrapolating degradation trends from accelerated aging tests to real-world aging scenarios. Identifying models with high accuracy and low uncertainty is crucial for ensuring that model extrapolations are believable, however, it is difficult to compose expressions that accurately predict multivariate data trends; a review of cycling degradation models from literature reveals a wide variety of functional relationships. Here, a machine-learning assisted model identification method is utilized to fit degradation in a stand-out LFP-Gr aging data set, with uncertainty quantified by bootstrap resampling. The model identified in this work results in approximately half the mean absolute error of a human expert model. Models are validated by converting to a state-equation form and comparing predictions against cells aging under varying loads. Parameter uncertainty is carried forward into an energy storage system simulation to estimate the impact of aging model uncertainty on system lifetime. The new model identification method used here reduces life-prediction uncertainty by more than a factor of three (86% ± 5% relative capacity at 10 years for human-expert model, 88.5% ± 1.5% for machine-learning assisted model), empowering more confident estimates of energy storage system lifetime.

25 ENERGY STORAGE↗
DOE OSTI2022

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↗
DOE OSTI2023

Loop-by-loop differential equations for dual (elliptic) Feynman integrals

We present a loop-by-loop method for computing the differential equations of Feynman integrals using the recently developed dual form formalism. We give explicit prescriptions for the loop-by-loop fibration of multi-loop dual forms. Then, we test our formalism on a simple, but non-trivial, example: the two-loop three-mass elliptic sunrise family of integrals. We obtain an ε-form differential equation within the correct function space in a sequence of relatively simple algebraic steps. In particular, none of these steps relies on the analysis of q-series. Then, we discuss interesting properties satisfied by our dual basis as well as its simple relation to the known ε-form basis of Feynman integrands. The underlying K3-geometry of the three-loop four-mass sunrise integral is also discussed. Finally, we speculate on how to construct a “good” loop-by-loop basis at three-loop.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2021

Learning an Algebriac Multrigrid Interpolation Operator Using a Modified GraphNet Architecture

This work, building on previous efforts, develops a suite of new graph neural network machine learning architectures that generate data-driven prolongators for use in Algebraic Multigrid (AMG). Algebraic Multigrid is a powerful and common technique for solving large, sparse linear systems. Its effectiveness is problem dependent and heavily depends on the choice of the prolongation operator, which interpolates the coarse mesh results onto a finer mesh. Previous work has used recent developments in graph neural networks to learn a prolongation operator from a given coefficient matrix. In this paper, we expand on previous work by exploring architectural enhancements of graph neural networks. A new method for generating a training set is developed which more closely aligns to the test set. Asymptotic error reduction factors are compared on a test suite of 3-dimensional Poisson problems with varying degrees of element stretching. Results show modest improvements in asymptotic error factor over both commonly chosen baselines and learning methods from previous work.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Dynamic mode decomposition with core sketch

With the increase in collected data volumes, either from experimental measurements or high fidelity simulations, there is an ever-growing need to develop computationally efficient tools to process, analyze, and interpret these datasets. Modal analysis techniques have gained great interest due to their ability to identify patterns in the data and extract valuable information about the system being considered. Dynamic mode decomposition (DMD) relies on elements of the Koopman approximation theory to compute a set of modes, each associated with a fixed oscillation frequency and a decay/growth rate. Extracting these details from large datasets can be computationally expensive due to the need to implement singular value decomposition of the input data matrix. Sketching algorithms have become popular in numerical linear algebra where statistical theoretic approaches are utilized to reduce the cost of major operations. A sketch of a matrix is another matrix, which is significantly smaller, but still sufficiently approximates the original system. We put forth an efficient DMD framework, SketchyDMD, based on a core sketching algorithm that captures information about the range and corange (their mutual relationship) of input data. The proposed sketching-based framework can accelerate various portions of the DMD routines, compared to classical methods that operate directly on the raw input data. We conduct numerical experiments using the spherical shallow water equations as a prototypical model in the context of geophysical flows. In conclusion, we show that the proposed SketchyDMD is superior to existing randomized DMD methods that are based on capturing only the range of the input data.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

A generalized Selberg zeta function for flat space cosmologies

Flat space cosmologies (FSCs) are time dependent solutions of three-dimensional (3D) gravity with a vanishing cosmological constant. They can be constructed from a discrete quotient of empty 3D flat spacetime and are also called shifted-boost orbifolds. Using this quotient structure, we build a new and generalized Selberg zeta function for FSCs, and show that it is directly related to the scalar 1-loop partition function. We then propose an extension of this formalism applicable to more general quotient manifolds $\mathcal{M}$/ℤ, based on representation theory of fields propagating on this background. Our prescription constitutes a novel and expedient method for calculating regularized 1-loop determinants, without resorting to the heat kernel. We compute quasinormal modes in the FSC using the zeroes of a Selberg zeta function, and match them to known results.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2021

Decomposition of Feynman integrals by multivariate intersection numbers

We present a detailed description of the recent idea for a direct decomposition of Feynman integrals onto a basis of master integrals by projections, as well as a direct derivation of the differential equations satisfied by the master integrals, employing multivariate intersection numbers. We discuss a recursive algorithm for the computation of multivariate intersection numbers, and provide three different approaches for a direct decomposition of Feynman integrals, which we dub the straight decomposition, the bottom-up decomposition, and the top-down decomposition. These algorithms exploit the unitarity structure of Feynman integrals by computing intersection numbers supported on cuts, in various orders, thus showing the synthesis of the intersection-theory concepts with unitarity-based methods and integrand decomposition. We perform explicit computations to exemplify all of these approaches applied to Feynman integrals, paving a way towards potential applications to generic multi-loop integrals.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2020

Phase identification using co‐association matrix ensemble clustering

Calibrating distribution system models to aid in the accuracy of simulations such as hosting capacity analysis is increasingly important in the pursuit of the goal of integrating more distributed energy resources. The recent availability of smart meter data is enabling the use of machine learning tools to automatically achieve model calibration tasks. This research focuses on applying machine learning to the phase identification task, using a co‐association matrix‐based, ensemble spectral clustering approach. The proposed method leverages voltage time series from smart meters and does not require existing or accurate phase labels. This work demonstrates the success of the proposed method on both synthetic and real data, surpassing the accuracy of other phase identification research.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2024

A new method for solving the linearized 1D Vlasov–Poisson system yielding a new class of solutions

We describe a new method for solving the linearized 1D Vlasov–Poisson system by using properties of Cauchy-type integrals. Our method remedies critical flaws of the two standard methods, reveals a previously unrecognized Gaussian-in-time-like decay, and can also account for an externally applied electric field. The Landau approximation involves deforming the Bromwich contour around the poles closest to the real axis due to the analytically continued dielectric function, finding the long-time behavior for a stable system: Landau damping. Jackson's generalization encircles all poles while sending the contour to infinity, assuming its contribution vanishes, which is not true in general. This gives incorrect solutions for physically reasonable configurations and can exhibit pathological behavior, of which we show examples. The van Kampen method expresses the solution for a stable equilibrium as a continuous superposition of waves, resulting in an opaque integral. Case's generalization includes unstable systems and predicts a decaying discrete mode for each growing discrete mode, an apparent contradiction to both the Jackson solution and ours. We show, without imposing additional constraints, that the decaying modes are never present in the time evolution due to an exact cancellation with part of the continuum. Our solution is free of integral expressions, is obtained using algebra and Laurent series expansions, does not rely on analytic continuations, and results in a correct asymptotically convergent form in the case of infinite sums. The analysis used can be readily applied in higher-dimensional, electromagnetic systems and also provides a new technique for evaluating certain inverse Laplace transforms.

Physics↗
DOE OSTI2020

A Scalable Multigrid Reduction Framework for Multiphase Poromechanics of Heterogeneous Media

Simulation of multiphase poromechanics involves solving a multiphysics problem in which multiphase flow and transport are tightly coupled with the porous medium deformation. To capture this dynamic interplay, fully implicit methods, also known as monolithic approaches, are usually preferred. The main bottleneck of a monolithic approach is that it requires solution of large linear systems that result from the discretization and linearization of the governing balance equations. Because such systems are nonsymmetric, indefinite, and highly ill-conditioned, preconditioning is critical for fast convergence. Recently, most efforts in designing efficient preconditioners for multiphase poromechanics have been dominated by physics-based strategies. Current state-of-the-art “black-box” solvers such as algebraic multigrid (AMG) are ineffective because they cannot effectively capture the strong coupling between the mechanics and the flow subproblems, as well as the coupling inherent in the multiphase flow and transport process. In this work, we develop an algebraic framework based on multigrid reduction (MGR) that is suited for tightly coupled systems of PDEs. Using this framework, the decoupling between the equations is done algebraically through defining appropriate interpolation and restriction operators. One can then employ existing solvers for each of the decoupled blocks or design a new solver based on knowledge of the physics. We demonstrate the applicability of our framework when used as a “black-box” solver for multiphase poromechanics. Here, we show that the framework is flexible to accommodate a wide range of scenarios, as well as efficient and scalable for large problems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Solving differential‐algebraic equations in power system dynamic analysis with quantum computing

Abstract Power system dynamics are generally modeled by high dimensional non‐linear differential‐algebraic equations (DAEs) given a large number of components forming the network. These DAEs' complexity can grow exponentially due to the increasing penetration of distributed energy resources, whereas their computation time becomes sensitive due to the increasing interconnection of the power grid with other energy systems. This paper demonstrates the use of quantum computing algorithms to solve DAEs for power system dynamic analysis. We leverage a symbolic programming framework to equivalently convert the power system's DAEs into ordinary differential equations (ODEs) using index reduction methods and then encode their data into qubits using amplitude encoding. The system non‐linearity is captured by Hamiltonian simulation with truncated Taylor expansion so that state variables can be updated by a quantum linear equation solver. Our results show that quantum computing can solve the power system's DAEs accurately with a computational complexity polynomial in the logarithm of the system dimension. We also illustrate the use of recent advanced tools in scientific machine learning for implementing complex computing concepts, that is, Taylor expansion, DAEs/ODEs transformation, and quantum computing solver with abstract representation for power engineering applications.

computational complexity↗