Search NASA⌕ Search

SEARCH · Search NASA

Results for “Discretization”

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 145 records · Page 8
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

A hybrid Monte Carlo, discontinuous Galerkin method for linear kinetic transport equations

Here we present a hybrid method for time-dependent particle transport problems that combines Monte Carlo (MC) estimation with deterministic solutions based on discrete ordinates. For spatial discretizations, the MC algorithm computes a piecewise constant solution and the discrete ordinates use bilinear discontinuous finite elements. From the hybridization of the problem, the resulting problem solved by Monte Carlo is scattering free, resulting in a simple, efficient solution procedure. Between time steps, we use a projection approach to “relabel” collided particles as uncollided particles. In conclusion, from a series of standard 2-D Cartesian test problems we observe that our hybrid method has improved accuracy and reduction in computational complexity of approximately an order of magnitude relative to standard discrete ordinates solutions.

97 MATHEMATICS AND COMPUTING↗
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

A fourth order sharp immersed method for the incompressible Navier-Stokes equations with stationary and moving boundaries and interfaces

We propose a fourth order Navier-Stokes solver based on the immersed interface method (IIM), for flow problems with stationary and one-way coupled moving boundaries and interfaces. Our algorithm employs a Runge-Kutta-based projection method that maintains high-order temporal accuracy in both velocity and pressure for steady and unsteady velocity boundary conditions. Fourth order spatial accuracy is achieved through a novel fifth order IIM discretization scheme for the advection term, as well as existing high-order interface-corrected finite difference schemes for the other differential operators. Using a set of manufactured flow problems with stationary and moving boundaries, we demonstrate fourth order convergence of velocity and pressure in the infinity norm, both inside the domain and on the immersed boundaries. The solver’s performance is further validated through a range of practical flow simulations, highlighting its efficiency over a second order scheme. Finally, we showcase the ability of our immersed discretization scheme to handle interface-coupled multiphysics problems by solving a conjugate heat transfer problem with multiple immersed solids. Overall, the proposed approach robustly combines the efficiency of high order discretization schemes with the flexibility of immersed discretizations for flow problems with complex, moving boundaries and interfaces.

42 ENGINEERING↗
DOE OSTI2026

Hourglass control in staggered-grid hydrodynamics using virtual element stabilization techniques

Numerical simulations using the staggered-grid hydrodynamics (SGH) discretization suffer from hourglass instabilities. In this work, we develop a stabilization method to suppress the hourglass instabilities using techniques from the virtual element method (VEM). The stiffness matrix of the VEM consists of two terms: the consistency matrix which is rank deficient and the stability matrix. Here, we first show that in two dimensions and on general polygons, the stiffness matrix of the SGH is identical to the consistency matrix of the linear VEM for both the diffusion equation and the linear elasticity equation. These analyses explain the origin of the hourglass instabilities of the SGH discretization method, and establish a theoretical foundation for our proposed stabilization method by augmenting the stiffness matrix of the SGH discretization using the VEM stability matrix. Then, we present numerical examples using Lagrangian SGH simulations. The numerical experiments demonstrate that the proposed VEM stabilization method is effective at eliminating hourglass modes in the SGH discretization.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

A mesoscopic link-transmission-model able to track individual vehicles

Macroscopic traffic flow is a common choice for large-scale traffic simulations. These models do not provide individual-specific metrics as outputs. However, this treatment is necessary in agent-based-models, as in, for example, assigning routes based on personal characteristics. Here, in this paper, we propose an extension of the link-transmission-model, an efficient and yet accurate discretization of the Lighthill-Whitham-Richards (LWR) model, which allow vehicles to be tracked individually while keeping the main features of the underlying model. The extension comprises modifying the link and node models to ensure that the flow between links is always at discrete levels. Therefore, every unit of flow is associated with one individual vehicle moving from its current to its next link. An upper bound of the discretization error is provided. We show that the proposed model resembles its continuous counterpart on lane drop, merge, and diverge cases. In addition, we apply the model into three different networks to validate its applicability in large networks. Finally, we also confirm the parameter transferability between continuous and discrete models and that both can well reproduce field data.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2025

Ferromagnets, a new anomaly, instantons, and (noninvertible) continuous translations

