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

Control of the errors of discretization and idealization in finite element analysis

Understanding of the basic principles which control errors of discretization in finite element analysis has increased very substantially since 1980. The main milestones were: (1) development of the theoretical basis of p-extensions (1981); (2) understanding of the proper interplay between mesh design and assignment of polynomial degree to elements. Practical realization of exponential convergence rates, independently of the smoothness of the exact solution (1984); and (3) industrial experience with the new finite element technology known as the p- or hp-version of the finite element method: General Dynamics reported thirty- to forty-fold savings in terms of human time and large savings in computer time (1986). Lockheed reported favorably on their evaluation of error estimation and quality control capabilities of the p-version in industrial settings (1987). The gains in our understanding of how to control the errors of discretization represent only half of the control necessary to ensure that a numerical model is in fact an accurate representation of the corresponding physical system. Control of the errors of idealization is equally important. A brief overview of the main ideas of how to ensure the quality and reliability of mathematical models of structural systems is presented.

Szabo, Barna A.↗

Singly and Doubly Charmed $J=1/2$ Baryon Spectrum from Lattice QCD

We compute the masses of the singly and doubly charmed baryons in full QCD using the relativistic Fermilab action for the charm quark. For the light quarks we use domain-wall fermions in the valence sector and improved Kogut-Susskind sea quarks. We use the low-lying charmonium spectrum to tune our heavy-quark action and as a guide to understanding the discretization errors associated with the heavy quark. Our results are in good agreement with experiment within our systematicss, except for the spin-1/2 $\Xi_{cc}$, for which we predict the isospin averaged mass to be $M_{\Xi_{cc}} = 3665 \pm17 \pm14\, {}^{+0}_{-35}$~{MeV} (here the first uncertainty is statistical, the second systematic and the third an estimate of lattice discretization errors). In addition, we predict the splitting of the (isospin averaged) spin-1/2 $\O_{cc}$ with the $\Xi_{cc}$ to be $M_{\O_{cc}} - M_{\Xi_{cc}} = 98 \pm9 \pm22$~{MeV} (in this mass splitting, the leading discretization errors cancel). This corresponds to a prediction of $M_{\O_{cc}} = 3763\pm9\pm44\, {}^{+0}_{-35}$~{MeV}.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A TWO-DIMENSIONAL METHOD OF MANUFACTURED SOLUTIONS BENCHMARK SUITE BASED ON VARIATIONS OF LARSEN'S BENCHMARK WITH ESCALATING ORDER OF SMOOTHNESS OF THE EXACT SOLUTION

The quantification of the discretization error associated with the spatial discretization of the Discrete Ordinate(DO) equations in multidimensional Cartesian geometries is the central problem in error estimation of spatial discretization schemes for transport theory as well as computer code verification. Traditionally fine mesh solutions are employed as reference, because analytical solutions only exist in the absence of scattering. This approach, however, is inadequate when the discretization error associated with the reference solution is not small compared to the discretization error associated with the mesh under scrutiny. Typically this situation occurs if the mesh of interest is only a couple of refinement levels away from the reference solution or if the order of accuracy of the numerical method (and hence the reference as well) is lower than expected. In this work we present a Method of Manufactured Solutions (MMS) benchmark suite with variable order of smoothness of the underlying exact solution for two-dimensional Cartesian geometries which provides analytical solutions aver- aged over arbitrary orthogonal meshes for scattering and non-scattering media. It should be emphasized that the developed MMS benchmark suite first eliminates the aforementioned limitation of fine mesh reference solutions since it secures knowledge of the underlying true solution and second that it allows for an arbitrary order of smoothness of the underlying ex- act solution. The latter is of importance because even for smooth parameters and boundary conditions the DO equations can feature exact solution with limited smoothness. Moreover, the degree of smoothness is crucial for both the order of accuracy and the magnitude of the discretization error for any spatial discretization scheme.

99 GENERAL AND MISCELLANEOUS↗

Comparison of Node-Centered and Cell-Centered Unstructured Finite-Volume Discretizations: Inviscid Fluxes

