Search NASA⌕ Search

SEARCH · Search NASA

Results for “differential 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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

High-Performance Electron Sources: Numerical Methods and Beam Dynamics at the Precision Frontier

Electron sources have a wide range of applications and there are many stakeholders that express continuing need for improvements and performance enhancements. Whether we consider ultra-cold, high-brightness, high-charge or high-average current source needs, there are some common themes from the point of view of the beam dynamics involved. These are the following ones: ability to model accurately the emission processes, including the presence of often complicated cathode and other boundary surfaces with a wide range of spatial scales; ability to deal accurately and efficiently with a large number of particles interacting pair-wise, including the stochastic part of these interactions with a wide range of spatial scales; and ability to propagate the particle distributions in time, including collisions with a wide range of temporal scales. These tasks require high precision and accuracy since the goal is usually generation, transport and preservation of very high-quality beams. This grant addressed one of the rem

43 PARTICLE ACCELERATORS↗
DOE OSTI2025

A Model Predictive Control to Improve Grid Resilience

The following article details a model predictive control (MPC) to improve grid resilience when faced with variable generation resources. This topic is of significant interest to utility power systems where distributed intermittent energy sources will increase significantly and be relied on for electric grid ancillary services. Previous work on MPCs has focused on narrowly targeted control applications such as improving electric vehicle (EV) charging infrastructure or reducing the cost of integrating Energy Storage Systems (ESSs) into the grid. In contrast, this article develops a comprehensive treatment of the construction of an MPC tailored to electric grids and then applies it integration of intermittent energy resources. To accomplish this, the following article includes a description of a reduced order model (ROM) of an electric power grid based on a circuit model, an optimization formulation that describes the MPC, a collocation method for solving linear time-dependent differential algebraic equations (DAEs) that result from the ROM, and an overall strategy for iteratively refining the behavior of the MPC. Next, the algorithm is validated using two separate numerical experiments. First, the algorithm is compared to an existing MPC code and the results are verified by a numerically precise simulation. It is shown that this algorithm produces a control comparable to existing algorithms and the behavior of the control carefully respects the bounds specified. Second, the MPC is applied to a small nine bus system that contains a mix of turbine-spinning-machine-based and intermittent generation in order to demonstrate the algorithm’s utility for resource planning and control of intermittent resources. This study demonstrates how the MPC can be tuned to change the behavior of the control, which can then assist with the integration of intermittent resources into the grid. The emphasis throughout the paper is to provide systematic treatment of the topic and produce a novel nonlinear control compatible design framework applicable to electric grids and the control of variable resources. This differs from the more targeted application-based focus in most presentations.

microgrid↗
DOE OSTI2026

SODAs: sparse optimization for the discovery of differential and algebraic equations

Differential-algebraic equations (DAEs) integrate ordinary differential equations (ODEs) with algebraic constraints, providing a fundamental framework for developing models of dynamical systems characterized by time-scale separation, conservation laws and physical constraints. While sparse optimization has revolutionized model development by allowing data-driven discovery of parsimonious models from a library of possible equations, existing approaches for dynamical systems assume DAEs can be reduced to ODEs by eliminating variables before model discovery. This assumption limits the applicability of such methods for DAE systems with unknown constraints and time scales. We introduce sparse optimization for differential-algebraic systems (SODAs), a data-driven method for the identification of DAEs in their explicit form. By discovering the algebraic and dynamic components sequentially without prior identification of the algebraic variables, this approach leads to a sequence of convex optimization problems. It has the advantage of discovering interpretable models that preserve the structure of the underlying physical system. To this end, SODAs improves since SODAs is singular numerical stability when handling high correlations between library terms, caused by near-perfect algebraic relationships, by iteratively refining the conditioning of the candidate library. We demonstrate the performance of our method on biological, mechanical and electrical systems, showcasing its robustness to noise in both simulated time series and real-time experimental data.

DAE↗
DOE OSTI2024

Reinforcement Learning-Based Approach for EMT Automation of Large-Scale PV Plants

In the pursuit of efficient and precise modeling of large-scale power systems, particularly utility-scale photovoltaic (PV) plants, Electromagnetic Transient (EMT) simulations play a crucial role. As utility-scale PV plants increase in size and complexity, traditional computational methods become inadequate, necessitating more advanced techniques. This paper highlights the progressive efforts made to accelerate EMT simulations. A novel continuous reinforcement learning (RL) strategy is explored to automate the differentiation and categorization of stiff and non-stiff differential algebraic equations (DAEs). The use of stiff and non-stiff integration methods applied to relevant parts of the DAEs assists with the speed-up of the simulations. The paper details the data acquisition, development and offline training of the RL model, leading to its validation that demonstrates a high precision in optimizing simulation methods. The proposed RL promises to significantly enhance the efficacy of EMT simulations, offering a robust framework for the future of power system analysis.

