Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “linear equations”

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 343 records · Page 19
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Distributed Delay Differential Equation Representations of Cyclic Differential Equations

Compartmental ordinary differential equation (ODE) models are used extensively in mathematical biology. When transit between compartments occurs at a constant rate, the well-known linear chain trick can be used to show that the ODE model is equivalent to an Erlang distributed delay differential equation (DDE). Here, we demonstrate that compartmental models with nonlinear transit rates and possibly delayed arguments are also equivalent to a scalar distributed DDE. To illustrate the utility of these equivalences, we calculate the equilibria of the scalar DDE, and compute the characteristic function---without calculating a determinant. Further, we derive the equivalent scalar DDE for two examples of models in mathematical biology and use the DDE formulation to identify physiological processes that were otherwise hidden by the compartmental structure of the ODE model.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Multiscale simulations for multi-continuum Richards equations

In this paper, we study a multiscale method for simulating a dual-continuum unsaturated flow problem within complex heterogeneous fractured porous media. Mathematically, each of the dual continua is modeled by a multiscale Richards equation (for pressure head), and these equations are coupled to one another by transfer terms. On its own, Richards equation is already a nonlinear partial differential equation, and it is exceedingly difficult to solve numerically due to the extra nonlinear dependencies involving the soil water. To deal with multiple scales, our strategy is that starting from a microscopic scale, we upscale the coupled system of dual-continuum Richards equations via homogenization by the two-scale asymptotic expansion, to obtain a homogenized system, at an intermediate scale (level). Based on a hierarchical approach, the homogenization’s effective coefficients are computed through solving the arising cell problems. Furthermore, to tackle the nonlinearity, after time discretization, we use Picard iteration procedure for linearization of the homogenized Richards equations. At each Picard iteration, some degree of multiscale still remains from the intermediate level, so we utilize the generalized multiscale finite element method (GMsFEM) combining with a multi-continuum approach, to upscale the homogenized system to a macroscopic (coarse-grid) level. This scheme involves building uncoupled and coupled multiscale basis functions, which are used not only to construct coarse-grid solution approximation with high accuracy but also (with the coupled multiscale basis) to capture the interactions among continua. These prospects and convergence are demonstrated by several numerical results for the proposed method.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Learning and meta-learning of stochastic advection–diffusion–reaction systems from sparse measurements

Physics-informed neural networks (PINNs) were recently proposed in [18] as an alternative way to solve partial differential equations (PDEs). A neural network (NN) represents the solution, while a PDE-induced NN is coupled to the solution NN, and all differential operators are treated using automatic differentiation. Here, we first employ the standard PINN and a stochastic version, sPINN, to solve forward and inverse problems governed by a non-linear advection–diffusion–reaction (ADR) equation, assuming we have some sparse measurements of the concentration field at random or pre-selected locations. Subsequently, we attempt to optimise the hyper-parameters of sPINN by using the Bayesian optimisation method (meta-learning) and compare the results with the empirically selected hyper-parameters of sPINN. In particular, for the first part in solving the inverse deterministic ADR, we assume that we only have a few high-fidelity measurements, whereas the rest of the data is of lower fidelity. Hence, the PINN is trained using a composite multi-fidelity network, first introduced in [12], that learns the correlations between the multi-fidelity data and predicts the unknown values of diffusivity, transport velocity and two reaction constants as well as the concentration field. For the stochastic ADR, we employ a Karhunen–Loève (KL) expansion to represent the stochastic diffusivity, and arbitrary polynomial chaos (aPC) to represent the stochastic solution. Correspondingly, we design multiple NNs to represent the mean of the solution and learn each aPC mode separately, whereas we employ a separate NN to represent the mean of diffusivity and another NN to learn all modes of the KL expansion. For the inverse problem, in addition to stochastic diffusivity and concentration fields, we also aim to obtain the (unknown) deterministic values of transport velocity and reaction constants. The available data correspond to 7spatial points for the diffusivity and 20 space–time points for the solution, both sampled 2000 times. We obtain good accuracy for the deterministic parameters of the order of 1–2% and excellent accuracy for the mean and variance of the stochastic fields, better than three digits of accuracy. In the second part, we consider the previous stochastic inverse problem, and we use Bayesian optimisation to find five hyper-parameters of sPINN, namely the width, depth and learning rate of two NNs for learning the modes. Here, we obtain much deeper and wider optimal NNs compared to the manual tuning, leading to even better accuracy, i.e., errors less than 1% for the deterministic values, and about an order of magnitude less for the stochastic fields.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

