- Research
- Open Access

# Stability of *k*-step fixed point iterative methods for some Prešić type contractive mappings

- Vasile Berinde
^{1}Email author and - Mădălina Păcurar
^{2}

**2014**:149

https://doi.org/10.1186/1029-242X-2014-149

© Berinde and Păcurar; licensee Springer. 2014

**Received:**7 December 2013**Accepted:**28 March 2014**Published:**11 April 2014

## Abstract

We introduce the concept of stability of a *k*-step fixed point iterative method ${x}_{n+1}=T({x}_{n},{x}_{n-1},\dots ,{x}_{n-k+1})$, $n\ge k-1$, and study the stability of this equation for mappings $T:{X}^{k}\to X$ satisfying some Prešić type contraction conditions. Our results naturally extend various stability results of fixed point iterative methods in literature, from contractive self-mappings $T:X\to X$ to Prešić type contractive mappings $T:{X}^{k}\to X$. Illustrative examples of both stable and unstable fixed point iterations are also presented.

**MSC:**47H09, 47H10, 54H25.

## Keywords

- metric space
- contractive mapping
- fixed point
*k*-step fixed point iterative method- stability

## 1 Introduction

*T*. If $(X,d)$ is complete and

*T*is a contraction,

*i.e.*, there exists a constant $\alpha \in [0,1)$ such that

then, by the well-known Banach contraction mapping principle, we know that $Fix(T)=\{p\}$ and that, for any ${x}_{0}\in X$, the Picard iteration, that is, the sequence defined by ${x}_{n+1}=T{x}_{n}$, $n=0,1,\dots $ , converges to *p*, as $n\to \mathrm{\infty}$.

*approximate sequence*${\{{y}_{n}\}}_{n=0}^{\mathrm{\infty}}$, satisfying the following approximation bounds:

where the positive quantity ${\u03f5}_{n}$ can be interpreted as the ‘round-off error’ of ${x}_{n}$; see [1].

Under these circumstances, the problem of the *numerical stability* of Picard iteration is whether the approximate sequence ${\{{y}_{n}\}}_{n=0}^{\mathrm{\infty}}$ still converges to the fixed point *p* of *T*, provided that ${\u03f5}_{n}\to 0$ or ${\sum}_{n=1}^{\mathrm{\infty}}{\u03f5}_{n}<\mathrm{\infty}$.

from which easily follows that ${y}_{n}\to p$, provided ${\u03f5}_{n}\to 0$.

In 1988, Harder and Hicks [3, 4] introduced the notion of stability for a general fixed point iteration procedure and started a systematic study of this concept, thus obtaining various stability results for Picard iteration that extended Ostrowski’s theorem to mappings satisfying more general contractive conditions and also established some stability results for other fixed point iteration procedures (Mann iteration, Ishikawa iteration, Kirk iteration) in the class of Banach contractions, Zamfirescu operators etc.

Further, some authors, see [1, 5–17], continued the study of the stability of Picard and some other fixed point iterations for various general classes of contractive self-mappings *T*. Very recently, Rus [18, 19] introduced some alternative concepts of stability for fixed point iterative methods.

On the other hand, the contraction mapping principle has been extended by Prešić [20] to mappings $T:{X}^{k}\to X$ satisfying a contractive condition that include (1) in the particular case $k=1$. Some other Prešić type fixed point theorems have been obtained in [21–26], in the case *T* satisfies more general contractive type conditions, while in [27, 28], and [29], some applications to nonlinear cyclic systems of equations and difference equations are obtained.

As for the *k*-step fixed point iterative methods associated to Prešić type contractive conditions do not exist corresponding stability results, yet, the main aim of this paper is to fill this gap and to introduce an appropriate concept of stability and then establish some stability results. The relationship of our notion of stability to other existing concepts of stability, mainly drawn from the theory of difference equations, is also discussed.

The stability results we shall obtain in this way are extremely general. They unify, extend, generalize, enrich, and complement a multitude of related results from recent literature. Illustrative examples of both stable and unstable fixed point iterative sequences are given.

