Variable KM-like algorithms for fixed point problems and split feasibility problems

Table 1 The numerical results for initial guess $x_{1} = 0, 0.2, 0.8, 1$

n	$x_{1} = 0$	$x_{1} = 0.2$	$x_{1} = 0.8$	$x_{1} = 1$
5	0.452291666666667	0.452604166666667	0.514843750000000	0.514947916666667
10	0.476041066961784	0.476041067553836	0.476047944746260	0.476047944894273
15	0.483829591828978	0.483829591828978	0.483829591829845	0.483829591829845
20	0.487787940564059	0.487787940564059	0.487787940564059	0.487787940564059
25	0.490187554131032	0.490187554131032	0.490187554131032	0.490187554131032
30	0.491798400218960	0.491798400218960	0.491798400218960	0.491798400218960
35	0.492954698188619	0.492954698188619	0.492954698188619	0.492954698188619
40	0.493825130132048	0.493825130132048	0.493825130132048	0.493825130132048
45	0.494504074844059	0.494504074844059	0.494504074844059	0.494504074844059
50	0.495048473664881	0.495048473664881	0.495048473664881	0.495048473664881