It is well known that unpreconditioned Krylov subspace methods applied to the finite-difference-discretised Poisson equation with $n$ grid points per direction require $O(n \, |\log(\varepsilon)|)$ iterations to reduce the error in the initial guess by a factor $\varepsilon \in (0,1)$. This is typically a prohibitively large number of iterations; hence it is often suggested to reduce the number of iterations through incomplete LU (ILU) preconditioning.
My question is: does ILU reduce the $\text{# iterations} = O(n \,|\log(\varepsilon)|)$ estimate asymptotically (e.g. to $\text{# iterations} = O(\sqrt{n} \,|\log(\varepsilon)|)$), or does it merely reduce the prefactor implied by the big-O notation?
My own experiments seem to suggest that ILU preconditioning only improves the prefactor, but maybe I am not using the method properly?