Some generalized fixed point results in a b-metric space and application to matrix equations

Size: px
Start display at page:

Download "Some generalized fixed point results in a b-metric space and application to matrix equations"

Transcription

1 Pathak et al. Fixed Point Theory and Applications (2015) 2015:101 DOI /s RESEARCH Open Access Some generalized fixed point results in a b-metric space and application to matrix equations Hemant Kumar Pathak1, Reny George2,3*, Hossam A Nabwey2,4, Mahdy S El-Paoumy2,5 and Kaivatath Puthalath Reshma6,7 * Correspondence: 2 Department of Mathematics, College of Science, Salman bin Abdulaziz University, Al-Kharj, Kingdom of Saudi Arabia 3 Department of Mathematics and Computer Science, St. Thomas College, Bhilai, Chhattisgarh, India Full list of author information is available at the end of the article Abstract We have proved a generalized Presic-Hardy-Rogers contraction principle and Ciric-Presic type contraction principle for two mappings in a b-metric space. As an application, we derive some convergence results for a class of nonlinear matrix equations. Numerical experiments are also presented to illustrate the convergence algorithms. MSC: coincident point; common fixed point; b-metric space; matrix equation Keywords: 47H10 1 Introduction There appears in literature several generalizations of the famous Banach contraction principle. One such generalization was given by Presic, as follows. Theorem. Let (X, d) be a metric space, k be a positive integer, T : X k X be a mapping satisfying the following condition: d T(x, x,..., xk ), T(x, x,..., xk+ ) q d(x, x ) + q d(x, x ) + + qk d(xk, xk+ ), (. ) where x, x,..., xk+ are arbitrary elements in X and q, q,..., qk are nonnegative constants such that q +q + +qk <. Then there exists some x X such that x = T(x, x,..., x). Moreover, if x, x,..., xk are arbitrary points in X and for n N, xn+k = T(xn, xn+,..., xn+k ), then the sequence xn is convergent and lim xn = T(lim xn, lim xn,..., lim xn ). Note that for k = the above theorem reduces to the well-known Banach contraction principle. Ciric and Presic generalizing the above theorem proved the following. Theorem. Let (X, d) be a metric space, k be a positive integer, T : X k X be a mapping satisfying the following condition: d T(x, x,..., xk ), T(x, x,..., xk+ ) λ max d(x, x ), d(x, x ),..., d(xk, xk+ ), (. ) 2015 Pathak et al. This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.

2 Pathak et al. Fixed Point Theory and Applications (2015) 2015:101 Page 2 of 17 where x 1, x 2,...,x k+1 are arbitrary elements in X and λ (0, 1). Then there exists some x Xsuchthatx= T(x, x,...,x). Moreover, if x 1, x 2,...,x k are arbitrary points in X and for n N, x n+k = T(x n, x n+1,...,x n+k 1 ), then the sequence x n is convergent and lim x n = T(lim x n, lim x n,...,lim x n ). If in addition T satisfies D(T(u, u,...,u), T(v, v,...,v)) < d(u, v) for all u, v X, then x is the unique point satisfying x = T(x, x,...,x). In 4, 5 Pacurar gave a classic generalization of the above results. Later the above results were further extended and generalized by many authors (see 6 14). Generalizing the concept of metric space, Bakhtin 15 introduced the concept of b-metric space which is not necessarily Hausdorff and proved the Banach contraction principle in the setting of a b-metric space. Since then several papers have dealt with fixed point theory or the variational principle for single-valued and multi-valued operators in b-metric spaces (see and the references therein). In this paper we have proved common fixed point theorems for the generalized Presic-Hardy-Rogers contraction and Ciric-Presic contraction for two mappings in a b-metric space. Our results extend and generalize many wellknown results. As an application, we have derived some convergence results for a class of nonlinear matrix equations. Numerical experiments are also presented to illustrate the convergence algorithms. 2 Preliminaries Definition LetX be a nonempty set and d : X X 0, )satisfy: (bm1) d(x, y)=0if and only if x = y for all x, y X; (bm2) d(x, y)=d(y, x) for all x, y X; (bm3) there exists a real number s 1 such that d(x, y) sd(x, z)+d(z, y) for all x, y, z X. Then d is called a b-metric on X and (X, d) is called a b-metric space (in short bms) with coefficient s. Convergence, Cauchy sequence and completeness in b-metric space are defined as follows. Definition Let(X, d) beab-metric space, {x n } be a sequence in X and x X. Then: (a) The sequence {x n } is said to be convergent in (X, d),anditconvergestox if for every ε >0there exists n 0 N such that d(x n, x)<ε for all n > n 0, and this fact is represented by lim n x n = x or x n x as n. (b) The sequence {x n } is said to be Cauchy sequence in (X, d) if for every ε >0there exists n 0 N such that d(x n, x n+p )<ε for all n > n 0, p >0or, equivalently, if lim n d(x n, x n+p )=0for all p >0. (c) (X, d) is said to be a complete b-metric space if every Cauchy sequence in X converges to some x X. Definition Let(X, d) beametricspace,k be a positive integer, T : X k X and f : X X be mappings. (a) An element x X is said to be a coincidence point of f and T if and only if f (x)=t(x, x,...,x).ifx = f (x)=t(x, x,...,x),thenwesaythatx is a common fixed point of f and T.Ifw = f (x)=t(x, x,...,x),thenw is called a point of coincidence of f and T.

3 Pathak et al. Fixed Point Theory and Applications (2015) 2015:101 Page 3 of 17 (b) Mappings f and T are said to be commuting if and only if f (T(x, x,...,x)) = T(fx, fx,...,fx) for all x X. (c) Mappings f and T are said to be weakly compatible if and only if they commute at their coincidence points. Remark 2.4 For k = 1 the above definitions reduce to the usual definition of commuting and weakly compatible mappings in a metric space. The set of coincidence points of f and T is denoted by C(f, T). Lemma Let X be a nonempty set, k be a positive integer and f : X k X, g : X X be two weakly compatible mappings. If f and g have a unique point of coincidence y = f (x, x,..., x) =g(x), then y is the unique common fixed point of f and g. Khan et al. 8definedthesetfunctionθ :0, ) 4 0, ) as follows: 1. θ is continuous, 2. for all t 1, t 2, t 3, t 4 0, ), θ(t 1, t 2, t 3, t 4 )=0 t 1 t 2 t 3 t 4 =0. 3 Main results Throughout this paper we assume that the b-metric d : X X 0, ) is continuous on X 2. Theorem 3.1 Let (X, d) be a b-metric space with coefficient s 1. For any positive integer k, let f : X k Xandg: X X be mappings satisfying the following conditions: f ( X k) g(x), (3.1) d ( f (x 1, x 2,...,x k ), f (x 2, x 3,...,x k+1 ) ) k α i d(gx i, gx i+1 )+ d ( gx i, f (x j, x j,...,x j ) ) + L θ ( d ( gx 1, f (x k+1, x k+1, x k+1,...,x k+1 ) ), d ( gx k+1, f (x 1, x 1, x 1,...,x 1 ) ), d ( gx 1, f (x 1, x 1,...,x 1 ) ), d ( gx k+1, f (x k+1, x k+1,...,x k+1 ) )), (3.2) where x 1, x 2,...,x k+1 are arbitrary elements in X and α i, β ij, L are nonnegative constants such that k n=1 sk+3 n α n + k+1 k+1 <1and g(x) is complete. (3.3) Then f and g have a unique coincidence point, i.e., C(f, g). In addition, if f and g are weakly compatible, then f and g have a unique common fixed point. Moreover, for any x 1 X, the sequence {y n } defined by y n = g(x n )=f (x n 1, x n 1,...,x n 1 )=Fx n 1 converges to the common fixed point of f and g. Proof Let x 1 X, thenf (x 1, x 1,...,x 1 ) f (X k ) g(x). So there exists x 2 X such that f (x 1, x 1,...,x 1 )=g(x 2 ). Now f (x 2, x 2,...,x 2 ) f (X k ) g(x)andsothereexistsx 3 X such that f (x 2, x 2,...,x 2 )=g(x 3 ). Continuing this process we define the sequence y n in g(x)as

4 Pathak et al. Fixed Point Theory and Applications (2015) 2015:101 Page 4 of 17 y n = g(x n )=f (x n 1, x n 1,...,x n 1 )=Fx n 1, n =1,2,...,k +1,whereF is the associate operator for f.letd n = d(y n, y n+1 )=d(gx n, gx n+1 )andd ij = d(gx i, f (x j, x j,...,x j )). Then we have d n+1 = d ( g(x n+1 ), g(x n+2 ) ) = d(fx n, Fx n+1 ) = d ( f (x n, x n,...,x n ), f (x n+1, x n+1,...,x n+1 ) ) sd ( f (x n, x n,...,x n ), f (x n, x n,...,x n+1 ) ) + s 2 d ( f (x n, x n,...,x n+1 ), f (x n, x n,...,x n+1, x n+1 ) ) + s 3 d ( f (x n, x n,...,x n+1, x n+1 ), f (x n,...,x n+1, x n+1, x n+1 ) ) + + s k d ( f (x n, x n+1,...,x n+1, x n+1 ), f (x n+1,...,x n+1, x n+1, x n+1 ) ). Using (3.2)weget { k k k d n+1 s α k d n + β 1,j + β 2,j + + β kj D n,n k k } + β i,k+1 D n,n+1 + β k+1,j D n+1,n + β k+1,k+1 D n+1,n+1 + s 2 {α k 1 d n k 1 k 1 k 1 k 1 β 1,j + β 2,j + + β k 1,j D n,n k 1 β i,k + β i,k+1 D n,n+1 + k+1 k+1 } β k,j + β k+1,j D n+1,n+1 j=k j=k + + s k {α 1 d n + β 1,1 D n,n + + k+1 k+1 k 1 k 1 β k,j + β k+1,j D n+1,n β 1,j D n,n+1 + } β 2,j + β 3,j + + β k+1,j D n+1,n+1 k+1 β i,1 D n+1,n + L θ ( d ( gx n,(fx n+1, x n+1, x n+1,...,x n+1 ) ), d ( gx n+1, f (x n, x n, x n,...,x n ) ), d ( gx n, f (x n, x n,...,x n ) ), d ( gx n+1, f (x n+1, x n+1,...,x n+1 ) )), i=2 i.e., d n+1 { sα k + s 2 α k 1 + s 3 α k s k k k α 1 dn + s D n,n k k } + β i,k+1 D n,n+1 + β k+1,j D n+1,n + β k+1,k+1 D n+1,n+1

