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 253 records · Page 14

Programmer-guided reliability for extreme-scale applications

We present “programmer-guided reliability” (PGR) as a systematic conceptual approach to address the expected rise in soft errors in coming extreme-scale systems at the application level. The approach involves instrumentation of the application with code to detect data corruption errors. The location and nature of these error detectors are at the discretion of the programmer, who uses their knowledge and experience with the problem domain, the application, the solution algorithms, etc., to determine the most vulnerable areas of the code and the most appropriate ways to detect data corruption. To illustrate the approach, we provide examples of error detectors from four different benchmark-scale applications. We also describe a simple control framework that allows for runtime configuration of the error detectors without recompilation of the application, as well as dynamic reconfiguration during the execution of the application. Lastly, we discuss a number of future directions building on the basic PGR approach, including the incorporation of some general error detectors into the programming environment in order to make them more easily usable by the programmer.

97 MATHEMATICS AND COMPUTING↗

The arbitrary-order virtual element method for linear elastodynamics models. Convergence, stability and dispersion-dissipation analysis.

We design the conforming virtual element method for the numerical approximation of the two dimensional elastodynamics problem. We prove stability and convergence of the semi-discrete approximation and derive optimal error estimates under $\textit{h}$-refinement in both the energy and the $L^2$ norms, and optimal error estimates under $\textit{p}$-refinement in the energy norm. The performance of the proposed virtual element method is assessed on a set of different computational meshes, including non-convex cells up to order four in the h-refinement setting. Exponential convergence is also experimentally observed under p-refinement. Finally, we present a dispersion-dissipation analysis for both the semi-discrete and fully-discrete schemes, showing that polygonal meshes behave as classical simplicial/quadrilateral grids in terms of dispersion-dissipation properties.

97 MATHEMATICS AND COMPUTING↗

Sparse adaptive finite elements for radiative transfer

The linear radiative transfer equation, a partial differential equation for the radiation intensity u(x,s), with independent variables x element of D is contained in R{sup n} in the physical domain D of dimension n=2,3, and angular variable s element of S{sup 2}:={l_brace}y element of R{sup 3}:|y|=1{r_brace}, is solved in the n+2-dimensional computational domain DxS{sup 2}. We propose an adaptive multilevel Galerkin finite element method (FEM) for its numerical solution. Our approach is based on (a) a stabilized variational formulation of the transport operator, (b) on so-called sparse tensor products of two hierarchic families of finite element spaces in H{sup 1}(D) and in L{sup 2}(S{sup 2}), respectively, and (c) on wavelet thresholding techniques to adapt the discretization to the underlying problem. An a priori error analysis shows, under strong regularity assumptions on the solution, that the sparse tensor product method is clearly superior to a discrete ordinates method, as it converges with essentially optimal asymptotic rates while its complexity grows essentially only as that for a linear transport problem in R{sup n}. Numerical experiments for n=2 on a set of example problems agree with the convergence and complexity analysis of the method and show that introducing adaptivity can improve performance in terms of accuracy vs. number of degrees even further.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Solving phase appearance/disappearance two-phase flow problems with high resolution staggered grid and fully implicit schemes by the Jacobian-free Newton–Krylov Method

The phase appearance/disappearance issue presents serious numerical challenges in two-phase flow simulations. Many existing reactor safety analysis codes use different kinds of treatments for the phase appearance/disappearance problem. However, to our best knowledge, there are no fully satisfactory solutions. Additionally, the majority of the existing reactor system analysis codes were developed using low-order numerical schemes in both space and time. In many situations, it is desirable to use high-resolution spatial discretization and fully implicit time integration schemes to reduce numerical errors. In this work, we adapted a high-resolution spatial discretization scheme on staggered grid mesh and fully implicit time integration methods (such as BDF1 and BDF2) to solve the two-phase flow problems. The discretized nonlinear system was solved by the Jacobian-free Newton Krylov (JFNK) method, which does not require the derivation and implementation of analytical Jacobian matrix. These methods were tested with a few two-phase flow problems with phase appearance/disappearance phenomena considered, such as a linear advection problem, an oscillating manometer problem, and a sedimentation problem. The JFNK method demonstrated extremely robust and stable behaviors in solving the two-phase flow problems with phase appearance/disappearance. No special treatments such as water level tracking or void fraction limiting were used. High-resolution spatial discretization and second- order fully implicit method also demonstrated their capabilities in significantly reducing numerical errors.

