We analyze Dykstra's algorithm for two arbitrary closed convex sets in
a Hilbert space. Our technique also applies to von Neumann's algorith
m. Various convergence results follow. An example allows one to compar
e qualitative and quantitative behaviour of the two algorithms. We dis
cuss the case of finitely many sets. (C) 1994 Academic Press, Inc.