Nonlinear Analysis 66 (2007) 1016–1024 www.elsevier.com/locate/na

Viscosity approximation methods for nonexpansive mapping sequences in Banach spaces✩ Yisheng Song c,∗ , Rudong Chen a , Haiyun Zhou b a Department of Mathematics, Tianjin Polytechnic University, Tianjin, 300160, PR China b Department of Applied Mathematics, North China Electric Power University, Baoding 071003, PR China c College of Mathematics and Information Science, Henan Normal University, 453002, PR China

Received 6 September 2005; accepted 4 January 2006

Abstract Let E be a real strictly convex Banach space with a uniformly Gˆateaux differentiable norm, and K be a nonempty closed convex subset of E. Suppose that {Tn } (n = 1, 2, . . .) is a uniformly asymptotically regular sequence of nonexpansive mappings from K to itself such that F := ∞ n=1 F(Tn ) = ∅. For arbitrary initial value x0 ∈ K and fixed contractive mapping f : K → K , define iteratively a sequence {xn } as follows: xn+1 = λn+1 f (xn ) + (1 − λn+1 )Tn+1 xn ,

n ≥ 0, ∞ where {λn } ⊂ (0, 1) satisfies limn→∞ λn = 0 and n=1 λn = ∞. Suppose for any nonexpansive mapping T : K → K , {z t } strongly converges to a fixed point z of T as t → 0, where {z t } is the unique element of K which satisfies z t = t f (z t ) + (1 − t)T z t . Then as n → ∞, xn → z. Our results extend and improve the corresponding ones of O’Hara et al. [J.G. O’Hara, P. Pillay, H.-K. Xu, Iterative approaches to finding nearest common fixed point of nonexpansive mappings in Hilbert spaces, Nonlinear Anal. 54 (2003) 1417–1426] and J.S. Jung [Iterative approaches to common fixed points of nonexpansive mappings in Banach spaces, J. Math. Anal. Appl. 302 (2005) 509–520] and H.K. Xu [Viscosity approximation methods for nonexpansive mappings, J. Math. Anal. Appl. 298 (2004) 279–291]. c 2006 Published by Elsevier Ltd

MSC: 47H05; 47H10; 47H17 ✩ This work was supported by the National Natural Science Foundation of China Grant (10471033) and Grant (10271011). ∗ Corresponding address: College of Mathematics and Information Science, Henan Normal University, No. 47 Jianshedong Lu, Xinxiang City, Henan Province, 453002, PR China. Tel.: +86 03733226149; fax: +86 03733326174. E-mail addresses: [email protected] (Y. Song), [email protected] (R. Chen), [email protected] (H. Zhou).

c 2006 Published by Elsevier Ltd 0362-546X/$ - see front matter

doi:10.1016/j.na.2006.01.001

Y. Song et al. / Nonlinear Analysis 66 (2007) 1016–1024

1017

Keywords: Uniformly asymptotically regular sequence; Viscosity approximation methods; A family of infinitely many nonexpansive maps; Strictly convex Banach space

1. Introduction Let K be a nonempty closed convex subset of a Banach space E and let T1 , T2 , . . . , TN be nonexpansive mappings from K to itself (recall that a mapping T : K → K is nonexpansive if T x − T y ≤ x − y ∀x, y ∈ K ). We consider an iteration scheme: for N, nonexpansive mappings T1 , T2 , . . . , TN and y, x 0 ∈ K , x n+1 = λn+1 y + (1 − λn+1 )Tn+1 x n ,

n ≥ 0.

(1.1)

In 1967, Halpern [3] first introduced the iteration scheme (1.1) for y = 0, N = 1 (that is, he considered only one mapping T ). He pointed out that the control conditions (C1) limn→∞ λn = 0 and (C2) ∞ n=1 λn = ∞ are necessary for the convergence of the iteration scheme (1.1) to a fixed point of T . Subsequently, many mathematicians studied the iteration scheme (1.1) (see [1,7–9, 11,13]). Recently, O’Hara et al. [6] generalized the result of Shimizu and Takahashi [9] in the framework of a Hilbert space. Very recently, Jong Soo Jung [4] extended the main results of O’Hara et al. [6] to a uniformly smooth Banach space. For T : K → K a nonexpansive mapping with F(T ) = ∅, and f : K → K a fixed contractive mapping, Xu [5] propose the explicit iterative process {x n } given by x n+1 = αn f (x n ) + (1 − αn )T x n ,

