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 379 records · Page 21

Design of algorithms for a dispersive hyperbolic problem

In order to develop numerical schemes for stiff problems, a model of relaxing heat flow is studied. To isolate those errors unavoidably associated with discretization, a method of characteristics is developed, containing three free parameters depending on the stiffness ratio. It is shown that such 'decoupled' schemes do not take into account the interaction between the wave families, and hence result in incorrect wavespeeds. Schemes can differ by up to two orders of magnitude in their rms errors, even while maintaining second-order accuracy. 'Coupled' schemes which account for the interactions are developed to obtain two additional free parameters. Numerical results are given for several decoupled and coupled schemes.

Roe, Philip L.↗

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↗

A verification regime for the spatial discretization of the SN transport equations

The order-of-accuracy test in conjunction with the method of manufactured solutions is the current state of the art in computer code verification. In this work we investigate the application of a verification procedure including the order-of-accuracy test on a generic SN transport solver that implements the AHOTN spatial discretization. Different types of semantic errors, e.g. removal of a line of code or changing a single character, are introduced randomly into the previously verified S{sub N} code and the proposed verification procedure is used to identify the coding mistakes (if possible) and classify them. Itemized by error type we record the stage of the verification procedure where the error is detected and report the frequency with which the errors are correctly identified at various stages of the verification. Errors that remain undetected by the verification procedure are further scrutinized to determine the reason why the introduced coding mistake eluded the verification procedure. The result of this work is that the verification procedure based on an order-of-accuracy test finds almost all detectable coding mistakes but rarely, 1.44% of the time, and under certain circumstances can fail. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Optimally configuring a measurement system to detect diversions from a nuclear fuel cycle

The civilian nuclear fuel cycle is an industrial process that produces electrical power from the nuclear fission of uranium. Using a measurement system to accurately account for nuclear material, such as uranium, in a fuel cycle is important because of the possible loss or diversion of this potentially dangerous material. A measurement system is defined by a set of measurement methods, or “devices,” used to account for material flows and inventory values at specific locations in the fuel cycle. Here, we develop a simulation-optimization algorithm and an integer-programming model to find the best, or near-best, resource-limited measurement system with a high degree of confidence. The simulation-optimization algorithm minimizes a weighted sum of false positive and false negative diversion-detection probabilities while accounting for material quantities and measurement errors across a finite, discrete time horizon in hypothetical non-diversion and diversion contexts. In each time period, the estimated cumulative material unaccounted for is compared to a fixed or an optimized threshold value to assess if a “significant amount of material” is lost from a measurement system. The integer-programming model minimizes the population variance of the estimated material loss, i.e., material unaccounted for, in a measurement system. We analyze three potential problems in nuclear fuel cycle measurement systems: (i) given location-dependent device precisions, find the configuration of n devices at n locations ( n = 3) that gives the lowest corresponding objective values using the simulation-optimization algorithm and integer-programming model, (ii) find the location at which improving device precision reduces objective values the most using the simulation-optimization algorithm, and determine the effect of measurement frequency on measurement system configurations and objective values using the simulation-optimization algorithm. We obtain comparable results for each problem at least an order of magnitude faster than existing methods do. Using an optimized, rather than fixed, detection threshold in the simulation-optimization algorithm reduces the weighted sum of false positive and false negative probabilities.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Histogram-free multicanonical Monte Carlo sampling to calculate the density of states

Here, we report a new multicanonical Monte Carlo algorithm to obtain the density of states for physical systems with continuous state variables in statistical mechanics. Our algorithm is able to obtain a closed-form expression for the density of states expressed in a chosen basis set, instead of a numerical array of finite resolution as in previous variants of this class of MC methods such as the multicanonical sampling and Wang–Landau sampling. This is enabled by storing the visited states directly and avoiding the explicit collection of a histogram. This practice also has the advantage of avoiding undesirable artificial errors caused by the discretization and binning of continuous state variables. Our results show that this scheme is capable of obtaining converged results with a much reduced number of Monte Carlo steps, leading to a significant speedup over existing algorithms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Developing A Large Time Step, Robust, and Low Communication Multi-Moment PDE Integration Scheme for Exascale Applications

The Boundary Averaged Multi-moment Constrained finite-Volume (BA-MCV) method is de- rived, explained, and evaluated for 1-D transport to assess accuracy, maximum stable time step (MSTS), oscillations for discontinuous data, and parallel communication burden. The BA-MCV scheme is altered from the original MCV scheme to compute the updates of point wise cell boundary derivatives entirely locally. Then it is altered such that boundary moments are replaced with the interface upwind value. The scheme is stable at a maximum stable CFL (MSCFL) value of one no matter how high-order the scheme is, giving significantly larger time steps than Galerkin methods, for which the MSCFL decreases nearly quadratically with in- creasing order. The BA-MCV method is compared against a SE method at varying order, both using the ADER-DT time discretization. BA-MCV error for a sine wave was comparable to the same order of accuracy for a SE method. The resulting large time step, multi-moment, low communication scheme is of great interest for exascale architectures.

Norman, Matthew R.↗

Validation of a new control system for Elekta accelerators facilitating continuously variable dose rate

