Explicit Algorithm for Hammerstein Equations with Bounded, Hemi-Continuous and Monotone Mappings

Authors

  • J. T. Mendy, Moustapha Sene, Ngalla Djitte Author

Keywords:

Maximal monotone mapping, Hammerstein equations, iterative methods.

Abstract

Let E be a reflexive smooth and strictly convex real Banach space and E∗ its dual. Let F: E E∗andK:E∗ E bebounded hemi-continuous mappings such that D(F) = E and R(F) = D(K) = E∗. Suppose that the Hammerstein equation u + KFu = 0 has a solution in E. We present in this paper a method containing an auxiliary mapping, defined on an appropriate Banach space in terms of F and K and which is maximal monotone. The solutions of the Hammerstein equation are derived from the zeros of this map. Our method provides
 an implicit algorithm and explicit one that converge strongly to a solution of the equation u +KFu = 0. No invertibility assumption is imposed on K and the operator F need not be defined on a compact subset of E. Our theorems improve and unify most of the results
 that have been proved in this direction for this important class of nonlinear mappings. Finally, illustration of the proposed method is given in Lp spaces

Downloads

Download data is not yet available.

Downloads

Published

2017-07-05

How to Cite

Explicit Algorithm for Hammerstein Equations with Bounded, Hemi-Continuous and Monotone Mappings. (2017). Minimax Theory and Its Applications, 2(2), 319–343. https://journalmta.com/index.php/jmta/article/view/33