Skip to main content

Table 3 Numerical results for Example  5.3 ( \(\pmb{\rho=\rho_{n}=0.001}\) )

From: New strong convergence theorems for split variational inclusion problems in Hilbert spaces

\(\boldsymbol{x_{1}=(1,1)^{\top}}\)

\(\boldsymbol{\varepsilon=10^{-3}}\)

\(\boldsymbol{\varepsilon=10^{-4}}\)

Time

Iteration

Approximate solution

Time

Iteration

Approximate solution

Algorithm 1.2

0.02

40

(1.540193,−0.5400902)

0.04

162

(1.515364,−0.5153539)

Theorem 1.1

≤

7

(0.5038810,0.4956130)

0.33

3,658

(1.3762567,−0.3763273899)

\(\boldsymbol{x_{1}=(1,1)^{\top}}\)

\(\boldsymbol{\varepsilon=10^{-5}}\)

\(\boldsymbol{\varepsilon=10^{-6}}\)

Time

Iteration

Approximate solution

Time

Iteration

Approximate solution

Algorithm 1.2

0.19

697

(1.504028,−0.5040270)

0.55

2,233

(1.500311,−0.5003114)

Theorem 1.1

0.76

7,689

(1.4876280,−0.4876350226)

1.38

11,719

(1.4987623,−0.4987630241)

\(\boldsymbol{x_{1}=(1,1)^{\top}}\)

\(\boldsymbol{\varepsilon=10^{-7}}\)

\(\boldsymbol{\varepsilon=10^{-8}}\)

Time

Iteration

Approximate solution

Time

Iteration

Approximate solution

Algorithm 1.2

1.06

4,175

(1.499761,−0.4997615)

1.32

5,188

(1.499727,−0.4997275)

Theorem 1.1

2.06

15,750

(1.4998763,−0.4998763253)

2.83

19,781

(1.4999876,−0.4999876348)