Search NASA⌕ Search

SEARCH · Search NASA

Results for “numerical 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 73 records · Page 4
All sourcesNASA NTRSDOE OSTI
DOE OSTI2013

Extended forward sensitivity analysis of one-dimensional isothermal flow

Sensitivity analysis and uncertainty quantification is an important part of nuclear safety analysis. In this work, forward sensitivity analysis is used to compute solution sensitivities on 1-D fluid flow equations typical of those found in system level codes. Time step sensitivity analysis is included as a method for determining the accumulated error from time discretization. The ability to quantify numerical error arising from the time discretization is a unique and important feature of this method. By knowing the relative sensitivity of time step with other physical parameters, the simulation is allowed to run at optimized time steps without affecting the confidence of the physical parameter sensitivity results. The time step forward sensitivity analysis method can also replace the traditional time step convergence studies that are a key part of code verification with much less computational cost. One well-defined benchmark problem with manufactured solutions is utilized to verify the method; another test isothermal flow problem is used to demonstrate the extended forward sensitivity analysis process. Through these sample problems, the paper shows the feasibility and potential of using the forward sensitivity analysis method to quantify uncertainty in input parameters and time step size for a 1-D system-level thermal-hydraulic safety code. (authors)

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Solution-Based Adaptivity as a Paradigm for Computational Fluid Dynamics

This is the final report for the DOE Early Career award. Through innovation in error estimation and solution-based adaptation methods we strive to dramatically improve the efficiency and robustness of computational science and engineering simulations. By solution-based error estimation and adaptation we refer to techniques for estimating numerical error and efficiently reducing it through targeted discretization changes. In such a setting, high-order methods play a key role, though they are just one mechanism for efficient accuracy improvement. Other mechanisms include well known mesh size and stretching optimization, as well as less-practiced mesh motion and basis optimization. With additional work on the latter, we are integrating these techniques into one adaptive suite that maximizes efficiency and robustness of Computational Fluid Dynamics (CFD) calculations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2012

CoCoMANS Ocean App [Slides]

Thermohaline circulation is that part of ocean circulation which is driven by density gradients. It is widely believed that changes in the ocean thermohaline circulation on the 10 to 100 year time scale can instigate rapid climate change. Scientists world wide are currently using simulation tools based on semi-implicit and split methods that are first-order in time. From a numerical error perspective, the quality of such simulations is suspect. As a result of numerical stability issues resulting from semi-implicit and split methods they are forced to use low resolution grids; ie high resolution grids will require prohibitive numbers of timesteps. Having the ability to perform such simulation with reduced splitting errors, using high resolution grids, and using second-order accurate time integration methods will be a quantum leap forward in predictive ocean simulation.

36 MATERIALS SCIENCE↗
DOE OSTI2017

Local Error Analysis and Comparison of the Swept- and Intersection-Based Remapping Methods

Abstract In this paper, the numerical error of two widely used methods for remapping of discrete quantities from one computational mesh to another is investigated. We compare the intuitive, but resource intensive method utilizing intersections of computational cells with the faster and simpler swept-region-based method. Both algorithms are formally second order accurate, however, they are known to produce slightly different quantity profiles in practical applications. The second-order estimate of the error formula is constructed algebraically for both algorithms so that their local accuracy can be evaluated. This general estimate is then used to assess the dependence of the performance of both methods on parameters such as the second derivatives of the remapped distribution, mesh geometry or mesh movement. Due to the complexity of such analysis, it is performed on a set of simplified elementary mesh patterns such as cell corner expansion, rotation or shear. On selected numerical tests it is demonstrated that the swept-based method can distort a symmetric quantity distribution more substantially than the intersection-based approach when the computational mesh moves in an unsuitable direction.

Klima, Matej↗
DOE OSTI2025

Score-Based Physics-Informed Neural Networks for High-Dimensional Fokker–Planck Equations