Xia, Qianxue↗
DOE OSTI2024

cppTPSA/pyTPSA: a C++/Python package for truncated power series algebra

The truncated power series algebra (TPSA), also referred to as differential algebra (DA), is a well-established and widely used method in particle accelerator physics and astronomy. The most straightforward usage of TPSA/DA is to calculate the Taylor expansion of a given function at a specific point up to order ?. In recent years, as the application of TPSA/TA has been extended to other fields, a reusable implementation of TPSA/DA as a modern C++ library or other high level programming language like Python has become desirable. The cppTPSA package implements TPSA/DA in C++11 and provides developers a convenient library with which to build advanced TPSA/DA-based methods. A Python 3 library, pyTPSA, has also been developed based on the C++ lib.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Beam Dynamics of the Muon $g\textrm{-}2$ Experiment

The Muon $g\textrm{-}2$ Experiment (E989) at Fermilab aims to measure the muon anomalous magnetic moment $a_{\mu}$ with unprecedented precision, potentially uncovering physics beyond the Standard Model of particle physics. The result based on Runs 1-3, released in 2023, achieved a precision of 0.20 ppm. The experiment circulates muons in a storage ring, measuring $a_{\mu}$ from decay positron time and energy measurements collected with calorimeters. To achieve the required accuracy, it is crucial to measure and control the magnetic field in the ring with high precision. Beam dynamics corrections are necessary for muons not orbiting exactly in the midplane, for their oscillations, and for electric field effects. Highly accurate beam dynamics simulations are instrumental for quantifying and validating the beam dynamics corrections, ultimately improving the precision of the $a_{\mu}$ measurement and facilitating the achievement of the ambitious $70\:\mathrm{ppb}$ systematic uncertainty goal. The measured field data was incorporated into models for simulations using three codes: \texttt{gm2ringsim} (an internal Geant4-based code), \textit{COSY INFINITY}, and \textit{BMAD}. The advantages of \texttt{gm2ringsim} include using CAD-based geometry and modelling the detector effects. \textit{COSY INFINITY} is a highly accurate and efficient code that uses high-order differential-algebraic transfer maps, precise fringe field calculations, and advanced symplectification methods. Symplectification is important for maintaining the physical correctness of the muon beam behaviour with high precision over the storage time, ensuring conservation of phase space volume and preventing artificial damping or excitation of particle motion. The experiment completed its final Run 6 in July 2023, collecting 21 times more data than the previous BNL experiment. Analyses of data from Runs 4-6 are ongoing, with results planned for release in 2025, potentially resolving the current tension between experiment and theory.

43 PARTICLE ACCELERATORS↗
DOE OSTI2025

Hardware acceleration for HPS algorithms in two and three dimensions

We provide a flexible, open-source framework for hardware acceleration, namely massively-parallel execution on general-purpose graphics processing units (GPUs), applied to the hierarchical Poincaré–Steklov (HPS) family of algorithms for building fast direct solvers for linear elliptic partial differential equations. To take full advantage of the power of hardware acceleration, we propose two variants of HPS algorithms to improve performance on two- and three-dimensional problems. In the two-dimensional setting, we introduce a novel recomputation strategy that minimizes costly data transfers to and from the GPU; in three dimensions, we modify and extend the adaptive discretization technique of Geldermans and Gillman [1] to greatly reduce peak memory usage. We provide an open-source implementation of these methods written in JAX, a high-level accelerated linear algebra package, which allows for the first integration of a high-order fast direct solver with automatic differentiation tools. We conclude with extensive numerical examples showing our methods are fast and accurate on two- and three-dimensional problems.

Fast direct solvers↗
DOE OSTI2023

Leverage Score Sampling for Parametric PDEs (Final Technical Report)

This final technical report summarizes the accomplishments of work performed under DOE Office of Science Award DE-SC0022266, which is titled “Leverage Score Sampling for Parametric PDEs”. The goal of the project was to extend methods from Randomized Numerical Linear Algebra (RandNLA) to tackle central computational challenges in model order reduction and uncertainty quantification (UQ) for parametric partial differential equations (PDEs). In particular, we sought to use importance sampling methods originally developed for RandNLA to develop sample efficient active learning algorithms for approximating high-dimensional scalar functions, e.g. by polynomials, Gaussian process models, and simple neural networks. Such methods can be immediately applied to developing surrogate models or to approximating quantity of interest (QoI) surfaces. In the context of PDEs, each sample used for learning equates to the solution of the differential equation for a particular set of parameters, so sample efficiency translates to improved computational efficiency for a variety of downstream tasks.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Block smoothers and generalized ideal interpolation in AMG (Final Report)

