Search NASA⌕ Search

SEARCH · Search NASA

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 325 records · Page 18
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

A Particle-in-cell Method for Plasmas with A Generalized Momentum Formulation, Part III: A family of Gauge Conserving Methods

In this paper, we introduce a new family of spatially co-located field solvers for particle-in-cell applications which evolve the potential formulation of Maxwell’s equations under the Lorenz gauge. Our recent work [2] introduced the concept of time-consistency, which connects charge conservation to the preservation of the gauge at the semi-discrete level. It will be shown that there exists a large family of time discretizations which satisfy this property. Additionally, it will be further shown that for large classes of time marching methods, the satisfaction of the gauge condition automatically implies the satisfaction of Gauss’s law for electricity, with the potential formulation ensuring that that Gauss’s law for magnetism is satisfied by definition. We focus on popular time marching methods including centered differences, backward differences, and diagonally-implicit Runge-Kutta methods, which are coupled to a spectral discretization in space. We demonstrate the theory by testing the methods on a relativistic Weibel instability and a drifting cloud of electrons.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Highly accelerated life testing (HALT): A review from a statistical perspective

Despite its use in one form or another for at least four decades, HALT and related techniques [e.g., highly accelerated-stress screening (HASS) and stress audits (HASA)] are not well understood within the statistical community and remain controversial. This largely reflects a conflict in motivation between engineers, testing under harsh conditions to discover and eliminate failure modes, and statisticians, taking a more cautious approach to develop quantitative estimates of parameters such as mean time between failures (MTBF). Here, this review article will clarify HALT concepts and methods and explain where it fits within the universe of methods that involve the application of accelerating factors to compress the time required to evaluate or enhance product reliability. A major distinction is between methods such as HALT, a high-stress test-analyze-fix-test iterative process directed at improving reliability by discovering and fixing weak points in a design, and quantitative accelerated life testing (QALT), whose goal is the estimation of product life for a fixed design. We discuss methods such as physics of failure that offer some hope of bridging the gap between the qualitative nature of HALT, and purely quantitative statistical methods. We present a variety of engineering applications of HALT including metal fatigue, piping and pressure vessels, structural damage, radiation damage, and rotating machinery. We also discuss potential synergies between HALT and QALT, such as rapid identification, through HALT, of failure modes requiring quantitative analysis. For further study, extensive references to the applicable literature are provided as well as an appendix that describes related methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Decomposing causality into its synergistic, unique, and redundant components

Causality lies at the heart of scientific inquiry, serving as the fundamental basis for understanding interactions among variables in physical systems. Despite its central role, current methods for causal inference face significant challenges due to nonlinear dependencies, stochastic interactions, self-causation, collider effects, and influences from exogenous factors, among others. While existing methods can effectively address some of these challenges, no single approach has successfully integrated all these aspects. Here, we address these challenges with SURD: Synergistic-Unique-Redundant Decomposition of causality. SURD quantifies causality as the increments of redundant, unique, and synergistic information gained about future events from past observations. The formulation is non-intrusive and applicable to both computational and experimental investigations, even when samples are scarce. We benchmark SURD in scenarios that pose significant challenges for causal inference and demonstrate that it offers a more reliable quantification of causality compared to previous methods.

applied mathematics↗
DOE OSTI2025

Data-Conforming Data-Driven Control: Avoiding Premature Generalizations Beyond Data

Data-driven and adaptive control approaches face the problem of introducing sudden distributional shifts beyond the distribution of data encountered during learning. Therefore, they are prone to invalidating the very assumptions used in their own construction. This is due to the linearity of the underlying system, inherently assumed and formulated in most data-driven control approaches, which may falsely generalize the behavior of the system beyond the behavior experienced in the data. This article seeks to mitigate these problems by enforcing consistency of the newly designed closed-loop systems with data and slowing down any distributional shifts in the joint state-input space. This is achieved through incorporating affine regularization terms and linear matrix inequality constraints to data-driven approaches, resulting in convex semi-definite programs that can be efficiently solved by standard software packages. We discuss the optimality conditions of these programs and then conclude this article with a numerical example that further highlights the problem of premature generalization beyond data and shows the effectiveness of our proposed approaches in enhancing the safety of data-driven control methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Mechanistic within-host mathematical model of inhalational anthrax

