Creating materials with a desired refraction coefficient: numerical experiments
|
|
- Georgiana Gibson
- 5 years ago
- Views:
Transcription
1 Creating materials with a desired refraction coefficient: numerical experiments Sapto W. Indratno and Alexander G. Ramm Department of Mathematics Kansas State University, Manhattan, KS , USA sapto@math.ksu.edu Corresponding author: ramm@math.ksu.edu Abstract A recipe for creating materials with a desired refraction coefficient is implemented numerically. The following assumptions are used: ζ m = h(x m)/a κ, d = O(a (2 κ)/3 ), M = O(1/a 2 κ ), κ (0, 1), where ζ m and x m are the boundary impedance and center of the m-th ball, respectively, h(x) C(D), Imh(x) 0, M is the number of small balls embedded in the cube D, a is the radius of the small balls and d is the distance between the neighboring balls. An error estimate is given for the approximate solution of the manybody scattering problem in the case of small scatterers. This result is used for the estimate of the minimal number of small particles to be embedded in a given domain D in order to get a material whose refraction coefficient approximates the desired one with the relative error not exceeding a desired small quantity. MSC: 65R20, 65Z05, 74Q10 Key words: many-body wave scattering problem, metamaterials, refraction coefficient 1 Introduction A theory of wave scattering by many small bodies embedded in a bounded domain D filled with a material with known refraction coefficient was developed in [1]-[4]. It was assumed in [1] that d = O(a 1/3 ), M = O(a 1 ), u M ν = ζ mu M on S m, 1 m M, where a is the characteristic size of the small particles, d is the distance between two neighboring particles, M is the total number of the embedded particles, S m 1
2 is the boundary of m-th particle D m, ν is the unit normal to S m directed out of D m, and ζ m = h m /a, where h m, Imh m 0, 1 m M, are constants independent of a. Let us assume that D is filled with a material with known refraction coefficient n 2 0(x), Imn 2 0(x) 0, n 2 0(x) = 1 in D := R 2 \ D, n 2 0(x) is Riemann integrable. The governing equation is L 0 u 0 := [ + k 2 n 2 0]u 0 = 0, in R 3, (1) u 0 = exp(ikx α) + v 0 (2) where k is the wave number, α S 2 is the direction of the incident plane wave, S 2 is the unit sphere in R 3, and v 0 is the scattered field satisfying the radiation condition lim r r ( v0 r ikv 0 ) = 0 r := x, (3) and the limit is attained uniformly with respect to the directions x 0 := x/r. Let n 2 (x) be a desired refraction coefficient in D. We assume that n 2 (x) is Riemann integrable, Im n 2 (x) 0, n 2 (x) = 1 in D. Our objective is to create materials with the refraction coefficient n 2 (x) in D by embedding into D many small non-intersecting balls B m, 1 m M, of radius a, centered at some points x m D. If one embeds M small particles B m in the bounded domain D, then the scattering problem consists of finding the solution to the following problem: L 0 u M := [ + k 2 n 2 0]u M (x) = 0 x R 3 \ M m=1b m, (4) u M ν = ζ mu M on S m := B m, 1 m M, (5) u M = u 0 + v M, (6) where u 0 solves problem (1)-(3), and v M satisfies the radiation condition. The following theorem is proved in [4] under the assumptions ζ m = h(x m )/a κ, d = O(a (2 κ)/3 ), M = O ( 1/a 2 κ), κ (0, 1), (7) where h(x) is a continuous function in D, Imh 0, κ (0, 1) is a parameter, and one can choose h(x) and κ as one wishes. Below it is always assumed that conditions (7) hold. Theorem 1.1 ([4]). Assume that conditions (7) are satisfied, and D m is a ball of radius a centered at a point x m. Let h(x) in (7) be an arbitrary continuous function in D, Imh(x) 0, p D be any subdomain of D, and N ( p ) be the number of particles in p, N ( p ) = 1 a 2 κ p N(x)dx[1 + o(1)], a 0, (8) 2
3 where N(x) 0 is a given continuous function in D. Then lim u e(x) u(x) C(D) = 0, (9) a 0 where u e (x) := u 0 (x) 4π G(x, x j )h(x j )u e (x j )a 2 κ [1 + o(1)], a 0, (10) j=1 where min j x x j a, and G(x, y) is the Green function of the operator L 0 in R 3, L 0 G = δ(x y) in R 3, G(x, y) satisfies the radiation condition. The numbers u e (x j ), 1 j M, are found from the following linear algebraic system: u e (x m ) = u 0 (x m ) 4π j=1,j m G(x m, x j )h(x j )u e (x j )a 2 κ, m = 1, 2,..., M, which is uniquely solvable for all sufficiently large M. The function u(x) = lim a 0 u e (x) (11) solves the following limiting equation: u(x) = u 0 (x) G(x, y)p(y)u(y)dy, (12) D where u 0 satisfies equations (1)-(3), p(x) := 4πN(x)h(x), (13) n 2 (x) := 1 k 2 q(x), (14) q(x) := q 0 (x) + p(x), q 0 (x) := k 2 k 2 n 2 0(x), (15) and n 2 0(x) is the coefficient in (1). In [4] a recipe for creating material with a desired refraction coefficient is formulated. The goal of this paper is to implement numerically the recipe for creating materials with a desired refraction coefficient in a given domain D by embedding in D many small particles with prescribed physical properties. These particles are balls of radius a, centered at the points x m D, and their physical properties are described by the boundary impedances ζ m = h(x m )/a κ. A formula for embedding the small balls in D is given in Section 2. We give an estimate for the error in the refraction coefficient of the medium obtained by embedding finitely many (M < ) small particles, compared with the refraction coefficient of the limiting medium (M ). This is important 3
4 because in practice one cannot go to the limit M, i.e., a 0, and one has to know the maximal a (i.e., minimal M) such that the corresponding to this a refraction coefficient differs from the desired refraction coefficient by not more than a given small quantity. In Section 3 we give an algorithm for finding the minimal number M of the embedded small balls which generate a material whose refraction coefficient differs from a desired one by not more than a desired small quantity. In Section 4 some numerical experiments are described. 2 Embedding small balls into a cube In this section we give a formula for distributing small balls in a cube in such a way that the second and third restrictions (7) are satisfied. Without loss of generality let us assume that the domain D is the unit cube: D := [0, 1] [0, 1] [0, 1]. (16) Let D = n3 q=1 q, n N, i j = for i j, (17) where N is the set of positive integers, X is the closure of the set X, and q, q = 1, 2,..., n 3, are cubes of side length 1/n. Definition: We say that D has property Q n if each small cube q contains a ball of radius a n, 0 < a n < 1/n, centered at the centroid of the cube q, and the following condition holds d n := min q j dist(b a n (x q ), B an (x j )) = γa (2 κ)/3 n, (18) where x q is the centroid of the cube q, q = 1, 2,..., n 3, B a (x) := {y R 3 y x < a}, (19) and γ > 0 is a constant which is not too small (see formula (25)). From (17) and (18) one gets d n = l n 2a n = γa (2 κ)/3 n, l n := 1/n. (20) Since l n = 1/n, the quantity a n solves the equation γa (2 κ)/3 + 2a 1/n = 0. (21) The function f(a) := γa (2 κ)/3 + 2a is strictly growing on [0, ). Thus, the solution to equation (21) exists, is unique, and can be calculated numerically, for example, by the bisection method. However, it is easy to derive an analytic asymptotic formula for a n as n. This formula is simple and can be used for all n we are interested in, since these n are sufficiently large. 4
5 Let us derive this asymptotic formula. Since 1/3 < (2 κ)/3 < 2/3, one has a a (2 κ)/3 if a 1. Therefore, a n = [1/(nγ)] 3/(2 κ) [1 + o(1)], as n, (22) is the desired asymptotic formula for the solution to (21). Note that lim a n = 0 and lim na n = 0, (23) n n as follows from (22) because 3/(2 κ) > 1. Note that a n /d n 1, if n 1, because (20) yields a n /d n = a n /(γa (2 κ)/3 n ) = a n (1+κ)/3 /γ 1. (24) Let us choose n sufficiently large so that γ (l n /2) (1+κ)/3, κ (0, 1), l n = 1/n, (25) and make the following assumption: Assumption A): The domain D has property Q. This assumption means that the following conditions are satisfied: D = P q=1ω 3 q, Ω j Ω i = for j i, where each cube Ω q has side length 1/P, and m 3 small balls are embedded in Ω q so that the following two conditions hold: 1. Each cube Ω q is a union of small sub-cubes j,q : Ω q = m3 j=1 j,q, i,q j,q = for i j, (26) where j,q, j = 1, 2,..., m 3, q = 1, 2,..., P 3, are cubes of side length 1/( ), 2. In each sub-cube j,q there is a ball of radius a, 0 < a < 1/( ), centered at the centroid of the sub-cube j,q, and the radius a of the embedded balls satisfies the relation 1/( ) 2a = γa (2 κ)/3, γ [1/(2 )] (κ+1)/3, (27) where γ > 0 is a fixed constant. Lemma 2.1. If Assumption A) holds, then lim m Ma2 κ = 1/γ3, (28) where M = ( ) 3 is the total number of small balls embedded in the unit cube D, γ > 0 is fixed, and a = [1/(γ )] 3/(2 κ) [1 + o(1)] as m. (29) 5
6 Proof. Relation (29) is an immediate consequence of (27). Using this relation, one obtains lim m Ma2 κ = lim ( m )3 a 2 κ Lemma 2.1 is proved. = lim m ( )3 [1/(γ )] 3 [1 + o(1)] = lim m (1/γ3 )[1 + o(1)] = 1/γ 3. (30) 3 A recipe for creating materials with a desired refraction coefficient In this section the recipe given in [4] is used for creating materials with a desired refraction coefficient by embedding into D small balls so that Assumption A) holds. Step 1. Given the refraction coefficient n 2 0(x) of the original material in D and the desired refraction coefficient n 2 (x) in D, one calculates p(x) = k 2 [n 2 0(x) n 2 (x)] = p 1 (x) + ip 2 (x), (31) where p 1 := Re p(x) and p 2 (x) := Im p(x). Choose N(x) = 1/γ 3, (32) where γ is the constant γ in Assumption A). Step 2. Choose h(x) = h 1 (x) + ih 2 (x), (33) where the functions h 1 (x) and h 2 (x) are defined by the formulas: h i (x) = γ 3 p i (x)/(4π), i = 1, 2, (34) and the functions p i (x) are defined in Step 1. Step 3. Partition D into P small cubes Ω p with side length 1/P, and embed m 3 small balls in each cube Ω p so that Assumption A) holds. Then N (Ω p ) = 1 a 2 κ N(x)dx = Ω p /(γ 3 a 2 κ Ω p ) = 1/[γP a(2 κ)/3 ] 3, (35) where N ( p ) is the number of the balls embedded in the cube Ω p, κ (0, 1), a is the radius of the embedded balls, and Ω p is the volume of the cube Ω p. 6
7 Since 3 a = [1/(mγP )] 2 κ [1 + o(1)] as m, it follows that N (Ω p ) lim m m 3 = 1. (36) By Assumption A) the balls are situated at the distances γa 2 κ 1+κ 3 3, γ > [1/( )]. Therefore, all the assumptions, made in Theorem 1.1, hold. Thus, max u e(x) u(x) 0 as M, (37) x D where u e (x) is defined in (10) and u(x) solves (12). Let us assume for simplicity that n 2 0(x) = 1, so that Then u e (x) = u 0 (x) 4π G(x, y) = g(x, y) := exp(ik x y )/(4π x y ). j=1 and the limiting function u(x) = lim u e(x) M solves the integral equation g(x, x j )h(x j )u e (x j )a 2 κ, x x j > a, M := ( ) 3, (38) u(x) + T u(x) = u 0 (x), (39) where T u(x) := D g(x, y)p(y)u(y)dy, (40) g(x, y) := exp(ik x y )/(4π x y ), (41) M := ( ) 3, h(x) = h 1 (x) + ih 2 (x), h i (x), i = 1, 2, are defined in (34), p(x) = k 2 [n 2 0(x) n 2 (x)] = 4π[h 1 (x) + ih 2 (x)]n(x) = 4π[h 1 (x) + ih 2 (x)]/γ 3, and the function u 0 (x) in (38) solves the scattering problem (1)-(3). It follows from (37) that (42) max u(x l) u e (x l ) 0 as M, (43) 7
8 where u e (x) and u(x) are defined in (38) and (39), respectively. Here and throughout this paper D := M j=1, M := ( ) 3, (j = 1, 2,..., M) are cubes with the side length 1/( ), D l = for j l, and x j denotes the center of the cube. In the following paragraphs we derive the rate of convergence in (43). We denote v 1 u := sup u(x) and v C M := max v v 2 j, v :=. x D 1 j M. CM, where C is the set of complex numbers. Consider the following piecewise-constant function as an approximate solution to equation (39): u (M) (x) := χ j (x)u j,m, (44) j=1 where u j,m (j = 1, 2,..., M) are constants and v M χ j (x) := { 1, x Dj, 0, otherwise. (45) Substituting u (M) (x) for u(x) in (39) and evaluating at points x l, one gets the following linear algebraic system (LAS) which is used to find the unknown u j,m : ũ (M) + T d,m ũ (M) = u 0,M, (46) where T d,m is a discrete version of T M, defined below, u 1,M u 0 (x 1 ) u 2,M u 0 (x 2 ) ũ (M) :=. u M,M CM, u 0,M :=. u 0 (x M ) CM, (47) u 0 (x) solves problem (1)-(3), and (T d,m v) l := g(x l, y)p(y)dyv j, l = 1, 2,..., M, v := j=1 v 1 v 2. v M CM. (48) Multiplying the l-th equation in (46) by χ l (x), l = 1, 2,..., M, and summing up over l from 1 to M, one gets u (M) (x) = u 0,(M) (x) T M u (M) (x), (49) 8
9 where u (M) (x) is defined in (44), u 0,(M) (x) := and T M u(x) := χ j (x)u 0 (x j ), (50) j=1 j=1 χ j (x) g(x j, y)p(y)u(y)dy, M = ( ) 3. (51) D It was proved in [5] that equation (49) is equivalent to (46) in the sense that {u j,m } M j=1 solves (46) if and only if function (44) solves (49). Lemma 3.1. For all sufficiently large M equation (46) has a unique solution, and there exists a constant c 1 > 0 such that (I d,m + T d,m ) 1 c 1, M > M 0, (52) where M 0 > 0 is a sufficiently large number. Proof. Consider the operators T and T M as operators in the space L (D) with the sup-norm. Let (T T M )u := sup x D (T T M )u(x). Then (T T M )u max i This implies sup x D i j=1 u p max i O(1/( )). (g(x, y) g(x i, y))p(y)u(y) dy sup x x j 1 j=1 g(x, y) g(x i, y) dy (53) T T M = O(1/( )) = O(1/M 1/3 ) 0 as M. (54) The operator I + T is known to be boundedly invertible if k > 0, so where c > 0 is a constant. Therefore, (I + T ) 1 < c, I + T M = (I + T )[I + (I + T ) 1 (T M T )]. (55) By (54) there exists M 0 such that (I + T ) 1 (T M T ) c T M T < δ < 1, M > M 0, (56) where δ > 0 is a constant. From (56) we obtain, M > M 0, [I + (I + T ) 1 (T M T )] (I + T ) 1 1/(1 δ). (57) (T M T ) 9
10 Therefore, it follows from (55) that I + T M is boundedly invertible and (I + T M ) 1 = [I + (I + T ) 1 (T M T )] 1 (I + T ) 1, (58) so there exists a constant c 0 > 0 such that (I + T M ) 1 c 0, M > M 0. (59) Since (49) is equivalent to (46), it follows that the homogeneous equation v + T d,m v = 0 has only trivial solution for M > M 0, i.e., N (I d,m + T d,m ) = {0} for M > M 0, where N (A) is the nullspace of the operator A, I d,m is the identity operator in C M and T d,m is defined in (48). Therefore, by the Fredholm alternative equation (46) is solvable for M > M 0. This together with (59) yield the existence of a constant c 1 > 0 such that (I d,m + T d,m ) 1 c 1 for M > M 0. Lemma 3.1 is proved. Define T d : C 2 (D) C M as follows (T d w) l := (T w)(x l ) = and u M := u(x 1 ) u(x 2 ). u(x M ) j=1 g(x l, y)p(y)w(y)dy, l = 1, 2,..., M, (60) CM, (61) where T is defined in (40) and u(x) solves (39). Then it follows from (39), (60) and (61) that the following equation holds u M + T d u = u 0,M, (62) where u 0,M is defined in (47). Using equations (46) and (62), we derive the following equality: (I d,m + T d,m )(ũ (M) u M ) = (I d,m + T d,m )ũ (M) (I d,m + T d,m )u M = u 0,M (I d,m u M + T d,m u M ) = u 0,M u M T d,m u M = T d u T d,m u M, (63) 10
11 where ũ (M) and u 0,M are defined in (47), I d,m v = v, v = v 1 v 2. v M Using relation (63), one gets CM. (64) ũ (M) u M = (I d,m + T d,m ) 1 (T d u T d,m u M ). (65) Lemma 3.2. Let Assumption A) hold (see Section 2 below (25)). Suppose u(x) solves (39) and p(x) C 1. Then ũ (M) u M C M = O(1/M 2/3 ) as M, (66) where u M and ũ (M) are defined in (61) and (47), respectively. Proof. By (65) and estimate (52) we obtain ũ (M) u M C M (I d,m + T d,m ) 1 T d u T d,m u M C M c 1 T d u T d,m u M C M, (67) where T d,m and T d are defined in (48) and (60), respectively. Let us derive an estimate for T d u T d,m u M C M. We have T d u T d,m u M C M = max g(x l, y)p(y)(u(y) u(x j ))dy (68) where J 1 := max and J 2 := max J 1 + J 2, j=1 g(x l, y)p(y)(u(y) u(x l ))dy D l Since u(x), p(x) C(D), we get J 1 2 p u g(x l, y)p(y)(u(y) u(x j ))dy. max 1 dy c(p, u) D l 4π x l y 3/(2 ) 0 rdr = 3c(p, u) 2(2 ) 2, (69) 11
12 where c(p, u) := 2 p u. Using the identity u(y) u(x j ) = u(y) u(x j ) Du(x j )(y x j ) + Du(x j )(y x j ) and applying the triangle inequality, we get the estimate J 2 I 1 + I 2, (70) where I 1 := max g(x l, y)p(y)(u(y) u(x j ) Du(x j )(y x j ))dy (71) and I 2 := max g(x l, y)p(y)du(x j )(y x j )dy. (72) Let us derive an estimate for I 1. Using the Taylor expansion, one gets I 1 p max g(x l, y) sup D 2 u(sy+(1 s)x j ) y x j 2 dy. (73) 0 s 1 Since p C 1 (D), u C 2 (D), D g(x, y) dy < and y x j 3 2 for y, it follows from (73) that I 1 = O(1/( ) 2 ) = O(1/M 2/3 ), as M. (74) Estimate of I 2 is obtained as follows. Since x j is the center of the cube, one has (y x j )dy = 0, so it follows that g(x l, x j )p(x j )Du(x j )(y x j )dy = 0, j = 1, 2,..., M. (75) Therefore, using (75), I 2 can be rewritten as follows: I 2 = max (g(x l, y)p(y) g(x l, x j )p(x j ))Du(x j )(y x j )dy. (76) Let g l (y) := g(x l, y), (g l p)(y) = g l (y)p(y), l = 1, 2,..., M. (77) 12
13 Then the formulas (g l p)(y) (g l p)(x j ) = and 1 0 t (g lp)(ty + (1 t)x j )dt sup D y (g l p)(ty + (1 t)x j ) y x j 0 t 1 D y (g l p)(y) = p(y)d y g l (y) + g l (y)dp(y), yield the following estimate: 3 Du I 2 max 2 p sup D y g l (ty + (1 t)x j ) y x j dy D 0 t 1 3 Du + max 2 Dp sup g l (ty + (1 t)x j ) y x j dy D 0 t 1 c(k) Du ( ) ( ) 2 max p 1 D 4π x l y + 1 4π x l y 2 dy + c Du ( ) 2 max Dp 1 4π x l y dy = O(1/( )2 ) = O(1/M 2/3 ), D (78) (79) where c > 0 is a constant and c(k) is a constant depending on the wave number k. Here the estimates y x j 3/(2 ) for y, 1 D 4π x l dy < for y β β < 3, and x l y 2 x l s for y, j l, s = tx j + (1 t)y, t [0, 1], were used. The relation (66) follows from (67), (68), (69), (70), (74) and (79). Lemma 3.2 is proved. Lemma 3.3. Let the Assumption A) hold. Consider the linear algebraic system for the unknowns u e (x l ): u e (x l ) = u 0 (x l ) 4π g(x l, x j )h(x j )a 2 κ u e(x j ), l = 1, 2,... M, (80) where p(x) = 4πh(x)N(x) C 2 (D), N(x) = 1/γ 3, M = ( ) 3, and g(x, y) is defined in (40). Then ( ) log M ũ (M) u e,m C M = O M + 1 2/3 γ3 Ma 2 κ as M, (81) where ũ (M) is defined in (47), u e (x 1 ) u e (x 2 ) u e,m :=.. CM, (82) u e (x M ) and u e (x j ), j = 1, 2,..., M, solve system (80). 13
14 Proof. Let us rewrite (80) as u e (x l ) = u 0 (x l ) a 2 κ g(x l, x j )p(x j ) N(x j ) u e(x j ) = u 0 (x l ) (T e u e,m ) l, l = 1, 2,..., M, (83) where p(x) = 4πh(x)N(x), = 1/( ) 3 is the volume of the cube, N(x) = 1/γ 3, and (T e v) l := ( ) 3 g(x l, x j )p(x j ) γ a (2 κ)/3 Dj v j, v = v 1 v 2. v M CM, (84) l = 1, 2,..., M. Let us derive an estimate for ũ (M) u e,m C M. Using equations (46) and (83), we obtain (I d,m + T d,m )(ũ (M) u e,m ) = (I d,m + T d,m )ũ (M) (I d,m + T d,m )u e,m = u 0,M u e,m T d,m u e,m = T e u e,m T d,m u e,m, (85) where ũ (M) and u 0,M are defined in (47), u e,m, T d,m and T e are defined in (82), (48) and (84), respectively. Relation (85) implies ũ (M) u e,m C M (I d,m + T d,m ) 1 T e u e,m T d,m u e,m C M c 1 T e u e,m T d,m u e,m C M, (86) where estimate (52) was used. Let us derive an estimate for T e u e,m T d,m u e,m C M. (48) and (84), one gets Using definitions (T e T d,m )u e,m C M = max g l (x j )p a (x j )u e (x j ) g l (y)p(y)dyu e (x j ) j=1 = max (g l (x j )p a (x j ) g l (y)p(y)) dyu e (x j ) g l (y)p(y)dyu e (x l ) D l. 14
15 Applying the triangle inequality to the above equation, we obtain (T e T d,m )u e,m C M max g l (y)p(y)u e (x l )dy D l + max g l (y)(p(y) p(x j ))u e (x j )dy + max g l (y)(p(x j ) p a (x j ))u e (x j )dy + max p a (x j ) (g l (y) g l (x j ))u e (x j )dy max (J 0(l) + J 1 (l) + J 2 (l) + J 3 (l)), (87) ( ) 3, where g l (y) := g(x l, y), p a (x) := p(x) γ a (2 κ)/3 J 0 (l) := g(x l, y)p(y)u e (x l ) dy, (88) D l J 1 (l) := g(x l, y)(p(y) p(x j ))u e (x j )dy, (89) J 2 (l) := and J 3 (l) := g(x l, y)(p(x j ) p a (x j ))u e (x j ) dy, (90) p a (x j ) (g(x l, y) g(x l, x j ))u e (x j )dy. (91) Using the estimate x l y 3/(2 ) for y D l, one gets the following estimate of J 0 (l): ( J 0 (l) p u e C M g(x l, y) dy D l ( ) 3/(2 ) = rdr p u e C M 0 where B a (x) is defined in (19). B 3/(2 ) (x l) ) 1 4π x l y dy p u e C M = 3 p u e C M 2(2 ) 2 = O(1/M 2/3 ), (92) 15
16 Let us estimate J 1 (l). Using the identity p(y) p(x j ) = p(y) p(x j ) Dp(x j ) (y x j ) + Dp(x j ) (y x j ) (93) in (89) and applying the triangle inequality, one obtains J 1 (l) J 1,1 + J 1,2, (94) where J 1,1 := and J 1,2 := g(x l, y)[p(y) p(x j ) Dp(x j ) (y x j )]u e (x j )dy, (95) g(x l, y)dp(x j ) (y x j )u e (x j )dy. (96) To get an estimate for J 1,1, we apply the Taylor expansion of p(x) and get J 1,1 u e C M 2 3 D2 p u e C M 8( ) 2 g(x l, y) sup D 2 p(ty + (1 t)x j ) y x j 2 dy 0 t 1 g(x l, y) dy = O(1/( ) 2 ) = O(1/M 2/3 ) as M, (97) where B a (x) is defined in (19), and the estimate y x j 3/(2 ), y, was used. Using the identity g(x l, x j )Dp(x j )(y x j )u e (x j )dy = 0, j = 1, 2,..., M, (98) one gets J 1,2 = (g(x l, y) g(x l, x j ))Dp(x j ) (y x j )u e (x j )dy. 16
17 Using the assumption p C 1 (D), one derives the following estimate of J 1,2 : J 1,2 u e C M 3 Dp u e C M 2 3 Dp u e C M 2 c(k) Dp u e C M ( ) 2 + c(k) Dp u e C M ( ) 2 c(k) Dp u e C M ( ) 2 (g(x l, y) g(x l, x j ))Dp(x j ) (y x j ) dy g(x l, y) g(x l, x j ) dy B 3 (x l) ( sup Dg(x l, ty + (1 t)x j ) y x j dy 0 t 1 sup 0 t 1 sup 0 t 1 = O(1/( ) 2 ) = O(1/M 2/3 ) as M, 1 4π x l ty (1 t)x j 2 dy 1 4π x l ty (1 t)x j dy 1 4π x l y + 1 4π x l y 2 ) dy (99) where c(k) is a constant depending on the wave number k and B a (x) is defined in (19). Here the estimates y x j 3/(2 ) for y, 1 D 4π x l dy < y β for β < 3, and x l y 2 x l s for y, j l, s = tx j + (1 t)y, t [0, 1], were used. Applying estimates (97) and (99) to (94), we get J 1 (l) = O(1/M 2/3 ), as M. (100) Let us derive an estimate for J 2 (l). From (90) and the definition p a (x) = p(x)(γ a (2 κ)/3 ) 3 we get J 2 (l) u e C M u e C M p 1 (γ a (2 κ)/3 ) 3 g(x l, y) p(x j ) 1 (γ a (2 κ)/3 ) 3 dy u e C M p 1 (γ a (2 κ)/3 ) 3 B 3 (x l) ( ) 3 = rdr u e C M p 1 (γ a (2 κ)/3 ) 3 0 g(x l, y) dy 1 4π x l y dy = 3 2 u e C M p 1 γ 3 Ma (2 κ) = O( 1 γ3 Ma (2 κ) ), (101) 17
18 where B a (x) is defined in (19). Estimate of J 3 (l) is derived as follows. Using the identity Dg(x l, x j )(y x j )u e (x j )dy = 0, j = 1, 2,... M, (102) one gets the following estimate: J 3 (l) = p γ 3 Ma 2 κ 2 3c M 8( ) 2 c(k)c M ( ) 2 + c(k)c M ( ) 2 + c(k)c M ( ) 2 c(k)c M ( ) 2 c(k)c M ( ) 2 p a (x j ) u e(x j ) [g(x l, y) g(x l, x j ) Dg(x l, x j ) (y x j )] dy sup D 2 g(x l, ty + (1 t)x j ) y x j 2 dy 0 t 1 sup D 2 g(x l, ty + (1 t)x j ) dy 0 t 1 sup 0 t 1 sup 0 t 1 sup 0 t 1 1/(2 )< x l y < 3 3 1/(2 ) ( r r 1 4π x l ty (1 t)x j dy 1 4π x l ty (1 t)x j 2 dy 2c(k)c [ M ( ) log( 3) log (1/(2 )) = 2c(k)c [ M 1 + log( 3) log M 2/3 1 4π x l ty (1 t)x j 3 dy ( 1 4π x l y + 1 4π x l y π x l y 3 ) dr ] ( )] 1/(2M 1/3 ) = O ( ) log M, M 2/3 ) dy (103) where c M := p γ 3 Ma 2 κ, c(k) is a constant depending on the wave number k. Here the estimates y x j 3/(2 ) for y, and x l y 2 x l s for y, j l, s = tx j + (1 t)y, t [0, 1], were used. Using estimates (97), (99), (101) and (103), one gets relation (81). Lemma 3.3 is proved. The following theorem is a consequence of Lemma 3.2 and Lemma
19 Theorem 3.4. Suppose that the assumptions of Lemma 3.2 and Lemma 3.3 hold. Then ( ) log M u M u e,m C M = O M + 1 2/3 γ3 Ma 2 κ as M, (104) where u M and u e,m are defined in (61) and (82), respectively. To get the rate of convergence (104) we have assumed that p(x) C 2 (D). If p(x) C(D) then the rate given in Theorem 3.4 is no longer valid. The rate of u M u e,m C M when p(x) C(D) is given in the following theorem. Theorem 3.5. Let Assumption A) hold and p C(D) satisfies p(x) p(y) ω p ( x y ), x, y D, (105) where ω p is the modulus of continuity of the function p(x).then ( ) log M u M u e,m C M = O M + 1 1/3 γ3 Ma 2 κ + ω p(1/m 1/3 ), (106) where u M and u e,m are defined in (61) and (82), respectively. Proof. We have u M u e,m C M u M ũ M C M + ũ M u e,m C M. (107) Let us estimate u M ũ M C M. From (67) we have u M ũ M C M c 1 T d u T d,m u M C M, (108) where c 1 is defined in (52). Using the similar steps given in (68) we get the following estimate for T d u T d,m u M C M : T d u T d,m u M C M 3 p u 2( ) 2 + I 1 + I 2, (109) where I 1 and I 2 are defined in (71) and (72), respectively. It is shown in (74) that I 1 = O(1/M 2/3 ). Since p(x) C(D), the steps (76)-(79) are no longer valid. The estimate of I 2 can be derived as follows. Since p C(D) and u C 1 (D), it follows from (72) that I 2 p Du 3 p Du 2 max j=1, l max g(x l, y) x l y dy B 3 (x l) 1 4π x l y dy = O(1/( )) = O(1/M 1/3 ). (110) 19
20 This together with (109) and I 1 = O(1/M 2/3 ) yield u M ũ M C M = O(1/M 1/3 ). (111) Let us estimate ũ M u e,m C M. From (86) we have ũ M u e,m C M c 1 T e u e,m T d,m u e,m C M, (112) where c 1 is defined in (52). By definitions (48) and (84), and use the triangle inequality, we get T e u e,m T d,m u e,m C M J 1 + J 2, (113) where J 1 := max and J 2 := max g(x l, y)p(y)dyu e (x l )dy (114) D l (g(x l, x j )p a (x j ) g(x l, y)p(y)) u e (x j )dy, (115) p a := p(x)(γ a (2 κ)/3 ) 3. It is proved in (92) that J 1 = O(1/M 2/3 ). The estimate of J 2 is derived as follows. By the triangle inequality we obtain J 2 J 2,1 + J 2,2, (116) where J 2,1 := max (g(x l, x j ) g(x l, y))p a (x j )u e (x j )dy (117) and J 2,2 := max u e C M g(x l, y) p a (x j ) p(y) dy. (118) It is proved in (103) that ( ) log M J 2,1 = O. (119) M 2/3 20
21 To estimate J 2,2, we apply the triangle inequality and get J 2,2 u e C M max + u e C M max γ 3 Ma 2 κ 1 p max u e C M + max sup ω p ( x j y ) u e C M j y max ( ) = O γ 3 Ma 2 κ 1 + ω p(1/m 1/3 ) g(x l, y) p a (x j ) p(x j ) dy g(x l, y) p(x j ) p(y) dy, g(x l, y) dy g(x l, y) dy (120) where ω p is the modulus of continuity of p(x). This together with J 1 = O(1/M 2/3 ) and (119) yield ( ) log M ũ M u e,m C M = O M + 2/3 γ3 Ma 2 κ 1 + ω p(1/m 1/3 ). (121) Relation (106) follows from (107), (111) and (121). Theorem 3.5 is proved. It has been mentioned in the introduction that our main goal is to develop an algorithm for obtaining the minimal number of the embedded small balls which generate a material whose refraction coefficient differs from the desired one by not more than a desired small quantity. Let us derive an approximation of the desired refraction coefficient n 2 (x) generated by the embedded small balls. We rewrite the sum in (38) as g(x, x j )p a (x j )u(x j ), (122) j=1 where x x j > a, j = 1, 2,..., M, = 1/( ) 3 is the volume of the cube, and p a (x) := 4πh(x)N(x)(γ a (2 κ)/3 ) 3, N(x) = 1/γ 3. (123) Since (γ a (2 κ)/3 ) 3 1 as m, it follows that (122) is a Riemannian sum for the integral g(x, y)p(y)u(y)dy, where p(x) = 4πh(x)N(x). This motivates D us to define the following approximation of the refraction coefficient n 2 (x): n 2 a (x) := n 2 0(x) k 2 p a (x), (124) 21
22 where p a is defined in (123). We are interested in finding the largest radius a (or the smallest M = ( ) 3 ) such that e(m) := max n2 (x l ) n 2 a (x l ) δ/k 2 := δ(k), (125) where k is the wave number, δ > 0 is a given small quantity and n 2 a (x) is defined in (124). An estimate of the error e(m), defined in (125), is given in the following theorem. Theorem 3.6. Suppose Assumption A) holds and N(x) = 1/γ 3. Then max 1 l ( ) n2 (x l ) n 2 3 a (x l ) k 2 1 (2 κ)/3 p (γ a ) 3, (126) where x l is the center of the l-th small ball, p(x) is defined in (41), n 2 (x) = n 2 0(x) k 2 p(x), and n 2 a is defined in (124). Consequently, lim m max 1 l ( ) n2 (x l ) n 2 3 a (x l ) = 0. (127) Proof. Let I l := n 2 (x l ) n 2 a (x l ). Then I l = k 2 p(x l ) p(x l )[γ a (2 κ)/3 ] 3 k 2 p(x l ) 1 [γ a (2 κ)/3 ] 3 k 2 p 1 [γ a (2 κ)/3 ] 3. (128) This together with relation (22) yield (127). Theorem 3.6 is proved. Using Theorem 3.6 one can calculate the smallest M satisfying (125) by the following algorithm: Algorithm Initializations: Let the wave number k, the constant δ > 0, n 2 0(x) and n 2 (x) be given. Fix P > 1, m = m 0 := 1, κ (0, 1), γ > [1/(2P )] (κ+1)/3 and N(x) = 1/γ 3. Partition D into P 3 cubes Ω q, D = P q=1ω 3 q, Ω j Ω i = for j i, where each cube Ω j has side length 1/P. Step 1. Solve the equation γa (2 κ)/3 + a 1/( ) = 0 (129) for a. 22
23 Step 2. Embed m 3 small balls of radius a in each cube Ω q so that Assumption A) holds. Step 3. Compute p(x l ) = k 2 (n 2 0(x l ) n 2 (x l )) and p a (x l ) = p(x l )[γ a (2 κ)/3 ] 3, l = 1, 2,..., ( ) 3, where x l is the center of the l-th small ball and k is the wave number. Step 4. If max 1 l ( ) 3 p(x l ) p a (x l ) > δ, then set m = m + 1 and go to Step 1. Otherwise the number M = ( ) 3 is the smallest number of the balls embedded in D such that inequality (125) holds, and a is the radius of each embedded ball. 4 Numerical experiments In this section we give the results of the numerical experiments. Suppose the refraction coefficient of the original material in D is n 2 0(x) = 1 and the desired refraction coefficients are: Example 1. n 2 1(x) = 5, Example 2. n 2 2(x) = 5 + exp( x x 0 2 /(2σ 2 ))/( 2πσ), where x 0 = (0.5, 0.5, 0.5) and σ = 3. Here M is the smallest number of the embedded small balls 2M 1/3 taken from Example 1. Example 3. n 2 3(x) = sin(x 1 ), where x 1 is the first component of the vector x, Example 4. n 2 4(x) = sin(100x 1 ), where x 1 is the first component of the vector x. Example 5. n 2 5(x) = n 2 3(x) + iε, where n 2 3(x) is defined in Example 3, i = 1 and ε is a small positive number. By the recipe we choose p(x) = k 2 (n 2 0(x) n 2 (x)) = k 2 (1 n 2 (x)), k > 0. (130) Let us take P = 11, κ = 0.99, γ = 10 k[1/(2p )] (1+κ)/3, m 0 = 1, (131) where k is the wave number and m 0 is the initial number of small balls described in the algorithm. Here the parameters P = 11 and m 0 = 1 are chosen so that the approximation error in Lemma 3.2 is at most c(k)10 4, where c(k) is a constant depending on the wave number k. We apply the algorithm given in Section 3 to 23
24 get the minimal total number of small balls embedded in the cube D such that inequality (125) holds for various values of δ, where the quantity δ was defined in the Algorithm (see the Initialization and Step 4 of the Algorithm). The smallest number of the balls embedded in D increases as δ decreases. The radius a and the ratio a /d decrease as M increases, which agrees with the theory. The results are shown in tables 1-6. In these tables we define d := min dist(b a (x i ), B a (x j )), (132) 1 i,j M,i j where B a (x) is defined in (19), and E j := max n2 j(x l ) n 2 j,a (x l ) = max n2 j(x l ) n 2 0(x l ) 1 γ 3 Ma 2 κ, (133) where n 2 j,a (x) := n 2 0(x) k 2 p j,a (x), p j,a (x) := p j (x)γ 3 Ma 2 κ, M is the smallest total number of small balls embedded in the domain D, a is the radius of the embedded small balls and x l is the center of the l-th small ball. In Example 1 we choose a constant refraction coefficient n 2 (x). For k = 1 the total number of small balls M increases by when the error level δ is decreased by 4.5%, while for k = 5 the value of M increases by as the error level δ decreases by 4.5%, as shown in Table 1. k = 1 δ m M a a /d E k = 5 δ m M a a /d E Table 1: Example 1 k = 1 δ m M a a /d E k = 5 δ m M a a /d E Table 2: Example 2 In Example 2 we add a Gaussian function to the constant refraction coefficient n 2 1(x) considered in Example 1. Since n 2 0(x) n 2 1(x) n 2 0(x) n 2 2(x), it follows from (133) that E 1 E 2. Therefore, in this example one may need to embed more small balls to reach the same error level δ as in Example 1. The numerical results show that the values of M in Example 2 are higher than 24
25 the values of M of Example 1, see Table 2. The refraction coefficients n 2 (x) considered in Examples 3 and 4 are periodic. In Example 3 for k = 1 the total number of the embedded small particles M increases by as the error level δ decreases by 5%. A significant increment of M is obtained for k = 5. These results are shown in Table 3. k = 1 δ m M a a /d E k = 5 δ m M a a /d E Table 3: Example 3 In Example 4 the angular frequency of the sine function is 100 times the angular frequency of the sine function given in Example 3. In this case we get that for k = 1 the value of M increases by as the error level δ decreases by 5% which is higher than the increment given in Example 3. Similarly, for k = 5 the increment of M in this example is higher than the increment of M obtained in Example 3. k = 1 δ m M a a /d E k = 5 δ m M a a /d E Table 4: Example 4 In Example 5 we add a small positive imaginary part to the refraction coefficient n 2 3(x) defined in Example 3. We observe that if the value of the small imaginary ε is chosen from the interval (0, 0.2) then the values of M obtained in this example are equal to the values of M obtained in Example 3. For simplicity we show only the results of n 2 5(x) with Imn 2 5(x) = 0.02 in Table 5. The value of M starts increasing when k = 5 and the value of the small positive imaginary part ε is equal to 0.2 as shown in Table 6. 25
26 k = 1 δ m M a a /d E k = 5 δ m M a a /d E Table 5: Example 5 with Imn 2 5(x) = 0.02 k = 1 δ m M a a /d E k = 5 δ m M a a /d E Table 6: Example 5 with Imn 2 5(x) = 0.2 References [1] A.G. Ramm, Many body wave scattering by small bodies and applications, J. Math. Phys., 48, N10, , (2007). [2] A.G. Ramm, Material with the desired refraction coefficients can be made by embedding small particles, Phys. Lett. A, 370, N5-6, (2007), [3] A.G. Ramm, A recipe for making materials with negative refraction in acoustic, Phys. Lett. A, 372/13, (2008), [4] A.G. Ramm, Wave scattering by many small particles embedded in a medium, Phys. Lett. A, 372/17, (2008), [5] Ramm, A. G., A collocation method for solving integral equations, Internat. Journ. of Comput. Sci. and Math., 2(3), (2009)
Creating materials with a desired refraction coefficient: numerical experiments. Sapto W. Indratno and Alexander G. Ramm*
76 Int. J. Computing Science and Mathematics, Vol. 3, Nos. /2, 200 Creating materials with a desired refraction coefficient: numerical experiments Sapto W. Indratno and Alexander G. Ramm* Department of
More informationHow to create materials with a desired refraction coefficient?
How to create materials with a desired refraction coefficient? A. G. Ramm Mathematics Department, Kansas State University, Manhattan, KS66506, USA ramm@math.ksu.edu www.math.ksu.edu/ ramm Abstract The
More informationA method for creating materials with a desired refraction coefficient
This is the author s final, peer-reviewed manuscript as accepted for publication. The publisher-formatted version may be available through the publisher s web site or your institution s library. A method
More informationScattering by many small particles and creating materials with a desired refraction coefficient
102 Int. J. Computing Science and Mathematics, Vol. 3, Nos. 1/2, 2010 Scattering by many small particles and creating materials with a desired refraction coefficient M.I. Andriychuk Institute of Applied
More informationElectromagnetic wave scattering by many small bodies and creating materials with a desired refraction coefficient
168 Int. J. Computing Science and Mathematics, Vol. Electromagnetic wave scattering by many small bodies and creating materials with a desired refraction coefficient A.G. Ramm Mathematics epartment, Kansas
More informationHeat Transfer in a Medium in Which Many Small Particles Are Embedded
Math. Model. Nat. Phenom. Vol. 8, No., 23, pp. 93 99 DOI:.5/mmnp/2384 Heat Transfer in a Medium in Which Many Small Particles Are Embedded A. G. Ramm Department of Mathematics Kansas State University,
More informationScattering of scalar waves by many small particles.
This is the author s final, peer-reviewed manuscript as accepted for publication. The publisher-formatted version may be available through the publisher s web site or your institution s library. Scattering
More informationScattering of electromagnetic waves by many nano-wires
Scattering of electromagnetic waves by many nano-wires A G Ramm Department of Mathematics Kansas State University, Manhattan, KS 66506-2602, USA ramm@math.ksu.edu Abstract Electromagnetic wave scattering
More informationAfrika Matematika, 22, N1, (2011),
Afrika Matematika, 22, N1, (2011), 33-55. 1 Wave scattering by small bodies and creating materials with a desired refraction coefficient Alexander G. Ramm epartment of Mathematics Kansas State University,
More informationarxiv: v1 [math-ph] 20 Jul 2007
Many-body wave scattering by small bodies and applications arxiv:0707.304v [math-ph] 20 Jul 2007 A. G. Ramm (Mathematics epartment, Kansas St. University, Manhattan, KS 66506, USA and TU armstadt, Germany)
More informationPhys.Let A. 360, N1, (2006),
Phys.Let A. 360, N1, (006), -5. 1 Completeness of the set of scattering amplitudes A.G. Ramm Mathematics epartment, Kansas State University, Manhattan, KS 66506-60, USA ramm@math.ksu.edu Abstract Let f
More informationInverse scattering problem with underdetermined data.
Math. Methods in Natur. Phenom. (MMNP), 9, N5, (2014), 244-253. Inverse scattering problem with underdetermined data. A. G. Ramm Mathematics epartment, Kansas State University, Manhattan, KS 66506-2602,
More informationA collocation method for solving some integral equations in distributions
A collocation method for solving some integral equations in distributions Sapto W. Indratno Department of Mathematics Kansas State University, Manhattan, KS 66506-2602, USA sapto@math.ksu.edu A G Ramm
More informationA numerical algorithm for solving 3D inverse scattering problem with non-over-determined data
A numerical algorithm for solving 3D inverse scattering problem with non-over-determined data Alexander Ramm, Cong Van Department of Mathematics, Kansas State University, Manhattan, KS 66506, USA ramm@math.ksu.edu;
More informationElectromagnetic wave scattering by small impedance particles of an arbitrary shape
This is the author s final, peer-reviewed manuscript as accepted for publication. The publisher-formatted version may be available through the publisher s web site or your institution s library. Electromagnetic
More informationMathematical Methods for Physics and Engineering
Mathematical Methods for Physics and Engineering Lecture notes for PDEs Sergei V. Shabanov Department of Mathematics, University of Florida, Gainesville, FL 32611 USA CHAPTER 1 The integration theory
More informationLaplace s Equation. Chapter Mean Value Formulas
Chapter 1 Laplace s Equation Let be an open set in R n. A function u C 2 () is called harmonic in if it satisfies Laplace s equation n (1.1) u := D ii u = 0 in. i=1 A function u C 2 () is called subharmonic
More informationCalculation of Electromagnetic Wave Scattering by a Small Impedance Particle of an Arbitrary Shape
Calculation of Electromagnetic Wave cattering by a mall Impedance Particle of an Arbitrary hape A. G. Ramm 1, M. I. Andriychuk 2 1 Department of Mathematics Kansas tate University, Manhattan, K 6656-262,
More informationKANSAS STATE UNIVERSITY Manhattan, Kansas
NUMERICAL METHODS FOR SOLVING WAVE SCATTERING by NHAN THANH TRAN B.S., University of Science, Vietnam, 2003 M.S., McNeese State University, 2010 AN ABSTRACT OF A DISSERTATION submitted in partial fulfillment
More informationMATH 205C: STATIONARY PHASE LEMMA
MATH 205C: STATIONARY PHASE LEMMA For ω, consider an integral of the form I(ω) = e iωf(x) u(x) dx, where u Cc (R n ) complex valued, with support in a compact set K, and f C (R n ) real valued. Thus, I(ω)
More informationCourse 212: Academic Year Section 1: Metric Spaces
Course 212: Academic Year 1991-2 Section 1: Metric Spaces D. R. Wilkins Contents 1 Metric Spaces 3 1.1 Distance Functions and Metric Spaces............. 3 1.2 Convergence and Continuity in Metric Spaces.........
More informationElectromagnetic wave scattering by small impedance particles of an arbitrary shape
J Appl Math Comput DOI 10.1007/s12190-013-0671-3 ORIGINAL REEARCH JAMC Electromagnetic wave scattering by small impedance particles of an arbitrary shape A.G. Ramm Received: 4 December 2012 Korean ociety
More informationComm. Nonlin. Sci. and Numer. Simul., 12, (2007),
Comm. Nonlin. Sci. and Numer. Simul., 12, (2007), 1390-1394. 1 A Schrödinger singular perturbation problem A.G. Ramm Mathematics Department, Kansas State University, Manhattan, KS 66506-2602, USA ramm@math.ksu.edu
More informationQ. Zou and A.G. Ramm. Department of Mathematics, Kansas State University, Manhattan, KS 66506, USA.
Computers and Math. with Applic., 21 (1991), 75-80 NUMERICAL SOLUTION OF SOME INVERSE SCATTERING PROBLEMS OF GEOPHYSICS Q. Zou and A.G. Ramm Department of Mathematics, Kansas State University, Manhattan,
More informationTEST CODE: MIII (Objective type) 2010 SYLLABUS
TEST CODE: MIII (Objective type) 200 SYLLABUS Algebra Permutations and combinations. Binomial theorem. Theory of equations. Inequalities. Complex numbers and De Moivre s theorem. Elementary set theory.
More informationMath 4263 Homework Set 1
Homework Set 1 1. Solve the following PDE/BVP 2. Solve the following PDE/BVP 2u t + 3u x = 0 u (x, 0) = sin (x) u x + e x u y = 0 u (0, y) = y 2 3. (a) Find the curves γ : t (x (t), y (t)) such that that
More informationHow large is the class of operator equations solvable by a DSM Newton-type method?
This is the author s final, peer-reviewed manuscript as accepted for publication. The publisher-formatted version may be available through the publisher s web site or your institution s library. How large
More informationExercise 1. Let f be a nonnegative measurable function. Show that. where ϕ is taken over all simple functions with ϕ f. k 1.
Real Variables, Fall 2014 Problem set 3 Solution suggestions xercise 1. Let f be a nonnegative measurable function. Show that f = sup ϕ, where ϕ is taken over all simple functions with ϕ f. For each n
More informationMath 421, Homework #9 Solutions
Math 41, Homework #9 Solutions (1) (a) A set E R n is said to be path connected if for any pair of points x E and y E there exists a continuous function γ : [0, 1] R n satisfying γ(0) = x, γ(1) = y, and
More informationTHE INVERSE FUNCTION THEOREM
THE INVERSE FUNCTION THEOREM W. PATRICK HOOPER The implicit function theorem is the following result: Theorem 1. Let f be a C 1 function from a neighborhood of a point a R n into R n. Suppose A = Df(a)
More informationMATH 202B - Problem Set 5
MATH 202B - Problem Set 5 Walid Krichene (23265217) March 6, 2013 (5.1) Show that there exists a continuous function F : [0, 1] R which is monotonic on no interval of positive length. proof We know there
More informationTHEOREMS, ETC., FOR MATH 516
THEOREMS, ETC., FOR MATH 516 Results labeled Theorem Ea.b.c (or Proposition Ea.b.c, etc.) refer to Theorem c from section a.b of Evans book (Partial Differential Equations). Proposition 1 (=Proposition
More informationMany-body wave scattering problems in the case of small scatterers
J Appl Math Comput OI 10.1007/s12190-012-0609-1 PHYICAL CIENCE JAMC Many-body wave scattering problems in the case of small scatterers Alexander G. Ramm Received: 9 August 2012 Korean ociety for Computational
More informationMarch Algebra 2 Question 1. March Algebra 2 Question 1
March Algebra 2 Question 1 If the statement is always true for the domain, assign that part a 3. If it is sometimes true, assign it a 2. If it is never true, assign it a 1. Your answer for this question
More informationA nonlinear singular perturbation problem
A nonlinear singular perturbation problem arxiv:math-ph/0405001v1 3 May 004 Let A.G. Ramm Mathematics epartment, Kansas State University, Manhattan, KS 66506-60, USA ramm@math.ksu.edu Abstract F(u ε )+ε(u
More informationMathematics 104 Fall Term 2006 Solutions to Final Exam. sin(ln t) dt = e x sin(x) dx.
Mathematics 14 Fall Term 26 Solutions to Final Exam 1. Evaluate sin(ln t) dt. Solution. We first make the substitution t = e x, for which dt = e x. This gives sin(ln t) dt = e x sin(x). To evaluate the
More information1/12/05: sec 3.1 and my article: How good is the Lebesgue measure?, Math. Intelligencer 11(2) (1989),
Real Analysis 2, Math 651, Spring 2005 April 26, 2005 1 Real Analysis 2, Math 651, Spring 2005 Krzysztof Chris Ciesielski 1/12/05: sec 3.1 and my article: How good is the Lebesgue measure?, Math. Intelligencer
More informationn [ F (b j ) F (a j ) ], n j=1(a j, b j ] E (4.1)
1.4. CONSTRUCTION OF LEBESGUE-STIELTJES MEASURES In this section we shall put to use the Carathéodory-Hahn theory, in order to construct measures with certain desirable properties first on the real line
More information4.2 Green s representation theorem
4.2. REEN S REPRESENTATION THEOREM 57 i.e., the normal velocity on the boundary is proportional to the ecess pressure on the boundary. The coefficient χ is called the acoustic impedance of the obstacle
More informationLECTURE 5 APPLICATIONS OF BDIE METHOD: ACOUSTIC SCATTERING BY INHOMOGENEOUS ANISOTROPIC OBSTACLES DAVID NATROSHVILI
LECTURE 5 APPLICATIONS OF BDIE METHOD: ACOUSTIC SCATTERING BY INHOMOGENEOUS ANISOTROPIC OBSTACLES DAVID NATROSHVILI Georgian Technical University Tbilisi, GEORGIA 0-0 1. Formulation of the corresponding
More informationComputational method for acoustic wave focusing
Int. J. Computing Science and Mathematics Vol. 1 No. 1 7 1 Computational method for acoustic wave focusing A.G. Ramm* Mathematics epartment Kansas State University Manhattan KS 6656-6 USA E-mail: ramm@math.ksu.edu
More informationThe oblique derivative problem for general elliptic systems in Lipschitz domains
M. MITREA The oblique derivative problem for general elliptic systems in Lipschitz domains Let M be a smooth, oriented, connected, compact, boundaryless manifold of real dimension m, and let T M and T
More informationExtended Foldy Lax Approximation on Multiple Scattering
Mathematical Modelling and Analysis Publisher: Taylor&Francis and VGTU Volume 9 Number, February 04, 85 98 http://www.tandfonline.com/tmma http://dx.doi.org/0.3846/3969.04.893454 Print ISSN: 39-69 c Vilnius
More informationh(x) lim H(x) = lim Since h is nondecreasing then h(x) 0 for all x, and if h is discontinuous at a point x then H(x) > 0. Denote
Real Variables, Fall 4 Problem set 4 Solution suggestions Exercise. Let f be of bounded variation on [a, b]. Show that for each c (a, b), lim x c f(x) and lim x c f(x) exist. Prove that a monotone function
More informationB553 Lecture 3: Multivariate Calculus and Linear Algebra Review
B553 Lecture 3: Multivariate Calculus and Linear Algebra Review Kris Hauser December 30, 2011 We now move from the univariate setting to the multivariate setting, where we will spend the rest of the class.
More informationLecture notes: Introduction to Partial Differential Equations
Lecture notes: Introduction to Partial Differential Equations Sergei V. Shabanov Department of Mathematics, University of Florida, Gainesville, FL 32611 USA CHAPTER 1 Classification of Partial Differential
More informationAnalysis Finite and Infinite Sets The Real Numbers The Cantor Set
Analysis Finite and Infinite Sets Definition. An initial segment is {n N n n 0 }. Definition. A finite set can be put into one-to-one correspondence with an initial segment. The empty set is also considered
More informationDynamical Systems Method for Solving Ill-conditioned Linear Algebraic Systems
Dynamical Systems Method for Solving Ill-conditioned Linear Algebraic Systems Sapto W. Indratno Department of Mathematics Kansas State University, Manhattan, KS 6656-6, USA sapto@math.ksu.edu A G Ramm
More informationNonlinear Analysis 71 (2009) Contents lists available at ScienceDirect. Nonlinear Analysis. journal homepage:
Nonlinear Analysis 71 2009 2744 2752 Contents lists available at ScienceDirect Nonlinear Analysis journal homepage: www.elsevier.com/locate/na A nonlinear inequality and applications N.S. Hoang A.G. Ramm
More informationREAL VARIABLES: PROBLEM SET 1. = x limsup E k
REAL VARIABLES: PROBLEM SET 1 BEN ELDER 1. Problem 1.1a First let s prove that limsup E k consists of those points which belong to infinitely many E k. From equation 1.1: limsup E k = E k For limsup E
More informationl(y j ) = 0 for all y j (1)
Problem 1. The closed linear span of a subset {y j } of a normed vector space is defined as the intersection of all closed subspaces containing all y j and thus the smallest such subspace. 1 Show that
More informationNOTES ON SCHAUDER ESTIMATES. r 2 x y 2
NOTES ON SCHAUDER ESTIMATES CRISTIAN E GUTIÉRREZ JULY 26, 2005 Lemma 1 If u f in B r y), then ux) u + r2 x y 2 B r y) B r y) f, x B r y) Proof Let gx) = ux) Br y) u r2 x y 2 Br y) f We have g = u + Br
More informationMath LM (24543) Lectures 02
Math 32300 LM (24543) Lectures 02 Ethan Akin Office: NAC 6/287 Phone: 650-5136 Email: ethanakin@earthlink.net Spring, 2018 Contents Continuity, Ross Chapter 3 Uniform Continuity and Compactness Connectedness
More informationMean value properties on Sierpinski type fractals
Mean value properties on Sierpinski type fractals Hua Qiu (Joint work with Robert S. Strichartz) Department of Mathematics Nanjing University, Cornell University Department of Mathematics, Nanjing University
More informationMath 291-2: Final Exam Solutions Northwestern University, Winter 2016
Math 29-2: Final Exam Solutions Northwestern University, Winter 206 Determine whether each of the following statements is true or false f it is true, explain why; if it is false, give a counterexample
More informationMaths 212: Homework Solutions
Maths 212: Homework Solutions 1. The definition of A ensures that x π for all x A, so π is an upper bound of A. To show it is the least upper bound, suppose x < π and consider two cases. If x < 1, then
More information1. Introduction Boundary estimates for the second derivatives of the solution to the Dirichlet problem for the Monge-Ampere equation
POINTWISE C 2,α ESTIMATES AT THE BOUNDARY FOR THE MONGE-AMPERE EQUATION O. SAVIN Abstract. We prove a localization property of boundary sections for solutions to the Monge-Ampere equation. As a consequence
More informationCOMPLETE METRIC SPACES AND THE CONTRACTION MAPPING THEOREM
COMPLETE METRIC SPACES AND THE CONTRACTION MAPPING THEOREM A metric space (M, d) is a set M with a metric d(x, y), x, y M that has the properties d(x, y) = d(y, x), x, y M d(x, y) d(x, z) + d(z, y), x,
More informationJUHA KINNUNEN. Harmonic Analysis
JUHA KINNUNEN Harmonic Analysis Department of Mathematics and Systems Analysis, Aalto University 27 Contents Calderón-Zygmund decomposition. Dyadic subcubes of a cube.........................2 Dyadic cubes
More information1 + lim. n n+1. f(x) = x + 1, x 1. and we check that f is increasing, instead. Using the quotient rule, we easily find that. 1 (x + 1) 1 x (x + 1) 2 =
Chapter 5 Sequences and series 5. Sequences Definition 5. (Sequence). A sequence is a function which is defined on the set N of natural numbers. Since such a function is uniquely determined by its values
More informationAdditional material: Linear Differential Equations
Chapter 5 Additional material: Linear Differential Equations 5.1 Introduction The material in this chapter is not formally part of the LTCC course. It is included for completeness as it contains proofs
More informationEXPOSITORY NOTES ON DISTRIBUTION THEORY, FALL 2018
EXPOSITORY NOTES ON DISTRIBUTION THEORY, FALL 2018 While these notes are under construction, I expect there will be many typos. The main reference for this is volume 1 of Hörmander, The analysis of liner
More information1. Nonlinear Equations. This lecture note excerpted parts from Michael Heath and Max Gunzburger. f(x) = 0
Numerical Analysis 1 1. Nonlinear Equations This lecture note excerpted parts from Michael Heath and Max Gunzburger. Given function f, we seek value x for which where f : D R n R n is nonlinear. f(x) =
More informationNumerical Analysis: Interpolation Part 1
Numerical Analysis: Interpolation Part 1 Computer Science, Ben-Gurion University (slides based mostly on Prof. Ben-Shahar s notes) 2018/2019, Fall Semester BGU CS Interpolation (ver. 1.00) AY 2018/2019,
More informationEcon Slides from Lecture 1
Econ 205 Sobel Econ 205 - Slides from Lecture 1 Joel Sobel August 23, 2010 Warning I can t start without assuming that something is common knowledge. You can find basic definitions of Sets and Set Operations
More informationChapter 8. P-adic numbers. 8.1 Absolute values
Chapter 8 P-adic numbers Literature: N. Koblitz, p-adic Numbers, p-adic Analysis, and Zeta-Functions, 2nd edition, Graduate Texts in Mathematics 58, Springer Verlag 1984, corrected 2nd printing 1996, Chap.
More informationMetric Spaces and Topology
Chapter 2 Metric Spaces and Topology From an engineering perspective, the most important way to construct a topology on a set is to define the topology in terms of a metric on the set. This approach underlies
More informationDISCRETE METHODS AND EXPONENTIAL DICHOTOMY OF SEMIGROUPS. 1. Introduction
Acta Math. Univ. Comenianae Vol. LXXIII, 2(2004), pp. 97 205 97 DISCRETE METHODS AND EXPONENTIAL DICHOTOMY OF SEMIGROUPS A. L. SASU Abstract. The aim of this paper is to characterize the uniform exponential
More informationGeometric intuition: from Hölder spaces to the Calderón-Zygmund estimate
Geometric intuition: from Hölder spaces to the Calderón-Zygmund estimate A survey of Lihe Wang s paper Michael Snarski December 5, 22 Contents Hölder spaces. Control on functions......................................2
More informationConvex Geometry. Carsten Schütt
Convex Geometry Carsten Schütt November 25, 2006 2 Contents 0.1 Convex sets... 4 0.2 Separation.... 9 0.3 Extreme points..... 15 0.4 Blaschke selection principle... 18 0.5 Polytopes and polyhedra.... 23
More informationProblem set 5, Real Analysis I, Spring, otherwise. (a) Verify that f is integrable. Solution: Compute since f is even, 1 x (log 1/ x ) 2 dx 1
Problem set 5, Real Analysis I, Spring, 25. (5) Consider the function on R defined by f(x) { x (log / x ) 2 if x /2, otherwise. (a) Verify that f is integrable. Solution: Compute since f is even, R f /2
More informationProbability and Measure
Part II Year 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2018 84 Paper 4, Section II 26J Let (X, A) be a measurable space. Let T : X X be a measurable map, and µ a probability
More informationMATH 220 solution to homework 4
MATH 22 solution to homework 4 Problem. Define v(t, x) = u(t, x + bt), then v t (t, x) a(x + u bt) 2 (t, x) =, t >, x R, x2 v(, x) = f(x). It suffices to show that v(t, x) F = max y R f(y). We consider
More informationMATH 411 NOTES (UNDER CONSTRUCTION)
MATH 411 NOTES (NDE CONSTCTION 1. Notes on compact sets. This is similar to ideas you learned in Math 410, except open sets had not yet been defined. Definition 1.1. K n is compact if for every covering
More informationTHEOREMS, ETC., FOR MATH 515
THEOREMS, ETC., FOR MATH 515 Proposition 1 (=comment on page 17). If A is an algebra, then any finite union or finite intersection of sets in A is also in A. Proposition 2 (=Proposition 1.1). For every
More informationGaussian Random Fields: Excursion Probabilities
Gaussian Random Fields: Excursion Probabilities Yimin Xiao Michigan State University Lecture 5 Excursion Probabilities 1 Some classical results on excursion probabilities A large deviation result Upper
More informationLecture 9 Metric spaces. The contraction fixed point theorem. The implicit function theorem. The existence of solutions to differenti. equations.
Lecture 9 Metric spaces. The contraction fixed point theorem. The implicit function theorem. The existence of solutions to differential equations. 1 Metric spaces 2 Completeness and completion. 3 The contraction
More informationPartial Differential Equations
Part II Partial Differential Equations Year 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2015 Paper 4, Section II 29E Partial Differential Equations 72 (a) Show that the Cauchy problem for u(x,
More informationMAT 570 REAL ANALYSIS LECTURE NOTES. Contents. 1. Sets Functions Countability Axiom of choice Equivalence relations 9
MAT 570 REAL ANALYSIS LECTURE NOTES PROFESSOR: JOHN QUIGG SEMESTER: FALL 204 Contents. Sets 2 2. Functions 5 3. Countability 7 4. Axiom of choice 8 5. Equivalence relations 9 6. Real numbers 9 7. Extended
More informationMATH 590: Meshfree Methods
MATH 590: Meshfree Methods Chapter 14: The Power Function and Native Space Error Estimates Greg Fasshauer Department of Applied Mathematics Illinois Institute of Technology Fall 2010 fasshauer@iit.edu
More informationAdvanced Calculus Math 127B, Winter 2005 Solutions: Final. nx2 1 + n 2 x, g n(x) = n2 x
. Define f n, g n : [, ] R by f n (x) = Advanced Calculus Math 27B, Winter 25 Solutions: Final nx2 + n 2 x, g n(x) = n2 x 2 + n 2 x. 2 Show that the sequences (f n ), (g n ) converge pointwise on [, ],
More informationNotes on uniform convergence
Notes on uniform convergence Erik Wahlén erik.wahlen@math.lu.se January 17, 2012 1 Numerical sequences We begin by recalling some properties of numerical sequences. By a numerical sequence we simply mean
More informationMultivariable Calculus
2 Multivariable Calculus 2.1 Limits and Continuity Problem 2.1.1 (Fa94) Let the function f : R n R n satisfy the following two conditions: (i) f (K ) is compact whenever K is a compact subset of R n. (ii)
More information1 Introduction. 2 Measure theoretic definitions
1 Introduction These notes aim to recall some basic definitions needed for dealing with random variables. Sections to 5 follow mostly the presentation given in chapter two of [1]. Measure theoretic definitions
More informationOn the Intrinsic Differentiability Theorem of Gromov-Schoen
On the Intrinsic Differentiability Theorem of Gromov-Schoen Georgios Daskalopoulos Brown University daskal@math.brown.edu Chikako Mese 2 Johns Hopkins University cmese@math.jhu.edu Abstract In this note,
More informationLecture Course. Functional Analysis
MATHEMATISCHES INSTITUT PROF. DR. PETER MÜLLER Summer Term 2013 Lecture Course Functional Analysis Typesetting by Kilian Lieret and Marcel Schaub If you find mistakes, I would appreciate getting a short
More informationMath212a1413 The Lebesgue integral.
Math212a1413 The Lebesgue integral. October 28, 2014 Simple functions. In what follows, (X, F, m) is a space with a σ-field of sets, and m a measure on F. The purpose of today s lecture is to develop the
More informationMathematical Analysis Outline. William G. Faris
Mathematical Analysis Outline William G. Faris January 8, 2007 2 Chapter 1 Metric spaces and continuous maps 1.1 Metric spaces A metric space is a set X together with a real distance function (x, x ) d(x,
More informationTEST CODE: MMA (Objective type) 2015 SYLLABUS
TEST CODE: MMA (Objective type) 2015 SYLLABUS Analytical Reasoning Algebra Arithmetic, geometric and harmonic progression. Continued fractions. Elementary combinatorics: Permutations and combinations,
More informationMATH 722, COMPLEX ANALYSIS, SPRING 2009 PART 5
MATH 722, COMPLEX ANALYSIS, SPRING 2009 PART 5.. The Arzela-Ascoli Theorem.. The Riemann mapping theorem Let X be a metric space, and let F be a family of continuous complex-valued functions on X. We have
More information444/,/,/,A.G.Ramm, On a new notion of regularizer, J.Phys A, 36, (2003),
444/,/,/,A.G.Ramm, On a new notion of regularizer, J.Phys A, 36, (2003), 2191-2195 1 On a new notion of regularizer A.G. Ramm LMA/CNRS, 31 Chemin Joseph Aiguier, Marseille 13402, France and Mathematics
More informationAnalysis Comprehensive Exam Questions Fall F(x) = 1 x. f(t)dt. t 1 2. tf 2 (t)dt. and g(t, x) = 2 t. 2 t
Analysis Comprehensive Exam Questions Fall 2. Let f L 2 (, ) be given. (a) Prove that ( x 2 f(t) dt) 2 x x t f(t) 2 dt. (b) Given part (a), prove that F L 2 (, ) 2 f L 2 (, ), where F(x) = x (a) Using
More informationSolutions Final Exam May. 14, 2014
Solutions Final Exam May. 14, 2014 1. Determine whether the following statements are true or false. Justify your answer (i.e., prove the claim, derive a contradiction or give a counter-example). (a) (10
More informationAnalysis Qualifying Exam
Analysis Qualifying Exam Spring 2017 Problem 1: Let f be differentiable on R. Suppose that there exists M > 0 such that f(k) M for each integer k, and f (x) M for all x R. Show that f is bounded, i.e.,
More information2) Let X be a compact space. Prove that the space C(X) of continuous real-valued functions is a complete metric space.
University of Bergen General Functional Analysis Problems with solutions 6 ) Prove that is unique in any normed space. Solution of ) Let us suppose that there are 2 zeros and 2. Then = + 2 = 2 + = 2. 2)
More informationThe Helmholtz Equation
The Helmholtz Equation Seminar BEM on Wave Scattering Rene Rühr ETH Zürich October 28, 2010 Outline Steklov-Poincare Operator Helmholtz Equation: From the Wave equation to Radiation condition Uniqueness
More informationTraces, extensions and co-normal derivatives for elliptic systems on Lipschitz domains
Traces, extensions and co-normal derivatives for elliptic systems on Lipschitz domains Sergey E. Mikhailov Brunel University West London, Department of Mathematics, Uxbridge, UB8 3PH, UK J. Math. Analysis
More informationThe Dirichlet boundary problems for second order parabolic operators satisfying a Carleson condition
The Dirichlet boundary problems for second order parabolic operators satisfying a Martin Dindos Sukjung Hwang University of Edinburgh Satellite Conference in Harmonic Analysis Chosun University, Gwangju,
More informationSome analysis problems 1. x x 2 +yn2, y > 0. g(y) := lim
Some analysis problems. Let f be a continuous function on R and let for n =,2,..., F n (x) = x (x t) n f(t)dt. Prove that F n is n times differentiable, and prove a simple formula for its n-th derivative.
More informationReal Analysis Notes. Thomas Goller
Real Analysis Notes Thomas Goller September 4, 2011 Contents 1 Abstract Measure Spaces 2 1.1 Basic Definitions........................... 2 1.2 Measurable Functions........................ 2 1.3 Integration..............................
More information