  In this paper, we propose the concept of accelerated convergence that has
originally been developed to speed up the convergence of numerical methods for
extremum seeking (ES) loops. We demonstrate how the dynamics of ES loops may be
analyzed to extract structural information about the generated output of the
loop. This information is then used to distil the limit of the loop without
having to wait for the system to converge to it.
