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 343 records · Page 19

DSD2D-FLS 2010: Bdzil's 2010 DSD Code Base; Computing tb and Dn with Edits to Reduce the Noise in the Dn Field Near HE Boundaries

The full level-set function code, DSD3D, is fully described in LA-14336 (2007) [1]. This ASCI-supported, DSD code project was the last such LANL DSD code project that I was involved with before my retirement in 2007. My part in the project was to design and build the core DSD3D solver, which was to include a robust DSD boundary condition treatment. A robust boundary condition treatment was required, since for an important local “customer,” the only description of the explosives’ boundary was through volume fraction data. Given this requirement, the accuracy issues I had encountered with our “fast-tube,” narrowband, DSD2D solver, and the difficulty we had building an efficient MPI-parallel version of the narrowband DSD2D, I decided DSD3D should be built as a full level-set function code, using a totally local DSD boundary condition algorithm for the level-­set function, phi, which did not rely on the gradient of the level-­set function being one, |grad(phi)| = 1. The narrowband DSD2D solver was built on the assumption that |grad(phi)| could be driven to one, and near the boundaries of the explosive this condition was not being satisfied. Since the narrowband is typically no more than10*dx wide, narrowband methods are discrete methods with a fixed, non-­resolvable error, where the error is related to the thickness of the band: the narrower the band the larger the errors. Such a solution represents a discrete approximation to the true solution and does not limit to the solution of the underlying PDEs under grid resolution.The full level-­set function code, DSD3D, is fully described in LA-14336 (2007) [1]. This ASCI-­supported, DSD code project was the last such LANL DSD code project that I was involved with before my retirement in 2007. My part in the project was to design and build the core DSD3D solver, which was to include a robust DSD boundary condition treatment. A robust boundary condition treatment was required, since for an important local “customer,” the only description of the explosives’ boundary was through volume fraction data. Given this requirement, the accuracy issues I had encountered with our “fast-­tube,” narrowband, DSD2D solver, and the difficulty we had building an efficient MPI-parallel version of the narrowband DSD2D, I decided DSD3D should be built as a full level-­set function code, using a totally local DSD boundary condition algorithm for the level-­set function, phi, which did not rely on the gradient of the level-­set function being one, |grad(phi)| = 1. The narrowband DSD2D solver was built on the assumption that |grad(phi)| could be driven to one, and near the boundaries of the explosive this condition was not being satisfied. Since the narrowband is typically no more than10*dx wide, narrowband methods are discrete methods with a fixed, non-resolvable error, where the error is related to the thickness of the band: the narrower the band the larger the errors. Such a solution represents a discrete approximation to the true solution and does not limit to the solution of the underlying PDEs under grid resolution.

97 MATHEMATICS AND COMPUTING↗

Error analysis of finite element results on plates with nonuniform grids

Discrete Dirac delta functions in two dimensions and the governing plate differential equations are used to produce continuous approximations from discrete finite-element data on nonuniform grids. The resulting continuous approximation when compared to the discrete data provides an error analysis. Moreover, the continuous approximation can be differentiated to compute continuous stresses needed for component failure prediction. Stresses can then be calculated accurately at boundaries and at interfaces where finite-element analysis alone may not provide reliable results. The continuous solution along with the differential equations also provides a residual error which is used in the error analysis. This is a unique feature of this approach. Two application examples of the procedure are provided. One example involves the linear response of a clamped square plate under uniform transverse load. Results from finite-element analysis and the continuous solution from the present analysis are compared to a closed-form elasticity solution. The continuous solution is used in a Zienkiewicz-Zhu error estimator to assess the performance of the present analysis. The continuous solution is observed to dramatically correct the finite-element results. In a second example, results for the nonlinear response of a stiffened panel are compared to the finite-element solution.

Sistla, Rajaram↗

Error analysis for a reduced-order discrete adaptive observer

The Kreisselmeier discrete adaptive observer is analyzed for the case in which the observer order is less than that of the plant. The state and parameter estimates from the observer are compared to the states and parameters for an arbitrary reduced-order model (ROM) of the plant, where the observer and ROM are of equal dimension. Conditions sufficient for ultimate boundedness of the observation errors are given, and expressions for the error bounds are derived.

Lilly, J. H.↗

OPTIMIZED MULTI-FREQUENCY SPECTRA FOR APPLICATIONS IN RADIATIVE FEEDBACK AND COSMOLOGICAL REIONIZATION

The recent implementation of radiative transfer algorithms in numerous hydrodynamics codes has led to a dramatic improvement in studies of feedback in various astrophysical environments. However, because of methodological limitations and computational expense, the spectra of radiation sources are generally sampled at only a few evenly spaced discrete emission frequencies. Using one-dimensional radiative transfer calculations, we investigate the discrepancies in gas properties surrounding model stars and accreting black holes that arise solely due to spectral discretization. We find that even in the idealized case of a static and uniform density field, commonly used discretization schemes induce errors in the neutral fraction and temperature by factors of two to three on average, and by over an order of magnitude in certain column density regimes. The consequences are most severe for radiative feedback operating on large scales, dense clumps of gas, and media consisting of multiple chemical species. We have developed a method for optimally constructing discrete spectra, and show that for two test cases of interest, carefully chosen four-bin spectra can eliminate errors associated with frequency resolution to high precision. Applying these findings to a fully three-dimensional radiation-hydrodynamic simulation of the early universe, we find that the H II region around a primordial star is substantially altered in both size and morphology, corroborating the one-dimensional prediction that discrete spectral energy distributions can lead to sizable inaccuracies in the physical properties of a medium, and as a result, the subsequent evolution and observable signatures of objects embedded within it.

