Search NASA⌕ Search

SEARCH · Search NASA

Results for “finite precision”

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 37 records · Page 2

Stable evaluation of Green's functions in cylindrically stratified regions with uniaxial anisotropic layers

We present a robust algorithm for the computation of electromagnetic fields radiated by point sources (Hertzian dipoles) in cylindrically stratified media where each layer may exhibit material properties (permittivity, permeability, and conductivity) with uniaxial anisotropy. Analytical expressions are obtained based on the spectral representation of the tensor Green's function based on cylindrical Bessel and Hankel eigenfunctions, and extended for layered uniaxial media. Due to the poor scaling of these eigenfunctions for extreme arguments and/or orders, direct numerical evaluation of such expressions can produce numerical instability, i.e., underflow, overflow, and/or round-off errors under finite precision arithmetic. To circumvent these problems, we develop a numerically stable formulation through suitable rescaling of various expressions involved in the computational chain, to yield a robust algorithm for all parameter ranges. Numerical results are presented to illustrate the robustness of the formulation including cases of practical interest.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Magnetic field calculation for a 10 MeV positron emission tomography cyclotron

The magnetic field calculation and correction for a 10 MeV positron emission tomography cyclotron is presented. 3D TOSCA analysis results are compared with the measured data, and the calculation error is used to calibrate the B-H curve to obtain a very precise finite element method estimator, which is used to predict the correction of the magnet pole for achieving the isochronous field. The isochronous field error is approximated with the effects of a set of standard patches. On the assumption that the effect of each small patch is proportional to its surface, the correction of the magnet pole is found by solving a system of equations using the least square scheme. The magnet shimming is performed and the measured magnetic field is found in good agreement with the prediction, with an error less than 2 G.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Understanding the many-body expansion for large systems. II. Accuracy considerations

To complement our study of the role of finite precision in electronic structure calculations based on a truncated many-body expansion (MBE, or “n-body expansion”), we examine the accuracy of such methods in the present work. Accuracy may be defined either with respect to a supersystem calculation computed at the same level of theory as the n-body calculations, or alternatively with respect to high-quality benchmarks. Both metrics are considered here. In applications to a sequence of water clusters, (H{sub 2}O){sub N=6−55} described at the B3LYP/cc-pVDZ level, we obtain mean absolute errors (MAEs) per H{sub 2}O monomer of ∼1.0 kcal/mol for two-body expansions, where the benchmark is a B3LYP/cc-pVDZ calculation on the entire cluster. Three- and four-body expansions exhibit MAEs of 0.5 and 0.1 kcal/mol/monomer, respectively, without resort to charge embedding. A generalized many-body expansion truncated at two-body terms [GMBE(2)], using 3–4 H{sub 2}O molecules per fragment, outperforms all of these methods and affords a MAE of ∼0.02 kcal/mol/monomer, also without charge embedding. GMBE(2) requires significantly fewer (although somewhat larger) subsystem calculations as compared to MBE(4), reducing problems associated with floating-point roundoff errors. When compared to high-quality benchmarks, we find that error cancellation often plays a critical role in the success of MBE(n) calculations, even at the four-body level, as basis-set superposition error can compensate for higher-order polarization interactions. A many-body counterpoise correction is introduced for the GMBE, and its two-body truncation [GMBCP(2)] is found to afford good results without error cancellation. Together with a method such as ωB97X-V/aug-cc-pVTZ that can describe both covalent and non-covalent interactions, the GMBE(2)+GMBCP(2) approach provides an accurate, stable, and tractable approach for large systems.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Uncertainty analysis of signal deconvolution using a measured instrument response function

A common analysis procedure minimizes the ln-likelihood that a set of experimental observables matches a parameterized model of the observation. The model includes a description of the underlying physical process as well as the instrument response function (IRF). Here, we investigate the National Ignition Facility (NIF) neutron time-of-flight (nTOF) spectrometers, the IRF is constructed from measurements and models. IRF measurements have a finite precision that can make significant contributions to the uncertainty estimate of the physical model’s parameters. Finally, we apply a Bayesian analysis to properly account for IRF uncertainties in calculating the ln-likelihood function used to find the optimum physical parameters.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Noise effects on Padé approximants and conformal maps