The paper is organized as follows: in Section 2 we summarize some fixed point theorems for mappings satisfying Prešić type contractive conditions, in Section 3 we present the basic concepts and results concerning the stability of fixed point iteration procedures associated to self-mappings that satisfy explicit contractive conditions. In Section 4, the main stability results of this paper are presented. In Section 5, we end this paper by presenting three detailed examples of stable (Examples 1 and 2) and unstable (Example 3) fixed point iterations.

## 2 Fixed point theorems for Prešić type mappings

All the stability results mentioned in the previous section were basically established in connection with a corresponding fixed point theorem: Banach, Kannan, Chatterjea, Zamfirescu etc.; see for example [15] for more details.

We start by presenting one of the most interesting generalizations of Banach’s contraction mapping principle for mappings $T:{X}^{k}\to X$, obtained in 1965 by Prešić [20], which will be fundamental in establishing our stability results for *k*-step fixed point iterative methods in the present paper.

**Theorem 1** (Prešić [20], 1965)

*Let*$(X,d)$

*be a complete metric space*,

*k*

*a positive integer*, ${\alpha}_{1},{\alpha}_{2},\dots ,{\alpha}_{k}\in {\mathbb{R}}_{+}$, $\stackrel{k}{\sum _{i=1}}{\alpha}_{i}=\alpha <1$

*and*$T:{X}^{k}\to X$

*a mapping satisfying*

*for all* ${x}_{0},\dots ,{x}_{k}\in X$.

*Then*:

- (1)
*T**has a unique fixed point*${x}^{\ast}$,*that is*,*there exists a unique*${x}^{\ast}\in X$*such that*$f({x}^{\ast},\dots ,{x}^{\ast})={x}^{\ast}$; - (2)
*the sequence*${\{{x}_{n}\}}_{n\ge 0}$*defined by*${x}_{n+1}=T({x}_{n},\dots ,{x}_{n-k+1}),\phantom{\rule{1em}{0ex}}n=k-1,k,k+1,\dots $(4)

*converges to* ${x}^{\ast}$, *for any* ${x}_{0},\dots ,{x}_{k-1}\in X$.

*k*-step iterative method (4) reduces to Picard iteration:

Theorem 1 and other similar results, like the ones in [21, 23, 24, 26], have important applications in the iterative solution of nonlinear equations, see [30] and [28, 31, 32], as well as in the study of global asymptotic stability of the equilibrium for nonlinear difference equations; see the very recent paper [29].

*T*fulfilling the more general condition

for any ${x}_{0},\dots ,{x}_{k}\in X$, where $\phi :{\mathbb{R}}_{+}^{k}\to {\mathbb{R}}_{+}$ satisfies certain appropriate conditions.

for any ${x}_{0},\dots ,{x}_{k}\in X$, where $\lambda \in (0,1)$.

Other general Prešić type fixed point results have been very recently obtained by the second author in [22, 23, 25, 33] based on the contractive condition (18), studied in [23], which is more general than (7), (6) and (3).

## 3 Some useful lemmas

In order to obtain simple and short proofs for our main results in this paper we shall need some auxiliary lemmas. A proof of the following lemma can be found in [34]; see also [35].

**Lemma 1** (Cauchy)

*Let*${\{{a}_{n}\}}_{n=0}^{\mathrm{\infty}}$, ${\{{b}_{n}\}}_{n=0}^{\mathrm{\infty}}$

*be sequences of nonnegative numbers satisfying*

*Then*

**Lemma 2**

*Let*

*k*

*be a positive integer and*${\{{a}_{n}\}}_{n=0}^{\mathrm{\infty}}$, ${\{{b}_{n}\}}_{n=0}^{\mathrm{\infty}}$

*two sequences of nonnegative real numbers satisfying the inequality*

*where* ${\alpha}_{1},\dots ,{\alpha}_{k}\in [0,1)$ *and* ${\alpha}_{1}+\cdots +{\alpha}_{k}<1$. *If* ${lim}_{n\to \mathrm{\infty}}{b}_{n}=0$, *then* ${lim}_{n\to \mathrm{\infty}}{a}_{n}=0$.

*Proof* For simplicity, we prove lemma for $k=2$, when we denote ${\alpha}_{1}:=\alpha $ and ${\alpha}_{2}:=\beta $. All arguments used below work unchanged in the general case, too.

