Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Mathematical 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 181 records · Page 10

A second-order-in-time, explicit approach addressing the redundancy in the low-Mach, variable-density Navier-Stokes equations

A novel algorithm for explicit temporal discretization of the variable-density, low-Mach Navier-Stokes equations is presented here in this study. Recognizing there is a redundancy between the mass conservation equation, the equation of state, and the transport equation(s) for the scalar(s) which characterize the thermochemical state, and that it destabilizes explicit methods, we demonstrate how to analytically eliminate the redundancy and propose an iterative scheme to solve the resulting transformed scalar equations. The method obtains second-order accuracy in time regardless of the number of iterations, so one can terminate this subproblem once stability is achieved. Hence, flows with larger density ratios can be simulated while still retaining the efficiency, low cost, and parallelizability of an explicit scheme. The temporal discretization algorithm is used within a pseudospectral direct numerical simulation which extends the method of Kim, Moin, and Moser for incompressible flow to the variable-density, low-Mach setting, where we demonstrate stability for density ratios up to ~25.7.

97 MATHEMATICS AND COMPUTING↗

Multiphysics Degradation Modeling of Energy Storage Materials via RKPM with a Neural Network-Enhancement

In energy storage materials, strong electrochemical-mechanical coupling and highly anisotropic material properties contribute to the formation and propagation of micro-cracking during charge/discharge cycling, resulting in reduced performance and service life. A coupled electro-chemo-mechanical reproducing kernel particle method (RKPM) formulation is developed, and a patch-test is formulated to certify optimal convergence of the proposed RKPM method for the coupled physics system. With microstructural images supplied by the National Renewable Energy Laboratory (NREL), pixel-based model construction by RKPM is then used to represent the complex material microstructures for modeling the coupled physics of these systems. Further, a neural network-enhanced reproducing kernel particle method (NN-RKPM) [1, 2] is introduced to effectively model damage and crack propagation in the material microstructures; the location, orientation, and solution transition near a localization are automatically captured by superimposed block-level NN optimizations. This NN enrichment approach allows for effective modeling of localizations via a fixed background discretization, relieving tedious efforts for adaptive refinement in traditional mesh-based methods. Applications to the heterogeneous microstructures of Li-ion battery cathodes will be presented to demonstrate the effectiveness of the proposed methods. Reference: [1] Baek, J., Chen, J. S., Susuki, K., "Neural Network enhanced Reproducing Kernel Particle Method for Modeling Localizations," International Journal for Numerical Methods in Engineering, Vol. 123, pp 4422-4454, https://doi.org/10.1002/nme.7040, 2022. [2] Baek, J., Chen, J. S., "A Neural Network-Based Enrichment of Reproducing Kernel Approximation for Modeling Brittle Fracture", Computer Methods in Applied Mechanics and Engineering Vol. 410, 116590, 2024.

electro-chemo-mechanical coupling↗

Image-Based Failure Assessment of Li-Ion Batteries

In energy storage materials, strong electrochemical-mechanical coupling and highly anisotropic material properties contribute to the formation and propagation of micro-cracking during charge/discharge cycling, resulting in reduced performance and service life. In this work, a digital twin is created to investigate the performance of a heterogeneous Li-ion battery cathode and simulate degradation accumulation. Pixel-based model construction is used to represent the complex material geometries from microstructural images supplied by the National Renewable Energy Laboratory (NREL). Because of the expected large deformation and crack opening, the reproducing kernel particle method (RKPM), a meshfree method with discretization at the image pixels, is used to approximate the field variables: electrostatic potential, concentration, and displacement. An interface modified reproducing kernel (IM-RK) is constructed by scaling a smooth kernel function with an interface-distance function to achieve strategic discontinuity types (i.e. weak discontinuities for strain discontinuities and strong discontinuities for cracks) and alleviate Gibbs oscillations near these transition zones. Applications to the heterogeneous microstructures of Li-ion battery cathodes will be presented to demonstrate the effectiveness of the proposed methods. IM-RK is additionally used to inform how crack evolution in turn affects the coupled electro-chemo-mechanical behavior of the Li-ion battery cathode.

image-based modeling↗