We discuss a large class of classical field theories with continuous translation symmetry. In the quantum theory, a new anomaly explicitly breaks this translation symmetry to a discrete symmetry. Furthermore, this discrete translation symmetry is extended by a d – 2-form global symmetry. All these theories can be described as U(1) gauge theories where Gauss law states that the system has nonzero charge density. Special cases of such systems can be phrased as theories with a compact phase space. Examples are ferromagnets and lattices in the lowest Landau level. In some cases, the broken continuous translation symmetry can be resurrected as a noninvertible symmetry. We clarify the relation between the discrete translation symmetry of the continuum theory and the discrete translation symmetry of an underlying lattice model. Our treatment unifies, clarifies, and extends earlier works on the same subject.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

A Block-Structured Adaptive Mesh Framework to Solve Radiation Transfer Equation in Irregular Embedded Geometries

Radiation transport arises in various scientific, industrial, and medical fields, and understanding its effect in applications is needed to make accurate predictions, safety assessments and performance optimizations. Solving the Radiation Transport Equation (RTE) is challenging due to its integro-differential nature, which involves both differential and integral terms. The differential term describes the change in radiation intensity due to absorption and emission, while the integral term accounts for scattering. The accurate modeling of radiation is further complicated in many applications due to the complex, irregular geometries. Various methods exist for solving the RTE, including the zonal, Monte Carlo, spherical harmonics, discrete ordinates, and finite volume methods. Traditional mesh-based approaches, which rely on structured or unstructured meshes, struggle with irregular geometries due to: a) the difficulty of conforming structured grids to irregular domains, b) challenges in enforcing boundary conditions correctly, and c) the additional computational cost of unstructured mesh methods. This work presents a second-order accurate method for solving the RTE in irregular geometries. The radiation intensity is discretized using the finite-volume method in both spatial and angular directions on regular Cartesian grid blocks. Leveraging the block-structured adaptive mesh refinement (AMR) framework provided by AMReX, our method refines the grid locally to reduce spatial discretization error, ensuring a converged numerical solution while minimizing computational costs elsewhere. A two-stage deferred correction approach is employed: First, a first-order discretization on grid blocks is solved using an algebraic multigrid method in HYPRE. Second, a correction term is applied explicitly to achieve second-order accuracy. The correction term is calculated by approximating the radiation flux on cell faces using a Total Variation Diminishing (TVD) scheme. This approach ensures quick convergence of the multigrid method while preserving higher-order accuracy of the numerical solution. Irregular geometries are resolved as embedded boundaries (EB), resulting in both cut cells and regular cells. In cut cells, we modify the fluxes using face fractions and incorporate additional contributions from EB boundary conditions. To ensure higher-order convergence near the EB interface, the correction term is modified by interpolating the radiation intensity to fictitious ghost points. The implementation takes advantage of modern supercomputers by leveraging AMReX’sMPI/X parallelization strategy where X can be MPI or a GPU accelerator including CUDA, HIP and DPC++. We validate our solver using classical test cases, both with and without EB, demonstrating accuracy and efficiency. Additionally, we analyze the impact of adaptive mesh refinement on solution accuracy and computational cost, highlighting the advantages of our approach for high-resolution radiation transport simulations.

computational fluid dynamics (CFD)↗
DOE OSTI2025

Clearing up the Strong $CP$ problem

The absence of a neutron electric dipole moment (EDM) constrains the quantum chromodynamics (QCD) theta angle to be less than one part in ten billion, posing the Strong $CP$ problem. We revisit two classes of proposed solutions. First, we show that when $P$ or $CP$ is realized as a gauged discrete symmetry - as can arise in quantum gravity - the vacuum necessarily preserves $CP$, contrary to recent claims that discrete-symmetry solutions fail. Gauged discrete models face model-building challenges, such as avoiding contributions to the neutron EDM after spontaneous $P$ or $CP$ breaking, but in principle have no fundamental obstructions. Second, we critically examine recent arguments that the Strong $CP$ problem is illusory, demonstrating that a nonzero neutron EDM at finite $\barθ$ follows directly from well-understood QCD dynamics. Taken together, our results reinforce the reality of the Strong $CP$ problem and highlight gauged discrete-symmetry realizations of $P$ or $CP$ as plausible solutions.

