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 217 records · Page 12

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↗

Spatial DIC Errors due to Pattern-Induced Bias and Grey Level Discretization

Digital image correlation (DIC) is an optical metrology method widely used in experimental mechanics for full-field shape, displacement and strain measurements. The required strain resolution for engineering applications of interest mandates DIC to have a high image displacement matching accuracy, on the order of 1/100th of a pixel, which necessitates an understanding of DIC errors. In this paper, we examine two spatial bias terms that have been almost completely overlooked. They cause a persistent offset in the matching of image intensities and thus corrupt DIC results. We name them pattern-induced bias (PIB), and intensity discretization bias (IDB). We show that the PIB error occurs in the presence of an undermatched shape function and is primarily dictated by the underlying intensity pattern for a fixed displacement field and DIC settings. The IDB error is due to the quantization of the gray level intensity values in the digital camera. In this paper we demonstrate these errors and quantify their magnitudes both experimentally and with synthetic images.

47 OTHER INSTRUMENTATION↗

9A.5 An Immersed Boundary Method for Flow Over Complex Terrain

Most mesoscale numerical models use terrain-following coordinates to accommodate complex terrain. Terrain-following or sigma coordinates conform to the bottom topography and the coordinate lines gradually become smoother and flatter with distance from the ground. With very steep terrain, the coordinate lines retain a signature of the underlying surface shape even very far away from the ground. Coordinate transformations are introduced into the discretized equations and produce numerical truncation errors in addition to those associated with the chosen discretization scheme. Several methods have been proposed to reduce the truncation error arising from terrain-following coordinates. Schar et al. [2002] proposed a modified sigma coordinate in which grid distortion due to small scale terrain features decays with height more rapidly than distortion caused by large scale features. The modified coordinate flattens quickly with height and improves the accuracy of the solution. Klemp et al. [2003] investigated the errors that arise when numerical treatment of the metric terms is inconsistent with the discretization of other terms in the governing equations. Distortion seen in topographically induced gravity waves was reduced with consistent numerical treatment. Adcroft et al. [1997] used a shaved cell approach to represent topography on a Cartesian grid. This method eliminates grid distortion, but introduces complications in the numerical solution at the ground because the computational cells must be modified (shaved) where they intersect the topography. Here we introduce an alternative griding technique for flow over complex terrain using an immersed boundary method (IBM) in the Weather Research and Forecasting (WRF) model. With this method, the terrain surface intersects the grid, and variables are adjusted near the immersed boundary so that the flow is diverted by the boundary. Grid distortion and the associated truncation errors are thus avoided. Additionally, the method does not require modification of the computational stencil in the vicinity of the topography. Boundary conditions are imposed on the immersed surface for velocities and scalar quantities through interpolation. The implementation and validation of IBM in WRF in two dimensions has been described previously by Lundquist et al. [2007, 2008]. Here we focus on the behavior of the flow far above steep topography. A description of the WRF model, its native sigma coordinate, and the alternative immersed boundary method are provided in section 2. The scalar transport test case of Schar et al. [2002] is presented in section 3. Comparisons are made between simulations using standard terrain-following coordinates and those using IBM. Large truncation errors are present in the native coordinate, and it is demonstrated that the immersed boundary method can be used within WRF to alleviate these errors. Truncation errors can be attributed to either the finite differencing scheme or the metric terms. Further analysis in section 4 apportions the error attributable to each cause.

42 ENGINEERING↗

Adaptive immersed isogeometric level-set topology optimization

Here, this paper presents for the first time an adaptive immersed approach for level-set topology optimization using higher-order truncated hierarchical B-spline discretizations for design and state variable fields. Boundaries and interfaces are represented implicitly by the iso-contour of one or multiple level-set functions. An immersed finite element method, the eXtended IsoGeometric Analysis, is used to predict the physical response. The proposed optimization framework affords different adaptively refined higher-order B-spline discretizations for individual design and state variable fields. The increased continuity of higher-order B-spline discretizations together with local refinement enables direct control over the accuracy of the representation of each field while simultaneously reducing computational cost compared to uniformly refined discretizations. A flexible mesh adaptation strategy enables local refinement based on geometric measures or physics-based error indicators. These adaptive discretization and analysis approaches are integrated into gradient-based optimization schemes, evaluating the design sensitivities using the adjoint method. Numerical studies illustrate the features of the proposed framework with static, linear elastic, multi-material, two- and three-dimensional problems. The examples provide insight into the effect of refining the design variable field on the optimization result and the convergence rate of the optimization process. Using coarse higher-order B-spline discretizations for level-set fields promotes the development of smooth designs and suppresses the emergence of small features. Moreover, adaptive mesh refinement for state variable fields results in a reduction of overall computational cost. Higher-order B-spline discretizations are especially interesting when evaluating gradients of state variable fields due to their higher inter-element continuity.

