Results 241 to 250 of about 27,076 (290)

Round-off error in products

Computing, 1975
LetA 1 andA 2 be floating point numbers represented in arbitrary base β and randomly chosen from a logarithmic distribution. Letr denote the round-off error $$r = fl(A_1 * A_2 ) - (A_1 * A_2 )$$ where * is floating point multiplication and wherefl(A 1*A 2 ...
Richard Goodman, Alan Feldstein
openaire   +1 more source

Mean and variance of round off error

Signal Processing, 2016
Gadzhiev [4] derived expressions for round off error mean and round off error variance when the rounded variable follows the centered uniform and centered Gaussian distributions. Here, we derive general expressions for round off error mean and round off error variance when the rounded variable is any continuous random variable on the real line or any ...
Rui Li, Saralees Nadarajah
openaire   +2 more sources

Computational Graphs and Rounding Error

SIAM Journal on Numerical Analysis, 1974
Using graphs for representing computational processes, relative error propagation is described. It is shown how this relates to the condition of a problem and to the property of a process to be benign, i.e., to have only harmless effects of rounding errors. In particular, composition of processes is studied under these aspects.
openaire   +2 more sources

Density estimation for data with rounding errors

Computational Statistics & Data Analysis, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bin Wang 0091, W. Wertelecki
openaire   +1 more source

Discretization and rounding errors in orbit determination

Proceedings of the 1961 16th ACM national meeting on -, 1961
In this paper we study the growth of both discretization and roundoff error in the numerical determination of the orbit of a satellite around the earth by several typical step-by-step procedures. In particular we wish to compare the actual errors encountered in numerical computation with the errors predicted by the theory developed previously. In order
Peter Henrici, James D. Riley, H. Stafford   +2 more
openaire   +1 more source

Minimization of rounding errors in WFTA programs

ICASSP-88., International Conference on Acoustics, Speech, and Signal Processing, 2003
Two ideas linked with high-precision computation of WFTAs (Winograd-Fourier transform algorithm) using fixed-point arithmetic are analyzed. Use of the best, optimized small-N DFT (discrete Fourier transform) modules is considered. The sizes of these modules appear to be equal to Fermat prime numbers, and powers of two.
Ryszard Stasinski, Ewa Lukasik
openaire   +1 more source

Rounding error analysis of Horner's scheme

Computing, 1983
In this paper we establish a forward error analysis of the generalized complete Horner scheme for a polynomial $$p = \sum {a_j X^{n - j} } $$ with pivotal pointsz 1, ...,z n .
openaire   +1 more source

The effect of rounding errors in iterational processes

USSR Computational Mathematics and Mathematical Physics, 1985
Translation from Zh. Vychisl. Mat. Mat. Fiz. 25, No.7, 973-982 (Russian) (1985; Zbl 0581.65041).
openaire   +2 more sources

Rounding Error Analysis of Interval Algorithms

ZAMM - Journal of Applied Mathematics and Mechanics / Zeitschrift für Angewandte Mathematik und Mechanik, 1984
AbstractUsing the linearization method, a rounding error analysis of interval algorithms is established. It is shown that the interval midpoints and radii are approximate solutions of real evaluation algorithms and of certain linear systems uniquely associated to each interval algorithm.
openaire   +1 more source

ROUNDING-OFF ERRORS IN MATRIX PROCESSES

The Quarterly Journal of Mechanics and Applied Mathematics, 1948
A number of methods of solving sets of linear equations and inverting matrices are discussed. The theory of the rounding-off errors involved is investigated for some of the methods. In all cases examined, including the well-known 'Gauss elimination process', it is found that the errors are normally quite moderate: no exponential build-up need occur ...
openaire   +2 more sources