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 307 records · Page 17

SU-F-T-350: Continuous Leaf Optimization (CLO) for IMRT Leaf Sequencing

Purpose: To study a new step-and-shoot IMRT leaf sequencing model that avoids the two main pitfalls of conventional leaf sequencing: (1) target fluence being stratified into a fixed number of discrete levels and/or (2) aperture leaf positions being restricted to a discrete set of locations. These assumptions induce error into the sequence or reduce the feasible region of potential plans, respectively. Methods: We develop a one-dimensional (single leaf pair) methodology that does not make assumptions (1) or (2) that can be easily extended to a multi-row model. The proposed continuous leaf optimization (CLO) methodology takes in an existing set of apertures and associated intensities, or solution “seed,” and improves the plan without the restrictiveness of 1or (2). It then uses a first-order descent algorithm to converge onto a locally optimal solution. A seed solution can come from models that assume (1) and (2), thus allowing the CLO model to improve upon existing leaf sequencing methodologies. Results: The CLO model was applied to 208 generated target fluence maps in one dimension. In all cases for all tested sequencing strategies, the CLO model made improvements on the starting seed objective function. The CLO model also was able to keep MUs low. Conclusion: The CLO model can improve upon existing leaf sequencing methods by avoiding the restrictions of (1) and (2). By allowing for more flexible leaf positioning, error can be reduced when matching some target fluence. This study lays the foundation for future models and solution methodologies that can incorporate continuous leaf positions explicitly into the IMRT treatment planning model. Supported by Cancer Prevention & Research Institute of Texas (CPRIT) - ID RP150485.

60 APPLIED LIFE SCIENCES↗

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↗

A practical discrete-adjoint method for high-fidelity compressible turbulence simulations

Methods and computing hardware advances have enabled accurate predictions of complex compressible turbulence phenomena, such as the generation of jet noise that motivates the present effort. However, limited understanding of underlying physical mechanisms restricts the utility of such predictions since they do not, by themselves, indicate a route to design improvements. Gradient-based optimization using adjoints can circumvent the flow complexity to guide designs, though this is predicated on the availability of a sufficiently accurate solution of the forward and adjoint systems. These are challenging to obtain, since both the chaotic character of the turbulence and the typical use of discretizations near their resolution limits in order to efficiently represent its smaller scales will amplify any approximation errors made in the adjoint formulation. Formulating a practical exact adjoint that avoids such errors is especially challenging if it is to be compatible with state-of-the-art simulation methods used for the turbulent flow itself. Automatic differentiation (AD) can provide code to calculate a nominally exact adjoint, but existing general-purpose AD codes are inefficient to the point of being prohibitive for large-scale turbulence simulations. Here, we analyze the compressible flow equations as discretized using the same high-order workhorse methods used for many high-fidelity compressible turbulence simulations, and formulate a practical space–time discrete-adjoint method without changing the basic discretization. A key step is the definition of a particular discrete analog of the continuous norm that defines our cost functional; our selection leads directly to an efficient Runge–Kutta-like scheme, though it would be just first-order accurate if used outside the adjoint formulation for time integration, with finite-difference spatial operators for the adjoint system. Its computational cost only modestly exceeds that of the flow equations. We confirm that its accuracy is limited by computing precision, and we demonstrate it on the aeroacoustic control of a mixing layer with a challengingly broad range of turbulence scales. For comparison, the error from a corresponding discretization of the continuous-adjoint equations is quantified to potentially explain its limited success in past efforts to control jet noise. The differences are illuminating: the continuous-adjoint is shown to suffer from exponential error growth in (reverse) time even for the best-resolved largest turbulence scales. Implications for jet noise reduction and turbulence control in general are discussed.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Distributionally Safe Path Planning: Wasserstein Safe RRT

In this paper, we propose a Wasserstein metric-based random path planning algorithm. Wasserstein Safe RRT (W-Safe RRT) provides finite-sample probabilistic guarantees on the safety of a returned path in an uncertain obstacle environment. Vehicle and obstacle states are modeled as distributions based upon state and model observations. Additionally, we define limits on distributional sampling error so the Wasserstein distance between a vehicle state distribution and obstacle distributions can be bounded. This enables the algorithm to return safe paths with a confidence bound through combining finite sampling error bounds with calculations of the Wasserstein distance between discrete distributions. W-Safe RRT is compared against a baseline minimum encompassing ball algorithm, which ensures balls that minimally encompass discrete state and obstacle distributions do not overlap. The improved performance is verified in a 3D environment using single, multi, and rotating non-convex obstacle cases, with and without forced obstacle error in adversarial directions, showing that W-Safe RRT can handle poorly modeled complex environments.