79 ASTRONOMY AND ASTROPHYSICS↗

Implicit Monte Carlo with a linear discontinuous finite element material solution and piecewise non-constant opacity

Here, the non-linear thermal radiative-transfer equations can be solved in various ways. One popular way is the Fleck and Cummings Implicit Monte Carlo (IMC) method. The IMC method was originally formulated with piecewise-constant material properties. For domains with a coarse spatial grid and large temperature gradients, an error known as numerical teleportation may cause artificially non-causal energy propagation and consequently an inaccurate material temperature. Source tilting is a technique to reduce teleportation error by constructing sub-spatial-cell (or sub-cell) emission profiles from which IMC particles are sampled. Several source tilting schemes exist, but some allow teleportation error to persist. We examine the effect of source tilting in problems with a temperature-dependent opacity. Within each cell, the opacity is evaluated continuously from a temperature profile implied by the source tilt. For IMC, this is a new approach to modeling the opacity. We find that applying both source tilting along with a source tilt-dependent opacity can introduce another dominant error that overly inhibits thermal wavefronts. We show that we can mitigate both teleportation and under-propagation errors if we discretize the temperature equation with a linear discontinuous (LD) trial space. Our method is for opacities ~ 1/T 3 , but we formulate and test a slight extension for opacities ~ 1/T 3.5 , where T is temperature. We find our method avoids errors that can be incurred by IMC with continuous source tilt constructions and piecewise-constant material temperature updates.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Initial investigations of an adaptive discrete-time controller for nonlinear time-varying robotic models

