Search NASA⌕ Search

SEARCH · Search NASA

Results for “rounding error analysis”

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 19 records

Rounding Error Analysis of Mixed Precision Block Householder QR Algorithms

Although mixed precision arithmetic has recently garnered interest for training dense neural networks, many other applications could benefit from the speedups and lower storage cost if applied appropriately. The growing interest in employing mixed precision computations motivates the need for rounding error analysis that properly handles behavior from mixed precision arithmetic. We develop mixed precision variants of existing Householder QR algorithms and show error analyses supported by numerical experiments.

97 MATHEMATICS AND COMPUTING↗

Statistical Analysis of Rounded Data: Measurement Errors vs Rounding Errors

Since data for statistical analysis are always given in a discretized form, observations contain not only measurement errors but also rounding errors which are determined by the discretization step. In this paper we consider situations where the rounding errors are considerable: they are comparable to or even greater (in average) than the measurement errors. It is shown that it can be reasonable to increase the measurement errors in order to reduce the error of the final result.

97 MATHEMATICS AND COMPUTING↗

Scalable Yet Rigorous Floating-Point Error Analysis

Automated techniques for rigorous floating-point round-off error analysis are a prerequisite to placing important activities in HPC such as precision allocation, verification and code optimization on a formal footing. Yet existing techniques cannot provide tight bounds for expressions beyond a few dozen operators; barely enough for HPC. In this work, we offer an approach embedded in a new tool called SATIRE that scales error analysis by four orders of magnitude compared to today’s best-of-class tools. We explain how three key ideas underlying SATIRE help it attain such scale: path strength reduction, bound optimization and abstraction. SATIRE provides tight bounds and rigorous guarantees on significantly larger expressions with well over a hundred thousand operators, covering important examples including FFT, matrix multiplication and PDE stencils.

Das, Arnab↗

Combining Sparse Approximate Factorizations with Mixed-precision Iterative Refinement

The standard LU factorization-based solution process for linear systems can be enhanced in speed or accuracy by employing mixed-precision iterative refinement. Most recent work has focused on dense systems. We investigate the potential of mixed-precision iterative refinement to enhance methods for sparse systems based on approximate sparse factorizations. In doing so, we first develop a new error analysis for LU- and GMRES-based iterative refinement under a general model of LU factorization that accounts for the approximation methods typically used by modern sparse solvers, such as low-rank approximations or relaxed pivoting strategies. We then provide a detailed performance analysis of both the execution time and memory consumption of different algorithms, based on a selected set of iterative refinement variants and approximate sparse factorizations. Our performance study uses the multifrontal solver MUMPS, which can exploit block low-rank factorization and static pivoting. We evaluate the performance of the algorithms on large, sparse problems coming from a variety of real-life and industrial applications showing that mixed-precision iterative refinement combined with approximate sparse factorization can lead to considerable reductions of both the time and memory consumption.

97 MATHEMATICS AND COMPUTING↗

FPDetect: Efficient Reasoning About Stencil Programs Using Selective Direct Evaluation

We present FPDetect, a low-overhead approach for detecting logical errors and soft errors affecting stencil computations without generating false positives. We develop an offline analysis that tightly estimates the number of floating-point bits preserved across stencil applications. This estimate rigorously bounds the values expected in the data space of the computation. Violations of this bound can be attributed with certainty to errors. FPDetect helps synthesize error detectors customized for user-specified levels of accuracy and coverage. FPDetect also enables overhead reduction techniques based on deploying these detectors coarsely in space and time. Experimental evaluations demonstrate the practicality of our approach.

97 MATHEMATICS AND COMPUTING↗

EFFECT OF DISCRETIZATION ERROR ON THE QUANTIFICATION OF MODEL UNCERTAINTY IN TWO-PHASE FLOW SIMULATIONS

