Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “numerical mathematics”

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 649 records · Page 36

Implicit–explicit multirate infinitesimal stage-restart methods

Implicit–Explicit (IMEX) methods are flexible numerical time integration methods which solve an initial-value problem (IVP) that is split into stiff and nonstiff processes with the goal of lower computational costs than a purely implicit or explicit approach. A complementary form of flexible IVP solvers are multirate infinitesimal methods for problems split into fast- and slow-changing dynamics, that solve a multirate IVP by evolving a sequence of “fast” IVPs using any suitably accurate algorithm. This article introduces a new class of high-order implicit–explicit multirate methods that are designed for multirate IVPs in which the slow-changing dynamics are further split in an IMEX fashion. This new class, which we call implicit–explicit multirate infinitesimal stage-restart (IMEX-MRI-SR), both improves upon the previous implicit–explicit multirate infinitesimal generalized-structure additive Runge Kutta (IMEX-MRI-GARK) methods by allowing for far easier creation of new embedded methods, and extends multirate exponential Runge Kutta (MERK) methods by allowing the fast-changing dynamics to be nonlinear and the methods to be implicit. We leverage GARK theory to derive conditions for orders of accuracy up to four, and we provide second- and third-order accurate example methods, which are the first known embedded MRI methods with IMEX structure. We then perform numerical simulations demonstrating convergence rates and computational performance in both fixed-step and adaptive-step settings.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗

Parallel exponential time differencing methods for geophysical flow simulations

Two ocean models are considered for geophysical flow simulations: the multilayer shallow water equations and the multilayer primitive equations. For the former, we investigate the parallel performance of exponential time differencing (ETD) methods, including exponential Rosenbrock–Euler, ETD2wave, and B-ETD2wave. For the latter, we take advantage of the splitting of barotropic and baroclinic modes and propose a new two-level method in which an ETD method is applied to solve the fast barotropic mode. Furthermore, these methods could improve the computational efficiency of numerical simulations because ETD methods allow for much larger time step sizes than traditional explicit time-stepping techniques that are commonly used in existing computational ocean models. Several standard benchmark tests for ocean modeling are performed and comparison of the numerical results demonstrates a great potential of applying the parallel ETD methods for simulating real-world geophysical flows.

54 ENVIRONMENTAL SCIENCES↗

Coupled Cluster Theory for Nonadiabatic Dynamics: Nuclear Gradients and Nonadiabatic Couplings in Similarity Constrained Coupled Cluster Theory

Coupled cluster theory is one of the most accurate electronic structure methods for predicting ground and excited state chemistry. However, the presence of numerical artifacts at electronic degeneracies, such as complex energies, has made it difficult to apply the method in nonadiabatic dynamics simulations. While it has already been shown that such numerical artifacts can be fully removed by using similarity constrained coupled cluster (SCC) theory [J. Phys. Chem. Lett. 2017, 8(19), 4801–4807], simulating dynamics requires efficient implementations of gradients and nonadiabatic couplings. Here, we present an implementation of nuclear gradients and nonadiabatic derivative couplings at the similarity constrained coupled cluster singles and doubles (SCCSD) level of theory, thereby making possible nonadiabatic dynamics simulations using a coupled cluster theory that provides a correct description of conical intersections between excited states. We present a few numerical examples that show good agreement with literature values and discuss some limitations of the method.

38 RADIATION CHEMISTRY, RADIOCHEMISTRY, AND NUCLEA↗

Long-time simulations for fixed input states on quantum hardware

Publicly accessible quantum computers open the exciting possibility of experimental dynamical quantum simulations. While rapidly improving, current devices have short coherence times, restricting the viable circuit depth. Despite these limitations, we demonstrate long-time, high fidelity simulations on current hardware. Specifically, we simulate an XY-model spin chain on Rigetti and IBM quantum computers, maintaining a fidelity over 0.9 for 150 times longer than is possible using the iterated Trotter method. Our simulations use an algorithm we call fixed state Variational Fast Forwarding (fsVFF). Recent work has shown an approximate diagonalization of a short time evolution unitary allows a fixed-depth simulation. fsVFF substantially reduces the required resources by only diagonalizing the energy subspace spanned by the initial state, rather than over the total Hilbert space. We further demonstrate the viability of fsVFF through large numerical simulations, and provide an analysis of the noise resilience and scaling of simulation errors.

