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 127 records · Page 7

First-Order System Least Squares for the Stokes Equations, with Application to Linear Elasticity

Following our earlier work on general second-order scalar equations, here we develop a least-squares functional for the two- and three-dimensional Stokes equations, generalized slightly by allowing a pressure term in the continuity equation. By introducing a velocity flux variable and associated curl and trace equations, we are able to establish ellipticity in an H(exp 1) product norm appropriately weighted by the Reynolds number. This immediately yields optimal discretization error estimates for finite element spaces in this norm and optimal algebraic convergence estimates for multiplicative and additive multigrid methods applied to the resulting discrete systems. Both estimates are uniform in the Reynolds number. Moreover, our pressure-perturbed form of the generalized Stokes equations allows us to develop an analogous result for the Dirichlet problem for linear elasticity with estimates that are uniform in the Lame constants.

Cai, Z.↗

Verification of Anisotropic Mesh Adaptation for Turbulent Simulations over ONERA M6 Wing

Unstructured anisotropic mesh adaptation is known to be an efficient way to control discretization errors in Computational Fluid Dynamics (CFD) simulations. Method verification is required to provide the confidence for routine use in production analysis. The current work aims at verification of anisotropic mesh adaptation for RANS simulations over the ONERA M6 wing. The present verification study is performed using four different flow solvers, three different implementations of the metric field, and three mesh mechanics packages. Two of the flow solvers use stabilized finite-element discretizations (FUN3D-SFE and GGNS), one uses finite-volume discretization (FUN3D-FV), and the last one uses mixed finite-volume and finite element discretizations (Wolf). The mesh adaptation is based on an error estimator that aims to control the quadratic error term in the linear interpolation of Mach number. Two sets of adaptations were performed; the first one controls the interpolation error in L2 norm and the second one controls the interpolation error in L4 norm. Convergence studies were performed on the forces and the pitching moment using all four solvers, and the results are compared with previously verified convergence studies on fixed (nonadapted) meshes. Both forces and pitching moment on adapted meshes are found to be converging to the fine mesh values faster than those on fixed meshes. In addition to forces and moments, convergence of surface pressure and skin friction coefficients at various measurement locations on the wing are also presented. Adapted-mesh surface pressure distributions agree with the fine fixed mesh pressure distributions. Adapted-mesh skin friction distributions contain high frequency noise with mean values approaching the fixed mesh pressure skin friction distributions.

Aravind Balan↗

A Block-Structured Adaptive Mesh Framework to Solve Radiation Transfer Equation in Irregular Embedded Geometries

Radiation transport arises in various scientific, industrial, and medical fields, and understanding its effect in applications is needed to make accurate predictions, safety assessments and performance optimizations. Solving the Radiation Transport Equation (RTE) is challenging due to its integro-differential nature, which involves both differential and integral terms. The differential term describes the change in radiation intensity due to absorption and emission, while the integral term accounts for scattering. The accurate modeling of radiation is further complicated in many applications due to the complex, irregular geometries. Various methods exist for solving the RTE, including the zonal, Monte Carlo, spherical harmonics, discrete ordinates, and finite volume methods. Traditional mesh-based approaches, which rely on structured or unstructured meshes, struggle with irregular geometries due to: a) the difficulty of conforming structured grids to irregular domains, b) challenges in enforcing boundary conditions correctly, and c) the additional computational cost of unstructured mesh methods. This work presents a second-order accurate method for solving the RTE in irregular geometries. The radiation intensity is discretized using the finite-volume method in both spatial and angular directions on regular Cartesian grid blocks. Leveraging the block-structured adaptive mesh refinement (AMR) framework provided by AMReX, our method refines the grid locally to reduce spatial discretization error, ensuring a converged numerical solution while minimizing computational costs elsewhere. A two-stage deferred correction approach is employed: First, a first-order discretization on grid blocks is solved using an algebraic multigrid method in HYPRE. Second, a correction term is applied explicitly to achieve second-order accuracy. The correction term is calculated by approximating the radiation flux on cell faces using a Total Variation Diminishing (TVD) scheme. This approach ensures quick convergence of the multigrid method while preserving higher-order accuracy of the numerical solution. Irregular geometries are resolved as embedded boundaries (EB), resulting in both cut cells and regular cells. In cut cells, we modify the fluxes using face fractions and incorporate additional contributions from EB boundary conditions. To ensure higher-order convergence near the EB interface, the correction term is modified by interpolating the radiation intensity to fictitious ghost points. The implementation takes advantage of modern supercomputers by leveraging AMReX’sMPI/X parallelization strategy where X can be MPI or a GPU accelerator including CUDA, HIP and DPC++. We validate our solver using classical test cases, both with and without EB, demonstrating accuracy and efficiency. Additionally, we analyze the impact of adaptive mesh refinement on solution accuracy and computational cost, highlighting the advantages of our approach for high-resolution radiation transport simulations.