Verification, validation and uncertainty quantification (VVUQ) have become a common practice in thermal-hydraulics analysis. In general, these activities deal with propagations of uncertainties in computer code simulations, e.g., through system analysis codes. However, most existing such activities in thermal-hydraulics analysis have been primarily focused on input and model uncertainties, while numerical errors were largely overlooked. Numerical errors can appear in many different forms, e.g., round-off error, statistical sampling error, and discretization error. In thermal-hydraulics analysis, especially two-phase flow simulations commonly encountered in reactor safety analysis, the lack of consideration of discretization error is mainly due to the difficulty in estimating them. Accurate estimations of discretization error require continuous mesh refinement and/or implementation of high-order numerical schemes in system analysis code, both of which are difficult to achieve in existing codes. In this work, we will build a computer code that incorporates both first-order and second-order numerical methods to solve the two-phase flow problems. The first-order method resembles the one used in many existing system analysis codes; and the second-order method works as the reference to estimate numerical errors. Numerical verification of spatial discretization schemes will be presented in the form of mesh convergence study. It will also be demonstrated via case studies that, in practical scenarios, discretization errors can be as large as, or even larger than, model uncertainties.

42 ENGINEERING↗

Semi-analytical sensitivity analysis for nonlinear transient problems

Efficient analytical sensitivity computations are essential elements of gradient-based optimization schemes; however, they can be difficult to implement. This implementation issue is often resolved by adopting the semi-analytical method which exhibits the efficiency of the analytical methods and the ease of implementation of the finite difference method. However, care must be taken as semi-analytical sensitivities may exhibit errors due to truncation and round-off. Additional errors are introduced if the convergence tolerance of the primal analysis is not sufficiently small. This paper gives a general overview and some new developments of the analytical and semi-analytical sensitivity analyses for nonlinear steady-state, transient, and dynamic problems. We discuss the restrictive assumptions, accuracy, and consistency of these methods. Both adjoint and direct differentiation methods are studied. Numerical examples are provided.

42 ENGINEERING↗

Numerical Uncertainties vs. Model Uncertainties in Two-phase Flow Simulations

In recent years, verification, validation and uncertainty quantification (VVUQ) have become a common practice in thermal-hydraulics analysis. In general, these activities deal with propagations of uncertainties in computer code simulations, e.g., through system analysis codes. However, most existing such activities in thermal-hydraulics analysis have been primarily focused on model uncertainties, while numerical uncertainties were largely overlooked. Numerical uncertainties (or numerical errors) can appear in many different forms, e.g., round-off error, statistical sampling error, and discretization error. As pointed out by Oberkampf and Roy, discretization error is usually the largest however the most difficult type of error to estimate reliably. In thermal-hydraulics analysis, especially two-phase flow simulations commonly encountered in reactor safety analysis, the lack of consideration on discretization error is mainly due to the difficulty in estimating them. Accurate estimations on discretization error require continuous mesh refinement and/or implementation of high-order numerical schemes in system analysis code, both of which are unfortunately difficult to achieve for existing codes. At first, it should be emphasized that mesh refinement (or mesh sensitivity study) is a well-understood concept in the thermal-hydraulics field. However, it is not commonly practiced for many reasons, e.g., lack of understanding on numerical errors by code users, consideration on computational cost, deteriorated numerical stability performance with refined meshes, and etc. Secondly, high-order (e.g., second-order) numerical schemes are simply unavailable in almost any existing system analysis code. Implementation of high-order numerical schemes in these codes is difficult, if not impossible, given the complexity of these codes. On the other hand, people tend to argue that numerical uncertainties (or discretization error as we have emphasized) are not as important as the commonly large uncertainties in two-phase flow models, e.g., closure correlations. As a result, nodalization is sometimes played unintentionally, or maybe intentionally, to match experimental data, which is referred as 'user effects' or 'compensating errors' in thermal-hydraulics community. Such a practice is highly criticized by Levy. In this work, we will at first build a computer code that incorporates both first-order and second-order numerical methods to solve the two-phase flow problems. The first-order method resembles the one used in many existing system analysis codes; and the second-order method works as the reference to estimate numerical errors. Numerical verifications on spatial discretization schemes will be presented in the form of mesh convergence study. It will also be demonstrated that, in practical scenarios, discretization errors can be as large as, or even larger than, model uncertainties via case studies.

