Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “differential algebraic equation”

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 91 records · Page 5

Singularity-EOS XCAP Report

Solving the Euler equations is a fundamental component of simulating many physical phenomena ranging from high explosives to astrophysics. An equation of state (EOS) is a required piece that relates any two thermodynamic quantities to all other thermodynamic values. The presence of multiple materials within a control volume further complicates the solution requiring additional equations to describe the interaction of materials at a sub-grid level. Equations of state themselves can also come in many forms ranging from simple algebraic relations to more complicated differential equation models that describe material interactions over a broad range of physical conditions. In the latter case, the EOS is often pre-computed at a given set of grid points and provided in a tabular form where additional properties can be derived from the interpolation functions.

97 MATHEMATICS AND COMPUTING↗

Hierarchical Model Reduction Driven by Machine Learning for Parametric Advection-Diffusion-Reaction Problems in the Presence of Noisy Data

Abstract We propose a new approach to generate a reliable reduced model for a parametric elliptic problem, in the presence of noisy data. The reference model reduction procedure is the directional HiPOD method, which combines Hierarchical Model reduction with a standard Proper Orthogonal Decomposition, according to an offline/online paradigm. In this paper we show that directional HiPOD looses in terms of accuracy when problem data are affected by noise. This is due to the interpolation driving the online phase, since it replicates, by definition, the noise trend. To overcome this limit, we replace interpolation with Machine Learning fitting models which better discriminate relevant physical features in the data from irrelevant unstructured noise. The numerical assessment, although preliminary, confirms the potentialities of the new approach.

97 MATHEMATICS AND COMPUTING↗

ssys

`ssys` is a Python toolkit for exact algebraic transformation of ordinary differential equation (ODE) models into canonical S-system or Generalized Mass Action (GMA) form. Given a model in Antimony or SBML format, `ssys` produces a mathematically equivalent representation. The transformation introduces auxiliary variables as needed to decompose a broad class of nonlinearities into products of power-law terms. The recast is exact: the original and transformed systems have identical dynamics on the invariant constraint manifold defined by auxiliary variable definitions, given consistent initial conditions.

Hlavacek, William [Los Alamos National Laboratory]↗

Effects of finite element discretization and model simplification on calculations of ductile failure initiation

The finite element method is a scheme to discretize the infinite number of degrees of freedom in continuum-level problems down to a finite number of degrees of freedom. This discretization is done in conjunction with methods that also reduce the field differential equations to sets of algebraic ones that can be solved by arithmetical operations. Therefore, solutions attained by finite element models are approximations to the exact solutions of the field equations.

97 MATHEMATICS AND COMPUTING↗

A buoyancy–shear–drag–scalar-based turbulence model for power-law acceleration-driven Rayleigh–Taylor, reshocked Richtmyer–Meshkov, and Kelvin–Helmholtz mixing

A previously developed phenomenological turbulence model for Rayleigh–Taylor, reshocked Richtmyer–Meshkov, and Kelvin–Helmholtz instability-induced mixing based on a general buoyancy–shear–drag model [O. Schilling, “A buoyancy–shear–drag-based turbulence model for Rayleigh–Taylor, reshocked Richtmyer–Meshkov, and Kelvin–Helmholtz mixing,” Physica D 402, 132238 (2020)] is extended to include active or passive scalar mixing and power-law acceleration-driven Rayleigh–Taylor mixing. The buoyancy–shear–drag equations are coupled to a scalar variance equation that is used to define the molecular mixing parameter θ m , and when the scalar is active, modifies the Rayleigh–Taylor and Kelvin–Helmholtz mixing layer growth parameters to depend on the asymptotic value of this parameter, θ mol . Here, the scalar variance equation is closed by algebraically or differentially modeling the scalar variance dissipation rate. Nonlinear analytical solutions of the model are obtained in the total and separate bubble and spike mixing layer width formulations with the algebraic scalar variance dissipation rate for each instability, which are then used to calibrate the mechanical and scalar equation coefficients to predict specific values of physical observables and molecular mixing parameters. Surrogate mechanical and scalar turbulent fields can be constructed by multiplying a presumed self-similar spatial profile by appropriate functions of the width and its time derivative, and of the scalar obtained by solving the ordinary differential model equations. The explicit modeling and solution of turbulent transport equations are not required. The bubble and spike mixing layer width and scalar variance equations are then solved numerically for constant-acceleration Rayleigh–Taylor, impulsively reshocked Richtmyer–Meshkov, and Kelvin–Helmholtz mixing, confirming that the prescribed level of molecular mixing is correctly predicted and illustrating the spatiotemporal evolution of the scalar fields.