The Fokker-Planck (FP) equation is a foundational partial differential equation (PDE) in stochastic processes involving Brownian motions. However, the curse of dimensionality (CoD) poses a formidable challenge when dealing with high-dimensional FP equations. Although Monte Carlo simulation and (vanilla) Physics-Informed Neural Networks (PINNs) have shown the potential to tackle CoD, both methods exhibit significant numerical errors in high dimensions when dealing with the probability density function (PDF) associated with Brownian motion. The point-wise PDF values tend to decrease exponentially as dimensionality increases, surpassing the precision of numerical simulations and resulting in substantial errors. In addition, due to its massive sampling, Monte Carlo fails to offer fast sampling. Modeling the logarithm likelihood (LL) via vanilla PINNs transforms the FP equation into a notoriously difficult Hamilton-Jacobi-Bellman (HJB) equation, which is impractical for PINN learning, whose error grows rapidly with dimension. To this end, we propose a novel approach utilizing a score-based solver to fit the score function in stochastic differential equations (SDEs). The score function, defined as the gradient of the LL, plays a fundamental role in inferring LL and PDF and enables fast SDE sampling, offering an effective means to overcome the CoD. Three fitting methods, Score Matching (SM), Sliced Score Matching (SSM), and Score-PINN, are introduced, each contributing unique advantages in computational complexity, accuracy, and generality. The proposed score-based SDE solver operates in two stages: first, employing score matching or Score-PINN to acquire the score function; and second, solving the LL via an ordinary differential equation (ODE) using the obtained score function. Comparative evaluations across these methods showcase varying trade-offs. The proposed methodology is evaluated across diverse SDEs, including anisotropic Ornstein-Uhlenbeck processes, geometric Brownian motion, and Brownian motion with varying eigenspace. We also test various distributions, including Gaussian, Log-normal, Laplace, and Cauchy distributions. The numerical results demonstrate the score-based SDE solver’s stability, speed, and performance across different experimental settings, solidifying its potential as a solution to CoD for high-dimensional FP equations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Computational Errors in the Calculation of Long Radioactive Decay Chains

For safety security of objects utilizing atomic energy, the effect of numerical errors on the calculation of the activity and integrals of the activity in time when using Bateman’s formula and Siewers’ algorithm to calculate radioactive decay chains is investigated. The smallest errors obtain when using Siewers’ algorithm and Bateman’s formula together with long arithmetic. It is shown that the standard calculations of radioactive decay chains according to Bateman’s formula with double precision lead to significant errors. However, these errors have almost no effect on the dose characteristics of mixtures of radionuclides. The analysis is based on data contained in ICRP Publication No. 107.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2022

Quantifying Errors in Effective Cluster Interactions of Lattice Gas Cluster Expansions

The promise of lattice gas (LG) cluster expansions (CEs) is that they can describe a given system property to any level of accuracy since the orthogonal “cluster basis functions” span the complete space of available configurations. Such an approach can be constructed to an arbitrarily large surface of a finite number of distinct adsorption sites. Unfortunately, this is only true for the case of an ideal, fixed lattice decorated with components at precise lattice points (the lattice “sites”) with no distortions or relaxations subsequently allowed. Since most systems, and surfaces specifically, do not conform to such an ideal set of constraints, errors in LG CEs must be expected or CE convergence severely hampered. Beyond this, numerical errors in the provided data can complicate the proper construction of a truly predictive and/or physically significant CE. In this work, we show here how reliance on typical statistical tools like confidence intervals cannot be expected to provide an accurate representation of the uncertainty of effective cluster interactions (ECIs) in the CE due to the nature of the target ab initio data and the nature of CEs themselves. We develop a method for estimating these errors that does not rely on statistical assumptions about the model or data. We then use these ECI errors to quantify fundamental consequences on the uncertainty of ECIs in CEs built from O/Fe(100) data whose surface and adsorbates have been allowed to relax in a typical manner and from O/Fe(100) data whose surface and adsorbates are fixed in ideal lattice positions. We also quantify the effect of using a different density functional theory exchange–correlation functional, using these ECI errors to assess the significance in any deviations. In both cases, our method is shown to have remarkable utility in the quantification of errors in the ECIs of CEs. While we stick to the lattice gas convention in this work, the method is equally applicable to the Ising convention or, in principle, any linear model of sufficient complexity.

08 HYDROGEN↗
DOE OSTI2021

Improved Prediction of Cold-Air Pools in the Weather Research and Forecasting Model Using a Truly Horizontal Diffusion Scheme for Potential Temperature

