Homogenization of the Schrödinger equation with large, random potential

Μέγεθος: px
Εμφάνιση ξεκινά από τη σελίδα:

Download "Homogenization of the Schrödinger equation with large, random potential"

Transcript

1 Homogenization of the Schrödinger equation with large, random potential Ningyao Zhang Guillaume Bal February 4, Abstract We study the behavior of solutions to a Schrödinger equation with large, rapidly oscillating, mean zero, random potential with Gaussian distribution. We show that in high dimension d > m, where m is the order of the spatial pseudo-differential operator in the Schrödinger equation (with m = for the standard Laplace operator), the solution converges in the L sense uniformly in time over finite intervals to the solution of a deterministic Schrödinger equation as the correlation length ε tends to. This generalizes to long times the convergence results obtained for short times and for the heat equation in []. The result is based on the decomposition of multiple scattering contributions introduced in [6]. In dimension d < m, the random solution converges to the solution of a stochastic partial differential equation; see [, 3]. Introduction There is a long list of derivations of macroscopic models for solutions to equations involving small scale heterogeneities ε. One very successful framework is that of homogenization theory. In the limit ε, it is shown that the heterogeneous solution converges to the deterministic solution of an effective medium equation [5, 9]. There are cases, however, where the solutions in the limit ε remain stochastic, typically in low spatial dimensions; see e.g. [, 7, 8, ]. The results of [, ] apply to parabolic equations of the form of a heat equation with large, mean-zero, highly oscillatory, random potentials (zeroth-order terms). In [], it was shown that for large dimensions, the random solution converged to a deterministic solution, which is consistent with the homogenization framework. However, such results could only be obtained for short times, and it is unclear whether they hold for larger times. In this paper, we revisit the homogenization limit for the (time-dependent) Schrödinger equation. Because the solution operator is unitary in this case, we expect to be able to Department of Applied Physics and Applied Mathematics, Columbia University, New York NY, 7; nz64@columbia.edu Department of Applied Physics and Applied Mathematics, Columbia University, New York NY, 7; gb3@columbia.edu

2 control the long-time asymptotic behavior of the solution. The method of proof, as in [, ], is based on a Duhamel expansion of the random solution in terms involving increasing numbers of scattering events. As the number of terms grows exponentially with the number of scattering events, we need to assume that the potential is Gaussian in order to control such a growth. The summation technique used in [] cannot extend to long time controls. A similar difficulty occurs in the derivation of radiative transfer equations for the energy density of high frequency waves propagating in highly oscillatory media [4, 6, ]. A precise summation of the scattering terms was introduced in [6] to allow for long-time expansions. We adapt this technique to the asymptotic analysis of Schrödinger equations with large potentials. We now present in more detail the model considered in this paper and the main convergence result. Let m. We consider the following Schrödinger equation in dimension d > m: ( i t + ( P (D) ε m/ q(x ε ))) u ε (t, x) =, t >, x R d (.) u ε (, x) = u (x), x R d. Here, P (D) is the pseudo-differential operator with symbol ˆp(ξ) = ξ m. We assume that q(x) is a real valued mean zero stationary Gaussian process defined on a probability space (Ω, F, P), with correlation function R(x) = E{q(y)q(x + y)}, and the non-negative power spectrum ˆR(ξ) is radially symmetric, smooth, and decays fast. For simplicity, we assume ˆR S(R d ). In fact, R d,d < +, where f d,d := x d x d f(x), x := ( + x ) /, (.) is enough. We choose the initial condition u (x) to be smooth such that û (ξ) ξ 6d L (R d ). For any finite time T >, the existence of a weak solution u ε (t, x) L (Ω R d ) uniformly in time t (, T ) and < ε < ε can be proved by using a method based on Duhamel expansion. As ε, we show that the solution u ε (t) to (.) converges strongly in L (Ω R d ) uniformly in t (, T ) to its limit u(t) solution of the following homogenized equation (i + P (D) ρ)u(t, x) =, t >, x Rd t (.3) u(, x) = u (x), x R d, where the potential is given by ρ = The main result of this paper is the following convergence result: R d ˆR(ξ) dξ. (.4) ξ m Theorem.. There exists a solution to (.) u ε (t) uniformly in < ε < ε for t >. Moreover, we have the convergence results for all t (, T ) lim E (u ε u)(t) =. (.5) ε

3 The rest of the paper is organized as follows. Section recasts the solution to (.) as a Duhamel series expansion in the frequency domain. We estimate the L norm of the first n terms by calculating the contributions of graphs in three categories similar to those defined in []. Section 3 estimates the L norm of the error term by first subdividing the time integration into time intervals of smaller sizes, and then using Duhamel formula in each time interval. This method, introduced in [6], significantly improves the error estimates compared to the direct estimates of infinite Duhamel terms and enables the elimination of the restriction to short times. The estimates given in these sections are used in section 4 to characterize the limit of the solution u ε (t, x). Section 5 provides the proofs for the inequalities used for justifying the estimates in the previous sections. The analysis of a parabolic equation of the type of the heat equation (with i t replaced by t ) is performed in [] for d m. Up to a logarithmic correction, we expect the limit of the solution to (.) to be deterministic also for the critical dimension m = d. In [], the random fluctuations about the deterministic limit are also analyzed for the heat equation. We expect a similar behavior to occur for the Schrödinger equation (.) for short times. We do not know the behavior of the random fluctuations for arbitrary times t (, T ). In lower spatial dimension d < m, the limit of the solutions to (.) as ε remains stochastic. This behavior was analyzed for the heat equation in [, ]. The limit of u ε is then shown to be the solution of a stochastic partial differential equation with multiplicative noise (written as a Stratonovich product). The analysis of (.) for d < m is performed in [3]. Note that several results of convergence may be extended to the case of random potential with long range correlations or random potentials that display both temporal and spatial fluctuations [3]. Duhamel expansion We denote by e ith the propagator for the equation (.). The Duhamel expansion then states that for any n u ε (t) = e ith u = where for H := ( ) m, we have defined u n,ε (t) := ( i) n ( )n εm/ t and the error term is given by t ( Ψ n,ε(t) = ( i) n n= n ds k )δ(t k= ε m/ t u n,ε (t) + Ψ n,ε(t), (.) n s k )e is H q( x ε ) q(x ε )eisnh u, (.) k= dse i(t s)h q( x ε )u n,ε(s). (.3) We shall choose n = n (ε) := γ log ε log log ε, (.4) 3

