Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “High-order accuracy”

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 37 records · Page 2

Hierarchical Truncations for Many-Body Expansion Potentials

In this work, a new strategy to truncate high-order terms in the many-body expansion (MBE) is proposed. This new approach, which we call a hierarchical many-body expansion (HMBE), is based on a hierarchical partition of the system into multitier fragments and can in principle be applied to any large molecular system. Numerical tests on a series of (H 2 O) 64 structures are presented, demonstrating satisfactory relative energies between the clusters and binding energies of individual clusters compared with full-cluster calculations, with significantly fewer high-order terms computed than conventional MBE. The hierarchical truncation can be augmented by certain many-body terms for fragments at the interface between the partitions (called “Schengen terms”) to further improve accuracy. This work establishes the HMBE scheme as a promising framework to model very large systems (e.g., proteins), which are naturally built on a hierarchical structure.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

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↗

A high-order Shifted Interface Method for Lagrangian shock hydrodynamics

Here, we present a new method for two-material Lagrangian hydrodynamics, which combines the Shifted Interface Method (SIM) with a high-order Finite Element Method. Our approach relies on an exact (or sharp) material interface representation, that is, it uses the precise location of the material interface. The interface is represented by the zero level-set of a continuous high-order finite element function that moves with the material velocity. This strategy allows to evolve curved material interfaces inside curved elements. By reformulating the original interface problem over a surrogate (approximate) interface, located in proximity of the true interface, the SIM avoids cut cells and the associated problematic issues regarding implementation, numerical stability, and matrix conditioning. Accuracy is maintained by modifying the original interface conditions using Taylor expansions. We demonstrate the performance of the proposed algorithms on established numerical benchmarks in one, two and three dimensions.

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↗

Stochastic tensor contraction for quantum chemistry

Many computational methods in ab initio quantum chemistry are formulated in terms of high-order tensor contractions, whose cost determines the size of system that can be studied. We introduce stochastic tensor contraction to perform such operations with greatly reduced cost, and present its application to the gold-standard quantum chemistry method, coupled cluster theory with up to perturbative triples. For total energy errors more stringent than chemical accuracy, we reduce the computational scaling to that of mean-field theory, while starting to approach the mean-field absolute cost, thereby challenging the existing cost-to-accuracy landscape. Benchmarks against state-of-the-art local correlation approximations further show that we achieve an order-of-magnitude improvement in both total computation time and error, with significantly reduced sensitivity to system dimensionality and electron delocalization. We conclude that stochastic tensor contraction is a powerful computational primitive to accelerate a wide range of quantum chemistry.

Chemical Physics (physics.chem-ph)↗

Hybridized Discontinuous Galerkin Methods for Computational Fluid Dynamics

Hybridizable Discontinuous Galerkin (HDG) methods hold promise for any applications with significant advection character, including thermal hydraulics in light water reactors and advanced reactor concepts and fluid models of plasmas in magnetic confinement fusion. Its features include natural upwinding, local element conservation, and extensibility to arbitrarily high order accuracy. In the last fiscal year we have implemented HDG in the Multiphysics Object-Oriented Simulation Environment (MOOSE). We developed a first-of-its-kind automatic static condensation system in MOOSE’s underlying finite element library libMesh which can condense out arbitrarily many internal variables. Finally, we developed the first preconditioner for HDG discretizations of the Navier-Stokes equations which shows robust performance across a wide range of problem sizes and Reynolds numbers. This preconditioner yields solution times that are equivalent to the fastest developed for industry standard finite volume methods. Moreover, the arbitrarily high-order nature of HDG makes it a prime candidate for acceleration via graphical processing units (GPUs). We believe these developments will hold significant importance for future DOE Nuclear Energy (NE) and Fusion Energy Science (FES) programs.

97 MATHEMATICS AND COMPUTING↗

LDRD Abbreviated report: High-Order General-Discrete-Ordinates Method Enabling Efficient Deterministic Transport in Hydrodynamic Simulations