42 ENGINEERING↗

On numerical errors to the fields surrounding a relativistically moving particle in PIC codes

The particle-in-cell (PIC) method is widely used to model the self-consistent interaction between discrete particles and electromagnetic fields. It has been successfully applied to problems across plasma physics including plasma based acceleration, inertial confinement fusion, magnetically confined fusion, space physics, astrophysics, high energy density plasmas. In many cases the physics involves how relativistic particles (those with high relativistic γ factors) are generated and interact with plasmas. However, when relativistic particles stream across the grid, both in “vacuum” and in plasma, many numerical issues may arise which can lead to unphysical results. We present a detailed analysis of how discretized Maxwell solvers used in PIC codes can lead to numerical errors to the fields that surround particles that move at relativistic speeds across the grid. Expressions for the axial electric field as integrals in k space are presented that reveal two types of errors. The first arises from errors to the numerator of the integrand and leads to unphysical fields that are antisymmetric about the particle. Furthermore, the second arises from errors to the denominator of the integrand and lead to Cherenkov like radiation in “vacuum”. These fields are not anti-symmetric, extend behind the particle, and cause the particle to accelerate or decelerate depending on the solver and parameters. The unphysical fields are studied in detail for two representative solvers - the Yee solver and the FFT based solver. Although the Cherenkov fields are absent, the space charge fields are still present in the fundamental Brillouin zone for the FFT based solvers. In addition, the Cherenkov fields are present in higher order zones for the FFT based solvers. Comparison between the analytical solutions and PIC simulation results are presented. A solution for eliminating these unphysical fields by modifying the k operator in the axial direction is also presented. Using a customized finite difference solver, this solution was successfully implemented into OSIRIS [1]. Results from the customized solver are also presented. Additionally, this solution will be useful for a beam of particles that all move in one direction with a small angular divergence.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Improved Neutronics Treatment of Burnable Poisons for the Prismatic HTR

In prismatic block High Temperature Reactors (HTR), highly absorbing material such a burnable poison (BP) cause local flux depressions and large gradients in the flux across the blocks which can be a challenge to capture accurately with traditional homogenization methods. The purpose of this paper is to quantify the error associated with spatial homogenization, spectral condensation and discretization and to highlight what is needed for improved neutronics treatments of burnable poisons for the prismatic HTR. A new triangular based mesh is designed to separate the BP regions from the fuel assembly. A set of packages including Serpent (Monte Carlo), Xuthos (1storder Sn), Pronghorn (diffusion), INSTANT (Pn) and RattleSnake (2ndorder Sn) is used for this study. The results from the deterministic calculations show that the cross sections generated directly in Serpent are not sufficient to accurately reproduce the reference Monte Carlo solution in all cases. The BP treatment produces good results, but this is mainly due to error cancellation. However, the Super Cell (SC) approach yields cross sections that are consistent with cross sections prepared on an “exact” full core calculation. In addition, very good agreement exists between the various deterministic transport and diffusion codes in both eigenvalue and power distributions. Future research will focus on improving the cross sections and quantifying the error cancellation.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

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

This project addressed the challenge of predictive computational analysis of strongly coupled, highly nonlinear multiphysics systems characterized by multiple physical phenomena that span a large range of length- and time-scales. Specifically, the project was focused on computational estimation of numerical error and sensitivity analysis of computational solutions with respect to variations in parameters and data. In addition, the project investigated the use of accurate computational estimates to guide efficient adaptive discretization. The project developed, analyzed and evaluated new variational adjoint-based techniques for integration, model, and data error estimation/control and sensitivity analysis, in evolutionary multiphysics multiscale simulations.

97 MATHEMATICS AND COMPUTING↗

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↗

DG-IMEX Stochastic Galerkin Schemes for Linear Transport Equation with Random Inputs and Diffusive Scalings