We present a mathematical model of the dynamics of Bacillus anthracis bacteria within the lymph nodes and blood of a host, following inhalation of an initial dose of spores. We also incorporate the dynamics of protective antigen, which is the binding component of the anthrax toxin produced by the bacteria. The model offers a mechanistic description of the early infection dynamics of inhalational anthrax, while its stochastic nature allows us to study the probabilities of different outcomes (for example, how likely it is that the infection will be cleared for a given inhaled dose of spores) in order to explain dose-response data for inhalational anthrax. The model is calibrated via a Bayesian approach, using in vivo data from New Zealand white rabbit and guinea pig infection studies, enabling within-host parameters to be estimated. We also leverage incubation-period data from the Sverdlovsk 1979 anthrax outbreak to show that the model can accurately describe human time-to-symptoms data under reasonable parameter regimes. Finally, we derive a simple approximate formula for the probability of symptom onset before time t, assuming that the number of inhaled spores has a Poisson distribution.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2024

Computational shock formation & development: An arbitrary Lagrangian-Eulerian characteristics approach [Slides]

We propose a new computational shock formation-development algorithm. We use a “good” geometry adapted to the evolving solution, along with a good set of variables defined in this geometry. We are able to: (1) Accurately capture the pre-shock; (2) Track distinguished characteristics and capture weak discontinuities; (3) Approximate solutions to classical Riemann problems; and (4) Accurately solve challenging problems for which standard methods fail.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Dataset for "Large Language Models as molecular design engines"

This dataset contains data and results associated with the paper "Large Language Models as molecular design engines" The paper investigates the use of large language models, specifically Claude 3 Opus, for generating and analyzing chemical structures based on various prompts from A-H (as mentioned in the manuscript), and guided design related to electron-withdrawing groups (EWG), electron-donating groups (EDG).

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2026

Algebraic Multigrid with Filtering: An Efficient Preconditioner for Interior Point Methods in Large-Scale Contact Mechanics Optimization

Large-scale contact mechanics simulations are crucial in many engineering fields such as structural design and manufacturing. In the frictionless case, contact can be modeled by minimizing an energy functional; however, these problems are often nonlinear, nonconvex, and increasingly difficult to solve as mesh resolution increases. In this work, we employ a Newton-based interior-point (IP) filter line-search method, an effective approach for large-scale constrained optimization. While this method converges rapidly, each iteration requires solving a large saddle-point linear system that becomes ill-conditioned as the optimization process converges, largely due to IP treatment of the contact constraints. Such ill-conditioning can hinder solver scalability and increase iteration counts with mesh refinement. Here, to address this, we introduce a novel preconditioner, algebraic multigrid with filtering (AMGF), tailored to the Schur complement of the saddle-point system. Building on the classical AMG solver, commonly used for elasticity, we augment it with a specialized subspace correction that filters near null space components introduced by contact interface constraints. Through theoretical analysis and numerical experiments on a range of linear and nonlinear contact problems, we demonstrate that the proposed solver achieves mesh independent convergence and maintains robustness against the ill-conditioning that notoriously plagues IP methods. These results indicate that AMGF makes contact mechanics simulations more tractable and broadens the applicability of Newton-based IP methods in challenging engineering scenarios. More broadly, AMGF is well suited for problems, optimization or otherwise, where solver performance is limited by a low-dimensional subspace, such as those arising from localized constraints, interface conditions, or model heterogeneities. This makes the method widely applicable beyond contact mechanics and constrained optimization.

Mathematics and Computing↗
DOE OSTI2026

A stiff order condition theory for Runge–Kutta methods applied to semilinear ODEs

Classical convergence theory of Runge–Kutta methods assumes that the time step is small relative to the Lipschitz constant of the ordinary differential equation (ODE). For stiff problems, that assumption is often violated, and a problematic degradation in accuracy, known as order reduction, can arise. Methods with high stage order, e.g., Gauss–Legendre and Radau, are known to avoid order reduction, but they must be fully implicit. For the broad class of semilinear ODEs, which consist of a stiff linear term and non-stiff nonlinear term, we show that weaker conditions suffice. Here, our new semilinear order conditions are formulated in terms of orthogonality relations and can be enumerated by rooted trees. Finally, we prove global error bounds that hold uniformly with respect to stiffness of the linear term.

Mathematics and Computing↗
DOE OSTI2024

A Solution Method for the Filtered Lifting Line Theory

