SEARCH · Engineering Papers

Results for “algebraic approach”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

SourceResearch connectionFrom yearThrough year

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

At least 109 records · Page 6

All sources NASA NTRS DOE OSTI

DOE OSTI2025

Preserving nonlinear constraints in variational flow filtering data assimilation

Data assimilation aims to estimate the states of a dynamical system by optimally combining sparse and noisy observations of the physical system with uncertain forecasts produced by a computational model. The states of many dynamical systems of interest obey nonlinear physical constraints, and the corresponding dynamics is confined to a certain sub-manifold of the state space. Standard data assimilation techniques applied to such systems yield posterior states lying outside the manifold, violating the physical constraints. This work focuses on particle flow filters which use stochastic differential equations to evolve state samples from a prior distribution to samples from an observation-informed posterior distribution. The variational Fokker-Planck (VFP)—a generic particle flow filtering framework—is extended to incorporate non-linear, equality state constraints in the analysis. To this end, two algorithmic approaches that modify the VFP stochastic differential equation are discussed: (i) VFPSTAB, to inexactly preserve constraints with the addition of a stabilizing drift term, and (ii) VFPDAE, to exactly preserve constraints by treating the VFP dynamics as a stochastic differential-algebraic equation (SDAE). Additionally, an implicit-explicit time integrator is developed to evolve the VFPDAE dynamics. The strength of the proposed approach for constraint preservation in data assimilation is demonstrated on three test problems: the double pendulum, Korteweg-de-Vries, and the incompressible Navier-Stokes equations.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2020

A Geometric Measure Theory Approach to Identify Complex Structural Features on Soft Matter Surfaces

The structural features that protrude above or below a soft matter interface are well-known to be related to interfacially mediated chemical reactivity and transport processes. It is a challenge to develop a robust algorithm for identifying these organized surface structures, as the morphology can be highly varied and they may exist on top of an interface containing significant interfacial roughness. A new algorithm that employs concepts from geometric measure theory, algebraic topology, and optimization is developed to identify candidate structures at a soft matter surface, and then, using a probabilistic approach, to rank their likelihood of being a complex structural feature. The algorithm is tested for a surfactant laden water/oil interface, where it is robust to identifying protrusions responsible for water transport against a set identified by visual inspection. To our knowledge, this is the first example of applying geometric measure theory to analyze the properties of a chemical/materials science system.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2024

Classifying photonic topology using the spectral localizer and numerical K -theory

Recently, the spectral localizer framework has emerged as an efficient approach for classifying topology in photonic systems featuring local nonlinearities and radiative environments. In nonlinear systems, this framework provides rigorous definitions for concepts such as topological solitons and topological dynamics, where a system’s occupation induces a local change in its topology due to nonlinearity. For systems embedded in radiative environments that do not possess a shared bulk spectral gap, this framework enables the identification of local topology and shows that local topological protection is preserved despite the lack of a common gap. However, as the spectral localizer framework is rooted in the mathematics of C*-algebras, and not vector bundles, understanding and using this framework requires developing intuition for a somewhat different set of underlying concepts than those that appear in traditional approaches for classifying material topology. In this tutorial, we introduce the spectral localizer framework from a ground-up perspective and provide physically motivated arguments for understanding its local topological markers and associated local measure of topological protection. In doing so, we provide numerous examples of the framework’s application to a variety of topological classes, including crystalline and higher-order topology. We then show how Maxwell’s equations can be reformulated to be compatible with the spectral localizer framework, including the possibility of radiative boundary conditions. To aid in this introduction, we also provide a physics-oriented introduction to multi-operator pseudospectral methods and numerical K-theory, two mathematical concepts that form the foundation for the spectral localizer framework. Finally, we provide some mathematically oriented comments on the C*-algebraic origins of this framework, including a discussion of real C*-algebras and graded C*-algebras that are necessary for incorporating physical symmetries. Looking forward, we hope that this tutorial will serve as an approachable starting point for learning the foundations of the spectral localizer framework.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2023

Incremental Interval Assignment by Integer Linear Algebra with Improvements