36 MATERIALS SCIENCE↗

Enhanced MPM framework with multipatch isogeometric analysis for geotechnical applications

Achieving stable stress solutions at large strains using the Material Point Method (MPM) is challenging due to the accumulation of errors associated with geometry discretization, cell-crossing noise, and volumetric locking. Several simplified attempts exist in the literature to mitigate these errors, including higher-order frameworks. However, the stability of the MPM solution in such frameworks has been limited to simple geometries and the single-phase formulation (i.e., neglecting pore fluid). Although never explored, multipatch isogeometric analysis offers desirable qualities to simulate complex geometries while mitigating errors in the MPM. The degree of required high-order spatial integration has also never been investigated to infer a minimum limit for the stability of the stress solution in MPM. This paper presents a general-purpose numerical framework for simulating stable stresses in porous media, capturing both near incompressibility and multiphase interactions. First, the numerical framework is presented considering Non-Uniform Rational B-splines (NURBS) to perform isogeometric analysis (IGA) in MPM. Additionally, a volumetric strain smoothing algorithm is used to alleviate errors associated with volumetric locking. Second, the manifestation of cell-crossing errors is assessed via a series of problems with orders ranging from linear to cubic interpolation functions. Third, the use of NURBS is investigated and verified for problems with circular geometries. Finally, multipatch analysis is deployed to simulate plane strain and 3D penetration in soils, considering nearly incompressible elastoplastic (total stress) analysis and fully-coupled hydro-mechanical (effective stress) analysis. The stability of the solution is also analyzed for different constitutive models. From the results, it can be concluded that the framework using cubic interpolation functions with strain smoothing is the most convenient, presenting stable stress solutions for a broad range of multiphase geotechnical applications.

58 GEOSCIENCES↗

Detailed analysis of the effects of stencil spatial variations with arbitrary high-order finite-difference Maxwell solver

Due to discretization effects and truncation to finite domains, many electromagnetic simulations present non-physical modifications of Maxwell's equations in space that may generate spurious signals affecting the overall accuracy of the result. Such modifications for instance occur when Perfectly Matched Layers (PMLs) are used at simulation domain boundaries to simulate open media. Another example is the use of arbitrary order Maxwell solver with domain decomposition technique that may under some condition involve stencil truncations at subdomain boundaries, resulting in small spurious errors that do eventually build up. In each case, a careful evaluation of the characteristics and magnitude of the errors resulting from these approximations, and their impact at any frequency and angle, requires detailed analytical and numerical studies. To this end, we present a general analytical approach that enables the evaluation of numerical discretization errors of fully three-dimensional arbitrary order finite-difference Maxwell solver, with arbitrary modification of the local stencil in the simulation domain. The analytical model is validated against simulations of domain decomposition technique and PMLs, when these are used with very high-order Maxwell solver, as well as in the infinite order limit of pseudo-spectral solvers. Results confirm that the new analytical approach enables exact predictions in each case. It also confirms that the domain decomposition technique can be used with very high-order Maxwell solver and a reasonably low number of guard cells with negligible effects on the whole accuracy of the simulation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Universal Optimization and Tighter Fidelity Bounds for Approximate Quantum Error Correction

Approximate quantum error correction (AQEC) not only dictates the performance of discrete- and continuous-variable quantum error correction codes but also serves as a unifying framework across various physical disciplines. Identifying the optimal recovery channel to maximize the entanglement fidelity via standard semidefinite programming is computationally bottlenecked by the exponentially growing number of Kraus operators with system size, rendering large-scale optimization prohibitive. While analytical near-optimal maps exist, they typically work only when the Knill-Laflamme conditions are nearly satisfied. In this Letter, we establish an efficient framework by leveraging the duality between recovery and environment decoupling. This framework yields a tighter analytical lower bound on entanglement fidelity than the conventional limit set by the transpose channel. Furthermore, by exploiting the decayed weights of noise Kraus operators, we introduce a framework based on principal component analysis to reduce the dimension. In thermal loss channels where the weights decay exponentially, our approach achieves a 33-fold computational speedup while maintaining rigorous accuracy. Our approach enables high-precision optimization for AQEC codes that were previously intractable due to the curse of dimensionality.

Wu, Jing [Fermilab] (ORCID:0000000249460732)↗

Dependence of the compensation error on the error of a sensor and corrector in an adaptive optics phase-conjugating system