The Pennsylvania State University (“Subcontractor”) worked on developing new parallel algebraic multilevel methods suitable for solving PDEs. Specifically, work on the design of multigrid solvers for coupled systems of partial differential equations arising in numerical modeling of various applications was completed. A main emphasis was on the design of new ideal algebraic multigrid interpolation for problems such as Maxwell’s equations where block smoothers are needed and the standard form of ideal interpolation is not an effective choice.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Proximal Galerkin: A Structure-Preserving Finite Element Method for Pointwise Bound Constraints

The proximal Galerkin finite element method is a high-order, low iteration complexity, nonlinear numerical method that preserves the geometric and algebraic structure of pointwise bound constraints in infinite-dimensional function spaces. This paper introduces the proximal Galerkin method and applies it to solve free boundary problems, enforce discrete maximum principles, and develop a scalable, mesh-independent algorithm for optimal design with pointwise bound constraints. This paper also introduces the latent variable proximal point (LVPP) algorithm, from which the proximal Galerkin method derives. When analyzing the classical obstacle problem, we discover that the underlying variational inequality can be replaced by a sequence of second-order partial differential equations (PDEs) that are readily discretized and solved with, e.g., the proximal Galerkin method. Throughout this work, we arrive at several contributions that may be of independent interest. These include (1) a semilinear PDE we refer to as the entropic Poisson equation; (2) an algebraic/geometric connection between high-order positivity-preserving discretizations and certain infinite-dimensional Lie groups; and (3) a gradient-based, bound-preserving algorithm for two-field, density-based topology optimization. The complete proximal Galerkin methodology combines ideas from nonlinear programming, functional analysis, tropical algebra, and differential geometry and can potentially lead to new synergies among these areas as well as within variational and numerical analysis. Open-source implementations of our methods accompany this work to facilitate reproduction and broader adoption.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Reduced-dimension Bayesian optimization for model calibration of transient vapor compression cycles

Development and calibration of first-principles dynamic models of vapor compression cycles (VCCs) is of critical importance for applications that include control design and fault detection and diagnostics. Nevertheless, the inherent complexity of models that are represented by large systems of differential–algebraic equations leads to significant challenges for model calibration processes that utilize classical gradient-based methods. Bayesian optimization (BO) is a sample-efficient and gradient-free approach using a probabilistic surrogate model and optimal search over a feasible parameter space. Despite the benefits of BO in reducing computational costs, challenges remain in dealing with a high-dimensional calibration task resulting from a large set of parameters that have significant impacts on system behavior and need to be calibrated simultaneously. This paper presents a reduced-dimension BO framework for calibrating transient VCCs models where the calibration space is projected to a low-dimensional subspace for accelerating convergence of the solution algorithm and consequently reducing the number of transient simulations. The proposed approach was demonstrated via two case studies associated with different VCC applications where 10 parameters were calibrated in each case using laboratory measurements. The reduced-dimension BO framework only required 1 / 8 th of the iterations associated with a standard BO method that deals with high-dimensional calibration parameters for converged solutions and yielded comparable accuracy. Furthermore, both calibrated models revealed significant accuracy improvements compared to uncalibrated models.

Ma, Jiacheng↗
DOE OSTI2025

Strongly nonlinear wave propagation in elasto-plastic metamaterials: Low-order dynamic modeling

Nonlinear elastic metamaterials are known to support a variety of dynamic phenomena that enhance our capacity to manipulate elastic waves. Since these properties stem from complex, subwavelength geometry, full-scale dynamic simulations are often prohibitively expensive at scales of interest. Prior studies have therefore utilized low-order effective medium models, such as discrete mass-spring lattices, to capture essential properties in the long-wavelength limit. While models of this type have been successfully implemented for a wide variety of nonlinear elastic systems, they have predominantly considered dynamics depending only on the instantaneous kinematics of the lattice, neglecting history-dependent effects, such as wear and plasticity. Here, to address this limitation, the present study develops a lattice-based modeling framework for nonlinear elastic metamaterials undergoing plastic deformation. Due to the history- and rate-dependent nature of plasticity, the framework generally yields a system of differential-algebraic equations whose computational cost is significantly greater than an elastic system of comparable size. We demonstrate the method using several models inspired by classical lattice dynamics and continuum plasticity theory and explore means to obtain empirical plasticity models for general geometries, thereby gaining insight into the influence of microstructural plasticity on effective material performance, which can be used to improve the design of nonlinear mechanical metamaterials.

Dynamic simulation↗
DOE OSTI2025

SDA: a symbolic differential algebra package in C++

