Search NASA⌕ Search

SEARCH · Search NASA

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 55 records · Page 3

Numerical error analysis of SOLPS-ITER simulations of EAST

Abstract Plasma edge simulations with codes like SOLPS-ITER are widely employed to interpret fusion experiments. However, numerical errors appearing in such simulations are rarely investigated, despite their potential large impact on simulation results. These errors consist of the statistical error and the bias, both resulting from the finite number of employed EIRENE Monte Carlo particles and incomplete convergence, and the discretization error due to the finite resolution of the computational grids. In this contribution, the resulting numerical errors on simulations of pure deuterium and neon seeded H-mode EAST discharges are examined. The statistical error can be kept small compared to other numerical error contributions by averaging the plasma profiles. This allows investigating the bias and discretization errors using Richardson extrapolation. It is shown that grid refinement and the number of employed Monte Carlo particles have the largest influence on the result, in agreement with similar studies of an ITER deuterium case. For the first time, numerical error bars on the entire simulated target profiles are determined showing that the largest numerical error is 17.9%, mainly due to the plasma grid discretization. On top, also numerical errors on simulated neutral pressures are investigated in detail, for which the statistical error is dominant. The analysis demonstrates which setup is needed to keep numerical errors limited: the SOLPS-ITER averaging procedure should be employed including enough EIRENE particles, and the involved grids should be sufficiently refined to reduce discretization errors.

Boeyaert, Dieter (ORCID:0000000309208660)↗

Comparison of Spatial Discretization Methods for Solving the S N Equations Using a Three-Dimensional Method of Manufactured Solutions Benchmark Suite with Escalating Order of Nonsmoothness

For this study, a comparison of the accuracy and computational efficiency of spatial discretization methods of the three-dimensional S N equations is conducted, including discontinuous Galerkin finite element methods, the arbitrarily high-order transport method of nodal type (AHOTN), the linear-linear method, the linear-nodal (LN) method, and the higher-order diamond difference method. For this purpose, we have developed a suite of method of manufactured solutions benchmarks that provides an exact solution of the S N equations even in the presence of scattering. Most importantly, our benchmark suite permits the user to set an arbitrary level of smoothness of the exact solution across the singular characteristics. Our study focuses on the computational efficiency of the considered spatial discretization methods. Numerical results indicate that the best-performing method depends on the norm used to measure the discretization error. We employ discrete Lp norms and integral error norms in this work. For configurations with continuous exact angular flux, high-order AHOTNs perform best under L p error norms, while the LN method performs best when measured by integral error norms. Lastly, when the angular flux is discontinuous, a new singular-characteristic tracking method for three-dimensional geometries performs best among the considered methods.

97 MATHEMATICS AND COMPUTING↗

Variable-fidelity multipoint aerodynamic shape optimization with output-based adapted meshes

This work presents a method to control the discretization error in multipoint aerodynamic shape optimization using output-based adapted meshes. The meshes are adapted via adjoint-based error estimates, taking into account both the objective and constraint output errors. A multi-fidelity optimization framework is then developed by taking advantage of the variable fidelity offered by adaptive meshes. The objective functional and its sensitivity at each design point (operating condition) are first evaluated on the same initial coarse mesh, which is then subsequently adapted for each design point individually as the shape optimization proceeds. The effort to set up the optimization is minimal since the initial mesh can be fairly coarse and easy to generate. As the shape approaches the optimal design, the mesh at each design point becomes finer, in regions necessary for that particular operating condition. The multi-fidelity framework is tightly coupled with the objective error estimation to ensure the optimization accuracy at each fidelity. Computational savings arise from a reduction of the mesh size when the design is far from optimal and avoiding an exhaustive search on low-fidelity meshes. The proposed method is demonstrated on multipoint drag minimization problems of a transonic airfoil with lift and area constraints. Improved accuracy and efficiency are shown compared to traditional fixed-fidelity optimization with a fixed computational mesh.

42 ENGINEERING↗

Quantifying the uncertainty introduced by discretization and time-averaging in two-fluid model predictions

The two-fluid model (TFM) has become a tool for the design and troubleshooting of industrial fluidized bed reactors. To use TFM for scale up with confidence, the uncertainty in its predictions must be quantified. Here, we study two sources of uncertainty: discretization and time-averaging. First, we show that successive grid refinement may not yield grid-independent transient quantities, including cross-section–averaged quantities. Successive grid refinement would yield grid-independent time-averaged quantities on sufficiently fine grids. A Richardson extrapolation can then be used to estimate the discretization error, and the grid convergence index gives an estimate of the uncertainty. Richardson extrapolation may not work for industrial-scale simulations that use coarse grids. We present an alternative method for coarse grids and assess its ability to estimate the discretization error. Second, we assess two methods (autocorrelation and binning) and find that the autocorrelation method is more reliable for estimating the uncertainty introduced by time-averaging TFM data.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Recent Studies on the Asymptotic Convergence of the Spatial Discretization for Two-Dimensional Discrete Ordinates Solutions

