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 451 records · Page 25

Experiments on structural control of sound transmitted through an elastic plate

Active control of sound transmission through an elastic plate has been experimentally studied. The control was applied directly to the plate by point force vibration inputs, and the error information and performance was measured in the radiated acoustic field by discrete microphones. Test cases were studied in which the error sensors were accelerometers mounted on the plate. A time-domain least-mean-squares adaptive algorithm was used as the basis of the control system design. The results showed an impressive increase in plate transmission loss over a wide range of frequencies with a maximum of two control shakers. The advantages of using error information derived from the radiated acoustic field rather than structural response is demonstrated. The mechanisms behind the efficiency of this control approach are discussed.

Fuller, C. R.↗

Verification & Validation of High-Order Short-Characteristics-Based Deterministic Transport Methodology on Unstructured Grids

The research team has developed a practical, high-order, discrete-ordinates, short characteristics neutron transport code for three-dimensional configurations represented on unstructured tetrahedral grids that can be used for realistic reactor physics applications at both the assembly and core levels. This project will perform a comprehensive verification and validation of this new computational tool against both a continuous-energy Monte Carlo simulation (e.g. MCNP) and experimentally measured data, an essential prerequisite for its deployment in reactor core modeling. Verification is divided into three phases. The team will first conduct spatial mesh and expansion order refinement studies to monitor convergence of the numerical solution to reference solutions. This is quantified by convergence rates that are based on integral error norms computed from the cell-by-cell difference between the code’s numerical solution and its reference counterpart. The latter is either analytic or very fine- mesh numerical solutions from independent computational tools. For the second phase, the team will create a suite of code-independent benchmark configurations to enable testing the theoretical order of accuracy of any particular discretization of the discrete ordinates approximation of the transport equation. For each tested case (i.e. mesh and spatial approximation order), researchers will execute the code and compare the resulting numerical solution to the exact solution on a per cell basis to determine the distribution of the numerical error. The final activity comprises a comparison to continuous-energy Monte Carlo solutions for zero-power critical configuration measurements at Idaho National Laboratory’s Advanced Test Reactor (ATR). Results of this comparison will allow the investigators to distinguish between modeling errors and the above-listed discretization errors introduced by the deterministic method, and to separate the sources of uncertainty.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Reduction of truncation errors in modal analysis

A condensation method and computer program are described for large discrete parameter vibration analysis of complex structures that greatly reduces truncation errors and provides accurate definition of modes in a selected frequency range. A dynamic transformation is obtained from the partitioned equations of motion that relates modes not explicitly in the condensed solution to the retained modes at a selected system frequency. The generalized mass and stiffness matrices, obtained with existing modal synthesis methods, are reduced using this transformation and solved. Revised solutions are then obtained using new transformations at the calculated eigenvalues and are also used to assess the accuracy of the results. Computations are made tractable by simplified forms of the transformation that result with various modal synthesis methods. Three examples using the dynamic transformation in conjunction with a General Electric stiffness coupling method and the method of Craig and Bampton indicate large reductions in truncation errors and demonstrate the method for sequential groups of modes.

Kuhar, E. J.↗

Error analysis of numerical methods for thick diffusive neutron transport problems on Shishkin mesh

A thin layer will develop at the boundary if the incoming angular flux is anisotropic in thick diffusive neutron transport problems. Solving such singularly perturbed problems, which have non-smooth solutions with singularity near the boundary, is computationally challenging. Standard finite difference schemes on a uniform mesh cannot yield ε-uniform convergence, where ε is a small parameter, while it can be achieved on a suitable piecewise-uniform Shishkin mesh. We present a formal error analysis of the diamond difference (DD) method and step difference (SD) method for solving the S{sub N} neutron transport equation. The analysis can be extended to other finite difference methods. Numerical results are presented to confirm the error estimates and the advantages of the Shishkin mesh. (author)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

The theoretical accuracy of Runge-Kutta time discretizations for the initial boundary value problem: A careful study of the boundary error

The conventional method of imposing time dependent boundary conditions for Runge-Kutta (RK) time advancement reduces the formal accuracy of the space-time method to first order locally, and second order globally, independently of the spatial operator. This counter intuitive result is analyzed in this paper. Two methods of eliminating this problem are proposed for the linear constant coefficient case: (1) impose the exact boundary condition only at the end of the complete RK cycle, (2) impose consistent intermediate boundary conditions derived from the physical boundary condition and its derivatives. The first method, while retaining the RK accuracy in all cases, results in a scheme with much reduced CFL condition, rendering the RK scheme less attractive. The second method retains the same allowable time step as the periodic problem. However it is a general remedy only for the linear case. For non-linear hyperbolic equations the second method is effective only for for RK schemes of third order accuracy or less. Numerical studies are presented to verify the efficacy of each approach.

