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 271 records · Page 15

A posteriori error estimates for finite volume approximations of elliptic equations on general surfaces

In this paper, we present a residual-based a posteriori error estimate for the finite volume discretization of steady convection– diffusion–reaction equations defined on surfaces in R3, which are often implicitly represented as level sets of smooth functions. Reliability and efficiency of the proposed a posteriori error estimator are rigorously proved. Numerical experiments are also conducted to verify the theoretical results and demonstrate the robustness of the error estimator.

97 MATHEMATICS AND COMPUTING↗

Analysis of a Computational Framework for Bayesian Inverse Problems: Ensemble Kalman Updates and MAP Estimators under Mesh Refinement

This paper analyzes a popular computational framework to solve infinite-dimensional Bayesian inverse problems, discretizing the prior and the forward model in a finite-dimensional weighted inner product space. We demonstrate the benefit of working on a weighted space by establishing operator-norm bounds for finite element and graph-based discretizations of Matérn-type priors and deconvolution forward models. For linear-Gaussian inverse problems, we develop a general theory to characterize the error in the approximation to the posterior. We also embed the computational framework into ensemble Kalman methods and MAP estimators for nonlinear inverse problems. Furthermore, our operator-norm bounds for prior discretizations guarantee the scalability and accuracy of these algorithms under mesh refinement.

Bayesian inverse problem↗

fPINNs: Fractional Physics-Informed Neural Networks

Physics-informed neural networks (PINNs), introduced, are effective in solving integer-order partial differential equations (PDEs) based on scattered and noisy data. PINNs employ standard feedforward neural networks (NNs) with the PDEs explicitly encoded into the NN using automatic differentiation, while the sum of the mean-squared PDE residuals and the mean-squared error in initial-boundary conditions is minimized with respect to the NN parameters. Here we extend PINNs to fractional PINNs (fPINNs) to solve space-time fractional advection-diffusion equations (fractional ADEs), and we study systematically their convergence, hence explaining both fPINNs and PINNs for the first time. Specifically, we demonstrate their accuracy and effectiveness in solving multidimensional forward and inverse problems with forcing terms whose values are only known at randomly scattered spatio-temporal coordinates (black-box (BB) forcing terms). A novel element of the fPINNs is the hybrid approach that we introduce for constructing the residual in the loss function using both automatic differentiation for the integer-order operators and numerical discretization for the fractional operators. This approach bypasses the difficulties stemming from the fact that automatic differentiation is not applicable to fractional operators because the standard chain rule in integer calculus is not valid in fractional calculus. To discretize the fractional operators, we employ the Grünwald--Letnikov (GL) formula in one-dimensional fractional ADEs and the vector GL formula in conjunction with the directional fractional Laplacian in two- and three-dimensional fractional ADEs. We first consider the one-dimensional fractional Poisson equation and compare the convergence of the fPINNs against the finite difference method (FDM). We present the solution convergence using both the mean L 2 error as well as the standard deviation due to sensitivity to NN parameter initializations. Using different GL formulas we observe first-, second-, and third-order convergence rates for small size training sets but the error saturates for larger training sets. We explain these results by analyzing the four sources of numerical errors due to discretization, sampling, NN approximation, and optimization. The total error decays monotonically (below 10 –5 for a third-order GL formula) but it saturates beyond that point due to the optimization error. We also analyze the relative balance between discretization and sampling errors and observe that the sampling size and the number of discretization points (auxiliary points) should be comparable to achieve the highest accuracy. As we increase the depth of the NN up to certain value, the mean error decreases and the standard deviation increases, whereas the width has essentially no effect unless its value is either too small or too large. We next consider time-dependent fractional ADEs and compare white-box (WB) and BB forcing. We observe that for the WB forcing, our results are similar to the aforementioned cases; however, for the BB forcing fPINNs outperform FDM. Subsequently, we consider multidimensional time-, space-, and space-time-fractional ADEs using the directional fractional Laplacian and we observe relative errors of 10 –3 ~ 10 –4 . Lastly, we solve several inverse problems in one, two, and three dimensions to identify the fractional orders, diffusion coefficients, and transport velocities and obtain accurate results given proper initializations even in the presence of significant noise.

