Computing the Fixed Points of Strictly Pseudocontractive Mappings by the Implicit and Explicit Iterations
It is known that strictly pseudocontractive mappings have more powerful applications than nonexpansive mappings in solving inverse problems. In this paper, we devote to study computing the fixed points of strictly pseudocontractive mappings by the iterations. Two iterative methods (one implicit and...
Saved in:
Main Author: | |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2012-01-01
|
Series: | Abstract and Applied Analysis |
Online Access: | http://dx.doi.org/10.1155/2012/315835 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
_version_ | 1832556252778987520 |
---|---|
author | Yeong-Cheng Liou |
author_facet | Yeong-Cheng Liou |
author_sort | Yeong-Cheng Liou |
collection | DOAJ |
description | It is known that strictly pseudocontractive mappings have more powerful applications than nonexpansive mappings in solving inverse problems. In this paper, we devote to study computing the fixed points of strictly pseudocontractive mappings by the iterations. Two iterative methods (one implicit and another explicit) for finding the fixed point of strictly pseudocontractive mappings have been constructed in Hilbert spaces. As special cases, we can use these two methods to find the minimum norm fixed point of strictly pseudocontractive mappings. |
format | Article |
id | doaj-art-a45e6534a407416a9d7ff613bd5527f1 |
institution | Kabale University |
issn | 1085-3375 1687-0409 |
language | English |
publishDate | 2012-01-01 |
publisher | Wiley |
record_format | Article |
series | Abstract and Applied Analysis |
spelling | doaj-art-a45e6534a407416a9d7ff613bd5527f12025-02-03T05:45:56ZengWileyAbstract and Applied Analysis1085-33751687-04092012-01-01201210.1155/2012/315835315835Computing the Fixed Points of Strictly Pseudocontractive Mappings by the Implicit and Explicit IterationsYeong-Cheng Liou0Department of Information Management, Cheng Shiu University, Kaohsiung 833, TaiwanIt is known that strictly pseudocontractive mappings have more powerful applications than nonexpansive mappings in solving inverse problems. In this paper, we devote to study computing the fixed points of strictly pseudocontractive mappings by the iterations. Two iterative methods (one implicit and another explicit) for finding the fixed point of strictly pseudocontractive mappings have been constructed in Hilbert spaces. As special cases, we can use these two methods to find the minimum norm fixed point of strictly pseudocontractive mappings.http://dx.doi.org/10.1155/2012/315835 |
spellingShingle | Yeong-Cheng Liou Computing the Fixed Points of Strictly Pseudocontractive Mappings by the Implicit and Explicit Iterations Abstract and Applied Analysis |
title | Computing the Fixed Points of Strictly Pseudocontractive Mappings by the Implicit and Explicit Iterations |
title_full | Computing the Fixed Points of Strictly Pseudocontractive Mappings by the Implicit and Explicit Iterations |
title_fullStr | Computing the Fixed Points of Strictly Pseudocontractive Mappings by the Implicit and Explicit Iterations |
title_full_unstemmed | Computing the Fixed Points of Strictly Pseudocontractive Mappings by the Implicit and Explicit Iterations |
title_short | Computing the Fixed Points of Strictly Pseudocontractive Mappings by the Implicit and Explicit Iterations |
title_sort | computing the fixed points of strictly pseudocontractive mappings by the implicit and explicit iterations |
url | http://dx.doi.org/10.1155/2012/315835 |
work_keys_str_mv | AT yeongchengliou computingthefixedpointsofstrictlypseudocontractivemappingsbytheimplicitandexplicititerations |