Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “discretization error”

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

Misclassification in Workers’ Telecommuting Frequency Choices Using a Generalized Extreme Value Model

Telecommuting frequency is a response variable collected in travel surveys and is, therefore, prone to errors leading to mismeasurements or misclassification. Misclassification of explanatory variables is a common risk when using statistical modeling techniques. We define “misclassification” as a response reported or recorded in the wrong category; for example, a variable is recorded as a 1 when it should be 0. Here, in this context, this study aims to develop a statistical model to analyze telecommuting data which accounts for potential misclassification errors by building on existing literature in econometrics. The empirical analysis was undertaken using the 2017 National Household Travel Survey (NHTS) and the general extreme value (GEV) models available in the literature. Specifically, the frequency of telecommuting days was analyzed using the negative binomial (NB) model recast as the multinomial logit (MNL) model. By nature—and consistent with other studies—NHTS data are prone to errors that can be classified as intentional or unintentional misinformation provided by the person being interviewed. Ignoring these errors while modeling telecommuting frequencies using standard discrete count models can result in biased parameter estimates. The misclassification parameter was calculated for both over-reporting and under-reporting scenarios. The misclassification errors can be as high as 14% over-reported and 10% under-reported, particularly for the neighboring values. Statistical fit comparison between the models shows that models that ignore misclassification have worse data fit and biased parameter estimates with significant policy implications.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2022

Spatial resolution of different discretizations over long-time for the Dirac equation with small potentials

In this report we compare the long-time error bounds and spatial resolution of finite difference methods with different spatial discretizations for the Dirac equation with small electromagnetic potentials characterized by $\varepsilon \in (0, 1]$ a dimensionless parameter. We begin with the simple and widely used finite difference time domain (FDTD) methods, and establish rigorous error bounds of them, which are valid up to the time at $O(1/\varepsilon)$. In the error estimates, we pay particular attention to how the errors depend explicitly on the mesh size $h$ and time step $\tau$ as well as the small parameter $\varepsilon$. Based on the results, in order to obtain "correct" numerical solutions up to the time at $O(1/\varepsilon)$, the $\varepsilon$-scalability (or meshing strategy requirement) of the FDTD methods should be taken as $h = O(\varepsilon^{1/2})$ and $\tau = O(\varepsilon^{1/2})$. To improve the spatial resolution capacity, we apply the Fourier spectral method to discretize the Dirac equation in space. Error bounds of the resulting finite difference Fourier pseudospectral (FDFP) methods show that they exhibit uniform spatial errors in the long-time regime, which are optimal in space as suggested by the Shannon's sampling theorem. Extensive numerical results are reported to confirm the error bounds and demonstrate that they are sharp.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2023

Error Estimates of Residual Minimization Using Neural Networks for Linear PDES

We propose an abstract framework for analyzing the convergence of least-squares methods based on residual minimization when feasible solutions are neural networks. With the norm relations and compactness arguments, we derive error estimates for both continuous and discrete formulations of residual minimization in strong and weak forms. The formulations cover recently developed physicsinformed neural networks based on strong and variational formulations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Verification Testing For Solid-Element Material Models 11-19 in DYNA3D/ParaDyn

This technical report documents the creation and implementation of verification tests for solid-element material models 11 through 19 available in DYNA3D/ParaDyn. The verification tests covered all aspects of each material model, except for the Weibull distribution functionality in material models 15 and 19. General test cases were created to verify the elastic and plastic behavior of the material models. Other additional tests were developed to examine the intricacies of each material model. Each test involved the use a kinematic load case and specification of material parameters necessary to activate corresponding features of the material model. The load cases prescribed the full time history of the kinematic motion for the solid elements, and these loads are independent of the material model or element formulation. When possible, closed form solutions were then derived for each verification test in a continuum setting. The DYNA3D simulations for each test were carried out over a unit time interval, t ϵ [0, 1], and the as implemented DYNA3D response was compared to the closed form solutions evaluated at discrete points in time. A relative error measure was determined for each test to justify the proper implementation of the material model. The relative errors comparing the DYNA3D solution to the analytical solution were, in general, on the order of machine precision except where noted. This signifies the proper implementation of solid-element material models 11-19. In the development of these verification tests, six bugs were found and fixed in the source code. Additionally, this work generated eighteen DYNA3D input decks and answer extraction scripts in the DYNA3D/ParaDyn Software Quality Assurance test suite, which are comprised of a total of 285 solid-element tests. Testing for each material model utilizes two input decks and answer extraction scripts, where one focuses on the linear elastic response and the other examines the inelastic and remaining functionalities of the material model. In total, this work added 285 individual verification test problems in the DYNA3D/ParaDyn test suite.

