Computing the fixed points of strictly pseudocontractive mappings by the implicit and explicit iterations (Q448665): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / review text
 
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.
Property / review text: 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. / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 47J25 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 47H09 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6078714 / rank
 
Normal rank

Revision as of 10:43, 30 June 2023

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
    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

    Identifiers