Simpler is also better in approximating fixed points

QSpace/Manakin Repository

Simpler is also better in approximating fixed points

Show simple item record


dc.contributor.author Abbas, M.
dc.contributor.author Khan, S.H.
dc.contributor.author Rhoades, B.E.
dc.date.accessioned 2009-12-28T08:36:48Z
dc.date.available 2009-12-28T08:36:48Z
dc.date.issued 2008-08-19
dc.identifier.citation Volume 205, Issue 1, 1 November 2008, Pages 428-431 en_US
dc.identifier.uri http://dx.doi.org/10.1016/j.amc.2008.08.021
dc.identifier.uri http://hdl.handle.net/10576/10521
dc.description.abstract In this paper we demonstrate that a number of fixed point iteration problems can be solved using a modified Krasnoselskij iteration process, which is much simpler to use than the other iteration schemes that have been defined en_US
dc.language.iso en en_US
dc.subject Asymptotically nonexpansive en_US
dc.subject Fixed points en_US
dc.subject Krasnoselskij en_US
dc.title Simpler is also better in approximating fixed points en_US
dc.type Article en_US

Files in this item

Files Size Format View
Simpler is also ... ximating fixed points .pdf 147.1Kb PDF View/Open

This item appears in the following Collection(s)

Show simple item record

Search QSpace


Advanced Search

Browse

My Account