The terrain-following vertical coordinate system used by many atmospheric models, including the Weather Research and Forecasting (WRF) Model, is prone to errors in regions of complex terrain. These errors stem, in part, from the calculation of horizontal gradients within the diffusion term of the momentum or scalar evolution equations. In WRF, such gradients can be calculated along coordinate surfaces, or using metric terms that help account for grid skewness. However, neither of these options ensures a truly horizontal gradient calculation, especially if a grid cell is skewed enough that the heights of the neighboring grid points used in the calculation fall outside the vertical range of the cell. In this work, an improved scheme that uses Taylor series approximations to vertically interpolate variables to the level necessary for a truly horizontal gradient calculation is implemented in WRF for the diffusion of potential temperature. The scheme is validated using an atmosphere-at-rest configuration, in which spurious flows develop only as a result of numerical errors and can thus be used as a proxy for model performance. Following validation, the method is applied to the simulation of cold-air pools (CAPs), which occur in regions of complex terrain and are characterized by strong near-surface temperature gradients. Using the truly horizontal scheme, idealized simulations demonstrate reduced numerical mixing in a quiescent CAP, and a realistic case study in the Columbia River basin shows a reduction in positive wind speed bias by up to roughly 20% compared to observations from the Second Wind Forecast Improvement Project.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2016

Numerical study on the Welander oscillatory natural circulation problem using high-order numerical methods

In this study, the classical Welander’s oscillatory natural circulation problem is investigated using high-order numerical methods. As originally studied by Welander, the fluid motion in a differentially heated fluid loop can exhibit stable, weakly instable, and strongly instable modes. A theoretical stability map has also been originally derived from the stability analysis. Numerical results obtained in this paper show very good agreement with Welander’s theoretical derivations. For stable cases, numerical results from both the high-order and low-order numerical methods agree well with the non-dimensional flow rate analytically derived. The high-order numerical methods give much less numerical errors compared to the low-order methods. For stability analysis, the high-order numerical methods could perfectly predict the stability map, while the low-order numerical methods failed to do so. For all theoretically unstable cases, the low-order methods predicted them to be stable. The result obtained in this paper is a strong evidence to show the benefits of using high-order numerical methods over the low-order ones, when they are applied to simulate natural circulation phenomenon that has already gain increasing interests in many future nuclear reactor designs.

42 ENGINEERING↗
DOE OSTI2015

An ILP based Algorithm for Optimal Customer Selection for Demand Response in SmartGrids

Demand Response (DR) events are initiated by utilities during peak demand periods to curtail consumption. They ensure system reliability and minimize the utility’s expenditure. Selection of the right customers and strategies is critical for a DR event. An effective DR scheduling algorithm minimizes the curtailment error which is the absolute difference between the achieved curtailment value and the target. State-of-the-art heuristics exist for customer selection, however their curtailment errors are unbounded and can be as high as 70%. In this work, we develop an Integer Linear Programming (ILP) formulation for optimally selecting customers and curtailment strategies that minimize the curtailment error during DR events in SmartGrids. We perform experiments on real world data obtained from the University of Southern California’s SmartGrid and show that our algorithm achieves near exact curtailment values with errors in the range of 10 -7 to 10 -5 , which are within the range of numerical errors. We compare our results against the state-of-the-art heuristic being deployed in practice in the USC SmartGrid. We show that for the same set of available customer strategy pairs our algorithm performs 103 to 107 times better in terms of the curtailment errors incurred.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Machine learning based algorithms for uncertainty quantification in numerical weather prediction models

Complex numerical weather prediction models incorporate a variety of physical processes, each described by multiple alternative physical schemes with specific parameters. The selection of the physical schemes and the choice of the corresponding physical parameters during model configuration can significantly impact the accuracy of model forecasts. There is no combination of physical schemes that works best for all times, at all locations, and under all conditions. It is therefore of considerable interest to understand the interplay between the choice of physics and the accuracy of the resulting forecasts under different conditions. This paper demonstrates the use of machine learning techniques to study the uncertainty in numerical weather prediction models due to the interaction of multiple physical processes. The first problem addressed herein is the estimation of systematic model errors in output quantities of interest at future times, and the use of this information to improve the model forecasts. The second problem considered is the identification of those specific physical processes that contribute most to the forecast uncertainty in the quantity of interest under specified meteorological conditions. In order to address these questions we employ two machine learning approaches, random forests and artificial neural networks. The discrepancies between model results and observations at past times are used to learn the relationships between the choice of physical processes and the resulting forecast errors. Numerical experiments are carried out with the Weather Research and Forecasting (WRF) model. The output quantity of interest is the model precipitation, a variable that is both extremely important and very challenging to forecast. The physical processes under consideration include various micro-physics schemes, cumulus parameterizations, short wave, and long wave radiation schemes. The experiments demonstrate the strong potential of machine learning approaches to aid the study of model errors.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2014

