How to Ensure a Faithful Polynomial Evaluation with the
... This remark motivates this paper where we consider how to compute a faithfully rounded polynomial evaluation with the compensated Horner algorithm. By faithful rounding we mean that the computed result pb(x) is one of the two floating point neighbors of the exact result p(x). Faithful rounding is k ...
... This remark motivates this paper where we consider how to compute a faithfully rounded polynomial evaluation with the compensated Horner algorithm. By faithful rounding we mean that the computed result pb(x) is one of the two floating point neighbors of the exact result p(x). Faithful rounding is k ...
![[hal-00574623, v2] Averaging along Uniform Random Integers](http://s1.studyres.com/store/data/019969824_1-25527940ea4f317ec31969269e4745aa-300x300.png)
[hal-00574623, v2] Averaging along Uniform Random Integers
... hal-00574623, version 2 - 5 Sep 2011 ...
... hal-00574623, version 2 - 5 Sep 2011 ...
A NEW STRONG INVARIANCE PRINCIPLE FOR SUMS OF
... finite-dimensional case. This result is the basis for all the LIL type results in [7, 8] and, consequently, we can prove all these results in the finite-dimensional case via Theorem 2.1. Corollary 2.4. Let X, X1 , X2 , . . . be i.i.d. mean zero random vectors in Rd . Assume that condition (2.1) √ ho ...
... finite-dimensional case. This result is the basis for all the LIL type results in [7, 8] and, consequently, we can prove all these results in the finite-dimensional case via Theorem 2.1. Corollary 2.4. Let X, X1 , X2 , . . . be i.i.d. mean zero random vectors in Rd . Assume that condition (2.1) √ ho ...