4 for some fixed < γ λ sufficiently small, where λ is defined as λ = { d m m < d m m d > m. (.5) For any subset I N, we define the kernel for the evolution in the Fourier space as t K(t; ξ, I) := ( i) I ( ds k )δ(t s k ) e is kξk m. (.6) k I k I k I Hereafter, we use the notation ξ m = ξ m. In the special case where I = {,, n}, we denote by K(t; ξ, n) := K(t; ξ, {,, n}) and ξ n := ξ In. Denote ξ n,ˆ = ξ I n\{}. Let us introduce ˆq ε (ξ) = ε d m ˆq(εξ), the Fourier transform of ε m q( x ε ). Denote the contribution from the potential term by L(ξ, n) := n ˆq ε (ξ k ξ k ). (.7) k= We may rewrite the n th order wave function as û ε,n (t, ξ ) = K(t; ξ, n)l(ξ, n)û (ξ n )dξ. (.8) n,ˆ We need to introduce the following moments U n ε (t, ξ ) = E{û ε,n }, (.9) which are given by U n ε (t, ξ ) = ( i) n K(t, ξ, n)e{l(ξ, n)}û (ξ n )dξ n,ˆ, (.) and which are given by Uε n,m (t, ξ, ζ ) =( i) n+m U n,m ε (t, ξ, ζ ) = E{û ε,n (t, ξ)û ε,m (t, ζ)}, (.) K(t, ξ, n)k(t, ζ, m)e{l(ξ, n)l(ζ, m)}û (ξ n )û (ζ m )dξ n,ˆ dζ m,ˆ. (.) We need to estimate moments of the Gaussian process ˆq ε. The expectation in Uε n,m vanishes unless there is n N such that n + m = n is even. The moments are thus given as a sum of products of the expectation of pairs of terms ˆq ε (ξ k ξ k+ ), where the sum runs over all possible pairings. We define the pair (ξ k, ξ l ), k < l, as the contribution in the product given by E{ˆq ε (ξ k ξ k )ˆq ε (ξ l ξ l )} = ε d m ˆR(ε(ξk ξ k ))δ(ξ k ξ k + ξ l ξ l ) = ε d m r(ε(ξ k ξ k ))r(ε(ξ l ξ l ))δ(ξ k ξ k + ξ l ξ l ) (.3) 4

5 with r(ξ) := ˆR(ξ) /. Define n F (ξ, n) := r(ε(ξ k ξ k ))û (ξ n ). (.4) k= Denote by π the product of delta functions associated with the pairing π. Our analysis is based on the estimate of Uε n (t, ξ) = I π (.5) π Π(n) with I π := ( i) n K(t, ξ, n) π (ξ)f (ξ, n)dξ, (.6) and with C π := ( i) n+m U n,m ε (t, ξ, ξ)dξ = π Π(n,m) C π (.7) K(t, ξ, n)k(t, ζ, m) π (ξ, ζ)δ(ξ ζ )F (ξ, n)f (ζ, m)dξ n dζ n. (.8) By Lemma 5., K(t; ξ, I) can also be written as K(t; ξ, I) = ie t e iαt k I α + ξ m k + i. (.9) We let = t in this section. Therefore, I π in (.6) and C π in (.8) can be written explicitly as n I π = i n+ e t e iαt r(ε(ξ k ξ k )) α + ξk m + i π(ξ)û (ξ n )dξ, (.) n,ˆ and C π = i n+m e t dβe i(α β)t k= n m n α + ξ m k= k + i β + ζ m r(ε(ξ k ξ k )) l= l + i k= m r(ε(ζ l ζ l ) π (ξ, ζ)û (ξ n )û(ζ m )δ(ξ ζ )dξ n dζ m. l= (.) In order to consider the two sets of momenta in a unified way, we introduce the notation { α k n α k = (.) β n + k n + m +, and define ξ n+k+ = ζ m k for k m. (.) can then be rewritten as C π = i n+m e t n+m+ dβe i(α β)t k= α k + ξ m k + i û (ξ n )û (ξ m )δ(ξ ξ n+m+ )dξ n+m+. 5 n+m+ k=,k n+ r(ε(ξ k ξ k )) (.3)

6 In each instance of the pairings, we have n terms k and n terms l l(k). Note that l(k) k+. The collection of pairs (ξ k, ξ l(k) ) for n values of k and n values of l(k) constitutes a graph π Π(n, m), where Π(n, m) denotes the set of all graphs π with n copies of ˆq and m copies of ˆq. The graphs are defined similarly in the calculation of Uε n (t, ξ ) in (.) for n = n, and we denote by Π(n) the set of graphs with n copies of ˆq. We denote by A = A (π) the collection of the n values of k and by B = B (π) the collection of the n values of l(k). Now we introduce several classes of graphs for C π. We say that the graph has a crossing if there is a k n such that l(k) n +. We denote by Π c (n, m) Π(n, m) the set of graphs with at least one crossing and by Π nc (n, m) = Π(n, m)\π c (n, m) the non-crossing graphs. We denote by simple pairs the pairs such that l(k) = k +, which thus involve a delta function of the form δ(ξ k+ ξ k ). The unique graph with only simple pairs is called the simple graph, which is denoted by Π s (n, m). Π ncs (n, m) = Π nc (n, m)\π s (n, m) denotes the set of non-crossing, non-simple graphs. We also use the notation Π s (n) and Π ncs (n) defined for I π, which denote the simple graph and the set of non-crossing, non-simple graphs, respectively. We shall estimate F (ξ, n) before we proceed to analyze the graphs. For the initial condition, we define Φ(ξ) = ξ 6d û (ξ). (.4) From our assumption on u given in Section, we have Φ(ξ) L (R d ). Since ˆR d,d < +, we have r(ξ) C. (.5) ξ 6d Hence, we obtain the estimate for F (ξ, n) n Φ(ξ n ) F (ξ, n) ε(ξ k ξ k ) 6d ξ n 6d k= n k= Φ(ξ n ) ε(ξ k ξ k ) 6d ξ n d εξ n 4d C n Φ(ξ n ) ξ n d i= εξ li d n k= We have the freedom to choose l and l between and n. Analysis of the crossing graphs Lemma.. If π Π c (n, m), we have ε(ξ k ξ k ) d. (.6) C π (C log ε) n ε λ Φ(ξ). (.7) Proof. Denote by (ξ qm, ξ l(qm)), m M, the crossing pairs and define Q = max m {q m }. Let us define A = A \{Q}. From (.6), we have F (ξ, n)f (ζ, m) Φ(ξ n ) Φ(ξ n+ ) εξ d ξ n d. (.8) ε(ξ k ξ k ) d 6 k A

7 The terms for k / A {, n, n +, n + m + } are bounded by C. This allows α k +ξk m+it us to obtain C π C n dβ α + ξ m + it β + ξ m + it εξ d α k + ξk m + it ε(ξ k ξ k ) d δ(ξ k ξ k + ξ l(k) ξ l(k) ) (.9) k A δ(ξ Q ξ Q + ξ l(q) ξ l(q) ) α + ξn m + it β + ξn m + it Φ(ξ n) dξ n+m. For each k A {}, we perform the change of variables ξ k ξ k ε, and define ξ ε k = { ξk k A {} ξ kε k A {}. (.3) We then find the estimate C π C n dβ α + ξ m/εm + it β + ξ m/εm + it ε m ξ d α k A k + ξk m/εm + it ε m ξ k εξk ε d δ( ξ k ε ξε k + ξ l(k) ξl(k) ε )δ(ξ Q ξ Q + ξ l(q) ξ l(q) ) α + ξn m + it β + ξn m + it ξ n d Φ(ξ n) dξ n+m. (.3) We now estimate the above product. Assume Q < n and n = l(k ). When Q = n or l(q) = n + m +, the derivation of the same estimates is simpler and left to the reader. Define k such that l(k ) = n + m +. For each k A (π)\(k k ), we use (5.5) below to find the estimate ε m ξ k εξ ε k d α k + ξ m k /εm + it δ(ξ k ε εξε k + ξ l(k) ξ ε l(k) )dξ kdξ l(k) C log ε. (.3) The integration in the ξ l(q) variable is estimated by using the above delta function. The delta function for k = k A (π) may be written in the form δ(ξ Q ξ Q + ξ ξ n + M m= ξ q m ξ qm ), and is thus used to integrate in the variable ξ Q. The term ξ k εξk ε d is used to integrate in the variable ξ k. The integral in α and β is estimated using (5.3) by α + ξ m/εm + it α + ξn m + it C ξ m/εm ξn m + it The integral in ξ is estimated using (5.8) by ε m ξ d [ + log + ξ m /εm ξ m n t ]. (.33) [ ] ξ + log m/εm ξn m + t ξ m/εm ξn m + it dξ Cε λ (ξn λ ). (.34) 7

8 Following the usual convention, we use a b := max{a, b} and a b := min{a, b}. The delta function δ(ξ k ξ k ξ n+m+ ξ n+m ) is seen to be equivalent to δ(ξ n ξ n+ ), which handles the integration in the variable ξ n+. Finally we integrate in ξ n ξ n d (ξλ n )Φ(ξ n ) dξ n Φ(ξ), (.35) and obtain C π (C log ε ) n ε λ Φ(ξ). (.36) Using Stirling s formula, we find that Π c (n, m) summation in n, m n, we obtain ( n )! is bounded by ( n ) n. n ( n )! e After n E (û n,ε Uε n )(t) n= n n= ( n ) n (C log ε ) n ε λ Φ(ξ) e n m= n n (C log ε )n ε λ Φ(ξ) ε λ 3γ, (.37) where a b means a Cb for some C >. Analysis of the non-crossing graphs Lemma.. If π Π ncs (n), we have where < δ. Moreover, if π Π ncs (n, m), Proof. In a graph π Π ncs (n), the delta function I π (C log ε) n ε λ( δ) Φ(ξ), (.38) C π (C log ε) n ε λ( δ) Φ(ξ). (.39) δ(ξ ξ n ) (.4) is obtained by adding up all the delta functions in π. We perform the change of variables for all k A, ξ k ξ k ε and define as before ξ ε k = { ξk k / A ξ kε k A. (.4) We shall solve the following two cases in different ways. (i) If there exists k A, such that for all k satisfying k + k l(k ), k A, (ξ k, ξ l(k) ) are simple pairs, then the delta function δ( ξ k ε ξ l(k ) ) is present. From (.6), we have F (ξ, n) C n Φ(ξ n ) ξ k d ξ n d ξ k εξk ε. (.4) d k A 8

9 The estimate of integration in ξ k is then obtained by using (5.8) below: ε m ξ k d α + ξk m /ε m + it dξ k Cε λ( δ) (α λ( δ) m ). (.43) The delta function in which ξ n is involved is equivalent to δ(ξ n ξ ), which we use to integrate in ξ n : ξ n d α + ξn m + it δ(ξ n ξ )dξ n ξ d α + ξ m + it. (.44) For k A, k k, we have the estimate ε m ξ k εξk ε d α + ξk m/εm + it δ(ξ k ε ξε k + ξ l(k) ξl(k) ε )dξ kdξ l(k) C log ε. The estimate of integration in the variable α is then given by (.45) α λ( δ) m α + ξ m + it Cξλ( δ). (.46) The extra term ξ λ( δ) that arises in the last estimate can be canceled by the term / ξ d in (.44), which concludes (.38). (ii) If there exists no such k A satisfying the condition in case (i), then we first delete all simple pairs that exist in the graph π. In fact, the simple pairs can be handled first by using the bound as in (.58). Therefore without loss of generality, we need only to consider a graph π with no simple pair. Let us define k 4 = min{k k A, l(k) A }, and k 5 = l(k 4 ). Note that k 5 k 4 +. We have from (.6) that F (ξ, n) C n Φ(ξ n ) ξ l(k4 ) d ξ k5 d ξ n d ξ k εξk ε. (.47) d k A The integration in ξ l(k4 ) provides the terms which we will need for integration in ξ k5 εξ l(k4 ) d α + ξl(k m 4 ) + it δ(ξ k 4 ε ξε k 4 + ξ l(k 4 ) ξ k 5 ε )dξ l(k 4 ) = ξ k5 ξ k4 + εξk ε 4 d α + ξ k5 ξ k4 + εξk ε 4 m /ε m + it. (.48) We can estimate the integration in ξ k5 using (5.8) ε m ξ k5 d ξ k5 ξ k4 + εξk ε 4 d α + ξk m 5 /ε m + it α + ξ k5 ξ k4 + εξk ε 4 m /ε m + it dξ k 5 Cε λ( δ) (α λ( δ) m ). (.49) 9

10 All the other integrations are handled the same way as in case (i). In order to make sure that no integration above is affected by other integrands we plan to use for integrating in other variables, we just need to first integrate in ξ l(k) with index in decreasing order and then integrate in ξ k with index in decreasing order. This gives (.38). If π Π ncs (n, m), we may denote the pairings for k n and for n + k n + m + by π and π and then π = π π, since there is no crossing in π. Hence it follows that C π I π (ξ)i π (ξ) dξ (C log ε) n ε λ( δ) Φ(ξ). (.5) where Similarly to (.37), we obtain (Uε n Uε,s)(t) n n n= n n= ( n ) n (C log ε ) n ε λ( δ) Φ(ξ) e n m= n n (C log ε )n ε λ( δ) Φ(ξ) ε λ( δ) 3γ, (.5) U n ε,s := I π (.5) for π Π s (n). Collecting the results obtained in (.37) and (.5), we have shown that (û ε,n Uε,s)(t) n ε λ( δ) 3γ. (.53) n E n= Analysis of the simple Graphs Lemma.3. If π Π s (n), we have Moreover, if π Π s (n, m), we have C n I π ( (n/)! + O(Cn ε m/ )) û (ξ). (.54) C n+m C π ( (n/)!(m/)! + O(Cn+m ε m/ )) û (ξ). (.55) Proof. In the case of a simple graph π, we can explicitly write out the product of delta functions π = k A δ(ξ k ξ k+ ), (.56) which is independent of ξ k for all k A, and forces ξ k = ξ for all k / A. Integrating in ξ k for all k B using delta functions, we obtain I π = K(t, ξ,, ξ, ξ ka,, ξ kan/ ) ε d m ˆR(ε(ξk ξ ))û (ξ )dξ A, (.57) k A

11 where {k a,, k an/ } = A. This implies I π ε d m ˆR(ε(ξk ξ )) α + ξ m + i n/+ α + ξk m + i dξ k û (ξ ). (.58) k A Define Θ α, (ξ ) = ε d m ˆR(ε(ξk ξ )) α + ξ m k + i dξ k. (.59) Perform the change of variable ξ k ξ k ε. This gives It is clear from Lemma 5.8 that Thus (.58) already implies Θ α, (ξ ) = ˆR(ξ k εξ ) ε m α + ξ m k + iεm dξ k. (.6) Θ α, (ξ ) C. (.6) I π C n û (ξ). (.6) However, this estimate is not sufficient and there is in fact a term /(n/)! missing. We now recover this factor. Introduce the notation From the estimate in (5.36), we have Θ(ξ) = lim Θ ξ m,(ξ). (.63) Θ α, (ξ ) Θ(ξ k ) ε m/ ( α + ξ m / + / ). (.64) We shall show that the leading term of I π is In fact, the error term is bounded by α + ξ m K(t, ξ,, ξ )Θ(ξ ) n/ û (ξ ). (.65) + i n/+ Θn/ α, (ξ ) Θ n/ (ξ ) û (ξ ). (.66) Using the uniform bound on Θ in (.6) and the estimate in (.64), we can bound (.66) by O(ε m/ C n û (ξ ) ). We can now use Lemma 5. to bound (.65) by C n (n/)! û (ξ ). (.67) Finally, we obtain (.55) as an immediate consequence of (.54). This concludes Lemma.3.

12 3 Partial Time Integration In this section, we estimate the L norm of Ψ n,ε. The central idea is to subdivide the time integration into smaller time intervals of size t/κ(ε) with κ(ε) := log ε /γ. (3.) We then use the Duhamel formula to estimate the evolution in each time interval. Recall the error term Ψ n,ε = + n=n u n,ε. The Duhamel formula states that Ψ n,ε(t) = ( i) ε m/ t where e ith denotes the propagator of equation (.). Let θ j = jt/κ for j =,,, κ. Rewrite Ψ n,ε(t) = ( i) κ θj+ ε m/ e i(t θ j+)h j= dse i(t s)h q( x ε )u n,ε(s), (3.) θ j e i(θ j+ s)h q( x ε )u n,ε(s)ds. (3.3) Define the n-th term of the Duhamel expansion for the operator e i(θ j+ s)h in (3.3) as u n,n,θ j =( i) n n + ( θj+ t ε m/ )n n + θ j t e is H q( x ε ) q(x ε )eis n n +H u n,ε(s)ds. ( n n k= n n ds k )δ(θ j+ s k= s k ) (3.4) We may further obtain the form of u n,n,θ j in terms of u by writing u n,ε(s) out explicitly using (.) u n,n,θ j =( i) n ( )n εm/ θj+ t θ j k= n n δ(θ j+ s s k )δ(s t ( n ds k ) k= n k=n n + The amputated versions of these functions are defined as Then Duhamel formula then gives s k )e is H q( x ε ) q(x ε )eisnh u ds. (3.5) ũ 4n,n,θ j (x) = ε m/ q(x ε )u 4n,n,θ j (x). (3.6) Ψ n,ε = U + U, (3.7) where U (t) = κ U (t) = ( i) j= κ e i(t θj+)h u n,n,θ j (θ j+ ), n n<4n j= θj+ e i(t θ j+)h θ j ũ 4n,n,θ j (s)ds. (3.8)

13 From the unitarity of e i(t θ j+)h and the triangle inequality, we can bound U by U Cn κ n n<4n j= κ u n,n,θ j (θ j+ ) Cn κ Applying the Cauchy-Schwarz inequality, we can bound U by Denote κ U t j= θj+ θ j ũ 4n,n,θ j (s) ds t sup j sup θ j s θj+ sup u n,n,θ j. (3.9) n n<4n ũ 4n,n,θ j (s). (3.) I n n +,n := {n n +,, n}. (3.) Define the free evolution operator with constraint given by the parameters n and θ as K # (θ j+, θ j ; ξ, n, n ) := θj+ θ j K(θ j+ s; ξ, n n )K(s, ξ, I n n +,n)ds. (3.) We can write the wave function in Fourier space û n,n,θ j as û n,n,θ j (θ j+, ξ ) = K # (θ j+, θ j ; ξ, n, n )L(ξ, n)û (ξ n )dξ. (3.3) n,ˆ We then write where C π # := E u n,n,θ j (θ j+ ) = C π #, (3.4) π Π(n,n) dξdζk # (θ j+, θ j ; ξ, n, n )K # (θ j+, θ j ; ζ, n, n ) π F (ξ, n)f (ζ, n). (3.5) For the amputated function, we have E ũ n,n,θ j (θ j+ ) = C π #, (3.6) π Π(n,n) C π # := dξdζ K # (θ j+, θ j ; ξ, n, n ) K # (θ j+, θ j ; ζ, n, n ) π F (ξ, n)f (ζ, n), (3.7) where K # (θ j+, θ j ; ξ, n, n ) := θj+ θ j K(θ j+ s; ξ, I,n n )K(s, ξ, I n n +,n)ds. (3.8) Recall Lemma 5.3. We can extend it to the following identity for K # (θ j+, θ j ; ξ, n, n ): θj+ K # (θ j+, θ j ; ξ, n, n ) = dse (θj+ s) e s θ j n n α + ξk m + i k= + k I n n +,n d αe iα(θ j+ s) e i αs α + ξ m k + i, (3.9) 3

14 where we choose := (t/κ), := t. We can integrate in s to have K # (θ j+, θ j ; ξ, n, n ) =i + n n k= d α e iθ j+ α+θ j+ e iα(θ j+ θ j ) iθ j α+(θ j+ θ j )+θ j α α + i( ) α + ξ m k + i k I n n +,n α + ξ m k + i. (3.) Hence we can bound C π # by C π # dξ + k n+ d αdβd β α α + i( ) β β + i( ) α k + ξ m k + i k n+ k=,k n+ where α k and k are defined as α if k n n α if n n + k n α k := β if n + k n + n β if k n + n + if k n n if n n k := + k n if n + k n + n if k n + n +. r(ε(ξ k ξ k )), (3.) (3.) (3.3) We present the following lemmas to show lim ε E Ψ n,ε. Lemma 3.. Let n = 4n. For any π Π(n, n) we have C π # (C log ε )4n κ n. (3.4) Proof. The following bound can be easily obtained by using Lemma C # π (C log ε ) 4n. (3.5) To recover the denominator in (3.4), notice that among the k for k B, there are at least n n ( n ) of them with k = κ/t. Hence α k + ξk m + i k ( ) t n k t n tn κ κ n. (3.6) k B k B 4

15 Lemma 3.. If π Π c (n, n), then we have C # π (C log ε) n ε λ Φ(ξ). (3.7) Proof. The proof of Lemma 3. is essentially the same as in Lemma.. The only difference is that the integral in α and α (β and β) is estimated using Proposition 5.3 by α α + i( ) α + ξn m + i C α + ξ m/εm + i d α and the integral in ξ is estimated using Proposition 5.6 ε m ξ d ] ξn [ + log m ξm /εm + ξn m ξ m, /εm + i (3.8) [ ] ξ + log m/εm ξn m 4 + ξ m/εm ξn m + i dξ Cε λ (ξn λ ). (3.9) Lemma 3.3. If π Π ncs (n, n), then we have C # π (C log ε) n ε λ( δ) Φ(ξ). (3.3) Proof. The proof of Lemma 3.3 is similar to that of Lemma.. The only difference is that the integral in α and α (β and β) is estimated by (α λ( δ) m ) α α + i( ) α + ξ m + i α + ξ m + i d α [ C (α λ( δ) α + ξ m ] (3.3) m ) α + ξ m + log + i + Cξ λ( δ). Lemma 3.4. If π Π s (n, n), then we have C # π Cn (n!) / û (ξ). (3.3) Proof. The proof is essentially the same as in Lemma.3. We shall not repeat the argument here. We now apply the above lemmas to estimate Ψ n,ε. From Lemma 3., 3.3, and 3.4 we have From Lemma 3. we have U n κ [(C log ε) 4n ε λ ]( 8n e )4n + Cn n κ. (3.33) (n!) / U (C log ε )4n κ n ( 8n e )4n. (3.34) 5

16 The L estimate of Ψ n,ε is therefore given by E û ε,n (t) = E Ψ n,ε (E U + E U ) (3.35) n as ε. 4 Homogenization We come back to the analysis of U ε,s (t, ξ). We find that U ε,s is the solution to the following equation t t s U ε,s = e itξm û (ξ) e isξm e is ξ m ε d m ˆR(ε(ξ ξ))u ε,s (t s s, ξ)dξ dsds := e itξm û (ξ) + A ε U ε,s (t, ξ). (4.) Lemma 4.. Let us define U ɛ (t, ξ) to be the solution to (i t + ξm ρ ɛ (ξ))u ɛ (t, ξ) = U ɛ (, ξ) = û (ξ), (4.) with ρ ɛ = R d ˆR(ξ ɛξ) ξ m dξ. We have the convergence results (U ε,s U ε )(t) max{ε m, ε d m log ε }. (4.3) Proof. () We obtain from Duhamel s principle that t U ε (t, ξ) = e itξm û (ξ) i e iξm v ˆR(ξ εξ) dξ U ε (t v, ξ)dv := e itξm û (ξ) + B ε U ε (t, ξ) R d := e itξm û (ξ) + A ε U ε (t, ξ) + E ε U ε (t, ξ), where the operator A ε is defined in (4.) and may be recast as t v A ε U ε = e iξm ε v m e is (ξ m εm ξ m) ds ˆR(ξ εξ)dξ U ε (t v, ξ)dv R d t = e iξm v R d i(ξ m εm ξ m ) (ei v ε m (ξ m εm ξ m) ) ˆR(ξ εξ)dξ U ε (t v, ξ)dv, and the remainder E ε is then given by t E ε U ε = i ξ m εm ξ m ei v ε m ξ m ˆR(ξ εξ)dξ U ε (t v, ξ)dv + i R d t := I + I. Rd ε m ξ m ξ m(ξm εm ξ m ) (eiξmv e i ξ m ε m v ) ˆR(ξ εξ)dξ U ε (t v, ε)dv ξ m (4.4) (4.5) (4.6) 6

17 For the calculation of I, note that equation (4.) has the explicit solution: U(t, ξ) = e it(ξm ρ ε(ξ))û (ξ). (4.7) On one hand, we may obtain the following expression of integral in v using the method of separation of variables: t e i v ε m ε m (ξ m εm ξ m) U ε (t v, ξ)dv = ξ m εm ξ m ε m t U ε (t v, ξ)d(e i v ε m (ξ m εm ξ m) ) = ξ m εm ξ m [ei t ε m (ξ m εm ξ m)û (ξ) e i(t v)(ξm ρ ε(ξ))û (ξ) + i t e i v ε m (ξ m εm ξ m) e i(t v)(ξm ρ ε(ε))û (ξ)dv]. (4.8) On the other hand, we have the following simple estimate of this integral: t e i v ε m (ξ m εm ξ m) t U ε (t v, ξ)dv e i v ε m (ξ m εm ξ m) U ε (t v, ξ) dv C û (ξ). (4.9) This gives that t e i v ε m (ξ m εm ξ m) U ε (t v, ξ)dv Cεm ( ξ m εm ξ m ε m ) max{ û (ξ), ξ m û (ξ) }. (4.) We therefore find the estimate of I using Lemma 5.9: I Cε R m ( d ξ m εm ξ m ε m ) max{ û (ξ), ξ m û (ξ) } ˆR(ξ εξ)dξ C max{, ξ m } max{ε m, ε d m log ε (ξ m + ) d m, ε d m (ξ m + ) d m } û (ξ). (4.) For the calculation of I, we first estimate the integral in v: ε m t e iξmv e i ξm ε m v ξ m εm ξ m U ε(t v, ξ)dv C( ξ m εm ξ m ε m ) max{ û (ξ), ξ m û (ξ) }. (4.) Hence I C Rd ξ m ξ m ( ξ m εm ξ m ε m ) ˆR(ξ εξ) max{ û (ξ), ξ m û (ξ) }dξ C max{, ξ m } max{ε m, ε d m log ε (ξ m + ) d m, ε d m (ξ m + ) d m } ξ m û (ξ). (4.3) Note that A ε U(t, ξ) C t U(s, ξ) ds, (4.4) over a bounded interval in time. The equation (I A ε )U(t, ξ) = S(t, ξ) (4.5) 7

18 therefore admits a unique solution by Gronwall s Lemma, which is bounded by U(t, ξ) S e Ct. (4.6) We verify that the solution to (I B ε )U ε = e itξm û (ξ), (4.7) is given by U ε (t, ξ) = e it(ξm ρ ε(ξ))û (ξ). (4.8) The error V ε (t, ξ) = (U ε,s (t, ξ) U ε (t, ξ)) is a solution to (I A ε )V ε = E ε U ε (t, ξ), (4.9) so that over bounded intervals in time, we find that U ε,s (t, ξ) U ε (t, ξ) = V ε (t, ξ) max{ε m, ε d m log ε }. (4.) From our assumption that ˆR(ξ) C (R d ), we find that e it(ξm ρ ε(ξ)) e it(ξm ρ) t ρ ε (ξ) ρ) Cε ξ. (4.) The reason for the second-order accuracy is that ˆR( ξ) = ˆR(ξ) and ˆR() = so that first-order terms in the Taylor expansion vanish. In terms of the solutions of PDE we defined in (.3), we may recast the above result as (U ε,s U)(t) max{ε, ε m, ε d m log ε } U(t, ξ) = e i(ξ ρ)tû (ξ), (4.) We now prove Theorem.. By the triangle inequality, we have the estimate E û ε (t, ξ) U(t, ξ) n (ε) E n= (u ε,n U n ε,s)(t) + E + n (ε) û ε,n (t) + (U ε,s U)(t) + + n (ε) U n ε,s(t). (4.3) The vanishing of the first three terms on right hand side of this inequality when ε goes to zero follows from (.53), (3.35) and (4.) respectively. The fourth term also vanishes because of the L convergence of U ε,s. 5 Inequalities and Proofs In this section, we present and prove several inequalities used in earlier sections. There are similar versions of Lemma 5. and 5.7 in [6]. The proofs are given below for the convenience of the reader. The proofs of similar versions of Lemma 5. and 5.8 can be found in [6]. 8

19 Lemma 5.. We have the following identity for > : K(t, ξ, I) = ie t e iαt α + ξ m k I k + i. (5.) We also claim the following estimate with n := I : K(t, ξ, I) tn n!. (5.) Lemma 5.. Assume >. We have the following inequality: [ ] α + A + i α + B + i C A B + log A B + i +, (5.3) where log + x := max{, log x} for x > and log + :=. Proof. Without loss of generality, we assume B > A. (, A+B ) as follows: We split the integration over = + A+B A+B B B (B A) α + A + i α + B + i α + A + i α + B + i + B α + A + i α + B + i. B (B A) α + A + i α + B + i (5.4) The first term is estimated as A+B B α + A + i α + B + i A+B + A + i A B + i [ C A B + i B A A+B B α + + log + A B α + B + i ]. (5.5) Likewise, the second term is estimated as B B (B A) α + A + i α + B + i B A B + i A B + i [ C A B + i B (B A) B A α + + log + A B α + B + i ]. (5.6) 9

20 We obtain the bound for the third term by using the inequality α + A + i α + B + i on (, B (B A)). B (B A) If B A, we have in which case B (B A) If B A <, we have + B A α + α + A + i α + B + i + B A = + α + B A α B (B A) + B A α + A + i α + B + i B A + α + + B A α +. α + B + i (5.7) B A, (5.8) A B + i. (5.9) α + π 4 + ( B A ), (5.) in which case B (B A) α + A + i α + B + i (π/4 + ) (π 4 + ) A B + i. (5.) By symmetry, the integration over (, A+B ) admits an identical bound. Proposition 5.3. Assume, >, >, and bounded. We have the following inequality: [ ] A B C + log + α α + i( ) α + A + i α + B + i d α. (5.) A B + i Proof. Without loss of generality, we assume B > A. We first integrate in α by using Lemma 5.: α α + i( ) α + A + i d α α + A + i [ + log + α + A ]. (5.3) The integration over (, A+B ) is split as in (5.4) into three pieces: ( B, A+B ), ( B (B A), B) and (, B (B A)). α+a A B The term + log + is bounded by + log + on the interval ( B, A+B ). The integral over ( B, A+B ) is then bounded by A+B α+a + log + [ α + A + i α + B + i C A B + log A B + i + ]. (5.4) B

21 The same bound holds for the integral over ( B (B A), B). It remains to estimate the integral over (, B (B A)). The domain of integration α+a can be divided into two parts. On the set α + A <, we have log + =, so that applying Lemma 5. immediately gives the desired result. On the set α + A, we use the simple bound on this interval + log + α + A α + A + i /. (5.5) It then follows that B (B A) α+a + log + α + A + i α + B + i C = C B (B A) + B A (α + ) 3/. α + B + i 3/ (5.6) After performing an analysis similar to that from (5.8) to (5.) we find the estimate: B (B A) α+a + log + [ ] α + A + i α + B + i C A B + log A B + i +, (5.7) which concludes the proof. Lemma 5.4. Assume > and is bounded. We have the following inequality: ε m ξ d ε m α + ξ m + iε m dξ Cελ (α λ m ). (5.8) Proof. The domain of integration may be split into two parts. On the set ε m α + ξ m, the integral is bounded by ε m / ξ d. On the set ε m α + ξ m <, we change to polar coordinates ε m ε m α+ξ m < ξ d ɛ m α + ξ m + iε m dξ C ε m ξ d ε m α+ξ m < ξ d ɛ m α + ξ m + iε m d ξ. (5.9) When m < d < m, we use the inequality / ξ d and change variables to Q = ε m α+ξ m ε m ε m α+ξ m < ξ d ɛ m α + ξ m + iε m d ξ = ε m (Q εm α) d m Q + iε m dq. (5.) On the set [, ε m ], we bound Q + iε m from below by its imaginary part and estimate the integral ε m ε m (Q εm α) d m ε m ε m dq ε m Q d m + (ε m α) d m ε m dq Cε d m (α ) d m. (5.)

22 On the set [ε m, ], we bound Q+iε m from below by its real part and estimate the integral ε m ε m (Q εm α) d m ε m Q dq ε m Q d m + (ε m α) d m Q dq Cε d m (α ) d m. (5.) This concludes the proof for m < d < m. When d m, we use the inequality ξ d m / ξ d instead of / ξ d and the rest of the proof is similar. Proposition 5.5. Assume > and is bounded. We have the following inequality: ε m ξ d ε m α + ξ m + iε m dξ Cελ( δ) (α λ( δ) m ). (5.3) Proof. To prove (5.3), we just need to use / ξ d to bound an additional ξ (d m)δ and the rest of the proof is the same as in Lemma 5.4. As a result, we lose a contribution ε (d m)δ for lowering the order of α by βδ m. Proposition 5.6. Assume >, bounded, and k N. We have the following inequality: ] [ ε m α+ξ + log m /ε m k + ξ d ε m α + ξ m + iε m dξ Cελ (α ) λ m. (5.4) Proof. The integral on the set Lemma 5.4. The integral on the set α+ξm /ε m α+ξm /ε m < is immediately bounded by Cε λ α λ m is bounded by Cε m / ξ d. using Lemma 5.7. Assume >. We have the following inequalities: log sup ω α + ξ m + i ξ ω d dξ C ξ d α, (5.5) where the α in the denominator again has to be dropped if we remove the factor ξ d. Proof. We will first show that sup ω α + ξ m dξ C log. (5.6) + i ξ ω d If, the integral is bounded by α + ξ m + i ξ ω d dξ ξ ω d dξ C C log. (5.7) Therefore, we only need to look at the case for <. The integral over α + ξ m is bounded by α + ξ m dξ C d ξ C C log. (5.8) + i ξ ω d ξ ω d α+ξ m

23 The integral over α+ξ m < can be estimated by splitting the integration domain according to the size k ξ ω k + for k =,, α+ξ m < α + ξ m dξ + i ξ ω d + = α + ξ m dξ + i ξ ω d (5.9) = k= + k= { α+ξ m <} {k ξ ω k+} α+ξ m < d ξ α + ξ m + i k ξ ω k+ J( ξ, θ,, θ d ) ξ ω d dθ dθ d, where J( ξ, θ,, θ d ) denotes the Jacobian to change to polar coordinates. For fixed ξ, we have the inequality k ξ ω k+ J( ξ, θ,, θ d ) ξ ω d dθ dθ d Summing up the terms over k =,, gives α + ξ m dξ C + i ξ ω d α+ξ m < { k ξ ω k+ J( ξ, θ,, θ d ) ( + k ) d dθ dθ d C (k+)d ξ m, (+k ) d ξ C ξ m, (+k ) d ξ <. α+ξ m < (5.3) ξ m d ξ α + ξ m C log. (5.3) + i We now prove (5.5). Without loss of generality, we may assume α. The integral over the domain α + ξ m α/ is easily bounded by C α + ξ m + i ξ ω d dξ ξ d α ξ ω d ξ α+ξ m α C α α+ξ m α C log. α d dξ (5.3) On the domain α + ξ m α /, we have ξ m α /. Note also that ξ d ξ m. The integral over this domain is therefore bounded by C α + ξ m + i ξ ω d dξ ξ d α α + ξ m dξ + i ξ ω d α+ξ m α C log. α α+ξ m α (5.33) Lemma 5.8. Let ˆR(ξ y) (Y z ˆR)(ξ) := dξ (5.34) z ξm 3

24 be a family of linear operators parametrized by a complex parameter z = α + i with >. (i) For d 3 we have Y z ˆR C ˆR d,d. (5.35) (ii) If z = α + i and, then for d 3 Y z ˆR Yz ˆR C z z ( m ) ˆR d,d. (5.36) Lemma 5.9. Let ˆR satisfy the smoothness condition defined in Section. We have the following inequality: ε m ( ξ m εm ξ m ε m ) ˆR(ξ εξ) dξ C max{ε m, ε d m log ε (ξ m +) d m, ε d m (ξ m +) d m }. ξ m (5.37) Proof. We decompose the integral into three integrals on {ξ m εm ξ m + }, {ε m (ξ m + ) ξ m εm ξ m + } and { ξ m εm (ξ m + )}. Clearly, the first integral in bounded by ε m ˆR(ξ εξ) ξ dξ m. For the second integral, note that ˆR is bounded, and use ξ m εm ξ to m bound the term in the bracket on the left hand side of (5.37). We then change variable to polar coordinates and let Q = ξ m to obtain ε m {ε m (ξ m +) ξ m εm ξ m +} ( ξ m εm ξ m ε m ) ˆR(ξ εξ) ε m dξ Cε m ξ m + ξ m ε m (ξ m +) Q d m Q ε m ξ m dq Cε d m log ε (ξ m + ) d m. (5.38) For the third part, we use /ε m to bound the term in the bracket on the left hand side of (5.37) and apply the same type of change of variable to obtain ε m ( { ξ m εm (ξ m +)} ξ m εm ξ m t ε m ) ˆR(ξ εξ) ε m (ξ m +) ξ m dξ t Q d m dq (5.39) Cε d m (ξ m + ) d m. Acknowledgment The authors would like to thank László Erdős for useful discussions during the preparation of the manuscript. This work was funded in part by the National Science Foundation under Grant DMS-868 and the Air Force Office of Scientific Research under Grant NSSEFF- FA References [] G. Bal, Convergence to SPDEs in Stratonovich form, Comm. Math. Phys., () (9), pp

25 [], Homogenization with large spatial random potential, Multiscale Model. Simul., 8(4) (), pp [3], Convergence to homogenized or stochastic partial differential equations, Appl Math Res Express, () (), pp [4] G. Bal, T. Komorowski, and L. Ryzhik, Kinetic limits for waves in random media, Kinetic Related Models, 3(4) (), pp [5] A. Bensoussan, J.-L. Lions, and G. C. Papanicolaou, Asymptotic analysis for periodic structures, in Studies in Mathematics and its Applications, 5, North-Holland Publishing Co., Amsterdam-New York, 978. [6] L. Erdös and H. T. Yau, Linear Boltzmann equation as the weak coupling limit of a random Schrödinger Equation, Comm. Pure Appl. Math., 53(6) (), pp [7] J.-P. Fouque, J. Garnier, G. Papanicolaou, and K. Sølna, Wave Propagation and Time Reversal in Randomly Layered Media, Springer Verlag, New York, 7. [8] M. Hairer, Rough stochastic PDEs, Comm. Pure Appl. Math., 64() (), pp [9] V. V. Jikov, S. M. Kozlov, and O. A. Oleinik, Homogenization of differential operators and integral functionals, Springer-Verlag, New York, 994. [] T. Komorowski and E. Nieznaj, On the asymptotic behavior of solutions of the heat equation with a random, long-range correlated potential, Potential Analysis, 33() (), pp [] E. Pardoux and A. Piatnitski, Homogenization of a singular random one dimensional PDE, GAKUTO Internat. Ser. Math. Sci. Appl., 4 (6), pp [] H. Spohn, Derivation of the transport equation for electrons moving through random impurities, J. Stat. Phys., 7 (977(6)), pp [3] N. Zhang and G. Bal, In preparation. 5

2 Composition. Invertible Mappings

2 Composition. Invertible Mappings Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan Composition. Invertible Mappings In this section we discuss two procedures for creating new mappings from old ones, namely,

Διαβάστε περισσότερα

Uniform Convergence of Fourier Series Michael Taylor

Uniform Convergence of Fourier Series Michael Taylor Uniform Convergence of Fourier Series Michael Taylor Given f L 1 T 1 ), we consider the partial sums of the Fourier series of f: N 1) S N fθ) = ˆfk)e ikθ. k= N A calculation gives the Dirichlet formula

Διαβάστε περισσότερα

Math221: HW# 1 solutions

Math221: HW# 1 solutions Math: HW# solutions Andy Royston October, 5 7.5.7, 3 rd Ed. We have a n = b n = a = fxdx = xdx =, x cos nxdx = x sin nx n sin nxdx n = cos nx n = n n, x sin nxdx = x cos nx n + cos nxdx n cos n = + sin

Διαβάστε περισσότερα

ST5224: Advanced Statistical Theory II

ST5224: Advanced Statistical Theory II ST5224: Advanced Statistical Theory II 2014/2015: Semester II Tutorial 7 1. Let X be a sample from a population P and consider testing hypotheses H 0 : P = P 0 versus H 1 : P = P 1, where P j is a known

Διαβάστε περισσότερα

Example Sheet 3 Solutions

Example Sheet 3 Solutions Example Sheet 3 Solutions. i Regular Sturm-Liouville. ii Singular Sturm-Liouville mixed boundary conditions. iii Not Sturm-Liouville ODE is not in Sturm-Liouville form. iv Regular Sturm-Liouville note

Διαβάστε περισσότερα

EE512: Error Control Coding

EE512: Error Control Coding EE512: Error Control Coding Solution for Assignment on Finite Fields February 16, 2007 1. (a) Addition and Multiplication tables for GF (5) and GF (7) are shown in Tables 1 and 2. + 0 1 2 3 4 0 0 1 2 3

Διαβάστε περισσότερα

4.6 Autoregressive Moving Average Model ARMA(1,1)

4.6 Autoregressive Moving Average Model ARMA(1,1) 84 CHAPTER 4. STATIONARY TS MODELS 4.6 Autoregressive Moving Average Model ARMA(,) This section is an introduction to a wide class of models ARMA(p,q) which we will consider in more detail later in this

Διαβάστε περισσότερα

Srednicki Chapter 55

Srednicki Chapter 55 Srednicki Chapter 55 QFT Problems & Solutions A. George August 3, 03 Srednicki 55.. Use equations 55.3-55.0 and A i, A j ] = Π i, Π j ] = 0 (at equal times) to verify equations 55.-55.3. This is our third

