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 235 records · Page 13

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)↗

miniGMG

miniGMG is a compact geometric multigrid (MG benchmark designed to proxy the performance characteristics of the solves found in adaptive mesh refinement multigrid (AMR MG) applications. It solves the equation a*alpha*u - b div beta grad u = f on a large cubical domain using cell-centered values and periodic boundaries. a and b are scalar constants, alpha and beta are space varying constants, f is the right hand side, and u is the solution. The cubical domain is divided into cubical subdomains which are distributed across the supercomputer. The righthand side f is generated from a continuous function for u. Thus, one can solve this linear system of equations and verify the error properties of the discrete solution u by comparing to a sampling of the continuous u. miniGMG implements both v- and f- cycles, as well as two constant coeffficient discretications of the equation above (one 27pt 2nd order, and one 13pt 4th order). In both cases, the (embedded) v-cycles are truncated when a subdomain reaces 4^3, 2^3, or 1^3 cells (a u-cycle). The multigrd solver then swtiches to one of seven coarse grid (bottom) solves. relaxation, BiCGStab, CABiCGStab, TelescopingCABiCGStab, CG, or CACG. The code exploits two forms of communication-avoiding. The first is exemplified by the referenced SC'12 paper in which DRAM data movment is avoided when smoothing. The second, described in the IPDPS'14 paper avoids collectives in a bottom solve (the CA bottom solves). There are a number of implementations of the operators for both CPUs and NVIDIA GPUs. The CPUs have been optimized to exploit a wavefront approach to communication-avoiding. The GPU versions include a number of optimized and tunable implementations. The code has been demonstrated to scale to 46K nodes on the BGQ Mira (750K cores), 9K nodes on Edison (111K cores), and 14K GPUs on Titan (37M cuda cores). It thus acts as a scalable testbed for a wide range of computer science and applied math research. Nominally, one invokes the benchmark as ./run b x y z alpha beta gamma Each subdomain is (2^b)^3 cells Each MPI process receives a x-by-y-by-z collection of subdomains. There are alpha*beta*gamma total MPI processes For correctness (a cubical domain), *alpha==y*beta==z*gamma.

Williams, Sameul↗

A histogram-free multicanonical Monte Carlo algorithm for the construction of analytical 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.

Li, Ying Wai↗

Efficient reconstruction of contaminant release history

We present a generalized hybrid Monte Carlo (GHMC) method for fast, statistically optimal reconstruction of release histories of reactive contaminants. The approach is applicable to large-scale, strongly nonlinear systems with parametric uncertainties and data corrupted by measurement errors. The use of discrete adjoint equations facilitates numerical implementation of GHMC, without putting any restrictions on the degree of nonlinearity of advection-dispersion-reaction equations that are used to described contaminant transport in the subsurface. To demonstrate the salient features of the proposed algorithm, we identify the spatial extent of a distributed source of contamination from concentration measurements of a reactive solute.

97 MATHEMATICS AND COMPUTING↗

Quantum repeaters based on concatenated bosonic and discrete-variable quantum codes

Abstract We propose an architecture of quantum-error-correction-based quantum repeaters that combines techniques used in discrete- and continuous-variable quantum information. Specifically, we propose to encode the transmitted qubits in a concatenated code consisting of two levels. On the first level we use a continuous-variable GKP code encoding the qubit in a single bosonic mode. On the second level we use a small discrete-variable code. Such an architecture has two important features. Firstly, errors on each of the two levels are corrected in repeaters of two different types. This enables for achieving performance needed in practical scenarios with a reduced cost with respect to an architecture for which all repeaters are the same. Secondly, the use of continuous-variable GKP code on the lower level generates additional analog information which enhances the error-correcting capabilities of the second-level code such that long-distance communication becomes possible with encodings consisting of only four or seven optical modes.

Physics↗

Slow manifold integrators and the errors the commit [Slides]

Summary: Discrete-time fast-slow (DTFS) systems are discrete analogues of fast-slow systems; A slow manifold integrator (SMI) is a DTFS system that approximates a given fast-slow system; Stability of an SMI's slow manifold need not be due to numerical dissipation - can mimic physical mechanisms instead; SMIs are natural tool for capturing high-order slow manifold effects (e.g. drifts).

97 MATHEMATICS AND COMPUTING↗

Numerical Homogenization on Approach for Stokesian Suspensions

In this technical report we investigate efficient methods for numerical simulation of active suspensions. The prototypical system is a suspension of swimming bacteria in a Newtonian fluid. Rheological and other macroscopic properties of such suspensions can differ dramatically from the same properties of the suspending fluid alone or of suspensions of similar but inactive particles. Elongated bacteria, such as E. coli or B. subtilis, swim along their principal axis, propelling themselves with the help of flagella, attached at the anterior of the organism and pushing it forward in the manner of a propeller. They interact hydrodynamically with the surrounding fluid and, because of their asymmetrical shape, have the propensity to align with the local flow. This, along with the dipolar nature of bacteria (the two forces a bacterium exerts on a fluid - one due to self-propulsion and the other opposing drag - have equal magnitude and point in opposite directions), causes nearby bacteria to tend to align, resulting in a intermittent local ordering on the mesoscopic scale, which is between the microscopic scale of an individual bacterium and the macroscopic scale of the suspension (e.g., its container). The local ordering is sometimes called a collective mode or collective swimming. Thanks to self-propulsion, collective modes inject momentum into the fluid in a coherent way. This enhances the local strain rate without changing the macroscopic stress applied at the boundary of the container. The macroscopic effective viscosity of the suspension is defined roughly as the ratio of the applied stress to the bulk strain rate. If local alignment and therefore local strain-rate enhancement, are significant, the effective viscosity can be appreciably lower than that of the corresponding passive suspension or even of the surrounding fluid alone. Indeed, a sevenfold decrease in the effective viscosity was observed in experiments with B. subtilis. More generally, local collective swimming resulting from bacterial alignment can significantly alter other macroscopic properties of the suspension, such as the oxygen diffusivity and mixing rates. In order to understand the unique macroscopic properties of active suspensions the connection between microscopic swimming and alignment dynamics and the mesoscopic pattern formation must be clarified. This is difficult to do analytically in the fully general setting of moderately dense suspensions, because of the large number of bacteria involved (approx. 10 10 cm -3 in experiments) and the complex, time-dependent geometry of the system. Many reduced analytical models of bacterial have been proposed, but all of them require validation. While comparison with experiment is the ultimate test of a model's fidelity, it is difficult to conduct experiments matched to these models assumptions. Numerical simulation of the microscopic dynamics is an acceptable substitute, but it runs into the problem of having to discretize the fluid domain with a fine-grained boundary (the bacteria) and update the discretization as the domain evolves (bacteria move). This leads to a prohibitively high number of degrees of freedom and prohibitively high setup costs per timestep of simulation. In this technical report we propose numerical methods designed to alleviate these two difficulties. We indicate how to (1) construct an optimal discretization in terms of the number of degrees of freedom per digit of accuracy and (2) optimally update the discretization as the simulation evolves. The technical tool here is the derivation of rigorous error bounds on the error in the numerical solution when using our proposed discretization at the initial time as well as after a given elapsed simulation time. These error bounds should guide the construction of practical discretization schemes and update strategies. Our initial construction is carried out by using a theoretically convenient, but practically prohibitive spectral basis, which is a Galerkin basis of functions with global support. At the end of this report we propose localization techniques while maintaining acceptable error bounds. No numerical experiments were conducted as part of this study, but we envision that we may undertake such studies and further development of the method, jointly or individually.

60 APPLIED LIFE SCIENCES↗

A Posteriori Analysis of Adaptive Multiscale Operator Decomposition Methods for Multiphysics Problems

This project was concerned with the accurate computational error estimation for numerical solutions of multiphysics, multiscale systems that couple different physical processes acting across a large range of scales relevant to the interests of the DOE. Multiscale, multiphysics models are characterized by intimate interactions between different physics across a wide range of scales. This poses significant computational challenges addressed by the proposal, including: (1) Accurate and efficient computation; (2) Complex stability; and (3) Linking different physics. The research in this project focused on Multiscale Operator Decomposition methods for solving multiphysics problems. The general approach is to decompose a multiphysics problem into components involving simpler physics over a relatively limited range of scales, and then to seek the solution of the entire system through some sort of iterative procedure involving solutions of the individual components. MOD is a very widely used technique for solving multiphysics, multiscale problems; it is heavily used throughout the DOE computational landscape. This project made a major advance in the analysis of the solution of multiscale, multiphysics problems.

97 MATHEMATICS AND COMPUTING↗