Engineering Papers⌕ Search

SEARCH · Engineering Papers

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

Registration of human skull computed tomography data to an ultrasound treatment space using a sparse high frequency ultrasound hemispherical array

Purpose: Transcranial focused ultrasound (FUS) shows great promise for a range of therapeutic applications in the brain. Current clinical investigations rely on the use of magnetic resonance imaging (MRI) to monitor treatments and for the registration of preoperative computed tomography (CT)-data to the MR images at the time of treatment to correct the sound aberrations caused by the skull. For some applications, MRI is not an appropriate choice for therapy monitoring and its cost may limit the accessibility of these treatments. An alternative approach, using high frequency ultrasound measurements to localize the skull surface and register CT data to the ultrasound treatment space, for the purposes of skull-related phase aberration correction and treatment targeting, has been developed. Methods: A prototype high frequency, hemispherical sparse array was fabricated. Pulse-echo measurements of the surface of five ex vivo human skulls were made, and the CT datasets of each skull were obtained. The acoustic data were used to rigidly register the CT-derived skull surface to the treatment space. The ultrasound-based registrations of the CT datasets were compared to the gold-standard landmark-based registrations. Results: The results show on an average sub-millimeter (0.9 ± 0.2 mm) displacement and subdegree (0.8° ± 0.4°) rotation registration errors. Numerical simulations predict that registration errors on this scale will result in a mean targeting error of 1.0 ± 0.2 mm and reduction in focal pressure of 1.0% ± 0.6% when targeting a midbrain structure (e.g., hippocampus) using a commercially available low-frequency brain prototype device (InSightec, 230 kHz brain system). Conclusions: If combined with ultrasound-based treatment monitoring techniques, this registration method could allow for the development of a low-cost transcranial FUS treatment platform to make this technology more widely available.

60 APPLIED LIFE SCIENCES↗

An unstructured C-grid type variational formulation for the sea ice dynamics

Historically, B-grid formulations of sea ice dynamics have been dominant because they have matched the grid type used by ocean models. The reason for the grid match is simple – it facilitates penetration of the curl of ice-ocean stress into the deep ocean with minimal numerical diffusivity because sea ice and ocean velocity are co-located. In recent years, as ocean models have increasingly progressed to C-grids, sea ice models have followed suit on quadrilateral meshes, but the implementation of an unstructured C-grid sea ice models is new. We present an unstructured C-grid discretization of the Elastic Viscous Plastic (EVP) rheology, where the velocity unknowns are discretized at the edges of the mesh cells with n-sides, where typically n is greater than or equal to four, rather than at the vertices, as in the B-grid. Our framework of choice is the Model for Prediction Across Scales (MPAS) within E3SM, the climate model of the U.S. Department of Energy, although our approach is general and could be applied to other models as well. While MPAS-Seaice is currently defined on a B-grid, MPAS-Ocean runs on a C-grid, hence interpolation operators are heavily used when coupled simulations are performed. In this work, we describe a mathematical formulation to transition the dynamics of MPAS-Seaice to a C-grid, in order to ultimately facilitate the coupling with MPAS-Ocean and reduce numerical errors associated with this communication. Numerical results are reported to highlight the features of the method.

58 GEOSCIENCES↗

Numerical study of error propagation in Monte Carlo depletion simulations

Improving computer technology and the desire to more accurately model the heterogeneity of the nuclear reactor environment have made the use of Monte Carlo depletion codes more attractive in recent years, and feasible (if not practical) even for 3-D depletion simulation. However, in this case statistical uncertainty is combined with error propagating through the calculation from previous steps. In an effort to understand this error propagation, a numerical study was undertaken to model and track individual fuel pins in four 17 x 17 PWR fuel assemblies. By changing the code's initial random number seed, the data produced by a series of 19 replica runs was used to investigate the true and apparent variance in k{sub eff}, pin powers, and number densities of several isotopes. While this study does not intend to develop a predictive model for error propagation, it is hoped that its results can help to identify some common regularities in the behavior of uncertainty in several key parameters. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Asymptotic convergence of the angular discretization error in the scalar flux computed from the particle transport equation with the method of discrete ordinates

The asymptotic convergence of the angular discretization error in the scalar flux solution of the particle transport equation computed with the Discrete Ordinates (S N ) method with increasing quadrature order is examined. Five selected angular quadrature types are considered: Level Symmetric (LS), Legendre-Chebyshev Quadrangular (LCQ), Legendre-Chebyshev Triangular(LCT), Quadruple Range (QR) and Quadruple Range Spence-type (QRS) quadrature sets. We relate the S N angular discretization error to the quadrature error, and split the total flux into the uncollided flux and the fully collided flux, and then we verify the uncollided scalar flux error and the fully collided scalar flux error separately. After developing the theoretical basis for the relationship between true solution regularity and quadrature rule error, we employ a two-dimensional problem to verify the observed and theoretical convergence orders for the region-averaged uncollided and fully collided scalar flux errors. Numerical results show that the angular discretization errors in the region-averaged scalar flux obtained by different quadrature types converge with different rates, that are commensurate with the regularity order of the exact angular flux within the quadrature-designed integration interval. The angular discretization error in the uncollided region-averaged scalar flux obtained by LC class quadratures converges linearly, and the error obtained by QR class quadrature sets converges quadratically. The angular discretization error in the fully collided region-averaged scalar flux converges linearly for LC class quadratures, and faster-than-second order for QR class quadrature sets.