A New Proof That the Number of Linear Elastic Symmetries in Two Dimensions Is Four

In this work, we present an elementary and self-contained proof that there are exactly four symmetry classes of the elasticity tensor in two dimensions: oblique, rectangular, square, and isotropic. In two dimensions, orthogonal transformations are either reflections or rotations. The proof is based on identification of constraints imposed by reflections and rotations on the elasticity tensor, and it simply employs elementary tools from trigonometry, making the proof accessible to a broad audience. For completeness, we identify the sets of transformations (rotations and reflections) for each symmetry class and report the corresponding equations of motions in classical linear elasticity.

42 ENGINEERING↗
DOE OSTI2025

Parallel-in-Time Solution of Scalar Nonlinear Conservation Laws

Here, we consider the parallel-in-time solution of scalar nonlinear conservation laws in one spatial dimension. The equations are discretized in space with a conservative finite-volume method using weighted essentially nonoscillatory (WENO) reconstructions, and in time with high-order explicit Runge–Kutta methods. The solution of the global, discretized space-time problem is sought via a nonlinear iteration that uses a novel linearization strategy in cases of nondifferentiable equations. Under certain choices of discretization and algorithmic parameters, the nonlinear iteration coincides with Newton’s method, although, more generally, it is a preconditioned residual correction scheme. At each nonlinear iteration, the linearized problem takes the form of a certain discretization of a linear conservation law over the space-time domain in question. An approximate parallel-in-time solution of the linearized problem is computed with a single multigrid reduction-in-time (MGRIT) iteration; however, any other effective parallel-in-time method could be used in its place. The MGRIT iteration employs a novel coarse-grid operator that is a modified conservative semi-Lagrangian discretization and generalizes those we have developed previously for nonconservative scalar linear hyperbolic problems. Numerical tests are performed for the inviscid Burgers and Buckley–Leverett equations. For many test problems, the solver converges in just a handful of iterations with a convergence rate independent of mesh resolution, including problems with (interacting) shocks and rarefactions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Dyn$\mathrm{AMO}$: Multi-agent reinforcement learning for dynamic anticipatory mesh optimization with applications to hyperbolic conservation laws

Here we introduce DynAMO, a reinforcement learning paradigm for Dynamic Anticipatory Mesh Optimization. Adaptive mesh refinement is an effective tool for optimizing computational cost and solution accuracy in numerical methods for partial differential equations. However, traditional adaptive mesh refinement approaches for time-dependent problems typically rely only on instantaneous error indicators to guide adaptivity. As a result, standard strategies often require frequent remeshing to maintain accuracy. In the DynAMO approach, multi-agent reinforcement learning is used to discover new local refinement policies that can anticipate and respond to future solution states by producing meshes that deliver more accurate solutions for longer time intervals. By applying DynAMO to discontinuous Galerkin methods for the linear advection and compressible Euler equations in two dimensions, we demonstrate that this new mesh refinement paradigm can outperform conventional threshold-based strategies while also generalizing to different mesh sizes, remeshing and simulation times, and initial conditions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Simulation of gas mixture dynamics in a pipeline network using explicit staggered-grid discretization

Here we develop an explicit staggered finite difference discretization scheme for simulating the transport of highly heterogeneous gas mixtures through pipeline networks. This study is motivated by the proposed blending of hydrogen into natural gas pipelines to reduce end use carbon emissions while using existing pipeline systems throughout their planned lifetimes. Our computational method accommodates an arbitrary number of constituent gases with very different physical properties that may be injected into a network with significant spatiotemporal variation. In this setting, the gas flow physics are highly location- and time- dependent, so that local composition and nodal mixing must be accounted for. The resulting conservation laws are formulated in terms of pressure, partial densities and flows, and volumetric and mass fractions of the constituents. We include non-ideal equations of state that employ linear approximations of gas compressibility factors, so that the pressure dynamics propagate locally according to a variable wave speed that depends on mixture composition and density. We derive compatibility relationships for network edge boundary values that are more complex than for a homogeneous gas. The simulation method is evaluated on initial boundary value problems for a single pipe and a small network, is cross-validated with a lumped element simulation, and used to demonstrate a local monitoring and control policy for maintaining allowable concentration levels.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Machine learning of hidden variables in multiscale fluid simulation