5 Pathak et al. Fixed Point Theory and Applications (2015) 2015:101 Page 5 of 17 { k 1 k 1 + s 2 D n,n i.e., k+1 k 1 D n,n+1 + j=k } D n+1,n s {β k 1,1 D n,n + i=k j=k k+1 β i,1 D n+1,n + k+1 i=2 i=2 k+1 k+1 k 1 D n+1,n i=k β 1,j D n,n+1 } D n+1,n+1 + L 0, d n+1 sα k + s 2 α k 1 + s 3 α k s k α 1 dn k k k 1 k 1 + s + s s k 1 + s + s + k k 1 β i,k+1 + s s k 1 i=k j=k s k β 1,1 D n,n 2 + s k β 1,j D n,n+1 k k 1 β k+1,j + s s k 1 s k k+1 i=3 j=3 2 + s k β i,1 D n+1,n + s k s 2 + sβ k+1,k+1 D n+1,n+1 i=2 i=3 j=3 = Ad n + BD n,n + CD n,n+1 + ED n+1,n + FD n+1,n+1, where A, B, C, E and F are the coefficients of d n, D n,n, D n,n+1, D n+1,n and D n+1,n+1 respectively in the above inequality. By the definition, D n,n = d(gx n, f (x n, x n,...,x n )) = d(gx n, gx n+1 )= d n, D n,n+1 = d(gx n, f (x n+1, x n+1,...,x n+1 )) = d(gx n, gx n+2 ), D n+1,n = d(gx n+1, f (x n, x n,...,x n )) = d(gx n+1, gx n+1 )=0,D n+1,n+1 = d(gx n+1, f (x n+1, x n+1,...,x n+1 )) = d(gx n+1, gx n+2 )=d n+1 ;therefore, i=k j=k i=2 d n+1 Ad n + Bd n + Cd(gx n, gx n+2 )+Fd n+1 Ad n + Bd n + Csd(gx n, gx n+1 )+Csd(gx n+1, gx n+2 )+Fd n+1 =(A + B + Cs)d n +(Cs + F)d n+1, i.e., (1 Cs F)d n+1 (A + B + Cs)d n. Again, interchanging the role of x n and x n+1 and repeating the above process, we obtain (1 Es B)d n+1 (A + F + Es)d n. It follows that ( 2 (C + E)s F B ) dn+1 ( 2A + B + F + s(c + E) ) d n d n+1 d n+1 λd n, where λ = 2A+B+F+s(C+E) 2 B F (C+E)s.Thuswehave 2A + B + F + s(c + E) 2 B F (C + E)s d n d n+1 λ n+1 d 0 for all n 0. (3.4)

6 Pathak et al. Fixed Point Theory and Applications (2015) 2015:101 Page 6 of 17 We will show that λ <1andsλ <1.Wehave A + B + F + s(c + E) sa + B + C + E + F = s sα k + s 2 α k 1 + s 3 α k s k α 1 k k k 1 k 1 + s s + s s k 1 + s s + s s k k 1 β i,k+1 + s s k 1 i=k j=k s k β 1,1 2 + s k β 1,j k k 1 β k+1,j + s s k 1 i=3 j=3 2 + s k β i,1 + s sβ k+1,k+1 + s s k 1 + s k i=k j=k = s 2 α k + s 3 α k 1 + s 4 α k s k+1 α 1 + s 2 + s 3 + s s k+1 = s 2 α k + s 3 α k 1 + s 4 α k s k+1 α 1 + s 2 + s 3 + s s k+1 k+1 s 3 α k + s 4 α k 1 + s 5 α k s k+2 α 1 = + s 3 + s 4 + s s k+2 k s α k+3 n n + <1, n=1 k+2 and so λ <1.WealsohavesA + sb + sf + s(c + E)=s(A + B + F + C + E) < 1 (proved above) and sa + B + F + s 2 (C + E) s 2 A + B + C + E + F = s 2 sα k + s 2 α k 1 + s 3 α k s k α 1 + s 2 s + s 2 s k i=3 k k 1 k 1 + s s k 1 k k 1 β i,k+1 + s s k 1 j=k j=3 2 i=2 i=2 2 + s k β 1,1 2 + s k β 1,j j=3

7 Pathak et al. Fixed Point Theory and Applications (2015) 2015:101 Page 7 of 17 + s 2 s k k 1 β k+1,j + s s k 1 i=k i=3 2 + s k β i,1 + s 2 sβ k+1,k+1 + s s k 1 + s k i=k j=k = s 3 α k + s 4 α k 1 + s 5 α k s k+2 α 1 + s 3 + s 4 + s s k+2 = s 3 α k + s 4 α k 1 + s 5 α k s k+2 α 1 = + s 3 + s 4 + s s k+2 k s α k+3 n n + <1, n=1 and so sλ <1. Thus, for all n, p N, k+1 i=3 j=3 i=2 i=2 d(gx n, gx n+p ) sd(gx n, gx n+1 )+s 2 d(gx n+1, gx n+2 )+ + s p 1 d(gx n+(p 1), gx n+p ) = sd n + s 2 d n s p 1 d n+(p 1) sλ n d 0 + s 2 λ n+1 d s p 1 λ n+(p 1) d 0 sλn 1 sλ d 0 0 asn. Thus {gx n } is a Cauchy sequence. By completeness of g(x), there exists u X such that lim gx n = u and there exists p X such that g(p)=u. (3.5) n We shall show that u is the fixed point of f and g. Using a similar process as the one used in the calculation of d n+1,weobtain d ( g(p), f (p,...,p) ) s d ( ) ( g(p), y n+1 + d yn+1, f (p, p,...,p) ) s d ( ) g(p), y n+1 + d(fxn, Fp) s d ( ) g(p), y n+1 + Ad(gxn, gp)+bd ( gx n, f (x n, x n,...,x n ) ) + Cd ( gx n, f (p, p,...,p) ) + Ed ( gp, f (x n, x n,...,x n ) ) + Fd ( gp, f (p, p,...,p) ). It follows from (3.5)that d ( g(p), f (p,...,p) ) s(c + F)d ( gp, f (p, p,...,p) ). (3.6)

8 Pathak et al. Fixed Point Theory and Applications (2015) 2015:101 Page 8 of 17 As s(c + F) < 1, weobtainf(p) = g(p) = f (p, p,...,p) = u Thus, u is a point of coincidence of f and g. Ifu is another point of coincidence of f and g, then there exists p X such that F(p )=g(p )=f (p, p,...,p )=u. Then we have d ( u, u ) = d ( Fp, Fp ) Ad ( gp, gp ) + Bd ( gp, f (p, p,...,p) ) + Cd ( gp, f ( p, p,...,p )) + Ed ( gp, f (p, p,...,p) ) + Fd ( gp, f ( p, p,...,p )) = Ad ( u, u ) + Bd(u, u)+cd ( u, u ) + Ed ( u, u ) + Fd ( u, u ) =(A + C + E + F)d ( u, u ). As A + C + E + F < 1, we obtain from the above inequality that d(u, u )=0,thatis,u = u. Thus the point of coincidence u is unique. Further, if f and g are weakly compatible, then by Lemma 2.5, u is the unique common fixed point of f and g. Remark 3.2 Taking s =1,g = I and θ(t 1, t 2, t 3, t 4 )=0inTheorem3.1, wegettheorem4 of Shukla et al. 13. Remark 3.3 For s =1,g = I, i = j, β ij = δ k+1, i, L = 1, we obtain Theorem 2.1 of Khan et al. 8. Remark 3.4 For s =1,g = I, β ij =0, i, j {1,2,...,k +1} and θ(t 1, t 2, t 3, t 4 )=min{(t 1, t 2, t 3, t 4 )}, we obtain the result of Pacurar 5. Remark 3.5 For s =1,g = I, α i =0,i = j, β ij = a, L = 0, we obtain the result of Pacurar 4. Remark 3.6 For s =1,g = I, β ij =0, i, j {1,2,...,k +1}, L = 0, we obtain the result of Presic 2. Next we prove a generalized Ciric-Presic type fixed point theorem in a b-metric space. Consider a function φ : R k R such that 1. φ is an increasing function, i.e., x 1 < y 1, x 2 < y 2,...,x k < y k implies φ(x 1, x 2,...,x k )<φ(y 1, y 2,...,y k ); 2. φ(t, t, t,...) t for all t X; 3. φ is continuous in all variables. Theorem 3.7 Let (X, d) be a b-metric space with s 1. For any positive integer k, let f : X k Xandg: X X be mappings satisfying the following conditions: f ( X k) g(x), (3.7) d ( f (x 1, x 2,...,x k ), f (x 2, x 3,...,x k+1 ) ) λφ ( d(gx 1, gx 2 ), d(gx 2, gx 3 ), d(gx 3, gx 4 ),...,d(gx k, gx k+1 ) ), (3.8)

9 Pathak et al. Fixed Point Theory and Applications (2015) 2015:101 Page 9 of 17 where x 1, x 2,...,x k+1 are arbitrary elements in X, λ (0, 1 s k ), g(x) is complete (3.9) and d ( f (u, u,...,u), f (v, v,...,v) ) < d(gu, gv) (3.10) for all u, v X. Then f and g have a coincidence point, i.e., C(f, g). In addition, if f and g are weakly compatible, then f and g have a unique common fixed point. Moreover, for any x 1 X, the sequence {y n } defined by y n = g(x n )=f (x n, x n+1,...,x n+k 1 ) converges to the common fixed point of f and g. Proof For arbitrary x 1, x 2,...,x k in X,let ( d(gx1, gx 2 ) R = max, d(gx 2, gx 3 ),..., d(gx ) k, f (x 1, x 2,...,x k )), (3.11) θ θ 2 θ k where θ = λ 1 k.by(3.7)wedefinethesequence yn in g(x)asy n = gx n for n =1,2,...,k and y n+k = g(x n+k )=f (x n, x n+1,...,x n+k 1 ), n =1,2,... Let α n = d(y n, y n+1 ). By the method of mathematical induction, we will prove that α n Rθ n for all n. (3.12) Clearly, by the definition of R, (3.12) istrueforn =1,2,...,k. Letthek inequalities α n Rθ n, α n+1 Rθ n+1,...,α n+k 1 Rθ n+k 1 be the induction hypothesis. Then we have α n+k = d(y n+k, y n+k+1 ) = d ( f (x n, x n+1,...,x n+k 1 ), f (x n+1, x n+2,...,x n+k ) ) λφ ( d(gx n, gx n+1 ), d(gx n+1, gx n+2 ),...,d(gx n+k 1, gx n+k ), d ( gx n, f (x n, x n,...,x n ) ), d ( gx n+k, f (x n+k, x n+k,...,x n+k ) )) = λφ(α n, α n+1,...,α n+k 1 ) λφ ( Rθ n, Rθ n+1,...,rθ n+k 1) λφ ( Rθ n, Rθ n,...,rθ n) λrθ n = Rθ n+k. Thus the inductive proof of (3.12)iscomplete.Now,forn, p N,wehave d(y n, y n+p ) sd(y n, y n+1 )+s 2 d(y n+1, y n+2 )+ + s p 1 d(y n+p 1, y n+p ), srθ n + s 2 Rθ n s p 1 Rθ n+p 1 srθ n( 1+sθ + s 2 θ 2 + ) = srθ n 1 sθ.