Order conditions for nonlinearly partitioned Runge-Kutta methods

Recently, a new class of nonlinearly partitioned Runge–Kutta (NPRK) methods was proposed for nonlinearly partitioned systems of autonomous ordinary differential equations y' = F(y, y). The target class of problems are those in which different scales, stiffnesses, or physics are coupled in a nonlinear way, wherein the desired partition cannot be written in a classical additive or component-wise fashion. Here we use a rooted-tree analysis to derive full-order conditions for NPRKM methods, where M denotes the number of nonlinear partitions. Due to the nonlinear coupling and thereby the mixed product differentials, it turns out that the standard node-colored rooted tree analysis used in analyzing ODE integrators does not naturally apply. Instead we develop a new edge-colored rooted-tree framework to address the nonlinear coupling. The resulting order conditions are enumerated, are provided directly for up to fourth order with M = 2 and third order with M = 3, and are related to existing order conditions of additive and partitioned RK methods. We conclude with an example that shows how the nonlinear order conditions can be used to obtain an embedded estimate of the state-dependent nonlinear coupling strength in a dynamical system.

97 MATHEMATICS AND COMPUTING↗

Towards Automated Reasoning Chains for Verification of LLM-Generated Scientific Code

With the rise of Large Language Model (LLM) generated code, including in domains like scientific computing, ensuring not only syntactical, but also mathematical correctness, has become a critical task. Traditional formal methods approaches often struggle with the ambiguity of floating-point code, and full symbolic execution is extremely costly and limited. We propose a chain-of-reasoning approach that iteratively lifts basic semantics from code into the SPIRAL system and then establishes numerical equivalency to the desired mathematical operation. Here, we leverage the ample mathematical knowledge already formalized in SPIRAL to enable the system to recognize not just different implementations of the same algorithm but fully separate approaches to solving the given problem. The chain establishes tight error bounds on the output of given code with respect to the true continuous solution it approximates, quantifying all sources of error. We demonstrate this approach by establishing the correctness of a pseudospectral solver for a simple 1-dimensional Poisson problem.

Oschatz, Quentin [Carnegie Mellon University,Pitts↗

Summary Report Of The FY25 Reactor Physics Verification And Validation Exercises In The Advanced Reactor Technologies - Gas-cooled Reactor Program

Valdiation and verification of numerical tools is critical for ensuring reasonable predictions for design scoping, licensing, and safety analsyis. In this report, two reactor physics verification and validation exercises are presented. The first of these exercises focuses on burnup analysis with data from the Advanced Gas Reactor (AGR) program. Simulations are performed with Monte Carlo N-Particle (MCNP) and are compared with the experimental measurements for the AGR 1 and 2 experiments that utilize both UCO and UO2 fuel. The second exercises utilizes data from the HTR-Proteus experiments to perform reactor physics validation. Specifications of the experimental facility are provdied, along with a demonstration of initial modeling efforts in Serpent for one of the determistic packing experiments. Both cases are part of the Generation-IV international forum (GIF) Very High-Temperature Reactor (VHTR) Computational Methods, Validation, and Benchmarking (CMVB) program, an international collaborative organization dedicated to the verification and validation of High-Temperature Gas-Cooled Reactor (HTGR) analysis. Participation in the CMVB allows the US Department of Energy (DOE) to leverage these existing validation activities to provide extra value through benchmarking activities with other CMVB members.

and Benchmarking (CMVB) program↗

Coupling Approaches with Non-matching Grids for Classical Linear Elasticity and Bond-based Peridynamic Models in 1D

Local-nonlocal coupling approaches provide a means to combine the computational efficiency of local models and the accuracy of nonlocal models. To facilitate the coupling of the two models, non-matching grids are often desirable as nonlocal grids usually require a finer resolution than local grids. In that case, it is often convenient to resort to interpolation operators so that models can exchange information in the overlap regions when nodes from the two grids do not coincide. This paper studies three existing coupling approaches, namely 1) a method that enforces matching displacements in an overlap region, 2) a variant that enforces a constraint on the stresses instead, and 3) a method that considers a variable horizon in the vicinity of the interfaces. Further, the effect of the interpolation order and of the grid ratio on the performance of the three coupling methods with non-matching grids is carefully studied on one-dimensional examples using polynomial manufactured solutions. The numerical results show that the degree of the interpolants should be chosen with care to avoid introducing additional modeling errors, or simply minimize these errors, in the coupling approach.