Buoyancy–drag↗

Chapter Six - Derivation, cross-validation, and comparison of analytic formulas for electrostatic deflector aberrations

Here, we derived first and second order analytic aberration formulas in the horizontal transverse plane for an electrostatic deflector specified by the reference orbit radius, the central angle spanning the deflector, and its inhomogeneity coefficients. The derivation was performed using an iterative order-by-order perturbation method in a Frenet–Serret beamline coordinate system. We produced a C program edabrt for calculation of the first and second order aberrations using the formulas that we derived. The electrostatic deflector aberration formulas from Wollnik (1965) disagree with COSY INFINITY and the aberration formulas that we derived here, and they also deviate from the first and second order symplecticity conditions. The reason for this discrepancy is that the aberration formulas from Wollnik (1965) consider only motion in the main field of the deflector and do not properly account for fringe field effects, in particular the necessarily occurring change of kinetic energy due to the change in potential. The code GIOS uses electrostatic aberration formulas from Wollnik (1965) and exhibits the same discrepancy. We performed a comparison of first and second order electrostatic deflector aberrations for (1) the analytic formulas derived in this work, (2) differential-algebraic (DA) numerical integration of the equations of motion using the code COSY INFINITY, (3) the aberration formulas from Wollnik (1965), (4) aberrations computed using the code GIOS, and (5) the aberration formulas from Wollnik (1965) adjusted to account for the occurring change in potential. An electrostatic spherical deflector and an electrostatic cylindrical deflector were used as test cases for this comparison. There is excellent agreement between methods (1), (2), and (5), and these three methods satisfy the first and second order symplecticity conditions.

43 PARTICLE ACCELERATORS↗

Quantum Spectral Methods for Differential Equations

Recently developed quantum algorithms address computational challenges in numerical analysis by performing linear algebra in Hilbert space. Such algorithms can produce a quantum state proportional to the solution of a d-dimensional system of linear equations or linear differential equations with complexity poly(logd). While several of these algorithms approximate the solution to within ϵ with complexity poly(log(1/ϵ)), no such algorithm was previously known for differential equations with time-dependent coefficients. In this work, we develop a quantum algorithm for linear ordinary differential equations based on so-called spectral methods, an alternative to finite difference methods that approximates the solution globally. Using this approach, we give a quantum algorithm for time-dependent initial and boundary value problems with complexity poly(logd, log(1/ϵ)).

97 MATHEMATICS AND COMPUTING↗

Self-similar Reynolds-averaged mechanical–scalar turbulence models for reshocked Richtmyer–Meshkov instability-induced mixing in the small Atwood number limit

Analytical self-similar solutions to two-, three-, and four-equation Reynolds-averaged mechanical–scalar turbulence models describing incompressible turbulent Richtmyer–Meshkov instability-induced mixing in planar geometry derived in the small Atwood number limit are extended to construct models for reshocked Richtmyer–Meshkov mixing. In this study, the models are based on the turbulent kinetic energy K and its dissipation rate ε, together with the scalar variance S and its dissipation rate χ modeled either differentially or algebraically. The three- and four-equation models allow for a simultaneous description of mechanical and scalar mixing, i.e., mixing layer growth and molecular mixing. Mixing layer growth parameters and other physical observables were obtained explicitly as functions of the model coefficients and were used to calibrate the model coefficients. Here, the solutions for the singly shocked Richtmyer–Meshkov case for the mixing layer width and the turbulent fields are used to construct piecewise-continuous generalizations of these quantities for times after reshock. For generality, the post-reshock mixing layer width is not assumed to grow with the same power-law as the pre-reshock width, and an impulsive approximation applied to Rayleigh–Taylor instability growth is used to establish the expression for the post-reshock width. A four-equation model is then used to illustrate the spatiotemporal behavior of the mean and turbulent fields and late-time turbulent equation budgets across the mixing layer. The reference solutions derived here can provide systematic calibrations and better understanding of mechanical–scalar turbulence models and their predictions for reshocked Richtmyer–Meshkov instability-induced turbulent mixing in the very large Reynolds number limit.