42 ENGINEERING↗
DOE OSTI2025

A moment-conserving discontinuous Galerkin representation of the relativistic Maxwellian distribution

Kinetic simulations of relativistic gases and plasmas are critical for understanding diverse astrophysical and terrestrial systems, but the accurate construction of the relativistic Maxwellian, the Maxwell–Jüttner distribution, on a discrete simulation grid is challenging. Difficulties arise from the finite velocity bounds of the domain, which may not capture the entire distribution function, as well as errors introduced by projecting the function onto a discrete grid. Here, we present a novel scheme for iteratively correcting the moments of the projected distribution applicable to all grid-based discretizations of the relativistic kinetic equation. In addition, we describe how to compute the needed nonlinear quantities, such as Lorentz boost factors, in a discontinuous Galerkin scheme through a combination of numerical quadrature and weak operations. The resulting method accurately captures the distribution function and ensures that the moments match the desired values to machine precision.

astrophysical plasmas↗
DOE OSTI2022

Bosonic field digitization for quantum computers

Quantum simulation of quantum field theory is a flagship application of quantum computers that promises to deliver capabilities beyond classical computing. The realization of quantum advantage will require methods that can accurately predict error scaling as a function of the resolution and parameters of the model and that can be implemented efficiently on quantum hardware. In this paper, we address the representation of lattice bosonic fields in a discretized field amplitude basis, develop methods to predict error scaling, and present efficient qubit implementation strategies. A low-energy subspace of the bosonic Hilbert space, defined by a boson occupation number cutoff, can be represented with exponentially good accuracy by a low-energy subspace of a finite-size Hilbert space. The finite representation construction and the associated errors are directly related to the accuracy of the Nyquist-Shannon sampling and the finite Fourier transforms of the boson number states in the field and the conjugate-field bases. We analyze the relation between the boson mass, the discretization parameters used for wave function sampling, and the finite representation size. Numerical simulations of small size Φ 4 problems demonstrate that the boson mass optimizing the sampling of the ground state wave function is a good approximation to the optimal boson mass yielding the minimum low-energy subspace size. However, we find that accurate sampling of general wave functions does not necessarily result in accurate representation. Finally, we develop methods for validating and adjusting the discretization parameters to achieve more accurate simulations.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2020

A coupled multipoint stress–multipoint flux mixed finite element method for the Biot system of poroelasticity

In this work, we present a mixed finite element method for a five-field formulation of the Biot system of poroelasticity that reduces to a cell-centered pressure–displacement system on simplicial and quadrilateral grids. A mixed stress–displacement–rotation formulation for elasticity with weak stress symmetry is coupled with a mixed velocity–pressure Darcy formulation. The spatial discretization is based on combining the multipoint stress mixed finite element (MSMFE) method for elasticity and the multipoint flux mixed finite element (MFMFE) method for Darcy flow. It uses the lowest order Brezzi–Douglas–Marini mixed finite element spaces for the poroelastic stress and Darcy velocity, piecewise constant displacement and pressure, and continuous piecewise linear or bilinear rotation. A vertex quadrature rule is applied to the velocity, stress, and stress–rotation bilinear forms, which block-diagonalizes the corresponding matrices and allows for local velocity, stress, and rotation elimination. This leads to a cell-centered positive-definite system for pressure and displacement at each time step. We perform error analysis for the semidiscrete and fully discrete formulations, establishing first order convergence for all variables in their natural norms. The numerical tests confirm the theoretical convergence rates and illustrate the locking-free property of the method.