97 MATHEMATICS AND COMPUTING↗

Computational Methods for Modeling Electrospray Microdroplet Chemistry for Improved Quantitative Mass Spectrometry

This project aimed at enhancing the quantitative analysis capabilities of electrospray ionization mass spectrometry (ESI-MS) by developing advanced computational methods. The primary focus was to integrate continuum and molecular dynamics simulations to study the behavior of microdroplets in the ESI process, from formation to evaporation. Through this research, we sought to bridge significant length and time scales to provide a comprehensive understanding of how analyte concentrations evolve from bulk solutions into gas-phase ions. This understanding is crucial for addressing challenges such as ionization efficiency, solvent effects, and ion suppression, which currently limit the accuracy of quantitative ESI-MS.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Mathematical Morphological Filtering with a Self-Adaptive Reconstruction Technique and Application to Local Seismic Data

Recorded seismic data are generally contaminated by noise from different sources, which masks the signals of interest. In the seismology community, frequency filtering (FF) is the standard method for noise suppression. However, when the signal of interest and noise share the same frequency band, the latter cannot be filtered out without infringing on the former. We implemented a noise suppression approach based on the mathematical morphology theorem. The method involves compound operations of dilation and erosion using structuring elements of varying lengths and decomposes an input noisy waveform into several time functions with differing characteristics. Further, the filtered waveform is constructed from the time functions using a self-adaptive reconstruction technique. Application to a data set of >4700 local waveforms suggests that the implemented mathematical morphological filtering (MMF) approach is efficient for data with low signal-to-noise ratio (SNR) and significantly outperforms FF in that SNR range. For most of the dataset, FF, machine learning (ML) denoising, and continuous wavelet transform (CWT) thresholding result in higher SNR values compared with the MMF method. However, for ~42% of the waveforms, MMF outperforms FF, and the SNR gain achieved with MMF is as large as ~23 dB. Compared to ML denoising and CWT thresholding, this proportion drops to only ~10%–14%. Our results suggests that in an operational setting, MMF cannot replace the other noise suppression methods; however, signal detection can be improved if MMF is used to supplement them in some scenarios. MMF could help detect signals in problematic low-SNR data, which are currently being missed particularly when using FF alone.

58 GEOSCIENCES↗

Modifying the Asynchronous Jacobi Method for Data Corruption Resilience

Moving scientific computation from high-performance computing (HPC) and cloud computing (CC) environments to devices on the edge, i.e., physically near instruments of interest, has received tremendous interest in recent years. Such edge computing environments can operate on data in situ, offering enticing benefits over data aggregation to HPC and CC facilities that include avoiding costs of transmission, increased data privacy, and real-time data analysis. Because of the inherent unreliability of edge computing environments, new fault-tolerant approaches must be developed before the benefits of edge computing can be realized. Motivated by algorithm-based fault tolerance, a variant of the asynchronous Jacobi (ASJ) method is developed that achieves resilience to data corruption by rejecting solution approximations from neighbor devices according to a bound derived from convergence theory. Numerical results on a two-dimensional Poisson problem show that the new rejection criterion, along with a novel approximation to the shortest path length on which the criterion depends, restores convergence for the ASJ variant in the presence of certain types data corruption. Numerical results are obtained for when the singular values in the analytic bound are approximated. Additional linear systems are also explored, one with a more dense sparsity pattern and one that includes advection. All results indicate that successful resilience to data corruption depends on whether the bound tightens fast enough to reject corrupted data before the iteration evolution deviates significantly from that predicted by the convergence theory defining the bound. This observation generalizes to future work on algorithm-based fault tolerance for other asynchronous algorithms, including upcoming approaches that leverage Krylov subspaces.

97 MATHEMATICS AND COMPUTING↗

Quantum annealing for combinatorial optimization: a benchmarking study

