An Inertial Iterative Algorithm with Strong Convergence for Solving Modified Split Feasibility Problem in Banach Spaces

Table 1

Computation result for the example.

Case	CPU time (sec.)		Iter.
	Algo. (1.3)	Algo. 3.1	Algo. (1.3)	Algo. 3.1
I: n = 10	0.1960	0.157	247	56
II: n = 20	0.2030	0.1630	315	94
III: n = 40	0.2840	0.2280	422	156
IV: n = 50	0.3260	0.2490	472	183