10 Pathak et al. Fixed Point Theory and Applications (2015) 2015:101 Page 10 of 17 Hence the sequence y n is a Cauchy sequence in g(x) and since g(x) is complete, there exist v, u X such that lim n y n = v = g(u), d ( gu, f (u, u,...,u) ) s d(gu, y n+k )+d ( y n+k, f (u, u,...,u) ) = s d(gu, y n+k )+d ( f (x n, x n+1,...,x n+k 1 ), f (u, u,...,u) ) = sd(gu, y n+k )+sd ( f (x n, x n+1,...,x n+k 1 ), f (u, u,...,u) ) sd(gu, y n+k )+s 2 d ( f (u, u,...,u), f (u, u,...,x n ) ) + s 3 d ( f (u, u,...,x n ), f (u, u,...,x n, x n+1 ) ) + + s k 1 d ( f (u, x n,...,x n+k 2 ), f (x n, x n+1,...,x n+k 1 ) ) sd(gu, y n+k )+s 2 λφ { d(gu, gu), d(gu, gu),...,d(gu, gx n ) } + s 3 λφ { d(gu, gu), d(gu, gu),...,d(gu, gx n ), d(gx n, gx n+1 ) } + + s k 1 λφ { d(gu, gx n ), d(gx n, gx n+1 ),...,d(gx n+k 2, gx n+k 1 ) } = sd(gu, y n+k )+s 2 λφ ( 0,0,...,d(gu, gx n ) ) + s 3 λφ ( 0,0,...,d(gu, gx n ), d(gx n, gx n+1 ) ) + + s k 1 λφ ( d(gu, gx n ), d(gx n, gx n+1 ),...,d(gx n+k 2, gx n+k 1 ) ). Taking the limit when n tends to infinity, we obtain d(gu, f (u, u,...,u)) 0. Thus gu = f (u, u, u,...,u), i.e., C(g, f ). Thusthereexistv, u X such that lim n y n = v = g(u)= f (u, u, u,...,u). Since g and f are weakly compatible, g(f (u, u,...,u)) = f (gu, gu, gu,...,gu). By (3.10)wehavethat d(ggu, gu)=d ( gf (u, u,...,u), f (u, u,...,u) ) = d ( f (gu, gu, gu,...,gu), f (u, u,...,u) ) < d(ggu, gu) implies d(ggu, gu)=0andsoggu = gu.hencewehavegu = ggu = g(f (u, u,...,u)) = f (gu, gu, gu,...,gu), i.e., gu is a common fixed point of g and f,andlim n y n = g(u). Now suppose that x, y are two fixed points of g and f.then d(x, y)=d ( f (x, x, x,...,x), f (y, y, y,...,y) ) < d(gx, gy) = d(x, y). This implies x = y. Hence the common fixed point is unique. Remark 3.8 Taking s =1,g = I and φ(x 1, x 2,...,x k )=max{x 1, x 2,...,x k } in Theorem 3.7, we obtain Theorem 1.2, i.e., the result of Ciric and Presic 3. 1 Remark 3.9 For λ (0, ), we can drop the condition (3.10)ofTheorem3.7.Infactwe s k+1 have the following.

11 Pathak et al. Fixed Point Theory and Applications (2015) 2015:101 Page 11 of 17 Theorem 3.10 Let (X, d) be a b-metric space with s 2. For any positive integer k, let f : X k Xandg: X Xbemappingssatisfyingconditions(3.7), (3.8) and (3.9) with 1 λ (0, ). Then all conclusions of Theorem 3.7 hold. s k+1 Proof As proved in Theorem 3.7, thereexistv, u X such that lim n y n = v = g(u) = f (u, u,...,u), i.e., C(g, f ). Sinceg and f are weakly compatible, g(f (u, u,...,u)) = f (gu, gu, gu,...,gu). By (3.8)wehave d(ggu, gu) =d ( gf (u, u,...,u), f (u, u,...,u) ) = d ( f (gu, gu, gu,...,gu), f (u, u,...,u) ) sd ( f (gu, gu, gu,...,gu), f (gu, gu,...,gu, u) ) + s 2 d ( f (gu, gu,...,gu, u), f (gu, gu,...,u, u) ) + + s k 1 d ( f (gu, gu,...,u, u), f (u, u,...,u) ) + s k 1 d ( f (gu, u,...,u, u), f (u, u,...,u) ) sλφ ( d(ggu, ggu),...,d(ggu, ggu), d(ggu, gu) ) + s 2 λφ ( d(ggu, ggu),...,d(ggu, gu), d(gu, gu) ) + + s k 1 λφ ( d(ggu, gu),...,d(gu, gu), d(gu, gu) ) = sλφ ( 0,0,0,...,d(ggu, gu) ) + s 2 λφ ( 0,0,...,0,d(ggu, gu), 0 ) + + s k 1 λφ ( d(ggu, gu),0,0,...,0 ) = sλ 1+s + s 2 + s s k 2 + s k 2 d(ggu, gu) sλ 1+s + s 2 + s s k 2 + s k 1 d(ggu, gu) = sλ sk 1 d(ggu, gu). s 1 sλ sk 1 < 1 implies d(ggu, gu) =0andsoggu = gu. Hencewehavegu = ggu = g(f (u, u, s 1...,u)) = f (gu, gu, gu,...,gu), i.e., gu is a common fixed point of g and f,andlim n y n = g(u). Now suppose that x, y are two fixed points of g and f.then d(x, y) =d ( f (x, x, x,...,x), f (y, y, y,...,y) ) sd ( f (x, x,...,x), f (x, x,...,x, y) ) + s 2 d ( f (x, x,...,x, y), f (x, x, x,...,x, y, y) ) + + s k 1 d ( f (x, x, y,...,y), f (y, y,...,y) ) + s k 1 d ( f (x, y, y,...,y), f (y, y,...,y) ) sλφ { d(fx, fx), d(fx, fx),...,d(fx, fy) } + s 2 λφ { d(fx, fx), d(fx, fx),...,d(fx, fy), d(fy, fy) } + + s k 1 λφ { d(fx, fy), d(fy, fy),...,d(fy, fy) } = sλφ ( 0,0,...,d(fx, fy) ) + s 2 λφ ( 0,0,...,d(fx, fy), 0 ) + + s k 1 λφ ( d(fx, fy),0,0,0,...,0 )

12 Pathak et al. Fixed Point Theory and Applications (2015) 2015:101 Page 12 of 17 = λ s + s 2 + s s k 1 + s k 1 d(fx, fy) = sλ 1+s + s 2 + s s k 2 + s k 2 d(fx, fy) sλ 1+s + s 2 + s s k 2 + s k 1 d(fx, fy) = sλ sk 1 d(fx, fy). s 1 = sλ sk 1 d(x, y). s 1 This implies x = y. Hence the common fixed point is unique. Example 3.11 Let X = R and d : X X X such that d(x, y)= x y 3.Thend is a b-metric on X with s =4.Letf : X 2 X and g : X X be defined as follows: f (x, y)= x2 + y gx = x 2 2 ifx R. if (x, y) R, We will prove that f and g satisfy condition (3.8): d ( f (x, y), f (y, z) ) = f (x, y) f (y, z) 3 = x 2 z = x 2 y 2 + y 2 z 2 13 ( x 2 y y 2 z 2 3) 13 = 4 x 2 y y 2 z = 8 1 x 2 y y 2 z max{ x 2 y 2 3, y 2 z 2 3 } 3 = max{ d(gx, gy), d(gy, gz) }. Thus, f and g satisfy condition (3.8) withλ = 8 1 (0, ). Clearly C(f, g) =2,f and g commute at 2. Finally, 2 is the unique common fixed point of f and g. Butf and g do not satisfy condition (3.10) asatx = 1andy =1,d(f (x, x), f (y, y)) = d(f ( 1, 1), f (1, 1)) = d( , )=0=d( 1, 1) = d(g( 1), g(1)) = d(gx, gy) Application to matrix equation InthissectionwehaveappliedTheorem3.7 to study the existence of solutions of the nonlinear matrix equation 3 X = Q + m A i X δ i A i, 0< δ i <1, (4.1) where Q is an n n positive semidefinite matrix and A i s are nonsingular n n matrices, or Q is an n n positive definite matrix and A i s are arbitrary n n matrices, and a positive

