Fixed Point Theory and Algorithms for Sciences and Engineering

Table 5 Computation times for BOY (3.1) in Table 4

From: An inertial-type algorithm for approximation of solutions of Hammerstein integral inclusions in Hilbert spaces

p	N	\(c_{n} =0\)	\(c_{n} =n^{-3}\)	\(c_{n} =n^{-\frac{3}{2}}\)	\(c_{n} =n^{-2}\)
50	100	1.562500e−02	0	0	0
50	1000	6.250000e−02	6.250000e−02	1.250000e−01	1.875000e−01
50	10 000	3.968750e+00	2.843750e+00	3.406250e+00	3.796875e+00
500	100	0	0	1.562500e−02	1.562500e−02
500	1000	4.218750e−01	4.218750e−01	3.906250e−01	3.906250e−01
500	10 000	5.395313e+01	5.226563e+01	5.281250e+01	5.184375e+01

Back to article page