Enabling Predictive Simulation and UQ of Complex Multiphysics PDE Systems by the Development of Goal-Oriented Variational Sensitivity Analysis and A Posteriori Error Estimation Methods

It was demonstrated that a posteriori analyses in general and in particular one that uses adjoint methods can accurately and efficiently compute numerical error estimates and sensitivity for critical Quantities of Interest (QoIs) that depend on a large number of parameters. Activities include: analysis and implementation of several time integration techniques for solving system of ODEs as typically obtained from spatial discretization of PDE systems; multirate integration methods for ordinary differential equations; formulation and analysis of an iterative multi-discretization Galerkin finite element method for multi-scale reaction-diffusion equations; investigation of an inexpensive postprocessing technique to estimate the error of finite element solution of the second-order quasi-linear elliptic problems measured in some global metrics; investigation of an application of the residual-based a posteriori error estimates to symmetric interior penalty discontinuous Galerkin method for solving a class of second order quasi-linear elliptic problems; a posteriori analysis of explicit time integrations for system of linear ordinary differential equations; derivation of accurate a posteriori goal oriented error estimates for a user-defined quantity of interest for two classes of first and second order IMEX schemes for advection-diffusion-reaction problems; Postprocessing finite element solution; and A Bayesian Framework for Uncertain Quantification of Porous Media Flows.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

High-order asynchrony-tolerant finite difference schemes for partial differential equations

Synchronizations of processing elements (PEs) in massively parallel simulations, which arise due to communication or load imbalances between PEs, significantly affect the scalability of scientific applications. We have recently proposed a method based on finite-difference schemes to solve partial differential equations in an asynchronous fashion – synchronization between PEs is relaxed at a mathematical level. While standard schemes can maintain their stability in the presence of asynchrony, their accuracy is drastically affected. In this work, we present a general methodology to derive asynchrony-tolerant (AT) finite difference schemes of arbitrary order of accuracy, which can maintain their accuracy when synchronizations are relaxed. We show that there are several choices available in selecting a stencil to derive these schemes and discuss their effect on numerical and computational performance. We provide a simple classification of schemes based on the stencil and derive schemes that are representative of different classes. Their numerical error is rigorously analyzed within a statistical framework to obtain the overall accuracy of the solution. Results from numerical experiments are used to validate the performance of the schemes.

42 ENGINEERING↗
DOE OSTI2018

An assessment of atypical mesh topologies for low-Mach large-eddy simulation

An implicit, low-dissipation, low-Mach, variable density control volume finite element formulation is used to explore foundational understanding of numerical accuracy for large-eddy simulation applications on hybrid meshes. Detailed simulation comparisons are made between low-order hexahedral, tetrahedral, pyramid, and wedge/prism topologies against a third-order, unstructured hexahedral topology. Using smooth analytical and manufactured low-Mach solutions, design-order convergence is established for the hexahedral, tetrahedral, pyramid, and wedge element topologies using a new open boundary condition based on energy-stable methodologies previously deployed within a finite-difference context. A wide range of simulations demonstrate that low-order hexahedral- and wedge-based element topologies behave nearly identically in both computed numerical errors and overall simulation timings. Moreover, low-order tetrahedral and pyramid element topologies also display nearly the same numerical characteristics. Although the superiority of the hexahedral-based topology is clearly demonstrated for trivial laminar, principally-aligned flows, e.g., a 1x2x10 channel flow with specified pressure drop, this advantage is reduced for non-aligned, turbulent flows including the Taylor–Green Vortex, turbulent plane channel flow ( Re τ 395), and buoyant flow past a heated cylinder. With the order of accuracy demonstrated for both homogenous and hybrid meshes, it is shown that solution verification for the selected complex flows can be established for all topology types. Although the number of elements in a mesh of like spacing comprised of tetrahedral, wedge, or pyramid elements increases as compared to the hexahedral counterpart, for wall-resolved large-eddy simulation, the increased assembly and residual evaluation computational time for non-hexahedral is offset by more efficient linear solver times. Lastly, most simulation results indicate that modest polynomial promotion provides a significant increase in solution accuracy.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2014