13 Pathak et al. Fixed Point Theory and Applications (2015) 2015:101 Page 13 of 17 definite solution X is sought. Here A i denotes the conjugate transpose of the matrix A i. The existence and uniqueness of positive definite solutions and numerical methods for finding a solution of (4.1) have recently been studied by many authors (see 25 30). The Thompson metric on the open convex cone P(N)(N 2), the set of all N N Hermitian positive definite matrices, is defined by d(a, B)=max { log M(A/B), log M(B/A) }, (4.2) where M(A/B) =inf{λ >0:A λb} = λ max (B 1/2 AB 1/2 ), the maximal eigenvalue of B 1/2 AB 1/2.HereX Y means that Y X is positive semidefinite and X < Y means that Y X is positive definite. Thompson 31 has proved that P(N) is a complete metric space with respect to the Thompson metric d and d(a, B)= log(a 1/2 BA 1/2 ),where stands for the spectral norm. The Thompson metric exists on any open normal convex cone of real Banach spaces 31, 32; in particular, the open convex cone of positive definite operators of a Hilbert space. It is invariant under the matrix inversion and congruence transformations: d(a, B)=d ( A 1, B 1) = d ( MAM, MBM ) (4.3) for any nonsingular matrix M. One remarkable and useful result is the nonpositive curvature property of the Thompson metric: d ( X r, Y r) rd(x, Y ), r 0, 1. (4.4) By the invariant properties of the metric, we then have d ( MX r M, MY r M ) = r d(x, Y ), r 1, 1 (4.5) for any X, Y P(N) and a nonsingular matrix M. Proceeding as in 30 weprovethefollowing lemma. Lemma 4.1 For any A 1, A 2,...,A k P(N), B 1, B 2,...,B k P(N), d(a 1 + A A k, B 1 + B B k ) max{d(a 1, B 1 ), d(a 2, B 2 ),...,d(a k, B k )}. Proof Without loss of generality we can assume that d(a 1, B 1 ) d(a 2, B 2 ) d(a k, B k )=log r. ThenB 1 ra 1, B 2 ra 2,...,B k ra k and A 1 rb 1, A 2 rb 2,...,A k rb k,andthusb 1 + A 1 r(a 1 + B 1 ), B 2 + A 2 r(a 2 + B 2 ),...,B k + A k r(a k + B k ). Hence A 1 + A A k rb 1 + B B k andb 1 + B B k ra 1 + A A k. Hence d(a 1 + A A k, B 1 + B B k ) log r = d(a k, B k )= max{d(a 1, B 1 ), d(a 2, B 2 ),...,d(a k, B k )}. For arbitrarily chosen positive definite matrices X n r, X n (r 1),...,X n, consider the iterative sequence of matrices, given by X n+1 = Q + A 1 Xα 1 n r A 1 + A 2 Xα 2 n (r 1) A A r+1 Xα r+1 n A r+1, (4.6) α 1, α 2,...,α r+1 are real numbers.

14 Pathak et al. Fixed Point Theory and Applications (2015) 2015:101 Page 14 of 17 Theorem 4.2 Suppose that λ = max{ α 1, α 2,..., α r+1 } (0, 1). (i) Equation (4.6) has a unique equilibrium point in P(N), that is, there exists unique U P(N) such that U = Q + A 1 Uα 1 A 1 + A 2 Uα 2 A A r+1 Uα r+1 A r+1. (4.7) (ii) The iterative sequence {X n } defined by (4.6) converges to a unique solution of (4.1). Proof Define the mapping f : P(N) P(N) P(N) P(N) P(N)by f (X 1, X 2, X n (r 2),...,X k )=Q + A 1 Xα 1 1 A 1 + A 2 Xα 2 2 A A r+1 Xα r+1 k A r+1, (4.8) where X 1, X 2,...,X k P(N). For all X n r, X n (r 1), X n (r 2),...,X n+1 P(N), we have d ( f (X n r, X n (r 1), X n (r 2),...,X n ), f (X n (r 1), X n (r 2), X n (r 2),...,X n+1 ) ) = d ( Q + A 1 Xα 1 n r A 1 + A 2 Xα 2 n (r 1) A A r+1 Xα r+1 n A r+1, Q + A 2 Xα 1 n (r 1) A 2 + A 3 Xα 3 n (r 2) A A r+2 Xα r+2 n+1 A r+2 d ( A 1 Xα 1 n r A 1 + A 2 Xα 2 n (r 1) A A r+1 Xα r+1 n A r+1, A 2 Xα 1 n (r 1) A 2 + A 3 Xα 3 n (r 2) A A r+2 Xα r+2 n+1 A r+2 max { d ( A 1 Xα 1 n r A 1, A 2 Xα 1 n (r 1) A ) ( 2, d A 2 X α 2 n (r 1) A 2, A 3 Xα 3 n (r 2) A 3),...,d ( A r+1 Xα r+1 n A r+1, A r+2 Xα r+2 n+1 A r+2 max { α 1 d(x n r, X n (r 1) ), α 2 d(x n (r 1), X n (r 2) ),..., α r+1 d(x n, X n+1 ) } max { α 1, α 2,..., α r+1 } max { d(x n r, X n (r 1) ), d(x n (r 1), X n (r 2) ),...,d(x n, X n+1 ) } )} λ max { d(x n r, X n (r 1) ), d(x n (r 1), X n (r 2) ),...,d(x n, X n+1 ) } (4.9) ) ) for all X n r, X n (r 1), X n (r 2),...,X n+1 P(N). X, Y P(N), we have d ( f (X, X,...,X), f (Y, Y,...,Y ) ) = d ( Q + A 1 Xα 1 A 1 + A 2 Xα 2 A A r+1 Xα r+1 A r+1, Q + A 2 Y α 1 A 2 + A 3 Y α 3 A A r+2 Y α r+2 A r+2 ) d ( A 1 Xα 1 A 1 + A 2 Xα 2 A A r+1 Xα r+1 A r+1, A 2 Y α 1 A 2 + A 3 Y α 3 A A r+2 Y α r+2 A r+2 ) max { d ( A 1 Xα 1 A 1, A 2 Y α ) ( 1 A 2, d A 2 X α 2 A 2, A 3 Y α ) 3 A 3,...,d ( A r+1 Xα r+1 A r+1, A r+2 Y α )} r+2 A r+2 max { α 1 d(x, Y ), α 2 d(x, Y ),..., α r+1 d(x, Y ) }

15 Pathak et al. Fixed Point Theory and Applications (2015) 2015:101 Page 15 of 17 max { α 1, α 2,..., α r+1 } max { d(x, Y ), d(x, Y ),...,d(x, Y ) } λ max { d(x, Y ), d(x, Y ),...,d(x, Y ) } < d(x, Y ). Since λ (0, 1), (i) and (ii) follow immediately from Theorem 3.7 with s =1andg = I. Numerical experiment illustrating the above convergence algorithm Consider the nonlinear matrix equation X = Q + A X 1 2 A + B X 1 3 B + C X 1 4 C, (4.10) where 14/3 1/3 1/4 2/5 3/2 4/6 A = 2/15 1/12 1/23, B = 10/4 6/13 7/46, 3/10 9/20 11/4 5/2 4/7 6/13 1/3 19/24 22/ C = 17/10 27/15 45/17, Q = /8 1/3 1/ We define the iterative sequence {X n } by X n+1 = Q + A X 1 2 n 2 A + B X 1 3 n 1 B + C X 1 4 n C. (4.11) Let R m (m 2) be the residual error at the iteration m,thatis,r m = X m+1 (Q+A 2 X 1 m+1 A+ B 3 X 1 m+1 B + C 4 X 1 m+1 C),where is the spectral norm. For initial values X 0 = 0 1 0, X 1 = 1 1 0, X 2 = 1 1 1, we computed the successive iterations and the error R m using MATLAB and found that after thirty five iterations the sequence given by (4.11)convergesto U = X 35 = , which is clearly a solution of (4.10). The convergence history of algorithm (4.11) isgiven in Figure 1.

16 Pathak et al. Fixed Point Theory and Applications (2015) 2015:101 Page 16 of 17 Figure 1 Convergence history for Equation (4.11). Competing interests The authors declare that they have no competing interests. Authors contributions All authors contributed equally in this work. All authors read and approved the final manuscript. Author details 1 School of Studies in Mathematics, Pt. Ravishankar Shukla University, Raipur, Chhattisgarh, India. 2 Department of Mathematics, College of Science, Salman bin Abdulaziz University, Al-Kharj, Kingdom of Saudi Arabia. 3 Department of Mathematics and Computer Science, St. Thomas College, Bhilai, Chhattisgarh, India. 4 Department of Engineering Basic Sciences, Faculty of Engineering, Menofia University, Menofia, Egypt. 5 Department of Mathematics, Faculty of Commerce, Alazhar University, Menofia, Egypt. 6 Department of Mathematics, Government VYT PG Autonomous College, Durg, Chhattisgarh, India. 7 Department of Mathematics, Rungta College of Engineering and Technology, Bhilai, Chhattisgarh, India. Acknowledgements The authors are thankful to the learned referees for their valuable comments which helped in bringing this paper to its present form. The second, third and fourth authors would like to thank the Deanship of Scientific Research, Salman bin Abdulaziz University, Al Kharj, Kingdom of Saudi Arabia for the financial assistance provided. The research of second, third and fourth authors is supported by the Deanship of Scientific Research, Salman bin Abdulaziz University, Alkharj, Kingdom of Saudi Arabia, Research Grant No. 2014/01/2046. Received: 30 December 2014 Accepted: 29 May 2015 References 1. Presic, SB: Sur la convergence des suites. C. R. Acad. Sci. Paris 260, (1965) 2. Presic, SB: Sur une classe d inequations aux differences finite et sur la convergence de certaines suites. Publ. Inst. Math. (Belgr.) 5(19),75-78 (1965) 3. Ciric, LB, Presic, SB: On Presic type generalisation of Banach contraction principle. Acta Math. Univ. Comen. LXXVI(2), (2007) 4. Pacurar, M: Approximating common fixed points of Presic-Kannan type operators by a multi-step iterative method. An. Ştiinţ. Univ. Ovidius Constanţa 17(1), (2009) 5. Pacurar, M: Fixed points of almost Presic operators by a k-step iterative method. An. Ştiinţ. Univ. Al.I. Cuza Iaşi, Mat. LVII, (2011) 6. Rao, KPR, Mustaq Ali, M, Fisher, B: Some Presic type generalizations of the Banach contraction principle. Math. Morav. 15(1), (2011) 7. Pacurar, M: Common fixed points for almost Presic type operators. Carpath. J. Math. 28(1), (2012) 8. Khan, MS, Berzig, M, Samet, B: Some convergence results for iterative sequences of Presic type and applications. Adv. Differ. Equ. (2012). doi: / George, R, Reshma, KP, Rajagopalan, R: A generalised fixed point theorem of Presic type in cone metric spaces and application to Markov process. Fixed Point Theory Appl. (2011). doi: / Shukla, S: Presic type results in 2-Banach spaces. Afr. Math. (2013). doi: /s Shukla, S, Fisher, B: A generalization of Presic type mappings in metric-like spaces. J. Oper. 2013, Article ID (2013)