Διαβάστε περισσότερα

Solutions to Exercise Sheet 5

Solutions to Exercise Sheet 5 Solutions to Eercise Sheet 5 jacques@ucsd.edu. Let X and Y be random variables with joint pdf f(, y) = 3y( + y) where and y. Determine each of the following probabilities. Solutions. a. P (X ). b. P (X

Διαβάστε περισσότερα

Homework 3 Solutions

Homework 3 Solutions Homework 3 Solutions Igor Yanovsky (Math 151A TA) Problem 1: Compute the absolute error and relative error in approximations of p by p. (Use calculator!) a) p π, p 22/7; b) p π, p 3.141. Solution: For

Διαβάστε περισσότερα

Concrete Mathematics Exercises from 30 September 2016

Concrete Mathematics Exercises from 30 September 2016 Concrete Mathematics Exercises from 30 September 2016 Silvio Capobianco Exercise 1.7 Let H(n) = J(n + 1) J(n). Equation (1.8) tells us that H(2n) = 2, and H(2n+1) = J(2n+2) J(2n+1) = (2J(n+1) 1) (2J(n)+1)

Διαβάστε περισσότερα

Section 8.3 Trigonometric Equations

Section 8.3 Trigonometric Equations 99 Section 8. Trigonometric Equations Objective 1: Solve Equations Involving One Trigonometric Function. In this section and the next, we will exple how to solving equations involving trigonometric functions.