Deterministic transport simulations for national-security and energy applications often operate in high-dimensional phase-space, where accuracy and cost both become major challenges. A common numerical artifact in such problems is the “ray-effect,” which appears as unphysical streaks. Beyond misinterpretation, these artifacts can contaminate tightly coupled physics, such as fluid dynamics, radiation-hydrodynamics, and laser-plasma interactions, eroding the predictive capability of entire multiphysics workflows. Our objective was to make high-dimension studies practical on modern hardware while mitigating the ray-effect without relying on prohibitively expensive sampling approaches such as Monte Carlo methods. We developed the Generic Discretization Library (GenDiL), a Graphics Processing Unit (GPU)-first framework that uses high-order Discontinuous Galerkin (DG) methods and matrix-free algorithms to reduce memory usage and improve computational efficiency, critical for phase-space simulations. GenDiL supports phase-space adaptivity in both mesh size and polynomial order (hp-adaptivity) to place resolution only where it is needed. A central capability is Local Dimensional Refinement (LDR), which couples lower-dimension continuum models to higher-dimension kinetic models through stable and conservative interfaces, so that high-fidelity physics is applied only in regions where it is essential. Building on the GenDiL framework, we developed the General SN (GSN) family of algorithms as a true generalization of the polar SN approach (discrete ordinates, often denoted SN). Rather than tying discrete ordinates to a specific polar change of coordinates, GSN formulates transport on an arbitrary change of coordinates chosen to reduce ray-effect. We studied two complementary variants: an analytic variant, where the coordinate map is prescribed in advance by a closed-form function; and a data-driven variant, where a quantity of interest, such as the net flux, guides the coordinate system. GenDiL provides the library infrastructure for efficient GPU execution, but the GSN concept is algorithmic and independent of any one library. Across representative high-dimension tests, including non-symmetric solutions, both variants delivered strong ray-effect mitigation at practical cost, moving four- to six-dimensional analysis toward repeatable, routine studies.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

A sweeping positivity-preserving high-order finite difference WENO scheme for Euler equations

We develop a simple, high-order, conservative and robust positivity-preserving sweeping procedure for the density and the nonlinear pressure function in the compressible Euler equations. Using the scaling limiter in Zhang and Shu (J Comput Phys 229:3091–3120, 2010), we obtain a non-trivial extension of the scalar sweeping technique in Liu et al. (J Sci Comput 73:1028–1071, 2017) for the positivity of pressure. The sweeping procedure developed in this paper is a post-processing technique, which can be applied to any concave functions of the conserved variables in hyperbolic conservation law systems. Thus, it has applications beyond the Euler equations. This procedure preserves positivity and conservation of physical quantities without destroying the accuracy of the underlying scheme. The algorithm works for general schemes including finite difference, finite volume and discontinuous Galerkin methods; however, in this paper we focus on finite difference weighted essentially non-oscillatory (WENO) methods. As a result, we provide numerical tests of the fifth-order finite difference WENO scheme to demonstrate the accuracy and robustness of the technique.

Compressible Euler equations↗

An extension of the localized artificial diffusivity method for immiscible and high density ratio flows

The localized artificial diffusivity (LAD) method is widely regarded as the preferred multi-material regularization scheme for the compact finite difference method, because it is conservative, easy to implement, and generally robust for a wide range of multi-material problems. However, traditional LAD methods face significant challenges when applied to flows with large density ratios and when maintaining thermodynamic equilibrium across material interfaces. These limitations arise from the formulation of the artificial diffusivity flux and the reliance on enthalpy diffusion for interface regularization. Additionally, traditional LAD methods struggle to ensure stability under large density ratio conditions, fail to maintain a finite interface thickness, and are therefore unsuitable for modeling immiscible interfaces. Here, in this work, we discuss the origins of these issues in traditional LAD methods and propose modifications which enable the simulation of large density ratio and immiscible flows. The proposed method targets the artificial diffusion fluxes at gradients and ringing in the volume fraction, rather than the mass fraction in traditional methods, to consistently regularize large density ratio interfaces. Furthermore, the proposed method introduces an artificial bulk density diffusion term to enforce equilibrium conditions across interfaces. To address the challenge of modeling immiscible flows, a conservative diffuse interface term is incorporated into the formulation to ensure a finite interface thickness. Specific consideration is taken in the design of the method to ensure that these crucial properties are maintained for N -material flows. The effectiveness of the proposed method is demonstrated through a series of canonical test cases, and its accuracy is validated by comparison with experimental data on micro-bubble collapse in water. These results highlight the method’s robustness and its ability to overcome the limitations of traditional LAD approaches.