17 Pathak et al. Fixed Point Theory and Applications (2015) 2015:101 Page 17 of Shukla,S,Sen,R:Set-valuedPresic-Reichtypemappingsinmetricspaces.Rev.R.Acad.Cienc.ExactasFís.Nat.,Ser.A Mat. (2012). doi: /s Shukla, S, Radenovic, S, Pantelic, S: Some fixed point theorems for Presic-Hardy-Rogers type contractions in metric spaces.j.math.2013, Article ID (2013). doi: /2013/ Chen, YZ: A Presic type contractive condition and its applications. Nonlinear Anal. (2009). doi: /j.na Bakhtin, IA: The contraction mapping principle in quasimetric spaces. Funct. Anal. Unianowsk Gos. Pedagog. Inst. 30, (1989) 16. Boriceanu, M: Strict fixed point theorems for multivalued operators in b-metric spaces. Int. J. Mod. Math. 4(3), (2009) 17. Boriceanu, M, Bota, M, Petrusel, A: Multivalued fractals in b-metric spaces. Cent. Eur. J. Math. 8(2), (2010) 18. Bota, M, Molnar, A, Csaba, V: On Ekeland s variational principle in b-metric spaces. Fixed Point Theory 12, (2011) 19. Plebaniak, R: New generalized pseudodistance and coincidence point theorem in a b-metric space. Fixed Point Theory Appl. 2013, 270 (2013) 20. Czerwik, S: Contraction mappings in b-metric spaces. Acta Math. Inform. Univ. Ostrav. 1, 5-11 (1993) 21. Czerwik, S: Nonlinear set-valued contraction mappings in b-metric spaces. Atti Semin. Mat. Fis. Univ. Modena 46, (1998) 22. Czerwik, S, Dlutek, K, Singh, SL: Round-off stability of iteration procedures for operators in b-metric spaces. J. Natur. Phys. Sci. 11, (1997) 23. Czerwik, S, Dlutek, K, Singh, SL: Round-off stability of iteration procedures for set valued operators in b-metric spaces. J. Natur. Phys. Sci. 15, 1-8 (2001) 24. Pacurar, M: A multi-step iterative method for approximating common fixed points of Presic-Rus type operators on metric spaces. Stud. Univ. Babeş-Bolyai, Math. LV(1), (2010) 25. Ferrante, A, Levy, B: Hermitian solution of the equation X = Q + N X 1 N. Linear Algebra Appl. 247, (1996) 26. Huang, M, Huang, C, Tsai, T: Application of Hilbert s projective metric to a class of positive nonlinear operators. Linear Algebra Appl. 413, (2006) 27. Hasanov, VI: Positive definite solutions of matrix equations X ± A T X q A = Q. Linear Algebra Appl. 404, (2005) 28. Duan, X, Liao, A, Tang, B: On the nonlinear matrix equation X m A i X δ i A i = Q. Linear Algebra Appl. 429, (2008) 29. Liu, XG, Gao, H: On the positive definite solutions of the matrix equation X s = ±A T X t A = I n. Linear Algebra Appl. 368, (2003) 30. Lim, Y: Solving the nonlinear matrix equation X = Q + m M i X δ i M i, via a contraction principle. Linear Algebra Appl. 430, (2009) 31. Thompson, AC: On certain contraction mappings in a partially ordered vector space. Proc. Am. Math. Soc. 14, (1963) 32. Nussbaum, RD: Hilbert s projective metric and iterated nonlinear maps. Mem. Am. Math. Soc. 14, (1963)

Quasi Contraction and Fixed Points

Quasi Contraction and Fixed Points Available online at www.ispacs.com/jnaa Volume 2012, Year 2012 Article ID jnaa-00168, 6 Pages doi:10.5899/2012/jnaa-00168 Research Article Quasi Contraction and Fixed Points Mehdi Roohi 1, Mohsen Alimohammady

More information

Iterative Techniques in Matrix Algebra. Jacobi & Gauss-Seidel Iterative Techniques II

Iterative Techniques in Matrix Algebra. Jacobi & Gauss-Seidel Iterative Techniques II Iterative Techniques in Matrix Algebra Jacobi & Gauss-Seidel Iterative Techniques II Numerical Analysis (9th Edition) R L Burden & J D Faires Beamer Presentation Slides prepared by John Carroll Dublin

More information

Research Article Stability Analysis for Higher-Order Adjacent Derivative in Parametrized Vector Optimization

Research Article Stability Analysis for Higher-Order Adjacent Derivative in Parametrized Vector Optimization Hindawi Publishing Corporation Journal of Inequalities and Applications Volume 2010, Article ID 510838, 15 pages doi:10.1155/2010/510838 Research Article Stability Analysis for Higher-Order Adjacent Derivative

More information

A PRIORI ESTIMATES FOR SEMISTABLE SOLUTIONS OF SEMILINEAR ELLIPTIC EQUATIONS. In memory of Rou-Huai Wang

A PRIORI ESTIMATES FOR SEMISTABLE SOLUTIONS OF SEMILINEAR ELLIPTIC EQUATIONS. In memory of Rou-Huai Wang A PRIORI ESTIMATES FOR SEMISTABLE SOLUTIONS OF SEMILINEAR ELLIPTIC EQUATIONS XAVIER CABRÉ, MANEL SANCHÓN, AND JOEL SPRUCK In memory of Rou-Huai Wang 1. Introduction In this note we consider semistable

More information

BANACH AND HILBERT SPACE REVIEW

BANACH AND HILBERT SPACE REVIEW BANACH AND HILBET SPACE EVIEW CHISTOPHE HEIL These notes will briefly review some basic concepts related to the theory of Banach and Hilbert spaces. We are not trying to give a complete development, but

More information

COMMON FIXED POINTS OF FOUR MAPS USING GENERALIZED WEAK CONTRACTIVITY AND WELL-POSEDNESS

COMMON FIXED POINTS OF FOUR MAPS USING GENERALIZED WEAK CONTRACTIVITY AND WELL-POSEDNESS Int. J. Nonlinear Anal. Appl. (011) No.1, 73 81 ISSN: 008-68 (electronic) http://www.ijnaa.com COMMON FIXED POINTS OF FOUR MAPS USING GENERALIZED WEAK CONTRACTIVITY AND WELL-POSEDNESS MOHAMED AKKOUCHI

More information

A matrix over a field F is a rectangular array of elements from F. The symbol

A matrix over a field F is a rectangular array of elements from F. The symbol Chapter MATRICES Matrix arithmetic A matrix over a field F is a rectangular array of elements from F The symbol M m n (F) denotes the collection of all m n matrices over F Matrices will usually be denoted

More information

TRIPLE FIXED POINTS IN ORDERED METRIC SPACES

TRIPLE FIXED POINTS IN ORDERED METRIC SPACES Bulletin of Mathematical Analysis and Applications ISSN: 1821-1291, URL: http://www.bmathaa.org Volume 4 Issue 1 (2012., Pages 197-207 TRIPLE FIXED POINTS IN ORDERED METRIC SPACES (COMMUNICATED BY SIMEON

More information

6. Metric spaces. In this section we review the basic facts about metric spaces. d : X X [0, )

6. Metric spaces. In this section we review the basic facts about metric spaces. d : X X [0, ) 6. Metric spaces In this section we review the basic facts about metric spaces. Definitions. A metric on a non-empty set X is a map with the following properties: d : X X [0, ) (i) If x, y X are points

More information

AN ITERATIVE METHOD FOR THE HERMITIAN-GENERALIZED HAMILTONIAN SOLUTIONS TO THE INVERSE PROBLEM AX = B WITH A SUBMATRIX CONSTRAINT

AN ITERATIVE METHOD FOR THE HERMITIAN-GENERALIZED HAMILTONIAN SOLUTIONS TO THE INVERSE PROBLEM AX = B WITH A SUBMATRIX CONSTRAINT Bulletin of the Iranian Mathematical Society Vol. 39 No. 6 (2013), pp 129-1260. AN ITERATIVE METHOD FOR THE HERMITIAN-GENERALIZED HAMILTONIAN SOLUTIONS TO THE INVERSE PROBLEM AX = B WITH A SUBMATRIX CONSTRAINT

More information

A sufficient and necessary condition for the convergence of the sequence of successive approximations to a unique fixed point II

A sufficient and necessary condition for the convergence of the sequence of successive approximations to a unique fixed point II Suzuki and Alamri Fixed Point Theory and Applications (2015) 2015:59 DOI 10.1186/s13663-015-0302-9 RESEARCH Open Access A sufficient and necessary condition for the convergence of the sequence of successive

More information

THE BANACH CONTRACTION PRINCIPLE. Contents

THE BANACH CONTRACTION PRINCIPLE. Contents THE BANACH CONTRACTION PRINCIPLE ALEX PONIECKI Abstract. This paper will study contractions of metric spaces. To do this, we will mainly use tools from topology. We will give some examples of contractions,

More information

Properties of BMO functions whose reciprocals are also BMO

Properties of BMO functions whose reciprocals are also BMO Properties of BMO functions whose reciprocals are also BMO R. L. Johnson and C. J. Neugebauer The main result says that a non-negative BMO-function w, whose reciprocal is also in BMO, belongs to p> A p,and

More information

SOME TYPES OF CONVERGENCE OF SEQUENCES OF REAL VALUED FUNCTIONS

SOME TYPES OF CONVERGENCE OF SEQUENCES OF REAL VALUED FUNCTIONS Real Analysis Exchange Vol. 28(2), 2002/2003, pp. 43 59 Ruchi Das, Department of Mathematics, Faculty of Science, The M.S. University Of Baroda, Vadodara - 390002, India. email: ruchid99@yahoo.com Nikolaos

More information

On the Algebraic Structures of Soft Sets in Logic

On the Algebraic Structures of Soft Sets in Logic Applied Mathematical Sciences, Vol. 8, 2014, no. 38, 1873-1881 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2014.43127 On the Algebraic Structures of Soft Sets in Logic Burak Kurt Department

More information

MA651 Topology. Lecture 6. Separation Axioms.

MA651 Topology. Lecture 6. Separation Axioms. MA651 Topology. Lecture 6. Separation Axioms. This text is based on the following books: Fundamental concepts of topology by Peter O Neil Elements of Mathematics: General Topology by Nicolas Bourbaki Counterexamples

More information

ON SUPERCYCLICITY CRITERIA. Nuha H. Hamada Business Administration College Al Ain University of Science and Technology 5-th st, Abu Dhabi, 112612, UAE

ON SUPERCYCLICITY CRITERIA. Nuha H. Hamada Business Administration College Al Ain University of Science and Technology 5-th st, Abu Dhabi, 112612, UAE International Journal of Pure and Applied Mathematics Volume 101 No. 3 2015, 401-405 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu doi: http://dx.doi.org/10.12732/ijpam.v101i3.7

More information

1 Fixed Point Iteration and Contraction Mapping Theorem

1 Fixed Point Iteration and Contraction Mapping Theorem 1 Fixed Point Iteration and Contraction Mapping Theorem Notation: For two sets A,B we write A B iff x A = x B. So A A is true. Some people use the notation instead. 1.1 Introduction Consider a function

More information