In the framework of a statistical model of an adaptive optics system (AOS) of phase conjugation, three algorithms based on an integrated mathematical approach are considered, each of them intended for minimisation of one of the following characteristics: the sensor error (in the case of an ideal corrector), the corrector error (in the case of ideal measurements) and the compensation error (with regard to discreteness and measurement noises and to incompleteness of a system of response functions of the corrector actuators). Functional and statistical relationships between the algorithms are studied and a relation is derived to ensure calculation of the mean-square compensation error as a function of the errors of the sensor and corrector with an accuracy better than 10%. Because in adjusting the AOS parameters, it is reasonable to proceed from the equality of the sensor and corrector errors, in the case the Hartmann sensor is used as a wavefront sensor, the required number of actuators in the absence of the noise component in the sensor error turns out 1.5 – 2.5 times less than the number of counts, and that difference grows with increasing measurement noise. (adaptive optics)

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Milstein Approximation for Advection-Diffusion Equations Driven by Multiplicative Noncontinuous Martingale Noises

In this paper, the strong approximation of a stochastic partial differential equation, whose differential operator is of advection-diffusion type and which is driven by a multiplicative, infinite dimensional, cadlag, square integrable martingale, is presented. A finite dimensional projection of the infinite dimensional equation, for example a Galerkin projection, with nonequidistant time stepping is used. Error estimates for the discretized equation are derived in L{sup 2} and almost sure senses. Besides space and time discretizations, noise approximations are also provided, where the Milstein double stochastic integral is approximated in such a way that the overall complexity is not increased compared to an Euler-Maruyama approximation. Finally, simulations complete the paper.

97 MATHEMATICS AND COMPUTING↗

Experimental demonstration of continuous quantum error correction

The storage and processing of quantum information are susceptible to external noise, resulting in computational errors. A powerful method to suppress these effects is quantum error correction. Typically, quantum error correction is executed in discrete rounds, using entangling gates and projective measurement on ancillary qubits to complete each round of error correction. Here we use direct parity measurements to implement a continuous quantum bit-flip correction code in a resource-efficient manner, eliminating entangling gates, ancillary qubits, and their associated errors. An FPGA controller actively corrects errors as they are detected, achieving an average bit-flip detection efficiency of up to 91%. Furthermore, the protocol increases the relaxation time of the protected logical qubit by a factor of 2.7 over the relaxation times of the bare comprising qubits. Our results showcase resource-efficient stabilizer measurements in a multi-qubit architecture and demonstrate how continuous error correction codes can address challenges in realizing a fault-tolerant system.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Dynamical error bounds for continuum discretisation via Gauss quadrature rules—A Lieb-Robinson bound approach

Instances of discrete quantum systems coupled to a continuum of oscillators are ubiquitous in physics. Often the continua are approximated by a discrete set of modes. We derive error bounds on expectation values of system observables that have been time evolved under such discretised Hamiltonians. These bounds take on the form of a function of time and the number of discrete modes, where the discrete modes are chosen according to Gauss quadrature rules. The derivation makes use of tools from the field of Lieb-Robinson bounds and the theory of orthonormal polynomials.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Full Multigrid Method for the Self-Adjoint Angular Flux Equation Based on Cellwise Block Jacobi Iteration

Previous work by Densmore et al. has demonstrated that multigrid methods for the self-adjoint angular flux (SAAF) equation with cellwise block Jacobi smoothing can be extremely effective at solving for the angular flux in one dimension. The extension of that work to two dimensions demonstrated that while the smoother works well, the use of a direct coarse-grid approximation can severely limit the rate of convergence for optically thin cells. In that paper, this convergence limit was evaded through the use of a partially Galerkin coarse-grid approximation. However, relying on a Galerkin coarse-grid approximation is not ideal as constructing the coarse-grid discretization in this approach is complicated. The motivation for this summary is to find a method that can work without the need for a Galerkin coarse-grid approximation. The Full Multigrid (FMG) method is well known as a method that can theoretically solve a problem to its discretization accuracy with optimal linear computational complexity, that is in just O(N) operations for N unknowns. Indeed, we develop an FMG method for the 2-D SAAF equation that yields discretization accuracy and does not require the use of a Galerkin coarse-grid approximation. Until recently, aside from proofs about the order of the error for FMG, little work had been done in quantifying when and how FMG can obtain discretization accuracy. However, recent work by Rodrigo et al. has introduced a Fourier analysis technique called worst-case right-hand side analysis used to calculate the FMG accuracy measure. The FMG accuracy measure is the upper bound on the constant of proportionality between the error of the FMG solution and the discretization error. In this summary, we develop and implement an FMG method for the 2-D Cartesian SAAF equations. We then perform worst-case right-hand side analysis and give numerical examples that demonstrate under what circumstances the method can solve the 2-D SAAF equations to discretization accuracy, for optically thin cells, without the need for a Galerkin coarse-grid approximation. (authors)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