Interval Assignment (IA) is the problem of selecting the number of mesh edges (intervals) for each curve for conforming quad and hex meshing. The intervals x is fundamentally integer-valued. Many other approaches perform numerical optimization then convert a floating-point solution into an integer solution, which is slow and error prone. We avoid such steps: we start integer, and stay integer. Incremental Interval Assignment (IIA) uses integer linear algebra (Hermite normal form) to find an initial solution to the meshing constraints, satisfying the integer matrix equation Solving for reduced row echelon form provides integer vectors spanning the nullspace of A. Here we add vectors from the nullspace to improve the initial solution, maintaining Ax = b Heuristics find good integer linear combinations of nullspace vectors that provide strict improvement towards variable bounds or goals. IIA always produces an integer solution if one exists. In practice we usually achieve solutions close to the user goals, but there is no guarantee that the solution is optimal, nor even satisfies variable bounds, e.g. has positive intervals. We describe several algorithmic changes since first publication that tend to improve the final solution. The software is freely available.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2021

SBIR Phase I Final Report, TACO: Distributed and Heterogeneous Sparse Compiler

Tensor algebra is a powerful tool for computing, but writing optimized codes that operate on sparse tensors can be very complex. This project enables a Tensor Algebra Compiler (TACO) that simplifies this task from man-years to man-days and extends TACO to support complex and large distributed systems. This report details the hypotheses, approaches used, and findings in this project.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2023

Cauchy-type integral method for solving the linearized one-dimensional Vlasov-Poisson equation

Here, we present a method for solving the linearized Vlasov-Poisson equation, based on analyticity properties of the equilibrium and initial condition through Cauchy-type integrals, that produces algebraic expressions for the distribution and field, i.e., the solution is expressed without integrals. Standard extant approaches involve deformations of the Bromwich contour that give erroneous results for certain physically reasonable configurations or eigenfunction expansions that are misleading as to the temporal structure of the solution. Our method is more transparent, lacks these defects, and predicts previously unrecognized behavior.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

DOE OSTI2026

Spacetime quantum mechanics for bosonic and fermionic systems

We provide a Hilbert space approach to quantum mechanics where space and time are treated on an equal footing. Our approach replaces the standard dependence on an external classical time parameter with a spacetime-symmetric algebraic structure, thereby unifying the axioms that traditionally distinguish the treatment of spacelike and timelike separations. Standard quantum evolution can be recovered from timelike correlators, defined by means of a quantum action operator, a quantum version of the action of classical mechanics. The corresponding map also provides an alternative perspective on the path integral formulation that, in the case of fermions, does not require the use of Grassmann variables. In addition, the formalism can be interpreted in terms of generalized quantum states, codifying both the conventional information of a quantum system at a given time and its evolution. We show that these states are solutions to a quantum principle of stationary action grounded in timelike correlations and pseudo-entropies.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2020

Performance and Feature Improvements in Parareal-based Power System Dynamic Simulation

In recent years, a novel Parareal-based approach has been developed for fast transient simulations of large power system interconnections. Parareal belongs to the class of Parallel-in-time algorithms for solution of systems of differential-algebraic equations in parallel over an interval of time. The selection of a reasonably fast and accurate coarse solution is crucial to improve the performance of Parareal algorithm. Semi-analytical solution methods are one promising approach to achieve this goal. They have been investigated, and some preliminary results are presented here. In addition, Parareal-based simulator has been expanded to enable co-simulation with OpenDSS, a widely used open-source distribution system simulator. Preserving the parallel nature of the Parareal approach and taking advantage of the parallel capabilities of the latest versions of OpenDSS, each distribution system can be solved in their entirety on different processors in parallel within the main Parareal simulator. This paper also presents the structure of the transmission and distribution co-simulation and some results with different dynamic models of inverter-based resources in the distribution systems.

Park, Byungkwon↗

DOE OSTI2026

Compositional Reasoning for Hierarchical State Machines