Διαβάστε περισσότερα

CHAPTER 25 SOLVING EQUATIONS BY ITERATIVE METHODS

CHAPTER 25 SOLVING EQUATIONS BY ITERATIVE METHODS CHAPTER 5 SOLVING EQUATIONS BY ITERATIVE METHODS EXERCISE 104 Page 8 1. Find the positive root of the equation x + 3x 5 = 0, correct to 3 significant figures, using the method of bisection. Let f(x) =

Διαβάστε περισσότερα

Every set of first-order formulas is equivalent to an independent set

Every set of first-order formulas is equivalent to an independent set Every set of first-order formulas is equivalent to an independent set May 6, 2008 Abstract A set of first-order formulas, whatever the cardinality of the set of symbols, is equivalent to an independent

Διαβάστε περισσότερα

Ordinal Arithmetic: Addition, Multiplication, Exponentiation and Limit

Ordinal Arithmetic: Addition, Multiplication, Exponentiation and Limit Ordinal Arithmetic: Addition, Multiplication, Exponentiation and Limit Ting Zhang Stanford May 11, 2001 Stanford, 5/11/2001 1 Outline Ordinal Classification Ordinal Addition Ordinal Multiplication Ordinal

Διαβάστε περισσότερα

HOMEWORK 4 = G. In order to plot the stress versus the stretch we define a normalized stretch:

HOMEWORK 4 = G. In order to plot the stress versus the stretch we define a normalized stretch: HOMEWORK 4 Problem a For the fast loading case, we want to derive the relationship between P zz and λ z. We know that the nominal stress is expressed as: P zz = ψ λ z where λ z = λ λ z. Therefore, applying

Διαβάστε περισσότερα

Problem Set 3: Solutions

Problem Set 3: Solutions CMPSCI 69GG Applied Information Theory Fall 006 Problem Set 3: Solutions. [Cover and Thomas 7.] a Define the following notation, C I p xx; Y max X; Y C I p xx; Ỹ max I X; Ỹ We would like to show that C

Διαβάστε περισσότερα

6.3 Forecasting ARMA processes

6.3 Forecasting ARMA processes 122 CHAPTER 6. ARMA MODELS 6.3 Forecasting ARMA processes The purpose of forecasting is to predict future values of a TS based on the data collected to the present. In this section we will discuss a linear

Διαβάστε περισσότερα

C.S. 430 Assignment 6, Sample Solutions

C.S. 430 Assignment 6, Sample Solutions C.S. 430 Assignment 6, Sample Solutions Paul Liu November 15, 2007 Note that these are sample solutions only; in many cases there were many acceptable answers. 1 Reynolds Problem 10.1 1.1 Normal-order

Διαβάστε περισσότερα

derivation of the Laplacian from rectangular to spherical coordinates

