Skip to main content

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

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

n

Algorithm (1.5)

Algorithm (3.1)

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

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

1

2

3

3

0.8431

2

10

0.6663

0.0532

16

0.6365

0.0086

30

0.6089

\(3.522\times e^{-6}\)

60

0.5872

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

85

0.5782

\(1.016\times e^{-14}\)

100

0.5743

Successful

200

0.5595

Successful

500

0.5427

Successful

1000

0.5313

Successful

1500

0.5251

Successful

2000

0.5207

Successful