Carpenter, Mark H.↗

On model reduction

Three model reduction methods are described. These are the discrete balanced realizations of Mullis and Roberts (1976) where a characterization of the reduction error is given and a previously unknown L(infinity) norm bound on the reduction error, is obtained. Another method is a new model reduction technique for discrete time systems which has the advantage that the reduced order model is balanced and has an L(infinity) norm bound on the reduction error. The last method derived is a frequency weighting technique for continuous and discrete systems where it is possible to specify the approximation accuracy with frequency and also, for this method, an L(infinity) norm on the weighted reduction error is obtained.

Al-Saggaf, Ubaid M.↗

A Fast Algebraic Multigrid Solver and Accurate Discretization for Highly Anisotropic Heat Flux I: Open Field Lines

We present a novel solver technique for the anisotropic heat flux equation, aimed at the high level of anisotropy seen in magnetic confinement fusion plasmas. Such problems pose two major challenges: (i) discretization accuracy and (ii) efficient implicit linear solvers. We simultaneously address each of these challenges by constructing a new finite element discretization with excellent accuracy properties, tailored to a novel solver approach based on algebraic multigrid (AMG) methods designed for advective operators. We pose the problem in a mixed formulation, introducing the directional temperature gradient as an auxiliary variable. The temperature and auxiliary fields are discretized in a scalar discontinuous Galerkin space with upwinding principles used for discretizations of advection. We demonstrate the proposed discretization’s superior accuracy over other discretizations of anisotropic heat flux, achieving error 1000x smaller for anisotropy ratio of 10 9 , for closed field lines. The block matrix system is reordered and solved in an approach where the two advection operators are inverted using AMG solvers based on approximate ideal restriction, which is particularly efficient for upwind discontinuous Galerkin discretizations of advection. To ensure that the advection operators are nonsingular, in this paper we restrict ourselves to considering open (acyclic) magnetic field lines for the linear solvers. We demonstrate fast convergence of the proposed iterative solver in highly anisotropic regimes where other diffusion-based AMG methods fail.

97 MATHEMATICS AND COMPUTING↗

Validity of the two-level model for Viterbi decoder gap-cycle performance

A two-level model has previously been proposed for approximating the performance of a Viterbi decoder which encounters data received with periodically varying signal-to-noise ratio. Such cyclically gapped data is obtained from the Very Large Array (VLA), either operating as a stand-alone system or arrayed with Goldstone. This approximate model predicts that the decoder error rate will vary periodically between two discrete levels with the same period as the gap cycle. It further predicts that the length of the gapped portion of the decoder error cycle for a constraint length K decoder will be about K-1 bits shorter than the actual duration of the gap. The two-level model for Viterbi decoder performance with gapped data is subjected to detailed validation tests. Curves showing the cyclical behavior of the decoder error burst statistics are compared with the simple square-wave cycles predicted by the model. The validity of the model depends on a parameter often considered irrelevant in the analysis of Viterbi decoder performance, the overall scaling of the received signal or the decoder's branch-metrics. Three scaling alternatives are examined: optimum branch-metric scaling and constant branch-metric scaling combined with either constant noise-level scaling or constant signal-level scaling. The simulated decoder error cycle curves roughly verify the accuracy of the two-level model for both the case of optimum branch-metric scaling and the case of constant branch-metric scaling combined with constant noise-level scaling. However, the model is not accurate for the case of constant branch-metric scaling combined with constant signal-level scaling.

Dolinar, S.↗

Efficient Multigrid Reduction-in-Time for Method-of-Lines Discretizations of Linear Advection

Parallel-in-time methods for partial differential equations (PDEs) have been the subject of intense development over recent decades, particularly for diffusion-dominated problems. It has been widely reported in the literature, however, that many of these methods perform quite poorly for advection-dominated problems. In this report we analyze the particular iterative parallel-in-time algorithm of multigrid reduction-in-time (MGRIT) for discretizations of constant-wave-speed linear advection problems. We focus on common method-of-lines discretizations that employ upwind finite differences in space and Runge-Kutta methods in time. Using a convergence framework we developed in previous work, we prove for a subclass of these discretizations that, if using the standard approach of rediscretizing the fine-grid problem on the coarse grid, robust MGRIT convergence with respect to CFL number and coarsening factor is not possible. This poor convergence and non-robustness is caused, at least in part, by an inadequate coarse-grid correction for smooth Fourier modes in space-time known as characteristic components. We propose an alternative coarse-grid operator that provides a better correction of these modes. This coarse-grid operator is related to previous work and uses a semi-Lagrangian discretization combined with an implicitly treated truncation error correction. Theory and numerical experiments show the proposed coarse-grid operator yields fast MGRIT convergence for many of the method-of-lines discretizations considered, including for both implicit and explicit discretizations of high order. Parallel results demonstrate speed-up over sequential time-stepping.