then the series ${\sum}_{n=0}^{\mathrm{\infty}}{u}_{n}$ converges.

Indeed, the characteristic equation corresponding to the linear difference equation (9) has two distinct real roots, ${r}_{1},{r}_{2}\in (-1,1)$, since, if we denote $f(r):={r}^{2}-\alpha r-\beta $, we have $f(-1)>0$, $f(1)>0$.

Hence, ${u}_{n}={c}_{1}{r}_{1}^{n}+{c}_{2}{r}_{2}^{n}$, where ${c}_{1}$, ${c}_{2}$ are two constants, and so the convergence of ${\sum}_{n=0}^{\mathrm{\infty}}{u}_{n}$ follows by the convergence of the geometric progression series ${\sum}_{n=0}^{\mathrm{\infty}}{q}^{n}$, with $-1<q<1$.

has all its roots (not always real) in absolute value in the interval $[0,1)$, by virtue of a consequence of the Rouché theorem, see [36], which reads as follows.

*n*(counted with multiplicity) roots of absolute value less than

*R*, where

Now apply Lemma 1 to get the desired conclusion. □

**Remark 1** Note that for $k=1$, by Lemma 2 we obtain Theorem 2.1 in [37], a result which is fundamental for obtaining short proofs of stability theorems for one step fixed point iterative methods that has been used in [12, 13, 15], and [17].

## 4 Stability of *k*-step fixed point iteration procedures

We first recall some concepts of stability for 1-step fixed point iteration procedures, before we consider the stability of a *k*-step fixed point iteration procedure.

where $f(T,{x}_{n})$ is given, which converges to a fixed point *p* of *T* (for example, in the case of Picard iteration we have $f(T,{x}_{n}):=T{x}_{n}$).

**Definition 1** (Harder and Hicks, [3])

*X*and set

*T-stable*or

*stable with respect to*

*T*if

As Picard iteration and other fixed point iteration procedures are not stable with respect to some classes of contractive operators, various weak stability concepts have also been introduced; see [9, 11, 12, 15]. For example Osilike [9] introduced the concept of *almost stability*, while Berinde [12] introduced the concept of *summable almost stability*, two notions which are presented in the following.

**Definition 2** (Osilike, [9])

*p*of

*T*. Let ${\{{y}_{n}\}}_{n=0}^{\mathrm{\infty}}$ be an arbitrary sequence in

*X*and let $\{{\epsilon}_{n}\}$ be defined by (11). We shall say that the fixed point iteration procedure (10) is

*almost*

*T-stable*or

*almost stable with respect to*

*T*if

**Definition 3** (Berinde, [13])

*p*of

*T*. Let ${\{{y}_{n}\}}_{n=0}^{\mathrm{\infty}}$ be an arbitrary sequence in

*X*and let $\{{\epsilon}_{n}\}$ be defined by (11). We shall say that the fixed point iteration procedure (10) is

*summable almost*

*T-stable*or

*summable almost stable with respect to*

*T*if

- (1)
any stable iteration procedure is almost stable;

- (2)
any summable almost stable procedure is almost stable,

but the reverses of these assertions are not generally true; see Example 1 in [13]. Moreover, in general, the class of stable iteration procedures is independent of the class of summable almost stable procedures.

We introduce now the concept of stability for a *k*-step fixed point iteration procedure.

**Definition 4**Let $(X,d)$ be a metric space,

*k*a positive integer, $T:{X}^{k}\to X$ a mapping with $Fix(T)=\{x\in X:T(x,\dots ,x)=x\}\ne \mathrm{\varnothing}$ and let ${\{{x}_{n}\}}_{n=0}^{\mathrm{\infty}}$ be a

*k*-step fixed point iteration procedure of the general form

*p*of

*T*. Let ${\{{y}_{n}\}}_{n=0}^{\mathrm{\infty}}$ be an arbitrary sequence in

*X*and set

*T-stable*or

*stable with respect to*

*T*if

**Remark 2** For $k=1$, by Definition 4 we get exactly Definition 1.

The main result of this paper is the following theorem, which establish a stability result that corresponds to the fixed point theorem for Prešić-Kannan contractive mappings ([23], Theorem 2).

