Approximating the zeros of accretive operators by the Ishikawa iteration process (Q1809716)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1370618
Language Label Description Also known as
default for all languages
No label defined
    English
    Approximating the zeros of accretive operators by the Ishikawa iteration process
    scientific article; zbMATH DE number 1370618

      Statements

      Approximating the zeros of accretive operators by the Ishikawa iteration process (English)
      0 references
      0 references
      0 references
      4 October 2000
      0 references
      Given a Banach space \(X\) and an operator \(A:X\to X\), the Ishikawa iteration \(\{x_n\}\) is defined by \(x_{n+1}=x_n-\alpha_n Ay_n-\alpha_n\beta_n Ax_n\), \(y_n=x_n-\beta_n Ax_n\). A main result states, if \(X\) is uniformly smooth, \(A\) is bounded and accretive, and the equation \(Ax=0\) has at least a solution, then the iteration process converges to a solution to the equation. Given a convex, closed subset \(C\) of \(X\) and an operator \(T:C\to C\), the Ishikawa iteration is rephrased to \(x_{n+1}=(1-\alpha_n)x_n+\alpha_n Ty_n\), \(y_n=(1-\beta_n)x_n+\beta_n Tx_n\). Another main result states, if \(X\) is uniformly smooth, \(C\) is bounded, \(T\) is nonexpansive, and the equation \(x=Tx\) has at least a solution, then the iteration process converges to a solution to the equation.
      0 references
      Ishikawa iteration
      0 references
      accretive operator
      0 references
      nonexpansive operator
      0 references

      Identifiers