97 MATHEMATICS AND COMPUTING↗

Fourth order exponential time differencing method with local discontinuous Galerkin approximation for coupled nonlinear Schrodinger equations

In this paper, we study a local discontinuous Galerkin method combined with fourth order exponential time differencing Runge-Kutta time discretization and a fourth order conservative method for solving the nonlinear Schrödinger equations. Based on different choices of numerical fluxes, we propose both energy-conserving and energy-dissipative local discontinuous Galerkin methods, and have proven the error estimates for the semi-discrete methods applied to linear Schrödinger equation. The numerical methods are proven to be highly efficient and stable for long-range soliton computations. Finally, extensive numerical examples are provided to illustrate the accuracy, efficiency and reliability of the proposed methods.

97 MATHEMATICS AND COMPUTING↗

Subgrid modelling for two-dimensional turbulence using neural networks

Here in this investigation, a data-driven turbulence closure framework is introduced and deployed for the subgrid modelling of Kraichnan turbulence. The novelty of the proposed method lies in the fact that snapshots from high-fidelity numerical data are used to inform artificial neural networks for predicting the turbulence source term through localized grid-resolved information. In particular, our proposed methodology successfully establishes a map between inputs given by stencils of the vorticity and the streamfunction along with information from two well-known eddy-viscosity kernels. Through this we predict the subgrid vorticity forcing in a temporally and spatially dynamic fashion. Our study is both a priori and a posteriori in nature. In the former, we present an extensive hyper-parameter optimization analysis in addition to learning quantification through probability-density-function-based validation of subgrid predictions. In the latter, we analyse the performance of our framework for flow evolution in a classical decaying two-dimensional turbulence test case in the presence of errors related to temporal and spatial discretization. Statistical assessments in the form of angle-averaged kinetic energy spectra demonstrate the promise of the proposed methodology for subgrid quantity inference. In addition, it is also observed that some measure of a posteriori error must be considered during optimal model selection for greater accuracy. The results in this article thus represent a promising development in the formalization of a framework for generation of heuristic-free turbulence closures from data.

42 ENGINEERING↗

Verification & Validation of High-Order Short-Characteristics-Based Deterministic Transport Methodology on Unstructured Grids

The research team has developed a practical, high-order, discrete-ordinates, short characteristics neutron transport code for three-dimensional configurations represented on unstructured tetrahedral grids that can be used for realistic reactor physics applications at both the assembly and core levels. This project will perform a comprehensive verification and validation of this new computational tool against both a continuous-energy Monte Carlo simulation (e.g. MCNP) and experimentally measured data, an essential prerequisite for its deployment in reactor core modeling. Verification is divided into three phases. The team will first conduct spatial mesh and expansion order refinement studies to monitor convergence of the numerical solution to reference solutions. This is quantified by convergence rates that are based on integral error norms computed from the cell-by-cell difference between the code’s numerical solution and its reference counterpart. The latter is either analytic or very fine- mesh numerical solutions from independent computational tools. For the second phase, the team will create a suite of code-independent benchmark configurations to enable testing the theoretical order of accuracy of any particular discretization of the discrete ordinates approximation of the transport equation. For each tested case (i.e. mesh and spatial approximation order), researchers will execute the code and compare the resulting numerical solution to the exact solution on a per cell basis to determine the distribution of the numerical error. The final activity comprises a comparison to continuous-energy Monte Carlo solutions for zero-power critical configuration measurements at Idaho National Laboratory’s Advanced Test Reactor (ATR). Results of this comparison will allow the investigators to distinguish between modeling errors and the above-listed discretization errors introduced by the deterministic method, and to separate the sources of uncertainty.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Error analysis of numerical methods for thick diffusive neutron transport problems on Shishkin mesh

A thin layer will develop at the boundary if the incoming angular flux is anisotropic in thick diffusive neutron transport problems. Solving such singularly perturbed problems, which have non-smooth solutions with singularity near the boundary, is computationally challenging. Standard finite difference schemes on a uniform mesh cannot yield ε-uniform convergence, where ε is a small parameter, while it can be achieved on a suitable piecewise-uniform Shishkin mesh. We present a formal error analysis of the diamond difference (DD) method and step difference (SD) method for solving the S{sub N} neutron transport equation. The analysis can be extended to other finite difference methods. Numerical results are presented to confirm the error estimates and the advantages of the Shishkin mesh. (author)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