97 MATHEMATICS AND COMPUTING↗

Qutrit circuits and algebraic relations: A pathway to efficient spin-1 Hamiltonian simulation

Quantum information processing has witnessed significant advancements through the application of qubit-based techniques within universal gate sets. Recently, exploration beyond the qubit paradigm to d -dimensional quantum units or qudits has opened new avenues for improving computational efficiency. This paper delves into the qudit-based approach, particularly addressing the challenges presented in the high-fidelity implementation of qudit-based circuits due to increased complexity. As an innovative approach towards enhancing qudit circuit fidelity, we explore algebraic relations, such as the Yang-Baxter-like turnover equation, which may enable circuit compression and optimization. The paper introduces the turnover relation for the three-qutrit time propagator and its potential use in reducing circuit depth. We further investigate whether this relation can be generalized for higher-dimensional quantum circuits, including a focused study on the one-dimensional spin-1 Heisenberg model. Our paper outlines both rigorous and numerically efficient approaches to potentially achieve this generalization, providing a foundation for further explorations in the field of qudit-based quantum computing.

97 MATHEMATICS AND COMPUTING↗

On the Stability of Power Transmission Systems Under Persistent Inverter Attacks: A Bi-Linear Matrix Approach

We investigate the stability and robustness properties of a power transmission system under persistent deceiving attacks on inverter-interfaced energy resources. The attacks can corrupt the damping coefficients in the inverters' controllers and measurements of the frequency at the points of coupling. Leveraging tools from hybrid dynamical systems theory, we characterize a broad family of persistent (and not necessarily periodic) attacks acting on the inverters, under which the stability properties of the transmission system can be shown to not be compromised. To address potentially conservative conditions identified through conventional bounding techniques, sufficient conditions on the average activation time of the attacks are identified via Lyapunov theory, as well as the formulation and solution of a class of bilinear matrix inequalities (BMI). The results are obtained for constant and slowly time-varying loads via input-to-state stability (ISS) tools. Numerical simulations on the IEEE 39-bus test system are also presented.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Block Krylov Subspace Methods for Functions of Matrices II: Modified Block FOM

We analyze an expansion of the generalized block Krylov subspace framework of [Electron. Trans. Numer. Anal., 47 (2017), pp. 100--126]. This expansion allows the use of low-rank modifications of the matrix projected onto the block Krylov subspace and contains, as special cases, the block GMRES method and the new block Radau--Arnoldi method. Within this general setting, we present results that extend the interpolation property from the nonblock case to a matrix polynomial interpolation property for the block case, and we relate the eigenvalues of the projected matrix to the latent roots of these matrix polynomials. Some error bounds for these modified block FOM methods for solving linear systems are presented. We then show how cospatial residuals can be preserved in the case of families of shifted linear block systems. This result is used to derive computationally practical restarted algorithms for block Krylov approximations that compute the action of a matrix function on a set of several vectors simultaneously. Finally, we prove some error bounds and present numerical results showing that two modifications of FOM, the block harmonic and the block Radau--Arnoldi methods for matrix functions, can significantly improve the convergence behavior.

97 MATHEMATICS AND COMPUTING↗

An Efficient High-Order Solver for Diffusion Equations with Strong Anisotropy on Non-Anisotropy-Aligned Meshes

This paper concerns numerical solution of the diffusion equation with strong anisotropy on meshes not aligned with the anisotropic vector field. In order to resolve the numerical pollution for simulations on a non-anisotropy-aligned mesh and reduce the associated high computational cost we propose an effective preconditioner, extending our previous work. Similar to the anisotropy-aligned mesh case, we apply the auxiliary space preconditioning framework to design a preconditioner where a continuous finite element space is used as the auxiliary space for the discontinuous finite element space. The key component is an effective line smoother that can mitigate the high-frequency errors perpendicular to the magnetic field. We design a graph-based approach to find such a line smoother that is approximately perpendicular to the vector fields when the mesh does not align with the anisotropy. Finally, numerical experiments for several benchmark problems are presented, demonstrating the effectiveness and robustness of the proposed preconditioner when applied to Krylov iterative methods.

97 MATHEMATICS AND COMPUTING↗

