Results 121 to 130 of about 3,259,619 (178)

On the statistics of fixed-point roundoff error

IEEE Transactions on Acoustics, Speech, and Signal Processing, 1985
Roundoff error after fixed-point multiplication is commonly modeled as uniformly distributed white noise that is uncorrelated with the signal. This paper presents a statistical analysis of fixed-point roundoff error that identifies the conditions under which this model is valid, and examines the statistical behavior of roundoff error when these ...
Casper W. Barnes, Boi N. Tran, Shu Hung Leung   +2 more
exaly   +2 more sources

Numerical chaos, roundoff errors, and homoclinic manifolds.

Physical Review Letters, 1993
The focusing nonlinear Schr\"odinger equation is numerically integrated over moderate to long time intervals. In certain parameter regimes small errors on the order of roundoff grow rapidly and saturate at values comparable to the main wave. Although the constants of motion are nearly preserved, a serious phase instability (chaos) develops in the ...
M. Ablowitz, C. Schober, B. Herbst
semanticscholar   +3 more sources

Quantization and Roundoff Errors

, 1989
A one-dimensional (1-D) digital filter, as noted in Section 1.3, is generally defined by $${y_n} = \sum\limits_{i = 0}^M {{a_i}{u_{n - i}}} - \sum\limits_{i = 1}^N {{b_i}{y_{n - i}}} $$ (5.1) where {u n } is the input sequence, {y n } is the output sequence, and a i , and b i are some constants.
Robert King, M. Ahmadi, R. Gorgui-Naguib, A. Kwabwe, M. Azimi-Sadjadi   +4 more
semanticscholar   +2 more sources

Roundoff errors for polynomial evaluation by a family of formulae

Computing, 2008
The classical Lagrange interpolation formula is rewritten in the barycentric form. The authors show that these kind of formulas can be analyzed by making a distinction between the first steps corresponding to computations to high relative accuracy and the final sum, where high relative accuracy cannot be ensured.
J. Carnicer, T. Goodman, J. Peña
semanticscholar   +3 more sources

Roundoff errors in floating-point summation

BIT, 1975
All possible schemes for the calculation of the sum ofn addends by means ofn−1 floating-point additions is considered and in case of positive addends it is shown how to use the Huffman algorithm to choose a scheme to obtain the least upper bound on the accumulated roundoff error in the result.
O. Caprani
semanticscholar   +3 more sources

Truncation and roundoff errors in three-point approximations of first and second derivatives

Applied Mathematics and Computation, 2011
J S C Prentice
exaly   +2 more sources

Digital Oscillator Having Low Sensitivity and Roundoff Errors

IEEE Transactions on Aerospace and Electronic Systems, 1986
A. Abu-El-Haija, M. Al-Ibrahim
exaly   +2 more sources

An absolute bound on limit cycles due to roundoff errors in digital filters

IEEE Transactions on Audio and Electroacoustics, 1973
J. Long, T. Trick
exaly   +2 more sources

Analysis of floating point roundoff errors using dummy multiplier coefficient sensitivities

IEEE Transactions on Circuits and Systems, 1991
B Zeng, Y Neuvo
exaly   +2 more sources

Accumulation of roundoff errors in floating point FFT

IEEE Transactions on Circuits and Systems, 1977
Tran Thong
exaly   +2 more sources