Simpler is also better in approximating fixed points

Mujahid Abbas; Safeer Hussain Khan; Rhoades

doi:10.1016/j.amc.2008.08.021

Simpler is also better in approximating fixed points

Mujahid Abbas
, Safeer Hussain Khan
, Rhoades

Mathematics and Statistics

Lahore University of Management Sciences
Qatar University
Indiana University Bloomington

Research output: Contribution to journal › Article › peer-review

5 Scopus citations

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. © 2008 Elsevier Inc. All rights reserved.

Original language	English
Pages (from-to)	428-431
Number of pages	4
Journal	Applied Mathematics and Computation
Volume	205
Issue number	1
DOIs	https://doi.org/10.1016/j.amc.2008.08.021
State	Published - Nov 1 2008

Keywords

Asymptotically nonexpansive
Fixed points
Krasnoselskij

Access to Document

10.1016/j.amc.2008.08.021

Cite this

@article{27626052a5814f4997c4013a4a079b19,

title = "Simpler is also better in approximating fixed points",

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. {\textcopyright} 2008 Elsevier Inc. All rights reserved.",

keywords = "Asymptotically nonexpansive, Fixed points, Krasnoselskij",

author = "Mujahid Abbas and Khan, \{Safeer Hussain\} and Rhoades",

year = "2008",

month = nov,

day = "1",

doi = "10.1016/j.amc.2008.08.021",

language = "English",

volume = "205",

pages = "428--431",

journal = "Applied Mathematics and Computation",

issn = "0096-3003",

number = "1",

}

TY - JOUR

T1 - Simpler is also better in approximating fixed points

AU - Abbas, Mujahid

AU - Khan, Safeer Hussain

AU - Rhoades, null

PY - 2008/11/1

Y1 - 2008/11/1

N2 - 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. © 2008 Elsevier Inc. All rights reserved.

AB - 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. © 2008 Elsevier Inc. All rights reserved.

KW - Asymptotically nonexpansive

KW - Fixed points

KW - Krasnoselskij

UR - https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=54049127665&origin=inward

UR - https://www.scopus.com/inward/citedby.uri?partnerID=HzOxMe3b&scp=54049127665&origin=inward

U2 - 10.1016/j.amc.2008.08.021

DO - 10.1016/j.amc.2008.08.021

M3 - Article

SN - 0096-3003

VL - 205

SP - 428

EP - 431

JO - Applied Mathematics and Computation

JF - Applied Mathematics and Computation

IS - 1

ER -

Simpler is also better in approximating fixed points

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this