computational fluid dynamics (CFD)↗

Uncollided Flux Implementation for Discrete Ordinates Radiation Transport Solutions in Rattlesnake

Simulation of neutron streaming over long distances in optically thin narrow pipes sur- rounded by optically thicker materials that can absorb and/or scatter neutrons presents a simulation challenge to most neutron transport methods. Without sophisticated variance reduction techniques, this problem can be intractable for Monte Carlo techniques. Deterministic methods are often limited due to large angular discretization errors, this phenomenon is commonly known as ray effects. The uncollided component of the angular flux solution is the most anisotropic part and it can be difficult for discrete ordinate methods to accurately represent. The number of discrete angles required to overcome these ray effects is prohibitively large for the hodoscope configuration. Hence, other approaches must be taken to better simulate neutron streaming within the hodoscope collimator slots. In this report, we present an algorithm for semi-analytical calculation of the uncollided flux.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Robust verification of stochastic simulation codes

We introduce a robust verification tool for computational codes, which we call Stochastic Robust Extrapolation based Error Quantification (StREEQ). Unlike the prevalent Grid Convergence Index (GCI) [1] method, our approach is suitable for both stochastic and deterministic computational codes and is generalizable to any number of discretization variables. Building on ideas introduced in the Robust Verification [2] approach, we estimate the converged solution and orders of convergence with uncertainty using multiple fits of a discretization error model. In contrast to Robust Verification, we perform these fits to many bootstrap samples yielding a larger set of predictions with smoother statistics. Here, bootstrap resampling is performed on the lack-of-fit errors for deterministic code responses, and directly on the noisy data set for stochastic responses. This approach lends a degree of robustness to the overall results, capable of yielding precise verification results for sufficiently resolved data sets, and appropriately expanding the uncertainty when the data set does not support a precise result. For stochastic responses, a credibility assessment is also performed to give the analyst an indication of the trustworthiness of the results. Furthermore, this approach is suitable for both code and solution verification, and is particularly useful for solution verification of high-consequence simulations..

97 MATHEMATICS AND COMPUTING↗

Overlap valence on 2+1 flavor domain wall fermion configurations with deflation and low-mode substitution

The overlap fermion propagator is calculated on 2+1 flavor domain-wall fermion gauge configurations on 16{sup 3}x32, 24{sup 3}x64 and 32{sup 3}x64 lattices. With hyper-cubic (HYP) smearing and low eigenmode deflation, it is shown that the inversion of the overlap operator can be expedited by {approx}20 times for the 16{sup 3}x32 lattice and {approx}80 times for the 32{sup 3}x64 lattice. The overhead cost for calculating eigenmodes ranges from 4.5 to 7.9 propagators for the above lattices. Through the study of hyperfine splitting, we found that the O(m{sup 2}a{sup 2}) error is small and these dynamical fermion lattices can adequately accommodate quark mass up to the charm quark. A preliminary calculation of the low-energy constant {Delta}{sub mix} which characterizes the discretization error of the pion made up of a pair of sea and valence quarks in this mixed-action approach is carried out via the scalar correlator with periodic and antiperiodic boundary conditions. It is found to be small which shifts a 300 MeV pion mass by {approx}10 to 19 MeV on these sets of lattices. We have studied the signal-to-noise issue of the noise source for the meson and baryon. We introduce a new algorithm with Z{sub 3} grid source and low eigenmode substitution to study the many-to-all meson and baryon correlators. It is found to be efficient in reducing errors for the correlators of both mesons and baryons. With 64-point Z{sub 3} grid source and low-mode substitution, it can reduce the statistical errors of the light quark (m{sub {pi}{approx}2}00-300 MeV) meson and nucleon correlators by a factor of {approx}3-4 as compared to the point source. The Z{sub 3} grid source itself can reduce the errors of the charmonium correlators by a factor of {approx}3.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Consistent Feature Extraction From Vector Fields: Combinatorial Representations and Analysis Under Local Reference Frames