Purpose: Elekta accelerators controlled by the current clinically used accelerator control system, Desktop 7.01 (D7), uses binned variable dose rate (BVDR) for volumetric modulated arc therapy (VMAT). The next version of the treatment control system (Integrity) supports continuously variable dose rate (CVDR) as well as BVDR. Using CVDR opposed to BVDR for VMAT has the potential of reducing the treatment time but may lead to lower dosimetric accuracy due to faster moving accelerator parts. Using D7 and a test version of Integrity, differences in ability to control the accelerator, treatment efficiency, and dosimetric accuracy between the two systems were investigated. Methods: Single parameter tests were designed to expose differences in the way the two systems control the movements of the accelerator. In these tests, either the jaws, multi leaf collimators (MLCs), or gantry moved at constant speed while the dose rate was changed in discrete steps. The positional errors of the moving component and dose rate were recorded using the control systems with a sampling frequency of 4 Hz. The clinical applicability of Integrity was tested using 15 clinically used VMAT plans (5 prostate, 5 H and N, and 5 lung) generated by the SmartArc algorithm in PINNACLE. The treatment time was measured from beam-on to beam-off and the accuracy of the dose delivery was assessed by comparing DELTA4 measurements and PINNACLE calculated doses using gamma evaluation. Results: The single parameter tests showed that Integrity had an improved feedback between gantry motion and dose rate at the slight expense of MLC control compared to D7. The single parameter test did not reveal any significant differences in the control of either jaws or backup jaws between the two systems. These differences in gantry and MLC control together with the use of CVDR gives a smoother Integrity VMAT delivery compared to D7 with less abrupt changes in accelerator motion. Gamma evaluation (2% of 2 Gy and 2 mm) of the calculated doses and DELTA4 measured doses corrected for systematic errors showed an average pass rate of more than 97.8% for both D7, Integrity BVDR, and Integrity CVDR deliveries. Direct comparisons between the measured doses using strict gamma criteria of 0.5% and 0.5 mm showed excellent agreement between D7 and Integrity delivered doses with average pass rates above 95.7%. Finally, the Integrity control system resulted in a significant 35% (55 {+-} 13 s) reduction in treatment time, on average. Conclusions: Single parameter tests showed that the two control systems differed in their feedback loops between MLC, gantry, and dose rate. These differences made the VMAT deliveries more smooth using the new Integrity treatment control system, compared to the current Desktop 7.01. Together with the use of CVDR, which results in less abrupt changes in dose rate, this further increases the smoothness of the delivery. The use of CVDR for VMAT with the Integrity desktop results in a significant reduction in treatment time compared to BVDR with an average reduction of 35%. This decrease in delivery time was achieved without compromising the dosimetric accuracy.

07 ISOTOPE AND RADIATION SOURCES↗

A Histogram-Free Multicanonical Monte Carlo Algorithm for the Basis Expansion of Density of States

We report a new multicanonical Monte Carlo (MC) algorithm to obtain the density of states (DOS) for physical systems with continuous state variables in statistical mechanics. Our algorithm is able to obtain an analytical form for the DOS expressed in a chosen basis set, instead of a numerical array of finite resolution as in previous variants of this class of MC methods such as the multicanonical (MUCA) sampling and Wang-Landau (WL) sampling. This is enabled by storing the visited states directly in a data set and avoiding the explicit collection of a histogram. This practice also has the advantage of avoiding undesirable artificial errors caused by the discretization and binning of continuous state variables. Our results show that this scheme is capable of obtaining converged results with a much reduced number of Monte Carlo steps, leading to a significant speedup over existing algorithms.

97 MATHEMATICS AND COMPUTING↗

Verifying and Validating Simulation Models

This presentation is a high-level discussion of the Verification and Validation (V&V) of computational models. Definitions of V&V are given to emphasize that “validation” is never performed in a vacuum; it accounts, instead, for the current state-of-knowledge in the discipline considered. In particular comparisons between physical measurements and numerical predictions should account for their respective sources of uncertainty. The differences between error (bias), aleatoric uncertainty (randomness) and epistemic uncertainty (ignorance, lack-of- knowledge) are briefly discussed. Four types of uncertainty in physics and engineering are discussed: 1) experimental variability, 2) variability and randomness, 3) numerical uncertainty and 4) model-form uncertainty. Statistical sampling methods are available to propagate, and analyze, variability and randomness. Numerical uncertainty originates from the truncation error introduced by the discretization of partial differential equations in time and space. Model-form uncertainty is introduced by assumptions often formulated to render a complex problem more tractable and amenable to modeling and simulation. The discussion concludes with high-level guidance to assess the “credibility” of numerical simulations, which stems from the level of rigor with which these various sources of uncertainty are assessed and quantified.

Mathematics & Computing(97)↗

Determination of navigation FDI thresholds using a Markov model

A method for determining time-varying Failure Detection and Identification (FDI) thresholds for single sample decision functions is described in the context of a triplex system of inertial platforms. A cost function consisting of the probability of vehicle loss due to FDI decision errors is minimized. A discrete Markov model is constructed from which this cost can be determined as a function of the decision thresholds employed to detect and identify the first and second failures. Optimal thresholds are determined through the use of parameter optimization techniques. The application of this approach to threshold determination is illustrated for the Space Shuttle's inertial measurement instruments.

Walker, B. K.↗

Initialization of mesoscale models - The possible impact of remotely sensed data

Little or no improvement appears to have been achieved in mesoscale numerical prediction. This has been blamed on inherent unpredictability, insufficient spatial resolution, inadequate parameterization of important physical processes, and errors in the numerical discretization of the governing hydrodynamic equations. Attention is presently given to the more fundamental difficulty of forecasting when present conditions are not known with sufficient accuracy, and to the matching of remotely sensed sounding-capability satellite and all-weather Doppler radar data with mesoscale numerical models. This matching is not straightforward; simple and variational forms of four-dimensional assimilation, and Kalman filtering, are suggested approaches but their practical testing remains to be accomplished. The most severe problem faced is that of the temperature and humidity profiles' vertical resolution.

Gal-Chen, T.↗