Figure 1
From: Acceleration of the Halpern algorithm to search for a fixed point of a nonexpansive mapping

Behavior of for the Halpern algorithm and Algorithm 3.1 (proposed). (The Halpern algorithm took 850 iterations to satisfy , whereas Algorithm 3.1 took only six.)