Results 251 to 260 of about 26,950 (290)

Rounding errors in autoregressive processes

International Journal of Forecasting, 1993
Abstract Time series observations are often rounded, but are modelled as though they were continuous and no rounding had occurred. This paper examines the impact of rounding on the estimation of parameters in autoregressive time series models, deriving appropriate adjustments for the estimates of the true parameters when using rounded data ...
Antonie Stam, Kenneth O. Cogger
openaire   +1 more source

Dealing with Rounding Errors in Geometry Processing

2015
Processing geometric data on computer systems poses interesting challenges. The limited representation in a computer system, combined with the wide variety of calculations can result in robustness problems. As a result of this, it is for example possible that the exact intersection point of two lines cannot be represented by the computer system and its
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

Rounding error analysis of interpolation procedures

Computing, 1984
This 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

A Unified Rounding Error Bound for Polynomial Evaluation

Advances in Computational Mathematics, 2003
The author presents a rounding error bound with the same general form for the evaluation of a polynomial written in any polynomial base when the evaluation algorithm can be expressed as a linear recurrence or a first-order linear matrix recurrence relation. In these bounds the condition number of the polynomials appears in a natural way.
openaire   +2 more sources

A New Roundness Error Evaluation Method

Proceedings of the 2022 2nd International Conference on Control and Intelligent Robotics, 2022
Zhiyong Zhang, Yonggang Zhu, Guilu Wang
openaire   +1 more source

Stochastic Rounding and Its Probabilistic Backward Error Analysis

SIAM Journal of Scientific Computing, 2021
Nicholas J Higham, Theo Mary
exaly  

Weight-Rounding Error in Deep Neural Networks

Current AI technologies based on deep neural networks (DNNs) are computationally extremely demanding, which limits their widespread deployment in embedded devices with constrained energy resources (e.g. battery-powered smartphones). One possible approach to solving this problem is to reduce the precision of weight parameters, which can save an enormous
Jiří Šíma, Petra Vidnerová
openaire   +2 more sources

The forward rounding error analysis of the partial pivoting quaternion LU decomposition

Numerical Algorithms, 2023
Fengxia Zhang, Musheng Wei, Zhang Fengxia   +2 more
exaly  

Rounding Errors in Algebraic Processes

2023
openaire   +1 more source