An improvement on precision of recursive function simulation in IEEE floating point standard is presented. It is shown that the average of rounding towards negative infinite and rounding towards positive infinite yields a better result than the usual standard rounding to the nearest in the simulation of recursive functions. In general, the method improves one digit of precision and it has also been useful to avoid divergence from a correct stationary regime in the logistic map. Numerical studies are presented to illustrate the method
Abstract. Rounding error analyses of numerical algorithms are most often carried out via repeated ap...
Article dans revue scientifique avec comité de lecture.The recursive method formalized by Nijenhuis ...
International audienceWe present a fast algorithm together with its low-level implementation of corr...
An improvement on precision of recursive function simulation in IEEE floating point standard is pre...
. The usual recursive summation technique is just one of several ways of computing the sum of n floa...
This work presents a new model to describe the increase of the rounding noise in the Fast Recursive ...
Floating-point numbers have an intuitive meaning when it comes to physics-based numerical computatio...
For scientific computations on a digital computer the set of real numbers is usually approximated by...
Summarization: The continuous use of adaptive algorithms is strongly dependent on their behavior in ...
International audienceThe most well-known feature of floating-point arithmetic is the limited precis...
Floating-point numbers represent only a subset of real numbers.As such, floating-point arithmetic in...
Une arithmétique sûre et efficace est un élément clé pour exécuter des calculs rapides et sûrs. Le c...
Summarization: We study the nonlinear round-off error accumulation system of the conventional recurs...
Conversion of unsigned 32-bit random integers to double precision floating point is discussed. It is...
Rounding errors present an inherent problem to all computer programs involving floating-point number...
Abstract. Rounding error analyses of numerical algorithms are most often carried out via repeated ap...
Article dans revue scientifique avec comité de lecture.The recursive method formalized by Nijenhuis ...
International audienceWe present a fast algorithm together with its low-level implementation of corr...
An improvement on precision of recursive function simulation in IEEE floating point standard is pre...
. The usual recursive summation technique is just one of several ways of computing the sum of n floa...
This work presents a new model to describe the increase of the rounding noise in the Fast Recursive ...
Floating-point numbers have an intuitive meaning when it comes to physics-based numerical computatio...
For scientific computations on a digital computer the set of real numbers is usually approximated by...
Summarization: The continuous use of adaptive algorithms is strongly dependent on their behavior in ...
International audienceThe most well-known feature of floating-point arithmetic is the limited precis...
Floating-point numbers represent only a subset of real numbers.As such, floating-point arithmetic in...
Une arithmétique sûre et efficace est un élément clé pour exécuter des calculs rapides et sûrs. Le c...
Summarization: We study the nonlinear round-off error accumulation system of the conventional recurs...
Conversion of unsigned 32-bit random integers to double precision floating point is discussed. It is...
Rounding errors present an inherent problem to all computer programs involving floating-point number...
Abstract. Rounding error analyses of numerical algorithms are most often carried out via repeated ap...
Article dans revue scientifique avec comité de lecture.The recursive method formalized by Nijenhuis ...
International audienceWe present a fast algorithm together with its low-level implementation of corr...