Quantum annealing (QA) has the potential to significantly improve solution quality and reduce time complexity in solving combinatorial optimization problems compared to classical optimization methods. However, due to the limited number of qubits and their connectivity, the QA hardware did not show such an advantage over classical methods in past benchmarking studies. Recent advancements in QA with more than 5000 qubits, enhanced qubit connectivity, and the hybrid architecture promise to realize the quantum advantage. Here, we use a quantum annealer with state-of-the-art techniques and benchmark its performance against classical solvers. To compare their performance, we solve over 50 optimization problem instances represented by large and dense Hamiltonian matrices using quantum and classical solvers. The results demonstrate that a state-of-the-art quantum solver has higher accuracy (~0.013%) and a significantly faster problem-solving time (~6561×) than the best classical solver. Our results highlight the advantages of leveraging QA over classical counterparts, particularly in hybrid configurations, for achieving high accuracy and substantially reduced problem solving time in large-scale real-world optimization problems.

97 MATHEMATICS AND COMPUTING↗

Transient Multiphysics Simulations with Pin Power Reconstruction in the Griffin Reactor Physics Code

This work introduces the pin power reconstruction capability available in the Griffin reactor physics code. This capability is implemented in an unstructured mesh framework, and the methods introduced are applied to the 2D SIMBA reactor core, which has assemblies and pins arranged in a hexagonal lattice. Since this reactor has a non-Cartesian geometry and also operates in the thermal spectrum, a general approach to pin power reconstruction is adopted, where SPH-based equivalence is leveraged to preserve assembly-wise reaction rates, while computing full-core form functions to preserve pin-wise fission production rates within the fuel pins of the reactor core. In a 2D microreactor benchmark problem, this pin power reconstruction approach was shown to reproduce pin powers compared to the Serpent2 Monte Carlo code for fixed temperature conditions and control drum rotation angles, yielding a core-wide RMS error level of 0.6\% and a maximum absolute pin error of 2.3\%. In addition, a tabulated library of multigroup cross sections, SPH factors, and form functions was generated to demonstrate the applicability of pin power reconstruction to a thermal feedback problem. Finally, a control drum transient was successfully simulated, showcasing the application of pin power reconstruction in a transient multiphysics feedback problem.

97 - MATHEMATICS AND COMPUTING↗

A method for bounding high-order finite element functions: Applications to mesh validity and bounds-preserving limiters

We introduce a novel method for bounding high-order multi-dimensional polynomials in finite element approximations. The method involves precomputing optimal piecewise-linear bounding boxes for polynomial basis functions, which can then be used to locally bound any combination of these basis functions. This approach can be applied to any element/basis type at any approximation order, can provide local (i.e., subcell) extremum bounds to a desired level of accuracy, and can be evaluated efficiently on-the-fly in simulations. Furthermore, we show that this approach generally yields more accurate bounds in comparison to traditional methods based on convex hull properties (e.g., Bernstein polynomials). Furthermore, the efficacy of this technique is shown in applications such as mesh validity checks and optimization for high-order curved meshes, where positivity of the element Jacobian determinant can be ensured throughout the entire element, and continuously bounds-preserving limiters for hyperbolic systems, which can enforce maximum principle bounds across the entire solution polynomial.

Bounding box↗

Essential barrier height and a probabilistic approach in characterizing potential landscape

In this work we propose a probabilistic approach to investigate the shape of landscapes of multi-dimensional potential functions. Under a suitable coupling scheme, two copies of the overdamped Langevin dynamics associated with the potential function are coupled, and the coupling times are collected. Assuming a set of intuitive yet technically challenging conditions on the coupling scheme, it is shown that the tail distributions of the coupling times exhibit qualitatively different dependencies on the noise magnitude for single-well versus multi-well potential functions. More specifically, for convex single-well potentials, the negative tail exponent of the coupling time distribution is uniformly bounded away from zero by the convexity parameter and is independent of the noise magnitude. In contrast, for multi-well potentials, the negative tail exponent decreases exponentially as the noise vanishes, with the decay rate governed by the essential barrier height, a quantity introduced in this paper to characterize the non-convex nature of the potential function. Numerical investigations are conducted for a variety of examples, including the Rosenbrock function, interacting particle systems, and loss functions arising in artificial neural networks. These examples not only illustrate the theoretical results in various contexts but also provide crucial numerical validation of the conjectured assumptions, which are essential to the theoretical analysis yet lie beyond the reach of standard technical tools.

