Simpler is also better in approximating fixed points

Show simple item record

contributor.author Abbas, M. en_US
contributor.author Khan, Safeer Hussain en_US
contributor.author Rhoades, B.E. en_US
date.accessioned 2009-12-28T08:36:48Z en_US
date.available 2009-12-28T08:36:48Z en_US
date.issued 2008-08-19 en_US
identifier.citation Abbas, M., Khan, S. H., & Rhoades, B. E. (2008). Simpler is also better in approximating fixed points. Applied Mathematics and Computation, 205(1), 428–431 en_US
identifier.uri http://dx.doi.org/10.1016/j.amc.2008.08.021 en_US
identifier.uri http://hdl.handle.net/10576/10521 en_US
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
language.iso en en_US
publisher Elsevier en_US
subject Asymptotically nonexpansive en_US
subject Fixed points en_US
subject Krasnoselskij en_US
title Simpler is also better in approximating fixed points en_US
type Article en_US


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record