Efficient Algorithm for Computing Approximate Fixed Points of Contraction Maps

We give an O(k^2 log(1/ε))-query algorithm for finding an ε-fixed point of a (1-γ)-contraction map over the k-cube [0,1]^k under the ℓ∞-norm.