derivation of the Laplacian from rectangular to spherical coordinates derivation of the Laplacian from rectangular to spherical coordinates swapnizzle 03-03- :5:43 We begin by recognizing the familiar conversion from rectangular to spherical coordinates (note that φ is used

Διαβάστε περισσότερα

Other Test Constructions: Likelihood Ratio & Bayes Tests

Other Test Constructions: Likelihood Ratio & Bayes Tests Other Test Constructions: Likelihood Ratio & Bayes Tests Side-Note: So far we have seen a few approaches for creating tests such as Neyman-Pearson Lemma ( most powerful tests of H 0 : θ = θ 0 vs H 1 :

Διαβάστε περισσότερα

forms This gives Remark 1. How to remember the above formulas: Substituting these into the equation we obtain with

forms This gives Remark 1. How to remember the above formulas: Substituting these into the equation we obtain with Week 03: C lassification of S econd- Order L inear Equations In last week s lectures we have illustrated how to obtain the general solutions of first order PDEs using the method of characteristics. We

Διαβάστε περισσότερα

D Alembert s Solution to the Wave Equation

D Alembert s Solution to the Wave Equation D Alembert s Solution to the Wave Equation MATH 467 Partial Differential Equations J. Robert Buchanan Department of Mathematics Fall 2018 Objectives In this lesson we will learn: a change of variable technique

Διαβάστε περισσότερα

Congruence Classes of Invertible Matrices of Order 3 over F 2

Congruence Classes of Invertible Matrices of Order 3 over F 2 International Journal of Algebra, Vol. 8, 24, no. 5, 239-246 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/.2988/ija.24.422 Congruence Classes of Invertible Matrices of Order 3 over F 2 Ligong An and

Διαβάστε περισσότερα

DERIVATION OF MILES EQUATION FOR AN APPLIED FORCE Revision C

DERIVATION OF MILES EQUATION FOR AN APPLIED FORCE Revision C DERIVATION OF MILES EQUATION FOR AN APPLIED FORCE Revision C By Tom Irvine Email: tomirvine@aol.com August 6, 8 Introduction The obective is to derive a Miles equation which gives the overall response

Διαβάστε περισσότερα

Matrices and Determinants

Matrices and Determinants Matrices and Determinants SUBJECTIVE PROBLEMS: Q 1. For what value of k do the following system of equations possess a non-trivial (i.e., not all zero) solution over the set of rationals Q? x + ky + 3z

Διαβάστε περισσότερα

Phys460.nb Solution for the t-dependent Schrodinger s equation How did we find the solution? (not required)

Phys460.nb Solution for the t-dependent Schrodinger s equation How did we find the solution? (not required) Phys460.nb 81 ψ n (t) is still the (same) eigenstate of H But for tdependent H. The answer is NO. 5.5.5. Solution for the tdependent Schrodinger s equation If we assume that at time t 0, the electron starts

Διαβάστε περισσότερα

Lecture 2: Dirac notation and a review of linear algebra Read Sakurai chapter 1, Baym chatper 3

Lecture 2: Dirac notation and a review of linear algebra Read Sakurai chapter 1, Baym chatper 3 Lecture 2: Dirac notation and a review of linear algebra Read Sakurai chapter 1, Baym chatper 3 1 State vector space and the dual space Space of wavefunctions The space of wavefunctions is the set of all

Διαβάστε περισσότερα

Fourier Series. MATH 211, Calculus II. J. Robert Buchanan. Spring Department of Mathematics

Fourier Series. MATH 211, Calculus II. J. Robert Buchanan. Spring Department of Mathematics Fourier Series MATH 211, Calculus II J. Robert Buchanan Department of Mathematics Spring 2018 Introduction Not all functions can be represented by Taylor series. f (k) (c) A Taylor series f (x) = (x c)

Διαβάστε περισσότερα

Απόκριση σε Μοναδιαία Ωστική Δύναμη (Unit Impulse) Απόκριση σε Δυνάμεις Αυθαίρετα Μεταβαλλόμενες με το Χρόνο. Απόστολος Σ.

Απόκριση σε Μοναδιαία Ωστική Δύναμη (Unit Impulse) Απόκριση σε Δυνάμεις Αυθαίρετα Μεταβαλλόμενες με το Χρόνο. Απόστολος Σ. Απόκριση σε Δυνάμεις Αυθαίρετα Μεταβαλλόμενες με το Χρόνο The time integral of a force is referred to as impulse, is determined by and is obtained from: Newton s 2 nd Law of motion states that the action

Διαβάστε περισσότερα

3.4 SUM AND DIFFERENCE FORMULAS. NOTE: cos(α+β) cos α + cos β cos(α-β) cos α -cos β

3.4 SUM AND DIFFERENCE FORMULAS. NOTE: cos(α+β) cos α + cos β cos(α-β) cos α -cos β 3.4 SUM AND DIFFERENCE FORMULAS Page Theorem cos(αβ cos α cos β -sin α cos(α-β cos α cos β sin α NOTE: cos(αβ cos α cos β cos(α-β cos α -cos β Proof of cos(α-β cos α cos β sin α Let s use a unit circle

Διαβάστε περισσότερα

Chapter 6: Systems of Linear Differential. be continuous functions on the interval

Chapter 6: Systems of Linear Differential. be continuous functions on the interval Chapter 6: Systems of Linear Differential Equations Let a (t), a 2 (t),..., a nn (t), b (t), b 2 (t),..., b n (t) be continuous functions on the interval I. The system of n first-order differential equations

Διαβάστε περισσότερα

6.1. Dirac Equation. Hamiltonian. Dirac Eq.

6.1. Dirac Equation. Hamiltonian. Dirac Eq. 6.1. Dirac Equation Ref: M.Kaku, Quantum Field Theory, Oxford Univ Press (1993) η μν = η μν = diag(1, -1, -1, -1) p 0 = p 0 p = p i = -p i p μ p μ = p 0 p 0 + p i p i = E c 2 - p 2 = (m c) 2 H = c p 2

Διαβάστε περισσότερα

SCITECH Volume 13, Issue 2 RESEARCH ORGANISATION Published online: March 29, 2018

SCITECH Volume 13, Issue 2 RESEARCH ORGANISATION Published online: March 29, 2018 Journal of rogressive Research in Mathematics(JRM) ISSN: 2395-028 SCITECH Volume 3, Issue 2 RESEARCH ORGANISATION ublished online: March 29, 208 Journal of rogressive Research in Mathematics www.scitecresearch.com/journals

Διαβάστε περισσότερα

Partial Differential Equations in Biology The boundary element method. March 26, 2013

Partial Differential Equations in Biology The boundary element method. March 26, 2013 The boundary element method March 26, 203 Introduction and notation The problem: u = f in D R d u = ϕ in Γ D u n = g on Γ N, where D = Γ D Γ N, Γ D Γ N = (possibly, Γ D = [Neumann problem] or Γ N = [Dirichlet

Διαβάστε περισσότερα

Areas and Lengths in Polar Coordinates

Areas and Lengths in Polar Coordinates Kiryl Tsishchanka Areas and Lengths in Polar Coordinates In this section we develop the formula for the area of a region whose boundary is given by a polar equation. We need to use the formula for the

Διαβάστε περισσότερα

Areas and Lengths in Polar Coordinates

Areas and Lengths in Polar Coordinates Kiryl Tsishchanka Areas and Lengths in Polar Coordinates In this section we develop the formula for the area of a region whose boundary is given by a polar equation. We need to use the formula for the

Διαβάστε περισσότερα

Statistical Inference I Locally most powerful tests

Statistical Inference I Locally most powerful tests Statistical Inference I Locally most powerful tests Shirsendu Mukherjee Department of Statistics, Asutosh College, Kolkata, India. shirsendu st@yahoo.co.in So far we have treated the testing of one-sided

Διαβάστε περισσότερα

Coefficient Inequalities for a New Subclass of K-uniformly Convex Functions

Coefficient Inequalities for a New Subclass of K-uniformly Convex Functions International Journal of Computational Science and Mathematics. ISSN 0974-89 Volume, Number (00), pp. 67--75 International Research Publication House http://www.irphouse.com Coefficient Inequalities for

Διαβάστε περισσότερα

CRASH COURSE IN PRECALCULUS

CRASH COURSE IN PRECALCULUS CRASH COURSE IN PRECALCULUS Shiah-Sen Wang The graphs are prepared by Chien-Lun Lai Based on : Precalculus: Mathematics for Calculus by J. Stuwart, L. Redin & S. Watson, 6th edition, 01, Brooks/Cole Chapter

Διαβάστε περισσότερα

Nowhere-zero flows Let be a digraph, Abelian group. A Γ-circulation in is a mapping : such that, where, and : tail in X, head in

Nowhere-zero flows Let be a digraph, Abelian group. A Γ-circulation in is a mapping : such that, where, and : tail in X, head in Nowhere-zero flows Let be a digraph, Abelian group. A Γ-circulation in is a mapping : such that, where, and : tail in X, head in : tail in X, head in A nowhere-zero Γ-flow is a Γ-circulation such that

Διαβάστε περισσότερα

9.09. # 1. Area inside the oval limaçon r = cos θ. To graph, start with θ = 0 so r = 6. Compute dr

9.09. # 1. Area inside the oval limaçon r = cos θ. To graph, start with θ = 0 so r = 6. Compute dr 9.9 #. Area inside the oval limaçon r = + cos. To graph, start with = so r =. Compute d = sin. Interesting points are where d vanishes, or at =,,, etc. For these values of we compute r:,,, and the values

Διαβάστε περισσότερα

SOME PROPERTIES OF FUZZY REAL NUMBERS

SOME PROPERTIES OF FUZZY REAL NUMBERS Sahand Communications in Mathematical Analysis (SCMA) Vol. 3 No. 1 (2016), 21-27 http://scma.maragheh.ac.ir SOME PROPERTIES OF FUZZY REAL NUMBERS BAYAZ DARABY 1 AND JAVAD JAFARI 2 Abstract. In the mathematical

Διαβάστε περισσότερα

Lecture 34 Bootstrap confidence intervals

Lecture 34 Bootstrap confidence intervals Lecture 34 Bootstrap confidence intervals Confidence Intervals θ: an unknown parameter of interest We want to find limits θ and θ such that Gt = P nˆθ θ t If G 1 1 α is known, then P θ θ = P θ θ = 1 α

Διαβάστε περισσότερα

Solution Series 9. i=1 x i and i=1 x i.

Solution Series 9. i=1 x i and i=1 x i. Lecturer: Prof. Dr. Mete SONER Coordinator: Yilin WANG Solution Series 9 Q1. Let α, β >, the p.d.f. of a beta distribution with parameters α and β is { Γ(α+β) Γ(α)Γ(β) f(x α, β) xα 1 (1 x) β 1 for < x

Διαβάστε περισσότερα

The semiclassical Garding inequality

The semiclassical Garding inequality The semiclassical Garding inequality We give a proof of the semiclassical Garding inequality (Theorem 4.1 using as the only black box the Calderon-Vaillancourt Theorem. 1 Anti-Wick quantization For (q,

Διαβάστε περισσότερα

Jesse Maassen and Mark Lundstrom Purdue University November 25, 2013

Jesse Maassen and Mark Lundstrom Purdue University November 25, 2013 Notes on Average Scattering imes and Hall Factors Jesse Maassen and Mar Lundstrom Purdue University November 5, 13 I. Introduction 1 II. Solution of the BE 1 III. Exercises: Woring out average scattering

Διαβάστε περισσότερα

Second Order Partial Differential Equations

Second Order Partial Differential Equations Chapter 7 Second Order Partial Differential Equations 7.1 Introduction A second order linear PDE in two independent variables (x, y Ω can be written as A(x, y u x + B(x, y u xy + C(x, y u u u + D(x, y

Διαβάστε περισσότερα

Tridiagonal matrices. Gérard MEURANT. October, 2008

Tridiagonal matrices. Gérard MEURANT. October, 2008 Tridiagonal matrices Gérard MEURANT October, 2008 1 Similarity 2 Cholesy factorizations 3 Eigenvalues 4 Inverse Similarity Let α 1 ω 1 β 1 α 2 ω 2 T =......... β 2 α 1 ω 1 β 1 α and β i ω i, i = 1,...,

Διαβάστε περισσότερα

Practice Exam 2. Conceptual Questions. 1. State a Basic identity and then verify it. (a) Identity: Solution: One identity is csc(θ) = 1

Practice Exam 2. Conceptual Questions. 1. State a Basic identity and then verify it. (a) Identity: Solution: One identity is csc(θ) = 1 Conceptual Questions. State a Basic identity and then verify it. a) Identity: Solution: One identity is cscθ) = sinθ) Practice Exam b) Verification: Solution: Given the point of intersection x, y) of the

Διαβάστε περισσότερα

Finite Field Problems: Solutions

Finite Field Problems: Solutions Finite Field Problems: Solutions 1. Let f = x 2 +1 Z 11 [x] and let F = Z 11 [x]/(f), a field. Let Solution: F =11 2 = 121, so F = 121 1 = 120. The possible orders are the divisors of 120. Solution: The

Διαβάστε περισσότερα

Second Order RLC Filters

Second Order RLC Filters ECEN 60 Circuits/Electronics Spring 007-0-07 P. Mathys Second Order RLC Filters RLC Lowpass Filter A passive RLC lowpass filter (LPF) circuit is shown in the following schematic. R L C v O (t) Using phasor

Διαβάστε περισσότερα

Fractional Colorings and Zykov Products of graphs

Fractional Colorings and Zykov Products of graphs Fractional Colorings and Zykov Products of graphs Who? Nichole Schimanski When? July 27, 2011 Graphs A graph, G, consists of a vertex set, V (G), and an edge set, E(G). V (G) is any finite set E(G) is

Διαβάστε περισσότερα

ANSWERSHEET (TOPIC = DIFFERENTIAL CALCULUS) COLLECTION #2. h 0 h h 0 h h 0 ( ) g k = g 0 + g 1 + g g 2009 =?

ANSWERSHEET (TOPIC = DIFFERENTIAL CALCULUS) COLLECTION #2. h 0 h h 0 h h 0 ( ) g k = g 0 + g 1 + g g 2009 =? Teko Classes IITJEE/AIEEE Maths by SUHAAG SIR, Bhopal, Ph (0755) 3 00 000 www.tekoclasses.com ANSWERSHEET (TOPIC DIFFERENTIAL CALCULUS) COLLECTION # Question Type A.Single Correct Type Q. (A) Sol least

Διαβάστε περισσότερα

ECE Spring Prof. David R. Jackson ECE Dept. Notes 2

ECE Spring Prof. David R. Jackson ECE Dept. Notes 2 ECE 634 Spring 6 Prof. David R. Jackson ECE Dept. Notes Fields in a Source-Free Region Example: Radiation from an aperture y PEC E t x Aperture Assume the following choice of vector potentials: A F = =

Διαβάστε περισσότερα

Problem Set 9 Solutions. θ + 1. θ 2 + cotθ ( ) sinθ e iφ is an eigenfunction of the ˆ L 2 operator. / θ 2. φ 2. sin 2 θ φ 2. ( ) = e iφ. = e iφ cosθ.

Problem Set 9 Solutions. θ + 1. θ 2 + cotθ ( ) sinθ e iφ is an eigenfunction of the ˆ L 2 operator. / θ 2. φ 2. sin 2 θ φ 2. ( ) = e iφ. = e iφ cosθ. Chemistry 362 Dr Jean M Standard Problem Set 9 Solutions The ˆ L 2 operator is defined as Verify that the angular wavefunction Y θ,φ) Also verify that the eigenvalue is given by 2! 2 & L ˆ 2! 2 2 θ 2 +

Διαβάστε περισσότερα

k A = [k, k]( )[a 1, a 2 ] = [ka 1,ka 2 ] 4For the division of two intervals of confidence in R +

k A = [k, k]( )[a 1, a 2 ] = [ka 1,ka 2 ] 4For the division of two intervals of confidence in R + Chapter 3. Fuzzy Arithmetic 3- Fuzzy arithmetic: ~Addition(+) and subtraction (-): Let A = [a and B = [b, b in R If x [a and y [b, b than x+y [a +b +b Symbolically,we write A(+)B = [a (+)[b, b = [a +b

Διαβάστε περισσότερα

Section 9.2 Polar Equations and Graphs

Section 9.2 Polar Equations and Graphs 180 Section 9. Polar Equations and Graphs In this section, we will be graphing polar equations on a polar grid. In the first few examples, we will write the polar equation in rectangular form to help identify

Διαβάστε περισσότερα

Homework 8 Model Solution Section

Homework 8 Model Solution Section MATH 004 Homework Solution Homework 8 Model Solution Section 14.5 14.6. 14.5. Use the Chain Rule to find dz where z cosx + 4y), x 5t 4, y 1 t. dz dx + dy y sinx + 4y)0t + 4) sinx + 4y) 1t ) 0t + 4t ) sinx

Διαβάστε περισσότερα

Inverse trigonometric functions & General Solution of Trigonometric Equations. ------------------ ----------------------------- -----------------

Inverse trigonometric functions & General Solution of Trigonometric Equations. ------------------ ----------------------------- ----------------- Inverse trigonometric functions & General Solution of Trigonometric Equations. 1. Sin ( ) = a) b) c) d) Ans b. Solution : Method 1. Ans a: 17 > 1 a) is rejected. w.k.t Sin ( sin ) = d is rejected. If sin

Διαβάστε περισσότερα

SCHOOL OF MATHEMATICAL SCIENCES G11LMA Linear Mathematics Examination Solutions

SCHOOL OF MATHEMATICAL SCIENCES G11LMA Linear Mathematics Examination Solutions SCHOOL OF MATHEMATICAL SCIENCES GLMA Linear Mathematics 00- Examination Solutions. (a) i. ( + 5i)( i) = (6 + 5) + (5 )i = + i. Real part is, imaginary part is. (b) ii. + 5i i ( + 5i)( + i) = ( i)( + i)

Διαβάστε περισσότερα

Math 446 Homework 3 Solutions. (1). (i): Reverse triangle inequality for metrics: Let (X, d) be a metric space and let x, y, z X.

Math 446 Homework 3 Solutions. (1). (i): Reverse triangle inequality for metrics: Let (X, d) be a metric space and let x, y, z X. Math 446 Homework 3 Solutions. (1). (i): Reverse triangle inequalit for metrics: Let (X, d) be a metric space and let x,, z X. Prove that d(x, z) d(, z) d(x, ). (ii): Reverse triangle inequalit for norms:

Διαβάστε περισσότερα

Chapter 6: Systems of Linear Differential. be continuous functions on the interval

Chapter 6: Systems of Linear Differential. be continuous functions on the interval Chapter 6: Systems of Linear Differential Equations Let a (t), a 2 (t),..., a nn (t), b (t), b 2 (t),..., b n (t) be continuous functions on the interval I. The system of n first-order differential equations

Διαβάστε περισσότερα

Iterated trilinear fourier integrals with arbitrary symbols

Iterated trilinear fourier integrals with arbitrary symbols Cornell University ICM 04, Satellite Conference in Harmonic Analysis, Chosun University, Gwangju, Korea August 6, 04 Motivation the Coifman-Meyer theorem with classical paraproduct(979) B(f, f )(x) :=

Διαβάστε περισσότερα

2. Let H 1 and H 2 be Hilbert spaces and let T : H 1 H 2 be a bounded linear operator. Prove that [T (H 1 )] = N (T ). (6p)

2. Let H 1 and H 2 be Hilbert spaces and let T : H 1 H 2 be a bounded linear operator. Prove that [T (H 1 )] = N (T ). (6p) Uppsala Universitet Matematiska Institutionen Andreas Strömbergsson Prov i matematik Funktionalanalys Kurs: F3B, F4Sy, NVP 2005-03-08 Skrivtid: 9 14 Tillåtna hjälpmedel: Manuella skrivdon, Kreyszigs bok

Διαβάστε περισσότερα

Homomorphism in Intuitionistic Fuzzy Automata

Homomorphism in Intuitionistic Fuzzy Automata International Journal of Fuzzy Mathematics Systems. ISSN 2248-9940 Volume 3, Number 1 (2013), pp. 39-45 Research India Publications http://www.ripublication.com/ijfms.htm Homomorphism in Intuitionistic

Διαβάστε περισσότερα

1 String with massive end-points

1 String with massive end-points 1 String with massive end-points Πρόβλημα 5.11:Θεωρείστε μια χορδή μήκους, τάσης T, με δύο σημειακά σωματίδια στα άκρα της, το ένα μάζας m, και το άλλο μάζας m. α) Μελετώντας την κίνηση των άκρων βρείτε

Διαβάστε περισσότερα

( y) Partial Differential Equations

( y) Partial Differential Equations Partial Dierential Equations Linear P.D.Es. contains no owers roducts o the deendent variables / an o its derivatives can occasionall be solved. Consider eamle ( ) a (sometimes written as a ) we can integrate

Διαβάστε περισσότερα

Section 7.6 Double and Half Angle Formulas

Section 7.6 Double and Half Angle Formulas 09 Section 7. Double and Half Angle Fmulas To derive the double-angles fmulas, we will use the sum of two angles fmulas that we developed in the last section. We will let α θ and β θ: cos(θ) cos(θ + θ)

Διαβάστε περισσότερα

The Simply Typed Lambda Calculus

The Simply Typed Lambda Calculus Type Inference Instead of writing type annotations, can we use an algorithm to infer what the type annotations should be? That depends on the type system. For simple type systems the answer is yes, and

Διαβάστε περισσότερα

Approximation of distance between locations on earth given by latitude and longitude

Approximation of distance between locations on earth given by latitude and longitude Approximation of distance between locations on earth given by latitude and longitude Jan Behrens 2012-12-31 In this paper we shall provide a method to approximate distances between two points on earth

Διαβάστε περισσότερα

Forced Pendulum Numerical approach

Forced Pendulum Numerical approach Numerical approach UiO April 8, 2014 Physical problem and equation We have a pendulum of length l, with mass m. The pendulum is subject to gravitation as well as both a forcing and linear resistance force.

Διαβάστε περισσότερα

CHAPTER 48 APPLICATIONS OF MATRICES AND DETERMINANTS

CHAPTER 48 APPLICATIONS OF MATRICES AND DETERMINANTS CHAPTER 48 APPLICATIONS OF MATRICES AND DETERMINANTS EXERCISE 01 Page 545 1. Use matrices to solve: 3x + 4y x + 5y + 7 3x + 4y x + 5y 7 Hence, 3 4 x 0 5 y 7 The inverse of 3 4 5 is: 1 5 4 1 5 4 15 8 3

Διαβάστε περισσότερα

A Two-Sided Laplace Inversion Algorithm with Computable Error Bounds and Its Applications in Financial Engineering

A Two-Sided Laplace Inversion Algorithm with Computable Error Bounds and Its Applications in Financial Engineering Electronic Companion A Two-Sie Laplace Inversion Algorithm with Computable Error Bouns an Its Applications in Financial Engineering Ning Cai, S. G. Kou, Zongjian Liu HKUST an Columbia University Appenix

Διαβάστε περισσότερα

Continuous Distribution Arising from the Three Gap Theorem

Continuous Distribution Arising from the Three Gap Theorem Continuous Distribution Arising from the Three Gap Theorem Geremías Polanco Encarnación Elementary Analytic and Algorithmic Number Theory Athens, Georgia June 8, 2015 Hampshire college, MA 1 / 24 Happy

Διαβάστε περισσότερα

Reminders: linear functions

Reminders: linear functions Reminders: linear functions Let U and V be vector spaces over the same field F. Definition A function f : U V is linear if for every u 1, u 2 U, f (u 1 + u 2 ) = f (u 1 ) + f (u 2 ), and for every u U

Διαβάστε περισσότερα

Econ 2110: Fall 2008 Suggested Solutions to Problem Set 8 questions or comments to Dan Fetter 1

Econ 2110: Fall 2008 Suggested Solutions to Problem Set 8  questions or comments to Dan Fetter 1 Eon : Fall 8 Suggested Solutions to Problem Set 8 Email questions or omments to Dan Fetter Problem. Let X be a salar with density f(x, θ) (θx + θ) [ x ] with θ. (a) Find the most powerful level α test

Διαβάστε περισσότερα

ORDINAL ARITHMETIC JULIAN J. SCHLÖDER

ORDINAL ARITHMETIC JULIAN J. SCHLÖDER ORDINAL ARITHMETIC JULIAN J. SCHLÖDER Abstract. We define ordinal arithmetic and show laws of Left- Monotonicity, Associativity, Distributivity, some minor related properties and the Cantor Normal Form.

Διαβάστε περισσότερα

MATH423 String Theory Solutions 4. = 0 τ = f(s). (1) dτ ds = dxµ dτ f (s) (2) dτ 2 [f (s)] 2 + dxµ. dτ f (s) (3)

MATH423 String Theory Solutions 4. = 0 τ = f(s). (1) dτ ds = dxµ dτ f (s) (2) dτ 2 [f (s)] 2 + dxµ. dτ f (s) (3) 1. MATH43 String Theory Solutions 4 x = 0 τ = fs). 1) = = f s) ) x = x [f s)] + f s) 3) equation of motion is x = 0 if an only if f s) = 0 i.e. fs) = As + B with A, B constants. i.e. allowe reparametrisations