Cell-centered and node-centered approaches have been compared for unstructured finite-volume discretization of inviscid fluxes. The grids range from regular grids to irregular grids, including mixed-element grids and grids with random perturbations of nodes. Accuracy, complexity, and convergence rates of defect-correction iterations are studied for eight nominally second-order accurate schemes: two node-centered schemes with weighted and unweighted least-squares (LSQ) methods for gradient reconstruction and six cell-centered schemes two node-averaging with and without clipping and four schemes that employ different stencils for LSQ gradient reconstruction. The cell-centered nearest-neighbor (CC-NN) scheme has the lowest complexity; a version of the scheme that involves smart augmentation of the LSQ stencil (CC-SA) has only marginal complexity increase. All other schemes have larger complexity; complexity of node-centered (NC) schemes are somewhat lower than complexity of cell-centered node-averaging (CC-NA) and full-augmentation (CC-FA) schemes. On highly anisotropic grids typical of those encountered in grid adaptation, discretization errors of five of the six cell-centered schemes converge with second order on all tested grids; the CC-NA scheme with clipping degrades solution accuracy to first order. The NC schemes converge with second order on regular and/or triangular grids and with first order on perturbed quadrilaterals and mixed-element grids. All schemes may produce large relative errors in gradient reconstruction on grids with perturbed nodes. Defect-correction iterations for schemes employing weighted least-square gradient reconstruction diverge on perturbed stretched grids. Overall, the CC-NN and CC-SA schemes offer the best options of the lowest complexity and secondorder discretization errors. On anisotropic grids over a curved body typical of turbulent flow simulations, the discretization errors converge with second order and are small for the CC-NN, CC-SA, and CC-FA schemes on all grids and for NC schemes on triangular grids; the discretization errors of the CC-NA scheme without clipping do not converge on irregular grids. Accurate gradient reconstruction can be achieved by introducing a local approximate mapping; without approximate mapping, only the NC scheme with weighted LSQ method provides accurate gradients. Defect correction iterations for the CC-NA scheme without clipping diverge; for the NC scheme with weighted LSQ method, the iterations either diverge or converge very slowly. The best option in curved geometries is the CC-SA scheme that offers low complexity, second-order discretization errors, and fast convergence.

Diskin, Boris↗

Successive Procedure for Solution Verification Based on User Needs

This paper discusses a revised solution verification procedure for computational fluid dynamics simulations to estimate the uncertainties in the quantities of interest based on discretization error models. This proposed procedure builds upon current procedures described in ASME V&V 20 but provides more guidance in determining the necessary number of mesh levels to build reliable discretization error models. Such guidance is particularly useful for practicing engineers without prior experience in solution verification. The key features of this proposed solution verification procedure are the ability to determine the need for additional mesh levels iteratively and the seamless treatment for underdetermined, exact, and overdetermined solutions of the power series approximation to the discretization error models. This study applies the proposed procedure to a set of synthetic examples to demonstrate the revised procedure’s clarity in determining the number of mesh solutions required for a reliable estimate of the discretization error in computational fluid dynamics settings. Additionally, this proposed procedure prevents a potential pathway in the current procedure in ASME V&V 20 that may lead to unreasonably small discretization errors.

Weinmeister, Justin↗

Extended Forward Sensitivity Analysis for Uncertainty Quantification