42 ENGINEERING↗
DOE OSTI2023

Design and construction of the MUSE permanent magnet stellarator

This paper documents the design and construction of MUSE, the world's first permanent magnet (PM) stellarator and the first quasi-axisymmetric experiment. The purpose of MUSE is to develop and assess a new way of building optimised stellarators that uses simple planar coils PMs. Our PM optimisation algorithm consists of initialising a geometry to pack dipoles densely, running the FAMUS code to minimise surface field error subject to PM constraints and applying discrete jumps to reach a physically realisable solution. FAMUS treats the PM system as a set of ideal point dipoles. From there we construct finite-volume magnet towers to be housed in 3D-printed PM holders. We describe the design of the PM holders, which were validated by laser metrology. We analyse the effects of finite permeability, sensitivity to perturbations and magnetostatic forces. An exact analytic formula for the magnetic field from a finite-volume PM tower is presented to compute PM–PM forces and stress on the PM holder. Stellarator construction is complete and experiments are underway.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2024

Trace anomaly form factors from lattice QCD

The hadron mass can be obtained through the calculation of the trace of the energy-momentum tensor in the hadron which includes the trace anomaly and sigma terms. The anomaly due to conformal symmetry breaking is believed to be an important ingredient for hadron mass generation and confinement. In this work, we will present the calculation of the glue part of the trace anomaly form factors of the pion up to Q 2 ∼ 4.3 GeV 2 and the nucleon up to Q 2 ∼ 1 GeV 2 . The calculations are performed on a domain wall fermion ensemble with overlap valence quarks at seven valence pion masses varying from ∼ 250 to ∼ 540 MeV , including the unitary point ∼ 340 MeV . We calculate the radius of the glue trace anomaly for the pion and the nucleon from the z expansion. By performing a two-dimensional Fourier transform on the glue trace anomaly form factors in the infinite momentum frame with no energy transfer, we also obtain their spatial distributions for several valence quark masses. The results are qualitatively extrapolated to the physical valence pion mass with systematic errors from the unphysical sea quark mass, discretization effects in the renormalization sum rule, and finite-volume effects to be addressed in the future. We find the pion’s form factor changes sign, as does its spatial distribution, for light quark masses. This explains how the trace anomaly contribution to the pion mass approaches zero toward the chiral limit. Published by the American Physical Society 2024

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2021

Distributionally Safe Path Planning: Wasserstein Safe RRT

In this paper, we propose a Wasserstein metric-based random path planning algorithm. Wasserstein Safe RRT (W-Safe RRT) provides finite-sample probabilistic guarantees on the safety of a returned path in an uncertain obstacle environment. Vehicle and obstacle states are modeled as distributions based upon state and model observations. Additionally, we define limits on distributional sampling error so the Wasserstein distance between a vehicle state distribution and obstacle distributions can be bounded. This enables the algorithm to return safe paths with a confidence bound through combining finite sampling error bounds with calculations of the Wasserstein distance between discrete distributions. W-Safe RRT is compared against a baseline minimum encompassing ball algorithm, which ensures balls that minimally encompass discrete state and obstacle distributions do not overlap. The improved performance is verified in a 3D environment using single, multi, and rotating non-convex obstacle cases, with and without forced obstacle error in adversarial directions, showing that W-Safe RRT can handle poorly modeled complex environments.

42 ENGINEERING↗
DOE OSTI2020

On numerical errors to the fields surrounding a relativistically moving particle in PIC codes