Harel statecharts and its derivatives are popular graphical languages for specifying discrete control systems via hierarchical state machines. Separately, there has been a long line of work on specifying concurrent systems with process calculi which come equipped with an algebraic theory, the ability reason compositionally about various temporal properties, and strong type systems. While these two approaches to modeling systems are tantalizingly similar, the integrated reasoning principles that exist for process calculi have not been demonstrated in hierarchical state machines. A key issue is that operational theories for process calculi do not behave like control systems, and thus, there is virtually no tool support for modeling control systems with such languages. For a control system designer, bringing the integrated, more scalable reasoning from the process calculi to state-machine languages would enable the specification of more complex systems and a more modular systems development process. Our insight is that we can recover many important results from the process calculi in hierarchical state machines with local scope. We employ a structural operational semantics, which is ubiquitous in process and 𝜆-calculi but uncommon in hierarchical statemachine formalizations, to enable inductive reasoning about behavior. Taking inspiration from the structure of process calculi metatheories, we define a calculus of refinement and equivalence that we prove sound with respect to local notion of (bi)simulation. Furthermore, we prove that the calculus preserves the behavioral properties of reactivity, observational determinism, traces, and linear temporal properties. Our results are mechanized in the Rocq proof assistant.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

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↗

DOE OSTI2026

From Quantum Time to Manifestly Covariant QFT: On the Need for a Quantum-Action-Based Quantization

In quantum time (QT) schemes, time is promoted to a degree of freedom, allowing Lorentz covariance to be made explicit for single particles. We ask whether this can be lifted to QFT so that Lorentz covariance becomes manifest at the Hilbert-space level, rather than being hidden as in the standard canonical formulation. We address this question by proposing a second-quantized approach in which the elementary particle is the QT particle itself, leading naturally to the notion of spacetime field algebras and of quantum action. We show, however, that a naive many-body construction runs into inconsistencies. To pinpoint their origin we introduce a classical counterpart of the second-quantized formalism, spacetime classical mechanics (SCM), and prove a no-go theorem: Dirac quantization of SCM collapses back to standard QFT and therefore hides covariance. We circumvent this problem by presenting a quantum-action-based quantization that yields a spacetime version of quantum mechanics (SQM), making covariance manifest for (interacting) QFTs. Finally, we show that this resolution is tied to a genuine spacetime generalization of the notion of a quantum state, required by causality and closely connected to recent “states over time” proposals and, in dS/CFT–motivated settings, to microscopic notions of timelike entanglement and emergent time.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2021

Accelerated basis adaptation in homogeneous chaos spaces

Polynomial chaos expansions (PCE) provide an efficient approach to uncertainty quantification (UQ) and have been adapted to diverse applications across the spectrum of science and engineering. For situations involving large stochastic parameterizations, the curse of dimensionality renders PCE-based methods computationally prohibitive. A basis adaptation approach for PCE was proposed by Tipireddy and Ghanem (2014) which transforms the input random variables through an isometry such that sufficient probabilistic characterization of specific quantities of interest (QoI) is concentrated in an algebraic manifold embedded in the linear span of the dominant transformed variables. While quite versatile, that original version of the PCE basis adaptation exhibited slow convergence for a number of problems of practical significance. In the present paper, we propose two novel methods to accelerate the convergence of the original basis adaptation approach, thus expanding its reach while also providing insight into its performance. In the first method, information gained from a pilot PCE representation is used to correct the mean and Gaussian coefficients in the adapted space. By taking advantages of probabilistic information in higher dimensional adaptation gleaned from an initial adaptation, the second method updates the rotation matrix used to identify the dominant transformed variables. In this manner, the new rotation matrix concentrates even more probabilistic information in its first few dimensions. These two method can be combined to achieve even better performance, the combined method is referred to as sequentially optimized adaptation method. Here, the methods are demonstrated on an analytical test function and a model of a space structure with several sub-components and a non-smooth quantity of interest representing the maximum acceleration over time. Both methods achieve accelerated convergence of the basis adaptation approach with negligible additional costs.

Accelerated convergence↗

DOE OSTI2021

Covariant color-kinematics duality