FOS: Physical sciences↗
DOE OSTI2024

Proximal Galerkin: A Structure-Preserving Finite Element Method for Pointwise Bound Constraints

The proximal Galerkin finite element method is a high-order, low iteration complexity, nonlinear numerical method that preserves the geometric and algebraic structure of pointwise bound constraints in infinite-dimensional function spaces. This paper introduces the proximal Galerkin method and applies it to solve free boundary problems, enforce discrete maximum principles, and develop a scalable, mesh-independent algorithm for optimal design with pointwise bound constraints. This paper also introduces the latent variable proximal point (LVPP) algorithm, from which the proximal Galerkin method derives. When analyzing the classical obstacle problem, we discover that the underlying variational inequality can be replaced by a sequence of second-order partial differential equations (PDEs) that are readily discretized and solved with, e.g., the proximal Galerkin method. Throughout this work, we arrive at several contributions that may be of independent interest. These include (1) a semilinear PDE we refer to as the entropic Poisson equation; (2) an algebraic/geometric connection between high-order positivity-preserving discretizations and certain infinite-dimensional Lie groups; and (3) a gradient-based, bound-preserving algorithm for two-field, density-based topology optimization. The complete proximal Galerkin methodology combines ideas from nonlinear programming, functional analysis, tropical algebra, and differential geometry and can potentially lead to new synergies among these areas as well as within variational and numerical analysis. Open-source implementations of our methods accompany this work to facilitate reproduction and broader adoption.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

A Scalable Interior‐Point Gauss–Newton Method for PDE‐Constrained Optimization With Bound Constraints

Here, we present a scalable approach to solve a class of partial differential equation (PDE)‐constrained optimization problems with bound constraints. This approach utilizes a robust full‐space interior‐point (IP)‐Gauss–Newton optimization method. To cope with the poorly‐conditioned IP‐Gauss–Newton saddle‐point linear systems that need to be solved approximately, once per optimization step, we propose two spectrally related preconditioners. These preconditioners leverage the limited informativeness of data in regularized PDE‐constrained optimization problems. A block Gauss–Seidel preconditioner is proposed for the GMRES‐based solution of the IP‐Gauss–Newton linear systems. It is shown, for a large‐class of PDE‐ and bound‐constrained optimization problems, that the spectrum of the block Gauss–Seidel preconditioned IP‐Gauss–Newton matrix is asymptotically independent of discretization and is not impacted by the ill‐conditioning that notoriously plagues interior‐point methods. We exploit symmetry of the IP‐Gauss–Newton linear systems and propose a regularization and log‐barrier Hessian preconditioner for the preconditioned conjugate gradient (PCG)‐based solution of the equivalent IP‐Gauss–Newton–Schur complement linear systems. The eigenvalues of the block Gauss–Seidel preconditioned IP‐Gauss–Newton matrix, that are not equal to one, are identical to the eigenvalues of the regularization and log‐barrier Hessian preconditioned Schur complement matrix. The scalability of the approach is demonstrated on two example problems. The numerical solution of these optimization problems is shown to require a discretization independent number of IP‐Gauss–Newton linear solves. Furthermore, the linear systems are solved in a discretization and IP ill‐conditioning independent number of preconditioned Krylov subspace iterations. The parallel scalability of the preconditioner, achieved via algebraic multigrid component solvers when applicable, and the aforementioned algorithmic scalability permits a parallel scalable means to compute solutions of a large class of PDE‐ and bound‐constrained problems.

PDE-constrained optimization↗
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 OSTI2025

Thermo-hydraulic steam pipe models for district heating simulations: Simplifications to balance accuracy and simulation speed