The particle-in-cell (PIC) method is widely used to model the self-consistent interaction between discrete particles and electromagnetic fields. It has been successfully applied to problems across plasma physics including plasma based acceleration, inertial confinement fusion, magnetically confined fusion, space physics, astrophysics, high energy density plasmas. In many cases the physics involves how relativistic particles (those with high relativistic γ factors) are generated and interact with plasmas. However, when relativistic particles stream across the grid, both in “vacuum” and in plasma, many numerical issues may arise which can lead to unphysical results. We present a detailed analysis of how discretized Maxwell solvers used in PIC codes can lead to numerical errors to the fields that surround particles that move at relativistic speeds across the grid. Expressions for the axial electric field as integrals in k space are presented that reveal two types of errors. The first arises from errors to the numerator of the integrand and leads to unphysical fields that are antisymmetric about the particle. Furthermore, the second arises from errors to the denominator of the integrand and lead to Cherenkov like radiation in “vacuum”. These fields are not anti-symmetric, extend behind the particle, and cause the particle to accelerate or decelerate depending on the solver and parameters. The unphysical fields are studied in detail for two representative solvers - the Yee solver and the FFT based solver. Although the Cherenkov fields are absent, the space charge fields are still present in the fundamental Brillouin zone for the FFT based solvers. In addition, the Cherenkov fields are present in higher order zones for the FFT based solvers. Comparison between the analytical solutions and PIC simulation results are presented. A solution for eliminating these unphysical fields by modifying the k operator in the axial direction is also presented. Using a customized finite difference solver, this solution was successfully implemented into OSIRIS [1]. Results from the customized solver are also presented. Additionally, this solution will be useful for a beam of particles that all move in one direction with a small angular divergence.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2023

Mesh refinement for anisotropic diffusion in magnetized plasmas

Highly accurate simulation of plasma transport is needed to drive the successful design and operation of magnetically confined fusion reactors. Unfortunately, the extreme anisotropy present in magnetized plasmas results in thin boundary layers that are expensive to resolve. Here, this work investigates how various mesh refinement strategies might reduce that expense to allow for more efficient simulation by comparing standard variable refinement approaches that use a field quantity to an adaptive approach that uses an error estimator. It is first verified that higher order discretization only realizes the proper rate of convergence once the mesh resolves the thin boundary layer, therefore motivating the focusing of refinement on the boundary layer. For three two-dimensional test cases that contain characteristic features of tokamak magnetic fields, an exponential refinement strategy based on the magnetic flux function, which is the standard refinement approach in the field, is compared to an adaptive strategy utilizing the established Zienwiekicz and Zhu error estimator. The adaptive mesh refinement strategy consistently achieves the same accuracy using orders of magnitude less degrees of freedom than either exponential or uniform refinement. This result makes the adaptive refinement strategy more efficient than the exponential refinement strategy while also being more generalizable to problems with complex magnetic geometries. Scaling laws are derived that quantify the improvement in cost of the adaptive refinement strategy over other refinement approaches in 2D and 3D.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Data-driven reduced-order models for port-Hamiltonian systems with operator inference

Hamiltonian operator inference has been developed in Sharma et al. (2022) to learn structure-preserving reduced-order models (ROMs) for Hamiltonian systems. The method constructs a low-dimensional model using only data and knowledge of the functional form of the Hamiltonian. The resulting ROMs preserve the intrinsic structure of the system, ensuring that the mechanical and physical properties of the system are maintained. In this work, we extend this approach to port-Hamiltonian systems, which generalize Hamiltonian systems by including energy dissipation, external input, and output. Based on snapshots of the system’s state and output, together with the information about the functional form of the Hamiltonian, reduced operators are inferred through optimization and are then used to construct data-driven ROMs. To further alleviate the complexity of evaluating nonlinear terms in the ROMs, a hyper-reduction method via discrete empirical interpolation is applied. Accordingly, we derive error estimates for the ROM approximations of the state and output. Lastly, we demonstrate the structure preservation, as well as the accuracy of the proposed port-Hamiltonian operator inference framework, through numerical experiments on a linear mass–spring-damper problem and a nonlinear Toda lattice problem.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Hadronic light-by-light contribution to the muon anomaly from lattice QCD with infinite volume QED at physical pion mass