42 ENGINEERING↗

Sampling Low-Dimensional Markovian Dynamics for Preasymptotically Recovering Reduced Models from Data with Operator Inference

This work introduces a method for learning low-dimensional models from data of high-dimensional black-box dynamical systems. The novelty is that the learned models are exactly the reduced models that are traditionally constructed with classical projection-based model reduction techniques. Thus, the proposed approach learns models that are guaranteed to have the well-studied properties of reduced models known from model reduction, without requiring full knowledge of the governing equations and without requiring the operators of the high-dimensional systems. The key ingredient is a new data sampling scheme to obtain re-projected trajectories of high-dimensional systems that correspond to Markovian dynamics in low-dimensional subspaces. The exact recovery of reduced models from these re-projected trajectories is guaranteed pre-asymptotically under certain conditions for finite amounts of data and for a large class of systems with polynomial nonlinear terms. Numerical results demonstrate that the low-dimensional models learned with the proposed approach match reduced models from traditional model reduction up to numerical errors in practice. In conclusion, the numerical results further indicate that low-dimensional models fitted to re-projected trajectories are predictive even in situations where models fitted to trajectories without re-projection are inaccurate and unstable.

97 MATHEMATICS AND COMPUTING↗

The Role of Data Transfer on the Selection of a Single vs Multiple Mesh Architecture for Tightly Coupled Multiphysics Applications

Data transfer from one distinct mesh to another may be necessary in any number of applications, including prolongation operations supporting multigrid solution methods, spatial adaptation, remeshing, and arbitrary Lagrangian-Eulerian (ALE) and multiphysics simulation. This data transfer process is also referred to as remapping, rezoning and interpolation. Intermesh data transfer has the potential to introduce error into a simulation; the magnitude and importance of which depends on the transfer scenario and the algorithm used to perform the transfer. For a transient analysis, data transfer may occur many times during a simulation, with possible error accumulation at each transfer. The present study develops selected scenarios that illustrate data transfer error and how it might impact an analysis. This study examines remapping error by using static analytical functions to compare various remapping schemes. It also investigates the significance and nature of data transfer error for a simple multiphysics system involving a transient coupled system of partial differential equations. It concludes that remapping error can be significant both for static functions and for coupled multiphysics systems. Aggregate error is shown to be a function of remapping scheme, mesh coarseness, nature of the remapped function and mesh disparity. In cases of extreme mesh disparity, this study shows that remapping can lead to excessive error and even to solution instability. Further, this work motivates that remapping error should be included in the estimation of numerical error, if data transfer is employed in a numerical simulation.

99 GENERAL AND MISCELLANEOUS↗

Shadow Lagrangian dynamics for superfluidity

Motivated by a similar approach for Born-Oppenheimer molecular dynamics, this paper proposes an extended "shadow" Lagrangian density for quantum states of superfluids. The extended Lagrangian contains an additional field variable that is forced to follow the wave function of the quantum state through a rapidly oscillating extended harmonic oscillator. By considering the adiabatic limit for large frequencies of the harmonic oscillator, we can derive the two equations of motions, a Schrödinger-type equation for the quantum state and a wave equation for the extended field variable. The equations are coupled in a nonlinear way, but each equation individually is linear with respect to the variable that it defines. The computational advantage of this new system is that it can be easily discretized using linear time stepping methods, where we propose to use a Crank-Nicolson-type approach for the Schrödinger equation and an extended leapfrog scheme for the wave equation. Furthermore, the difference between the quantum state and the extended field variable defines a consistency error that should go to zero if the frequency tends to infinity. By coupling the time-step size in our discretization to the frequency of the harmonic oscillator we can extract an easily computable consistency error indicator that can be used to estimate the numerical error without additional costs. The findings are illustrated in numerical experiments.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

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↗

Numerical Verification of Equilibrium Thermodynamic Computations in Nuclear Fuel Performance Codes

There is an increasing desire to integrate thermodynamic computations directly into multi-physics nuclear fuel performance and safety codes. These computations provide, among other matters, boundary conditions in heat and mass transport modules in predicting fuel behaviour. Precision must be maintained in computations involving fission and activation products with very low concentrations which may nonetheless have significant radiological consequences. Also, there is the concern about the propagation of numerical errors in multi-physics codes. A method to numerically verify equilibrium thermodynamic computations is therefore necessary to satisfy rigorous quality assurance standards of the nuclear industry without significantly impeding computational performance. A technique is presented that can be applied to systems of any number of phases and system components. The technique is reliable and comprehensive in ensuring that all conceivable equilibrium constants have been satisfied without having to formulate each one of a potentially very large number.

Piro, Markus↗

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↗

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↗

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↗

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↗

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↗

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↗

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↗

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↗

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↗