Comparison of Numerical Methods for Modeling the Wave Field Effects Generated by Individual Wave Energy Converters and Multiple Converter Wave Farms

This numerical study compares the wave field generated by the spectral wave action balance code, SNL-SWAN, to the linear-wave boundary-element method (BEM) code, WAMIT. The objective of this study is to assess the performance of SNL-SWAN for modeling wave field effects produced by individual wave energy converters (WECs) and wave farms comprising multiple WECs by comparing results from SNL-SWAN with those produced by the BEM code WAMIT. BEM codes better model the physics of wave-body interactions and thus simulate a more accurate near-field wave field than spectral codes. In SNL-SWAN, the wave field’s energy extraction is modeled parametrically based on the WEC’s power curve. The comparison between SNL-SWAN and WAMIT is made over a range of incident wave conditions, including short-, medium-, and long-wavelength waves with various amounts of directional spreading, and for three WEC archetypes: a point absorber (PA), a pitching flap (PF) terminator, and a hinged raft (HR) attenuator. Individual WECs and wave farms of five WECs in various configuration were studied with qualitative comparisons made of wave height and spectra at specific locations, and quantitative comparisons of the wave fields over circular arcs around the WECs as a function of radial distance. Results from this numerical study demonstrate that in the near-field, the difference between SNL-SWAN and WAMIT is relatively large (between 20% and 50%), but in the far-field from the array the differences are minimal (between 1% and 5%). The resultant wave field generated by the two different numerical approaches is highly dependent on parameters such as: directional wave spreading, wave reflection or scattering, and the WEC’s power curve.

16 TIDAL AND WAVE POWER↗

Diagnostics of Magnetohydrodynamic Modes in the Interstellar Medium through Synchrotron Polarization Statistics

One of the biggest challenges in understanding magnetohydrodynamic (MHD) turbulence is identifying the plasma mode components from observational data. Previous studies on synchrotron polarization from the interstellar medium (ISM) suggest that the dominant MHD modes can be identified via statistics of Stokes parameters, which would be crucial for studying various ISM processes such as the scattering and acceleration of cosmic rays, star formation, and dynamo. In this paper, we present a numerical study of the synchrotron polarization analysis (SPA) method through systematic investigation of the statistical properties of the Stokes parameters. We derive the theoretical basis for our method from the fundamental statistics of MHD turbulence, recognizing that the projection of the MHD modes allows us to identify the modes dominating the energy fraction from synchrotron observations. Based on the discovery, we revise the SPA method using synthetic synchrotron polarization observations obtained from 3D ideal MHD simulations with a wide range of plasma parameters and driving mechanisms, and present a modified recipe for mode identification. We propose a classification criterion based on a new SPA+ fitting procedure, which allows us to distinguish between Alfvén mode and compressible/slow mode dominated turbulence. We further propose a new method to identify fast modes by analyzing the asymmetry of the SPA+ signature and establish a new asymmetry parameter to detect the presence of fast mode turbulence. Additionally, we confirm through numerical tests that the identification of the compressible and fast modes is not affected by Faraday rotation in both the emitting plasma and the foreground.

97 MATHEMATICS AND COMPUTING↗

Data-driven, structure-preserving approximations to entropy-based moment closures for kinetic equations

In this study, we present a data-driven approach for approximating entropy-based closures of moment systems from kinetic equations. The proposed closure learns the entropy function by fitting the map between the moments and the entropy of the moment system, and thus does not depend on the spacetime discretization of the moment system or specific problem configurations such as initial and boundary conditions. With convex and C 2 approximations, this data-driven closure inherits several structural properties from entropy-based closures, such as entropy dissipation, hyperbolicity, and H-Theorem. We construct convex approximations to the Maxwell–Boltzmann entropy using convex splines and neural networks, test them on the plane source benchmark problem for linear transport in slab geometry, and compare the results to the standard, entropy-based systems which solve a convex optimization problem to find the closure. Numerical results indicate that these data-driven closures provide accurate solutions in much less computation time than that required by the optimization routine.

97 MATHEMATICS AND COMPUTING↗

Mortar-based Cohesive Zone Model with Application to TRISO Particle Debonding