This dissertation presents research on addressing some of the contemporary challenges in the analysis of vector fields—an important type of scientific data useful for representing a multitude of physical phenomena, such as wind flow and ocean currents. In particular, new theories and computational frameworks to enable consistent feature extraction from vector fields are presented. One of the most fundamental challenges in the analysis of vector fields is that their features are defined with respect to reference frames. Unfortunately, there is no single “correct” reference frame for analysis, and an unsuitable frame may cause features of interest to remain undetected, thus creating serious physical consequences. This work develops new reference frames that enable extraction of localized features that other techniques and frames fail to detect. As a result, these reference frames objectify the notion of “correctness” of features for certain goals by revealing the phenomena of importance from the underlying data. An important consequence of using these local frames is that the analysis of unsteady (time-varying) vector fields can be reduced to the analysis of sequences of steady (timeindependent) vector fields, which can be performed using simpler and scalable techniques that allow better data management by accessing the data on a per-time-step basis. Nevertheless, the state-of-the-art analysis of steady vector fields is not robust, as most techniques are numerical in nature. The residing numerical errors can violate consistency with the underlying theory by breaching important fundamental laws, which may lead to serious physical consequences. This dissertation considers consistency as the most fundamental characteristic of computational analysis that must always be preserved, and presents a new discrete theory that uses combinatorial representations and algorithms to provide consistency guarantees during vector field analysis along with the uncertainty visualization of unavoidable discretization errors. Together, the two main contributions of this dissertation address two important concerns regarding feature extraction from scientific data: correctness and precision. The work presented here also opens new avenues for further research by exploring more-general reference frames and more-sophisticated domain discretizations.

97 MATHEMATICS AND COMPUTING↗

Quantitative assessment of eddy viscosity rans models for turbulent mixed convection in a differentially heated plane channel

Turbulent mixed convection between two vertical, infinite parallel plates at different temperatures is studied using various two-equation turbulence models. The numerical simulations are performed at a turbulent Reynolds number of Re τ = 150 and a Grashof number of Gr = 9.6 × 10 5 . Comparisons are made against the highly trusted DNS results. Consistent with the DNS approach, the current simulations are performed using constant properties and the Boussinesq approximation to predict the influence of buoyancy. Previous studies have provided assessments of two-equation turbulence models for various scenarios, but often rely on a qualitative “eye” test in order to determine the most appropriate model to predict a given flow. This study aims to provide a new form of quantitative assessment that accounts for both the physics captured by the turbulence model as well as the magnitude of the system response quantities (SRQ) using a modified symmetric mean absolute percent error (SMAPE) method. This method is designed to be approachable to researchers at any level and can be applied to system response quantities from multiple research fields. Uncertainty quantification is also performed to determine the discretization error for each turbulence model. Recommendations are made as to which turbulence models best capture the physics – hydrodynamically and thermally – using both local and global validation metrics. Lastly, a sensitivity analysis is performed on the damping functions used in the most accurate models. This underpins the potential of model developments and adjustments most worth pursuing for buoyant flows. Finally, this framework provides a more physics-based comparative analysis of the selected turbulence models.

42 ENGINEERING↗

Gradient Calculation Methods on Arbitrary Polyhedral Unstructured Meshes for Cell-Centered CFD Solvers

A survey of gradient reconstruction methods for cell-centered data on unstructured meshes is conducted within the scope of accuracy assessment. Formal order of accuracy, as well as error magnitudes for each of the studied methods, are evaluated on a complex mesh of various cell types through consecutive local scaling of an analytical test function. The tests highlighted several gradient operator choices that can consistently achieve 1st order accuracy regardless of cell type and shape. The tests further offered error comparisons for given cell types, leading to the observation that the "ideal" gradient operator choice is not universal. Practical implications of the results are explored via CFD solutions of a 2D inviscid standing vortex, portraying the discretization error properties. A relatively naive, yet largely unexplored, approach of local curvilinear stencil transformation exhibited surprisingly favorable properties

Meshes↗

A mesoscopic link-transmission-model able to track individual vehicles