In this paper, four types of quadrature schemes are used to define discrete directions in the solution of a two-dimensional fixed-source discrete ordinates problem in Cartesian geometry. Such schemes enable generating numerical results for averaged scalar fluxes over specified regions of the domain with high number (up to 105) of directions per octant. Two different nodal approaches, the ADO and AHOT-N0 methods, are utilized to obtain the numerical results of interest. The AHOT-N0 solutions on a sequence of refined meshes are then used to develop an asymptotic analysis of the spatial discretization error in order to derive a reference solution. It was more clearly observed that the spatial discretization error converges asymptotically with second order for the source region with all four quadratures employed, while for the other regions refined meshes along with tighter convergence criterion must be applied to evidence the same behavior. Although, in that case, some differences among the four quadrature schemes results were found.

97 MATHEMATICS AND COMPUTING↗

Bottomonium spectrum at order v{sup 6} from domain-wall lattice QCD: Precise results for hyperfine splittings

The bottomonium spectrum is computed in dynamical 2+1 flavor lattice QCD, using nonrelativistic QCD for the b quarks. The main calculations in this work are based on gauge field ensembles generated by the RBC and UKQCD Collaborations with the Iwasaki action for the gluons and a domain-wall action for the sea quarks. Lattice spacing values of approximately 0.08 fm and 0.11 fm are used, and simultaneous chiral extrapolations to the physical pion mass are performed. As a test for gluon-discretization errors, the calculations are repeated on two ensembles generated by the MILC Collaboration with the Luescher-Weisz gauge action. Gluon-discretization errors are also studied in a lattice potential model using perturbation theory for four different gauge actions. The nonperturbative lattice QCD results for the radial and orbital bottomonium energy splittings obtained from the RBC/UKQCD ensembles are found to be in excellent agreement with experiment. To get accurate results for spin splittings, the spin-dependent order-v{sup 6} terms are included in the nonrelativistic QCD action, and suitable ratios are calculated such that most of the unknown radiative corrections cancel. The cancellation of radiative corrections is verified explicitly by repeating the calculations with different values of the couplings in the nonrelativistic QCD action. Using the lattice ratios of the S-wave hyperfine and the 1P tensor splitting, and the experimental result for the 1P tensor splitting, the 1S hyperfine splitting is found to be 60.3{+-}5.5{sub stat{+-}}5.0{sub syst{+-}}2.1{sub exp} MeV, and the 2S hyperfine splitting is predicted to be 23.5{+-}4.1{sub stat{+-}}2.1{sub syst{+-}}0.8{sub exp} MeV.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Galerkin v. discrete-optimal projection in nonlinear model reduction