Semi-symmetric non-metric connections on a Kähler manifold

Semi-symmetric non-metric connections on a Kähler manifold Semi-symmetric non-metric connections on a Kähler manifold B.B. Chaturvedi and P.N. Pandey Abstract. In the present paper, we have study Kähler manifolds equipped with a semi-symmetric non-metric connection.

More information

MATH 304 Linear Algebra Lecture 4: Matrix multiplication. Diagonal matrices. Inverse matrix.

MATH 304 Linear Algebra Lecture 4: Matrix multiplication. Diagonal matrices. Inverse matrix. MATH 304 Linear Algebra Lecture 4: Matrix multiplication. Diagonal matrices. Inverse matrix. Matrices Definition. An m-by-n matrix is a rectangular array of numbers that has m rows and n columns: a 11

More information

Factorization Theorems

Factorization Theorems Chapter 7 Factorization Theorems This chapter highlights a few of the many factorization theorems for matrices While some factorization results are relatively direct, others are iterative While some factorization

More information

Lecture 6: The Group Inverse

Lecture 6: The Group Inverse Lecture 6: The Group Inverse The matrix index Let A C n n, k positive integer. Then R(A k+1 ) R(A k ). The index of A, denoted IndA, is the smallest integer k such that R(A k ) = R(A k+1 ), or equivalently,

More information

3.1. Sequences and Their Limits Definition (3.1.1). A sequence of real numbers (or a sequence in R) is a function from N into R.

3.1. Sequences and Their Limits Definition (3.1.1). A sequence of real numbers (or a sequence in R) is a function from N into R. CHAPTER 3 Sequences and Series 3.. Sequences and Their Limits Definition (3..). A sequence of real numbers (or a sequence in R) is a function from N into R. Notation. () The values of X : N! R are denoted

More information

PUTNAM TRAINING POLYNOMIALS. Exercises 1. Find a polynomial with integral coefficients whose zeros include 2 + 5.

PUTNAM TRAINING POLYNOMIALS. Exercises 1. Find a polynomial with integral coefficients whose zeros include 2 + 5. PUTNAM TRAINING POLYNOMIALS (Last updated: November 17, 2015) Remark. This is a list of exercises on polynomials. Miguel A. Lerma Exercises 1. Find a polynomial with integral coefficients whose zeros include

More information

The Hadamard Product

The Hadamard Product The Hadamard Product Elizabeth Million April 12, 2007 1 Introduction and Basic Results As inexperienced mathematicians we may have once thought that the natural definition for matrix multiplication would

More information

