From: A new class of computationally efficient algorithms for solving fixed-point problems and variational inequalities in real Hilbert spaces
\(s_{0}=s_{1}\)
Total number of iterations
alg-1
alg-2
mtalg-1
mtalg-2
vtalg-1
vtalg-2
1
44
33
76
70
66
57
t
42
31
89
84
58
48
sin(t)
45
34
75
64
51
cos(t)
47
35
74
94