Artificial diffusivity↗

High-Order Wall-Modeled Large-Eddy Simulation of High-Lift Configuration

This paper presents the assessment of several recent enhancements for a high-order wall-modeled large-eddy simulation (WMLES) approach and demonstrates order independence with a fixed data exchange location in the wall model. The two enhancements include the use of isotropic tetrahedral elements to improve accuracy and an explicit subgrid-scale model, the Vreman model, to improve accuracy and robustness. The [Formula: see text] study focused on the high-lift Common Research Model (HL-CRM) at the angle of attack of 19.57 deg, a benchmark problem from the 4th AIAA High-Lift Prediction Workshop. Solution polynomial orders of [Formula: see text], and 5 were used in the study. The study demonstrated [Formula: see text] independence in integrated forces, pitch moment, velocity profile in the wall-normal direction, and surface flow topology. It also showed that a [Formula: see text] order of at least 3 ([Formula: see text]) was needed to correctly predict the external inviscid flow and the surface flow topology. Thereafter, [Formula: see text] simulations over several other angles of attack demonstrated that the high-order WMLES approach can correctly predict the maximum lift and flow separation regions for HL-CRM with about 40 million degrees of freedom (DOF) compared to at least 250 million DOF required by second-order methods.

Engineering↗

thornado+FLASH-X: A Hybrid Discontinuous Galerkin–Implicit-explicit and Finite-volume Framework for Neutrino-radiation Hydrodynamics in Core-collapse Supernovae

We present neutrino-transport algorithms implemented in the toolkit for high-order neutrino-radiation hydrodynamics (thornado) and their coupling to self-gravitating hydrodynamics within the adaptive mesh refinement–based multiphysics simulation framework FLASH-X. thornado, developed primarily for simulations of core-collapse supernovae (CCSNe), employs a spectral, six-species two-moment formulation with algebraic closure and special-relativistic observer corrections accurate to $\mathcal{O}(v/c)$, and uses discontinuous Galerkin (DG) methods for phase-space discretization combined with implicit-explicit time stepping. A key development is a nonlinear neutrino–matter coupling algorithm based on nested fixed-point iteration with Anderson acceleration, enabling fully implicit treatment of collisional processes, including energy-coupling interactions such as neutrino–electron scattering and pair production. Coupling to finite-volume (FV) hydrodynamics is achieved through a hybrid DG-FV representation of the fluid variables and operator-split evolution within FLASH-X. The implementation is verified using basic transport tests with idealized opacities and relaxation and deleptonization problems with tabulated microphysics. Spherically symmetric CCSN simulations demonstrate accuracy and robustness of the coupled scheme, including close agreement with the CCSN simulation code Chimera. An axisymmetric CCSN simulation further demonstrates the viability of DG-based neutrino transport for multidimensional supernova modeling within FLASH-X. thornado’s neutrino-transport solver is GPU-enabled using OpenMP offloading or OpenACC, and all CCSN applications included in this work use the GPU implementation. Together, these results establish a foundation for future enhancements in physics fidelity, numerical algorithms, and computational performance, for increasingly realistic large-scale CCSN simulations.