Διαβάστε περισσότερα

Lecture 13 - Root Space Decomposition II

Lecture 13 - Root Space Decomposition II Lecture 13 - Root Space Decomposition II October 18, 2012 1 Review First let us recall the situation. Let g be a simple algebra, with maximal toral subalgebra h (which we are calling a CSA, or Cartan Subalgebra).

Διαβάστε περισσότερα

Pg The perimeter is P = 3x The area of a triangle is. where b is the base, h is the height. In our case b = x, then the area is

Pg The perimeter is P = 3x The area of a triangle is. where b is the base, h is the height. In our case b = x, then the area is Pg. 9. The perimeter is P = The area of a triangle is A = bh where b is the base, h is the height 0 h= btan 60 = b = b In our case b =, then the area is A = = 0. By Pythagorean theorem a + a = d a a =

Διαβάστε περισσότερα

Exercises 10. Find a fundamental matrix of the given system of equations. Also find the fundamental matrix Φ(t) satisfying Φ(0) = I. 1.

Exercises 10. Find a fundamental matrix of the given system of equations. Also find the fundamental matrix Φ(t) satisfying Φ(0) = I. 1. Exercises 0 More exercises are available in Elementary Differential Equations. If you have a problem to solve any of them, feel free to come to office hour. Problem Find a fundamental matrix of the given