97 MATHEMATICS AND COMPUTING↗

Discretized versus continuous models of p-wave interacting fermions in one dimension

We present a general mapping between continuous and lattice models of Bose and Fermi gases in one dimension, interacting via local two-body interactions. For s-wave interacting bosons we arrive at the Bose-Hubbard model in the weakly interacting, low-density regime. The dual problem of p-wave interacting fermions is mapped to the spin-1/2 XXZ model close to the critical point in the highly polarized regime. The mappings are shown to be optimal in the sense that they produce the least error possible for a given discretization length. As an application we examine the ground state of an interacting Fermi gas in a harmonic trap, calculating numerically real-space and momentum-space distributions as well as two-particle correlations. In the analytically known limits the convergence of the results of the lattice model with the continuous one is shown.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Extended Forward Sensitivity Analysis for Uncertainty Quantification

This report presents the forward sensitivity analysis method as a means for quantification of uncertainty in system analysis. 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. This approach requires large number of simulation runs and therefore has high computational cost. Contrary to the “black box” method, a more efficient sensitivity approach can take advantage of intimate knowledge of the simulation code. In this approach equations for the propagation of uncertainty are constructed and the sensitivity is solved for as variables in the same simulation. This “glass box” method can generate similar sensitivity information as the above “black box” approach with couples of runs to cover a large uncertainty region. Because only small numbers of runs are required, those runs can be done with a high accuracy in space and time ensuring that the uncertainty of the physical model is being measured and not simply the numerical error caused by the coarse discretization. In the forward sensitivity method, the model is differentiated with respect to each parameter to yield an additional system of the same size as the original one, the result of which is the solution sensitivity. The sensitivity of any output variable can then be directly obtained from these sensitivities by applying the chain rule of differentiation. We extend the forward sensitivity method to include time and spatial steps as special parameters so that the numerical errors can be quantified against other physical parameters. This extension makes the forward sensitivity method a much more powerful tool to help uncertainty analysis. By knowing the relative sensitivity of time and space steps with other interested physical parameters, the simulation can be run at appropriate time and space steps that ensure numerical sensitivities will not affect the confidence of the physical parameter sensitivity results. Two well defined benchmark problems, thermal wave and nonlinear diffusion, are utilized to demonstrate the extended forward sensitivity analysis method. All the physical solutions, parameter sensitivity solutions, even time step sensitivity in one case, have analytical forms, which allows the verification to be done in the strictest sense. A pilot code, Extended Forward sensitivity Analysis pilot code (EFA), has been developed to implement the above work.

97 MATHEMATICS AND COMPUTING↗

A continuation multilevel Monte Carlo algorithm

Here, we propose a novel Continuation Multi Level Monte Carlo (CMLMC) algorithm for weak approximation of stochastic models. The CMLMC algorithm solves the given approximation problem for a sequence of decreasing tolerances, ending when the required error tolerance is satisfied. CMLMC assumes discretization hierarchies that are defined a priori for each level and are geometrically refined across levels. Moreover, the actual choice of computational work across levels is based on parametric models for the average cost per sample and the corresponding variance and weak error. These parameters are calibrated using Bayesian estimation, taking particular notice of the deepest levels of the discretization hierarchy, where only few realizations are available to produce the estimates. The resulting CMLMC estimator exhibits a non-trivial splitting between bias and statistical contributions. We also show the asymptotic normality of the statistical error in the MLMC estimator and justify in this way our error estimate that allows prescribing both required accuracy and confidence in the final result. Our numerical results substantiate the above results and illustrate the corresponding computational savings in examples that are described in terms of differential equations either driven by random measures or with random coefficients.