Discrete-optimal model-reduction techniques such as the Gauss{Newton with Approximated Tensors (GNAT) method have shown promise, as they have generated stable, accurate solutions for large-scale turbulent, compressible ow problems where standard Galerkin techniques have failed. However, there has been limited comparative analysis of the two approaches. This is due in part to difficulties arising from the fact that Galerkin techniques perform projection at the time-continuous level, while discrete-optimal techniques do so at the time-discrete level. This work provides a detailed theoretical and experimental comparison of the two techniques for two common classes of time integrators: linear multistep schemes and Runge{Kutta schemes. We present a number of new ndings, including conditions under which the discrete-optimal ROM has a time-continuous representation, conditions under which the two techniques are equivalent, and time-discrete error bounds for the two approaches. Perhaps most surprisingly, we demonstrate both theoretically and experimentally that decreasing the time step does not necessarily decrease the error for the discrete-optimal ROM; instead, the time step should be `matched' to the spectral content of the reduced basis. In numerical experiments carried out on a turbulent compressible- ow problem with over one million unknowns, we show that increasing the time step to an intermediate value decreases both the error and the simulation time of the discrete-optimal reduced-order model by an order of magnitude.

CFD↗

Addendum: Unified framework for open quantum dynamics with memory

This Addendum presents a detailed analysis of the discretization error in time-integration and time-derivative that appear in the Nakajima-Zwanzig equation. This was brought to our attention by Makri et al. [arXiv:2410.08239]. Our analysis in the Addendum shows that the relationship derived in our earlier work [Nat. Commun. 15, 8087 (2024)] is valid within the choice of discretization and is not contaminated by the discretization error.

Science & Technology - Other Topics↗

DPM: A deep learning PDE augmentation method with application to large-eddy simulation

A framework is introduced that leverages known physics to reduce overfitting in machine learning for scientific applications. The partial differential equation (PDE) that expresses the physics is augmented with a neural network that uses available data to learn a description of the corresponding unknown or unrepresented physics. Training within this combined system corrects for missing, unknown, or erroneously represented physics, including discretization errors associated with the PDE's numerical solution. For optimization of the network within the PDE, an adjoint PDE is solved to provide high-dimensional gradients, and a stochastic adjoint method (SAM) further accelerates training. Additionally, the approach is demonstrated for large-eddy simulation (LES) of turbulence. High-fidelity direct numerical simulations (DNS) of decaying isotropic turbulence provide the training data used to learn sub-filter-scale closures for the filtered Navier–Stokes equations. Out-of-sample comparisons show that the deep learning PDE method outperforms widely-used models, even for filter sizes so large that they become qualitatively incorrect. It also significantly outperforms the same neural network when a priori trained based on simple data mismatch, not accounting for the full PDE. Measures of discretization errors, which are well-known to be consequential in LES, point to the importance of the unified training formulation's design, which without modification corrects for them. For comparable accuracy, simulation runtime is significantly reduced. A relaxation of the typical discrete enforcement of the divergence-free constraint in the solver is also successful, instead allowing the DPM to approximately enforce incompressibility physics. Since the training loss function is not restricted to correspond directly to the closure to be learned, training can incorporate diverse data, including experimental data.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Electron-Proton Scattering Event Generation using Structured Tokenization

Recent work such as Omnijet-$\alpha$ has demonstrated that effective tokenization combined with transformer-based architectures can produce effective foundation models for jet physics. While tokenization may help models capture generalizable event characteristics, it also introduces discretization errors that may compromise the precision required for downstream physics analyses. As the number and complexity of the particle features grow, these errors are likely to grow proportionally. In this study, we investigate new tokenization strategies to improve the application of generative transformer models to \textsc{Pythia8} simulations of electron-proton scattering at the Electron-Ion Collider. Specifically, we propose a feature-based structured tokenization approach that utilizes multiple tokens per particle, improving expressivity, while reducing the total number of unique tokens needed. We evaluate this method against grid-based binning, K-means clustering, and vector-quantized variational auto-encoders on the event simulations. Our results show that feature-based structured tokenization reduces discretization error, leading to more accurate generative modeling of particle-level events.

Goldenberg, Steven [Thomas Jefferson National Acce↗

Electron-Proton Scattering Event Generation using Structured Tokenization

Recent work such as Omnijet-$\alpha$ has demonstrated that effective tokenization combined with transformer-based architectures can produce effective foundation models for jet physics. While tokenization may help models capture generalizable event characteristics, it also introduces discretization errors that may compromise the precision required for downstream physics analyses. As the number and complexity of the particle features grow, these errors are likely to grow proportionally. In this study, we investigate new tokenization strategies to improve the application of generative transformer models to \textsc{Pythia8} simulations of electron-proton scattering at the Electron-Ion Collider. Specifically, we propose a feature-based structured tokenization approach that utilizes multiple tokens per particle, improving expressivity, while reducing the total number of unique tokens needed. We evaluate this method against grid-based binning, K-means clustering, and vector-quantized variational auto-encoders on the event simulations. Our results show that feature-based structured tokenization reduces discretization error, leading to more accurate generative modeling of particle-level events.

Goldenberg, Steven [Thomas Jefferson National Acce↗

Quantum simulation of real-space dynamics

Quantum simulation is a prominent application of quantum computers. While there is extensive previous work on simulating finite-dimensional systems, less is known about quantum algorithms for real-space dynamics. We conduct a systematic study of such algorithms. In particular, we show that the dynamics of a d-dimensional Schrödinger equation with η particles can be simulated with gate complexity O ~ (ηdFpoly(log(g'/ϵ))), where ϵ is the discretization error, g' controls the higher-order derivatives of the wave function, and F measures the time-integrated strength of the potential. Compared to the best previous results, this exponentially improves the dependence on ϵ and g' from poly(g'/ϵ) to poly(log(g'/ϵ)) and polynomially improves the dependence on T and d, while maintaining best known performance with respect to η. For the case of Coulomb interactions, we give an algorithm using η 3 (d + η)Tpoly(log(ηdTg'/(Δϵ)))/Δ one- and two-qubit gates, and another using η 3 (4d) d/2 Tpoly(log(ηdTg'/(Δϵ)))/Δ one- and two-qubit gates and QRAM operations, where T is the evolution time and the parameter Δ regulates the unbounded Coulomb interaction. We give applications to several computational problems, including faster real-space simulation of quantum chemistry, rigorous analysis of discretization error for simulation of a uniform electron gas, and a quadratic improvement to a quantum algorithm for escaping saddle points in nonconvex optimization.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

B -meson decay constants from 2 + 1 -flavor lattice QCD with domain-wall light quarks and relativistic heavy quarks

We calculate the B-meson decay constants f B , f B s , and their ratio in unquenched lattice QCD using domain-wall light quarks and relativistic b quarks. We use gauge-field ensembles generated by the RBC and UKQCD collaborations using the domain-wall fermion action and Iwasaki gauge action with three flavors of light dynamical quarks. We analyze data at two lattice spacings of a ≈ 0.11, 0.086 fm with unitary pion masses as light as M π ≈ 290 MeV; this enables us to control the extrapolation to the physical light-quark masses and continuum. For the b quarks we use the anisotropic clover action with the relativistic heavy-quark interpretation, such that discretization errors from the heavy-quark action are of the same size as from the light-quark sector. We renormalize the lattice heavy-light axial-vector current using a mostly nonperturbative method in which we compute the bulk of the matching factor nonperturbatively, with a small correction, that is close to unity, in lattice perturbation theory. We also improve the lattice heavy-light current through O(α s a). We extrapolate our results to the physical light-quark masses and continuum using SU(2) heavy-meson chiral perturbation theory, and provide a complete systematic error budget. We obtain f B 0 = 199.5(12.6) MeV, f B + =195.6(14.9) MeV, f B s =235.4(12.2) MeV, f B s /f B 0 =1.197(50), and f B s /f B + =1.223(71), where the errors are statistical and total systematic added in quadrature. Finally, these results are in good agreement with other published results and provide an important independent cross-check of other three-flavor determinations of B-meson decay constants using staggered light quarks.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Calibr8 v.1.0

Calibr8 provides an application to rapidly prototype and perform material model calibration for complex plasticity models using advanced adjoint or forward sensitivity analyses for execution on massively parallel machines. These techniques can be orders of magnitude faster than traditional finite difference approaches for material model calibration. The underlying technology used in Calibr8 is automatic differentiation, which allows for the rapid implementation and testing of new plasticity models within its framework. Additionally, Calibr8 can perform adjoint-based error estimation to approximate discretization errors for user-implemented plasticity models. Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-NA0003525. SAND2021-10630 O

Granzow, BrianN.↗

Validation of URANS and STRUCT-ε turbulence models for stratified sodium flow

Simulations of a transient stratified sodium experiment are carried out using a classic unsteady RANS model and the second-generation URANS model, STRUCT-ε. Turbulence modeling challenges and their implications to stratified flow prediction are discussed in the context of other sources of error. Input errors are discussed and addressed; discretization error is calculated to be less than 5% of the inlet velocity, for 80% of the domain; and remaining errors in temperature distributions are attributed to the turbulence model. Qualitative flow features from the simulations are presented and discussed. Compared to the experiment, the STRUCT-ε turbulence model provides a more physically accurate prediction of temperature and momentum mixing in key regions of the domain. Quantitative measures such as the L 2 norm of the temperature discrepancy demonstrate the improved performance of the STRUCT-ε approach. In conclusion, the magnitude of the temperature fluctuations is very well-predicted by the STRUCT-ε, while URANS overpredicts them by approximately 50%.

42 ENGINEERING↗

Optimal binning of correlated measurements

Experimental measurements are commonly represented on a discrete grid, requiring a balance between granularity and statistical noise. Two strategies have traditionally been used to improve such representations: selecting an appropriate bin width to control discretization error and applying kernel-based smoothing to suppress fluctuations. Despite their shared goal, these approaches have largely developed independently, without a unified statistical description of how discretization and correlation jointly determine measurement precision. Here, we extend the discussion of optimal interval averaging to a correlation-aware setting by Gaussian process regression, which explicitly accounts for correlations among neighboring bins. Starting from first principles, we derive the mean-squared error of discretized measurements and obtain closed-form asymptotic expressions for the optimal bin width and correlation length. When recast in reduced variables, the theory reveals distinct universal scaling laws governing the error in the correlation-free and correlation-controlled regimes. Characterized by intrinsically smooth intensity profiles and counting-based statistics, neutron scattering measurements are well suited for demonstrating the enhanced error contraction enabled by inter-bin correlations. We show that such improvement is achievable over the experimentally accessible Q-range and across multiple instruments and material systems. These results show that explicitly accounting for correlations systematically reshapes the limits of precision in discretized, noise-limited measurements. More broadly, the framework provides a transferable statistical foundation for optimizing data representation, inference, and experimental design across the physical and data sciences.

Tung, Chi-Huan [ORNL] (ORCID:0000000221972074)↗