Results 251 to 260 of about 117,411 (298)

Mean and variance of round off error

open access: yesSignal 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   +3 more sources

CADNA: a library for estimating round-off error propagation

open access: yesComputer Physics Communications, 2008
The CADNA library enables one to estimate round-off error propagation using a probabilistic approach. With CADNA the numerical quality of any simulation program can be controlled. Furthermore by detecting all the instabilities which may occur at run time, a numerical debugging of the user code can be performed.
Jézéquel, Fabienne   +1 more
openaire   +3 more sources

A Round-Off Error Model with Applications to Arithmetic Expressions

SIAM Journal on Computing, 1979
An arithmetic expression is evaluated in a form most suitable to a given computing structure. To select this “suitable form” restructuring algorithms using laws of associativity, commutativity, and distributivity have been proposed. This raises the question of how different ways of evaluating an expression influence the propagation of errors due to ...
Vijay B. Aggarwal, James W. Burgmeier
exaly   +3 more sources

Round off error analysis for Gram-Schmidt method and solution of linear least squares problems

open access: yesBIT Numerical Mathematics, 1971
Round off error analysis for the classical Gram-Schmidt orthogonalization method with re-orthogonalization is presented. The effect of the round-off error on the orthogonality of the derived vectors and also on the solution of the linear least squares ...
Nabih N Abdelmalek
exaly   +2 more sources

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

Complexity Estimates Depending on Condition and Round-off Error

Journal of the ACM, 1998
This paper has two agendas. One is to develop the foundations of round-off in computation. The other is to describe an algorithm for deciding feasibility for polynomial systems of equations and inequalities together with its complexity analysis and its round-off properties. Each role reinforces the other.
Felipe Cucker, Steve Smale
openaire   +1 more source

Accumulation of Round-Off Error in Fast Fourier Transforms

Journal of the ACM, 1970
The fast Fourier transform (FFT) is an algorithm to compute the discrete Fourier coefficients with a substantial time saving over conventional methods. The finite word length used in the computer causes an error in computing the Fourier coefficients.
Toyohisa Kaneko, Bede Liu
openaire   +2 more sources

Home - About - Disclaimer - Privacy