Skip to main content

Table 3 Table of values choosing \(x_{0}=1\), \(x_{1}=2.5\)

From: A hybrid inertial algorithm for approximating solution of convex feasibility problems with applications

n

Algorithm (3.12)

\(|x_{n+1}|\)

1

2.5

2

1

3

0.0598

4

0.0598

5

0.0465

10

0.0044

20

\(1.425\times e^{-5}\)

30

\(5.549\times e^{-8}\)

40

\(8.18\times e^{-11}\)

50

\(2.408\times e^{-13}\)

55

\(3.521\times e^{-15}\)