Here, we analyze the properties of Padé and conformal map approximants for functions with branch points, in the situation where the expansion coefficients are only known with finite precision or are subject to noise. We prove that there is a universal scaling relation between the strength of the noise and the expansion order at which Padé or the conformal map breaks down. We illustrate this behavior with some physically relevant model test functions and with two non-trivial physical examples where the relevant Riemann surface has complicated structure.

97 MATHEMATICS AND COMPUTING↗

On the Convergence of the Inexact Running Krasnosel'skii-Mann Method

This letter leverages a framework based on averaged operators to tackle the problem of tracking fixed points associated with maps that evolve over time. In particular, this letter considers the Krasnosel'skii-Mann (KM) method in a settings where: 1) the underlying map may change at each step of the algorithm, thus leading to a 'running' implementation of the KM method, and 2) an imperfect information of the map may be available. An imperfect knowledge of the maps can capture cases where processors feature a finite precision or quantization errors, or the case where (part of) the map is obtained from measurements. The analytical results are applicable to inexact running algorithms for solving optimization problems, whenever the algorithmic steps can be written in the form of (a composition of) averaged operators; examples are provided for inexact running gradient methods and the forward-backward splitting method. Convergence of the average fixed-point residual is investigated for the non-expansive case; linear convergence to a unique fixed-point trajectory is showen in the case of inexact running algorithms emerging from contractive operators.

97 MATHEMATICS AND COMPUTING↗

Distributed Inference with Sparse and Quantized Communication

Here, we consider the problem of distributed inference where agents in a network observe a stream of private signals generated by an unknown state, and aim to uniquely identify this state from a finite set of hypotheses. We focus on scenarios where communication between agents is costly, and takes place over channels with finite bandwidth. To reduce the frequency of communication, we develop a novel event-triggered distributed learning rule that is based on the principle of diffusing low beliefs on each false hypothesis. Building on this principle, we design a trigger condition under which an agent broadcasts only those components of its belief vector that have adequate innovation, to only those neighbors that require such information. We prove that our rule guarantees convergence to the true state exponentially fast almost surely despite sparse communication, and that it has the potential to significantly reduce information flow from uninformative agents to informative agents. Next, to deal with finite-precision communication channels, we propose a distributed learning rule that leverages the idea of adaptive quantization. We show that by sequentially refining the range of the quantizers, every agent can learn the truth exponentially fast almost surely, while using just 1 bit to encode its belief on each hypothesis. For both our proposed algorithms, we rigorously characterize the trade-offs between communication-efficiency and the learning rate.

42 ENGINEERING↗

Estimating computational noise.

Computational noise in deterministic simulations is as ill-defined a concept as can be found in scientific computing. When coupled with adaptive strategies, the effects of finite precision destroy smoothness of the simulation output and complicate subsequent analysis. Following the work of Hamming on roundoff errors, we present a new algorithm, ECnoise, for quantifying the noise level of a computed function. Our theoretical framework is based on stochastic noise but does not assume a specific distribution for the noise. For the deterministic simulations considered, ECnoise produces reliable results in a few function evaluations and offers new insights into building blocks of large scale simulations.

99 GENERAL AND MISCELLANEOUS↗

CrossSim

CrossSim is a simulator for modeling neural-inspired machine learning algorithms on analog hardware, such as resistive memory crossbars. It includes noise models for reading and updating the resistances, which can be based on idealized equations or experimental data. It can also introduce noise and finite precision effects when converting values from digital to analog and vice versa. All of these effects can be turned on or off as an algorithm processes a data set and attempts to learn its salient attributes so that it can be categorized in the machine learning training/classification context. CrossSim thus allows the robustness, accuracy, and energy usage of a machine learning algorithm to be tested on simulated hardware.

Plimpton, StevenJ.↗

Mixed Convection in the VHTR in the Event of a LOFA