Steam piping networks are essential for optimizing performance in industrial processes and district heating systems. However, dynamic models that balance thermo-hydraulic accuracy with computational efficiency remain limited. In response, this paper presents a new discretized steam pipe model based on the plug flow approach, capturing key thermo-hydraulic behaviors while simplifying steam phase change processes. Implemented in Modelica, the model accurately calculates temperature and pressure distributions along steam pipelines. To improve computational efficiency for district-scale simulations, five model simplifications are introduced: lumped thermo-hydraulic functions, empirical correlations, fluid state approximations, steady-state dynamics and inclusion of flow derivatives. These simplified models achieve 85%-98% accuracy in predicting pressure drop and condensation losses, including dynamic condensate behavior during pipe warm-up—a factor often overlooked in existing models. The models support diverse network configurations, scaling effectively to systems with multiple distribution pipes and connected building loads. Discrete models provide detailed insights but exhibit a cubic increase in simulation time as the network scales by N connected building O(N 2.42 ). In contrast, lumped models simulate 10–28 times faster than discrete, offering quadratic scaling of simulation time O(N 1.73 ). However, they still require 6 times more computation time than a lossless network, highlighting the inherent computational challenges of modeling compressible fluid flow. In conclusion, the steady-state lumped variant, with its near-linear scalability in computational time O(N 1.01 ), emerges as an efficient solution for preliminary design evaluations and extensive parametric studies.

15 GEOTHERMAL ENERGY↗
DOE OSTI2025

A review of high order strong stability preserving two-derivative explicit, implicit, and IMEX methods

High order strong stability preserving time discretizations ensure the nonlinear non-inner-product strong stability properties of spatial discretizations suited for the stable simulation of hyperbolic PDEs in a wide variety of application areas including fluid dynamics, magnetohydrodynamics, semiconductor devices, electromagnetics, and astrophysics. Over the past decade multiderivative time-stepping have been increasingly used for the time-evolution hyperbolic PDEs, so that the strong stability properties of these methods have become important. In this work we review sufficient conditions for a two-derivative multistage method to preserve the strong stability properties of spatial discretizations in a forward Euler and different conditions on the second derivative. In particular we present the strong stability preserving theory for explicit and implicit two-derivative Runge–Kutta schemes, including a special condition on the second derivative under which these implicit methods may be unconditionally strong stability preserving. This special condition is natural for the stiff component of wide range of plasma physics problems, and can be useful in the context of strong stability preserving implicit-explicit multi-derivative Runge–Kutta schemes, where the time-step restriction is then independent of the stiff term. Lastly, we present the strong stability preserving theory for implicit-explicit multi-derivative general linear methods, and some novel second and third order methods where the time-step restriction is independent of the stiff term.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Pressure stability in explicitly coupled simulations of poromechanics with application to CO 2 sequestration

We study in detail the pressure stabilizing effects of the non-iterated fixed-stress splitting in poromechanical problems which are nearly undrained and incompressible. When applied in conjunction with a spatial discretization which does not satisfy the discrete inf–sup condition, namely a mixed piecewise linear–piecewise constant spatial discretization, the explicit fixed-stress scheme can have a pressure stabilizing effect in transient problems. This effect disappears, however, upon time step refinement or the attainment of steady state. The interpretation of the scheme as an Augmented Lagrangian method similar to Uzawa iteration for incompressible flow helps explain these results. Moreover, due to the slowly evolving solution within undrained seal regions, we show that the explicit fixed-stress scheme requires very large time steps to reveal its pressure stabilizing effect in examples of geologic CO 2 sequestration. We note that large time steps can result in large errors in drained regions, such as the aquifer or reservoir regions of these examples, and can prevent convergence of nonlinear solvers in the case of multiphase flows, which can make the explicit scheme an unreliable source of pressure stabilization. We conclude by demonstrating that pressure jump stabilization is as effective in the explicit fixed-stress setting as in the fully implicit setting for undrained problems, while maintaining the stability and convergence of the fixed-stress split for drained problems.

58 GEOSCIENCES↗
DOE OSTI2025

A Green’s function fast multipole method for computation of micromechanical fields in heterogeneous materials

Computation of micromechanical fields in heterogeneous materials is usually performed using either the finite element method or the Green’s function method based on FFTs. The finite element method allows for accurate discretization and for non-periodic boundary conditions but is computationally expensive. On the other hand, the FFT-based method is computationally efficient but requires discretization on a regular grid of hexahedral voxels. In this paper, a Green’s function method allowing for accurate discretization using tetrahedral elements and for non-periodic boundary conditions is proposed. The convolution is computed using the fast multipole method, which provides good accuracy even for low-order expansion due to the fast decay of interactions between elements. The proposed Green’s function fast multipole method is verified by comparison with analytical and FFT-based solutions. Furthermore, the computational time is analyzed and compared to the FFT-based method for non-periodic convolution. Finally, effective properties of an elastic polycrystalline microstructure containing thin intergranular cracks are computed and analyzed.