97 MATHEMATICS AND COMPUTING↗

Uniform convergence of an upwind discontinuous Galerkin method for solving scaled discrete-ordinate radiative transfer equations with isotropic scattering

Here we present an error analysis for the discontinuous Galerkin (DG) method applied to the discrete-ordinate discretization of the steady-state radiative transfer equation with isotropic scattering. Under some mild assumptions, we show that the DG method converges uniformly with respect to a scaling parameter which characterizes the strength of scattering in the system. However, the rate is not optimal and can be polluted by the presence of boundary layers. In one-dimensional slab geometries, we demonstrate optimal convergence when boundary layers are not present and analyze a simple strategy for balance interior and boundary layer errors. Some numerical tests are also provided in this reduced setting.

97 MATHEMATICS AND COMPUTING↗

A Leray regularized ensemble-proper orthogonal decomposition method for parameterized convection-dominated flows

Abstract Partial differential equations (PDEs) are often dependent on input quantities that are uncertain. To quantify this uncertainty PDEs must be solved over a large ensemble of parameters. Even for a single realization this can be a computationally intensive process. In the case of flows governed by the Navier–Stokes equations, an efficient method has been devised for computing an ensemble of solutions. To further reduce the computational cost of this method, an ensemble-proper orthogonal decomposition (POD) method was recently proposed. The main contribution of this work is the introduction of POD spatial filtering for ensemble-POD methods. The POD spatial filter makes possible the construction of the Leray ensemble-POD model, which is a regularized-reduced order model for the numerical simulation of convection-dominated flows of moderate Reynolds number. The Leray ensemble-POD model employs the POD spatial filter to smooth (regularize) the convection term in the Navier–Stokes equations, and diminishes the numerical inaccuracies produced by the ensemble-POD method in the numerical simulation of convection-dominated flows. Specifically, for the numerical simulation of a convection-dominated two-dimensional flow between two offset cylinders, we show that the Leray ensemble-POD method better reflects the dynamics of the benchmark results than the ensemble-POD scheme. The second contribution of this work is a new numerical discretization of the variable viscosity ensemble algorithm in which the average viscosity is replaced with the maximum viscosity. It is shown that this new numerical discretization is significantly more stable than those in current use. Furthermore, error estimates for the novel Leray ensemble-POD algorithm with this new numerical discretization are also proven.

Mathematics↗

Improvements to a class of hybrid methods for radiation transport: Nyström reconstruction and defect correction methods

In this study, two modifications are introduced for improving the accuracy, versatility, and robustness of a class of hybrid methods for radiation transport. In general, such methods are constructed by splitting the radiative flux into collided and uncollided components to which low- and high-resolution angular approximations are applied, respectively. In this work we focus on discrete ordinates discretizations of high and low order. The first modification we introduce changes the way in which the collided component is mapped into the uncollided component at the end of each time step in a simulation. The new mapping is a Nyström-type reconstruction that is applicable to arbitrary discrete ordinates quadratures, is guaranteed to preserve positivity of the solution provided that all ordinate weights are positive, is significantly more accurate than previous methods, and can be readily extended to other discretizations such as moment methods, finite element methods, and diffusion approximations. The second modification leverages integral deferred correction (IDC) to iteratively correct for the splitting error introduced by the inconsistency in angular discretization between the collided and uncollided components, in addition to improving the accuracy of the low-order temporal error that is treated by traditional IDC methods. Numerical tests in one- and two-dimensional geometries are used to demonstrate the increased accuracy and efficiency of the proposed modifications. It is found that the two techniques combined yield methods with solution accuracy and memory requirements comparable to that of monolithic discrete ordinates methods while reducing runtime by as much as a factor of between two and ten, depending on the problem.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

A hybrid adaptive multiresolution approach for the efficient simulation of reactive flows