Solving fluid dynamics equations often requires the use of closure relations that account for missing microphysics. For example, when solving equations related to fluid dynamics for systems with a large Reynolds number, sub-grid effects become important and a turbulence closure is required, and in systems with a large Knudsen number, kinetic effects become important and a kinetic closure is required. By adding an equation governing the growth and transport of the quantity requiring the closure relation, it becomes possible to capture microphysics through the introduction of ‘hidden variables’ that are non-local in space and time. The behavior of the ‘hidden variables’ in response to the fluid conditions can be learned from a higher fidelity or ab-initio model that contains all the microphysics. In our study, a partial differential equation simulator that is end-to-end differentiable is used to train judiciously placed neural networks against ground-truth simulations. We show that this method enables an Euler equation based approach to reproduce non-linear, large Knudsen number plasma physics that can otherwise only be modeled using Boltzmann-like equation simulators such as Vlasov or particle-in-cell modeling.

42 ENGINEERING↗
DOE OSTI2022

A Note on the Probability of Initiation Problem

The purpose of this note is to draw attention to Pál’s derivation of the Pál Bell equation which is used by LLNL and LANL to model Probability of Initiation (POI) problems. Both laboratories credit the equation to Bell and Lee. Although the equation formulated by Bell and Lee and the equation derived by Pál appear to be the same, the derivation by Bell and Lee is flawed. Scattering, which was absent in Bell’s original formulation of a POI problem, was later introduced by Bell and Lee by simply replacing a fission term with a scattering term. Such a replacement, however, leads to an inaccurate average number v̅ of neutrons that is produced by a fission event. By approaching a POI problem from probabilistic point of view, Pál formulates the problem as a branching process that determines v̅ correctly. There are six reasons for writing this report. The first is to clarify the failing in Bell and Lee’s derivation. The second is to establish the origin of the equation used by the laboratories. The third is to elucidate the fixed point technique formulated by Mokhtar-Kharroubi for solving the Pál-Bell equation. The fourth is to derive the α eigenvalue that is associated with a time dependent Pál-Bell equation. The fifth is to show in Appendix A that the non-linear fission operator of the Pál-Bell equation is descended from the operator of the Galton-Watson process of stochastic theory. The sixth is to describe in Appendix B a second order positivity preserving technique that accelerates the convergence of the first order fixed point method developed by Mokhtar-Kharroubi.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2020

Transport phenomena in electrolyte solutions: Nonequilibrium thermodynamics and statistical mechanics

The theory of transport phenomena in multicomponent electrolyte solutions is presented here through the integration of continuum mechanics, electromagnetism, and nonequilibrium thermodynamics. The governing equations of irreversible thermodynamics, including balance laws, Maxwell's equations, internal entropy production, and linear laws relating the thermodynamic forces and fluxes, are derived. Green–Kubo relations for the transport coefficients connecting electrochemical potential gradients and diffusive fluxes are obtained in terms of the flux–flux time correlations. Furthermore, the relationship between the derived transport coefficients and those of the Stefan–Maxwell and infinitely dilute frameworks are presented, and the connection between the transport matrix and experimentally measurable quantities is described. To exemplify the application of the derived Green–Kubo relations in molecular simulations, the matrix of transport coefficients for lithium and chloride ions in dimethyl sulfoxide is computed using classical molecular dynamics and compared with experimental measurements.

42 ENGINEERING↗
DOE OSTI2023

Multilevel-in-width training for deep neural network regression

A common challenge in regression is that for many problems, the degrees of freedom required for a high-quality solution also allows for overfitting. Regularization is a class of strategies that seek to restrict the range of possible solutions so as to discourage overfitting while still enabling good solutions, and different regularization strategies impose different types of restrictions. In this paper, we present a multilevel regularization strategy that constructs and trains a hierarchy of neural networks, each of which has layers that are wider versions of the previous network's layers. Here, we draw intuition and techniques from the field of Algebraic Multigrid (AMG), traditionally used for solving linear and nonlinear systems of equations, and specifically adapt the Full Approximation Scheme (FAS) for nonlinear systems of equations to the problem of deep learning. Training through V-cycles then encourage the neural networks to build a hierarchical understanding of the problem. We refer to this approach as multilevel-in-width to distinguish from prior multilevel works which hierarchically alter the depth of neural networks. The resulting approach is a highly flexible framework that can be applied to a variety of layer types, which we demonstrate with both fully connected and convolutional layers. We experimentally show with PDE regression problems that our multilevel training approach is an effective regularizer, improving the generalize performance of the neural networks studied.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Anderson acceleration with approximate calculations: Applications to scientific computing