(1.2)

and prove that the explicit iterative process {x n } converges to a fixed point p of T in uniformly smooth Banach space. In this paper, we introduce the following iterative sequence {x n } defined by (1.3) for the nonexpansive mapping sequence {Tn } (if f (x n ) ≡ u ∈ K in (1.3), we can get (1.1)): x n+1 = λn+1 f (x n ) + (1 − λn+1 )Tn+1 x n ,

n ≥ 0.

(1.3)

We used a new concept of a uniformly asymptotically regular sequence {Tn } of nonexpansive mappings to prove several strong convergence results. The results presented in this paper extended and improve the corresponding results of [4–6]. 2. Preliminaries Throughout this paper, it is assumed that E is a real Banach space with norm · , and we let ∗ J denote the normalized duality mapping from E into 2 E given by J (x) = { f ∈ E ∗ , x, f  = x f , x = f },

∀x ∈ E,

where E ∗ denotes the dual space of E and ·, · denotes the generalized duality pairing. In the sequel, we shall denote the single-valued duality mapping by j , and define F(T ) = {x ∈ E; T x = x}. When {x n } is a sequence in E, then x n → x (respectively x n  x, x n  x) will denote strong (respectively weak, weak∗ ) convergence of the sequence {x n } to x. In Banach space E, the following result (the Subdifferential Inequality) is well known (Theorem 4.2.1 of [10]). ∀x, y ∈ E, ∀ j (x + y) ∈ J (x + y), x + y 2 ≤ x 2 + 2y, j (x + y).

(2.1)

1018

Y. Song et al. / Nonlinear Analysis 66 (2007) 1016–1024

Let E be a real Banach space and T a mapping with domain D(T ) and range R(T ) in E. T is called nonexpansive (respectively, contractive), if for any x, y ∈ D(T ), we have that T x − T y ≤ x − y , (respectively, T x − T y ≤ β x − y for some 0 < β < 1). Recall that the norm of E is said to be Gˆateaux differentiable (and E is said to be smooth), if the limit x + t y − x (*) lim t →0 t exists for each x, y on the unit sphere S(E) of E. Moreover, if for each y in S(E) the limit defined by (*) is uniformly attained for x in S(E), we say that the norm of E is uniformly Gˆateaux differentiable. The norm of E is said to be uniformly Fr´echet differentiable (and E is said to be uniformly smooth), if the limit (*) is attained uniformly for (x, y) ∈ S(E) × S(E). Banach space E is smooth if and only if the duality mapping J is single valued. In this case, the duality mapping J is strong–weak* continuous (Lemma 4.3.3 of [10]). A Banach space E is said to strictly convex if  x + y x = y = 1, x = y implies   2 <1 It is well known that if K is a nonempty convex subset of a strictly convex Banach space E and T : K → K is a nonexpansive mapping, then fixed point set F(T ) of T is a closed convex subset of K (Theorem 4.5.3 of [10]). The following lemma was proved by Bruck [2]: Lemma 2.1 (Lemma 3 of [2]). Let K be nonempty closed convex subset of a strictly convex Banach space E. For each n ≥ 0, Tn : K → E is a nonexpansive mapping. Then there exists a nonexpansive mapping T : K → E such that ∞ 

F(T ) =

F(Tn ).

n=0

∞ ∞ In particular, if βn Tn satisfies the above n=0 F(Tn ) = ∅, then the mapping T = n=0 requirement, where {βn } is a positive real number sequence such that ∞ n=0 βn = 1. Let C be a nonempty closed convex subset of a Banach space E. Recall that a mapping T : C → C is said to be asymptotically regular if lim T n+1 x − T n x = 0,

n→∞

∀x ∈ C.

The mapping T : C → C is said to be uniformly asymptotically regular if lim sup T n+1 x − T n x = 0.

n→∞ x∈C

Now, we introduce the concepts of an asymptotically regular sequence of mappings and a uniformly asymptotically regular sequence of mappings. Let C be a nonempty closed convex subset of a Banach space E, and Tn : C → C, n ≥ 1, then the mapping sequence {Tn } is said to be asymptotically regular (for short, a.r.) if for all m ≥ 1, lim Tm (Tn x) − Tn x = 0,