**Theorem 2**

*Let*$(X,d)$

*be a complete metric space*,

*k*

*a positive integer*, $a\in \mathbb{R}$

*a constant such that*$0<ak(k+1)<1$

*and*$T:{X}^{k}\to X$

*a mapping satisfying the following contractive type condition*:

*for any* ${x}_{0},{x}_{1},\dots ,{x}_{k}\in X$.

*Then*:

- (1)
*T**has a unique fixed point*${x}^{\ast}$,*that is*,*there exists a unique*${x}^{\ast}\in X$*such that*$T({x}^{\ast},\dots ,{x}^{\ast})={x}^{\ast}$; - (2)
*The sequence*${\{{x}_{n}\}}_{n\ge 0}$*with*${x}_{0},\dots ,{x}_{k-1}\in X$*and*${x}_{n}=T({x}_{n-k},{x}_{n-k+1},\dots ,{x}_{n-1}),\phantom{\rule{1em}{0ex}}n\ge k,$(19)

*converges to*${x}^{\ast}$;

- (3)
*The**k*-*step iteration*${\{{x}_{n}\}}_{n\ge 0}$*given by*(19)*is**T*-*stable*.

*Proof*Items (1) and (2) follow by Theorem 2 in [23]. Now let ${\{{y}_{n}\}}_{n=0}^{\mathrm{\infty}}$ be an arbitrary sequence in

*X*and denote

*j*we have, by the triangle inequality,

where, by hypothesis, $A=\frac{ak(k+1)}{2}<\frac{1}{2}$.

*T*, by taking $x:={x}^{\ast}$ and $y:={x}_{j}$ in (24) we have

since $A=\frac{ak(k+1)}{2}<\frac{1}{2}$, by hypothesis.

Now, assume ${lim}_{n\to \mathrm{\infty}}{\epsilon}_{n}=0$. By applying Lemma 2 with ${a}_{n}:=d({y}_{n},{x}^{\ast})$ and ${b}_{n}:={\epsilon}_{n}$, by virtue of (26), we conclude that $d({y}_{n+1},{x}^{\ast})\to 0$ as $n\to \mathrm{\infty}$, that is, the *k*-step iteration ${\{{x}_{n}\}}_{n\ge 0}$ defined by (19) is *T*-stable. □

A similar stability result can be obtained for mappings *T* satisfying a more general contractive condition than (18).

Denote $Fix(T)=\{x\in X:T(x,x,\dots ,x)=x\}$.

**Theorem 3**

*Let*$(X,d)$

*be a metric space*,

*k*

*a positive integer and*$T:{X}^{k}\to X$

*a mapping with the property that*$Fix(T)\ne \mathrm{\varnothing}$

*for which there exist*${\alpha}_{1},{\alpha}_{2},\dots ,{\alpha}_{k}\in {\mathbb{R}}_{+}$, ${\sum}_{i=1}^{k}{\alpha}_{i}=\alpha <1$

*satisfying*

*for all* ${x}_{0},\dots ,{x}_{k-1}\in X$ *and some* ${x}^{\ast}\in Fix(T)$. *Then the* *k*-*step iteration* ${\{{x}_{n}\}}_{n\ge 0}$ *defined by* (4) *is* *T*-*stable*.

*Proof*Let ${\{{y}_{n}\}}_{n=0}^{\mathrm{\infty}}$ be an arbitrary sequence in

*X*and denote

and the rest of the proof is similar to that of Theorem 2. □

**Remark 3** It is clear by the proof of Theorem 2 that if *T* satisfies (18) then *T* also satisfies (27), but the reverse is not true, as shown by Example 2.

Another general stability result is given by the next theorem.

**Theorem 4**

*Let*$(X,d)$

*be a metric space*,

*k*

*a positive integer and*$T:{X}^{k}\to X$

*a mapping with the property that*$Fix(T)\ne \mathrm{\varnothing}$

*and for which there exist*${\alpha}_{1},{\alpha}_{2},\dots ,{\alpha}_{k}\in {\mathbb{R}}_{+}$, ${\sum}_{i=1}^{k}{\alpha}_{i}=\alpha <1$