42 ENGINEERING↗

A fast algorithm for sparse matrix computations related to inversion

We have developed a fast algorithm for computing certain entries of the inverse of a sparse matrix. Such computations are critical to many applications, such as the calculation of non-equilibrium Green’s functions G{sup r} and G{sup <} for nano-devices. The FIND (Fast Inverse using Nested Dissection) algorithm is optimal in the big-O sense. However, in practice, FIND suffers from two problems due to the width-2 separators used by its partitioning scheme. One problem is the presence of a large constant factor in the computational cost of FIND. The other problem is that the partitioning scheme used by FIND is incompatible with most existing partitioning methods and libraries for nested dissection, which all use width-1 separators. Our new algorithm resolves these problems by thoroughly decomposing the computation process such that width-1 separators can be used, resulting in a significant speedup over FIND for realistic devices — up to twelve-fold in simulation. The new algorithm also has the added advantage that desired off-diagonal entries can be computed for free. Consequently, our algorithm is faster than the current state-of-the-art recursive methods for meshes of any size. Furthermore, the framework used in the analysis of our algorithm is the first attempt to explicitly apply the widely-used relationship between mesh nodes and matrix computations to the problem of multiple eliminations with reuse of intermediate results. This framework makes our algorithm easier to generalize, and also easier to compare against other methods related to elimination trees. Finally, our accuracy analysis shows that the algorithms that require back-substitution are subject to significant extra round-off errors, which become extremely large even for some well-conditioned matrices or matrices with only moderately large condition numbers. When compared to these back-substitution algorithms, our algorithm is generally a few orders of magnitude more accurate, and our produced round-off errors stay at a reasonable level.

97 MATHEMATICS AND COMPUTING↗

Effective computation of stochastic protein kinetic equation by reducing stiffness via variable transformation

The stochastic protein kinetic equations can be stiff for certain parameters, which makes their numerical simulation rely on very small time step sizes, resulting in large computational cost and accumulated round-off errors. For such situation, we provide a method of reducing stiffness of the stochastic protein kinetic equation by means of a kind of variable transformation. Theoretical and numerical analysis show effectiveness of this method. Its generalization to a more general class of stochastic differential equation models is also discussed.

97 MATHEMATICS AND COMPUTING↗

Pressurizing Hagan and SAVY containers to 30-psig (air) to measure the release of analytical cerium oxide test powder

The need to pressure-test known nuclear material storage containers has been made apparent by the CSE (cognizant systems engineer) assigned to containers at TA-55. The main goal of the current study is to understand the behavior of the SAVY-4000 and Hagan containers during an internal pressurization (30 psig) event. The experiments incorporated a nominal mass of 100 g of CeO 2 (cerium oxide) powder to simulate MAR (material at risk) conditions. For the experimental results with mass losses of 0.0±0.1 g mass loss), using ASME error analysis, there is a total expanded uncertainty in a 95% confidence interval (±0.25 g) for the tested SAVY-4000 and Hagan containers. For purposes of conservatism, this has been rounded upward to yield a bounding value for the damage ratio DR = 0.003 = 0.3%.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Planning, design and logistics of a decision analysis study: The FBI/Ames study involving forensic firearms examiners