n→∞

∀x ∈ C.

Y. Song et al. / Nonlinear Analysis 66 (2007) 1016–1024

1019

The mapping sequence {Tn } is said to be uniformly asymptotically regular (for short, u.a.r.) on C if for all m ≥ 1, lim sup Tm (Tn x) − Tn x = 0.

n→∞ x∈C

Example. Let T be a contractive mapping on a nonempty bounded closed subset C of Banach space E with Lipschitz constant β < 1. Put Sn = T n , n ≥ 1; then the sequence {Sn } is u.a.r. Indeed, ∀x ∈ C, we have Sm (Sn x) − Sn x = T n+m x − T n x ≤

m−1 

T n+i+1 x − T n+i x

i=0



m−1 

β n+i T x − x ≤

i=0

βn T x − x . 1−β

Therefore, lim (sup Sm (Sn x) − Sn x ) = 0

n→∞ x∈C

for any fixed contractive mapping f : K → K with contractive coefficient β ∈ (0, 1) and each t ∈ (0, 1), we consider the following implicit iterative sequence {x t } as defined by Xu [5]: x t = t f (x t ) + (1 − t)T x t .

(2.2)

Lemma 2.2. Let K be a nonempty closed convex subset of a real Banach space E which has uniformly Gˆateaux differentiable norm, and T : K → K be a nonexpansive mapping with F := F(T ) = ∅. Assume that {z t } strongly converges to a fixed point z of T as t → 0, where {z t } is defined Eq. (2.2). Suppose {x n } ⊂ K is bounded and limn→∞ x n − T x n = 0. Then lim sup f (z) − z, j (x n+1 − z) ≤ 0. n→∞

Proof. Using equality z t − x n = (1 − t)(T z t − x n ) + t ( f (z t ) − x n ) and inequality T x − T y, j (x − y) ≤ x − y 2 , we get that z t − x n 2 = (1 − t)T z t − x n , j (z t − x n ) + t f (z t ) − x n , j (z t − x n ) = (1 − t)(T z t − T x n , j (z t − x n ) + T x n − x n , j (z t − x n )) + t f (z t ) − z t , j (z t − x n ) + t z t − x n 2 ≤ x n − z t 2 + T x n − x n j (z t − x n ) + t f (z t ) − z t , j (z t − x n ), and hence x n − T x n z t − x n . (2.3) t Since {z t }, {x n } and {T x n } are bounded and x n − T x n → 0, taking n → ∞ in Eq. (2.3), we get  f (z t ) − z t , j (x n − z t ) ≤

lim sup f (z t ) − z t , j (x n − z t ) ≤ 0. n→∞

(2.4)

1020

Y. Song et al. / Nonlinear Analysis 66 (2007) 1016–1024

Since z t converges strongly to z, as t → 0, and the set {z t − x n } is bounded, and in view of the fact that the duality map J is single valued and strong–weak* uniformly continuous on bounded sets of a Banach space E with a uniformly Gˆateaux differentiable norm, we get that | f (z) − z, j (x n − z) −  f (z t ) − z t , j (x n − z t )| = | f (z) − z, j (x n − z) − j (x n − z t ) + ( f (z) − z) − ( f (z t ) − z t ), j (x n − z t )| ≤ | f (z) − z, j (x n − z) − j (x n − z t )| + f (z t ) − z t − ( f (z) − z) x n − z t → 0, as t → 0. Hence, ∀ε > 0, ∃δ > 0 such that ∀t ∈ (0, δ), for all n, we have that  f (z) − z, j (x n − z) <  f (z t ) − z t , j (x n − z t ) + ε. By Eq. (2.4), we have that lim sup f (z) − z, j (x n − z) ≤ lim  f (z t ) − z t , j (x n − z t ) + ε n→∞

n→∞

≤ ε.

Since ε is arbitrary, we get that lim sup f (z) − z, j (x n+1 − z) ≤ 0. n→∞

The proof is complete.



In the sequel, we also need the following lemmas which can be found in [4–6,12]. Lemma 2.3 (Xu [12]). Let {an } be a sequence of nonnegative real numbers satisfying the property an+1 ≤ (1 − γn )an + βn ,

n ≥ 0,