Διαβάστε περισσότερα

Arithmetical applications of lagrangian interpolation. Tanguy Rivoal. Institut Fourier CNRS and Université de Grenoble 1

Arithmetical applications of lagrangian interpolation. Tanguy Rivoal. Institut Fourier CNRS and Université de Grenoble 1 Arithmetical applications of lagrangian interpolation Tanguy Rivoal Institut Fourier CNRS and Université de Grenoble Conference Diophantine and Analytic Problems in Number Theory, The 00th anniversary

Διαβάστε περισσότερα

Trigonometric Formula Sheet

Trigonometric Formula Sheet Trigonometric Formula Sheet Definition of the Trig Functions Right Triangle Definition Assume that: 0 < θ < or 0 < θ < 90 Unit Circle Definition Assume θ can be any angle. y x, y hypotenuse opposite θ

Διαβάστε περισσότερα

DiracDelta. Notations. Primary definition. Specific values. General characteristics. Traditional name. Traditional notation

DiracDelta. Notations. Primary definition. Specific values. General characteristics. Traditional name. Traditional notation DiracDelta Notations Traditional name Dirac delta function Traditional notation x Mathematica StandardForm notation DiracDeltax Primary definition 4.03.02.000.0 x Π lim ε ; x ε0 x 2 2 ε Specific values

Διαβάστε περισσότερα

The Probabilistic Method - Probabilistic Techniques. Lecture 7: The Janson Inequality

The Probabilistic Method - Probabilistic Techniques. Lecture 7: The Janson Inequality The Probabilistic Method - Probabilistic Techniques Lecture 7: The Janson Inequality Sotiris Nikoletseas Associate Professor Computer Engineering and Informatics Department 2014-2015 Sotiris Nikoletseas,

Διαβάστε περισσότερα

CHAPTER 101 FOURIER SERIES FOR PERIODIC FUNCTIONS OF PERIOD

CHAPTER 101 FOURIER SERIES FOR PERIODIC FUNCTIONS OF PERIOD CHAPTER FOURIER SERIES FOR PERIODIC FUNCTIONS OF PERIOD EXERCISE 36 Page 66. Determine the Fourier series for the periodic function: f(x), when x +, when x which is periodic outside this rge of period.

Διαβάστε περισσότερα

w o = R 1 p. (1) R = p =. = 1

w o = R 1 p. (1) R = p =. = 1 Πανεπιστήµιο Κρήτης - Τµήµα Επιστήµης Υπολογιστών ΗΥ-570: Στατιστική Επεξεργασία Σήµατος 205 ιδάσκων : Α. Μουχτάρης Τριτη Σειρά Ασκήσεων Λύσεις Ασκηση 3. 5.2 (a) From the Wiener-Hopf equation we have:

Διαβάστε περισσότερα

Finite difference method for 2-D heat equation

Finite difference method for 2-D heat equation Finite difference method for 2-D heat equation Praveen. C praveen@math.tifrbng.res.in Tata Institute of Fundamental Research Center for Applicable Mathematics Bangalore 560065 http://math.tifrbng.res.in/~praveen

Διαβάστε περισσότερα

2. THEORY OF EQUATIONS. PREVIOUS EAMCET Bits.

2. THEORY OF EQUATIONS. PREVIOUS EAMCET Bits. EAMCET-. THEORY OF EQUATIONS PREVIOUS EAMCET Bits. Each of the roots of the equation x 6x + 6x 5= are increased by k so that the new transformed equation does not contain term. Then k =... - 4. - Sol.

Διαβάστε περισσότερα

Parametrized Surfaces

Parametrized Surfaces Parametrized Surfaces Recall from our unit on vector-valued functions at the beginning of the semester that an R 3 -valued function c(t) in one parameter is a mapping of the form c : I R 3 where I is some

Διαβάστε περισσότερα

Math 6 SL Probability Distributions Practice Test Mark Scheme

Math 6 SL Probability Distributions Practice Test Mark Scheme Math 6 SL Probability Distributions Practice Test Mark Scheme. (a) Note: Award A for vertical line to right of mean, A for shading to right of their vertical line. AA N (b) evidence of recognizing symmetry

Διαβάστε περισσότερα

Bayesian statistics. DS GA 1002 Probability and Statistics for Data Science.

Bayesian statistics. DS GA 1002 Probability and Statistics for Data Science. Bayesian statistics DS GA 1002 Probability and Statistics for Data Science http://www.cims.nyu.edu/~cfgranda/pages/dsga1002_fall17 Carlos Fernandez-Granda Frequentist vs Bayesian statistics In frequentist

Διαβάστε περισσότερα

Exercises to Statistics of Material Fatigue No. 5

Exercises to Statistics of Material Fatigue No. 5 Prof. Dr. Christine Müller Dipl.-Math. Christoph Kustosz Eercises to Statistics of Material Fatigue No. 5 E. 9 (5 a Show, that a Fisher information matri for a two dimensional parameter θ (θ,θ 2 R 2, can

Διαβάστε περισσότερα

Quadratic Expressions

Quadratic Expressions Quadratic Expressions. The standard form of a quadratic equation is ax + bx + c = 0 where a, b, c R and a 0. The roots of ax + bx + c = 0 are b ± b a 4ac. 3. For the equation ax +bx+c = 0, sum of the roots

Διαβάστε περισσότερα

Optimal Parameter in Hermitian and Skew-Hermitian Splitting Method for Certain Two-by-Two Block Matrices

Optimal Parameter in Hermitian and Skew-Hermitian Splitting Method for Certain Two-by-Two Block Matrices Optimal Parameter in Hermitian and Skew-Hermitian Splitting Method for Certain Two-by-Two Block Matrices Chi-Kwong Li Department of Mathematics The College of William and Mary Williamsburg, Virginia 23187-8795

Διαβάστε περισσότερα

Appendix to On the stability of a compressible axisymmetric rotating flow in a pipe. By Z. Rusak & J. H. Lee

Appendix to On the stability of a compressible axisymmetric rotating flow in a pipe. By Z. Rusak & J. H. Lee Appendi to On the stability of a compressible aisymmetric rotating flow in a pipe By Z. Rusak & J. H. Lee Journal of Fluid Mechanics, vol. 5 4, pp. 5 4 This material has not been copy-edited or typeset

Διαβάστε περισσότερα

The Pohozaev identity for the fractional Laplacian

The Pohozaev identity for the fractional Laplacian The Pohozaev identity for the fractional Laplacian Xavier Ros-Oton Departament Matemàtica Aplicada I, Universitat Politècnica de Catalunya (joint work with Joaquim Serra) Xavier Ros-Oton (UPC) The Pohozaev

Διαβάστε περισσότερα

PARTIAL NOTES for 6.1 Trigonometric Identities

PARTIAL NOTES for 6.1 Trigonometric Identities PARTIAL NOTES for 6.1 Trigonometric Identities tanθ = sinθ cosθ cotθ = cosθ sinθ BASIC IDENTITIES cscθ = 1 sinθ secθ = 1 cosθ cotθ = 1 tanθ PYTHAGOREAN IDENTITIES sin θ + cos θ =1 tan θ +1= sec θ 1 + cot

Διαβάστε περισσότερα

A Note on Intuitionistic Fuzzy. Equivalence Relation

A Note on Intuitionistic Fuzzy. Equivalence Relation International Mathematical Forum, 5, 2010, no. 67, 3301-3307 A Note on Intuitionistic Fuzzy Equivalence Relation D. K. Basnet Dept. of Mathematics, Assam University Silchar-788011, Assam, India dkbasnet@rediffmail.com

Διαβάστε περισσότερα