We show that color-kinematics duality is a manifest property of the equations of motion governing currents and field strengths. For the nonlinear sigma model (NLSM), this insight enables an implementation of the double copy at the level of fields, as well as an explicit construction of the kinematic algebra and associated kinematic current. As a byproduct, we also derive new formulations of the special Galileon (SG) and Born-Infeld (BI) theory. For Yang-Mills (YM) theory, this same approach reveals a novel structure — covariant color-kinematics duality — whose only difference from the conventional duality is that 1/$\square$ is replaced with covariant 1/D 2 . Remarkably, this structure implies that YM theory is itself the covariant double copy of gauged biadjoint scalar (GBAS) theory and an F 3 theory of field strengths encoding a corresponding kinematic algebra and current. Directly applying the double copy to equations of motion, we derive general relativity (GR) from the product of Einstein-YM and F 3 theory. This exercise reveals a trivial variant of the classical double copy that recasts any solution of GR as a solution of YM theory in a curved background. Covariant color-kinematics duality also implies a new decomposition of tree-level amplitudes in YM theory into those of GBAS theory. Using this representation we derive a closed-form, analytic expression for all BCJ numerators in YM theory and the NLSM for any number of particles in any spacetime dimension. By virtue of the double copy, this constitutes an explicit formula for all tree-level scattering amplitudes in YM, GR, NLSM, SG, and BI.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2024

The Penrose limit of the Weyl double copy

We embed the Penrose limit into the Weyl classical double copy. Thereby, we provide a lift of the double copy properties of plane wave spacetimes into black hole geometries and we open a novel avenue towards taking the classical double copy beyond statements about algebraically special backgrounds. In particular, the Penrose limit, viewed as the leading order Fermi coordinate expansion around a null geodesic, complements approaches leveraging asymptotic flatness such as the asymptotic Weyl double copy. Along the way, we show how our embedding of the Penrose limit within the Weyl double copy naturally fixes the functional ambiguity in the double copy for Petrov type N spacetimes. Here, we also highlight the utility of a spinorial approach to the Penrose limit. In particular, we use this spinorial approach to derive a simple analytical expression for arbitrary Penrose limits of four-dimensional, vacuum type D spacetimes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2021

Predictive Battery Lifetime Modeling at the National Renewable Energy Laboratory

Overview of the development of algebraic battery lifetime modeling efforts within NREL's Electrochemical Energy Storage group within the Energy Conversion and Storage Systems Center. Traditional approaches to developing battery lifetime models are compared with a new methodology incorporating machine learning to autonomously identify parsimonious model equations.

ADVANCED PROPULSION SYSTEMS↗

DOE OSTI2020

A scalable matrix-free spectral element approach for unsteady PDE constrained optimization using PETSc/TAO

In this work, we provide a new approach for the efficient matrix-free application of the transpose of the Jacobian for the spectral element method for the adjoint-based solution of partial differential equation (PDE) constrained optimization. This results in optimizations of nonlinear PDEs using explicit integrators where the integration of the adjoint problem is not more expensive than the forward simulation. Solving PDE constrained optimization problems entails combining expertise from multiple areas, including simulation, computation of derivatives, and optimization. The Portable, Extensible Toolkit for Scientific computation (PETSc) together with its companion package, the Toolkit for Advanced Optimization (TAO), is an integrated numerical software library that contains an algorithmic/software stack for solving linear systems, nonlinear systems, ordinary differential equations, differential algebraic equations, and large-scale optimization problems and, as such, is an ideal tool for performing PDE-constrained optimization. This paper describes an efficient approach in which the software stack provided by PETSc/TAO can be used for large-scale nonlinear time-dependent problems. Time integration can involve a range of high-order methods, both implicit and explicit. The PDE-constrained optimization algorithm used is gradient-based and seamlessly integrated with the simulation of the physical problem.

97 MATHEMATICS AND COMPUTING↗

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 OSTI2022

Time-explicit Darwin PIC algorithm

A new approach to Darwin particle-in-cell plasma simulation is described. Using a finite-element approach, the vector potential is assured to be exactly solenoidal. This allows writing the system of multi-species particles as an action-at-a-distance Hamiltonian system. Applying recently-developed explicit symplectic methods to this gives a time-explicit algorithm with all desired properties. Elliptic systems for the electrostatic and magneto-static portions of the problem are inverted efficiently by an algebraic multi-grid algorithm. The algorithm is implemented in a two-dimensional Cartesian-geometry code and tested by application to Weibel instability and to Alfvén wave dynamics. Results show the effectiveness of this approach. Extensions to arbitrary meshes and to a partially time-implicit scheme are briefly discussed.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