The filtered lifting line theory presents a continuous form of the inviscid momentum equations of flow over a lifting device, such as a wing or rotor blade, using body forces without mathematical singularities. This theory is also consistent with an actuator line representation of a lifting device. In this work, we present a reformulation of the equations in terms of the local flow angle along the line, which allows solving the stand-alone equations using multivariate root-finding algorithms. This approach can be used to obtain a fast, computationally inexpensive solution of the loading distribution along a wing without the need to perform computational fluid dynamic simulations. We study the requirements in terms of resolution in the spanwise direction and establish the criteria for spacing and minimum amount of points required along the blade to obtain converged solutions. The solutions are compared to results from large-eddy simulations, and we observed excellent agreement with less than a percent difference in quantities along the blade between the methods.

17 WIND ENERGY↗
DOE OSTI2025

Numerical simulations of liquid jetting with solid inclusions

The dynamics of finite-sized particles in fluids, and their influence on the overall flow, are of great interest across several industrial, environmental, and medical fields. In the context of inkjet printing, the presence of solid inclusions can be either intentional, as in additive manufacturing, or unintentional, as in standard printing processes. These inclusions can strongly impact the jetting process, causing effects such as jet asymmetry, bubble entrapment, and the formation of satellite droplets. Understanding and controlling particle behavior is therefore essential, particularly to predict how and when particles are ejected over multiple jetting cycles. It is therefore critical to develop reliable models that allow for a deeper understanding of the complex interplay between particle and fluid during the whole printing process. To address this, we present a tailored implementation of the Color-Gradient multicomponent Lattice Boltzmann Method for fully resolved three-dimensional (3D) simulations of multicycle liquid jetting with particles. Our method supports realistic parameter settings aligned with industrial inkjet systems, and we provide both qualitative and quantitative validation against experimental data. Additionally, we introduce a simplified model based on the Stokes drag law, in which solid particles are represented as point particles and do not influence the fluid flow. Despite this limitation, the model offers a computationally efficient means to explore the vast parameter space typically encountered in industrial applications, allowing, e.g., identifying critical ejection regions and estimating the number of cycles required for particle release. These qualitative insights are valuable for guiding and complement fully two-way coupled simulations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Application of physics-informed neural networks (PINNs) solution to coupled thermal and hydraulic processes in silty sands

Abstract The accurate modeling of water and heat transport in soils is crucial for both geo-environmental and geothermal engineering. Traditional modeling methods are problematic because they require well-defined boundaries and initial conditions. Recently, physics-informed neural networks (PINNs), which incorporate partial differential equations (PDEs) to solve forward and inverse problems, have attracted increasing attention in machine learning research. In this study, we applied PINNs to tackle hydraulic and thermal transport coupling forward problems in silty sands. A fully connected deep neural network was utilized for training. This neural network model leverages automatic differentiation to apply the governing equations as constraints, based on the mathematical approximations established by the neural network itself. We conducted forward problems and compared the solutions derived from PINNs with those from Finite Element Method (FEM) simulations. The forward problem results demonstrate the PINNs model’s capability in predicting hydraulic transport, heat transport, and thermal–hydraulic coupling in silty sands under various boundary conditions. The PINNs exhibited great performance in simulating the thermal–hydraulic coupling problem. The accuracy of the PINNs solutions shows its potential for simulation in geotechnical engineering.

Feng, Yuan↗
DOE OSTI2024

Anti-symmetric and positivity preserving formulation of a spectral method for Vlasov-Poisson equations

We analyze the anti-symmetric properties of a spectral discretization for the one-dimensional Vlasov-Poisson equations. The discretization is based on a spectral expansion in velocity with the symmetrically weighted Hermite basis functions, central finite differencing in space, and an implicit Runge Kutta integrator in time. The proposed discretization preserves the anti-symmetric structure of the advection operator in the Vlasov equation, resulting in a stable numerical method. We apply such discretization to two formulations: the canonical Vlasov-Poisson equations and their continuously transformed square-root representation. The latter preserves the positivity of the particle distribution function. We derive analytically the conservation properties of both formulations, including particle number, momentum, and energy, which are verified numerically on the following benchmark problems: manufactured solution, linear and nonlinear Landau damping, two-stream instability, bump-on-tail instability, and ion-acoustic wave.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2026

Kernel Enriched Meshfree Multiphysics Degradation Modeling of Energy Storage Materials