A Fast Algebraic Multigrid Solver and Accurate Discretization for Highly Anisotropic Heat Flux I: Open Field Lines

We present a novel solver technique for the anisotropic heat flux equation, aimed at the high level of anisotropy seen in magnetic confinement fusion plasmas. Such problems pose two major challenges: (i) discretization accuracy and (ii) efficient implicit linear solvers. We simultaneously address each of these challenges by constructing a new finite element discretization with excellent accuracy properties, tailored to a novel solver approach based on algebraic multigrid (AMG) methods designed for advective operators. We pose the problem in a mixed formulation, introducing the directional temperature gradient as an auxiliary variable. The temperature and auxiliary fields are discretized in a scalar discontinuous Galerkin space with upwinding principles used for discretizations of advection. We demonstrate the proposed discretization’s superior accuracy over other discretizations of anisotropic heat flux, achieving error 1000x smaller for anisotropy ratio of 10 9 , for closed field lines. The block matrix system is reordered and solved in an approach where the two advection operators are inverted using AMG solvers based on approximate ideal restriction, which is particularly efficient for upwind discontinuous Galerkin discretizations of advection. To ensure that the advection operators are nonsingular, in this paper we restrict ourselves to considering open (acyclic) magnetic field lines for the linear solvers. We demonstrate fast convergence of the proposed iterative solver in highly anisotropic regimes where other diffusion-based AMG methods fail.

97 MATHEMATICS AND COMPUTING↗

Efficient Multigrid Reduction-in-Time for Method-of-Lines Discretizations of Linear Advection

Parallel-in-time methods for partial differential equations (PDEs) have been the subject of intense development over recent decades, particularly for diffusion-dominated problems. It has been widely reported in the literature, however, that many of these methods perform quite poorly for advection-dominated problems. In this report we analyze the particular iterative parallel-in-time algorithm of multigrid reduction-in-time (MGRIT) for discretizations of constant-wave-speed linear advection problems. We focus on common method-of-lines discretizations that employ upwind finite differences in space and Runge-Kutta methods in time. Using a convergence framework we developed in previous work, we prove for a subclass of these discretizations that, if using the standard approach of rediscretizing the fine-grid problem on the coarse grid, robust MGRIT convergence with respect to CFL number and coarsening factor is not possible. This poor convergence and non-robustness is caused, at least in part, by an inadequate coarse-grid correction for smooth Fourier modes in space-time known as characteristic components. We propose an alternative coarse-grid operator that provides a better correction of these modes. This coarse-grid operator is related to previous work and uses a semi-Lagrangian discretization combined with an implicitly treated truncation error correction. Theory and numerical experiments show the proposed coarse-grid operator yields fast MGRIT convergence for many of the method-of-lines discretizations considered, including for both implicit and explicit discretizations of high order. Parallel results demonstrate speed-up over sequential time-stepping.

97 MATHEMATICS AND COMPUTING↗

Concatenated dual displacement code for continuous-variable quantum error correction