The objective of this paper is to design a discrete-time controller which forces y(t) = F(q(t),q'(t)) to follow a desired trajectory, when non-linearities may be uncertain. A self-tuning adaptive control algorithm is then developed that addresses three types of errors: (1) error due to model linearization; (2) errors due to controlling a time-varying plant; and (3) errors due to discretization.

Giang, S. S.↗

Exploring the feasibility of lossy compression for PDE simulations

Checkpoint restart plays an important role in high-performance computing (HPC) applications, allowing simulation runtime to extend beyond a single job allocation and facilitating recovery from hardware failure. Yet, as machines grow in size and in complexity, traditional approaches to checkpoint restart are becoming prohibitive. Current methods store a subset of the application’s state and exploit the memory hierarchy in the machine. However, as the energy cost of data movement continues to dominate, further reductions in checkpoint size are needed. Lossy compression, which can significantly reduce checkpoint sizes, offers a potential to reduce computational cost in checkpoint restart. This article investigates the use of numerical properties of partial differential equation (PDE) simulations, such as bounds on the truncation error, to evaluate the feasibility of using lossy compression in checkpointing PDE simulations. Restart from a checkpoint with lossy compression is considered for a fail-stop error in two time-dependent HPC application codes: PlasComCM and Nek5000. Results show that error in application variables due to a restart from a lossy compressed checkpoint can be masked by the numerical error in the discretization, leading to increased efficiency in checkpoint restart without influencing overall accuracy in the simulation.

97 MATHEMATICS AND COMPUTING↗

Numerical errors in the presence of steep topography: analysis and alternatives

It is well known in computational fluid dynamics that grid quality affects the accuracy of numerical solutions. When assessing grid quality, properties such as aspect ratio, orthogonality of coordinate surfaces, and cell volume are considered. Mesoscale atmospheric models generally use terrain-following coordinates with large aspect ratios near the surface. As high resolution numerical simulations are increasingly used to study topographically forced flows, a high degree of non-orthogonality is introduced, especially in the vicinity of steep terrain slopes. Numerical errors associated with the use of terrainfollowing coordinates can adversely effect the accuracy of the solution in steep terrain. Inaccuracies from the coordinate transformation are present in each spatially discretized term of the Navier-Stokes equations, as well as in the conservation equations for scalars. In particular, errors in the computation of horizontal pressure gradients, diffusion, and horizontal advection terms have been noted in the presence of sloping coordinate surfaces and steep topography. In this work we study the effects of these spatial discretization errors on the flow solution for three canonical cases: scalar advection over a mountain, an atmosphere at rest over a hill, and forced advection over a hill. This study is completed using the Weather Research and Forecasting (WRF) model. Simulations with terrain-following coordinates are compared to those using a flat coordinate, where terrain is represented with the immersed boundary method. The immersed boundary method is used as a tool which allows us to eliminate the terrain-following coordinate transformation, and quantify numerical errors through a direct comparison of the two solutions. Additionally, the effects of related issues such as the steepness of terrain slope and grid aspect ratio are studied in an effort to gain an understanding of numerical domains where terrain-following coordinates can successfully be used and those domains where the solution would benefit from the use of the immersed boundary method.

17 WIND ENERGY↗

Efficient implicit LES method for the simulation of turbulent cavitating flows

We present a numerical method for efficient large-eddy simulation of compressible liquid flows with cavitation based on an implicit subgrid-scale model. Phase change and subgrid-scale interface structures are modeled by a homogeneous mixture model that assumes local thermodynamic equilibrium. Unlike previous approaches, emphasis is placed on operating on a small stencil (at most four cells). The truncation error of the discretization is designed to function as a physically consistent subgrid-scale model for turbulence. We formulate a sensor functional that detects shock waves or pseudo-phase boundaries within the homogeneous mixture model for localizing numerical dissipation. In smooth regions of the flow field, a formally non-dissipative central discretization scheme is used in combination with a regularization term to model the effect of unresolved subgrid scales. The new method is validated by computing standard single- and two-phase test-cases. Comparison of results for a turbulent cavitating mixing layer obtained with the new method demonstrates its suitability for the target applications.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Error estimates of finite difference methods for the Dirac equation in the massless and nonrelativistic regime

We present four frequently used finite difference methods and establish the error bounds for the discretization of the Dirac equation in the massless and nonrelativistic regime, involving a small dimensionless parameter 0 < ε &NestedLessLess; 1 inversely proportional to the speed of light. In the massless and nonrelativistic regime, the solution exhibits rapid motion in space and is highly oscillatory in time. Specifically, the wavelength of the propagating waves in time is at O(ε), while in space, it is at O(1) with the wave speed at O(ε -1 ). We adopt one leap-frog, two semi-implicit, and one conservative Crank-Nicolson finite difference methods to numerically discretize the Dirac equation in one dimension and establish rigorously the error estimates which depend explicitly on the time step τ, mesh size h, and the small parameter ε. The error bounds indicate that, to obtain the “correct” numerical solution in the massless and nonrelativistic regime, i.e., 0 < ε &NestedLessLess; 1, all these finite difference methods share the same ε-scalability as time step τ = O(ε 3/2 ) and mesh size h = O(ε 1/2 ). A large number of numerical results are reported to verify the error estimates.

97 MATHEMATICS AND COMPUTING↗

Statistical Analysis of Rounded Data: Measurement Errors vs Rounding Errors

Since data for statistical analysis are always given in a discretized form, observations contain not only measurement errors but also rounding errors which are determined by the discretization step. In this paper we consider situations where the rounding errors are considerable: they are comparable to or even greater (in average) than the measurement errors. It is shown that it can be reasonable to increase the measurement errors in order to reduce the error of the final result.

97 MATHEMATICS AND COMPUTING↗

Dominant balance-based adaptive mesh refinement for incompressible fluid flows

This work introduces a novel adaptive mesh refinement (AMR) method that utilizes dominant balance analysis (DBA) for efficient and accurate grid adaptation in computational fluid dynamics (CFD) simulations. The proposed method leverages a Gaussian mixture model (GMM) to classify grid cells into active and passive regions based on the dominant physical interactions within the equation space. By modeling truncation error probabilistically from discretized terms, the method identifies regions of high interaction where numerical accuracy is most sensitive to resolution. Unlike traditional AMR strategies, this approach does not rely on heuristic-based sensors or user-defined thresholds, providing a fully automated and problem-independent framework for AMR. Applied to the incompressible Navier-Stokes equations for steady and unsteady flow past a cylinder, the DBA-based AMR method achieves comparable accuracy to high-resolution grids while reducing computational costs by up to 70 %. The validation highlights the method’s effectiveness in capturing complex flow features while minimizing grid cells, directing computational resources toward regions with the most critical dynamics. This modular and scalable strategy is adaptable to a wide range of applications, presenting a promising tool for efficient high-fidelity simulations in CFD and other multiphysics domains.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

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↗

Optimization of control gain by operator adjustment

An optimal gain was established by measuring errors at 5 discrete control gain settings in an experimental set-up consisting of a 2-dimensional, first-order pursuit tracking task performed by subjects (S's). No significant experience effect on optimum gain setting was found in the first experiment. During the second experiment, in which control gain was continuously adjustable, high experienced S's tended to reach the previously determined optimum gain quite accurately and quickly. Less experienced S's tended to select a marginally optimum gain either below or above the experimentally determined optimum depending on initial control gain setting, although mean settings of both groups were equal. This quick and simple method is recommended for selecting control gains for different control systems and forcing functions.

Kruse, W.↗

Nonlinear grid error effects on numerical solution of partial differential equations

Finite difference solutions of nonlinear partial differential equations require discretizations and consequently grid errors are generated. These errors strongly affect stability and convergence properties of difference models. Previously such errors were analyzed by linearizing the difference equations for solutions. Properties of mappings of decadence were used to analyze nonlinear instabilities. Such an analysis is directly affected by initial/boundary conditions. An algorithm was developed, applied to nonlinear Burgers equations, and verified computationally. A preliminary test shows that Navier-Stokes equations may be treated similarly.

Dey, S. K.↗