Verification and validation (V&V) are playing more important roles to quantify uncertainties and realize high fidelity simulations in engineering system analyses, such as transients happened in a complex nuclear reactor system. Traditional V&V in the reactor system analysis focused more on the validation part or did not differentiate verification and validation. The traditional approach to uncertainty quantification is based on a 'black box' approach. The simulation tool is treated as an unknown signal generator, a distribution of inputs according to assumed probability density functions is sent in and the distribution of the outputs is measured and correlated back to the original input distribution. The 'black box' method mixes numerical errors with all other uncertainties. It is also not efficient to perform sensitivity analysis. Contrary to the 'black box' method, a more efficient sensitivity approach can take advantage of intimate knowledge of the simulation code. In these types of approaches equations for the propagation of uncertainty are constructed and the sensitivities are directly solved for as variables in the simulation. This paper presents the forward sensitivity analysis as a method to help uncertainty qualification. By including time step and potentially spatial step as special sensitivity parameters, the forward sensitivity method is extended as one method to quantify numerical errors. Note that by integrating local truncation errors over the whole system through the forward sensitivity analysis process, the generated time step and spatial step sensitivity information reflect global numerical errors. The discretization errors can be systematically compared against uncertainties due to other physical parameters. This extension makes the forward sensitivity method a much more powerful tool to help uncertainty qualification. By knowing the relative sensitivity of time and space steps with other interested physical parameters, the simulation is allowed to run at optimized time and space steps without affecting the confidence of the physical parameter sensitivity results. The time and space steps forward sensitivity analysis method can also replace the traditional time step and grid convergence study with much less computational cost. Several well defined benchmark problems with manufactured solutions are utilized to demonstrate the extended forward sensitivity analysis method. All the physical solutions, parameter sensitivity solutions, even the time step sensitivity in one case, have analytical forms, which allows the verification to be performed in the strictest sense.

97 MATHEMATICS AND COMPUTING↗

Extended Forward Sensitivity Analysis for Uncertainty Quantification

This paper presents the extended forward sensitivity analysis as a method to help uncertainty qualification. By including time step and potentially spatial step as special sensitivity parameters, the forward sensitivity method is extended as one method to quantify numerical errors. Note that by integrating local truncation errors over the whole system through the forward sensitivity analysis process, the generated time step and spatial step sensitivity information reflect global numerical errors. The discretization errors can be systematically compared against uncertainties due to other physical parameters. This extension makes the forward sensitivity method a much more powerful tool to help uncertainty qualification. By knowing the relative sensitivity of time and space steps with other interested physical parameters, the simulation is allowed to run at optimized time and space steps without affecting the confidence of the physical parameter sensitivity results. The time and space steps forward sensitivity analysis method can also replace the traditional time step and grid convergence study with much less computational cost. Two well-defined benchmark problems with manufactured solutions are utilized to demonstrate the method.

99 GENERAL AND MISCELLANEOUS↗

Comparing Unstructured Adaptive Mesh Solutions for the High Lift Common Research Model Airfoil

Discretization error is a common source of uncertainty in Computational Fluid Dynamics (CFD) analyses. Traditional means of controlling discretization error through fixed-mesh refinement studies has proven to be difficult particularly when modeling complex geometries and flow fields. One reason for this is that mesh generation in today’s production CFD workflow is often a labor intensive process that is heavily dependent on user judgment. Unstructured mesh adaptation is known to be an efficient way to control discretization errors in CFD. Adaptive methods replace user based decision making with automated processes that optimize a mesh to reduce discretization error. This paper compares the application of multiple solution adaptive techniques in combination with multiple flow solvers to solve for the flow field about a 2D airfoil section of the NASA High-Lift Common Research Model (HL-CRM). By driving the adaptive mesh processes to a similar level of mesh convergence, the ability to achieve consistent results between multiple adaptive techniques and flow solvers is demonstrated. Mesh convergence for the various adaptive mesh approaches is compared identifying potential areas for improvement and providing mesh generation guidance for future workshops.

mesh adaptation high-lift 2D airfoil↗

Comparing Unstructured Adaptive Mesh Solutions for the High Lift Common Research Model Airfoil

Discretization error is a common source of uncertainty in Computational Fluid Dynamics (CFD) analyses. Traditional means of controlling discretization error through fixed-mesh refinement studies has proven to be difficult particularly when modeling complex geometries and flow fields. One reason for this is that mesh generation in today’s production CFD workflow is often a labor intensive process that is heavily dependent on user judgment. Unstructured mesh adaptation is known to be an efficient way to control discretization errors in CFD. Adaptive methods replace user based decision making with automated processes that optimize a mesh to reduce discretization error. This paper compares the application of multiple solution adaptive techniques in combination with multiple flow solvers to solve for the flow field about a 2D airfoil section of the NASA High-Lift Common Research Model (HL-CRM). By driving the adaptive mesh processes to a similar level of mesh convergence, the ability to achieve consistent results between multiple adaptive techniques and flow solvers is demonstrated. Mesh convergence for the various adaptive mesh approaches is compared identifying potential areas for improvement and providing mesh generation guidance for future workshops.