The continuous-variable (CV) Gaussian no-go theorem fundamentally limits the suppression of Gaussian displacement errors using only Gaussian gates and states. Prior studies have employed Gottesman-Kitaev-Preskill (GKP) states as ancillary qumodes to suppress small Gaussian displacement errors. However, when the displacement magnitude becomes large, inevitable lattice-crossing errors arise beyond the correctable range of the GKP state. To address this issue, we concatenate the Gaussian-noise-suppression circuit with an outer analog Steane code that corrects such occasional lattice-crossing events as well as other abrupt displacement errors. Contrary to conventional concatenation, which primarily aims to reduce logical error rates, the Steane-GKP duality in encoding provides complementary protection against displacement errors at different scales: The inner GKP layer employs non-Gaussian resources to suppress continuous Gaussian noise and reduce residual variance, while the outer analog Steane code corrects discrete lattice-crossing events that exceed the GKP correctable range. It is precisely this separation of error-mitigation roles that enables CV error correction. In contrast to prior work on concatenating GKP and repetition codes to establish error correction for discrete qubit/qudit encoding, we provide correction in the continuous encoding space. Analytical studies show that, under infinite squeezing, the concatenated code suppresses the variance of Gaussian displacement errors acting on all qumodes by up to 50%, while enabling unbiased correction of lattice-crossing errors with a success probability determined by the ratio between the residual Gaussian error standard deviation and the lattice-crossing magnitude. Even with finite squeezing, the proposed architecture still provides Gaussian-error suppression and lattice-crossing correction. Moreover, the presence of the outer analog Steane code relaxes the squeezing requirement of the inner GKP states, indicating near-term experimental feasibility. This work establishes a viable route toward fault-tolerant continuous-variable quantum computation and provides insight into the design of concatenated CV error-correcting architectures.

quantum error correction↗

Update on a short-distance $D^0$-meson mixing calculation with $N_f=2+1$ flavors

We present an update on our calculation of the short-distance $D^0$-meson mixing hadronic matrix elements. The analysis is performed on the MILC collaboration's $N_f=2+1$ asqtad configurations. We use asqtad light valence quarks and the Sheikoleslami-Wohlert action with the Fermilab interpretation for the valence charm quark. SU(3), partially quenched, rooted, staggered heavy-meson chiral perturbation theory is used to extrapolate to the chiral-continuum limit. Systematic errors arising from the chiral-continuum extrapolation, heavy-quark discretization, and quark-mass uncertainties are folded into the statistical errors from the chiral-continuum fits with methods of Bayesian inference. A preliminary error budget for all five operators is presented.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

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↗

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↗

Stochastic Richardson Extrapolation Based Numerical Error Estimation for Kinetic Plasma Simulations

We present a numerical error estimation technique specifically formulated to deal with stochastic code output with multiple discretization parameters. This method is based on multiple fits to an error model with arbitrary convergence rates and cross-coupling terms, performed using nonlinear optimization. The fitting approach varies by the type of residual norm which influences the importance of outliers, and weights which influences the relative importance of data points in the coarse and refined regions of discretization parameter space. To account for the influence of stochastic noise, these fits are performed on multiple bootstrap values based on the underlying response data set. Using an automated discretization domain selection scheme, the fits are performed on a series of reduced sets of discretization levels in order to find an optimal fully-converged result estimate in the minimum variance sense; this automated approach enables straightforward analysis of multiple quantities of interest and/or time and spatially-dependent response data. The overall numerical error analysis method is useful for verification and validation problems for stochastic simulation methods and forms a key component in the overall uncertainty quantification process. The method was demonstrated for steady and unsteady electron diode problems simulated using a particle-in-cell kinetic plasma code, demonstrating excellent results.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Compact finite difference schemes for the time fractional diffusion equation with nonlocal boundary conditions

Fourth-order compact finite difference schemes for solving the time fractional diffusion equation with nonlocal boundary conditions are considered in this paper. The second-order derivative in one space variable is approximated by a fourth-order compact finite difference. Two different time derivatives, the Caputo derivative and Riemann–Liouville derivative are considered in the equations that we discuss. The Caputo time derivative is discretized by the L1-approximation and a second-order approximation is used for the Riemann–Liouville derivative. Stability analysis using the discrete energy method for Scheme I is given, and error estimation of this scheme is derived by conducting the local truncation error analysis, using the stability result. Numerical results are provided to show that both two fully discrete schemes have fourth-order accuracy in space, and 2−γ order of accuracy in time for Scheme I with γ being the order of the fractional derivative, while Scheme II has second-order accuracy in time when the theoretical solutions are smooth with zero initial values.

97 MATHEMATICS AND COMPUTING↗

EMAPS: An Efficient Multiscale Approach to Plasma Systems with Non-MHD Scale Effects

