Results 211 to 220 of about 23,696 (245)
Some of the next articles are maybe not open access.
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
Statistical Analysis of the Roundness Error Data
Advanced Materials Research, 2012In order to simulate the actual roundness measurement accurately, must find the mathematical model of the actual roundness data, the paper’s main emphasis is doing statistical analysis by plenty of measurement data of roundness, using mathematical knowledge to prove that the actual characteristics of roundness parameters obey the normal distribution ...
Zhao Peng Dong +3 more
openaire +1 more source
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
Rounding error analysis of interpolation procedures
Computing, 1984This paper provides a rounding error analysis for the classical interpolation procedures according to Wilkinson. Interpolation points are assumed as equidistant and ordered by size, and all initial data are given machine numbers. The error bounds obtained for the Lagrange and Neville procedures are almost identical, while for the Newton procedure they ...
openaire +1 more source
Rounding error analysis of the triangular lattice and escalator algorithms
ICASSP '86. IEEE International Conference on Acoustics, Speech, and Signal Processing, 1988AbstractThis paper deals with the Triangular lattice (TL) and Escalator (ES) algorithms for recursive least squares filtering problems. First, systolic array implementations of these algorithms are compared. Next, analysis of fixed point errors for the normalized TL and ES algorithms are performed and the expressions for the steady state biases in the ...
Youji Iiguni +2 more
openaire +1 more source
Analysis of rounded data in measurement error regression
Journal of the Korean Statistical Society, 2013zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhao, Ningning, Bai, Z. D.
openaire +2 more sources
Automatic propagated and round-off error analysis
Preprints of papers presented at the 13th national meeting of the Association for Computing Machinery on - ACM '58, 1958The routine described below is a modification of the Carnegie Tech (IT) Compiler system for the IBM-650, which will provide automatic empirical analysis of propagated and round-off errors in computation. In the modified system, three kinds of variables are admissable: fixed-point integers called I-variables; floating-point numbers called C-variables ...
openaire +1 more source
A round-off error analysis of the LMS adaptive algorithm
ICASSP '83. IEEE International Conference on Acoustics, Speech, and Signal Processing, 1984Summary: The steady state output error of the least mean square (LMS) adaptive algorithm due to the finite precision arithmetic of a digital processor is analyzed. It is found to consist of three terms: 1) the error due to the input data quantization, 2) the error due to the rounding of the arithmetic operations in calculating the filter's output, and ...
Christos Caraiscos, Bede Liu
openaire +1 more source
An efficient stochastic method for round-off error analysis
1986This paper presents a survey of research results obtained by the authors and by their team, on the round-off error propagation and the accuracy of mathematical computations.
J. Vignes, René Alt
openaire +1 more source
Inner product rounding error analysis in the presence of underflow
Computing, 1985Wilkinson's classical error analysis for sums and inner products is extended to the case where underflow may occur. This is relevant for the construction of rigorous error bounds for an inner product evaluated on computers which do not give underflow messages. The analysis also covers calculations with gradual underflow.
openaire +3 more sources