General viscosity iterative method for a sequence of quasi-nonexpansive mappings
|
|
- Camron Griffith
- 5 years ago
- Views:
Transcription
1 Avalable onlne at J. Nonlnear Sc. Appl. 9 (2016), Research Artcle General vscosty teratve method for a sequence of quas-nonexpansve mappngs Cuje Zhang, Ynan Wang College of Scence, Cvl Avaton Unversty of Chna, Tanjn , Chna. Communcated by Y. H. Yao Abstract In ths paper, we study a general vscosty teratve method due to Aoyama and Kohsaka for the fxed pont problem of quas-nonexpansve mappngs n Hlbert space. Frst, we obtan a strong convergence theorem for a sequence of quas-nonexpansve mappngs. Then we gve two applcatons about varatonal nequalty problem to encourage our man theorem. Moreover, we gve a numercal example to llustrate our man theorem. c 2016 All rghts reserved. Keywords: Quas-nonexpansve mappng, varatonal nequalty, fxed pont, vscosty teratve method MSC: 47H10, 47J Introducton Throughout the present paper, let H be a real Hlbert space wth nner product, and norm. Let C be a nonempty closed convex subset of H and T : C C be a mappng. In ths paper, we denote the fxed-pont set of T by F x(t ). A mappng T s sad to be quas-nonexpansve, f F x(t ) and T x p x p for all x C and p F x(t ). We know that f T : C C s quas-nonexpansve, then F x(t ) s closed and convex (see [3] for more general results). A mappng T s sad to be nonexpansve, f T x T y x y for all x, y C. A mappng T s called demclosed at 0, f any sequence {x n } weakly converges to x, and f the sequence {T x n } strongly converges to 0, then T x = 0. The vscosty teratve method was proposed by Moudaf [11] frstly. Choose an arbtrary ntal x 0 H, the sequence {x n } s constructed by: x n+1 = ε n f(x n ) + 1 T x n, n 0, 1 + ε n 1 + ε n Correspondng author Emal addresses: cuje_zhang@126.com (Cuje Zhang), ynan_wang@163.com (Ynan Wang) Receved
2 C. Zhang, Y. Wang, J. Nonlnear Sc. Appl. 9 (2016), where T s a nonexpansve mappng and f s a contracton wth a coeffcent α [0, 1) on H, the sequence {ε n } s n (0, 1), such that: () lm n ε n = 0; () n=0 ε n = ; () lm n ( 1 ε n 1 ε n+1 ) = 0. Then lm n x n = x, where x C(C = F x(t )) s the unque soluton of the varatonal nequalty (I f)x, x x 0, x F x(t ). (1.1) Mangé consdered the vscosty teratve method for quas-nonexpansve mappngs n Hlbert space n [9]. Hs focus was on the followng algorthm: x n+1 = α n f(x n ) + (1 α n )T ω x n, where {α n } s a slow vanshng sequence, and ω (0, 1], T ω := (1 ω)i + ωt, T has two man condtons: () T s quas-nonexpansve; () I T s demclosed at 0. He proved the sequence {x n } converges strongly to the unque soluton of the varatonal nequalty (1.1). Tan and Jn consdered the followng teratve process n [13]: x n+1 = α n γf(x n ) + (I α n A)T ω x n, n 0, where the sequence {α n } satsfes certan condtons, ω (0, 1 2 ), T ω = (1 ω)i + ωt, and T s also satsfed the same condtons n Mangé [9]. Then they proved that {x n } converges strongly to the unque soluton of the varatonal nequalty: (γf A)x, x x 0, x F x(t ). Recently, Aoyama and Kohsaka consdered the followng general teratve method n [1]: x n+1 = α n f n (x n ) + (1 α n )S n x n, where f n s a θ-contracton wth respect to Ω = n=1 F x(s n) and {f n } s stable on Ω, and {S n } s a sequence of strongly quas-nonexpansve mappngs of C nto C. That s to say, S n s quas-nonexpansve and S n x n x n 0 whenever {x n } s a bounded sequence n C and x n p S n x n p 0 for some pont p Ω. Then they proved that f the sequence {α n } satsfes approprate condtons, {x n } converges strongly to the unque fxed pont of a contracton P Ω f 1. Many varous teratve algorthms have been studed and extended by many authors, especally about quas-nonexpansve mappngs (see [1, 4, 6 13, 15]). Motvated by the above results, we extend the teratve method to quas-nonexpansve mappngs. We consder the followng teratve process: x n+1 = α n f n (x n ) + =1 (α 1 α )S λn x n, (1.2) where S λn = (1 λ n )I + λ n S, and {S } =1 s a sequence of quas-nonexpansve mappngs. Under the approprate condtons, we establsh the strong convergence of the sequence {x n } generated by (1.2).
3 C. Zhang, Y. Wang, J. Nonlnear Sc. Appl. 9 (2016), Prelmnares We denote the strong convergence and the weak convergence of {x n } to x H by x n x and x n x, respectvely. Let f : C C be a mappng, Ω s a nonempty subset of C, and θ s a real number n [0, 1). A mappng f s sad to be a θ-contracton wth respect to Ω, f f(x) f(z) θ x z, x C, z Ω. f s sad to be a θ-contracton, f f s a θ-contracton wth respect to C. The followng lemmas are useful for our man result. Lemma 2.1 ([1]). Let Ω be a nonempty subset of C and f : C C a θ-contracton wth respect to Ω, where 0 θ < 1. If Ω s closed and convex, then P Ω f s a θ-contracton on Ω, where P Ω s the metrc projecton of H onto Ω. Lemma 2.2 ([1]). Let f : C C be a θ-contracton, where 0 θ < 1 and T : C C a quas-nonexpansve mappng. Then f T s a θ-contracton wth respect to F x(t ). Let D be a nonempty subset of C. A sequence {f n } of mappngs of C nto H s sad to be stable on D, f {f n (z) : n N} s a sngleton for every z D. It s clear that f {f n } s stable on D, then f n (z) = f 1 (z) for all n N and z D. Lemma 2.3 ([9]). Let T ω := (1 ω)i + ωt, wth T be a quas-nonexpansve mappng on H, F x(t ) φ, and ω (0, 1], q F x(t ). Then the followng statements are reached: () F x(t ) = F x(t ω ); () T ω s a quas-nonexpansve mappng; () T ω x q 2 x q 2 ω(1 ω) T x x 2 for all x H. Lemma 2.4 ([5]). Assume {s n } s a sequence of nonnegatve real numbers such that s n+1 (1 )s n + δ n, n 0, s n+1 s n η n + t n, n 0, where { } s a sequence n (0, 1), η n s a sequence of nonnegatve real numbers, and {δ n } and {t n } are two sequences n R such that: () n=0 = ; () lm n t n = 0; () lm k η nk = 0 mples lm sup k δ nk 0 for any subsequence {n k } {n}. Then lm n s n = 0. Lemma 2.5 ([10]). Assume A s a strongly postve lnear bounded operator on Hlbert space H wth coeffcent γ > 0 and 0 < ρ A 1. Then I ρa 1 ρ γ. 3. Man results In ths secton, we prove the followng strong convergence theorem. Theorem 3.1. Let H be a real Hlbert space, C a nonempty closed convex subset of H, {S n } a sequence of quas-nonexpansve mappngs of C nto C such that Ω = =1 F x(s ) s nonempty, and I S s demclosed at 0. Assume that {f n } s a sequence of mappngs of C nto C such that each f n s a θ-contracton wth
4 C. Zhang, Y. Wang, J. Nonlnear Sc. Appl. 9 (2016), respect to Ω and {f n } s stable on Ω, where 0 θ < 1. Let {x n } be a sequence defned by x 1 C and x n+1 = α n f n (x n ) + =1 (α 1 α )S λn x n, for n N, where S λn = (1 λ n )I+λ n S, λ n (0, 1] and {λ n } satsfes 0 < lm nf n λ n lm sup n λ n < 1. Suppose that {α n } s a sequence n (0, 1] such that α 0 = 1, α n 0, n=1 α n = and {α n } s strctly decreasng. Then {x n } converges to ω Ω, where ω s the unque fxed pont of a contracton P Ω f 1. and Frst, we show some lemmas, then we prove Theorem 3.1. In the rest of ths secton, we set γ n = α 2 n f n (x n ) ω 2 +2α n = α n (1 + (1 2θ)(1 α n )), =1 (α 1 α ) S λn Lemma 3.2. {x n }, {S x n } and {f n (x n )} are bounded, and moreover, x n+1 ω α n f n (x n ) ω + =1 x n ω, f 1 (ω) ω. (α 1 α ) S λn x n ω, (3.1) and hold for every n N. x n+1 ω 2 (1 ) x n ω 2 +γ n, Proof. From Lemma 2.3, we know S λn s quas-nonexpansve and F x(s ) = F x(s λn ) for all N. Snce f n s a θ-contracton wth respect to Ω, S λn s quas-nonexpansve, ω Ω F x(s ) = F x(s λn ), and {f n } s stable on Ω, t follows that x n+1 ω = α n f n (x n ) + =1 (α 1 α )S λn x n ω α n ( f n (x n ) f n (ω) + f n (ω) ω ) + (α 1 α ) S λn x n ω =1 α n θ x n ω +α n f 1 (ω) ω +(1 α n ) x n ω = (1 α n (1 θ)) x n ω +α n (1 θ) f 1(ω) ω 1 θ for every n N. Thus, by the nducton on n, for every N, we have (3.2) S x n ω x n ω max{ x 1 ω, f 1(ω) ω }. 1 θ Therefore, t turns out that {x n } and {S x n } are bounded, and moreover, {f n (x n )} s also bounded. Equaton (3.1) follows from (3.2). By assumpton, for every N, t follows that S λn x n ω, f n (x n ) ω S λn x n ω f n (x n ) f n (ω) + S λn x n ω, f n (ω) ω θ x n ω 2 + S λn x n ω, f 1 (ω) ω, (3.3)
5 C. Zhang, Y. Wang, J. Nonlnear Sc. Appl. 9 (2016), and thus x n+1 ω 2 = α n (f n (x n ) ω) + =1 = α 2 n f n (x n ) ω α n =1 (α 1 α )(S λn x n ω) 2 =1 (α 1 α )(S λn x n ω) 2 (α 1 α )(S λn x n ω), f n (x n ) ω α 2 n f n (x n ) ω 2 +(1 α n ) 2 x n ω 2 + 2α n (α 1 α ) S λn x n ω, f n (x n ) ω =1 α 2 n f n (x n ) ω 2 +(1 α n ) 2 x n ω 2 +2α n (1 α n )θ x n ω 2 + 2α n (α 1 α ) S λn x n ω, f 1 (ω) ω =1 = (1 ) x n ω 2 +γ n for every n N. Lemma 3.3. The followng hold: 0 < 1 for every n N; 2α n (1 α n )/ 1/(1 θ) and 2α n / 1/(1 θ); α 2 n f n (x n ) ω 2 / 0; n=1 =. Proof. Snce 0 < α n 1 and 1 < 1 2θ 1, we know that 0 < α 2 n = α n (1 + ( 1)(1 α n )) < α n (1 + (1 α n )) = α n (2 α n ) 1. From α n 0 we have 2α n (1 α n )/ 1/(1 θ) and 2α n / 1/(1 θ). Snce {f n (x n )} s bounded and αn 2 α n = 1 + (1 2θ)(1 α n ) 0, t follows that αn 2 f n (x n ) ω 2 / 0. Fnally, we prove n=1 =. Suppose that 1 2θ 0. Then t follows that α n for every n N. Thus, n=1 =. Next, we suppose that 1 2θ < 0. Then > 2(1 θ)α n for every n N. Thus, n=1 2(1 θ) n=1 α n =. Ths completes the proof. Proof of Theorem 3.1. By Lemma 2.1, t mples that P Ω f 1 s a θ-contracton on Ω and hence t has a unque fxed pont on Ω. From Lemma 3.2, we know that x n+1 ω 2 (1 ) x n ω 2 +α 2 n f n (x n ) ω 2 + 2α n (α 1 α ) S λn x n ω, f 1 (ω) ω =1
6 C. Zhang, Y. Wang, J. Nonlnear Sc. Appl. 9 (2016), whch mples that = (1 ) x n ω 2 +α 2 n f n (x n ) ω 2 + 2α n (α 1 α ) λ n (S x n x n ), f 1 (ω) ω =1 + 2α n (α 1 α ) x n ω, f 1 (ω) ω, =1 x n+1 ω 2 (1 ) x n ω 2 + [ α 2 n f n (x n ) ω 2 + 2α n λ n (α 1 α ) x n S x n f 1 (ω) ω =1 + 2α n (1 α n ) x n ω, f 1 (ω) ω On the other hand, we obtan from Lemma 2.3 () that By usng (3.3), we have x n+1 ω 2 = α n (f n (x n ) ω) + =1 = α 2 n f n (x n ) ω α n =1 ]. (α 1 α )(S λn x n ω) 2 =1 (α 1 α )(S λn x n ω) 2 (α 1 α )S λn x n ω, f n (x n ) ω αn 2 f n (x n ) ω 2 +(1 α n ) 2 x n ω 2 (1 α n )λ n (1 λ n ) (α 1 α ) S x n x n 2 =1 + 2α n (α 1 α ) S λn x n ω, f n (x n ) ω. =1 (1 α n ) 2 x n ω 2 +2α n (α 1 α ) S λn x n ω, f n (x n ) ω =1 (1 α n ) 2 x n ω 2 +2α n (1 α n )θ x n ω 2 + 2α n (α 1 α ) S λn x n ω, f 1 (ω) ω ) =1 (1 ) x n ω 2 +2α n (1 α n ) x n ω f 1 (ω) ω. (3.4) (3.5) (3.6) Snce S λn s quas-nonexpansve, from (3.5) and (3.6), t follows that x n+1 ω 2 x n ω 2 +αn 2 f n (x n ) ω 2 +2α n (1 α n ) x n ω f 1 (ω) ω (1 α n )λ n (1 λ n ) (α 1 α ) S x n x n 2. =1 Suppose that M s a postve constant such that M sup{α n f n (x n ) ω 2 +2(1 α n ) x n ω f 1 (ω) ω, n N}.
7 C. Zhang, Y. Wang, J. Nonlnear Sc. Appl. 9 (2016), So we have Set x n+1 ω 2 x n ω 2 +α n M (1 α n )λ n (1 λ n ) s n = x n ω 2, t n = α n M, δ n = α2 n f n (x n ) ω 2 + 2α n λ n (α 1 α ) S x n x n 2. (3.7) =1 (α 1 α ) x n S x n f 1 (ω) ω =1 + 2α n (1 α n ) x n ω, f 1 (ω) ω, η n = (1 α n )λ n (1 λ n ) (α 1 α ) S x n x n 2. =1 Then (3.4) and (3.7) can be rewrtten as the followng forms, respectvely, s n+1 (1 )s n + δ n, s n+1 s n η n + t n. Fnally, we observe that the condton lm n α n = 0 and Lemma 3.3 mply lm n t n = 0 and n=1 =, respectvely. In order to complete the proof by usng Lemma 2.4, t suffces to verfy that lm η n k = 0, k mples lm sup δ nk 0, k for any subsequence {n k } {n}. In fact, for every N, f η nk 0 as k, then n k (1 α nk )λ nk (1 λ nk ) (α 1 α ) S x nk x nk 2 0. =1 And snce 0 < lm nf n λ n lm sup n λ n < 1, there exst λ > 0 and λ > 0, such that 0 < λ λ n λ < 1. Snce lm n α n = 0, there exst some postve nteger n 0 and α < 1, such that α n < α, when n > n 0, then (1 α)λ(1 λ)(α 1 α ) S x nk x nk 2 (1 α)λ(1 λ) (α 1 α ) S x nk x nk 2 Therefore, snce {α n } s strctly decreasng, t follows that n k =1 n k (1 α nk )λ nk (1 λ nk ) (α 1 α ) S x nk x nk 2 0. n k S x nk x nk 0 and (α 1 α ) S x nk x nk 2 0 =1 for every N. By usng the condton that I S s demclosed at 0, we obtan ω w (x nk ) F = =1 F x(s ). From Lemma 3.3, t turns out that lm sup k 2α nk (1 α nk ) k x nk ω, f 1 (ω) ω = 1 1 θ = 1 1 θ =1 lm sup x nk ω, f 1 (ω) ω k sup z ω, f 1 (ω) ω 0. z ω w(x nk )
8 C. Zhang, Y. Wang, J. Nonlnear Sc. Appl. 9 (2016), Snce lm n α n = 0, n k =1 (α 1 α ) S x nk x nk 2 0 and {f n (x n )}, {S x n } are bounded, t s easy to see that lm sup k δ nk 0. From Lemma 2.4, we conclude that x n ω. Remark 3.4. When S n = S, we can remove the followng condtons: α 0 = 1 and {α n } s strctly decreasng. In fact, the above condtons guarantee the coeffcents α 1 α greater than 0 for every N. The followng corollary s the drect consequence of Theorem 3.1. Corollary 3.5. Let H be a real Hlbert space, C a nonempty closed convex subset of H, S : C C a quas-nonexpansve mappng, such that F x(s) and I S s demclosed at 0. Assume that α n 0, n=1 α n =, and f n satsfes the same condtons of Theorem 3.1. Let {x n } be a sequence defned by x 1 C and x n+1 = α n f n (x n ) + (1 α n )S λn x n (3.8) for n N, where S λn = (1 λ n )I + λ n S, and {λ n } also satsfes the same condtons of Theorem 3.1. Then {x n } converges to ω Ω, where ω s the unque fxed pont of a contracton P Ω f 1. Remark 3.6. If f n = f and λ n = λ for all n N, (3.8) becomes the vscosty approxmaton process whch s ntroduced by Mangé (see [9]). 4. Applcaton to varatonal nequalty problem In ths secton, by applyng Theorem 3.1 and Corollary 3.5, frst we study the followng varatonal nequalty problem, whch s to fnd a pont x Ω, such that F (x ), x x 0, x Ω, (4.1) where Ω s a nonempty closed convex subset of a real Hlbert space H, and F : H H s a nonlnear operator. The problem (4.1) s denoted by V I(Ω, F ). It s well-known that V I(Ω, F ) s equvalent to the fxed pont problem (see, [7]). If the soluton set of V I(Ω, F ) s denoted by Γ, we know that Γ = F x(p Ω (I λf )), where λ > 0 s an arbtrary constant, P Ω s the metrc projecton onto Ω, and I s the dentty operator on H. Assume that, F s η-strongly monotone and L-Lpschtzan contnuous, that s, F satsfes the condtons F x F y, x y η x y 2, x, y Ω, F x F y L x y, x, y Ω. By usng Corollary 3.5, we obtan the followng convergence theorem for solvng the problem V I(Ω, F ). Theorem 4.1. Let F be η-strongly monotone and L-Lpschtzan contnuous wth η > 0, L > 0. Assume that S s a quas-nonexpansve operator wth Ω = F x(s), and I S s demclosed at 0. And {α n } s a sequence n (0, 1] such that α n 0, n=1 α n =. Let {x n } be a sequence defned by x 1 H and x n+1 = (I µα n F )S λn x n, (4.2) where S λn = (1 λ n )I + λ n S, λ n (0, 1], 0 < lm nf n λ n lm sup n λ n < 1, and 0 < µ < 2η L 2. Then {x n } converges strongly to the unque soluton of V I(Ω, F ). Proof. Set f n = (I µf )S λn for n N and θ = 1 2µη + µ 2 L 2. Note that (I µf )x (I µf )y 2 = x y 2 2µ x y, F x F y + µ 2 F x F y 2 x y 2 2µη x y 2 +µ 2 L 2 x y 2 = (1 µ(2η µl 2 )) x y 2.
9 C. Zhang, Y. Wang, J. Nonlnear Sc. Appl. 9 (2016), From 0 < µ < 2η L 2, we obtan that I µf s a θ-contracton. Snce S s quas-nonexpansve, from Lemma 2.3, S λn s quas-nonexpansve. By Lemma 2.2, f n s a θ-contracton wth respect to F x(s), and t s stable on Ω. Moreover, t follows from (4.2) that x n+1 = α n f n (x n ) + (1 α n )S λn x n for n N. Thus from Corollary 3.5, we have that {x n } converges strongly to ω = P F x(s) f 1 (ω) = P F x(s) (I µf )ω, whch s the unque soluton of V I(Ω, F ). Remark 4.2. The teraton (4.2) s called the hybrd steepest descent method, (see[2, 14] for more detals). Fnally, we study the followng varatonal nequalty problem, whch s to fnd a pont x F x(s), such that (γf A)x, x x 0, x F x(s), (4.3) where f s a α-contracton and A s strongly postve, that s, there exsts a constant γ > 0 such that Ax, x γ x 2 for all x H. Assume that 0 < γ < γ/α. The problem (4.3) s denoted by V IP, where x s the unque soluton of V IP, and we have x = P F x(s) (I A + γf)x. Theorem 4.3. Assume that S : H H s a quas-nonexpansve operator wth Ω = F x(s), and I S s demclosed at 0. Let {x n } be a sequence defned by x 1 H and x n+1 = α n γtf(x n ) + (I α n ta)s λn x n, n 0, (4.4) where S λn = (1 λ n )I + λ n S, and 0 < t < 1 A, {λ n} and {α n } satsfy the same condtons of Theorem 4.1. Then {x n } converges strongly to the unque soluton of the V IP. Proof. Set f n = tγf + (I ta)s λn. By usng Lemma 2.5, note that f n (x) f n (p) = (tγf + (I ta)s λn )x (tγf + (I ta)s λn )p tγα x p +(1 tγ) x p =(1 t( γ γα)) x p. From 0 < γ < γ/α, we obtan that f n s a θ-contracton wth respect to F x(s), and t s stable on F x(s). Moreover, t follows from (4.4) that x n+1 = α n f n (x n ) + (1 α n )S λn x n for n N. Thus from Corollary 3.5, we have that {x n } converges strongly to the unque soluton of V IP. Remark 4.4. Let ξ n = α n t, snce α n 0 and n=1 α n =, we have ξ n 0 and n=1 ξ n =, then (4.4) become that x n+1 = ξ n γf(x n ) + (I ξ n A)S λn x n, whch s ntroduced by Tan and Jn (see [13]). 5. Numercal example In ths secton, we gve an example to support Theorem 3.1. Example 5.1. In Theorem 3.1, we assume that H = R. Take f n (x) = x n, S x = x cos x, where x [ π, π]. Gven the parameter λ n = 3+2n 6n for every n N. By the defntons of S, we have n =1 F x(s ) = {0}. S s a quas-nonexpansve mappng snce, f x [ π, π] and q = 0, then S x q = S x 0 = x cos x x = x q.
10 C. Zhang, Y. Wang, J. Nonlnear Sc. Appl. 9 (2016), From Theorem 3.1, we can conclude that the sequence {x n } converges strongly to 0, as n. We can rewrte (1.2) as follows x n+1 = 1 n α nx n + =1 (α 1 α )( 4n 3 6n x n n 6n x n cos x n ). (5.1) Next, we gve the parameter α n has three dfferent expressons n (5.1), that s to say, we set α (1) n = 1 α n (2) = 1 2n+1, α(3) n = 1 n+1. Then, through takng a dstnct ntal guess x 1 = 3, by usng software Matlab, we obtan the numercal experment results n Table 1, where n s the teratve number, and the expresson of error we take x n+1 x n x n. n+1, n Table 1: The values of {x n}. α n (1) α n (2) α n (3) x n error x n error x n error From Table 1, we can easly see that wth teratve number ncreases, {x n } approaches to the unque fxed pont 0 and the errors gradually approach to zero. And wth the change of α n, the convergent speed of the sequence {x n } wll be changed, when α n = α n (3), the speed of the sequence {x n } s more faster than others, and when α n = α n (2) the convergent speed of the sequence {x n } become slower. Through ths example, we can conclude that our algorthm s feasble. Acknowledgment The frst author s supported by the Fundamental Scence Research Funds for the Central Unverstes (Program No k010). References [1] K. Aoyama, F. Kohsaka, Vscosty approxmaton process for a sequence of quasnonexpansve mappngs, Fxed Pont Theory Appl., 2014 (2014), 11 pages. 1, 2.1, 2.2 [2] A. Cegelsk, R. Zalas, Methods for varatonal nequalty problem over the ntersecton of fxed pont sets of quas-nonexpansve operators, Numer. Funct. Anal. Optm., 34 (2013), [3] W. G. Doson, Fxed ponts of quas-nonexpansve mappngs, J. Austral. Math. Soc., 13 (1972), [4] M. K. Ghosh, L. Debnath, Convergence of Ishkawa terates of quas-nonexpansve mappngs, J. Math. Anal. Appl., 207 (1997), [5] S. N. He, C. P. Yang, Solvng the varatonal nequalty problem defned on ntersecton of fnte level sets, Abstr. Appl. Anal., 2013 (2013), 8 pages. 2.4 [6] G. E. Km, Weak and strong convergence for quas-nonexpansve mappngs n Banach spaces, Bull. Korean. Math. Soc., 49 (2012), [7] D. Knderlehrer, G. Stampaccha, An ntroducton to varatonal nequaltes and ther applcatons, Pure and Appled Mathematcs, Academc Press, Inc. [Harcourt Brace Jovanovch, Publshers], New York-London, (1980). 4 [8] R. L, Z. H. He, A new teratve algorthm for splt soluton problems of quas-nonexpansve mappngs, J. Inequal. Appl., 2015 (2015), 12 pages.
11 C. Zhang, Y. Wang, J. Nonlnear Sc. Appl. 9 (2016), [9] P. E. Mangé, The vscosty approxmaton process for quas-nonexpansve mappngs n Hlbert spaces, Comput. Math. Appl., 59 (2010), , 2.3, 3.6 [10] G. Marno, H.-K. Xu, A general teratve method for nonexpansve mappngs n Hlbert spaces, J. Math. Anal. Appl., 318 (2006), [11] A. Moudaf, Vscosty approxmaton methods for fxed-ponts problems, J. Math. Anal. Appl., 241 (2000), [12] W. V. Petryshyn, T. E. Wllamson, Strong and weak convergence of the sequence of successve approxmatons for quas-nonexpansve mappngs, J. Math. Anal. Appl., 43 (1973), [13] M. Tan, X. Jn, A general teratve method for quas-nonexpansve mappngs n Hlbert space, J. Inequal. Appl., 2012 (2012), 8 pages. 1, 4.4 [14] I. Yamada, N. Ogura, Hybrd steepest descent method for varatonal nequalty problem over the fxed pont set of certan quas-nonexpansve mappngs, Numer. Funct. Anal. Optm., 25 (2006), [15] J. Zhao, S. N. He, Strong convergence of the vscosty approxmaton process for the splt common fxed-pont problem of quas-nonexpansve mappngs, J. Appl. Math., 2012 (2012), 12 pages. 1
System of implicit nonconvex variationl inequality problems: A projection method approach
Avalable onlne at www.tjnsa.com J. Nonlnear Sc. Appl. 6 (203), 70 80 Research Artcle System of mplct nonconvex varatonl nequalty problems: A projecton method approach K.R. Kazm a,, N. Ahmad b, S.H. Rzv
More informationA New Refinement of Jacobi Method for Solution of Linear System Equations AX=b
Int J Contemp Math Scences, Vol 3, 28, no 17, 819-827 A New Refnement of Jacob Method for Soluton of Lnear System Equatons AX=b F Naem Dafchah Department of Mathematcs, Faculty of Scences Unversty of Gulan,
More informationMore metrics on cartesian products
More metrcs on cartesan products If (X, d ) are metrc spaces for 1 n, then n Secton II4 of the lecture notes we defned three metrcs on X whose underlyng topologes are the product topology The purpose of
More informationAffine transformations and convexity
Affne transformatons and convexty The purpose of ths document s to prove some basc propertes of affne transformatons nvolvng convex sets. Here are a few onlne references for background nformaton: http://math.ucr.edu/
More informationFirst day August 1, Problems and Solutions
FOURTH INTERNATIONAL COMPETITION FOR UNIVERSITY STUDENTS IN MATHEMATICS July 30 August 4, 997, Plovdv, BULGARIA Frst day August, 997 Problems and Solutons Problem. Let {ε n } n= be a sequence of postve
More informationSTEINHAUS PROPERTY IN BANACH LATTICES
DEPARTMENT OF MATHEMATICS TECHNICAL REPORT STEINHAUS PROPERTY IN BANACH LATTICES DAMIAN KUBIAK AND DAVID TIDWELL SPRING 2015 No. 2015-1 TENNESSEE TECHNOLOGICAL UNIVERSITY Cookevlle, TN 38505 STEINHAUS
More informationON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EQUATION
Advanced Mathematcal Models & Applcatons Vol.3, No.3, 2018, pp.215-222 ON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EUATION
More informationConvexity preserving interpolation by splines of arbitrary degree
Computer Scence Journal of Moldova, vol.18, no.1(52), 2010 Convexty preservng nterpolaton by splnes of arbtrary degree Igor Verlan Abstract In the present paper an algorthm of C 2 nterpolaton of dscrete
More informationMaximizing the number of nonnegative subsets
Maxmzng the number of nonnegatve subsets Noga Alon Hao Huang December 1, 213 Abstract Gven a set of n real numbers, f the sum of elements of every subset of sze larger than k s negatve, what s the maxmum
More informationThe Order Relation and Trace Inequalities for. Hermitian Operators
Internatonal Mathematcal Forum, Vol 3, 08, no, 507-57 HIKARI Ltd, wwwm-hkarcom https://doorg/0988/mf088055 The Order Relaton and Trace Inequaltes for Hermtan Operators Y Huang School of Informaton Scence
More informationThe lower and upper bounds on Perron root of nonnegative irreducible matrices
Journal of Computatonal Appled Mathematcs 217 (2008) 259 267 wwwelsevercom/locate/cam The lower upper bounds on Perron root of nonnegatve rreducble matrces Guang-Xn Huang a,, Feng Yn b,keguo a a College
More informationMMA and GCMMA two methods for nonlinear optimization
MMA and GCMMA two methods for nonlnear optmzaton Krster Svanberg Optmzaton and Systems Theory, KTH, Stockholm, Sweden. krlle@math.kth.se Ths note descrbes the algorthms used n the author s 2007 mplementatons
More informationChapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems
Numercal Analyss by Dr. Anta Pal Assstant Professor Department of Mathematcs Natonal Insttute of Technology Durgapur Durgapur-713209 emal: anta.bue@gmal.com 1 . Chapter 5 Soluton of System of Lnear Equatons
More informationAPPENDIX A Some Linear Algebra
APPENDIX A Some Lnear Algebra The collecton of m, n matrces A.1 Matrces a 1,1,..., a 1,n A = a m,1,..., a m,n wth real elements a,j s denoted by R m,n. If n = 1 then A s called a column vector. Smlarly,
More informationOn Finite Rank Perturbation of Diagonalizable Operators
Functonal Analyss, Approxmaton and Computaton 6 (1) (2014), 49 53 Publshed by Faculty of Scences and Mathematcs, Unversty of Nš, Serba Avalable at: http://wwwpmfnacrs/faac On Fnte Rank Perturbaton of Dagonalzable
More informationA Hybrid Variational Iteration Method for Blasius Equation
Avalable at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 1932-9466 Vol. 10, Issue 1 (June 2015), pp. 223-229 Applcatons and Appled Mathematcs: An Internatonal Journal (AAM) A Hybrd Varatonal Iteraton Method
More informationA CHARACTERIZATION OF ADDITIVE DERIVATIONS ON VON NEUMANN ALGEBRAS
Journal of Mathematcal Scences: Advances and Applcatons Volume 25, 2014, Pages 1-12 A CHARACTERIZATION OF ADDITIVE DERIVATIONS ON VON NEUMANN ALGEBRAS JIA JI, WEN ZHANG and XIAOFEI QI Department of Mathematcs
More informationLinear, affine, and convex sets and hulls In the sequel, unless otherwise specified, X will denote a real vector space.
Lnear, affne, and convex sets and hulls In the sequel, unless otherwse specfed, X wll denote a real vector space. Lnes and segments. Gven two ponts x, y X, we defne xy = {x + t(y x) : t R} = {(1 t)x +
More informationSome modelling aspects for the Matlab implementation of MMA
Some modellng aspects for the Matlab mplementaton of MMA Krster Svanberg krlle@math.kth.se Optmzaton and Systems Theory Department of Mathematcs KTH, SE 10044 Stockholm September 2004 1. Consdered optmzaton
More informationYong Joon Ryang. 1. Introduction Consider the multicommodity transportation problem with convex quadratic cost function. 1 2 (x x0 ) T Q(x x 0 )
Kangweon-Kyungk Math. Jour. 4 1996), No. 1, pp. 7 16 AN ITERATIVE ROW-ACTION METHOD FOR MULTICOMMODITY TRANSPORTATION PROBLEMS Yong Joon Ryang Abstract. The optmzaton problems wth quadratc constrants often
More informationOn the Connectedness of the Solution Set for the Weak Vector Variational Inequality 1
Journal of Mathematcal Analyss and Alcatons 260, 15 2001 do:10.1006jmaa.2000.7389, avalable onlne at htt:.dealbrary.com on On the Connectedness of the Soluton Set for the Weak Vector Varatonal Inequalty
More informationDeriving the X-Z Identity from Auxiliary Space Method
Dervng the X-Z Identty from Auxlary Space Method Long Chen Department of Mathematcs, Unversty of Calforna at Irvne, Irvne, CA 92697 chenlong@math.uc.edu 1 Iteratve Methods In ths paper we dscuss teratve
More informationY. Guo. A. Liu, T. Liu, Q. Ma UDC
UDC 517. 9 OSCILLATION OF A CLASS OF NONLINEAR PARTIAL DIFFERENCE EQUATIONS WITH CONTINUOUS VARIABLES* ОСЦИЛЯЦIЯ КЛАСУ НЕЛIНIЙНИХ ЧАСТКОВО РIЗНИЦЕВИХ РIВНЯНЬ З НЕПЕРЕРВНИМИ ЗМIННИМИ Y. Guo Graduate School
More informationInfinitely Split Nash Equilibrium Problems in Repeated Games
Infntely Splt ash Equlbrum Problems n Repeated Games Jnlu L Department of Mathematcs Shawnee State Unversty Portsmouth, Oho 4566 USA Abstract In ths paper, we ntroduce the concept of nfntely splt ash equlbrum
More informationRandić Energy and Randić Estrada Index of a Graph
EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS Vol. 5, No., 202, 88-96 ISSN 307-5543 www.ejpam.com SPECIAL ISSUE FOR THE INTERNATIONAL CONFERENCE ON APPLIED ANALYSIS AND ALGEBRA 29 JUNE -02JULY 20, ISTANBUL
More informationUniqueness of Weak Solutions to the 3D Ginzburg- Landau Model for Superconductivity
Int. Journal of Math. Analyss, Vol. 6, 212, no. 22, 195-114 Unqueness of Weak Solutons to the 3D Gnzburg- Landau Model for Superconductvty Jshan Fan Department of Appled Mathematcs Nanjng Forestry Unversty
More informationA new Approach for Solving Linear Ordinary Differential Equations
, ISSN 974-57X (Onlne), ISSN 974-5718 (Prnt), Vol. ; Issue No. 1; Year 14, Copyrght 13-14 by CESER PUBLICATIONS A new Approach for Solvng Lnear Ordnary Dfferental Equatons Fawz Abdelwahd Department of
More informationMath 217 Fall 2013 Homework 2 Solutions
Math 17 Fall 013 Homework Solutons Due Thursday Sept. 6, 013 5pm Ths homework conssts of 6 problems of 5 ponts each. The total s 30. You need to fully justfy your answer prove that your functon ndeed has
More informationExistence results for a fourth order multipoint boundary value problem at resonance
Avalable onlne at www.scencedrect.com ScenceDrect Journal of the Ngeran Mathematcal Socety xx (xxxx) xxx xxx www.elsever.com/locate/jnnms Exstence results for a fourth order multpont boundary value problem
More informationAppendix B. Criterion of Riemann-Stieltjes Integrability
Appendx B. Crteron of Remann-Steltes Integrablty Ths note s complementary to [R, Ch. 6] and [T, Sec. 3.5]. The man result of ths note s Theorem B.3, whch provdes the necessary and suffcent condtons for
More informationTHE WEIGHTED WEAK TYPE INEQUALITY FOR THE STRONG MAXIMAL FUNCTION
THE WEIGHTED WEAK TYPE INEQUALITY FO THE STONG MAXIMAL FUNCTION THEMIS MITSIS Abstract. We prove the natural Fefferman-Sten weak type nequalty for the strong maxmal functon n the plane, under the assumpton
More informationCase Study of Markov Chains Ray-Knight Compactification
Internatonal Journal of Contemporary Mathematcal Scences Vol. 9, 24, no. 6, 753-76 HIKAI Ltd, www.m-har.com http://dx.do.org/.2988/cms.24.46 Case Study of Marov Chans ay-knght Compactfcaton HaXa Du and
More informationA note on almost sure behavior of randomly weighted sums of φ-mixing random variables with φ-mixing weights
ACTA ET COMMENTATIONES UNIVERSITATIS TARTUENSIS DE MATHEMATICA Volume 7, Number 2, December 203 Avalable onlne at http://acutm.math.ut.ee A note on almost sure behavor of randomly weghted sums of φ-mxng
More informationn α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0
MODULE 2 Topcs: Lnear ndependence, bass and dmenson We have seen that f n a set of vectors one vector s a lnear combnaton of the remanng vectors n the set then the span of the set s unchanged f that vector
More informationREAL ANALYSIS I HOMEWORK 1
REAL ANALYSIS I HOMEWORK CİHAN BAHRAN The questons are from Tao s text. Exercse 0.0.. If (x α ) α A s a collecton of numbers x α [0, + ] such that x α
More informationBeyond Zudilin s Conjectured q-analog of Schmidt s problem
Beyond Zudln s Conectured q-analog of Schmdt s problem Thotsaporn Ae Thanatpanonda thotsaporn@gmalcom Mathematcs Subect Classfcaton: 11B65 33B99 Abstract Usng the methodology of (rgorous expermental mathematcs
More informationFACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP
C O L L O Q U I U M M A T H E M A T I C U M VOL. 80 1999 NO. 1 FACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP BY FLORIAN K A I N R A T H (GRAZ) Abstract. Let H be a Krull monod wth nfnte class
More informationSupplement: Proofs and Technical Details for The Solution Path of the Generalized Lasso
Supplement: Proofs and Techncal Detals for The Soluton Path of the Generalzed Lasso Ryan J. Tbshran Jonathan Taylor In ths document we gve supplementary detals to the paper The Soluton Path of the Generalzed
More informationAnother converse of Jensen s inequality
Another converse of Jensen s nequalty Slavko Smc Abstract. We gve the best possble global bounds for a form of dscrete Jensen s nequalty. By some examples ts frutfulness s shown. 1. Introducton Throughout
More informationMATH 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS
MATH 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS These are nformal notes whch cover some of the materal whch s not n the course book. The man purpose s to gve a number of nontrval examples
More informationInexact Newton Methods for Inverse Eigenvalue Problems
Inexact Newton Methods for Inverse Egenvalue Problems Zheng-jan Ba Abstract In ths paper, we survey some of the latest development n usng nexact Newton-lke methods for solvng nverse egenvalue problems.
More informationFixed point method and its improvement for the system of Volterra-Fredholm integral equations of the second kind
MATEMATIKA, 217, Volume 33, Number 2, 191 26 c Penerbt UTM Press. All rghts reserved Fxed pont method and ts mprovement for the system of Volterra-Fredholm ntegral equatons of the second knd 1 Talaat I.
More informationA MODIFIED METHOD FOR SOLVING SYSTEM OF NONLINEAR EQUATIONS
Journal of Mathematcs and Statstcs 9 (1): 4-8, 1 ISSN 1549-644 1 Scence Publcatons do:1.844/jmssp.1.4.8 Publshed Onlne 9 (1) 1 (http://www.thescpub.com/jmss.toc) A MODIFIED METHOD FOR SOLVING SYSTEM OF
More informationBinomial transforms of the modified k-fibonacci-like sequence
Internatonal Journal of Mathematcs and Computer Scence, 14(2019, no. 1, 47 59 M CS Bnomal transforms of the modfed k-fbonacc-lke sequence Youngwoo Kwon Department of mathematcs Korea Unversty Seoul, Republc
More informationExercise Solutions to Real Analysis
xercse Solutons to Real Analyss Note: References refer to H. L. Royden, Real Analyss xersze 1. Gven any set A any ɛ > 0, there s an open set O such that A O m O m A + ɛ. Soluton 1. If m A =, then there
More informationLecture 20: Lift and Project, SDP Duality. Today we will study the Lift and Project method. Then we will prove the SDP duality theorem.
prnceton u. sp 02 cos 598B: algorthms and complexty Lecture 20: Lft and Project, SDP Dualty Lecturer: Sanjeev Arora Scrbe:Yury Makarychev Today we wll study the Lft and Project method. Then we wll prove
More informationIdeal Amenability of Second Duals of Banach Algebras
Internatonal Mathematcal Forum, 2, 2007, no. 16, 765-770 Ideal Amenablty of Second Duals of Banach Algebras M. Eshagh Gord (1), F. Habban (2) and B. Hayat (3) (1) Department of Mathematcs, Faculty of Scences,
More informationPerron Vectors of an Irreducible Nonnegative Interval Matrix
Perron Vectors of an Irreducble Nonnegatve Interval Matrx Jr Rohn August 4 2005 Abstract As s well known an rreducble nonnegatve matrx possesses a unquely determned Perron vector. As the man result of
More informationarxiv: v1 [math.co] 1 Mar 2014
Unon-ntersectng set systems Gyula O.H. Katona and Dánel T. Nagy March 4, 014 arxv:1403.0088v1 [math.co] 1 Mar 014 Abstract Three ntersecton theorems are proved. Frst, we determne the sze of the largest
More informationSelf-complementing permutations of k-uniform hypergraphs
Dscrete Mathematcs Theoretcal Computer Scence DMTCS vol. 11:1, 2009, 117 124 Self-complementng permutatons of k-unform hypergraphs Artur Szymańsk A. Paweł Wojda Faculty of Appled Mathematcs, AGH Unversty
More informationCOMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS
Avalable onlne at http://sck.org J. Math. Comput. Sc. 3 (3), No., 6-3 ISSN: 97-537 COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS
More informationn ). This is tight for all admissible values of t, k and n. k t + + n t
MAXIMIZING THE NUMBER OF NONNEGATIVE SUBSETS NOGA ALON, HAROUT AYDINIAN, AND HAO HUANG Abstract. Gven a set of n real numbers, f the sum of elements of every subset of sze larger than k s negatve, what
More informationGenericity of Critical Types
Genercty of Crtcal Types Y-Chun Chen Alfredo D Tllo Eduardo Fangold Syang Xong September 2008 Abstract Ely and Pesk 2008 offers an nsghtful characterzaton of crtcal types: a type s crtcal f and only f
More informationON THE EXTENDED HAAGERUP TENSOR PRODUCT IN OPERATOR SPACES. 1. Introduction
ON THE EXTENDED HAAGERUP TENSOR PRODUCT IN OPERATOR SPACES TAKASHI ITOH AND MASARU NAGISA Abstract We descrbe the Haagerup tensor product l h l and the extended Haagerup tensor product l eh l n terms of
More informationMAT 578 Functional Analysis
MAT 578 Functonal Analyss John Qugg Fall 2008 Locally convex spaces revsed September 6, 2008 Ths secton establshes the fundamental propertes of locally convex spaces. Acknowledgment: although I wrote these
More informationThe Analytical Solution of a System of Nonlinear Differential Equations
Int. Journal of Math. Analyss, Vol. 1, 007, no. 10, 451-46 The Analytcal Soluton of a System of Nonlnear Dfferental Equatons Yunhu L a, Fazhan Geng b and Mnggen Cu b1 a Dept. of Math., Harbn Unversty Harbn,
More informationPerfect Competition and the Nash Bargaining Solution
Perfect Competton and the Nash Barganng Soluton Renhard John Department of Economcs Unversty of Bonn Adenauerallee 24-42 53113 Bonn, Germany emal: rohn@un-bonn.de May 2005 Abstract For a lnear exchange
More informationDiscrete Mathematics. Laplacian spectral characterization of some graphs obtained by product operation
Dscrete Mathematcs 31 (01) 1591 1595 Contents lsts avalable at ScVerse ScenceDrect Dscrete Mathematcs journal homepage: www.elsever.com/locate/dsc Laplacan spectral characterzaton of some graphs obtaned
More informationVector Norms. Chapter 7 Iterative Techniques in Matrix Algebra. Cauchy-Bunyakovsky-Schwarz Inequality for Sums. Distances. Convergence.
Vector Norms Chapter 7 Iteratve Technques n Matrx Algebra Per-Olof Persson persson@berkeley.edu Department of Mathematcs Unversty of Calforna, Berkeley Math 128B Numercal Analyss Defnton A vector norm
More informationLecture Notes on Linear Regression
Lecture Notes on Lnear Regresson Feng L fl@sdueducn Shandong Unversty, Chna Lnear Regresson Problem In regresson problem, we am at predct a contnuous target value gven an nput feature vector We assume
More informationCollege of Computer & Information Science Fall 2009 Northeastern University 20 October 2009
College of Computer & Informaton Scence Fall 2009 Northeastern Unversty 20 October 2009 CS7880: Algorthmc Power Tools Scrbe: Jan Wen and Laura Poplawsk Lecture Outlne: Prmal-dual schema Network Desgn:
More informationSTAT 309: MATHEMATICAL COMPUTATIONS I FALL 2018 LECTURE 16
STAT 39: MATHEMATICAL COMPUTATIONS I FALL 218 LECTURE 16 1 why teratve methods f we have a lnear system Ax = b where A s very, very large but s ether sparse or structured (eg, banded, Toepltz, banded plus
More informationThe binomial transforms of the generalized (s, t )-Jacobsthal matrix sequence
Int. J. Adv. Appl. Math. and Mech. 6(3 (2019 14 20 (ISSN: 2347-2529 Journal homepage: www.jaamm.com IJAAMM Internatonal Journal of Advances n Appled Mathematcs and Mechancs The bnomal transforms of the
More informationFoundations of Arithmetic
Foundatons of Arthmetc Notaton We shall denote the sum and product of numbers n the usual notaton as a 2 + a 2 + a 3 + + a = a, a 1 a 2 a 3 a = a The notaton a b means a dvdes b,.e. ac = b where c s an
More informationLeast-Squares Solutions of Generalized Sylvester Equation with Xi Satisfies Different Linear Constraint
Advances n Lnear Algebra & Matrx heory 6 6 59-7 Publshed Onlne June 6 n ScRes. http://www.scrp.org/journal/alamt http://dx.do.org/.6/alamt.6.68 Least-Squares Solutons of Generalzed Sylvester Equaton wth
More informationResearch Article A Generalized Sum-Difference Inequality and Applications to Partial Difference Equations
Hndaw Publshng Corporaton Advances n Dfference Equatons Volume 008, Artcle ID 695495, pages do:0.55/008/695495 Research Artcle A Generalzed Sum-Dfference Inequalty and Applcatons to Partal Dfference Equatons
More informationMATH 829: Introduction to Data Mining and Analysis The EM algorithm (part 2)
1/16 MATH 829: Introducton to Data Mnng and Analyss The EM algorthm (part 2) Domnque Gullot Departments of Mathematcal Scences Unversty of Delaware Aprl 20, 2016 Recall 2/16 We are gven ndependent observatons
More informationprinceton univ. F 17 cos 521: Advanced Algorithm Design Lecture 7: LP Duality Lecturer: Matt Weinberg
prnceton unv. F 17 cos 521: Advanced Algorthm Desgn Lecture 7: LP Dualty Lecturer: Matt Wenberg Scrbe: LP Dualty s an extremely useful tool for analyzng structural propertes of lnear programs. Whle there
More informationREGULAR POSITIVE TERNARY QUADRATIC FORMS. 1. Introduction
REGULAR POSITIVE TERNARY QUADRATIC FORMS BYEONG-KWEON OH Abstract. A postve defnte quadratc form f s sad to be regular f t globally represents all ntegers that are represented by the genus of f. In 997
More informationHomogenization of reaction-diffusion processes in a two-component porous medium with a non-linear flux-condition on the interface
Homogenzaton of reacton-dffuson processes n a two-component porous medum wth a non-lnear flux-condton on the nterface Internatonal Conference on Numercal and Mathematcal Modelng of Flow and Transport n
More informationON SEPARATING SETS OF WORDS IV
ON SEPARATING SETS OF WORDS IV V. FLAŠKA, T. KEPKA AND J. KORTELAINEN Abstract. Further propertes of transtve closures of specal replacement relatons n free monods are studed. 1. Introducton Ths artcle
More informationLectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix
Lectures - Week 4 Matrx norms, Condtonng, Vector Spaces, Lnear Independence, Spannng sets and Bass, Null space and Range of a Matrx Matrx Norms Now we turn to assocatng a number to each matrx. We could
More informationOn the Interval Zoro Symmetric Single-step Procedure for Simultaneous Finding of Polynomial Zeros
Appled Mathematcal Scences, Vol. 5, 2011, no. 75, 3693-3706 On the Interval Zoro Symmetrc Sngle-step Procedure for Smultaneous Fndng of Polynomal Zeros S. F. M. Rusl, M. Mons, M. A. Hassan and W. J. Leong
More informationTwo Strong Convergence Theorems for a Proximal Method in Reflexive Banach Spaces
Two Strong Convergence Theorems for a Proxmal Method n Reflexve Banach Spaces Smeon Rech and Shoham Sabach Abstract. Two strong convergence theorems for a proxmal method for fndng common zeroes of maxmal
More informationGoogle PageRank with Stochastic Matrix
Google PageRank wth Stochastc Matrx Md. Sharq, Puranjt Sanyal, Samk Mtra (M.Sc. Applcatons of Mathematcs) Dscrete Tme Markov Chan Let S be a countable set (usually S s a subset of Z or Z d or R or R d
More informationSELECTED SOLUTIONS, SECTION (Weak duality) Prove that the primal and dual values p and d defined by equations (4.3.2) and (4.3.3) satisfy p d.
SELECTED SOLUTIONS, SECTION 4.3 1. Weak dualty Prove that the prmal and dual values p and d defned by equatons 4.3. and 4.3.3 satsfy p d. We consder an optmzaton problem of the form The Lagrangan for ths
More informationThe Multiple Classical Linear Regression Model (CLRM): Specification and Assumptions. 1. Introduction
ECONOMICS 5* -- NOTE (Summary) ECON 5* -- NOTE The Multple Classcal Lnear Regresson Model (CLRM): Specfcaton and Assumptons. Introducton CLRM stands for the Classcal Lnear Regresson Model. The CLRM s also
More informationResearch Article. Almost Sure Convergence of Random Projected Proximal and Subgradient Algorithms for Distributed Nonsmooth Convex Optimization
To appear n Optmzaton Vol. 00, No. 00, Month 20XX, 1 27 Research Artcle Almost Sure Convergence of Random Projected Proxmal and Subgradent Algorthms for Dstrbuted Nonsmooth Convex Optmzaton Hdea Idua a
More informationfor Linear Systems With Strictly Diagonally Dominant Matrix
MATHEMATICS OF COMPUTATION, VOLUME 35, NUMBER 152 OCTOBER 1980, PAGES 1269-1273 On an Accelerated Overrelaxaton Iteratve Method for Lnear Systems Wth Strctly Dagonally Domnant Matrx By M. Madalena Martns*
More informationRemarks on the Properties of a Quasi-Fibonacci-like Polynomial Sequence
Remarks on the Propertes of a Quas-Fbonacc-lke Polynomal Sequence Brce Merwne LIU Brooklyn Ilan Wenschelbaum Wesleyan Unversty Abstract Consder the Quas-Fbonacc-lke Polynomal Sequence gven by F 0 = 1,
More informationThe Finite Element Method: A Short Introduction
Te Fnte Element Metod: A Sort ntroducton Wat s FEM? Te Fnte Element Metod (FEM) ntroduced by engneers n late 50 s and 60 s s a numercal tecnque for solvng problems wc are descrbed by Ordnary Dfferental
More informationDifference Equations
Dfference Equatons c Jan Vrbk 1 Bascs Suppose a sequence of numbers, say a 0,a 1,a,a 3,... s defned by a certan general relatonshp between, say, three consecutve values of the sequence, e.g. a + +3a +1
More informationOn quasiperfect numbers
Notes on Number Theory and Dscrete Mathematcs Prnt ISSN 1310 5132, Onlne ISSN 2367 8275 Vol. 23, 2017, No. 3, 73 78 On quasperfect numbers V. Sva Rama Prasad 1 and C. Suntha 2 1 Nalla Malla Reddy Engneerng
More informationarxiv: v1 [math.co] 12 Sep 2014
arxv:1409.3707v1 [math.co] 12 Sep 2014 On the bnomal sums of Horadam sequence Nazmye Ylmaz and Necat Taskara Department of Mathematcs, Scence Faculty, Selcuk Unversty, 42075, Campus, Konya, Turkey March
More informationInternational Journal of Algebra, Vol. 8, 2014, no. 5, HIKARI Ltd,
Internatonal Journal of Algebra, Vol. 8, 2014, no. 5, 229-238 HIKARI Ltd, www.m-hkar.com http://dx.do.org/10.12988/ja.2014.4212 On P-Duo odules Inaam ohammed Al Had Department of athematcs College of Educaton
More informationA FORMULA FOR COMPUTING INTEGER POWERS FOR ONE TYPE OF TRIDIAGONAL MATRIX
Hacettepe Journal of Mathematcs and Statstcs Volume 393 0 35 33 FORMUL FOR COMPUTING INTEGER POWERS FOR ONE TYPE OF TRIDIGONL MTRIX H Kıyak I Gürses F Yılmaz and D Bozkurt Receved :08 :009 : ccepted 5
More informationFixed points of IA-endomorphisms of a free metabelian Lie algebra
Proc. Indan Acad. Sc. (Math. Sc.) Vol. 121, No. 4, November 2011, pp. 405 416. c Indan Academy of Scences Fxed ponts of IA-endomorphsms of a free metabelan Le algebra NAIME EKICI 1 and DEMET PARLAK SÖNMEZ
More informationOn C 0 multi-contractions having a regular dilation
SUDIA MAHEMAICA 170 (3) (2005) On C 0 mult-contractons havng a regular dlaton by Dan Popovc (mşoara) Abstract. Commutng mult-contractons of class C 0 and havng a regular sometrc dlaton are studed. We prove
More informationAffine and Riemannian Connections
Affne and Remannan Connectons Semnar Remannan Geometry Summer Term 2015 Prof Dr Anna Wenhard and Dr Gye-Seon Lee Jakob Ullmann Notaton: X(M) space of smooth vector felds on M D(M) space of smooth functons
More informationP.P. PROPERTIES OF GROUP RINGS. Libo Zan and Jianlong Chen
Internatonal Electronc Journal of Algebra Volume 3 2008 7-24 P.P. PROPERTIES OF GROUP RINGS Lbo Zan and Janlong Chen Receved: May 2007; Revsed: 24 October 2007 Communcated by John Clark Abstract. A rng
More informationTHE CHINESE REMAINDER THEOREM. We should thank the Chinese for their wonderful remainder theorem. Glenn Stevens
THE CHINESE REMAINDER THEOREM KEITH CONRAD We should thank the Chnese for ther wonderful remander theorem. Glenn Stevens 1. Introducton The Chnese remander theorem says we can unquely solve any par of
More informationMath 702 Midterm Exam Solutions
Math 702 Mdterm xam Solutons The terms measurable, measure, ntegrable, and almost everywhere (a.e.) n a ucldean space always refer to Lebesgue measure m. Problem. [6 pts] In each case, prove the statement
More informationA summation on Bernoulli numbers
Journal of Number Theory 111 (005 37 391 www.elsever.com/locate/jnt A summaton on Bernoull numbers Kwang-Wu Chen Department of Mathematcs and Computer Scence Educaton, Tape Muncpal Teachers College, No.
More informationSUCCESSIVE MINIMA AND LATTICE POINTS (AFTER HENK, GILLET AND SOULÉ) M(B) := # ( B Z N)
SUCCESSIVE MINIMA AND LATTICE POINTS (AFTER HENK, GILLET AND SOULÉ) S.BOUCKSOM Abstract. The goal of ths note s to present a remarably smple proof, due to Hen, of a result prevously obtaned by Gllet-Soulé,
More information1 Matrix representations of canonical matrices
1 Matrx representatons of canoncal matrces 2-d rotaton around the orgn: ( ) cos θ sn θ R 0 = sn θ cos θ 3-d rotaton around the x-axs: R x = 1 0 0 0 cos θ sn θ 0 sn θ cos θ 3-d rotaton around the y-axs:
More informationSlobodan Lakić. Communicated by R. Van Keer
Serdca Math. J. 21 (1995), 335-344 AN ITERATIVE METHOD FOR THE MATRIX PRINCIPAL n-th ROOT Slobodan Lakć Councated by R. Van Keer In ths paper we gve an teratve ethod to copute the prncpal n-th root and
More informationAppendix for Causal Interaction in Factorial Experiments: Application to Conjoint Analysis
A Appendx for Causal Interacton n Factoral Experments: Applcaton to Conjont Analyss Mathematcal Appendx: Proofs of Theorems A. Lemmas Below, we descrbe all the lemmas, whch are used to prove the man theorems
More informationMINIMAL MULTI-CONVEX PROJECTIONS ONTO SUBSPACES OF POLYNOMIALS JOANNA MEISSNER 1
MINIMAL MULTI-CONVEX PROJECTIONS ONTO SUBSPACES OF POLYNOMIALS JOANNA MEISSNER IMUJ Preprnt 9/9 Abstract. Let X C N [, ], ), where N 3 and let V be a lnear subspace of Π N, where Π N denotes the space
More informationMin Cut, Fast Cut, Polynomial Identities
Randomzed Algorthms, Summer 016 Mn Cut, Fast Cut, Polynomal Identtes Instructor: Thomas Kesselhem and Kurt Mehlhorn 1 Mn Cuts n Graphs Lecture (5 pages) Throughout ths secton, G = (V, E) s a mult-graph.
More information