Skip to main content

Table 1 Algorithm 1 for \(v=1\), \(N=5\), \(M=1\), \(s=4=t\), \(\varrho _{1}=-2\), \(\varrho _{2}=4\), \(\varrho _{3}=2\), \(\varrho _{4}=-2.5\), and \(TOL=10^{-3}\)

From: An inertial extrapolation method for multiple-set split feasibility problem

CPUt

n

\(x_{n}=(x_{n}^{1},x_{n}^{2},x_{n}^{3},x_{n}^{4})\)

 

1

(57,−101,36,−56)

 

2

(16.975572,−32.610749,12.089823,−15.660362)

 

3

(9.253186,−11.358803,0.388070,−7.606574)

 

4

(3.007314,−6.999628,3.811022,−3.104770)

 

5

(1.206224,−2.507948,0.686912,−1.686387)

 

6

(0.729906,−0.695988,0.413653,−1.302157)

 

7

(0.387654,−0.508405,0.406479,−0.657852)

 

8

(0.115411,−0.215174,0.173968,−0.100848)

 

9

(0.005019,−0.044157,0.056362,−0.024290)

 

10

(−0.002422,−0.006532,0.012524,−0.006262)

 

11

(−0.001575,−0.000154,0.005632,−0.003513)

 

12

(0.000192,−0.000033,0.001634,−0.001739)

0.016158

13

(0.001666,−0.000577,−0.001287,0.000157)