In this paper, we consider the linear transport equation under diffusive scaling and with random inputs. The method is based on the generalized polynomial chaos approach in the stochastic Galerkin framework. Several theoretical aspects will be addressed. Additionally, a uniform numerical stability with respect to the Knudsen number ϵ, and a uniform in ϵ error estimate is given. For temporal and spatial discretizations, we apply the implicit–explicit scheme under the micro–macro decomposition framework and the discontinuous Galerkin method, as proposed in Jang et al. (SIAM J Numer Anal 52:2048–2072, 2014) for deterministic problem. Lastly, we provide a rigorous proof of the stochastic asymptotic-preserving (sAP) property. Extensive numerical experiments that validate the accuracy and sAP of the method are conducted.

97 MATHEMATICS AND COMPUTING↗

Numerical analysis of a thermal contact problem with adhesion

In this paper, we study a class of dynamic thermal problems involving a frictional normal compliance adhesive contact model and a non-clamped condition for visco-elastic materials. The variational formulation of the problem leads to a general system defined by a second-order quasi-variational evolution inequality on the displacement field coupled with the two first-order evolution equations describing the evolution of the temperature and adhesion. We establish an existence and uniqueness result of the solution on displacement, temperature and adhesion. Then we provide a fully discrete numerical scheme of approximation and derive an error estimate. Finally, various numerical computations are included.

97 MATHEMATICS AND COMPUTING↗

Mesh refinement for anisotropic diffusion in magnetized plasmas

Highly accurate simulation of plasma transport is needed to drive the successful design and operation of magnetically confined fusion reactors. Unfortunately, the extreme anisotropy present in magnetized plasmas results in thin boundary layers that are expensive to resolve. Here, this work investigates how various mesh refinement strategies might reduce that expense to allow for more efficient simulation by comparing standard variable refinement approaches that use a field quantity to an adaptive approach that uses an error estimator. It is first verified that higher order discretization only realizes the proper rate of convergence once the mesh resolves the thin boundary layer, therefore motivating the focusing of refinement on the boundary layer. For three two-dimensional test cases that contain characteristic features of tokamak magnetic fields, an exponential refinement strategy based on the magnetic flux function, which is the standard refinement approach in the field, is compared to an adaptive strategy utilizing the established Zienwiekicz and Zhu error estimator. The adaptive mesh refinement strategy consistently achieves the same accuracy using orders of magnitude less degrees of freedom than either exponential or uniform refinement. This result makes the adaptive refinement strategy more efficient than the exponential refinement strategy while also being more generalizable to problems with complex magnetic geometries. Scaling laws are derived that quantify the improvement in cost of the adaptive refinement strategy over other refinement approaches in 2D and 3D.

97 MATHEMATICS AND COMPUTING↗

Data-driven reduced-order models for port-Hamiltonian systems with operator inference

Hamiltonian operator inference has been developed in Sharma et al. (2022) to learn structure-preserving reduced-order models (ROMs) for Hamiltonian systems. The method constructs a low-dimensional model using only data and knowledge of the functional form of the Hamiltonian. The resulting ROMs preserve the intrinsic structure of the system, ensuring that the mechanical and physical properties of the system are maintained. In this work, we extend this approach to port-Hamiltonian systems, which generalize Hamiltonian systems by including energy dissipation, external input, and output. Based on snapshots of the system’s state and output, together with the information about the functional form of the Hamiltonian, reduced operators are inferred through optimization and are then used to construct data-driven ROMs. To further alleviate the complexity of evaluating nonlinear terms in the ROMs, a hyper-reduction method via discrete empirical interpolation is applied. Accordingly, we derive error estimates for the ROM approximations of the state and output. Lastly, we demonstrate the structure preservation, as well as the accuracy of the proposed port-Hamiltonian operator inference framework, through numerical experiments on a linear mass–spring-damper problem and a nonlinear Toda lattice problem.

97 MATHEMATICS AND COMPUTING↗

Hadronic light-by-light contribution to the muon anomaly from lattice QCD with infinite volume QED at physical pion mass