MATH31011/MATH41011/MATH61011: FOURIER ANALYSIS AND LEBESGUE INTEGRATION. Chapter 4: Fourier Series and L 2 ([ π, π], µ) ( 1 π

MATH31011/MATH41011/MATH61011: FOURIER ANALYSIS AND LEBESGUE INTEGRATION. Chapter 4: Fourier Series and L 2 ([ π, π], µ) ( 1 π MATH31011/MATH41011/MATH61011: FOURIER ANALYSIS AND LEBESGUE INTEGRATION Chapter 4: Fourier Series and L ([, π], µ) Square Integrable Functions Definition. Let f : [, π] R be measurable. We say that f

More information

CONSTANT-SIGN SOLUTIONS FOR A NONLINEAR NEUMANN PROBLEM INVOLVING THE DISCRETE p-laplacian. Pasquale Candito and Giuseppina D Aguí

CONSTANT-SIGN SOLUTIONS FOR A NONLINEAR NEUMANN PROBLEM INVOLVING THE DISCRETE p-laplacian. Pasquale Candito and Giuseppina D Aguí Opuscula Math. 34 no. 4 2014 683 690 http://dx.doi.org/10.7494/opmath.2014.34.4.683 Opuscula Mathematica CONSTANT-SIGN SOLUTIONS FOR A NONLINEAR NEUMANN PROBLEM INVOLVING THE DISCRETE p-laplacian Pasquale

More information

Relatively dense sets, corrected uniformly almost periodic functions on time scales, and generalizations

Relatively dense sets, corrected uniformly almost periodic functions on time scales, and generalizations Wang and Agarwal Advances in Difference Equations (2015) 2015:312 DOI 10.1186/s13662-015-0650-0 R E S E A R C H Open Access Relatively dense sets, corrected uniformly almost periodic functions on time

More information

Groups, Rings, and Fields. I. Sets Let S be a set. The Cartesian product S S is the set of ordered pairs of elements of S, S S = {(x, y) x, y S}.

Groups, Rings, and Fields. I. Sets Let S be a set. The Cartesian product S S is the set of ordered pairs of elements of S, S S = {(x, y) x, y S}. Groups, Rings, and Fields I. Sets Let S be a set. The Cartesian product S S is the set of ordered pairs of elements of S, A binary operation φ is a function, S S = {(x, y) x, y S}. φ : S S S. A binary

More information

Chapter 5. Banach Spaces

Chapter 5. Banach Spaces 9 Chapter 5 Banach Spaces Many linear equations may be formulated in terms of a suitable linear operator acting on a Banach space. In this chapter, we study Banach spaces and linear operators acting on

More information

Metric Spaces. Chapter 1

Metric Spaces. Chapter 1 Chapter 1 Metric Spaces Many of the arguments you have seen in several variable calculus are almost identical to the corresponding arguments in one variable calculus, especially arguments concerning convergence

More information

Research Article On the Rank of Elliptic Curves in Elementary Cubic Extensions

Research Article On the Rank of Elliptic Curves in Elementary Cubic Extensions Numbers Volume 2015, Article ID 501629, 4 pages http://dx.doi.org/10.1155/2015/501629 Research Article On the Rank of Elliptic Curves in Elementary Cubic Extensions Rintaro Kozuma College of International

More information

FACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z

FACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z FACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z DANIEL BIRMAJER, JUAN B GIL, AND MICHAEL WEINER Abstract We consider polynomials with integer coefficients and discuss their factorization

More information

HOMEWORK 5 SOLUTIONS. n!f n (1) lim. ln x n! + xn x. 1 = G n 1 (x). (2) k + 1 n. (n 1)!

HOMEWORK 5 SOLUTIONS. n!f n (1) lim. ln x n! + xn x. 1 = G n 1 (x). (2) k + 1 n. (n 1)! Math 7 Fall 205 HOMEWORK 5 SOLUTIONS Problem. 2008 B2 Let F 0 x = ln x. For n 0 and x > 0, let F n+ x = 0 F ntdt. Evaluate n!f n lim n ln n. By directly computing F n x for small n s, we obtain the following

More information

Matrix Norms. Tom Lyche. September 28, Centre of Mathematics for Applications, Department of Informatics, University of Oslo

Matrix Norms. Tom Lyche. September 28, Centre of Mathematics for Applications, Department of Informatics, University of Oslo Matrix Norms Tom Lyche Centre of Mathematics for Applications, Department of Informatics, University of Oslo September 28, 2009 Matrix Norms We consider matrix norms on (C m,n, C). All results holds for

More information

EXISTENCE AND NON-EXISTENCE RESULTS FOR A NONLINEAR HEAT EQUATION

EXISTENCE AND NON-EXISTENCE RESULTS FOR A NONLINEAR HEAT EQUATION Sixth Mississippi State Conference on Differential Equations and Computational Simulations, Electronic Journal of Differential Equations, Conference 5 (7), pp. 5 65. ISSN: 7-669. UL: http://ejde.math.txstate.edu

More information

Riesz-Fredhölm Theory

Riesz-Fredhölm Theory Riesz-Fredhölm Theory T. Muthukumar tmk@iitk.ac.in Contents 1 Introduction 1 2 Integral Operators 1 3 Compact Operators 7 4 Fredhölm Alternative 14 Appendices 18 A Ascoli-Arzelá Result 18 B Normed Spaces

More information

MATH 289 PROBLEM SET 1: INDUCTION. 1. The induction Principle The following property of the natural numbers is intuitively clear:

MATH 289 PROBLEM SET 1: INDUCTION. 1. The induction Principle The following property of the natural numbers is intuitively clear: MATH 89 PROBLEM SET : INDUCTION The induction Principle The following property of the natural numbers is intuitively clear: Axiom Every nonempty subset of the set of nonnegative integers Z 0 = {0,,, 3,

More information

Introduction to Algebraic Geometry. Bézout s Theorem and Inflection Points

Introduction to Algebraic Geometry. Bézout s Theorem and Inflection Points Introduction to Algebraic Geometry Bézout s Theorem and Inflection Points 1. The resultant. Let K be a field. Then the polynomial ring K[x] is a unique factorisation domain (UFD). Another example of a

More information

ON ROUGH (m, n) BI-Γ-HYPERIDEALS IN Γ-SEMIHYPERGROUPS

ON ROUGH (m, n) BI-Γ-HYPERIDEALS IN Γ-SEMIHYPERGROUPS U.P.B. Sci. Bull., Series A, Vol. 75, Iss. 1, 2013 ISSN 1223-7027 ON ROUGH m, n) BI-Γ-HYPERIDEALS IN Γ-SEMIHYPERGROUPS Naveed Yaqoob 1, Muhammad Aslam 1, Bijan Davvaz 2, Arsham Borumand Saeid 3 In this

More information

Sumit Chandok and T. D. Narang INVARIANT POINTS OF BEST APPROXIMATION AND BEST SIMULTANEOUS APPROXIMATION

Sumit Chandok and T. D. Narang INVARIANT POINTS OF BEST APPROXIMATION AND BEST SIMULTANEOUS APPROXIMATION F A S C I C U L I M A T H E M A T I C I Nr 51 2013 Sumit Chandok and T. D. Narang INVARIANT POINTS OF BEST APPROXIMATION AND BEST SIMULTANEOUS APPROXIMATION Abstract. In this paper we generalize and extend

More information

Section 6.1 - Inner Products and Norms

Section 6.1 - Inner Products and Norms Section 6.1 - Inner Products and Norms Definition. Let V be a vector space over F {R, C}. An inner product on V is a function that assigns, to every ordered pair of vectors x and y in V, a scalar in F,

More information

The Dirichlet Unit Theorem

The Dirichlet Unit Theorem Chapter 6 The Dirichlet Unit Theorem As usual, we will be working in the ring B of algebraic integers of a number field L. Two factorizations of an element of B are regarded as essentially the same if

More information

CONTRIBUTIONS TO ZERO SUM PROBLEMS

CONTRIBUTIONS TO ZERO SUM PROBLEMS CONTRIBUTIONS TO ZERO SUM PROBLEMS S. D. ADHIKARI, Y. G. CHEN, J. B. FRIEDLANDER, S. V. KONYAGIN AND F. PAPPALARDI Abstract. A prototype of zero sum theorems, the well known theorem of Erdős, Ginzburg

More information

1. Prove that the empty set is a subset of every set.

1. Prove that the empty set is a subset of every set. 1. Prove that the empty set is a subset of every set. Basic Topology Written by Men-Gen Tsai email: b89902089@ntu.edu.tw Proof: For any element x of the empty set, x is also an element of every set since

More information

I. GROUPS: BASIC DEFINITIONS AND EXAMPLES

I. GROUPS: BASIC DEFINITIONS AND EXAMPLES I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called

More information

On the Spaces of λ-convergent and Bounded Sequences

On the Spaces of λ-convergent and Bounded Sequences Thai Journal of Mathematics Volume 8 2010 Number 2 : 311 329 www.math.science.cmu.ac.th/thaijournal Online ISSN 1686-0209 On the Spaces of λ-convergent and Bounded Sequences M. Mursaleen 1 and A.K. Noman

More information

Degree Hypergroupoids Associated with Hypergraphs

Degree Hypergroupoids Associated with Hypergraphs Filomat 8:1 (014), 119 19 DOI 10.98/FIL1401119F Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat Degree Hypergroupoids Associated

More information

Sequences of Functions

Sequences of Functions Sequences of Functions Uniform convergence 9. Assume that f n f uniformly on S and that each f n is bounded on S. Prove that {f n } is uniformly bounded on S. Proof: Since f n f uniformly on S, then given

More information

ON LIMIT LAWS FOR CENTRAL ORDER STATISTICS UNDER POWER NORMALIZATION. E. I. Pancheva, A. Gacovska-Barandovska

ON LIMIT LAWS FOR CENTRAL ORDER STATISTICS UNDER POWER NORMALIZATION. E. I. Pancheva, A. Gacovska-Barandovska Pliska Stud. Math. Bulgar. 22 (2015), STUDIA MATHEMATICA BULGARICA ON LIMIT LAWS FOR CENTRAL ORDER STATISTICS UNDER POWER NORMALIZATION E. I. Pancheva, A. Gacovska-Barandovska Smirnov (1949) derived four

More information

IRREDUCIBLE OPERATOR SEMIGROUPS SUCH THAT AB AND BA ARE PROPORTIONAL. 1. Introduction

IRREDUCIBLE OPERATOR SEMIGROUPS SUCH THAT AB AND BA ARE PROPORTIONAL. 1. Introduction IRREDUCIBLE OPERATOR SEMIGROUPS SUCH THAT AB AND BA ARE PROPORTIONAL R. DRNOVŠEK, T. KOŠIR Dedicated to Prof. Heydar Radjavi on the occasion of his seventieth birthday. Abstract. Let S be an irreducible

More information

THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS

THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS KEITH CONRAD 1. Introduction The Fundamental Theorem of Algebra says every nonconstant polynomial with complex coefficients can be factored into linear

More information

SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH

SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH 31 Kragujevac J. Math. 25 (2003) 31 49. SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH Kinkar Ch. Das Department of Mathematics, Indian Institute of Technology, Kharagpur 721302, W.B.,

More information

MATH 304 Linear Algebra Lecture 20: Inner product spaces. Orthogonal sets.

MATH 304 Linear Algebra Lecture 20: Inner product spaces. Orthogonal sets. MATH 304 Linear Algebra Lecture 20: Inner product spaces. Orthogonal sets. Norm The notion of norm generalizes the notion of length of a vector in R n. Definition. Let V be a vector space. A function α

More information

Further Study on Strong Lagrangian Duality Property for Invex Programs via Penalty Functions 1

Further Study on Strong Lagrangian Duality Property for Invex Programs via Penalty Functions 1 Further Study on Strong Lagrangian Duality Property for Invex Programs via Penalty Functions 1 J. Zhang Institute of Applied Mathematics, Chongqing University of Posts and Telecommunications, Chongqing

More information

SOLUTIONS TO EXERCISES FOR. MATHEMATICS 205A Part 3. Spaces with special properties

SOLUTIONS TO EXERCISES FOR. MATHEMATICS 205A Part 3. Spaces with special properties SOLUTIONS TO EXERCISES FOR MATHEMATICS 205A Part 3 Fall 2008 III. Spaces with special properties III.1 : Compact spaces I Problems from Munkres, 26, pp. 170 172 3. Show that a finite union of compact subspaces

More information

Math 2331 Linear Algebra

Math 2331 Linear Algebra 2.2 The Inverse of a Matrix Math 2331 Linear Algebra 2.2 The Inverse of a Matrix Jiwen He Department of Mathematics, University of Houston jiwenhe@math.uh.edu math.uh.edu/ jiwenhe/math2331 Jiwen He, University

More information

Homework: 2.1 (page 56): 7, 9, 13, 15, 17, 25, 27, 35, 37, 41, 46, 49, 67

Homework: 2.1 (page 56): 7, 9, 13, 15, 17, 25, 27, 35, 37, 41, 46, 49, 67 Chapter Matrices Operations with Matrices Homework: (page 56):, 9, 3, 5,, 5,, 35, 3, 4, 46, 49, 6 Main points in this section: We define a few concept regarding matrices This would include addition of

More information

Lecture 2: Abhyankar s Results on the Newton Polygon

Lecture 2: Abhyankar s Results on the Newton Polygon Lecture 2: Abhyankar s Results on the Newton Polygon Definition. Let P(X, Y ) = p ij X i Y j C[X, Y ]. The support of P, S(P), is the set {(i, j) N N f ij 0}. The Newton polygon of P, N(P), is the convex

More information

n k=1 k=0 1/k! = e. Example 6.4. The series 1/k 2 converges in R. Indeed, if s n = n then k=1 1/k, then s 2n s n = 1 n + 1 +...

n k=1 k=0 1/k! = e. Example 6.4. The series 1/k 2 converges in R. Indeed, if s n = n then k=1 1/k, then s 2n s n = 1 n + 1 +... 6 Series We call a normed space (X, ) a Banach space provided that every Cauchy sequence (x n ) in X converges. For example, R with the norm = is an example of Banach space. Now let (x n ) be a sequence

More information

On common approximate fixed points of monotone nonexpansive semigroups in Banach spaces

On common approximate fixed points of monotone nonexpansive semigroups in Banach spaces Bachar and Khamsi Fixed Point Theory and Applications (215) 215:16 DOI 1.1186/s13663-15-45-3 R E S E A R C H Open Access On common approximate fixed points of monotone nonexpansive semigroups in Banach

More information

Double Sequences and Double Series

Double Sequences and Double Series Double Sequences and Double Series Eissa D. Habil Islamic University of Gaza P.O. Box 108, Gaza, Palestine E-mail: habil@iugaza.edu Abstract This research considers two traditional important questions,

More information

MATH 304 Linear Algebra Lecture 8: Inverse matrix (continued). Elementary matrices. Transpose of a matrix.

MATH 304 Linear Algebra Lecture 8: Inverse matrix (continued). Elementary matrices. Transpose of a matrix. MATH 304 Linear Algebra Lecture 8: Inverse matrix (continued). Elementary matrices. Transpose of a matrix. Inverse matrix Definition. Let A be an n n matrix. The inverse of A is an n n matrix, denoted

More information

Pooja Sharma and R. S. Chandel FIXED POINT THEOREMS FOR WEAKLY COMPATIBLE MAPPINGS IN FUZZY METRIC SPACES. 1. Introduction

Pooja Sharma and R. S. Chandel FIXED POINT THEOREMS FOR WEAKLY COMPATIBLE MAPPINGS IN FUZZY METRIC SPACES. 1. Introduction F A S C I C U L I M A T H E M A T I C I Nr 51 2013 Pooja Sharma and R. S. Chandel FIXED POINT THEOREMS FOR WEAKLY COMPATIBLE MAPPINGS IN FUZZY METRIC SPACES Abstract. This paper presents some fixed point

More information

Math 5311 Gateaux differentials and Frechet derivatives

Math 5311 Gateaux differentials and Frechet derivatives Math 5311 Gateaux differentials and Frechet derivatives Kevin Long January 26, 2009 1 Differentiation in vector spaces Thus far, we ve developed the theory of minimization without reference to derivatives.

More information

MATH 425, PRACTICE FINAL EXAM SOLUTIONS.

MATH 425, PRACTICE FINAL EXAM SOLUTIONS. MATH 45, PRACTICE FINAL EXAM SOLUTIONS. Exercise. a Is the operator L defined on smooth functions of x, y by L u := u xx + cosu linear? b Does the answer change if we replace the operator L by the operator

More information

Irreducibility criteria for compositions and multiplicative convolutions of polynomials with integer coefficients

Irreducibility criteria for compositions and multiplicative convolutions of polynomials with integer coefficients DOI: 10.2478/auom-2014-0007 An. Şt. Univ. Ovidius Constanţa Vol. 221),2014, 73 84 Irreducibility criteria for compositions and multiplicative convolutions of polynomials with integer coefficients Anca

More information

Some Problems of Second-Order Rational Difference Equations with Quadratic Terms

Some Problems of Second-Order Rational Difference Equations with Quadratic Terms International Journal of Difference Equations ISSN 0973-6069, Volume 9, Number 1, pp. 11 21 (2014) http://campus.mst.edu/ijde Some Problems of Second-Order Rational Difference Equations with Quadratic

More information

4. Expanding dynamical systems

4. Expanding dynamical systems 4.1. Metric definition. 4. Expanding dynamical systems Definition 4.1. Let X be a compact metric space. A map f : X X is said to be expanding if there exist ɛ > 0 and L > 1 such that d(f(x), f(y)) Ld(x,

More information

Mathematics Course 111: Algebra I Part IV: Vector Spaces

Mathematics Course 111: Algebra I Part IV: Vector Spaces Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are

More information

The Inverse of a Square Matrix

The Inverse of a Square Matrix These notes closely follow the presentation of the material given in David C Lay s textbook Linear Algebra and its Applications (3rd edition) These notes are intended primarily for in-class presentation

More information

F. ABTAHI and M. ZARRIN. (Communicated by J. Goldstein)

F. ABTAHI and M. ZARRIN. (Communicated by J. Goldstein) Journal of Algerian Mathematical Society Vol. 1, pp. 1 6 1 CONCERNING THE l p -CONJECTURE FOR DISCRETE SEMIGROUPS F. ABTAHI and M. ZARRIN (Communicated by J. Goldstein) Abstract. For 2 < p

More information

AN IMPROVED EXPONENTIAL REGULA FALSI METHODS WITH CUBIC CONVERGENCE FOR SOLVING NONLINEAR EQUATIONS

AN IMPROVED EXPONENTIAL REGULA FALSI METHODS WITH CUBIC CONVERGENCE FOR SOLVING NONLINEAR EQUATIONS J. Appl. Math. & Informatics Vol. 8(010), No. 5-6, pp. 1467-1476 Website: http://www.kcam.biz AN IMPROVED EXPONENTIAL REGULA FALSI METHODS WITH CUBIC CONVERGENCE FOR SOLVING NONLINEAR EQUATIONS S. A. HODA

More information

4.3 Limit of a Sequence: Theorems

4.3 Limit of a Sequence: Theorems 4.3. LIMIT OF A SEQUENCE: THEOREMS 5 4.3 Limit of a Sequence: Theorems These theorems fall in two categories. The first category deals with ways to combine sequences. Like numbers, sequences can be added,

More information

max cx s.t. Ax c where the matrix A, cost vector c and right hand side b are given and x is a vector of variables. For this example we have x

max cx s.t. Ax c where the matrix A, cost vector c and right hand side b are given and x is a vector of variables. For this example we have x Linear Programming Linear programming refers to problems stated as maximization or minimization of a linear function subject to constraints that are linear equalities and inequalities. Although the study

More information

Chapter 7. Induction and Recursion. Part 1. Mathematical Induction

Chapter 7. Induction and Recursion. Part 1. Mathematical Induction Chapter 7. Induction and Recursion Part 1. Mathematical Induction The principle of mathematical induction is this: to establish an infinite sequence of propositions P 1, P 2, P 3,..., P n,... (or, simply

More information

A MIXED TYPE IDENTIFICATION PROBLEM RELATED TO A PHASE-FIELD MODEL WITH MEMORY

A MIXED TYPE IDENTIFICATION PROBLEM RELATED TO A PHASE-FIELD MODEL WITH MEMORY Guidetti, D. and Lorenzi, A. Osaka J. Math. 44 (27), 579 613 A MIXED TYPE IDENTIFICATION PROBLEM RELATED TO A PHASE-FIELD MODEL WITH MEMORY DAVIDE GUIDETTI and ALFREDO LORENZI (Received January 23, 26,

More information

EXPLICIT ABS SOLUTION OF A CLASS OF LINEAR INEQUALITY SYSTEMS AND LP PROBLEMS. Communicated by Mohammad Asadzadeh. 1. Introduction

EXPLICIT ABS SOLUTION OF A CLASS OF LINEAR INEQUALITY SYSTEMS AND LP PROBLEMS. Communicated by Mohammad Asadzadeh. 1. Introduction Bulletin of the Iranian Mathematical Society Vol. 30 No. 2 (2004), pp 21-38. EXPLICIT ABS SOLUTION OF A CLASS OF LINEAR INEQUALITY SYSTEMS AND LP PROBLEMS H. ESMAEILI, N. MAHDAVI-AMIRI AND E. SPEDICATO

More information

Metric Spaces. Chapter 7. 7.1. Metrics

Metric Spaces. Chapter 7. 7.1. Metrics Chapter 7 Metric Spaces A metric space is a set X that has a notion of the distance d(x, y) between every pair of points x, y X. The purpose of this chapter is to introduce metric spaces and give some

More information

On linear isometries on non-archimedean power series spaces

On linear isometries on non-archimedean power series spaces On linear isometries on non-archimedean power series spaces Wies law Śliwa and Agnieszka Ziemkowska Abstract. The non-archimedean power series spaces A p (a, t) are the most known and important examples

More information

ON INDUCED SUBGRAPHS WITH ALL DEGREES ODD. 1. Introduction

ON INDUCED SUBGRAPHS WITH ALL DEGREES ODD. 1. Introduction ON INDUCED SUBGRAPHS WITH ALL DEGREES ODD A.D. SCOTT Abstract. Gallai proved that the vertex set of any graph can be partitioned into two sets, each inducing a subgraph with all degrees even. We prove

More information

TRIPLE POSITIVE SOLUTIONS FOR BOUNDARY VALUE PROBLEM OF A NONLINEAR FRACTIONAL DIFFERENTIAL EQUATION. Communicated by Mohammad Asadzadeh

TRIPLE POSITIVE SOLUTIONS FOR BOUNDARY VALUE PROBLEM OF A NONLINEAR FRACTIONAL DIFFERENTIAL EQUATION. Communicated by Mohammad Asadzadeh Bulletin of the Iranian Mathematical Society Vol. 33 No. 2 (27), pp -. TRIPLE POSITIVE SOLUTIONS FOR BOUNDARY VALUE PROBLEM OF A NONLINEAR FRACTIONAL DIFFERENTIAL EQUATION R. DEHGHANI AND K. GHANBARI*

More information

Multiplicative Relaxation with respect to Thompson s Metric

Multiplicative Relaxation with respect to Thompson s Metric Revista Colombiana de Matemáticas Volumen 48(2042, páginas 2-27 Multiplicative Relaxation with respect to Thompson s Metric Relajamiento multiplicativo con respecto a la métrica de Thompson Gerd Herzog

More information

Notes V General Equilibrium: Positive Theory. 1 Walrasian Equilibrium and Excess Demand

Notes V General Equilibrium: Positive Theory. 1 Walrasian Equilibrium and Excess Demand Notes V General Equilibrium: Positive Theory In this lecture we go on considering a general equilibrium model of a private ownership economy. In contrast to the Notes IV, we focus on positive issues such

More information

Continuity of the Perron Root

Continuity of the Perron Root Linear and Multilinear Algebra http://dx.doi.org/10.1080/03081087.2014.934233 ArXiv: 1407.7564 (http://arxiv.org/abs/1407.7564) Continuity of the Perron Root Carl D. Meyer Department of Mathematics, North

More information

Bounds on the spectral radius of a Hadamard product of nonnegative or positive semidefinite matrices

Bounds on the spectral radius of a Hadamard product of nonnegative or positive semidefinite matrices Electronic Journal of Linear Algebra Volume 20 Volume 20 (2010) Article 6 2010 Bounds on the spectral radius of a Hadamard product of nonnegative or positive semidefinite matrices Roger A. Horn rhorn@math.utah.edu

More information

Random graphs with a given degree sequence

Random graphs with a given degree sequence Sourav Chatterjee (NYU) Persi Diaconis (Stanford) Allan Sly (Microsoft) Let G be an undirected simple graph on n vertices. Let d 1,..., d n be the degrees of the vertices of G arranged in descending order.

More information

We shall turn our attention to solving linear systems of equations. Ax = b

We shall turn our attention to solving linear systems of equations. Ax = b 59 Linear Algebra We shall turn our attention to solving linear systems of equations Ax = b where A R m n, x R n, and b R m. We already saw examples of methods that required the solution of a linear system

More information

Prime Numbers and Irreducible Polynomials

Prime Numbers and Irreducible Polynomials Prime Numbers and Irreducible Polynomials M. Ram Murty The similarity between prime numbers and irreducible polynomials has been a dominant theme in the development of number theory and algebraic geometry.

More information

The Characteristic Polynomial

The Characteristic Polynomial Physics 116A Winter 2011 The Characteristic Polynomial 1 Coefficients of the characteristic polynomial Consider the eigenvalue problem for an n n matrix A, A v = λ v, v 0 (1) The solution to this problem

More information

Continued Fractions and the Euclidean Algorithm

Continued Fractions and the Euclidean Algorithm Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction

More information

2 Polynomials over a field

2 Polynomials over a field 2 Polynomials over a field A polynomial over a field F is a sequence (a 0, a 1, a 2,, a n, ) where a i F i with a i = 0 from some point on a i is called the i th coefficient of f We define three special

More information

Chapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm.

Chapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm. Chapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm. We begin by defining the ring of polynomials with coefficients in a ring R. After some preliminary results, we specialize

More information

Duality of linear conic problems

Duality of linear conic problems Duality of linear conic problems Alexander Shapiro and Arkadi Nemirovski Abstract It is well known that the optimal values of a linear programming problem and its dual are equal to each other if at least

More information

Sign pattern matrices that admit M, N, P or inverse M matrices

Sign pattern matrices that admit M, N, P or inverse M matrices Sign pattern matrices that admit M, N, P or inverse M matrices C Mendes Araújo, Juan R Torregrosa CMAT - Centro de Matemática / Dpto de Matemática Aplicada Universidade do Minho / Universidad Politécnica

More information

PROPERTIES OF SOME NEW SEMINORMED SEQUENCE SPACES DEFINED BY A MODULUS FUNCTION

PROPERTIES OF SOME NEW SEMINORMED SEQUENCE SPACES DEFINED BY A MODULUS FUNCTION STUDIA UNIV. BABEŞ BOLYAI, MATHEMATICA, Volume L, Number 3, September 2005 PROPERTIES OF SOME NEW SEMINORMED SEQUENCE SPACES DEFINED BY A MODULUS FUNCTION YAVUZ ALTIN AYŞEGÜL GÖKHAN HIFSI ALTINOK Abstract.

More information

A note on companion matrices

A note on companion matrices Linear Algebra and its Applications 372 (2003) 325 33 www.elsevier.com/locate/laa A note on companion matrices Miroslav Fiedler Academy of Sciences of the Czech Republic Institute of Computer Science Pod

More information

Absolute Value Programming

Absolute Value Programming Computational Optimization and Aplications,, 1 11 (2006) c 2006 Springer Verlag, Boston. Manufactured in The Netherlands. Absolute Value Programming O. L. MANGASARIAN olvi@cs.wisc.edu Computer Sciences

More information

Institute of Computer Science. An Iterative Method for Solving Absolute Value Equations

Institute of Computer Science. An Iterative Method for Solving Absolute Value Equations Institute of Computer Science Academy of Sciences of the Czech Republic An Iterative Method for Solving Absolute Value Equations Vahideh Hooshyarbakhsh, Taher Lotfi, Raena Farhadsefat, and Jiri Rohn Technical

More information

Reverse Poincaré-type inequalities for the weak solution of system of partial differential inequalities

Reverse Poincaré-type inequalities for the weak solution of system of partial differential inequalities Shoaib Saleem et al. Journal of Inequalities and Applications (2016) 2016:265 OI 10.1186/s13660-016-1204-z R E S E A R C H Open Access Reverse Poincaré-type inequalities for the weak solution of system

More information