where {γn } ⊂ (0, 1) and {βn } is a real number sequence such that  (i) ∞ n=0 γn = ∞;  (ii) either lim supn→∞ βγnn ≤ 0 or ∞ n=0 |βn | < +∞. Then {an } converges to zero, as n → ∞. 3. Main results First, let {Tn  } (n = 1, 2, . . .) be a u.a.r. sequence of nonexpansive mappings from K to itself such that F := ∞ n=1 F(Tn ) = ∅. We can get the following theorem. Theorem 3.1. Let E be a strictly convex Banach space, and K a nonempty closed convex subset of E. {Tn } (n  = 1, 2, . . .) is a u.a.r. sequence of nonexpansive mappings from K to itself such that F := ∞ n=1 F(Tn ) = ∅, for a fixed contractive mapping f : K → K with contractive coefficient β ∈ (0, 1), and the sequence {x n } generated by the following iterative process: x n+1 = λn+1 f (x n ) + (1 − λn+1 )Tn+1 x n ,

n ≥ 0,

(3.1)

where λn ∈ (0, 1) and limn→∞ λn = 0. Then there exists an nonexpansive mapping T : K → K such that F(T ) = F,

and

lim x n − T x n = 0.

n→∞

Y. Song et al. / Nonlinear Analysis 66 (2007) 1016–1024

1021

Proof. that there exists an nonexpansive mapping T = ∞ Firstly, by Lemma 2.1 weget ∞ that F(T ) = m=1 βm Tm such  m=1 F(Tm ) = F, where {βm } is a sequence of positive 1. It follows that ∀x ∈ K , we have Tm x ∈ K , ∀m ≥ 0. Noticing numbers such that ∞ m=1 βm = the closed convexity of K and ∞ m=1 βm = 1, we get that   n n   βm Tm x + 1 − βm x ∈ K . m=1

m=1

Let n → ∞; we obtain that Tx =

∞ 

βm Tm x ∈ K .

m=1

Thus, T (K ) ⊂ K . Next, we show that {x n } is bounded. Take u ∈ F. It follows that x n+1 − u ≤ (1 − λn+1 ) Tn+1 x n − u + λn+1 f (x n ) − f (u) + f (u) − u ≤ (1 − λn+1 ) x n − u + λn+1 (β x n − u + f (u) − u ) = (1 − (1 − β)λn+1 ) x n − u + λn+1 f (u) − u

1 x f (u) − u . ≤ max n − u , 1−β By induction,

x n − u ≤ max x 0 − u ,

1 f (u) − u , 1−β

n ≥ 0,

and {x n } is bounded, which leads to boundedness of {x n } and {Tn+1 x n }. Using the assumption that limn→∞ λn = 0, we get x n+1 − Tn+1 x n = λn+1 u − Tn+1 x n → 0. Finally, we prove that x n+1 − T x n+1 → 0 (n → ∞). In fact, since T = obtain that   ∞     βm Tm (Tn+1 x n ) − Tn+1 x n  T (Tn+1 x n ) − Tn+1 x n =  m=0  ≤ ≤

∞  m=0 ∞  m=0

∞

(3.2)

m=1 βm Tm ,

we

βm Tm (Tn+1 x n ) − Tn+1 x n βm sup Tm (Tn+1 x) − Tn+1 x , x∈C

where C  is any bounded subset of K containing {x n }. Since ∞ m=0 βm = 1 and {Tn } (n = 1, 2, . . .) is a u.a.r. sequence of a nonexpansive mapping, for any ε > 0, ∃m ε , Nε ≥ 0 such that ∞  m=m ε

βm <

ε , 2M

sup Tm (Tn+1 x) − Tn+1 x < x∈C

where M = sup{ Tn x − Tl y ; n, l ≥ 0, x, y ∈ C}.

ε , 2

∀n > Nε ,

1022

Y. Song et al. / Nonlinear Analysis 66 (2007) 1016–1024

Therefore, noting mε 

m ε

m=1 βm

≤ 1, we get that

βm sup Tm (Tn+1 x) − Tn+1 x <

m=1

x∈C

ε , 2

∀n > Nε .

Thus, ∞ 

T (Tn+1 x n ) − Tn+1 x n ≤

βm sup Tm (Tn+1 x) − Tn+1 x

m=m ε mε 

+

x∈C

βm sup Tm (Tn+1 x) − Tn+1 x