42 ENGINEERING↗

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↗

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↗

Tusas: A fully implicit parallel approach for coupled phase-field equations

In this study, we develop a fully-coupled, fully-implicit approach for phase-field modeling of solidification in metals and alloys. Predictive simulation of solidification in pure metals and metal alloys remains a significant challenge in the field of materials science, as microstructure formation during the solidification process plays a critical role in the properties and performance of the solid material. Our simulation approach consists of a finite element spatial discretization of the fully-coupled nonlinear system of partial differential equations at the microscale, which is treated implicitly in time with a preconditioned Jacobian-free Newton-Krylov method. The approach is algorithmically scalable as well as efficient due to an effective preconditioning strategy based on algebraic multigrid and block factorization. We implement this approach in the open-source Tusas framework, which is a general, flexible tool developed in C++ for solving coupled systems of nonlinear partial differential equations. The performance of our approach is analyzed in terms of algorithmic scalability and efficiency, while the computational performance of Tusas is presented in terms of parallel scalability and efficiency on emerging heterogeneous architectures. We demonstrate that modern algorithms, discretizations, and computational science, and heterogeneous hardware provide a robust route for predictive phase-field simulation of microstructure evolution during additive manufacturing.

97 MATHEMATICS AND COMPUTING↗

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↗

The kinetic origin of the fluid helicity—A symmetry in the kinetic phase space

Helicity, a topological degree that measures the winding and linking of vortex lines, is preserved by ideal (barotropic) fluid dynamics. In the context of the Hamiltonian description, the helicity is a Casimir invariant characterizing a foliation of the associated Poisson manifold. Casimir invariants are special invariants that depend on the Poisson bracket, not on the particular choice of the Hamiltonian. The total mass (or particle number) is another Casimir invariant, whose invariance guarantees the mass (particle) conservation (independent of any specific choice of the Hamiltonian). In a kinetic description (e.g., that of the Vlasov equation), the helicity is no longer an invariant (although the total mass remains a Casimir of the Vlasov’s Poisson algebra). The implication is that some “kinetic effect” can violate the constancy of the helicity. To elucidate how the helicity constraint emerges or submerges, we examine the fluid reduction of the Vlasov system; the fluid (macroscopic) system is a “sub-algebra” of the kinetic (microscopic) Vlasov system. In the Vlasov system, the helicity can be conserved if a special helicity symmetry condition holds. To put it another way, breaking helicity symmetry induces a change in the helicity. We delineate the geometrical meaning of helicity symmetry and show that for a special class of flows (the so-called epi-two-dimensional flows), the helicity symmetry is written as ∂γ = 0 for a coordinate γ of the configuration space.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Moment-Fourier approach to ion parallel fluid closures and transport for a toroidally confined plasma

A general method of solving the drift kinetic equation is developed for an axisymmetric magnetic field. Expanding a distribution function in general moments, a set of ordinary differential equations is obtained. Successively expanding the moments and magnetic-field involved quantities in Fourier series, a set of linear algebraic equations is obtained. The set of full (Maxwellian and non-Maxwellian) moment equations is solved to express the first-order density, temperature, and flow velocity in terms of radial gradients of the zeroth-order pressure and temperature. Closure relations that connect parallel heat flux density and viscosity to the radial gradients and parallel gradients of temperature and flow velocity are also obtained by solving the non-Maxwellian moment equations. The closure relations combined with the linearized fluid equations reproduce the same solution obtained directly from the full moment equations. Furthermore, the method can be generalized to derive closures and transport for an electron-ion plasma and a multi-ion plasma in a general magnetic field.

neoclassical transport↗

Hadamard products and BPS networks

