From: Hybrid steepest iterative algorithm for a hierarchical fixed point problem
 | \(\boldsymbol{u_{1}=-10}\) | \(\boldsymbol{u_{1}=10}\) | ||
---|---|---|---|---|
\(\boldsymbol{u_{n}}\) | \(\boldsymbol{v_{n}}\) | \(\boldsymbol{u_{n}}\) | \(\boldsymbol{v_{n}}\) | |
n = 1 | −10.0000 | −14.5154 | 10.0000 | 14.6347 |
n = 2 | −7.0467 | −7.0467 | 7.8560 | 7.8997 |
n = 3 | −2.7768 | −2.7268 | 5.2941 | 5.2981 |
n = 4 | −1.0152 | −1.0152 | 2.0321 | 2.0431 |
n = 5 | −0.3254 | −0.3252 | 0.8356 | 0.8436 |
n = 6 | −0.0703 | −0.0703 | 0.3587 | 0.3487 |
n = 7 | −0.0458 | −0.0458 | 0.1662 | 0.1689 |
n = 8 | −0.0492 | −0.0429 | 0.0889 | 0.0989 |
n = 9 | −0.0399 | −0.0399 | 0.0571 | 0.0671 |
n = 10 | −0.0327 | −0.0372 | 0.0429 | 0.0429 |
n = 11 | −0.0298 | −0.0331 | 0.0357 | 0.0375 |
n = 12 | −0.0297 | −0.0289 | 0.0315 | 0.0351 |
n = 13 | −0.0146 | −0.0279 | 0.0286 | 0.0211 |
n = 14 | −0.0118 | −0.0164 | 0.0224 | 0.0200 |
n = 15 | −0.0109 | −0.0131 | 0.0207 | 0.0198 |