The hadronic light-by-light scattering contribution to the muon anomalous magnetic moment, (g–2)⁢/2, is computed in the infinite volume QED framework with lattice QCD. We report $a^{HLbL}_μ$ = 12.47⁢(1.15)⁢(0.95) ×10 –10 where the first error is statistical and the second systematic. The result is mainly based on the 2+1 flavor Möbius domain wall fermion ensemble with inverse lattice spacing a –1 = 1.73 GeV, lattice size L = 5.5 fm, and m π = 139 MeV, generated by the RBC-UKQCD collaborations. The leading systematic error of this result comes from the lattice discretization. This result is consistent with previous determinations.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

(U) Transport Corrections in SENSMG

Truncating the spherical harmonics expansion of the neutron scattering source in the Boltzmann transport equation leads to truncation error. Methods for approximately correcting for this truncation error are called transport corrections . The PARTISN multigroup discrete ordinates neutron transport code has several transport correction options. These options can be used in the SENSMG multigroup neutron sensitivity code, which relies on PARTISN for the neutron transport. However, with one exception, the sensitivities computed by SENSMG do not include the effect of transport corrections. Thus, when certain transport corrections are used, SENSMG results are inconsistent with the transport solutions. This report discusses the issues surrounding computing sensitivities when transport corrections are used. Problems and possible solutions are identified.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

(U) Transport Corrections Implemented in SENSMG

Truncating the spherical harmonics expansion of the neutron scattering source in the Boltzmann transport equation leads to truncation error. Methods for approximately correcting for this truncation error are called transport corrections. The PARTISN multigroup discrete ordinates neutron transport code has three transport correction options. These options can be specified in the SENSMG multigroup neutron sensitivity code and passed to PARTISN for the neutron transport.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

A linearity preserving nodal variation limiting algorithm for continuous Galerkin discretization of ideal MHD equations

A stabilized continuous Galerkin (CG) method for magnetohydrodynamics (MHD) is presented herein. Ideal, compressible inviscid MHD equations are discretized in space on unstructured meshes using piecewise linear or bilinear finite element bases to get a semi-discrete scheme. Stabilization is then introduced to the semi-discrete method in a strategy that follows the algebraic flux correction paradigm. This involves adding some artificial diffusion to the high order, semi-discrete method and mass lumping in the time derivative term. The result is a low order method that provides local extremum diminishing properties for hyperbolic systems. The difference between the low order method and the high order method is scaled element-wise using a limiter and added to the low order scheme. The limiter is solution dependent and computed via an iterative linearity preserving nodal variation limiting strategy. The stabilization also involves an optional consistent background high order dissipation that reduces phase errors. The resulting stabilized scheme is a semi-discrete method that can be applied to inviscid shock MHD problems and may be even extended to resistive and viscous MHD problems. To satisfy the divergence free constraint of the MHD equations, we add parabolic divergence cleaning to the system. Various time integration methods can be used to discretize the scheme in time. We demonstrate the robustness of the scheme by solving several shock MHD problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Discrete Superconvergence Analysis for Quantum Magnus Algorithms of Unbounded Hamiltonian Simulation

Motivated by various applications, unbounded Hamiltonian simulation has recently garnered great attention. Quantum Magnus algorithms, designed to achieve commutator scaling for time-dependent Hamiltonian simulation, have been found to be particularly efficient for such applications. When applied to unbounded Hamiltonian simulation in the interaction picture, they exhibit an unexpected superconvergence phenomenon. However, existing proofs are limited to the spatially continuous setting and do not extend to discrete spatial discretizations. Here, in this work, we provide the first superconvergence estimate in the fully discrete setting with a finite number of spatial discretization points N, and show that it holds with an error constant uniform in N. The proof is based on the two-parameter symbol class, which, to our knowledge, is applied for the first time in algorithm analysis. The key idea is to establish a semiclassical framework by identifying two parameters through the discretization number and the time step size rescaled by the operator norm, such that the semiclassical uniformity guarantees the uniformity of both. This approach may have broader applications in numerical analysis beyond the specific context of this work.

Borns-Weil, Yonah [University of California, Berke↗

Gluon field digitization via group space decimation for quantum computers

Efficient digitization is required for quantum simulations of gauge theories. Schemes based on discrete subgroups use fewer qubits at the cost of systematic errors. We systematize this approach by deriving a single plaquette action for approximating general continuous gauge groups through integrating out field fluctuations. This provides insight into the effectiveness of these approximations, and how they could be improved. We accompany the scheme by simulations of pure gauge over the largest discrete subgroup of SU(3) up to the third order.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