Computational studies that use block-structured adaptive mesh refinement (AMR) approaches suffer from unnecessarily high mesh resolution in regions adjacent to important solution features. This deficiency limits the performance of AMR codes. In this work a novel hybrid adaptive multiresolution (HAMR) approach to AMR-based calculations is introduced to address this issue. The multiresolution (MR) smoothness indicators are used to identify regions of smoothness on the mesh where the computational cost of individual physics solvers may be decreased by replacing direct calculations with interpolation. We suggest an approach to balance the errors due to the adaptive discretization and the interpolation of physics quantities such that the overall accuracy of the HAMR solution is consistent with that of the MR-driven AMR solution. The performance of the HAMR scheme is evaluated for a range of test problems, from pure hydrodynamics to turbulent combustion.

97 MATHEMATICS AND COMPUTING↗

Surrogate Model Development for Fuels for Advanced Combustion Engines

The fuels used in internal-combustion engines are complex mixtures of a multitude of different types of hydrocarbon species. Attempting numerical simulations of combustion of real fuels with all of the hydrocarbon species included is highly unrealistic. Thus, a surrogate model approach is generally adopted, which involves choosing a few representative hydrocarbon species whose overall behavior mimics the characteristics of the target fuel. The present study proposes surrogate models for the ninefuels for advanced combustion engines (FACE) that have been developed for studying low-emission, high-efficiency advanced diesel engine concepts. The surrogate compositions for the fuels are arrived at by simulating their distillation profiles to within a maximum absolute error of ~4% using a discrete multi-component (DMC) fuel model that has been incorporated in the multi-dimensional computational fluid dynamics (CFD) code, KIVA-ERC-CHEMKIN. The simulated surrogate compositions cover the range and measured concentrations of the various hydrocarbon classes present in the fuels. The fidelity of the surrogate fuel models is judged on the basis of matching their specific gravity, lower heating value, hydrogen/carbon (H/C) ratio, cetane number, and cetane index with the measured data for all nine FACE fuels.

33 ADVANCED PROPULSION SYSTEMS↗

An Energy Consistent Discretization of the Nonhydrostatic Equations in Primitive Variables