97 MATHEMATICS AND COMPUTING↗

E(n)-Equivariant cartesian tensor message passing interatomic potential

Machine learning potential (MLP) has been a popular topic in recent years for its capability to replace expensive first-principles calculations in some large systems. Meanwhile, message passing networks have gained significant attention due to their remarkable accuracy, and a wave of message passing networks based on Cartesian coordinates has emerged. However, the information of the node in these models is usually limited to scalars, and vectors. In this work, we propose High-order Tensor message Passing interatomic Potential (HotPP), an E(n) equivariant message passing neural network that extends the node embedding and message to an arbitrary order tensor. By performing some basic equivariant operations, high order tensors can be coupled very simply and thus the model can make direct predictions of high-order tensors such as dipole moments and polarizabilities without any modifications. The tests in several datasets show that HotPP not only achieves high accuracy in predicting target properties, but also successfully performs tasks such as calculating phonon spectra, infrared spectra, and Raman spectra, demonstrating its potential as a tool for future research.

97 MATHEMATICS AND COMPUTING↗

Galerkin formulation of path integrals in lattice field theory

We present a mathematical framework for Galerkin formulations of path integrals in lattice field theory. The framework is based on using the degrees of freedom (DOFs) associated to a Galerkin discretization as the fundamental lattice variables. We formulate standard concepts in lattice field theory, such as the partition function and correlation functions, in terms of the DOFs. For example, using continuous finite element spaces, we show that the two-point spatial correlation function can be defined between any two points on the domain (as opposed to at just lattice sites) and furthermore, this two-point function satisfies a weak propagator (or Green’s function) identity, in analogy to the continuum case, as well as a convergence estimate obtained from the standard finite element techniques. Furthermore, this framework leads naturally to higher-order formulations of lattice field theories by considering higher-order finite element spaces for the Galerkin discretization. We consider analytical and numerical examples of scalar field theory to investigate how increasing the order of piecewise polynomial finite element spaces affect the approximation of lattice observables. Finally, we sketch an outline of this Galerkin framework in the context of gauge field theories.

97 MATHEMATICS AND COMPUTING↗

Adaptive Power Flow Approximations With Second-Order Sensitivity Insights

The power flow equations are fundamental to power system planning, analysis, and control. However, the inherent non-linearity and non-convexity of these equations present formidable obstacles in problem-solving processes. To mitigate these challenges, recent research has proposed adaptive power flow linearizations that aim to achieve accuracy over wide operating ranges. The accuracy of these approximations inherently depends on the curvature of the power flow equations within these ranges, which necessitates considering second-order sensitivities. In this paper, we leverage second-order sensitivities to both analyze and improve power flow approximations. We evaluate the curvature across broad operational ranges and subsequently utilize this information to inform the computation of various sample-based power flow approximation techniques. Additionally, we leverage second-order sensitivities to guide the development of rational approximations that yield linear constraints in optimization problems. In conclusion, this approach is extended to enhance accuracy beyond the limitations of linear functions across varied operational scenarios.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Quantifying the Temperature Dependence of the Multi-Species, Multi-Reaction Model: Part II. Estimation of Entropy Coefficient for Meso-Carbon Micro-Bead Graphite

In Part 1 of this paper, the temperature impact on the Multi-Species, Multi Reaction (MSMR) model was studied. This was accomplished by acquiring data from slow rate lithiation and delithiation of a meso-carbon micro-bead (MCMB) graphite. Through this analysis, the temperature impact on the total fraction of available host sites in a particular MSMR gallery (X j ), the impact on the reference potential (U$^o_j$), and the impact on the parameter detailing the deviation from Nernstian behavior (ω j ) was determined. Here, the intercalation material is discussed, compared to traditional methods of acquiring the entropy coefficient, and comparison is made to previous mathematical estimates. Some of the challenges in using temperature dependent constant rate charge and discharge data as compared to the potentiodynamic entropy coefficient calculation method are also discussed, and a recommendation for future applications is proposed.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