Computing the fixed points of strictly pseudocontractive mappings by the implicit and explicit iterations (Q448665): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1155/2012/315835 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2150158377 / rank | |||
Normal rank | |||
Revision as of 02:11, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing the fixed points of strictly pseudocontractive mappings by the implicit and explicit iterations |
scientific article |
Statements
Computing the fixed points of strictly pseudocontractive mappings by the implicit and explicit iterations (English)
0 references
7 September 2012
0 references
Summary: It is known that strictly pseudocontractive mappings have more powerful applications than nonexpansive mappings in solving inverse problems. In this paper, we study computing the fixed points of strictly pseudocontractive mappings by iterations. Two iterative methods (one implicit and another explicit) for finding the fixed point of strictly pseudocontractive mappings are constructed in Hilbert spaces. As special cases, we can use these two methods to find the minimum norm fixed point of strictly pseudocontractive mappings.
0 references