ON THE MINIMAL ACCURACY REQUIRED FOR SIMULATING SELF-GRAVITATING SYSTEMS BY MEANS OF DIRECT N-BODY METHODS

The conservation of energy, linear momentum, and angular momentum are important drivers of our physical understanding of the evolution of the universe. These quantities are also conserved in Newton's laws of motion under gravity. Numerical integration of the associated equations of motion is extremely challenging, in particular due to the steady growth of numerical errors (by round-off and discrete time-stepping and the exponential divergence between two nearby solutions. As a result, numerical solutions to the general N-body problem are intrinsically questionable. Using brute force integrations to arbitrary numerical precision we demonstrate empirically that ensembles of different realizations of resonant three-body interactions produce statistically indistinguishable results. Although individual solutions using common integration methods are notoriously unreliable, we conjecture that an ensemble of approximate three-body solutions accurately represents an ensemble of true solutions, so long as the energy during integration is conserved to better than 1/10. We therefore provide an independent confirmation that previous work on self-gravitating systems can actually be trusted, irrespective of the intrinsically chaotic nature of the N-body problem.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2019

CTF Code Verification and Solution Verification

The CTF code is part of the suite of codes developed with DOE funding under the CASL Program to bring the benefits of high-performance computing to issues of importance to the US nuclear power industry. This document primarily focuses on code and solution verification test problems that have been developed to ensure that CTF converges to the correct answer for the intended application. Convergence behavior and numerical errors are quantified for each of the tests. The observed convergence behavior in all available tests is consistent with expectations for the numerical methods employed by CTF, providing evidence that there are no significant code bugs or algorithm deficiencies in the code. The suite of code verification and solution verification tests are mapped to core capabilities of CTF. Gaps were identified in the code verification test suite and they are being addressed. Two new code verification problems were developed to address gaps that were identified.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2017

Magnus: A New Resistive MHD Code with Heat Flow Terms

We present a new magnetohydrodynamic (MHD) code for the simulation of wave propagation in the solar atmosphere, under the effects of electrical resistivity—but not dominant—and heat transference in a uniform 3D grid. The code is based on the finite-volume method combined with the HLLE and HLLC approximate Riemann solvers, which use different slope limiters like MINMOD, MC, and WENO5. In order to control the growth of the divergence of the magnetic field, due to numerical errors, we apply the Flux Constrained Transport method, which is described in detail to understand how the resistive terms are included in the algorithm. In our results, it is verified that this method preserves the divergence of the magnetic fields within the machine round-off error (∼1×10{sup −12}). For the validation of the accuracy and efficiency of the schemes implemented in the code, we present some numerical tests in 1D and 2D for the ideal MHD. Later, we show one test for the resistivity in a magnetic reconnection process and one for the thermal conduction, where the temperature is advected by the magnetic field lines. Moreover, we display two numerical problems associated with the MHD wave propagation. The first one corresponds to a 3D evolution of a vertical velocity pulse at the photosphere–transition–corona region, while the second one consists of a 2D simulation of a transverse velocity pulse in a coronal loop.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2022

Verification of MOOSE/Bison's Heat Conduction Solver Using Combined Spatiotemporal Convergence Analysis

Bison is a computational physics code that uses the finite element method to model the thermo-mechanical response of nuclear fuel. Since Bison is used to inform high-consequence decisions, it is important that its computational results are reliable and predictive. One important step in assessing the reliability and predictive capabilities of a simulation tool is the verification process, which quantifies numerical errors in a discrete solution relative to the exact solution of the mathematical model. One step in the verification process—called code verification—ensures that the implemented numerical algorithm is a faithful representation of the underlying mathematical model, including partial differential or integral equations, initial and boundary conditions, and auxiliary relationships. In this paper, the code verification process is applied to spatiotemporal heat conduction problems in Bison. Simultaneous refinement of the discretization in space and time is employed to reveal any potential mistakes in the numerical algorithms for the interactions between the spatial and temporal components of the solution. For each verification problem, the correct spatial and temporal order of accuracy is demonstrated for both first- and second-order accurate finite elements and a variety of time-integration schemes. Furthermore, these results provide strong evidence that the Bison numerical algorithm for solving spatiotemporal problems reliably represents the underlying mathematical model in MOOSE. The selected test problems can also be used in other simulation tools that numerically solve for conduction or diffusion.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