Using Discrete-Event Simulation (DES) as a novel paradigm for time integration of large-scale physics-driven systems, we have achieved significant breakthroughs in simulations of multi-dimensional magnetized plasmas where ion kinetic and finite Larmor radius (FLR) and Hall effects play a crucial role. For these purposes we apply a unique asynchronous simulation tool: a parallel, electromagnetic Particle-in-Cell (PIC) code, HYPERS (Hybrid Particle Event-Resolved Simulator), which treats plasma electrons as a charge neutralizing fluid and solves a self-consistent set of non-radiative Maxwell, electron fluid equations and ion particle equations on a structured computational grid. HYPERS enables adaptive local time steps for particles, fluid elements and electromagnetic fields. This ensures robustness (stability) and efficiency (speed) of highly dynamic and nonlinear simulations of compact plasma systems such spheromaks, FRCs, ion beams and edge plasmas. HYPERS is a unique asynchronous code that has been designed to serve as a test bed for developing multi-physics applications not only for laboratory plasma devices but generally across a number of plasma physics fields, including astrophysics, space physics and electronic devices. We have made significant improvements to the HYPERS core: (1) implemented a new asynchronous magnetic field integration scheme that preserves local divB=0 to within round-off errors; (2) Improved staggered-grid discretizations of electric and magnetic fields. These modifications have significantly enhanced the accuracy and robustness of 3D simulations. We have conducted first-ever end-to-end 3D simulations of merging spheromak plasmas. The preliminary results show: (1) tilt-driven relaxation of a freely expanding spheromak to an m=1 Taylor helix configuration and (2) possibility of formation of a tilt-stable field-reversed configuration via merging and magnetic reconnection of two double-sided spheromaks with opposite helicities.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Scalar excursions in large-eddy simulations

Here, the range of values of scalar fields in turbulent flows is bounded by their boundary values, for passive scalars, and by a combination of boundary values, reaction rates, phase changes, etc., for active scalars. The current investigation focuses on the local conservation of passive scalar concentration fields and the ability of the large-eddy simulation (LES) method to observe the boundedness of passive scalar concentrations. In practice, as a result of numerical artifacts, this fundamental constraint is often violated with scalars exhibiting unphysical excursions. The present study characterizes passive-scalar excursions in LES of a shear flow and examines methods for diagnosis and assesment of the problem. The analysis of scalar-excursion statistics provides support of the main hypothesis of the current study that unphysical scalar excursions in LES result from dispersive errors of the convection-term discretization where the subgrid-scale model (SGS) provides insufficient dissipation to produce a sufficiently smooth scalar field. In the LES runs three parameters are varied: the discretization of the convection terms, the SGS model, and grid resolution. Unphysical scalar excursions decrease as the order of accuracy of non-dissipative schemes is increased, but the improvement rate decreases with increasing order of accuracy. Two SGS models are examined, the stretched-vortex and a constant-coefficient Smagorinsky. Scalar excursions strongly depend on the SGS model. The excursions are significantly reduced when the characteristic SGS scale is set to double the grid spacing in runs with the stretched-vortex model. The maximum excursion and volume fraction of excursions outside boundary values show opposite trends with respect to resolution. The maximum unphysical excursions increase as resolution increases, whereas the volume fraction decreases. The reason for the increase in the maximum excursion is statistical and traceable to the number of grid points (sample size) which increases with resolution. In contrast, the volume fraction of unphysical excursions decreases with resolution because the SGS models explored perform better at higher grid resolution.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A convergence analysis of stochastic collocation method for Navier-Stokes equations with random input data

Stochastic collocation method has proved to be an efficient method and been widely applied to solve various partial differential equations with random input data, including Navier- Stokes equations. However, up to now, rigorous convergence analyses are limited to linear elliptic and parabolic equations; its performance for Navier-Stokes equations was demonstrated mostly by numerical experiments. In this paper, we provide an error analysis of stochastic collocation method for a semi-implicit Backward Euler discretization for NSE and prove the exponential decay of the interpolation error in the probability space. Our analysis indicates that due to the nonlinearity, as final time T increases and NSE solvers pile up, the accuracy may be reduced significantly. Subsequently, the theoretical results are illustrated by the numerical test of time dependent fluid flow around a bluff body.

97 MATHEMATICS AND COMPUTING↗