Truncated Power Series Algebra (TPSA), or Differential Algebra (DA), is a well-established tool in accelerator physics, commonly used for generating high-order maps of dynamic systems, as well as in symplectic tracking, normal form analysis, verified integration, optimization, and fast multipole methods. This package is the first to perform symbolic DA computations, enabling traceability of initial condition contributions and runtime reduction for repeated DA calculations, potentially expanding DA’s applications.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Linear Solvers for Collector Systems of Generalized Large-scale Inverter-Based Resources

Collector systems for inverter-based resources (IBRs) are typically represented by equivalent circuits for electromagnetic transient (EMT) simulations. Recent studies have revealed that modeling a detailed collector system is essential to accurately represent the behavior of IBRs, especially when dealing with partial tripping during external disturbances. However, there are several challenges in simulating a detailed EMT model of a collector system due to the time required to simulate such systems. Thus, this paper investigates the modeling of a detailed collector system, taking into account its configuration and components as defined in IEEE standard 2800. The configurations include the collector systems of generalized large-scale IBR plants. The components include the main IBR transformer, collector bus, and feeders with lines and/or cables. The EMT model of the collector system is represented by differential algebraic equations (DAEs) that are discretized to form linear equations that are solved using linear solvers. In this paper, linear solvers are proposed based on the Schur complement method, which are utilized for simulation of the EMT model of collector systems of generalized large-scale IBRs to accelerate simulation speed while maintaining the accuracy of the results. The proposed solvers are verified by comparing the performance to that of linear solvers provided in MATLAB.

Choi, Jongchan↗
DOE OSTI2025

A Novel Approach for Computing Rigid Body Motion Using Linear Accelerations

Here, a novel approach is presented for computing general rigid body motion based on a few known linear accelerations. This method utilizes linear acceleration data obtained from three distinct points on the body, all within a body-fixed reference frame. The only requirement is that the three chosen points must not be collinear. A system of differential-algebraic equations is derived, combining principles of rigid body kinematics with theory of the rotation group SO(3). These equations provide a framework for numerically computing various motion parameters, including angular velocity, angular acceleration, body orientation, velocity field, acceleration field, and displacement field. By numerically solving this system of equations, we can fully characterize rigid body motion in three-dimensional space. A numerical example is provided to demonstrate the practical implementation and efficacy of the proposed technique, illustrating its potential for accurate motion computation in various applications.

42 ENGINEERING↗
DOE OSTI2025

Hypercomplex Automatic Differentiation in the Eulerian Hydrocode PAGOSA

Enabling the computation of partial derivatives or sensitivities in production hydrocodes is beneficial for design, optimization, sensitivity analysis, and uncertainty quantification. Traditional finite difference approximations of these sensitivities are inefficient since convergence studies of the step size is required for each parameter of interest. For these reasons, HYPercomplex Automatic Differentiation (HYPAD) was implemented in the Eulerian hydrocode PAGOSA. HYPAD is analogous to forward-mode automatic differentiation except hypercomplex numbers (numbers with multiple imaginary parts) are used instead of dual numbers. Accurate partial derivatives can be computed of all state variables with respect to multiple input variables in a single run. The method was implemented using operator overloading to handle hypercomplex algebra. HYPAD was demonstrated and verified on Sod’s shock tube problem to compute derivatives of the state variables with respect to a material parameter, initial conditions, and geometry.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Scalable multilevel Monte Carlo methods exploiting parallel redistribution on coarse levels

Here, we study an element agglomeration coarsening strategy that requires data redistribution at coarse levels when the number of coarse elements becomes smaller than the number of MPI processes used on the finest level. The overall procedure generates coarse elements (general unstructured unions of fine grid elements) within the framework of element-based algebraic multigrid methods (or AMGe) studied previously. The AMGe-generated coarse spaces have the ability to exhibit approximation properties of the same order as the fine-level spaces since by construction they contain the piecewise polynomials of the same order as on the fine level. These approximation properties are key for the successful use of AMGe in multilevel solvers for nonlinear partial differential equations as well as for multilevel Monte Carlo (MLMC) simulations. The ability to coarsen without being constrained by the number of MPI processes, as described in the present paper, allows to improve the scalability of these solvers as well as the overall MLMC method. The paper illustrates this latter fact with detailed scalability study of MLMC simulations applied to model Darcy equations with a stochastic log-normal permeability field.

AMGe↗
DOE OSTI2026

Tracking discontinuities in parameter space

We develop a geometric framework in Feynman-parameter space to determine constraints on the sequential discontinuities of Feynman integrals. Our method is based on tracking the deformation of the integration contour as external kinematics are analytically continued. This procedure imposes powerful constraints on the analytic structure of Feynman integrals, providing crucial inputs for their bootstrap. We demonstrate the usefulness of this framework by applying it to integrals in dimensional regularization, with higher propagator powers, and to examples with non-uniform transcendental weight. The method is illustrated with several one- and two-loop calculations.

Differential and Algebraic Geometry↗