97 MATHEMATICS AND COMPUTING↗

Concatenated dual displacement code for continuous-variable quantum error correction

The continuous-variable (CV) Gaussian no-go theorem fundamentally limits the suppression of Gaussian displacement errors using only Gaussian gates and states. Prior studies have employed Gottesman-Kitaev-Preskill (GKP) states as ancillary qumodes to suppress small Gaussian displacement errors. However, when the displacement magnitude becomes large, inevitable lattice-crossing errors arise beyond the correctable range of the GKP state. To address this issue, we concatenate the Gaussian-noise-suppression circuit with an outer analog Steane code that corrects such occasional lattice-crossing events as well as other abrupt displacement errors. Contrary to conventional concatenation, which primarily aims to reduce logical error rates, the Steane-GKP duality in encoding provides complementary protection against displacement errors at different scales: The inner GKP layer employs non-Gaussian resources to suppress continuous Gaussian noise and reduce residual variance, while the outer analog Steane code corrects discrete lattice-crossing events that exceed the GKP correctable range. It is precisely this separation of error-mitigation roles that enables CV error correction. In contrast to prior work on concatenating GKP and repetition codes to establish error correction for discrete qubit/qudit encoding, we provide correction in the continuous encoding space. Analytical studies show that, under infinite squeezing, the concatenated code suppresses the variance of Gaussian displacement errors acting on all qumodes by up to 50%, while enabling unbiased correction of lattice-crossing errors with a success probability determined by the ratio between the residual Gaussian error standard deviation and the lattice-crossing magnitude. Even with finite squeezing, the proposed architecture still provides Gaussian-error suppression and lattice-crossing correction. Moreover, the presence of the outer analog Steane code relaxes the squeezing requirement of the inner GKP states, indicating near-term experimental feasibility. This work establishes a viable route toward fault-tolerant continuous-variable quantum computation and provides insight into the design of concatenated CV error-correcting architectures.

quantum error correction↗

Update on a short-distance $D^0$-meson mixing calculation with $N_f=2+1$ flavors

We present an update on our calculation of the short-distance $D^0$-meson mixing hadronic matrix elements. The analysis is performed on the MILC collaboration's $N_f=2+1$ asqtad configurations. We use asqtad light valence quarks and the Sheikoleslami-Wohlert action with the Fermilab interpretation for the valence charm quark. SU(3), partially quenched, rooted, staggered heavy-meson chiral perturbation theory is used to extrapolate to the chiral-continuum limit. Systematic errors arising from the chiral-continuum extrapolation, heavy-quark discretization, and quark-mass uncertainties are folded into the statistical errors from the chiral-continuum fits with methods of Bayesian inference. A preliminary error budget for all five operators is presented.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Misclassification in Workers’ Telecommuting Frequency Choices Using a Generalized Extreme Value Model

Telecommuting frequency is a response variable collected in travel surveys and is, therefore, prone to errors leading to mismeasurements or misclassification. Misclassification of explanatory variables is a common risk when using statistical modeling techniques. We define “misclassification” as a response reported or recorded in the wrong category; for example, a variable is recorded as a 1 when it should be 0. Here, in this context, this study aims to develop a statistical model to analyze telecommuting data which accounts for potential misclassification errors by building on existing literature in econometrics. The empirical analysis was undertaken using the 2017 National Household Travel Survey (NHTS) and the general extreme value (GEV) models available in the literature. Specifically, the frequency of telecommuting days was analyzed using the negative binomial (NB) model recast as the multinomial logit (MNL) model. By nature—and consistent with other studies—NHTS data are prone to errors that can be classified as intentional or unintentional misinformation provided by the person being interviewed. Ignoring these errors while modeling telecommuting frequencies using standard discrete count models can result in biased parameter estimates. The misclassification parameter was calculated for both over-reporting and under-reporting scenarios. The misclassification errors can be as high as 14% over-reported and 10% under-reported, particularly for the neighboring values. Statistical fit comparison between the models shows that models that ignore misclassification have worse data fit and biased parameter estimates with significant policy implications.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Spatial resolution of different discretizations over long-time for the Dirac equation with small potentials

