A fixed point theorem involving rational expressions without using Picard iteration (Q2245121): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A general fixed point theorem for involutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4369835 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2732567 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4366427 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4791316 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3601256 / rank
 
Normal rank

Latest revision as of 03:46, 27 July 2024

scientific article
Language Label Description Also known as
English
A fixed point theorem involving rational expressions without using Picard iteration
scientific article

    Statements

    A fixed point theorem involving rational expressions without using Picard iteration (English)
    0 references
    0 references
    15 November 2021
    0 references
    In accordance with the ideas used in [\textit{J. Górnicki} and \textit{B. E. Rhoades}, Indian J. Pure Appl. Math. 27, 13--23 (1996; Zbl 0847.47038)] and [\textit{E. Karapınar}, Results Nonlinear Anal. 4, 127--129 (2021)], the author establishes a convergence result (Theorem 6) for the Krasnosel'skij iteration [\textit{M. A. Krasnosel'skij}, Usp. Mat. Nauk 10, 123--127 (1955; Zbl 0064.12002)] \[ x_{p+1}=\frac{1}{2}\left(x_p+T x_{p}\right), \] where \(T: C\rightarrow C\) is a self mapping of a nonempty closed and convex subset \(C\) of a Banach space \(X\). It is proved that, if \(T\) satisfies orbitally a certain contraction condition of rational type, then the limit of the sequence \(\{x_p\}\) converges to a fixed point of \(T\). The corresponding uniqueness result is presented in Theorem 7.
    0 references
    Banach space
    0 references
    self mapping
    0 references
    fixed point
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers