Three-step iterations with errors for nonlinear strongly accretive operator equations (Q2508052)

From MaRDI portal
Revision as of 20:28, 24 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
Three-step iterations with errors for nonlinear strongly accretive operator equations
scientific article

    Statements

    Three-step iterations with errors for nonlinear strongly accretive operator equations (English)
    0 references
    0 references
    9 October 2006
    0 references
    The article deals with three-step iterations of the form \[ \begin{aligned} x_{n+1} &= \alpha_nx_n + \beta_nTy_n + \gamma_nu_n, \\ y_n &= \alpha_n'x_n + \beta_n'Tz_n + \gamma_n'v_n, \\ z_n &= \alpha_n''x_n + \beta_n''Tx_n + \gamma_n''w_n,\;n \in {\mathbb Z},\end{aligned} \] for approximately finding the fixed point of a strongly pseudo-contractive bounded nonlinear operator \(T: X \to X\) with a fixed point \(p\) in a real uniformly smooth Banach space \(X\). As usual, it is assumed that all numbers \(\alpha_n, \beta_n, \gamma_n, \alpha_n', \beta_n', \gamma_n', \alpha_n'', \beta_n'', \gamma_n''\) are nonnegative, \(\alpha_n + \beta_n + \gamma_n = 1\), \(\alpha_n' + \beta_n' + \gamma_n' = 1\), \(\alpha_n'' + \beta_n'' + \gamma_n'' = 1\), \(\beta_n, \beta_n', \beta_n'', \gamma_n', \gamma_n'' \to 0\), \(\sum\limits_{n=0}^\infty \gamma_n < \infty\), \(\sum\limits_{n=0}^\infty \beta_n = \infty\), and the sequences \(u_n, v_n, w_n\) are bounded. It is proved the strong convergence of \(x_n\) to the unique fixed point \(p\) of \(T\). A variant for approximately solving the equation \(Tx = f\) with a strongly accretive operator \(T\) is also considered.
    0 references
    3-step iteration process with errors
    0 references
    strongly accretive operators
    0 references
    strongly pseudocontractive operators
    0 references
    uniformly smooth Banach space
    0 references
    strong convergence
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references