m=1 ∞ 

x∈C

βm M +



m=m ε

ε < ε. 2

Since ε is arbitrary, we have lim T (Tn+1 x n ) − Tn+1 x n = 0.

n→∞

(3.3)

Hence, x n+1 − T x n+1 ≤ x n+1 − Tn+1 x n + Tn+1 x n − T (Tn+1 x n ) + T (Tn+1 x n ) − T x n+1 ≤ 2 x n+1 − Tn+1 x n + Tn+1 x n − T (Tn+1 x n ) . Combining (3.2) and (3.3), we get that lim x n+1 − T x n+1 = 0.

n→∞

The proof is completed.



Theorem 3.2. Let E be a real strictly convex Banach space with a uniformly G´ateaux differentiable norm, and K be a nonempty closed convex subset of E. Suppose that {Tn } (n = 1, 2, . . .) is a uniformly  asymptotically regular sequence of nonexpansive mapping from K to itself such that F := ∞ n=1 F(T  n ) = ∅. The sequence {x n } is defined (3.1), and {λn } ⊂ (0, 1) satisfies limn→∞ λn = 0 and ∞ n=1 λn = ∞. Suppose for any nonexpansive mapping T : K → K , {z t } strongly converges to a fixed point p of T as t → 0, where {z t } is the unique element of K which satisfies z t = t f (z t ) + (1 − t)T z t . Then as n → ∞, x n → p. Proof. It follows from Theorem 3.1 that there exists one nonexpansive mapping T : K → K such that F(T ) = F,

and

lim x n − T x n = 0.

n→∞

For nonexpansive mapping T : K → K , we can define z t = t f (z t ) + (1 − t)T z t , and {z t } strongly converges to a fixed point p ∈ F as t → 0 by supposition. Using Lemma 2.2, we obtain that lim sup f ( p) − p, j (x n+1 − p) ≤ 0. n→∞

(3.4)

Y. Song et al. / Nonlinear Analysis 66 (2007) 1016–1024

1023

Using equality (3.1) and inequality (2.1), we get that x n+1 − p 2 = λn+1 ( f (x n ) − p) + (1 − λn+1 )(Tn+1 x n − p) 2 ≤ (1 − λn+1 )2 Tn+1 x n − p 2 + 2λn+1  f (x n ) − f ( p), j (x n+1 − p) + 2λn+1  f ( p) − p, j (x n+1 − p) ≤ (1 − λn+1 )2 x n − p 2 + 2λn+1 β x n − p x n+1 − p + 2λn+1  f ( p) − p, j (x n+1 − p) ≤ (1 − 2λn+1 + λ2n+1 ) x n − p 2 + λn+1 (β x n − p 2 + x n+1 − p 2 ) + 2λn+1  f ( p) − p, j (x n+1 − p) (using β 2 ≤ β). Therefore, (1 − λn+1 ) x n+1 − p 2 ≤ (1 − 2λn+1 + βλn+1 ) x n − p 2 + λ2n+1 x n − p 2 + 2λn+1  f ( p) − p, j (x n+1 − p). λ2n+1 1−β x n+1 − p 2 ≤ 1 − x n − p 2 λn+1 x n − p 2 + 1 − λn+1 1 − λn+1 2λn+1 +  f ( p) − p, j (x n+1 − p) 1 − λn+1 ≤ (1 − γn ) x n − p 2 2 + γn Mλn+1 +  f ( p) − p, j (x n+1 − p) , 1−β where γn = Hence,

1−β 1−λn+1 λn+1

and M is a constant such that M >

1 1−β

x n − p 2 .

x n+1 − p 2 ≤ (1 − γn ) x n − p 2 + γn αn , where αn = Mλn+1 + It is easily seen that

2 1−β  f ( p) − p, j (x n+1 − p).  γn → 0, ∞ n=1 γn = ∞, and (noting (3.4))

lim sup αn = lim sup Mλn+1 + n→∞

(3.5)

n→∞

2  f ( p) − p, j (x n+1 − p) ≤ 0. 1−β