Here we provide rigorous theoretical bounds for Anderson acceleration (AA) that allow for approximate calculations when applied to solve linear problems. We show that, when the approximate calculations satisfy the provided error bounds, the convergence of AA is maintained while the computational time could be reduced. We also provide computable heuristic quantities, guided by the theoretical error bounds, which can be used to automate the tuning of accuracy while performing approximate calculations. For linear problems, the use of heuristics to monitor the error introduced by approximate calculations, combined with the check on monotonicity of the residual, ensures the convergence of the numerical scheme within a prescribed residual tolerance. Motivated by the theoretical studies, we propose a reduced variant of AA, which consists in projecting the least-squares used to compute the Anderson mixing onto a subspace of reduced dimension. The dimensionality of this subspace adapts dynamically at each iteration as prescribed by the computable heuristic quantities. We numerically show and assess the performance of AA with approximate calculations on: (i) linear deterministic fixed-point iterations arising from the Richardson's scheme to solve linear systems with open-source benchmark matrices with various preconditioners and (ii) non-linear deterministic fixed-point iterations arising from non-linear time-dependent Boltzmann equations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Leading jets and energy loss

The formation and evolution of leading jets can be described by jet functions which satisfy non-linear DGLAP-type evolution equations. Different than for inclusive jets, the leading jet functions constitute normalized probability densities for the leading jet to carry a longitudinal momentum fraction relative to the initial fragmenting parton. We present a parton shower algorithm which allows for the calculation of leading-jet cross sections where logarithms of the jet radius and threshold logarithms are resummed to next-to-leading logarithmic (NLL') accuracy. By calculating the mean of the leading jet distribution, we are able to quantify the average out-of-jet radiation, the so-called jet energy loss. When an additional reference scale is measured, we are able to determine the energy loss of leading jets at the cross section level which is identical to parton energy loss at leading-logarithmic accuracy. We identify several suitable cross sections for an extraction of the jet energy loss and we present numerical results for leading subjets at the LHC. In addition, we consider hemisphere and event-wide leading jets in electron-positron annihilation similar to measurements performed at LEP. Besides the average energy loss, we also consider its variance and other statistical quantities such as the KL divergence which quantifies the difference between quark and gluon jet energy loss. We expect that our results will be particularly relevant for quantifying the energy loss of quark and gluon jets that propagate through hot or cold nuclear matter.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2023

EUTERPE: A global gyrokinetic code for stellarator geometry

The current state of the EUTERPE code is described with emphasis on the implemented models and their numerical implementation. The code solves the multi-species electromagnetic gyrokinetic equations in the full volume of a three-dimensional domain. Noise reduction of the particle-in-cell method is achieved by using a δf-method and Fourier filters. The field equations are discretized with B-splines and the resulting system of equations is solved iteratively. For linear simulations a phase-factor transformation is applied in order to strongly reduce the necessary grid resolution. Apart from the full gyrokinetic model, other numerically less expensive hybrid models are also implemented. They are mainly tailored for comparison with fluid theory and for studying the interaction of the bulk plasma with fast particles. The code is parallelized for CPUs by particle and domain decomposition. Good scalability up to several thousand nodes is demonstrated.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

ElasTool v3.0: Efficient computational and visualization toolkit for elastic and mechanical properties of materials

Efficient computation and visualization of elastic and mechanical properties are crucial in the selection of materials and the design of new materials. Here, the ElasTool v3.0 toolkit marks a significant advancement in the computational analysis and visualization of elastic and mechanical properties of materials, essential in material selection and design. This enhanced version extends beyond standard calculations like elastic tensor, Young's modulus, bulk modulus, and Poisson's ratio. It introduces capabilities for computing minimum thermal conductivity, linear compressibility, rendering the Christoffel equation, and elastic energy density. Notably, it integrates advanced visualization tools, including compatibility with Plotly and Elate web platforms for interactive web-based property exploration. A key feature of ElasTool v3.0 is the implementation of second-order elastic constants (SOECs) for tubular 2D-based nanostructures and nanotubes. Leveraging high-efficiency strain-matrix sets (OHESS), the toolkit now facilitates efficient computation of elastic constants and mechanical properties at both zero and finite temperatures for 1D, 2D, and 3D dimensions. ElasTool is openly accessible on GitHub: https://github.com/gmp007/elastool.

1D, 2D, 3D, and tubular 2D nanostructure and nanot↗
DOE OSTI2020

Adaptive Activation Functions Accelerate Convergence in Deep and Physics-informed Neural Networks

We employ adaptive activation functions for regression in deep and physics-informed neural networks (PINNs) to approximate smooth and discontinuous functions as well as solutions of linear and nonlinear partial differential equations. In particular, we solve the nonlinear Klein-Gordon equation, which has smooth solutions, the nonlinear Burgers equation, which can admit high gradient solutions, and the Helmholtz equation. We introduce a scalable hyper-parameter in the activation function, which can be optimized to achieve best performance of the network as it changes dynamically the topology of the loss function involved in the optimization process. The adaptive activation function has better learning capabilities than the traditional one (fixed activation) as it improves greatly the convergence rate, especially at early training, as well as the solution accuracy. To better understand the learning process, we plot the neural network solution in the frequency domain to examine how the network captures successively different frequency bands present in the solution. We consider both forward problems, where the approximate solutions are obtained, as well as inverse problems, where parameters involved in the governing equation are identified. Our simulation results show that the proposed method is a very simple and effective approach to increase the efficiency, robustness and accuracy of the neural network approximation of nonlinear functions as well as solutions of partial differential equations, especially for forward problems. We theoretically prove that in the proposed method, gradient descent algorithms are not attracted to suboptimal critical points or local minima.

machine leaning, Bad minima, Inverse problems, Phy↗
DOE OSTI2026

Unpolarized GPDs at small x and non-zero skewness

We study the small-x asymptotics of unpolarized generalized parton distributions (GPDs) and generalized transverse momentum distributions (GTMDs). Unlike the previous works in the literature, we consider the case of non-zero (but small) skewness while allowing for non-linear contributions to the evolution equations. We first show that unpolarized GPDs and GTMDs at small x are related to the eikonal dipole amplitude N, whose small-x evolution is given by the BK/JIMWLK evolution equations, and to the odderon amplitude $\mathscr{O}$, whose evolution is also known in the literature. We then show that the effect of non-zero skewness ξ ≠ 0 is to modify the value of the evolution parameter (rapidity) in the arguments for the dipole amplitudes N and $\mathscr{O}$ from Y = ln(1/x) to Y = ln min{1/|x|, 1/|ξ|}.

Generalized parton distributions (GPDs)↗
DOE OSTI2025

The Role of Dislocations in the Anelasticity of the Upper Mantle

Dislocation‐based dissipation mechanisms potentially control the viscoelastic response of Earth's upper mantle across a variety of geodynamic contexts, including glacial isostatic adjustment, postseismic creep, and seismic‐wave attenuation. However, there is no consensus on which dislocation‐based, microphysical process controls the viscoelastic behavior of the upper mantle. Although both intergranular (plastic anisotropy) and intragranular (backstress) mechanisms have been proposed, there is currently insufficient laboratory data to discriminate between those mechanisms. Here, we present the results of forced‐oscillation experiments in a deformation‐DIA apparatus at confining pressures of 3–7 GPa and temperatures of 298–1370 K. Our experiments tested the viscoelastic response of polycrystalline olivine—the main constituent of the upper mantle—at stress amplitudes from 70 to 2,800 MPa. Mechanical data are complemented by microstructural analyses of grain size, crystallographic preferred orientation, and dislocation density. We observe amplitude‐ and frequency‐dependent attenuation and modulus relaxation and find that numerical solutions of the backstress model match our results well. Therefore, we argue that interactions among dislocations, rather than intergranular processes (e.g., plastic anisotropy or grain boundary sliding), control the viscoelastic behavior of polycrystalline olivine in our experiments. In addition, we present a linearized version of the constitutive equations of the backstress model and extrapolate it to conditions typical of seismic‐wave propagation in the upper mantle. Our extrapolation demonstrates that the backstress model can explain the magnitude of seismic‐wave attenuation in the upper mantle, although some modification is required to explain the weak frequency dependence of attenuation observed in nature and in previous experimental work.

Hein, Diede [Univ. of Minnesota, Minneapolis, MN (↗