Macroscopic traffic flow is a common choice for large-scale traffic simulations. These models do not provide individual-specific metrics as outputs. However, this treatment is necessary in agent-based-models, as in, for example, assigning routes based on personal characteristics. Here, in this paper, we propose an extension of the link-transmission-model, an efficient and yet accurate discretization of the Lighthill-Whitham-Richards (LWR) model, which allow vehicles to be tracked individually while keeping the main features of the underlying model. The extension comprises modifying the link and node models to ensure that the flow between links is always at discrete levels. Therefore, every unit of flow is associated with one individual vehicle moving from its current to its next link. An upper bound of the discretization error is provided. We show that the proposed model resembles its continuous counterpart on lane drop, merge, and diverge cases. In addition, we apply the model into three different networks to validate its applicability in large networks. Finally, we also confirm the parameter transferability between continuous and discrete models and that both can well reproduce field data.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Efficient DSMC collision-partner selection schemes.

The effect of collision-partner selection schemes on the accuracy and the efficiency of the Direct Simulation Monte Carlo (DSMC) method of Bird is investigated. Several schemes to reduce the total discretization error as a function of the mean collision separation and the mean collision time are examined. These include the historically first sub-cell scheme, the more recent nearest-neighbor scheme, and various near-neighbor schemes, which are evaluated for their effect on the thermal conductivity for Fourier flow. Their convergence characteristics as a function of spatial and temporal discretization and the number of simulators per cell are compared to the convergence characteristics of the sophisticated and standard DSMC algorithms. Improved performance is obtained if the population from which possible collision partners are selected is an appropriate fraction of the population of the cell.

99 GENERAL AND MISCELLANEOUS↗

Efficient DSMC collision-partner selection schemes.

The effect of collision-partner selection schemes on the accuracy and the efficiency of the Direct Simulation Monte Carlo (DSMC) method of Bird is investigated. Several schemes to reduce the total discretization error as a function of the mean collision separation and the mean collision time are examined. These include the historically first sub-cell scheme, the more recent nearest-neighbor scheme, and various near-neighbor schemes, which are evaluated for their effect on the thermal conductivity for Fourier flow. Their convergence characteristics as a function of spatial and temporal discretization and the number of simulators per cell are compared to the convergence characteristics of the sophisticated and standard DSMC algorithms. Improved performance is obtained if the population from which possible collision partners are selected is an appropriate fraction of the population of the cell.

99 GENERAL AND MISCELLANEOUS↗

Improved-efficiency DSMC collision-partner selection schemes.

The effect of collision-partner selection schemes on the accuracy and the efficiency of the Direct Simulation Monte Carlo (DSMC) method of Bird is investigated. Several schemes to reduce the total discretization error as a function of the mean collision separation and the mean collision time are examined. These include the historically first sub-cell scheme, the more recent nearest-neighbor scheme, and various near-neighbor schemes, which are evaluated for their effect on the thermal conductivity for Fourier flow. Their convergence characteristics as a function of spatial and temporal discretization and the number of simulators per cell are compared to the convergence characteristics of the sophisticated and standard DSMC algorithms. Improved performance is obtained if the population from which possible collision partners are selected is an appropriate fraction of the population of the cell.

99 GENERAL AND MISCELLANEOUS↗

Robust Solution Verification Experiments on Nonuniform Meshes

The activities of verification, validation, and uncertainty quantification (VVUQ) provide a comprehensive means to assess the credibility of computational models. Within VVUQ, solution verification assesses numerical errors and evaluates whether the simulation is sufficiently accurate for its intended applications. As computational modeling gains traction in the development of complex, high-consequence systems, the need for robust solution verification intensifies, particularly because experimental data for these systems are often limited. This work examines improvements in the robustness of Richardson extrapolation (RE), a method commonly used in solution verification to study the discretization error of computational models using a power law. Nonuniform mesh refinement is discussed alongside other pollutants that affect the robustness of the power law model. Maximum likelihood estimation (MLE) is proposed as a robust strategy to address the uncertainty generated by nonuniform mesh refinement. An exploratory computational fluid dynamics (CFD) study of a 2D planar Poiseuille flow is conducted to determine if nonuniform mesh noise can be modeled with this MLE approach for more robust RE.