36 MATERIALS SCIENCE↗
DOE OSTI2025

A provably stable numerical method for the anisotropic diffusion equation in confined magnetic fields

We present a novel numerical method for solving the anisotropic diffusion equation in magnetic fields confined to a periodic box which is accurate and provably stable. We derive energy estimates of the solution of the continuous initial boundary value problem. A discrete formulation is presented using operator splitting in time with the summation by parts finite difference approximation of spatial derivatives for the perpendicular diffusion operator. Weak penalty procedures are derived for implementing both boundary conditions and parallel diffusion operator obtained by field line tracing. We prove that the fully-discrete approximation is unconditionally stable. Discrete energy estimates are shown to match the continuous energy estimate given the correct choice of penalty parameters. A nonlinear penalty parameter is shown to provide an effective method for tuning the parallel diffusion penalty and significantly minimises rounding errors. Several numerical experiments, using manufactured solutions, the “NIMROD benchmark” problem and a single island problem, are presented to verify numerical accuracy, convergence, and asymptotic preserving properties of the method. Finally, we present a magnetic field with chaotic regions and islands and show the contours of the anisotropic diffusion equation reproduce key features in the field.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2026

Local convection characteristics of inline arrangement of Kagome-shaped unit cells in a square duct

Transient liquid crystal thermography experiments have been conducted to determine detailed convective heat transfer coefficients at the endwalls of lattice-frame configurations based on Kagome-shaped unit cells. Kagome unit cells with porosity of 0.88 were arranged in an inline manner, where two such arrangements were studied. In the first arrangement, a total of ten unit cells were placed next to each other along the streamwise direction resulting in a continuous configuration. In the 2nd arrangement, alternate unit cells from the continuous configuration were dropped, resulting in a discrete configuration which featured a total of 5 Kagome unit cells. Due to the asymmetric nature of the strut connections within the unit cell, the convective heat transfer coefficient maps were determined for the two opposite walls where the struts meet the endwalls. Transient liquid crystal experiments were conducted for Reynolds number ranging between 10,000 and 30,000. Here, the study was focused on the developing nature of flow along the streamwise direction and the local convection characteristics for continuous and discrete arrangement of unit cells. For the continuous configuration, the Nusselt number ratios (N u /Nu 0 ) varied between 3.15–3.46 and 2.75–2.89 for the two walls A and B, respectively. For the discrete configuration, convective heat transfer coefficients varied between 2.56–2.71 and 2.09–2.40 for the two walls. Kagome unit cells have the potential to be fabricated through inexpensive manufacturing routes such as wire-woven method and these unit cells find their applications in the areas which require different heat transfer levels on opposite walls.

Kagome↗
DOE OSTI2025

Local conservation of energy in fully implicit PIC algorithms

We consider the issue of strict, fully discrete local energy conservation for a whole class of fully implicit local-charge- and global-energy-conserving particle-in-cell (PIC) algorithms. Earlier studies demonstrated these algorithms feature strict global energy conservation. However, whether a local energy conservation theorem exists (in which the local energy update is governed by a flux balance equation at every mesh cell) for these schemes is unclear. In this study, we show that a local energy conservation theorem indeed exists. We begin our analysis with the 1D electrostatic PIC model without orbit-averaging, and then generalize our conclusions to account for orbit averaging, multiple dimensions, and electromagnetic models (Darwin). In all cases, a temporally, spatially, and particle-discrete local energy conservation theorem is shown to exist, proving that these formulations (as originally proposed in the literature), in addition to being locally charge conserving and globally energy conserving, are strictly locally energy conserving as well. In contrast to earlier proofs of local conservation in the literature, which only considered continuum time, our result is valid for the fully implicit time-discrete version of all models considered, including important features such as orbit averaging. We demonstrate the local-energy-conservation property numerically with a paradigmatic numerical example.

97 MATHEMATICS AND COMPUTING↗