Results 241 to 250 of about 26,950 (290)
Some of the next articles are maybe not open access.
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
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, 2016Gadzhiev [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
Density estimation for data with rounding errors
Computational Statistics & Data Analysis, 2013zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bin Wang 0091, W. Wertelecki
openaire +1 more source
Computational Graphs and Rounding Error
SIAM Journal on Numerical Analysis, 1974Using 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
Discretization and rounding errors in orbit determination
Proceedings of the 1961 16th ACM national meeting on -, 1961In 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 +2 more
openaire +1 more source
Rounding error analysis of Horner's scheme
Computing, 1983In 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
Minimization of rounding errors in WFTA programs
ICASSP-88., International Conference on Acoustics, Speech, and Signal Processing, 2003Two 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
The effect of rounding errors in iterational processes
USSR Computational Mathematics and Mathematical Physics, 1985Translation 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, 1984AbstractUsing 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
Automatic Linear Correction of Rounding Errors
BIT Numerical Mathematics, 2001The standard analysis of the effect of rounding errors in floating point arithmetic is based on the estimation of computed value \(fl(.)\) with respect to the elementary errors bounded by the so-called epsilon machine. A first order approximation of the global rounding error accumulating elementary rounding errors is obtained using some numerical ...
openaire +2 more sources