The US Department of Energy, Office of Nuclear Energy (DOE-NE) is supporting the development of a very high temperature reactor (VHTR) concept as the primary focus of it next generation nuclear power plant (NGNP) program. The VHTR is cooled by forcing helium downwards through the core into the lower plenum and out the hot duct. In the event that the coolant circulators are lost, the driving pressure drop across the core will reduce to zero and there will be the opportunity for natural circulation to occur. During the time that the circulators are powering down, the heat transfer in the core from the graphite blocks to the helium coolant will transform from turbulent forced convection to mixed convection, where buoyancy effects become important, to free or natural convection, where buoyancy is dominant. Analysis of the nature of the forced, mixed and free convection is best done using computational fluid dynamic (CFD) software that can provide fine details of the flow and heat transfer. However, CFD analysis involves approximations in the results because of the finite nature of the spatial and temporal discretizations required, the inexact nature of the turbulence models that are used and the finite precision of the computers employed. Therefore, it is necessary to validate the CFD computations. Validation is accomplished by comparing results from specific CFD computations to experimental data that have been taken specifically for the purpose of validation and that are related to the physical phenomena in question. The present report examines the flow and heat transfer parameters (dimensionless numbers) that characterize the flow and reports ranges for their values based on specific CFD studies performed for the VHTR.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Top Quark Mass in Events with two Charged Leptons at the D0 Experiment

The top quark is the most massive observed fundamental subatomic particle, and at the Tevatron accelerator is produced mostly in top-antitop (t$\bar{t}$) quark pairs from the collisions of protons and anti-protons. Each top quark decays into a bottom quark and a W boson. The W boson can then decay into a pair of quarks, or into a charged lepton and a neutrino. The various decays can be broken up into three different channels based on the number of leptons from the decay of the W bosons: all-jets (with no leptons), lepton+jets (with one lepton), and dilepton (with two leptons). This dissertation will present a measurement of the top quark mass in the dilepton channel. The dilepton channel is characterized by two leptons, two neutrinos and two b-quarks. The neutrinos are not directly observed, but their absence is felt as missing transverse momentum (p T ) in the detector. The combination of two leptons and large p T produces an easily isolated signal, giving the dilepton channel a high signal over background ratio. Having two neutrinos means that we cannot know what the transverse momenta of either neutrino is. This means that even if we knew the momenta of the leptons and b-quarks perfectly, we would be unable to reconstruct the mass of the top quark. This measurement gets around this problem by scanning over all possible values of the top mass, finding all consistent t{bar t} combinations, assigning a kinematic weight to each, and then adding the weights for each combination at a given possible top mass. The lepton momenta, jet momenta, and p T are only known to within some finite precision, so for a given top mass, I also vary each of these momenta within their resolutions and add the weights for a given possible top mass. After scanning over possible top masses, I choose the top mass with the largest sum of weights m t max as an observable for the event. I then perform a template based likelihood fit of m t using m t max . I analyze 322 candidate events collected by the D0 detector, and obtain a top quark mass of: m t = 174.8 ± 3.1 GeV.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Energy scaling advantages of resistive memory crossbar based computation and its application to sparse coding

In this study, the exponential increase in data over the last decade presents a significant challenge to analytics efforts that seek to process and interpret such data for various applications. Neural-inspired computing approaches are being developed in order to leverage the computational properties of the analog, low-power data processing observed in biological systems. Analog resistive memory crossbars can perform a parallel read or a vector-matrix multiplication as well as a parallel write or a rank-1 update with high computational efficiency. For an N × N crossbar, these two kernels can be O(N) more energy efficient than a conventional digital memory-based architecture. If the read operation is noise limited, the energy to read a column can be independent of the crossbar size (O(1)). These two kernels form the basis of many neuromorphic algorithms such as image, text, and speech recognition. For instance, these kernels can be applied to a neural sparse coding algorithm to give an O(N) reduction in energy for the entire algorithm when run with finite precision. Sparse coding is a rich problem with a host of applications including computer vision, object tracking, and more generally unsupervised learning.

97 MATHEMATICS AND COMPUTING↗

The digital implementation of control compensators: The coefficient wordlength issue

There exists a number of mathematical procedures for designing discrete-time compensators. However, the digital implementation of these designs, with a microprocessor for example, has not received nearly as thorough an investigation. The finite-precision nature of the digital hardware makes it necessary to choose an algorithm (computational structure) that will perform 'well-enough' with regard to the initial objectives of the design. This paper describes a procedure for estimating the required fixed-point coefficient wordlength for any given computational structure for the implementation of a single-input single-output LOG design. The results are compared to the actual number of bits necessary to achieve a specified performance index.