Using Lemma 2.3 onto (3.5), we conclude that x n → p. This completes the proof of the theorem.  Using Theorem 4.1 of Xu [5] and Theorem 3.2, we can get the following corollary. Corollary 3.3. Let E be a uniformly smooth and strictly convex Banach space, and K be a nonempty closed convex subset of E. Suppose that {Tn } (n = 1, 2, . . .) is a uniformly asymptotically regular sequence of nonexpansive mappings from K to itself such that F := ∞ F(T ) =  ∅. The sequence {x n } is defined (3.1), and {λn } ⊂ (0, 1) satisfies limn→∞ λn = 0 n=1  n λ = ∞. Then as n → ∞, x n → p, where p is the unique solution in F to the and ∞ n=1 n following variational inequality:  f ( p) − p, j (u − p) ≤ 0 for all u ∈ F(T ).

1024

Y. Song et al. / Nonlinear Analysis 66 (2007) 1016–1024

References [1] H. Bauschke, The approximation of fixed points of nonexpansive mappings in Hilbert space, J. Math. Anal. Appl. 202 (1996) 150–159. [2] R.E. Bruck Jr., Properties of fixed-point sets of nonexpansive mappings in Banach spaces, Trans. Amer. Math. Soc. 179 (1973) 251–262. [3] B. Halpern, Fixed points of nonexpansive maps, Bull. Amer. Math. Soc. 73 (1967) 957–961. [4] J.S. Jung, Iterative approaches to common fixed points of nonexpansive mappings in Banach spaces, J. Math. Anal. Appl. 302 (2005) 509–520. [5] H.K. Xu, Viscosity approximation methods for nonexpansive mappings, J. Math. Anal. Appl. 298 (2004) 279–291. [6] J.G. O’Hara, P. Pillay, H.-K. Xu, Iterative approaches to finding nearest common fixed point of nonexpansive mappings in Hilbert spaces, Nonlinear Anal. 54 (2003) 1417–1426. [7] J. Schu, Approximation of fixed points of asymptotically nonexpansive mappings, Proc. Amer. Math. Soc. 112 (1991) 143–151. [8] N. Shioji, W. Takahashi, Strong convergence of approximated sequences for nonexpansive mappings in Banach spaces, Proc. Amer. Math. Soc. 125 (1997) 3641–3645. [9] T. Shimizu, W. Takahashi, Strong convergence to common fixed points of families of nonexpansive mappings, J. Math. Anal. Appl. 211 (1997) 71–83. [10] W. Takahashi, Nonlinear Functional Analysis— Fixed Point Theory and its Applications, Yokohama Publishers Inc., Yokohama, 2000 (in Japanese). [11] R. Wittmann, Approximation of fixed points of nonexpansive mappings, Arch. Math. 59 (1992) 486–491. [12] H.K. Xu, An iterative approach to quadratic optimization, J. Optim. Theory Appl. 116 (2003) 659–678. [13] P.L. Lions, Approximation de points fixes de contraction, C. R. Acad. Sci. Ser. A–B Paris 284 (1977) 1357–1359.

Viscosity approximation methods for nonexpansive ...

E-mail addresses: [email protected] (Y. Song), [email protected] (R. Chen), witman66@yahoo.com.cn (H. Zhou). 0362-546X/$ - see front matter c ...

161KB Sizes 3 Downloads 249 Views

Recommend Documents

Strong convergence of viscosity approximation ...
Nov 24, 2008 - Very recently, Zhou [47] obtained the strong convergence theorem of the iterative ... convergent theorems of the iteration (1.6) for Lipschitz ...

Nystrom Approximation for Sparse Kernel Methods ...
synthetic data and real-world data sets. Experimental results have indicated the huge acceleration of the Nyström method on training time while maintaining the ...

Iterative approximations for multivalued nonexpansive mappings in ...
Abstract. In this paper, we established the strong convergence of Browder type iteration {xt} for the multivalued nonexpansive nonself-mapping T satisfying the ...

Ebook Download Approximation Theory and Methods ...
Mar 31, 1981 - DOWNLOAD FROM OUR ONLINE LIBRARY ... theory to make it highly suitable as a mathematical textbook at undergraduate or postgraduate level. ... I used this book in grad school to study up on numerical approximations.

A Prototype Structured but Low-viscosity Editor for Novice ... - eWiC
to drag-and-drop statement blocks into the editor space. This prevents syntax errors caused by incorrect/missing characters (the most common type of errors that beginners make (Robins, Haden. & Garner 2006, Denny et al. 2011)), but is very. “viscou