This paper describes design and logistical aspects of a decision analysis study to assess the performance of qualified firearms examiners working in accredited laboratories in the United States in terms of accuracy (error rate), repeatability, and reproducibility of decisions involving comparisons of fired bullets and cartridge cases. The purpose of the study was to validate current practice of the forensic discipline of firearms/toolmarks (F/T) examination. It elicited error rate data by counting the number of false positive and false negative conclusions. Preceded by the experimental design, decisions, and logistics described herein, testing was ultimately administered 173 qualified, practicing F/T examiners in public and private crime laboratories. The first round of testing evaluated accuracy, while two subsequent rounds evaluated repeatability and reproducibility of examiner conclusions. This project expands on previous studies by involving many F/T examiners in challenging comparisons and by executing the study in the recommended double-blind format.

99 GENERAL AND MISCELLANEOUS↗

Dedicated beam position monitor pair for model-independent lattice characterization at NSLS-II

This paper reports recent lattice characterization results obtained at the National Synchrotron Light Source II (NSLS-II) storage ring, conducted without reliance on a lattice model. A pair of beam position monitors (BPMs) with bunch-by-bunch (B$\times$B) resolution, were recently installed in a section of the storage ring free of magnetic fields. The new BPM pair measured the beam, or bunch’s transverse Poincaré map precisely after the beam was excited. Linear one-turn-matrices (OTM) were then derived, and from these, the 4-dimensional coupled Twiss parameters were extracted at the locations of the BPM pair. By normalizing beam oscillation amplitudes with the Twiss parameters, the global action-variables were obtained. Additionally, these action-variables facilitated the measurement of the local Twiss parameters observed by other BPMs independent on lattice model. This method is general, and particularly useful in certain scenarios such as a round beam mode in a diffraction-limited light source ring. We applied it to assess both weakly and strongly coupled lattices at the NSLS-II ring. Through analysis of the strongly coupled lattice, the quadrupole tilt errors were estimated to be less than 400 μrad. Utilizing the BPMs’ B$\times$B resolution, for the first time we observed the variations of the linear lattice along a long bunch-train.

36 MATERIALS SCIENCE↗

Dedicated beam position monitor pair for model-independent lattice characterization at NSLS-II

This paper reports recent lattice characterization results obtained at the National Synchrotron Light Source II (NSLS-II) storage ring, conducted without reliance on a lattice model. A pair of beam position monitors (BPMs) with bunch-by-bunch (B×B) resolution, were recently installed in a section of the storage ring free of magnetic fields. The new BPM pair measured the beam, or bunch’s transverse Poincar´e map precisely after the beam was excited. Linear one-turn-matrices (OTM) were then derived, and from these, the 4-dimensional coupled Twiss parameters were extracted at the locations of the BPM pair. By normalizing beam oscillation amplitudes with the Twiss parameters, the global action-variables were obtained. These action-variables facilitated the measurement of the local Twiss parameters observed by other BPMs independent on lattice model. This method is general, and particularly useful in certain scenarios such as a round beam mode in a diffraction-limited light source ring. We applied it to assess both weakly and strongly coupled lattices at the NSLS-II ring. Through analysis of the strongly coupled lattice, the quadrupole tilt errors were estimated to be less than 400 µrad. Utilizing the BPMs’ B×B resolution, for the first time we observed the variations of the linear lattice along a long bunch-train.

43 PARTICLE ACCELERATORS↗

An overlapping domain decomposition method for large-scale problems

Discretization of dynamical models defined through partial differential equations leads to large-scale systems. Time-depending condition involves an iterative integration of such kind of systems. In this paper, a novel technique based on overlapped domain decomposition, without preconditioner and scalable, is presented. Due to the domain decomposition, subproblems are solved in parallel without communications, cutting off the computation time and optimizing the computational cost. This direct method describes an optimized parallel strategy to solve the initial problem, providing the exact solution, up to rounding errors. Moreover, it takes into account both physical nature of the problem and deriving numerical properties of the system. It is highly recommended in case of band matrices and a long time interval because of an increasing gain in terms of performance and computational cost with the number of integrations. A deep analysis of the computational cost concludes the paper.

97 MATHEMATICS AND COMPUTING↗