mesh adaptation↗

Quarkonium mass splittings in three-flavor lattice QCD

We report on calculations of the charmonium and bottomonium spectrum in lattice QCD. We use ensembles of gauge fields with three flavors of sea quarks, simulated with the asqtad improved action for staggered fermions. For the heavy quarks we employ the Fermilab interpretation of the clover action for Wilson fermions. These calculations provide a test of lattice QCD, including the theory of discretization errors for heavy quarks. We provide, therefore, a careful discussion of the results in light of the heavy-quark effective Lagrangian. By and large, we find that the computed results are in agreement with experiment, once parametric and discretization errors are taken into account.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

CFD-DEM solution verification: Fixed-bed studies

Fixed (frozen) particle configurations are used to study CFD-DEM convergence behavior in the limit of infinite grid resolution. A filtering scheme based on solving a diffusion equation, i.e., a Gaussian kernel, is used to interpolate particle information to the continuum grid, free of cell size limitations. A regression method is used for Richardson extrapolation of the discrete solutions to the grid-free solution. The regression method is shown to predict accurate extrapolation curves in the presence of the observed oscillatory convergence behavior. The extrapolation curve is used to complete the solution verification process by quantifying the numerical uncertainty present in the calculations. Several numerical and model parameters are studied including the spatial discretization method, the kernel width and the mean drag law. Here, a manageable level of discretization error is found with relative discretization errors generally <4%.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Single Grid Error Estimation for Neutron Transport Solvers

The method of nearby problems (MNP) is a solution verification technique that does not require the use of multiple spatial grids. To estimate spatial discretization error without requiring a high-fidelity spatial grid, an analytical curve fit is interpolated from the numerical solution. The residual between the curve fit solution and numerical solution is calculated and added as an additional source term to the governing equation. The nearby solution is estimated using the updated source term and boundary conditions to remain consistent with the curve fit interpolation. The nearby solution can be compared to the curve fit solution as a discretization error estimation while using a single spatial grid. Without the use of higher fidelity spatial grids, the MNP is able to approximate the spatial discretization error, a facet of solution verification. The application of the method of nearby problems is presented for one- and two-dimensional neutron transport problems for both fixed source and criticality problems on the spatial variable. The fixed source results demonstrate the effectiveness of nearby problems for spatial error identification using the discrete ordinates method. Criticality results are shown to identify area of high spatial error for the C5G7 problem as well as for the discrete ordinates solver. A novel approach of combining the capabilities of Monte Carlo with the discrete ordinates nearby problems is presented for one- and two-dimensional fixed source problems. In conclusion, the MNP demonstrates its effectiveness at identifying spatial error on a single structured grid with a wide variety of neutron transport problems.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

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↗

Error indicators and accuracy improvements of finite element solutions

Practical and reliable estimators of the discretization errors in engineering problems are developed. Error indicators for identifying the regions or elements of the solution domain which are likely to have the largest discretization errors are presented, and a simple computational procedure for improving the accuracy of the finite element solutions for shell problems is given. The similarities between the proposed procedure and a preconditioned conjugate gradient (PCG) technique are identified and exploited to generate pointwise error indicators from the PCG technique. Numerical examples in the linear static analysis of shells are presented.

Noor, Ahmed K.↗

Sampling Versus Filtering in Large-Eddy Simulations

A LES formalism in which the filter operator is replaced by a sampling operator is proposed. The unknown quantities that appear in the LES equations originate only from inadequate resolution (Discretization errors). The resulting viewpoint seems to make a link between finite difference approaches and finite element methods. Sampling operators are shown to commute with nonlinearities and to be purely projective. Moreover, their use allows an unambiguous definition of the LES numerical grid. The price to pay is that sampling never commutes with spatial derivatives and the commutation errors must be modeled. It is shown that models for the discretization errors may be treated using the dynamic procedure. Preliminary results, using the Smagorinsky model, are very encouraging.

Debliquy, O.↗

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↗