We derive a formulation of the nonhydrostatic equations in spherical geometry with a Lorenz staggered vertical discretization. The combination conserves a discrete energy in exact time integration when coupled with a mimetic horizontal discretization. The formulation is a version of Dubos and Tort (2014, https://doi.org/10.1175/MWR-D-14-00069.1) rewritten in terms of primitive variables. It is valid for terrain following mass or height coordinates and for both Eulerian or vertically Lagrangian discretizations. The discretization relies on an extension to Simmons and Burridge (1981, https://doi.org/10.1175/1520-0493(1981)109<0758:AEAAMC>2.0.CO;2) vertical differencing, which we show obeys a discrete derivative product rule. This product rule allows us to simplify the treatment of the vertical transport terms. Energy conservation is obtained via a term-by-term balance in the kinetic, internal, and potential energy budgets, ensuring an energy-consistent discretization up to time truncation error with no spurious sources of energy. We demonstrate convergence with respect to time truncation error in a spectral element code with a horizontal explicit vertically implicit implicit-explicit time stepping algorithm.

97 MATHEMATICS AND COMPUTING↗

Sinc-based method for an efficient solution in the direct space of quantum wave equations with periodic boundary conditions

The solution of differential problems, and in particular of quantum wave equations, can in general be performed both in the direct and in the reciprocal space. However, to achieve the same accuracy, direct-space finite-difference approaches usually involve handling larger algebraic problems with respect to the approaches based on the Fourier transform in reciprocal space. This is the result of the errors that direct-space discretization formulas introduce into the treatment of derivatives. Here, we propose an approach, relying on a set of sinc-based functions, that allows us to achieve an exact representation of the derivatives in the direct space and that is equivalent to the solution in the reciprocal space. We apply this method to the numerical solution of the Dirac equation in an armchair graphene nanoribbon with a potential varying only in the transverse direction.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Test Problem for Codes Solving the Discretized Diffusion Equation in Cartesian Geometry Derived Via Discrete Green’s Functions

We obtain here a solution to a zone-centered discretization of the one dimensional time-dependent diffusion equation with arbitrary initial conditions and source, constant absorption and scattering opacity, and constant zone size and time step. The solution is obtained using the discrete Green’s functions of the discretized equation. The solution of the discretized equation is useful in the testing of computer codes, because the code can be expected to agree with the solution to the discrete equation, to within small errors caused by roundoff. This is in contrast to solutions of the differential equation, with which the code results only approximately agree. Finally, the usefulness of the solution for tests of an inertial confinement fusion code is demonstrated.

97 MATHEMATICS AND COMPUTING↗

The analysis of a sparse grid stochastic collocation method for partial differential equations with high-dimensional random input data.

This work describes the convergence analysis of a Smolyak-type sparse grid stochastic collocation method for the approximation of statistical quantities related to the solution of partial differential equations with random coefficients and forcing terms (input data of the model). To compute solution statistics, the sparse grid stochastic collocation method uses approximate solutions, produced here by finite elements, corresponding to a deterministic set of points in the random input space. This naturally requires solving uncoupled deterministic problems and, as such, the derived strong error estimates for the fully discrete solution are used to compare the computational efficiency of the proposed method with the Monte Carlo method. Numerical examples illustrate the theoretical results and are used to compare this approach with several others, including the standard Monte Carlo.

97 MATHEMATICS AND COMPUTING↗

A GENERALIZED STOCHASTIC COLLOCATION APPROACH TO CONSTRAINED OPTIMIZATION FOR RANDOM DATA IDENTIFICATION PROBLEMS

We present a scalable, parallel mechanism for stochastic identification/control for problems constrained by partial differential equations with random input data. Several identification objectives will be discussed that either minimize the expectation of a tracking cost functional or minimize the difference of desired statistical quantities in the appropriate $L^p$ norm, and the distributed parameters/control can both deterministic or stochastic. Given an objective we prove the existence of an optimal solution, establish the validity of the Lagrange multiplier rule and obtain a stochastic optimality system of equations. The modeling process may describe the solution in terms of high dimensional spaces, particularly in the case when the input data (coefficients, forcing terms, boundary conditions, geometry, etc) are affected by a large amount of uncertainty. For higher accuracy, the computer simulation must increase the number of random variables (dimensions), and expend more effort approximating the quantity of interest in each individual dimension. Hence, we introduce a novel stochastic parameter identification algorithm that integrates an adjoint-based deterministic algorithm with the sparse grid stochastic collocation FEM approach. This allows for decoupled, moderately high dimensional, parameterized computations of the stochastic optimality system, where at each collocation point, deterministic analysis and techniques can be utilized. The advantage of our approach is that it allows for the optimal identification of statistical moments (mean value, variance, covariance, etc.) or even the whole probability distribution of the input random fields, given the probability distribution of some responses of the system (quantities of physical interest). Our rigorously derived error estimates, for the fully discrete problems, will be described and used to compare the efficiency of the method with several other techniques. Numerical examples illustrate the theoretical results and demonstrate the distinctions between the various stochastic identification objectives.

Webster, Clayton G↗

THE LOSS OF ACCURACY OF STOCHASTIC COLLOCATION METHOD IN SOLVING NONLINEAR DIFFERENTIAL EQUATIONS WITH RANDOM INPUT DATA

n this paper we show how stochastic collocation method (SCM) could fail to con- verge for nonlinear differential equations with random coefficients. First, we consider Navier-Stokes equation with uncertain viscosity and derive error estimates for stochastic collocation discretization. Our analysis gives some indicators on how the nonlinearity negatively affects the accuracy of the method. The stochastic collocation method is then applied to noisy Lorenz system. Simulation re- sults demonstrate that the solution of a nonlinear equation could be highly irregular on the random data and in such cases, stochastic collocation method cannot capture the correct solution.

Webster, Clayton G↗