Moroney, P.↗

The digital implementation of control compensators - The coefficient wordlength issue

There exist a number of mathematical procedures for designing discrete-time compensators. However, the digital implementation of these designs, with a microprocessor, for example, has not received nearly as thorough an investigation. The finite-precision nature of the digital hardware makes it necessary to choose a computational structure that will perform adequately with regard to the initial objectives of the design. This paper describes a procedure for estimating the required fixed-point coefficient wordlength for any given computational structure for the implementation of a single-input single-output LQG design. The results are compared to the actual number of bits necessary to achieve a specified performance index.

Moroney, P.↗

Statistical analysis of effective singular values in matrix rank determination

A major problem in using SVD (singular-value decomposition) as a tool in determining the effective rank of a perturbed matrix is that of distinguishing between significantly small and significantly large singular values to the end, conference regions are derived for the perturbed singular values of matrices with noisy observation data. The analysis is based on the theories of perturbations of singular values and statistical significance test. Threshold bounds for perturbation due to finite-precision and i.i.d. random models are evaluated. In random models, the threshold bounds depend on the dimension of the matrix, the noisy variance, and predefined statistical level of significance. Results applied to the problem of determining the effective order of a linear autoregressive system from the approximate rank of a sample autocorrelation matrix are considered. Various numerical examples illustrating the usefulness of these bounds and comparisons to other previously known approaches are given.

Konstantinides, Konstantinos↗

An O(log sup 2 N) parallel algorithm for computing the eigenvalues of a symmetric tridiagonal matrix

An O(log sup 2 N) parallel algorithm is presented for computing the eigenvalues of a symmetric tridiagonal matrix using a parallel algorithm for computing the zeros of the characteristic polynomial. The method is based on a quadratic recurrence in which the characteristic polynomial is constructed on a binary tree from polynomials whose degree doubles at each level. Intervals that contain exactly one zero are determined by the zeros of polynomials at the previous level which ensures that different processors compute different zeros. The exact behavior of the polynomials at the interval endpoints is used to eliminate the usual problems induced by finite precision arithmetic.

Swarztrauber, Paul N.↗

Implementation details of the coupled QMR algorithm

The original quasi-minimal residual method (QMR) relies on the three-term look-ahead Lanczos process, to generate basis vectors for the underlying Krylov subspaces. However, empirical observations indicate that, in finite precision arithmetic, three-term vector recurrences are less robust than mathematically equivalent coupled two-term recurrences. Therefore, we recently proposed a new implementation of the QMR method based on a coupled two-term look-ahead Lanczos procedure. In this paper, we describe implementation details of this coupled QMR algorithm, and we present results of numerical experiments.

Freund, Roland W.↗

Reliable and Efficient Parallel Processing Algorithms and Architectures for Modern Signal Processing

Least-squares (LS) estimations and spectral decomposition algorithms constitute the heart of modern signal processing and communication problems. Implementations of recursive LS and spectral decomposition algorithms onto parallel processing architectures such as systolic arrays with efficient fault-tolerant schemes are the major concerns of this dissertation. There are four major results in this dissertation. First, we propose the systolic block Householder transformation with application to the recursive least-squares minimization. It is successfully implemented on a systolic array with a two-level pipelined implementation at the vector level as well as at the word level. Second, a real-time algorithm-based concurrent error detection scheme based on the residual method is proposed for the QRD RLS systolic array. The fault diagnosis, order degraded reconfiguration, and performance analysis are also considered. Third, the dynamic range, stability, error detection capability under finite-precision implementation, order degraded performance, and residual estimation under faulty situations for the QRD RLS systolic array are studied in details. Finally, we propose the use of multi-phase systolic algorithms for spectral decomposition based on the QR algorithm. Two systolic architectures, one based on triangular array and another based on rectangular array, are presented for the multiphase operations with fault-tolerant considerations. Eigenvectors and singular vectors can be easily obtained by using the multi-pase operations. Performance issues are also considered.

Liu, Kuojuey Ray↗