In this article, we derive accurate Horner methods in real and complex floating-point arithmetic. In particular, we show that these methods are as accurate as if computed in k-fold precision, where k ≥ 2, and then rounded into the working precision. When k = 2, our methods are comparable or faster than the existing compensated Horner routines. When compared to multi-precision software, such as MPFR and MPC, our methods are significantly faster for k ≤ 8, that is, up to 489 bits in the significand.