Approximation Algorithms for Wavelet Transform ... - CIS @ UPenn
Call this strip of nodes S. Note that |S| ≤ 2q log n. The nodes in S break A into two smaller subproblems L .... Proc. of VLDB Conference, pages 19–30, 2003.

A Prototype Structured but Low-viscosity Editor for Novice ... - eWiC
know what they want to do, and get held up by the system – but after a time it can also demotivate novices. Simply operating the interface can take up effort meant for the task at hand. 2.2 Existing systems. Greenfoot. (Henriksen,. Kölling. 2004).

A Prototype Structured but Low-viscosity Editor for Novice ... - Core
People & Computers XXVI, Birmingham, UK. 363. Work In .... a live search from the keyboard, to save the ... disrupt the programmer's flow; the live preview is.

Truthful Approximation Mechanisms for Restricted ...
Jun 14, 2007 - ∗School of Computer Science and Engineering, Hebrew University of Jerusalem, Israel. [email protected]. †School of Computer Science ...

Approximation Schemes for Capacitated ... - Research at Google
set of types of links having different capacities and costs that can be used to .... all Steiner vertices in M have degree at least 3 and are contained in the small-.

Improved Approximation Algorithms for (Budgeted) Node-weighted ...
2 Computer Science Department, Univ of Maryland, A.V.W. Bldg., College Park, MD ..... The following facts about a disk of radius R centered at a terminal t can be ..... within any finite factor when restricted to the case of bounded degree graphs.

Pressure–temperature–viscosity relationship for heavy ...
This paper deals with the influence that both pressure and temperature exert on the viscosity of .... cell, which was connected to the motor-transducer of the.

Optimal control and vanishing viscosity for the Burgers ...
Apr 13, 2009 - We focus on the 1−d Burgers equation although most of our results extend to more general .... viewing it as an approximation of the inviscid one (1.1) as ν → 0 and ... present some numerical experiments that show the efficiency of

A Prototype Structured but Low-viscosity Editor for Novice ... - eWiC
Many beginners learn with Java, a traditional text-based language. ... Programming, Greenfoot, Java, Scratch, Alice, CogTool, viscosity, cognitive dimensions. ..... 6. DISCUSSION. 6.1 Comparison – Greenfoot. Greenfoot programs are written in Java s

Low Viscosity Flow Simulations for Animation
energy cascade in simulated fluid flows and the resulting visual quality. 1. Introduction. Simulation ... dissipative than is required for numerical stability, leading to.

A Prototype Structured but Low-viscosity Editor for ...
not possible to enter an invalid statement). Parameters can be added or changed through blocks' context menus, but the structure of the statement itself cannot ...

Unit 3--Viscosity measurement-min.pdf
Government has. resolved to continue with investment in infrastructure and. has put in place appropriate measures to ensure fiscal. prudence. Michael M. Mundashi, SC. Chairman. Whoops! There was a problem loading this page. Retrying... Unit 3--Viscos

Capabilities of the Discrete Dipole Approximation for ...
solution of the system of 3Nd complex linear equations, where. Nd is the number of .... [9] M. A. Yurkin, V. P. Maltsev, and A. G. Hoekstra, “The discrete dipole.

Approximation of Optimal Voxel Size for Collision ...
6 [Computer Graphics]: Methodology and Techniques — Graphics data structures and data types;. I. 3. ... Man-and-tool accessibility analysis, which is undertaken in order to analyse ... (millions of triangles); so the visualization modules and the.

Global Solver and Its Efficient Approximation for ...
subspace clustering (LRSC) by providing an exact global solver and its efficient ... There, to avoid computing the inverse of a prohibitively large matrix, the ...

Approximation of Optimal Voxel Size for Collision ...
Man-and-tool accessibility analysis, which is undertaken in .... If the application requires the man- ..... before Ch. The hybrid algorithm is more efficient than the.

numerical approximation of the boundary control for the ...
Oct 11, 2006 - a uniform time T > 0 for the control of all solutions is required. This time T depends on the size of the domain and the velocity of propagation of waves. In general, any semi-discrete dynamics generates spurious high-frequency oscilla

Truthful Approximation Schemes for Single-Parameter ...
Jul 25, 2010 - participants are incentivized to bid their true value for a good. ... Email: [email protected]. .... allows a good compact representation.