In this report we compare the long-time error bounds and spatial resolution of finite difference methods with different spatial discretizations for the Dirac equation with small electromagnetic potentials characterized by $\varepsilon \in (0, 1]$ a dimensionless parameter. We begin with the simple and widely used finite difference time domain (FDTD) methods, and establish rigorous error bounds of them, which are valid up to the time at $O(1/\varepsilon)$. In the error estimates, we pay particular attention to how the errors depend explicitly on the mesh size $h$ and time step $\tau$ as well as the small parameter $\varepsilon$. Based on the results, in order to obtain "correct" numerical solutions up to the time at $O(1/\varepsilon)$, the $\varepsilon$-scalability (or meshing strategy requirement) of the FDTD methods should be taken as $h = O(\varepsilon^{1/2})$ and $\tau = O(\varepsilon^{1/2})$. To improve the spatial resolution capacity, we apply the Fourier spectral method to discretize the Dirac equation in space. Error bounds of the resulting finite difference Fourier pseudospectral (FDFP) methods show that they exhibit uniform spatial errors in the long-time regime, which are optimal in space as suggested by the Shannon's sampling theorem. Extensive numerical results are reported to confirm the error bounds and demonstrate that they are sharp.

79 ASTRONOMY AND ASTROPHYSICS↗

Stochastic Richardson Extrapolation Based Numerical Error Estimation for Kinetic Plasma Simulations

We present a numerical error estimation technique specifically formulated to deal with stochastic code output with multiple discretization parameters. This method is based on multiple fits to an error model with arbitrary convergence rates and cross-coupling terms, performed using nonlinear optimization. The fitting approach varies by the type of residual norm which influences the importance of outliers, and weights which influences the relative importance of data points in the coarse and refined regions of discretization parameter space. To account for the influence of stochastic noise, these fits are performed on multiple bootstrap values based on the underlying response data set. Using an automated discretization domain selection scheme, the fits are performed on a series of reduced sets of discretization levels in order to find an optimal fully-converged result estimate in the minimum variance sense; this automated approach enables straightforward analysis of multiple quantities of interest and/or time and spatially-dependent response data. The overall numerical error analysis method is useful for verification and validation problems for stochastic simulation methods and forms a key component in the overall uncertainty quantification process. The method was demonstrated for steady and unsteady electron diode problems simulated using a particle-in-cell kinetic plasma code, demonstrating excellent results.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Finite element solution for energy conservation using a highly stable explicit integration algorithm

Theoretical derivation of a finite element solution algorithm for the transient energy conservation equation in multidimensional, stationary multi-media continua with irregular solution domain closure is considered. The complete finite element matrix forms for arbitrarily irregular discretizations are established, using natural coordinate function representations. The algorithm is embodied into a user-oriented computer program (COMOC) which obtains transient temperature distributions at the node points of the finite element discretization using a highly stable explicit integration procedure with automatic error control features. The finite element algorithm is shown to posses convergence with discretization for a transient sample problem. The condensed form for the specific heat element matrix is shown to be preferable to the consistent form. Computed results for diverse problems illustrate the versatility of COMOC, and easily prepared output subroutines are shown to allow quick engineering assessment of solution behavior.

Baker, A. J.↗

Compact finite difference schemes for the time fractional diffusion equation with nonlocal boundary conditions

Fourth-order compact finite difference schemes for solving the time fractional diffusion equation with nonlocal boundary conditions are considered in this paper. The second-order derivative in one space variable is approximated by a fourth-order compact finite difference. Two different time derivatives, the Caputo derivative and Riemann–Liouville derivative are considered in the equations that we discuss. The Caputo time derivative is discretized by the L1-approximation and a second-order approximation is used for the Riemann–Liouville derivative. Stability analysis using the discrete energy method for Scheme I is given, and error estimation of this scheme is derived by conducting the local truncation error analysis, using the stability result. Numerical results are provided to show that both two fully discrete schemes have fourth-order accuracy in space, and 2−γ order of accuracy in time for Scheme I with γ being the order of the fractional derivative, while Scheme II has second-order accuracy in time when the theoretical solutions are smooth with zero initial values.

97 MATHEMATICS AND COMPUTING↗

A Discrete Constraint for Entropy Conservation and Sound Waves in Cloud-Resolving Modeling

Ideal cloud-resolving models contain little-accumulative errors. When their domain is so large that synoptic large-scale circulations are accommodated, they can be used for the simulation of the interaction between convective clouds and the large-scale circulations. This paper sets up a framework for the models, using moist entropy as a prognostic variable and employing conservative numerical schemes. The models possess no accumulative errors of thermodynamic variables when they comply with a discrete constraint on entropy conservation and sound waves. Alternatively speaking, the discrete constraint is related to the correct representation of the large-scale convergence and advection of moist entropy. Since air density is involved in entropy conservation and sound waves, the challenge is how to compute sound waves efficiently under the constraint. To address the challenge, a compensation method is introduced on the basis of a reference isothermal atmosphere whose governing equations are solved analytically. Stability analysis and numerical experiments show that the method allows the models to integrate efficiently with a large time step.

Zeng, Xi-Ping↗