The hadronic light-by-light scattering contribution to the muon anomalous magnetic moment, (g–2)⁢/2, is computed in the infinite volume QED framework with lattice QCD. We report $a^{HLbL}_μ$ = 12.47⁢(1.15)⁢(0.95) ×10 –10 where the first error is statistical and the second systematic. The result is mainly based on the 2+1 flavor Möbius domain wall fermion ensemble with inverse lattice spacing a –1 = 1.73 GeV, lattice size L = 5.5 fm, and m π = 139 MeV, generated by the RBC-UKQCD collaborations. The leading systematic error of this result comes from the lattice discretization. This result is consistent with previous determinations.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2020

(U) Transport Corrections Implemented in SENSMG

Truncating the spherical harmonics expansion of the neutron scattering source in the Boltzmann transport equation leads to truncation error. Methods for approximately correcting for this truncation error are called transport corrections. The PARTISN multigroup discrete ordinates neutron transport code has three transport correction options. These options can be specified in the SENSMG multigroup neutron sensitivity code and passed to PARTISN for the neutron transport.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2020

A linearity preserving nodal variation limiting algorithm for continuous Galerkin discretization of ideal MHD equations

A stabilized continuous Galerkin (CG) method for magnetohydrodynamics (MHD) is presented herein. Ideal, compressible inviscid MHD equations are discretized in space on unstructured meshes using piecewise linear or bilinear finite element bases to get a semi-discrete scheme. Stabilization is then introduced to the semi-discrete method in a strategy that follows the algebraic flux correction paradigm. This involves adding some artificial diffusion to the high order, semi-discrete method and mass lumping in the time derivative term. The result is a low order method that provides local extremum diminishing properties for hyperbolic systems. The difference between the low order method and the high order method is scaled element-wise using a limiter and added to the low order scheme. The limiter is solution dependent and computed via an iterative linearity preserving nodal variation limiting strategy. The stabilization also involves an optional consistent background high order dissipation that reduces phase errors. The resulting stabilized scheme is a semi-discrete method that can be applied to inviscid shock MHD problems and may be even extended to resistive and viscous MHD problems. To satisfy the divergence free constraint of the MHD equations, we add parabolic divergence cleaning to the system. Various time integration methods can be used to discretize the scheme in time. We demonstrate the robustness of the scheme by solving several shock MHD problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2026

Discrete Superconvergence Analysis for Quantum Magnus Algorithms of Unbounded Hamiltonian Simulation

Motivated by various applications, unbounded Hamiltonian simulation has recently garnered great attention. Quantum Magnus algorithms, designed to achieve commutator scaling for time-dependent Hamiltonian simulation, have been found to be particularly efficient for such applications. When applied to unbounded Hamiltonian simulation in the interaction picture, they exhibit an unexpected superconvergence phenomenon. However, existing proofs are limited to the spatially continuous setting and do not extend to discrete spatial discretizations. Here, in this work, we provide the first superconvergence estimate in the fully discrete setting with a finite number of spatial discretization points N, and show that it holds with an error constant uniform in N. The proof is based on the two-parameter symbol class, which, to our knowledge, is applied for the first time in algorithm analysis. The key idea is to establish a semiclassical framework by identifying two parameters through the discretization number and the time step size rescaled by the operator norm, such that the semiclassical uniformity guarantees the uniformity of both. This approach may have broader applications in numerical analysis beyond the specific context of this work.

Borns-Weil, Yonah [University of California, Berke↗
DOE OSTI2020

Gluon field digitization via group space decimation for quantum computers

Efficient digitization is required for quantum simulations of gauge theories. Schemes based on discrete subgroups use fewer qubits at the cost of systematic errors. We systematize this approach by deriving a single plaquette action for approximating general continuous gauge groups through integrating out field fluctuations. This provides insight into the effectiveness of these approximations, and how they could be improved. We accompany the scheme by simulations of pure gauge over the largest discrete subgroup of SU(3) up to the third order.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