Approximating fixed points of nonexpansive type mappings via general picard-mann algorithm

HIGHLIGHTS

  • who: Rahul Shukla and Rekha Panicker from the Department of Mathematical Sciences and Computing, Walter Sisulu University, Mthatha, South Africa have published the paper: Approximating Fixed Points of Nonexpansive Type Mappings via General Picard-Mann Algorithm, in the Journal: Computation 2022, 10, 151. of /2022/
  • what: The aim of this paper is to approximate fixed points of nonexpansive type mappings in Banach spaces when the set of fixed points is nonempty. The authors provide an example to illustrate the convergence behaviour of the GPM algorithm. The authors compare the GPM algorithm with other existing (well . . .

     

    Logo ScioWire Beta black

    If you want to have access to all the content you need to log in!

    Thanks :)

    If you don't have an account, you can create one here.

     

Scroll to Top

Add A Knowledge Base Question !

+ = Verify Human or Spambot ?