We study examples of fourth-order Picard-Fuchs operators that are Hadamard products of two second-order Picard-Fuchs operators. Each second-order Picard-Fuchs operator is associated with a family of elliptic curves, and the Hadamard product computes period integrals on the fibred product of the two elliptic surfaces. We construct 3-cycles on this geometry as the union of 2-cycles in the fibre over contours on the base. We then use the special Lagrangian condition to constrain the contours on the base. This leads to a construction that is reminiscent of spectral networks and exponential networks that have previously appeared in string theory literature.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

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↗

Hierarchical off-diagonal low-rank approximation of Hessians in inverse problems, with application to ice sheet model initialization

Obtaining lightweight and accurate approximations of discretized objective functional Hessians in inverse problems governed by partial differential equations (PDEs) is essential to make both deterministic and Bayesian statistical large-scale inverse problems computationally tractable. The cubic computational complexity of dense linear algebraic tasks, such as Cholesky factorization, that provide a means to sample Gaussian distributions and determine solutions of Newton linear systems is a computational bottleneck at large-scale. These tasks can be reduced to log-linear complexity by utilizing hierarchical off-diagonal low-rank (HODLR) matrix approximations. In this work, we show that a class of Hessians that arise from inverse problems governed by PDEs are well approximated by the HODLR matrix format. In particular, we study inverse problems governed by PDEs that model the instantaneous viscous flow of ice sheets. In these problems, we seek a spatially distributed basal sliding parameter field such that the flow predicted by the ice sheet model is consistent with ice sheet surface velocity observations. Here, we demonstrate the use of HODLR Hessian approximation to efficiently sample the Laplace approximation of the posterior distribution with covariance further approximated by HODLR matrix compression. Computational studies are performed which illustrate ice sheet problem regimes for which the Gauss–Newton data-misfit Hessian is more efficiently approximated by the HODLR matrix format than the low-rank (LR) format. We then demonstrate that HODLR approximations can be favorable, when compared to global LR approximations, for large-scale problems by studying the data-misfit Hessian associated with inverse problems governed by the first-order Stokes flow model on the Humboldt glacier and Greenland ice sheet.

97 MATHEMATICS AND COMPUTING↗

Fast Computational Algorithms for Partial Differential Equations and Uncertainty Quantifications

This project concerned the construction, testing and analysis of computational algorithms for solving parameterized and stochastic partial differential equations. The study and understanding of equations of this type is of fundamental importance in numerous engineering and scientific applications. Examples include simulation of plasma dynamics in models of electric propulsion and nuclear fusion, simulation of multiphase flows, such as the flow of water, gas and oil in reservoirs, and structural analysis of the dependence of structures on materials. Parametrization is used in such settings when properties of the models such as viscosity of fluids or electric resistivity of materials are not precisely understood and instead are treated as random variables. The resulting solutions are themselves random, and having such solutions will enable engineers to use probabilistic methods to assess the likelihood of events, for example, whether a pollutant in a liquid will exceed a limit, and to use such analyses to develop ways to ensure positive outcomes. Construction of accurate (high resolution) computational solutions is expensive, requiring significant computer time and computational resources, and there is need to reduce computational cost to make simulation useful and effective. The aim of the project was to construct algorithms to efficiently compute surrogate solutions to parameterized problems to allow for efficient and accurate simulation. The technical approach used focused on two related strategies, based on rank-reduction methods and reduced-order models. These methods construct surrogate solutions of parameter-dependent models by projection or interpolation into low-dimensional approximation spaces. Cost savings are achieved if the low-dimensional spaces can be identified and constructed efficiently and if the resulting low-dimensional algebraic systems can be solved cheaply. Accomplishments include: Theoretical and empirical demonstration of the effectiveness of fast multigrid solution strategies for computing low-rank representations of parameter-dependent solutions to discrete partial differential equations, including the first proof establishing so-called textbook convergence properties for low-rank methods. Development of efficient solution algorithms for solving nonlinear parameter-dependent partial differential equations used in models of fluid dynamics. Developent of efficient algorithms for low-rank representation of solutions of time-dependent simulations of fluid dynamics using multi-dimensional tensor representations of solutions.

97 MATHEMATICS AND COMPUTING↗