The U.S. Department of Energy’s Nuclear Energy Advanced Modeling and Simulation (NEAMS) program aims to develop predictive capabilities by applying computational methods to the analysis and design of advanced reactor and fuel cycle systems. This program has been providing engineering-scale support for the development of BISON, a high-fidelity and high-resolution fuel performance tool. This report outlines work towards the development of an integrated, mortar-based cohesive zone framework with mechanical contact. We model debonding of tri-structural isotropic (TRISO) layers using a mortar approach, extending the framework used for mechanical contact, using weighted quantities. A bilinear mixed mode traction approach, already used in Jiang et al. (2021), is applied analogously herein to model debonding between TRISO particle layers. The examples include the debonding of the inner pyrolytic carbon (IPyC) from the silicon carbide (SiC) layers, as well as partial and full debonding of the buffer from the IPyC layers. Both 2D and 3D examples are utilized to demonstrate the superior numerical performance of the new mortar approach, which allows for modeling arbitrarily meshed interfaces (i.e., non-matching discretizations).

11 - NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Magnetic field properties in non-axisymmetric divertors

Stellarator power plants require a plan for the removal of the particles and the heat that are exhausted across the plasma edge. Unless a flowing liquid metal can be used to carry the helium exhaust to places where it can be removed from the plasma chamber, the particle exhaust must be magnetically diverted into pumping chambers. Studies are required to determine how magnetic features relate to the required divertor properties, how these magnetic features can be produced, and how they can be controlled. General studies are clarified and simplified by the use of the magnetic field line Hamiltonian $ψ_p(ψ,θ,φ)$ and a vector $\vec{x}(ψ,θ,φ)$ that gives the point in space associated with each point in the $(ψ,θ,φ)$ canonical coordinates, a flux and two angles. The non-resonant Fourier terms in ψp can be removed by a canonical transformation, so only resonant Fourier terms can determine the field line properties in the plasma edge and divertor. This paper discusses the important divertor properties and explains how $ψ_p(ψ,θ,φ)$ and $\vec{x}(ψ,θ,φ)$ can be obtained numerically in a special form for any stellarator magnetic field, $\vec{B}(\vec{x})$. This form holds between an arbitrary magnetic surface and the chamber walls with the non-resonant terms eliminated. Studies based on variations in the terms in such derived field-line Hamiltonians can determine what magnetic features are mathematically possible and how they could be produced and controlled by the external magnetic field coils.

Physics↗

Theoretical Analysis of Fractional Viscoelastic Flow in Circular Pipes: General Solutions

Fractional calculus is a relatively old yet emerging field of mathematics with the widest range of engineering and biomedical applications. Despite being an incredibly powerful tool, it, however, requires promotion in the engineering community. Rheology is undoubtedly one of the fields where fractional calculus has become an integral part of cutting-edge research. There exists extensive literature on the theoretical, experimental, and numerical treatment of various fractional viscoelastic flows in constraint geometries. However, the general theoretical approach that unites several most commonly used models is missing. Here we present exact analytical solutions for fractional viscoelastic flow in a circular pipe. We find velocity profiles and shear stresses for fractional Maxwell, Kelvin–Voigt, Zener, Poynting–Thomson, and Burgers models. The dynamics of these quantities are studied with respect to normalized pipe radius, fractional orders, and elastic moduli ratio. Three different types of behavior are identified: monotonic increase, resonant, and aperiodic oscillations. The models developed are applicable in the widest material range and allow for the alteration of the balance between viscous and elastic properties of the materials.

Gritsenko, Dmitry (ORCID:0000000248181512)↗

Layer-Parallel Training of Deep Residual Neural Networks

Residual neural networks (ResNets) are a promising class of deep neural networks that have shown excellent performance for a number of learning tasks, e.g., image classification and recognition. Mathematically, ResNet architectures can be interpreted as forward Euler discretizations of a nonlinear initial value problem whose time-dependent control variables represent the weights of the neural network. Hence, training a ResNet can be cast as an optimal control problem of the associated dynamical system. For similar time-dependent optimal control problems arising in engineering applications, parallel-in-time methods have shown notable improvements in scalability. This paper demonstrates the use of those techniques for efficient and effective training of ResNets. The proposed algorithms replace the classical (sequential) forward and backward propagation through the network layers with a parallel nonlinear multigrid iteration applied to the layer domain. This adds a new dimension of parallelism across layers that is attractive when training very deep networks. From this basic idea, we derive multiple layer-parallel methods. The most efficient version employs a simultaneous optimization approach where updates to the network parameters are based on inexact gradient information in order to speed up the training process. Finally, using numerical examples from supervised classification, we demonstrate that the new approach achieves a training performance similar to that of traditional methods, but enables layer-parallelism and thus provides speedup over layer-serial methods through greater concurrency.