Weinmeister, Justin [ORNL] (ORCID:0000000160090237↗

On Sub-linear Convergence for Linearly Degenerate Waves in Capturing Schemes

A common attribute of capturing schemes used to find approximate solutions to the Euler equations is a sub-linear rate of convergence with respect to mesh resolution. Purely nonlinear jumps, such as shock waves produce a first-order convergence rate, but linearly degenerate discontinuous waves, where present, produce sub-linear convergence rates which eventually dominate the global rate of convergence. The classical explanation for this phenomenon investigates the behavior of the exact solution to the numerical method in combination with the finite error terms, often referred to as the modified equation. For a first-order method, the modified equation produces the hyperbolic evolution equation with second-order diffusive terms. In the frame of reference of the traveling wave, the solution of a discontinuous wave consists of a diffusive layer that grows with a rate of t{sup 1/2}, yielding a convergence rate of 1/2. Self-similar heuristics for higher order discretizations produce a growth rate for the layer thickness of {Delta}t{sup 1/(p+1)} which yields an estimate for the convergence rate as p/(p+1) where p is the order of the discretization. In this paper we show that this estimated convergence rate can be derived with greater rigor for both dissipative and dispersive forms of the discrete error. In particular, the form of the analytical solution for linear modified equations can be solved exactly. These estimates and forms for the error are confirmed in a variety of demonstrations ranging from simple linear waves to multidimensional solutions of the Euler equations.

99 GENERAL AND MISCELLANEOUS↗

Time-discretization of a plasma-neutral MHD model with a semi-implicit leapfrog algorithm

The semi-implicit leapfrog time-discretization is a workhorse algorithm for initial-value MHD codes to bridge between vastly separated time scales. Inclusion of atomic interactions with neutrals breaks the functional structure of the MHD equations that exploited by the leapfrog. In this work, we address how to best integrate atomic physics into the semi-implicit leapfrog. Following the Crank-Nicolson method, one approach is to time-center the atomic interactions in the linear solver and use a Newton method to include the nonlinear contributions. Alternatively, another family of methods are based on operator-splitting the terms associated with the atomic interactions using a Strang-splitting technique. These methods naturally break equations into constituent ODE and PDE parts and preserve the structure exploited by the semi-implicit leapfrog. We study the accuracy and efficiency of these methods through a battery of 0D and 1D cases and show that a second-order-in-time Douglas-Rachford inspired coupling between the ODE and PDE advances is effective in reducing the time-discretization error to be comparable to that of Crank-Nicolson with Newton iteration of the nonlinear terms. Splitting ODE and PDE parts results in independent matrix solves for each field which reduces the computational cost considerably and provides parallelization over species relative to Crank-Nicolson.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Multilevel Monte Carlo methods for the Grad-Shafranov free boundary problem

The equilibrium configuration of a plasma in an axially symmetric reactor is described mathematically by a free boundary problem associated with the celebrated Grad-Shafranov equation. The presence of uncertainty in the model parameters introduces the need to quantify the variability in the predictions. This is often done by computing a large number of model solutions on a computational grid for an ensemble of parameter values and then obtaining estimates for the statistical properties of solutions. In this study, we explore the savings that can be obtained using multilevel Monte Carlo methods, which reduce costs by performing the bulk of the computations on a sequence of spatial grids that are coarser than the one that would typically be used for a simple Monte Carlo simulation. We examine this approach using both a set of uniformly refined grids and a set of adaptively refined grids guided by a discrete error estimator. Numerical experiments show that multilevel methods dramatically reduce the cost of simulation, with cost reductions typically on the order of 60 or more and possibly as large as 200. Furthermore, adaptive griding results in more accurate computation of geometric quantities such as x-points associated with the model.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Not so HOT Triangulations

Here, we propose primal–dual mesh optimization algorithms that overcome shortcomings of the standard algorithm while retaining some of its desirable features. “Hodge-Optimized Triangulations” defines the “HOT energy” as a bound on the discretization error of the diagonalized Delaunay Hodge star operator. HOT energy is a natural choice for an objective function, but unstable for both mathematical and algorithmic reasons: it has minima for collapsed edges, and its extrapolation to non-regular triangulations is inaccurate and has unbounded minima. We propose a different extrapolation with a stronger theoretical foundation, and avoid extrapolation by recalculating the objective just beyond the flip threshold. We propose new objectives, based on normalizations of the HOT energy, with barriers to edge collapses and other undesirable configurations. We propose mesh improvement algorithms coupling these. When HOT optimization nearly collapses an edge, we actually collapse the edge. Otherwise, we use the barrier objective to update positions and weights and remove vertices. By combining discrete connectivity changes with continuous optimization, we more fully explore the space of possible meshes and obtain higher quality solutions.

97 MATHEMATICS AND COMPUTING↗