Endeve, Eirik [Oak Ridge National Laboratory (ORNL↗

Arbitrary Order Virtual Element Methods for High‐Order Phase‐Field Modeling of Dynamic Fracture

ABSTRACT Accurate modeling of fracture nucleation and propagation in brittle and ductile materials subjected to dynamic loading is important in predicting material damage and failure under extreme conditions. Phase‐field fracture models have garnered a lot of attention in recent years due to their success in representing damage and fracture processes in a wide class of materials and under a variety of loading conditions. Second‐order phase‐field fracture models are by far the most popular among researchers (and increasingly, among practitioners), but fourth‐order models have started to gain broader acceptance since their more recent introduction. The exact solution corresponding to these high‐order phase‐field fracture models has higher regularity. Thus, numerical solutions of the model equations can achieve improved accuracy and higher spatial convergence rates. In this work, we develop a virtual element framework for the high‐order phase‐field model of dynamic fracture. The virtual element method (VEM) can be regarded as a generalization of the classical finite element method. In addition to many other desirable characteristics, the VEM allows computing on polytopal meshes. Here, we use ‐conforming virtual elements and the generalized‐ time integration method for the momentum balance equation, and adopt ‐conforming virtual elements for the high‐order phase‐field equation. We verify our virtual element framework using classical quasi‐static benchmark problems and demonstrate its capabilities with the aid of numerical simulations of dynamic fracture in brittle materials.

42 ENGINEERING↗

A Particle-in-Cell Method for Plasmas with a Generalized Momentum Formulation, Part I: Model Formulation

Here, this paper formulates a new particle-in-cell method for the Vlasov–Maxwell system. Under the Lorenz gauge condition, Maxwell’s equations for the electromagnetic fields can be written as a collection of scalar and vector wave equations. The use of potentials for the fields motivates the adoption of a Hamiltonian formulation for particles that employs the generalized (conjugate) momentum. A notable advantage offered by the Hamiltonian formulation is the elimination of time derivatives in the Lorenz gauge formulation that are required by the standard Newton–Lorentz treatment of the particles. This allows the fields to retain the full time-accuracy guaranteed by the field solver. The resulting updates for particles require only knowledge of the fields and their spatial derivatives. An analytical method for constructing these spatial derivatives is presented that exploits the underlying integral solution used in the field solver for the wave equations. Moreover, these derivatives are demonstrated to converge at the same rate as the fields in both time and space. The Method of Lines Transpose field solver we consider in this work is globally first-order accurate in time and high-order accurate in space (e.g., fourth- and fifth-order) and belongs to a larger class of methods which are unconditionally stable, can address geometry, and leverage $\mathcal {O}(N)$ fast summation methods for efficiency. We demonstrate the method on several well-established benchmark problems on bounded domains, including a plasma sheath as well as a relativistic particle beam. The efficacy of the proposed formulation is established by comparing with a second-order accurate finite-difference time-domain method that employs a leapfrog time advance for particles and a charge conserving map suitable for bounded domains. The new method shows mesh-independent numerical heating properties even in cases where the plasma Debye length is smaller than the grid spacing. This is an important feature of the new method for problems defined on bounded domains, because it permits the use of coarser grids in space in the representation of the fields. Such a capability has significant implications for the simulation of plasmas in bounded domains with complex geometry, where the ratio between the largest and smallest cells can vary significantly. The use of high-order spatial approximations in the new method also means that fewer grid points are required in order to achieve a fixed accuracy. Our results also suggest that the new method can be used with fewer simulation particles per cell compared to the benchmark explicit method, which permits further computational savings.

97 MATHEMATICS AND COMPUTING↗

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↗

One-sweep moment-based semi-implicit-explicit integration for gray thermal radiation transport

Thermal radiation transport (TRT) is a time dependent, high dimensional partial integro-differential equation. In practical applications such as inertial confinement fusion, TRT is coupled to other physics such as hydrodynamics, plasmas, etc., and the timescales one is interested in capturing are often much slower than the radiation timescale. As a result, TRT is treated implicitly, and due to its stiffness and high dimensionality, is often a dominant computational cost in multiphysics simulations. Here we develop a new approach for implicit-explicit (IMEX) integration of gray TRT in the deterministic SN setting, which requires only one sweep per stage, with the simplest first-order method requiring only one sweep per time step. The partitioning of equations is done via a moment-based high-order low-order formulation of TRT, where the streaming operator and first two moments are used to capture the asymptotic stiff regimes of the streaming limit and diffusion limit. Absorption-reemission is treated explicitly, and although stiff, is sufficiently damped by the implicit solve that we achieve stable accurate time integration without incorporating the coupling of the high order and low order equations implicitly. Due to nonlinear coupling of the high-order and low-order equations through temperature-dependent opacities, to facilitate IMEX partitioning and higher-order methods, we use a semi-implicit integration approach amenable to nonlinear partitions. In conclusion, results are demonstrated on thick Marshak and crooked pipe benchmark problems, demonstrating orders of magnitude improvement in accuracy and wallclock compared with the standard first-order implicit integration typically used.

97 MATHEMATICS AND COMPUTING↗

A Semi-Analytical Approach for State-Space Electromagnetic Transient Simulation

Here, this paper proposes a semi-analytical approach for efficient and accurate electromagnetic transient (EMT) simulation of a power grid. The approach first derives a high-order semi-analytical solution (SAS) of the grid’s state-space EMT model using the differential transformation (DT), and then evaluates the solution over enlarged, variable time steps to significantly accelerate the simulations while maintaining its high accuracy on detailed fast EMT dynamics. The approach also addresses switches during large time steps by using a limit violation detection algorithm with a binary search-enhanced quadratic interpolation. Case studies are conducted on EMT models of the IEEE 39-bus system and large-scale systems to demonstrate the merits of the new simulation approach against traditional numerical methods.

electromagnetic transient↗

Improving Trustworthiness of Data-Driven Power Grid Contingency Analysis With Bayesian Residual Graph Neural Networks

The evolving energy landscape requires novel tools to efficiently perform contingency analysis and reliability assessment of power grids, potentially in real-time. The high computational cost of traditional power flow solvers limits their applicability in practice. Machine learning (ML) surrogates such as deep neural networks (NNs) accelerate power flow solvers computations, enabling high-order contingency analysis and real-time decision-making by learning highly nonlinear functions and integrating grid topology via graph architectures. However, (graph) NNs lack predictive power away from training data and do not provide predictive confidence estimates. Here, we present a Bayesian residual graph NN that integrates knowledge from low-fidelity data via residual training and embeds granular quantification of uncertainties, improving trustworthiness critical for high-consequence decision-making. Applying Bayesian concepts to NNs is challenging due to the high-dimensionality of both the parameter space, complicating derivation of a meaningful prior, and the output space in large grid systems, requiring enhanced techniques to assess the predicted high-dimensional uncertainties. Our contributions include: (1) Deriving a prior for fully connected and graph NNs that leverages low-fidelity data to guide mean predictions and appropriately control prior predictive uncertainty. (2) Integrating this prior within an ensembling with anchoring scheme for efficient approximate posterior inference. (3) Deriving enhanced metrics to assess accuracy of both the mean and uncertainty predictions in high dimensions, appropriately accounting for correlations propagated through graph layers. The resulting Bayesian residual graph NN is tested on a contingency analysis task for 14-bus and 118-bus grids.

24 - POWER TRANSMISSION AND DISTRIBUTION↗

Bias-Variance Trade-Off in Physics-Informed Neural Networks with Randomized Smoothing for High-Dimensional PDEs

Physics-Informed Neural Networks (PINNs) have triggered a paradigm shift in scientific computing, leveraging mesh-free properties and robust approximation capabilities. While proving effective for low-dimensional partial differential equations (PDEs), the computational cost of PINNs remains a hurdle in high-dimensional scenarios. This is particularly pronounced when computing high-order and high-dimensional derivatives in the physics-informed loss. Randomized Smoothing PINN (RS-PINN) introduces Gaussian noise for stochastic smoothing of the original neural net model, enabling the use of Monte Carlo methods for derivative approximation, which eliminates the need for costly automatic differentiation. Despite its computational efficiency, especially in the approximation of high-dimensional derivatives, RS-PINN introduces biases in both loss and gradients, negatively impacting convergence, especially when coupled with stochastic gradient descent (SGD) algorithms. We present a comprehensive analysis of biases in RS-PINN, attributing them to the nonlinearity of the Mean Squared Error (MSE) loss as well as the intrinsic nonlinearity of the PDE itself. We propose tailored bias correction techniques, delineating their application based on the order of PDE nonlinearity. The derivation of an unbiased RS-PINN allows for a detailed examination of its advantages and disadvantages compared to the biased version. Specifically, the biased version has a lower variance and runs faster than the unbiased version, but it is less accurate due to the bias. To optimize the bias-variance trade-off, we combine the two approaches in a hybrid method that balances the rapid convergence of the biased version with the high accuracy of the unbiased version. In addition to methodological contributions, we present an enhanced implementation of RS-PINN. Extensive experiments on diverse high-dimensional PDEs, including Fokker-Planck, Hamilton-Jacobi-Bellman (HJB), viscous Burgers’, Allen-Cahn, and Sine-Gordon equations, illustrate the bias-variance trade-off and highlight the effectiveness of the hybrid RS-PINN. Empirical guidelines are provided for selecting biased, unbiased, or hybrid versions, depending on the dimensionality and nonlinearity of the specific PDE problem.

97 MATHEMATICS AND COMPUTING↗