*and a constant*$L>0$

*such that*

*for all* ${x}_{0},\dots ,{x}_{k},x\in X$. *Then the* *k*-*step iteration* ${\{{x}_{n}\}}_{n\ge 0}$ *defined by* (4) *is* *T*-*stable*.

*Proof*Let ${\{{y}_{n}\}}_{n=0}^{\mathrm{\infty}}$ be an arbitrary sequence in

*X*and denote

since ${x}^{\ast}=T({x}^{\ast},\dots ,{x}^{\ast})$. The rest of the proof follows similarly to the proof of Theorem 2. □

## 5 Examples and concluding remarks

**Example 1** ([23], Example 1)

Then, see the detailed proof in [23], *T* satisfies (18) but does not satisfy (3), (6) and (7). Hence by Theorem 2 it follows that the *k*-step fixed point iteration (19) is *T*-stable.

To show that (18) holds, while (3), (6), (7) do not hold; see the detailed proof in [23].

**Example 2**Let $X=\mathbb{R}$ with the usual metric and $T:{X}^{2}\to X$ be defined by

It is easy to check that *T* satisfies condition (3) (with ${\alpha}_{1}=\frac{1}{4}$, ${\alpha}_{2}=\frac{1}{2}$), condition (6) (with $\phi ({t}_{1},{t}_{2})=\frac{1}{4}{t}_{1}+\frac{1}{2}{t}_{2}$), condition (7) (with $\lambda =\frac{3}{4}$) and condition (27) (with ${\alpha}_{1}=\frac{1}{4}$, ${\alpha}_{2}=\frac{1}{2}$) but does not satisfy (18).

a contradiction, since, by hypothesis, $a<\frac{1}{6}$. Hence by Theorem 3 or Theorem 4 (but not by Theorem 2) it follows that the *k*-step fixed point iteration (19) is *T*-stable.

The next example illustrates unstable fixed point iterations, in the case neither (18) nor (27) is satisfied.

**Example 3** Consider the case $k=1$ (in order to graph the orbits), $X=[-\frac{3}{2},\frac{1}{2}]$ with the Euclidean norm and let $T:X\to X$ be given by $Tx=2{x}^{2}+2x-1$, for all $x\in X$.

*T*does not satisfy (3), (18), (27), and (30), $Fix(T)=\{-1,\frac{1}{2}\}$ and the orbits of ${x}_{0}=0.49$ under

*T*behave chaotic; see Figure 1.

*i.e.*,

*x*and

*y*, (18) and (30) are not satisfied. Now, assume that (27) holds for ${x}^{\ast}=-1$,

*i.e.*,

and take $x=0$, to get the contradiction $1\le {\alpha}_{1}<1$.

Note that for ${x}_{0}=0.5$ we obtain a convergent (and constant) sequence, ${x}_{n}=0.5$, $n\ge 0$, while for ${x}_{0}$ as close as possible to 0.5 but different of 0.5 we have always unstable orbits $\{{x}_{n}\}$.

Similar approaches to those in the present paper can be done for mappings defined on product spaces but adapted from the ones in the usual case; see the recent related fixed point results [38–42], and [43].

## Declarations

### Acknowledgements

The authors research was supported by the Grant PN-II-RU-TE-2011-3-239 of the Romanian Ministry of Education and Research. The first author was also supported by the Grant PN-II-ID-PCE-2011-3-0087 of the Romanian Ministry of Education and Research.

## Authors’ Affiliations

## References

