Skip to main content

TableĀ 1 Table of values choosing \(x_{0}=x_{1}=0.5\)

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 0.5 0.5
3 0.2113 0.4167
10 0.1717 0.0374
16 0.1664 0.006
30 0.1623 \(2.668\times e^{-6}\)
60 0.1599 \(4.667\times e^{-11}\)
85 0.1591 \(7.703\times e^{-15}\)
100 0.1589 Successful
200 0.1579 Successful
500 0.1572 Successful
1000 0.1568 Successful
1500 0.1566 Successful
2000 0.1565 Successful