97 MATHEMATICS AND COMPUTING↗

TNet: A Model-Constrained Tikhonov Network Approach for Inverse Problems

Deep learning (DL), in particular deep neural networks, by default is purely data-driven and in general does not require physics. This is the strength of DL but also one of its key limitations when applied to science and engineering problems in which underlying physical properties—such as stability, conservation, and positivity—and accuracy are required. DL methods in their original forms are often not capable of respecting the underlying mathematical models or achieving desired accuracy even in big-data regimes. On the other hand, many data-driven science and engineering problems, such as inverse problems, typically have limited experimental or observational data, and DL would overfit the data in this case. Leveraging information encoded in the underlying mathematical models, we argue, not only compensates for missing information in low data regimes but also provides opportunities to equip DL methods with the underlying physics, hence promoting better generalization. This paper develops a model-constrained DL approach and its variant TNet—a Tikhonov neural network—which are capable of learning not only information hidden in the training data but also in the underlying mathematical models to solve inverse problems governed by partial differential equations in low data regimes. We provide the constructions and some theoretical results for the proposed approaches for both linear and nonlinear inverse problems. Since TNet is designed to learn inverse solutions with Tikhonov regularization, it is interpretable: in fact it recovers Tikhonov solutions for linear cases while potentially approximating Tikhonov solutions for nonlinear inverse problems. We also prove that data randomization can enhance not only the smoothness of the networks but also their generalizations. Comprehensive numerical results confirm the theoretical findings and show that with even as little as 1 training data sample for one-dimensional (1D) deconvolution, 5 for an inverse 2D heat conductivity problem, 100 for inverse initial conditions for a time-dependent 2D Burgers’s equation, and 50 for inverse initial conditions for 2D Navier–Stokes equations, TNet solutions can be as accurate as Tikhonov solutions while being several orders of magnitude faster. Furthermore, this is possible owing to the model-constrained term, replications, and randomization.

97 MATHEMATICS AND COMPUTING↗

Dynamics of Intra-Cell Thermal Front Propagation in Lithium-Ion Battery Safety Issues

Thermal runaway (TR), a critical failure mode in lithium-ion batteries (LIBs), poses significant safety risks and hinders wider application of LIBs. TR typically begins at a localized heat source and spreads across the cell. Understanding thermal front propagation (TFP) characteristics, such as front and velocity, is crucial for assessing energy release and temperature distribution for battery hazardous estimation. Recent studies assume that TR within cells propagates at a near-constant velocity, based on the reaction kinetics and thermal properties. Here, in this study, an intra-battery TR model is further proposed and it indicates that TFP velocity stabilizes when the front is distanced from the heat source. Theoretical estimates for propagation velocity and front are developed and validated through numerical simulations and experimental tests from the NREL Battery Failure Databank. The energy release rate during TFP and the impact of preheating based on a point heat source are explored. This work clarifies the long-standing clouds of the thermal font propagation behaviors within the single cell, highlights the power and beauty of mathematics modeling to describe the complicated thermal behaviors, and provides important guidelines for thermal hazardous understanding for next-generation batteries.

25 ENERGY STORAGE↗

Parallel performance of algebraic multigrid domain decomposition

Algebraic multigrid (AMG) is a widely used scalable solver and preconditioner for large-scale linear systems resulting from the discretization of a wide class of elliptic PDEs. While AMG has optimal computational complexity, the cost of communication has become a significant bottleneck that limits its scalability as processor counts continue to grow on modern machines. This article examines the design, implementation, and parallel performance of a novel algorithm, algebraic multigrid domain decomposition (AMG-DD), designed specifically to limit communication. The goal of AMG-DD is to provide a low-communication alternative to standard AMG V-cycles by trading some additional computational overhead for a significant reduction in communication cost. Numerical results show that AMG-DD achieves superior accuracy per communication cost compared with AMG, and speedup over AMG is demonstrated on a large GPU cluster.

97 MATHEMATICS AND COMPUTING↗