- Jachymski JR:
**An extension of A. Ostrowski’s theorem on the round-off stability of iterations.***Aequ. Math.*1997,**53**(3):242–253.MATHMathSciNetView ArticleGoogle Scholar - Ostrowski AM:
**The round-off stability of iterations.***Z. Angew. Math. Mech.*1967,**47:**77–81. 10.1002/zamm.19670470202MATHMathSciNetView ArticleGoogle Scholar - Harder AM, Hicks TL:
**A stable iteration procedure for nonexpansive mappings.***Math. Jpn.*1988,**33**(5):687–692.MATHMathSciNetGoogle Scholar - Harder AM, Hicks TL:
**Stability results for fixed point iteration procedures.***Math. Jpn.*1988,**33**(5):693–706.MATHMathSciNetGoogle Scholar - Rhoades BE:
**Fixed point theorems and stability results for fixed point iteration procedures.***Indian J. Pure Appl. Math.*1990,**21**(1):1–9.MATHMathSciNetGoogle Scholar - Rhoades BE:
**Some fixed point iteration procedures.***Int. J. Math. Math. Sci.*1991,**14**(1):1–16. 10.1155/S0161171291000017MATHMathSciNetView ArticleGoogle Scholar - Rhoades BE:
**Fixed point theorems and stability results for fixed point iteration procedures. II.***Indian J. Pure Appl. Math.*1993,**24**(11):691–703.MATHMathSciNetGoogle Scholar - Osilike MO:
**Stability results for fixed point iteration procedures.***J. Niger. Math. Soc.*1995/1996,**14/15:**17–29.MathSciNetGoogle Scholar - Osilike MO:
**Stability of the Mann and Ishikawa iteration procedures for**ϕ**-strong pseudocontractions and nonlinear equations of the**ϕ**-strongly accretive type.***J. Math. Anal. Appl.*1998,**227**(2):319–334. 10.1006/jmaa.1998.6075MATHMathSciNetView ArticleGoogle Scholar - Osilike MO, Udomene A:
**Short proofs of stability results for fixed point iteration procedures for a class of contractive-type mappings.***Indian J. Pure Appl. Math.*1999,**30**(12):1229–1234.MATHMathSciNetGoogle Scholar - Zhou HY, Chang S-S, Cho YJ:
**Weak stability of the Ishikawa iteration procedures for**ϕ**-hemicontractions and accretive operators.***Appl. Math. Lett.*2001,**14**(8):949–954. 10.1016/S0893-9659(01)00070-2MATHMathSciNetView ArticleGoogle Scholar - Berinde V:
**On the stability of fixed point iteration procedures.***Bul. Ştiinţ. - Univ. Baia Mare, Ser. B Fasc. Mat.-Inform.*2002,**18**(1):7–12.MATHMathSciNetGoogle Scholar - Berinde V:
**Summable almost stability of fixed point iteration procedures.***Carpath. J. Math.*2003,**19**(2):81–88.MATHMathSciNetGoogle Scholar - Imoru C, Olatinwo MO:
**On the stability of Picard and Mann iteration processes.***Carpath. J. Math.*2003,**19**(2):155–160.MATHMathSciNetGoogle Scholar - Berinde V:
*Iterative Approximation of Fixed Points*. Springer, Berlin; 2007.MATHGoogle Scholar - Qing Y, Rhoades BE: T
**-stability of Picard iteration in metric spaces.***Fixed Point Theory Appl.*2008.,**2008:**Article ID 418971Google Scholar - Olatinwo MO:
**Some stability results in complete metric space.***Acta Univ. Palacki. Olomuc., Fac. Rerum Nat., Math.*2009,**48:**83–92.MATHMathSciNetGoogle Scholar - Rus IA:
**An abstract point of view on iterative approximation of fixed points: impact on the theory of fixed point equations.***Fixed Point Theory*2012,**13**(1):179–192.MATHMathSciNetGoogle Scholar - Rus IA:
**Properties of the solutions of those equations for which Krasnoselskii iteration converges.***Carpath. J. Math.*2012,**28**(2):329–336.MATHMathSciNetGoogle Scholar - Prešić SB:
**Sur une classe d’inéquations aux différences finites et sur la convergence de certaines suites.***Publ. Inst. Math. (Belgr.)*1965,**5**(19):75–78.Google Scholar - Cirić LB, Prešić SB:
**On Prešić type generalization of the Banach contraction mapping principle.***Acta Math. Univ. Comen.*2007,**76**(2):143–147.MATHGoogle Scholar - Păcurar M:
*Iterative Methods for Fixed Point Approximation*. Risoprint, Cluj-Napoca; 2010.Google Scholar - Păcurar M:
**A multi-step iterative method for approximating fixed points of Prešić-Kannan operators.***Acta Math. Univ. Comen.*2010,**79**(1):77–88.MATHGoogle Scholar - Păcurar M:
**Approximating common fixed points of Prešić-Kannan type operators by a multi-step iterative method.***An. Univ. “Ovidius” Constanţa, Ser. Mat.*2009,**17**(1):153–168.Google Scholar - Păcurar M:
**Fixed points of almost Prešić operators by a**k**-step iterative method.***An. Ştiinţ. Univ. ‘Al.I. Cuza’ Iaşi, Mat.*2011,**57:**199–210.MATHGoogle Scholar - Rus IA:
**An iterative method for the solution of the equation**$x=f(x,\dots ,x)$**.***Rev. Anal. Numér. Théor. Approx.*1981,**10**(1):95–100.MATHMathSciNetGoogle Scholar - Berinde V, Păcurar M:
**An iterative method for approximating fixed points of Prešić nonexpansive mappings.***Rev. Anal. Numér. Théor. Approx.*2009,**38**(2):144–153.MATHMathSciNetGoogle Scholar - Berinde V, Păcurar M:
**Two elementary applications of some Prešić type fixed point theorems.***Creative Math. Inform.*2011,**20**(1):32–42.Google Scholar - Chen Y-Z:
**A Prešić type contractive condition and its applications.***Nonlinear Anal.*2009,**71:**e2012-e2017. 10.1016/j.na.2009.03.006MATHView ArticleGoogle Scholar - Păvăloiu I:
*Rezolvarea ecuaţiilor prin interpolare*. Editura Dacia, Cluj-Napoca; 1981.Google Scholar - Păvăloiu I, Pop N:
*Interpolare şi aplicaţii*. Risoprint, Cluj-Napoca; 2005.MATHGoogle Scholar - Berinde V, Păcurar M:
**O metodă de tip punct fix pentru rezolvarea sistemelor ciclice.***Gaz. Mat., Ser. B*2011,**116**(3):113–123.Google Scholar - Păcurar M:
**A multi-step iterative method for approximating common fixed points of Prešić-Rus type operators on metric spaces.***Stud. Univ. Babeş–Bolyai, Math.*2010,**55**(1):149–162.MATHGoogle Scholar - Berinde V:
**A note on a difference inequality used in the iterative approximation of fixed points.***Creative Math. Inform.*2009,**18**(1):6–9.MATHMathSciNetGoogle Scholar - Rus IA, Şerban MA:
**Some generalizations of a Cauchy lemma and applications.**In*Topics in Mathematics, Computer Science and Philosophy*. Edited by: Cobzas S. Cluj University Press, Cluj-Napoca; 2008:173–181.Google Scholar - Wikipedia: Properties of polynomial roots. http://en.wikipedia.org/wiki/Properties_of_polynomial_rootsGoogle Scholar
- Berinde V:
**On a family of first order difference inequalities used in the iterative approximation of fixed points.***Creative Math. Inform.*2009,**18**(2):110–122.MATHMathSciNetGoogle Scholar - Berinde V:
**Convergence theorems for fixed point iterative methods defined as admissible perturbations of a nonlinear operator.***Carpath. J. Math.*2013,**29**(1):9–18.MATHMathSciNetGoogle Scholar - Choban MM:
**Fixed points for mappings defined on pseudometric spaces.***Creative Math. Inform.*2013,**22**(2):173–184.MATHMathSciNetGoogle Scholar - Harjani J, Sabetghadam F, Sadarangani K:
**Fixed point theorems for cyclic weak contractions in partially ordered sets endowed with a complete metric.***Carpath. J. Math.*2013,**29**(2):179–186.MATHMathSciNetGoogle Scholar - Păcurar M:
**Common fixed points for almost Prešić type operators.***Carpath. J. Math.*2012,**28**(1):117–126.MATHGoogle Scholar - Popa V:
**On some fixed point theorems for implicit almost contractive mappings.***Carpath. J. Math.*2013,**29**(2):223–229.MATHGoogle Scholar - Rus IA, Şerban M-A:
**Basic problems of the metric fixed point theory and the relevance of a metric fixed point theorem.***Carpath. J. Math.*2013,**29**(2):239–258.MATHGoogle Scholar

## Copyright

This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly credited.