Energy storage materials exhibit strong electro-chemo-mechanical coupling and highly anisotropic material properties, contributing to the formation and propagation of micro-cracking during charge/discharge cycling and ultimately diminishing performance and service life. With microstructural images supplied by the National Laboratory of the Rockies (NLR), pixel-based meshfree model construction by the reproducing kernel particle method (RKPM) is used to represent the complex material microstructures that dictate the coupled physics of these systems. Traditional electro-chemo-mechanical models rely on mesh-based finite element methods, which can lead to difficulties in meshing such complex geometries and capturing crack propagation due to mesh dependency. The first kernel enrichment discussed will be the interface modified reproducing kernel (IM-RK) [1, 2], 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. The IM-RK is especially useful for areas in which a known discontinuity-type is expected a priori. The second kernel enrichment to be discussed is a neural network-enhanced reproducing kernel (NN-RK) [3, 4], which is introduced to effectively model non-obvious 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. NN-RK is additionally used to inform how crack opening and closure in turn affect the electro-chemo-mechanical responses in the material microstructure. References: [1] Wang, Y., Baek, J., Tang, Y. et al. "Support vector machine guided reproducing kernel particle method for image-based modeling of microstructures," Comput Mech 73, 907-942 (2024). https://doi.org/10.1007/s00466-023-02394-9. [2] Susuki, K., Allen, J. & Chen, J. S.. "Image-based modeling of coupled electro-chemo-mechanical behavior of Li-ion battery cathode using an interface-modified reproducing kernel particle method," Engineering with Computers (2024). https://doi.org/10.1007/s00366-024-02016-9. [3] 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, 4422-4454 (2022). https://doi.org/10.1002/nme.7040.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Optimal Transfer Operators in Algebraic Two-Level Methods for Nonsymmetric and Indefinite Problems

Consider an algebraic two-level method applied to the 𝑛-dimensional linear system 𝐴⁢𝒙 = 𝒃 using fine-space preconditioner (i.e., “relaxation” or “smoother”) 𝑀, with 𝑀 ≈ 𝐴, restriction and interpolation 𝑅 and 𝑃, and algebraic coarse-space operator 𝐴 𝑐 : = 𝑅 ∗ ⁢𝐴⁢𝑃. Then, what are the best possible transfer operators 𝑅 and 𝑃 of a given dimension 𝑛 𝑐 < 𝑛? Brannick et al. [12] showed that when 𝐴 and 𝑀 are Hermitian positive definite (HPD), the optimal interpolation is such that its range contains the 𝑛 𝑐 smallest generalized eigenvectors of the matrix pencil (𝐴, 𝑀). Recently, in Ali et al. [5] we generalized this framework to the non-HPD setting, by considering both right (interpolation) and left (restriction) generalized eigenvectors of (𝐴, 𝑀) and defining corresponding nonsymmetric transfer operators {𝑅#, 𝑃#}. Tight convergence bounds for {𝑅#, 𝑃#} are derived in spectral radius, as well as a proof of pseudo-optimality. Note, {𝑅#, 𝑃#} are typically complex valued, which is not practical for real-valued problems. Here, in this work, we build on [5], first characterizing all inner products in which the coarse-space correction defined by {𝑅#, 𝑃#} is orthogonal. We then develop tight two-level convergence bounds in these norms, and prove that the underlying transfer operators {𝑅#, 𝑃#} are genuinely optimal. As a special case, our theory both recovers and extends the HPD results from [12]. Finally, we show how to construct optimal, real-valued transfer operators in the case of that 𝐴 and 𝑀 are real valued, but are not HPD. Numerical examples arising from a discretized advection-reaction equation, wave-equation, and Stokes equations are used to verify and illustrate the theory.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Georgia Tech Accelerated, Compressed, and Regularized Compute of Kinetic-based PDEs (Final Report)

This report summarizes the collaborative effort between Lawrence Livermore National Laboratory and Georgia Tech to enhance the BoBa library for tensor train computation in PDE solvers, with a target on kinetic equations and their continuum limits. We aimed to reduce computational cost and memory usage by replacing traditional array-based computations with tensor trains. We examined the compressibility of time-evolving solutions to the Euler equations with discontinuities. We also explored using the first invsicid and linear regularization of the compressible flow equations via the information geometric regularization (IGR). We explored this in a tensor train formulation. To identify that inverse terms in the IGR equations pose problems for tensor train formulations and investigate efficient methods for batched inversion of tensor trains.

97 MATHEMATICS AND COMPUTING↗