A Spectral Method for Elliptic Equations: The Neumann Problem
|
|
- Lynn Wright
- 6 years ago
- Views:
Transcription
1 A Spectral Method for Elliptic Equations: The Neumann Problem Kendall Atkinson Departments of Mathematics & Computer Science The University of Iowa David Chien, Olaf Hansen Department of Mathematics California State University San Marcos July 6, 9 Abstract Let be an open, simply connected, and bounded region in R d, d, and assume its is smooth. Consider solving an elliptic partial di erential equation u + u = f over with a Neumann boundary condition. The problem is converted to an equivalent elliptic problem over the unit ball, and then a spectral Galerkin method is used to create a convergent sequence of multivariate polynomials u n of degree n that is convergent to u. The transformation from to requires a special analytical calculation for its implementation. With su ciently smooth problem parameters, the method is shown to be rapidly convergent. For u C and is a C boundary, the convergence of ku u nk H to zero is faster than any power of =n. Numerical examples in R and R 3 show experimentally an exponential rate of convergence. INTRODUCTION Consider solving the Neumann problem for Poisson s equation: u + (s)u = f(s); s = g(s); () Assume is an open, simply-connected, and bounded region in R d, d, and assume that its is several times continuously di erentiable. Similarly, assume the functions (s) and f(s) are several times continuously di erentiable over, and assume that g(s) is several times continuously di erentiable over the
2 There is a rich literature on spectral methods for solving partial di erential equations. From the more recent literature, we cite [7], [8], [9], and [5]. Their bibliographies contain references to earlier papers on spectral methods. The present paper is a continuation of the work in [3] in which a spectral method is given for a general elliptic equation with a Dirichlet boundary condition. Our approach is somewhat di erent than the standard approaches. We convert the partial di erential equation to an equivalent problem on the unit disk or unit ball, and in the process we are required to work with a more complicated equation. Our approach is reminiscent of the use of conformal mappings for planar problems. Conformal mappings can be used with our approach when working on planar problems, although having a conformal mapping is not necessary. In we assume that ()-() is uniquely solvable, and we present a spectral Galerkin method for its solution. In 3 we extend the method to the problem with (s) in. The problem is no longer uniquely solvable and we extend our spectral method to this case. The implementation of the method is discussed in 4 and it is illustrated in 5. A spectral method for the uniquely solvable case We assume the Neumann problem ()-() is uniquely solvable. This is true, for example, if (s) c > ; s (3) for some constant c >. For functions u H () ; v H (), v(s) [ u(s) + (s)u] ds = [Ou(s) Ov(s) + (s)u(s)v(s)] s Introduce the bilinear functional A (v ; v ) = [Ov (s) Ov (s) + (s)v (s)v (s)] ds: (5) The variational form of the Neumann problem ()-() is as follows: nd u such that A (u; v) = `(v) + ` (v) ; 8v H () (6) with the linear functionals de ned by `(v) = v(s)f(s) ds; (7) ` (v) = v (s) g(s) ds: ds: (4)
3 The norms we use for ` and ` are the standard operator norms when regarding ` and ` as linear functionals on H (). The functional ` is bounded easily on H (), j` (v)j kfk L kvk L kfk L kvk H : (9) Ordinarily, we will use kvk in place of kvk H. The functional ` is bounded (at least for bounded domains ). To show this, begin by noting that the restriction : H ()! H = (@) is continuous [3, Th. 3.37] and the imbedding : H = (@),! L (@) is compact [3, Th. 3.7]. If we further denote by l g the continuous mapping l g : u 7! u(s)g(s) ds; u L (@) then we see ` = l g, and therefore ` is bounded. It is straightforward to show A is ja (v; w)j c A kvk kwk ; c A = max f; kk g : () In addition, we assume A is strongly elliptic on H (), A (v; v) c e kvk ; v H () () with some c e >. This follows ordinarily from showing the unique solvability of the Neumann problem ()-(). If (3) is satis ed, then we can satisfy () with c e = min f; c g Under our assumptions on A, including the strong ellipticity in (), the Lax- Milgram Theorem implies the existence of a unique solution u to (6) with kuk c e [k`k + k`k] : () Our spectral method is de ned using polynomial approximations over the open unit ball in R d, call it d. Introduce a change of variables : d! onto with a twice-di erentiable mapping, and let = :! d. [We onto comment later on the creation of for cases in which only the boundary mapping is known.] For v L (), let ev(x) = v ( (x)) ; x d R d and conversely, v(s) = ev ( (s)) ; s R d : 3
4 Assuming v H (), we can show r x ev (x) = J (x) T r s v (s) ; s = (x) with J (x) the Jacobian matrix for over the unit ball d, (x) J(x) (D) (x) = ; x d j i;j= Similarly, r s v(s) = K(s) T r x ev(x); with K(s) the Jacobian matrix for over. Also, x = (s) K ( (x)) = J (x) : (3) Using the change of variables s = (x), the formula (5) converts to A (v ; v ) = f[k ( (x)) T r x ev (x)] T [K ( (x)) T r x ev (x)] d with + ( (x))v ( (x))v ( (x)g jdet [J(x)]j dx = f[j (x) T r x ev (x)] T [J (x) T r x ev (x)] d + e(x)ev (x)ev (x)g jdet [J(x)]j dx = fr x ev (x) T A(x)r x ev (x) + e(x)ev (x)ev (x)g jdet [J(x)]j dx d e A (ev ; ev ) (4) A(x) = J (x) J (x) T : We can also introduce analogues to ` and ` following a change of variables, calling them è and è and de ned on H ( d ). For example, è (ev) = ev(x)f((x)) jdet [J(x)]j dx: d We can then convert (6) to an equivalent problem over H ( d ). The variational problem becomes ea (eu; ev) = è (ev) + è (ev) ; 8ev H ( d ) : (5) The assumptions and results in (6)-() extend to this new problem on H ( d ). The strong ellipticity condition () becomes ea (ev; ev) ec e kevk ; ev H ( d ) ; (6) min ec e = c xd jdet J(x)j e h i max ; max xd kj(x)k 4
5 where kj(x)k denotes the operator matrix -norm of J(x) for R d. Also, A e (ev; ew) ec A kevk k ewk ; ec A = max jdet [J(x)]j max max ka(x)k ; kk : x d x d For the nite dimensional problem, we want to use the approximating subspace n d n. We want to nd eu n n such that ea (eu n ; ev) = è (ev) + è (ev) ; 8ev n : (7) The Lax-Milgram Theorem (cf. [4, 8.3], [5,.7]) implies the existence of u n for all n. For the error in this Galerkin method, Cea s Lemma (cf. [4, p. 365], [5, p. 6]) implies the convergence of u n to u, and moreover, keu eu n k ec A ec e inf keu evk : (8) ev n It remains to bound the best approximation error on the right side of this inequality. Ragozin [4] gives bounds on the rate of convergence of best polynomial approximation over the unit ball, and these results are extended in [6] to simultaneous approximation of a function and some of its lower order derivatives. Assume eu C m+ d. Using [6, Theorem ], we have with inf keu evk ev n! u;m+ () = sup jj=m+ c(u; m) n m! u;m+ sup jd eu (x) jx yj n D eu (y)j! : (9) The notation D eu (x) is standard derivative notation with a multi-integer. In particular, for = ( ; : : : ; d ), D eu (x) eu (x ; : : : ; x d d When (9) is combined with (8), we see that our solutions eu n converge faster than any power of =n provided eu C d. 3 A spectral method for u = f Consider the Neumann problem for Poisson s equation: d u = f(s); s = g(s); () 5
6 As a reference for this problem, see [5, 5.]. As earlier in (4), we have for functions u H () ; v H (), v(s)u(s) ds = Ou(s) Ov(s) ds + v ds s If this Neumann problem ()-() is solvable, then its solution is not unique: any constant added to a solution gives another solution. In addition, if ()-() is solvable, then v(s)f(s) ds = Ou(s) Ov(s) ds v (s) g(s) ds (3) Choosing v(s), we obtain f(s) @ g(s) ds (4) This is a necessary and su cient condition on the functions f and g in order that ()-() be solvable. With this constraint, the Neumann problem is solvable. To deal with the non-unique solvability, we look for a solution u satisfying u(s) ds = (5) Introduce the bilinear functional A (v ; v ) = and the function space A is bounded, V = Ov (s) Ov (s) ds (6) v H () : v(s) ds = ja (v; w)j kvk kwk ; 8v; w V: From [5, Prop. 5.3.] A (; ) is strongly elliptic on V, satisfying (7) A (v; v) c e kvk ; v V for some c e >. The variational form of the Neumann problem ()-() is as follows: nd u such that A (u; v) = `(v) + ` (v) ; 8v V (8) with ` and ` de ned as in (7)-(8). As before, the Lax-Milgram Theorem implies the existence of a unique solution u to (8) with kuk c e [k`k + k`k] : 6
7 As in the preceding section, we transform the problem from being de ned over to being over d. Most of the arguments are repeated, and we have ea (ev ; ev ) = fr x ev (x) T A(x)r x ev (x)g jdet [J(x)]j dx: d The condition (5) becomes We introduce the space ev = ev H () : ev(x) jdet [J(x)]j dx = : The Neumann problem now has the reformulation ev(x) jdet [J(x)]j dx = : (9) ea (eu; ev) = è (ev) + è (ev) ; 8ev e V (3) For the nite dimensional approximating problem, we use Then we want to nd eu n e V n such that ev n = e V \ n (3) ea (eu n ; ev) = è (ev) + è (ev) ; 8ev e V n (3) We can invoke the standard results of the Lax-Milgram Theorem and Cea s Lemma to obtain the existence of a unique solution eu n, and moreover, keu eu n k c inf v e V n keu vk : (33) for some c >. A modi cation of the argument that led to (9) can be used to obtained a similar result for (33). First, however, we discuss the practical problem of choosing a basis for e V n. 3. Constructing a basis for e V n Let ' j : j Nn d denote a basis for n (usually we choose ' j to be an orthogonal family in the norm of L ( d )). We assume that ' (x) is a nonzero constant function. Introduce the new basis elements with b' j = ' j C C = ' j (x) jdet [J(x)]j dx; j N d n (34) jdet [J(x)]j dx kdet [J]k L (35) 7
8 Then b' = and b' j (x) jdet [J(x)]j dx = C = ' j (x) jdet [J(x)]j dx ' j (x) jdet [J(x)]j dx jdet [J(x)]j dx Thus b' j : j Nn d procedure in (3). is a basis of e V n and we can use it for our Galerkin 3. The rate of convergence of eu n Now we estimate inf vvn e keu vk ; see (33). Recalling (34), we consider the linear mapping P : L ( d )! L ( d ) given by (P eu)(x) = eu(x) jdet[j(y)]j eu(y) dy; C C = k det[j]k L ; see (35). The mapping P is a projection P (P eu)(x) = (P eu)(x) jdet[j(y)]j (P eu)(y) dy C = eu(x) jdet[j(y)]j eu(y) dy C jdet[j(y)]j eu(y) jdet[j(z)]j eu(z) dy C C = eu(x) jdet[j(y)]j eu(y) dy jdet[j(y)]j eu(y) dy C C + C jdet[j(y)]j dy jdet[j(z)]j eu(z) dz {z } =C = eu(x) jdet[j(y)]j eu(y) dy C = (P eu)(x) 8
9 So P = P and P is a projection with kp k L!L and kp euk = keu jdet[j(y)]j eu(y) dyk L C keuk L + C jdet[j(y)]j eu(y) dy kk L s keuk L + C k det[j]k L keuk d= L + (Cauchy-Schwarz) d s! = + = c P keuk L d= k det[j]kl + d k det[j]k L keuk L which shows kp k L!L c P and e V := P (H ( d )), see (9). For eu H ( d ) we also have P eu H ( d ) and here we again estimate the norm of P : kp euk H = kp euk + kr(p eu)k c P keuk + kreuk since r(p eu) = reu. Furthermore c P, so kp euk H c P keuk L + c P kreuk L = c P (keuk L + kreuk L ) = c P keuk H kp euk H c P keuk H and we have also kp k H!H c P. For eu V e = P (H ()) we can now estimate the minimal approximation error min keu epk ep V e H = min kp eu epk n ep V e H P is a projection n and eu image(p ) = min p n kp eu P pk H because e V n = P ( n ) min kp k H p!h keu pk H n c P min keu pk H p n and now we can apply the results from [6]. 4 Implementation Consider the implementation of the Galerkin method of for the Neumann problem ()-() over by means of the reformulation in (5) over the unit ball d. We are to nd the function eu n n satisfying (5). To do so, we begin by 9
10 selecting a basis for n, denoting it by f' ; : : : ; ' N g, with N N n = dim n. Generally we use a basis that is orthonormal in the norm of L ( ). It would be better probably to use a basis that is orthonormal in the norm of H ( d ); for example, see [8]. We seek eu n (x) = NX k ' k (x) (36) k= Then (7) is equivalent to 3 NX dx k 4 a i;j + (x)' k= i;j= k (x)'`(x) 5 jdet [J(x)]j dx i = f (x) '` (x) jdet [J(x)]j dx (37) d + g (x) '` (x) jj bdy (x)j dx; ` = ; : : : ; d The function jj bdy (x)j arises from the transformation of an integral to one d, associated with the change from ` to è as discussed preceding (5). For example, in one variable the is often represented as a mapping () = ( () ; ()) ; : In that case, jj bdy (x)j is simply j ()j and the associated integral is g ( ()) '` ( ()) j ()j d In (37) we need to calculate the orthonormal polynomials and their rst partial derivatives; and we also need to approximate the integrals in the linear system. For an introduction to the topic of multivariate orthogonal polynomials, see Dunkl and Xu [] and Xu [7]. For multivariate quadrature over the unit ball in R d, see Stroud [6]. For the Neumann problem ()-() of 3, the implementation is basically the same. The basis f' ; : : : ; ' N g is modi ed as in (34), with the constant C of (35) approximated using the quadrature in (4), given below. 4. The planar case The dimension of n is N n = (n + ) (n + ) (38) For notation, we replace x with (x; y). How do we choose the orthonormal basis f'`(x; y)g Ǹ = for n? Unlike the situation for the single variable case, there are many possible orthonormal bases over d = D, the unit disk in R. We have
11 chosen one that is particularly convenient for our computations. These are the "ridge polynomials" introduced by Logan and Shepp [] for solving an image reconstruction problem. We summarize here the results needed for our work. Let V n = fp n : (P; Q) = 8Q n g the polynomials of degree n that are orthogonal to all elements of n. Then the dimension of V n is n + ; moreover, n = V V V n (39) It is standard to construct orthonormal bases of each V n and to then combine them to form an orthonormal basis of n using the latter decomposition. As an orthonormal basis of V n we use ' n;k (x; y) = p U n (x cos (kh) + y sin (kh)) ; (x; y) D; h = (4) n + for k = ; ; : : : ; n. The function U n is the Chebyshev polynomial of the second kind of degree n: sin (n + ) U n (t) = ; t = cos ; t ; n = ; ; : : : (4) sin The family n ' is an orthonormal basis of V n;k k= n. As a basis of n, we order 'n;k lexicographically based on the ordering in (4) and (39): f'`g Ǹ = = ' ; ; ' ; ; ' ; ; ' ; ; : : : ; ' n; ; : : : ; ' n;n To calculate the rst order partial derivatives of ' n;k (x; y), we need U n(t). The values of U n (t) and U n(t) are evaluated using the standard triple recursion relations U n+ (t) = tu n (t) U n (t) U n+(t) = U n (t) + tu n(t) U n (t) For the numerical approximation of the integrals in (37), which are over being the unit disk, we use the formula qx Xq m g(x; y) dx dy g r l ;! l q + q + r l (4) l= m= Here the numbers! l are the weights of the (q + )-point Gauss-Legendre quadrature formula on [; ]. Note that qx p(x)dx = p(r l )! l ; for all single-variable polynomials p(x) with deg (p) q +. The formula (4) uses the trapezoidal rule with q + subdivisions for the integration over d in the azimuthal variable. This quadrature is exact for all polynomials g q. This formula is also the basis of the hyperinterpolation formula discussed in []. l=
12 4. The three dimensional case In the three dimensional case the dimension of n is given by n + 3 N n = 3 and we choose the following orthogonal polynomials on the unit ball ' m;j; (x) = c m;j p (;m j+ ) j (kxk )S ;m j (x) = c m;j kxk m j p (;m j+ ) j (kxk )S ;m j x kxk ; (43) j = ; : : : ; bm=c; = ; ; : : : ; (m j); m = ; ; : : : ; n The constants c m;j are given by c m;j = m j ; and the functions p (;m j+ ) j are the normalized Jacobi polynomials. The functions S ;m j are spherical harmonic functions and they are orthonormal on the sphere S R 3. See [, 3] for the de nition of these functions. In [3] one also nds the quadrature methods which we use to approximate the integrals over () in (4) and (5). The functional è in (5) is given by è (v) = g(((; ; ))) (44) k( ) (; ; ) ( ) (; ; )k v(((; ; )))d d where (; ; ) := (sin() cos(); sin() sin(); cos()) (45) is the usual transformation between spherical and Cartesian coordinates and the indices denote the partial derivatives. For the numerical approximation of the integral in (44) we use traezoidal rules in the direction and Gauß-Legendre formulas for the direction. 5 Numerical examples The construction of our examples is very similar to that given in [3] for the Dirichlet problem. Our rst two transformations have been so chosen that we can invert explicitly the mapping, to be able to better construct our test examples. This is not needed when applying the method; but it simpli es the construction of our test cases. Given, we need to calculate analytically the matrix A(x) = J (x) J (x) T : (46)
13 Figure : Images of (47), with a = :5, for lines of constant radius and constant azimuth on the unit disk. 5. The planar case For our variables, we replace a point x d with (x; y), and we replace a point s with (s; t). De ne the mapping :! by (s; t) = (x; y), s = x y + ax t = x + y (47) with < a <. It can be shown that is a - mapping from the unit disk. In particular, the inverse mapping :! is given by x = h + p i + a (s + t) a y = h at + p i (48) + a (s + t) a In Figure, we give the images in of the circles r = j=, j = ; : : : ; and the azimuthal lines = j=, j = ; : : : ;. The following information is needed when implementing the transformation from u + u = f on to a new equation on : + ax D = J (x; y) = det (J) = ( + ax) 3
14 t.5 s Figure : The function u(s; t) of (5) J (x) = A = J (x) J (x) T = ( + ax) ( + ax) + ax ax ax a x + ax + The latter are the coe cients needed to de ne e A in (4). We give numerical results for solving the equation As a test case, we choose u (s; t) + e s t u (s; t) = f (s; t) ; (s; t) (49) u (s; t) = e s cos (t) ; (s; t) (5) The solution is pictured in Figure. To nd f(s; t), we use (49) and (5). We use the domain parameter a = :5, with pictured in Figure. Numerical results are given in Table for even values of n. The integrations in (37) were performed with (4); and the integration parameter q ranged from to 3. We give the condition numbers of the linear system (37) as produced in Matlab. To calculate the error, we evaluate the numerical solution and the error on the grid (x i;j ; y i;j ) = (r i cos j ; r i sin j ) i (r i ; j ) = ; j ; i = ; ; : : : ; j = ; : : : 4
15 Table : Maximum errors in Galerkin solution u n n N n ku u n k cond n N n ku u n k cond 6 9:7E 4:5 4 3:9E :87E 86: :37E :85E :E :6E :44E :6E :6E :8E :4E n Figure 3: Errors from Table The results are shown graphically in Figure 3. The use of a semi-log scale demonstrates the exponential convergence of the method as the degree increases. To examine experimentally the behaviour of the condition numbers for the linear system (37), we have graphed the condition numbers from Table in Figure 4. Note that we are graphing Nn vs. the condition number of the associated linear system. The graph seems to indicate that the condition number of the system (37) is directly proportional to the square of the order of the system, with the order given in (38). For the Poisson equation u (s; t) = f (s; t) ; (s; t) with the same true solution as in (5), we use the numerical method given in 3. The numerical results are comparable. For example, with n =, we obtain 5
16 5 x N n x 4 Figure 4: Condition numbers from Table ku u n k = 9:9 8 and the condition number is approximately The three dimensional case To illustrate that the proposed spectral method converges rapidly, we rst use a simple test example. We choose the linear transformation x 3x s := (x) x + x x + x + x 3 A ; so that () is transformed to an ellipsoid ; see gure 5. For this transformation D and J = det(d ) are constant functions. For a test solution, we use the function u(s) = s e s sin(s 3 ) (5) which is analytic in each variable. Table shows the errors and the development of the condition numbers for the solution of () on. The associated graphs for the errors and condition numbers are shown in gures 6 and 7, respectively. The graph of the error is consistent with exponential convergence; and the condition number seems to have a growth proportional to the square of the number of degrees of freedom N n. Next we study domains which are star shaped with respect to the origin, = fx R 3 j x = (; ; ); R(; )g: (5) 6
17 Y 3 4 X 4 Figure 5: The boundary of See (45) for the de nition of, and R : S! (; ) is assumed to be a C function. In this case we can construct arbitrarily smooth and invertible mappings : ()! as we will show now. First we de ne a function t : [; ]! [; ] ; t() := ; es ( ; )es < : (53) the parameter e s N determines the smoothness of t C es [; ]. For the following we will assume that R(; ) >, for all and ; this follows after an appropriate scaling of the problem. With the help of t we de ne the function er which is monotone increasing from to R(; ) on [; ] and equal to the Table : Maximum errors in Galerkin solution u n n N n ku u n k cond n N n ku u n k cond 4 9:E :5E :5E :84E :9E :E :8E :6E :6E :6E :53E :6E :3E :E :3E :3E
18 error n Figure 6: Errors from Table identity on [; =], er(; ; ) := t()r(; ) + ( e R(; ; ) = t ()(R(; ) ) + ( t()) > ; [; ] the function R e is an invertible function of of class C es : ()! is de ned by. The transformation (x) := ( e R(; ; ); ; ); x = (; ; ) () The properties of R e imply that is equal to the identity on () and the outside shell () n () is deformed by to cover n (). For a test surface, we use R(; ) = cos() sin() (7 cos() ) (54) e s = 5; see gures 8-9 for pictures For our test example, we use u from (5). The term cos() sin() (7 cos() ) is a spherical harmonic function which shows R C (S ), and the factor 3=4 is used to guarantee R >. For the 8
19 Condition number N x 4 n Figure 7: Conditions numbers from Table transformation we get C 4 ( ()), so we expect a convergence of order O(n 4 ). Our spectral method will now approximate u on the unit ball, which varies much more than the function in our rst example. We also note that one might ask why we do not further increase e s (see (53)) to get a better order of convergence. It is possible to do this, but the price one pays is in larger derivatives of u, and this may result in larger errors for the range of n values where we actually calculate the approximation. The search for an optimal e s is a problem on its own, but it also depends on the solution u. So we have chosen e s = 5 in order to demonstrate our method, showing that the qualitative behaviour of the error is the same as in our earlier examples. The results of our calculations are given in table 3, and the associated graphs of the errors and condition numbers are shown in gures and, respectively. The graph in Figure shows that the condition numbers of the systems grow more slowly than in our rst example, but again the condition numbers appear to be proportional to N n. The graph of the error in Figure again resembles a line and this implies exponential convergence; but the line has a much smaller slope than in the rst example so that the error is only reduced to about : when we use degree 6. What we expect is a convergence of order O(n 4 ), but the graph does not reveal this behavior in the range of n values we have used. Rather, the convergence appears to be exponential. In the future we plan on repeating this numerical example with an improved extension of the boundary given in (54). When given a mapping it is often nontrivial to nd an 9
20 Y 3 3 X 3 Figure 8: A view extension :! with j = ' and with other needed properties. For example, consider a star-like region whose boundary is given by = R(; ) with R : It might seem natural to use (; ; ) = R(; ); ; ; However, such a function is not continuously di erentiable at =. We are exploring this general problem, looking at ways of producing with the properties that are needed for implementing our spectral method. ACKNOWLEDGEMENTS. The authors would like to thank Professor Weimin Han for his careful proofreading of the manuscript. References [] M. Abramowitz, I.A. Stegun, Handbook of Mathematical Functions, Dover Publications, Inc., New York, 965. [] K. Atkinson. An Introduction to Numerical Analysis, nd ed., John Wiley, New York, 989.
21 X Y Figure 9: Another view [3] K. Atkinson, D. Chien, and O. Hansen, A Spectral Method for Elliptic Equations: The Dirichlet Problem, Advances in Computational Mathematics, DOI:.7/s , to appear. [4] K. Atkinson and W. Han. Theoretical Numerical Analysis: A Functional Analysis Framework, nd ed., Springer-Verlag, New York, 5. [5] S. renner and L. Scott, The Mathematical Theory of Finite Element Methods, Springer-Verlag, 994. [6] T. agby, L. os, and N. Levenberg, Multivariate simultaneous approximation, Constructive Approximation, 8 (), pp Table 3: Maximum errors in Galerkin solution u n n N n ku u n k cond n N n ku u n k cond 4 :3 3 9 : :3 86 :3 7 3 : : : : : : : : : : : : 3967
22 error n Figure : Errors from table 3 [7] C. Canuto, A. Quarteroni, My. Hussaini, and T. ang, Spectral Methods in Fluid Mechanics, Springer-Verlag, 988. [8] C. Canuto, A. Quarteroni, My. Hussaini, and T. ang, Spectral Methods - Fundamentals in Single Domains, Springer-Verlag, 6. [9] E. Doha and W. Abd-Elhameed. E cient spectral-galerkin algorithms for direct solution of second-order equations using ultraspherical polynomials, SIAM J. Sci. Comput. 4 (), [] C. Dunkl and Y. Xu. Orthogonal Polynomials of Several Variables, Cambridge Univ. Press, Cambridge,. [] O. Hansen, K. Atkinson, and D. Chien. On the norm of the hyperinterpolation operator on the unit disk and its use for the solution of the nonlinear Poisson equation, IMA J. Numerical Analysis, 9 (9), pp , DOI:.93/imanum/drm5. []. Logan. and L. Shepp. Optimal reconstruction of a function from its projections, Duke Mathematical Journal 4, (975), [3] W. McLean, Strongly Elliptic Systems and oundary Integral Equations, Cambridge Univ. Press,. [4] D. Ragozin. Constructive polynomial approximation on spheres and projective spaces, Trans. Amer. Math. Soc. 6 (97), 57-7.
23 Condition number N x 4 n Figure : Condition numbers from table 3 [5] J. Shen and L. Wang. Analysis of a spectral-galerkin approximation to the Helmholtz equation in exterior domains, SIAM J. Numer. Anal. 45 (7), [6] A. Stroud. Approximate Calculation of Multiple Integrals, Prentice-Hall, Inc., Englewood Cli s, N.J., 97. [7] Yuan Xu. Lecture notes on orthogonal polynomials of several variables, in Advances in the Theory of Special Functions and Orthogonal Polynomials, Nova Science Publishers, 4, [8] Yuan Xu. A family of Sobolev orthogonal polynomials on the unit ball, J. Approx. Theory 38 (6),
A Spectral Method for Elliptic Equations: The Neumann Problem
A Spectral Method for Elliptic Equations: The Neumann Problem Kendall Atkinson Departments of Mathematics & Computer Science The University of Iowa Olaf Hansen, David Chien Department of Mathematics California
More informationA Spectral Method for Nonlinear Elliptic Equations
A Spectral Method for Nonlinear Elliptic Equations Kendall Atkinson, David Chien, Olaf Hansen July 8, 6 Abstract Let Ω be an open, simply connected, and bounded region in R d, d, and assume its boundary
More informationNear convexity, metric convexity, and convexity
Near convexity, metric convexity, and convexity Fred Richman Florida Atlantic University Boca Raton, FL 33431 28 February 2005 Abstract It is shown that a subset of a uniformly convex normed space is nearly
More informationMath 413/513 Chapter 6 (from Friedberg, Insel, & Spence)
Math 413/513 Chapter 6 (from Friedberg, Insel, & Spence) David Glickenstein December 7, 2015 1 Inner product spaces In this chapter, we will only consider the elds R and C. De nition 1 Let V be a vector
More information4.3 - Linear Combinations and Independence of Vectors
- Linear Combinations and Independence of Vectors De nitions, Theorems, and Examples De nition 1 A vector v in a vector space V is called a linear combination of the vectors u 1, u,,u k in V if v can be
More informationChapter 12. Partial di erential equations Di erential operators in R n. The gradient and Jacobian. Divergence and rotation
Chapter 12 Partial di erential equations 12.1 Di erential operators in R n The gradient and Jacobian We recall the definition of the gradient of a scalar function f : R n! R, as @f grad f = rf =,..., @f
More information1 Which sets have volume 0?
Math 540 Spring 0 Notes #0 More on integration Which sets have volume 0? The theorem at the end of the last section makes this an important question. (Measure theory would supersede it, however.) Theorem
More informationNumerical Integration for Multivariable. October Abstract. We consider the numerical integration of functions with point singularities over
Numerical Integration for Multivariable Functions with Point Singularities Yaun Yang and Kendall E. Atkinson y October 199 Abstract We consider the numerical integration of functions with point singularities
More informationScientific Computing WS 2017/2018. Lecture 18. Jürgen Fuhrmann Lecture 18 Slide 1
Scientific Computing WS 2017/2018 Lecture 18 Jürgen Fuhrmann juergen.fuhrmann@wias-berlin.de Lecture 18 Slide 1 Lecture 18 Slide 2 Weak formulation of homogeneous Dirichlet problem Search u H0 1 (Ω) (here,
More informationA Spectral Method for the Biharmonic Equation
A Spectral Metho for the Biharmonic Equation Kenall Atkinson, Davi Chien, an Olaf Hansen Abstract Let Ω be an open, simply connecte, an boune region in Ê,, with a smooth bounary Ω that is homeomorphic
More informationBIBLIOGRAPHY KENDALL E ATKINSON
September 28, 2017 BIBLIOGRAPHY KENDALL E ATKINSON I. BOOKS 1. K. Atkinson, D. Chien, and O. Hansen. Spectral Methods Using Multivariate Polynomials On The Unit Ball, submitted for publication. 2. K. Atkinson
More informationSimple Examples on Rectangular Domains
84 Chapter 5 Simple Examples on Rectangular Domains In this chapter we consider simple elliptic boundary value problems in rectangular domains in R 2 or R 3 ; our prototype example is the Poisson equation
More informationSPECTRAL THEOREM FOR COMPACT SELF-ADJOINT OPERATORS
SPECTRAL THEOREM FOR COMPACT SELF-ADJOINT OPERATORS G. RAMESH Contents Introduction 1 1. Bounded Operators 1 1.3. Examples 3 2. Compact Operators 5 2.1. Properties 6 3. The Spectral Theorem 9 3.3. Self-adjoint
More informationThe Jacobian. v y u y v (see exercise 46). The total derivative is also known as the Jacobian Matrix of the transformation T (u; v) :
The Jacobian The Jacobian of a Transformation In this section, we explore the concept of a "derivative" of a coordinate transformation, which is known as the Jacobian of the transformation. However, in
More informationSHARP BOUNDARY TRACE INEQUALITIES. 1. Introduction
SHARP BOUNDARY TRACE INEQUALITIES GILES AUCHMUTY Abstract. This paper describes sharp inequalities for the trace of Sobolev functions on the boundary of a bounded region R N. The inequalities bound (semi-)norms
More informationPolyharmonic Cubature Formulas on the Ball and on the Sphere
Polyharmonic Cubature Formulas on the Ball and on the Sphere Polyharmonic Paradigm O. Kounchev Institute of Mathematics and Informatics, Bulgarian Academy of Sciences & IZKS Uni-Bonn; partially supported
More informationAbstract. 1. Introduction
Journal of Computational Mathematics Vol.28, No.2, 2010, 273 288. http://www.global-sci.org/jcm doi:10.4208/jcm.2009.10-m2870 UNIFORM SUPERCONVERGENCE OF GALERKIN METHODS FOR SINGULARLY PERTURBED PROBLEMS
More informationLecture 6: Contraction mapping, inverse and implicit function theorems
Lecture 6: Contraction mapping, inverse and implicit function theorems 1 The contraction mapping theorem De nition 11 Let X be a metric space, with metric d If f : X! X and if there is a number 2 (0; 1)
More informationDichotomy Of Poincare Maps And Boundedness Of Some Cauchy Sequences
Applied Mathematics E-Notes, 2(202), 4-22 c ISSN 607-250 Available free at mirror sites of http://www.math.nthu.edu.tw/amen/ Dichotomy Of Poincare Maps And Boundedness Of Some Cauchy Sequences Abar Zada
More informationA FAST SOLVER FOR ELLIPTIC EQUATIONS WITH HARMONIC COEFFICIENT APPROXIMATIONS
Proceedings of ALGORITMY 2005 pp. 222 229 A FAST SOLVER FOR ELLIPTIC EQUATIONS WITH HARMONIC COEFFICIENT APPROXIMATIONS ELENA BRAVERMAN, MOSHE ISRAELI, AND ALEXANDER SHERMAN Abstract. Based on a fast subtractional
More informationStochastic solutions of nonlinear pde s: McKean versus superprocesses
Stochastic solutions of nonlinear pde s: McKean versus superprocesses R. Vilela Mendes CMAF - Complexo Interdisciplinar, Universidade de Lisboa (Av. Gama Pinto 2, 1649-3, Lisbon) Instituto de Plasmas e
More informationProjected Surface Finite Elements for Elliptic Equations
Available at http://pvamu.edu/aam Appl. Appl. Math. IN: 1932-9466 Vol. 8, Issue 1 (June 2013), pp. 16 33 Applications and Applied Mathematics: An International Journal (AAM) Projected urface Finite Elements
More informationScientific Computing WS 2018/2019. Lecture 15. Jürgen Fuhrmann Lecture 15 Slide 1
Scientific Computing WS 2018/2019 Lecture 15 Jürgen Fuhrmann juergen.fuhrmann@wias-berlin.de Lecture 15 Slide 1 Lecture 15 Slide 2 Problems with strong formulation Writing the PDE with divergence and gradient
More informationLECTURE # 0 BASIC NOTATIONS AND CONCEPTS IN THE THEORY OF PARTIAL DIFFERENTIAL EQUATIONS (PDES)
LECTURE # 0 BASIC NOTATIONS AND CONCEPTS IN THE THEORY OF PARTIAL DIFFERENTIAL EQUATIONS (PDES) RAYTCHO LAZAROV 1 Notations and Basic Functional Spaces Scalar function in R d, d 1 will be denoted by u,
More informationRecurrence Relations and Fast Algorithms
Recurrence Relations and Fast Algorithms Mark Tygert Research Report YALEU/DCS/RR-343 December 29, 2005 Abstract We construct fast algorithms for decomposing into and reconstructing from linear combinations
More information1462. Jacobi pseudo-spectral Galerkin method for second kind Volterra integro-differential equations with a weakly singular kernel
1462. Jacobi pseudo-spectral Galerkin method for second kind Volterra integro-differential equations with a weakly singular kernel Xiaoyong Zhang 1, Junlin Li 2 1 Shanghai Maritime University, Shanghai,
More informationAn Accurate Fourier-Spectral Solver for Variable Coefficient Elliptic Equations
An Accurate Fourier-Spectral Solver for Variable Coefficient Elliptic Equations Moshe Israeli Computer Science Department, Technion-Israel Institute of Technology, Technion city, Haifa 32000, ISRAEL Alexander
More informationTaylor series - Solutions
Taylor series - Solutions. f(x) sin(x) sin(0) + x cos(0) + x x ( sin(0)) +!! ( cos(0)) + + x4 x5 (sin(0)) + 4! 5! 0 + x + 0 x x! + x5 5! x! + 0 + x5 (cos(0)) + x6 6! ( sin(0)) + x 7 7! + x9 9! 5! + 0 +
More informationThe Symplectic Camel and Quantum Universal Invariants: the Angel of Geometry versus the Demon of Algebra
The Symplectic Camel and Quantum Universal Invariants: the Angel of Geometry versus the Demon of Algebra Maurice A. de Gosson University of Vienna, NuHAG Nordbergstr. 15, 19 Vienna April 15, 213 Abstract
More informationFunctional Analysis: Assignment Set # 11 Spring 2009 Professor: Fengbo Hang April 29, 2009
Eduardo Corona Functional Analysis: Assignment Set # Spring 2009 Professor: Fengbo Hang April 29, 2009 29. (i) Every convolution operator commutes with translation: ( c u)(x) = u(x + c) (ii) Any two convolution
More informationPART IV Spectral Methods
PART IV Spectral Methods Additional References: R. Peyret, Spectral methods for incompressible viscous flow, Springer (2002), B. Mercier, An introduction to the numerical analysis of spectral methods,
More informationRecall that any inner product space V has an associated norm defined by
Hilbert Spaces Recall that any inner product space V has an associated norm defined by v = v v. Thus an inner product space can be viewed as a special kind of normed vector space. In particular every inner
More informationFENGBO HANG AND PAUL C. YANG
Q CURVATURE ON A CLASS OF 3 ANIFOLDS FENGBO HANG AND PAUL C. YANG Abstract. otivated by the strong maximum principle for Paneitz operator in dimension 5 or higher found in [G] and the calculation of the
More informationLecture 2: Review of Prerequisites. Table of contents
Math 348 Fall 217 Lecture 2: Review of Prerequisites Disclaimer. As we have a textbook, this lecture note is for guidance and supplement only. It should not be relied on when preparing for exams. In this
More informationIntroduction to Poincare Conjecture and the Hamilton-Perelman program
Introduction to Poincare Conjecture and the Hamilton-Perelman program David Glickenstein Math 538, Spring 2009 January 20, 2009 1 Introduction This lecture is mostly taken from Tao s lecture 2. In this
More informationRobust Solutions to Multi-Objective Linear Programs with Uncertain Data
Robust Solutions to Multi-Objective Linear Programs with Uncertain Data M.A. Goberna yz V. Jeyakumar x G. Li x J. Vicente-Pérez x Revised Version: October 1, 2014 Abstract In this paper we examine multi-objective
More informationHarmonic Polynomials and Dirichlet-Type Problems. 1. Derivatives of x 2 n
Harmonic Polynomials and Dirichlet-Type Problems Sheldon Axler and Wade Ramey 30 May 1995 Abstract. We take a new approach to harmonic polynomials via differentiation. Surprisingly powerful results about
More informationLEGENDRE POLYNOMIALS AND APPLICATIONS. We construct Legendre polynomials and apply them to solve Dirichlet problems in spherical coordinates.
LEGENDRE POLYNOMIALS AND APPLICATIONS We construct Legendre polynomials and apply them to solve Dirichlet problems in spherical coordinates.. Legendre equation: series solutions The Legendre equation is
More informationMath 443/543 Graph Theory Notes 5: Graphs as matrices, spectral graph theory, and PageRank
Math 443/543 Graph Theory Notes 5: Graphs as matrices, spectral graph theory, and PageRank David Glickenstein November 3, 4 Representing graphs as matrices It will sometimes be useful to represent graphs
More informationLecture 8: Basic convex analysis
Lecture 8: Basic convex analysis 1 Convex sets Both convex sets and functions have general importance in economic theory, not only in optimization. Given two points x; y 2 R n and 2 [0; 1]; the weighted
More informationThe Dirichlet-to-Neumann operator
Lecture 8 The Dirichlet-to-Neumann operator The Dirichlet-to-Neumann operator plays an important role in the theory of inverse problems. In fact, from measurements of electrical currents at the surface
More informationOscillatory Mixed Di erential Systems
Oscillatory Mixed Di erential Systems by José M. Ferreira Instituto Superior Técnico Department of Mathematics Av. Rovisco Pais 49- Lisboa, Portugal e-mail: jferr@math.ist.utl.pt Sra Pinelas Universidade
More informationA COLLOCATION METHOD FOR SOLVING THE EXTERIOR NEUMANN PROBLEM
TUDIA UNIV. BABEŞ BOLYAI, MATHEMATICA, Volume XLVIII, Number 3, eptember 2003 A COLLOCATION METHOD FOR OLVING THE EXTERIOR NEUMANN PROBLEM ANDA MICULA Dedicated to Professor Gheorghe Micula at his 60 th
More informationSpurious Chaotic Solutions of Dierential. Equations. Sigitas Keras. September Department of Applied Mathematics and Theoretical Physics
UNIVERSITY OF CAMBRIDGE Numerical Analysis Reports Spurious Chaotic Solutions of Dierential Equations Sigitas Keras DAMTP 994/NA6 September 994 Department of Applied Mathematics and Theoretical Physics
More informationTHE FOURTH-ORDER BESSEL-TYPE DIFFERENTIAL EQUATION
THE FOURTH-ORDER BESSEL-TYPE DIFFERENTIAL EQUATION JYOTI DAS, W.N. EVERITT, D.B. HINTON, L.L. LITTLEJOHN, AND C. MARKETT Abstract. The Bessel-type functions, structured as extensions of the classical Bessel
More informationIntroduction to Linear Algebra. Tyrone L. Vincent
Introduction to Linear Algebra Tyrone L. Vincent Engineering Division, Colorado School of Mines, Golden, CO E-mail address: tvincent@mines.edu URL: http://egweb.mines.edu/~tvincent Contents Chapter. Revew
More informationSuperconvergence Results for the Iterated Discrete Legendre Galerkin Method for Hammerstein Integral Equations
Journal of Computer Science & Computational athematics, Volume 5, Issue, December 05 DOI: 0.0967/jcscm.05.0.003 Superconvergence Results for the Iterated Discrete Legendre Galerkin ethod for Hammerstein
More informationThe Frobenius{Perron Operator
(p.75) CHPTER 4 The Frobenius{Perron Operator The hero of this book is the Frobenius{Perron operator. With this powerful tool we shall study absolutely continuous invariant measures, their existence and
More informationINEQUALITIES OF LIPSCHITZ TYPE FOR POWER SERIES OF OPERATORS IN HILBERT SPACES
INEQUALITIES OF LIPSCHITZ TYPE FOR POWER SERIES OF OPERATORS IN HILBERT SPACES S.S. DRAGOMIR ; Abstract. Let (z) := P anzn be a power series with complex coe - cients convergent on the open disk D (; R)
More informationNotes for Math 663 Spring Alan Demlow
Notes for Math 663 Spring 2016 Alan Demlow 2 Chapter 1 Introduction and preliminaries 1.1 Introduction In this chapter we will introduce the main topics of the course. We first briefly define the finite
More informationMath 5520 Homework 2 Solutions
Math 552 Homework 2 Solutions March, 26. Consider the function fx) = 2x ) 3 if x, 3x ) 2 if < x 2. Determine for which k there holds f H k, 2). Find D α f for α k. Solution. We show that k = 2. The formulas
More informationON THE ASYMPTOTIC BEHAVIOR OF THE PRINCIPAL EIGENVALUES OF SOME ELLIPTIC PROBLEMS
ON THE ASYMPTOTIC BEHAVIOR OF THE PRINCIPAL EIGENVALUES OF SOME ELLIPTIC PROBLEMS TOMAS GODOY, JEAN-PIERRE GOSSE, AND SOFIA PACKA Abstract. This paper is concerned with nonselfadjoint elliptic problems
More informationLECTURE 1: SOURCES OF ERRORS MATHEMATICAL TOOLS A PRIORI ERROR ESTIMATES. Sergey Korotov,
LECTURE 1: SOURCES OF ERRORS MATHEMATICAL TOOLS A PRIORI ERROR ESTIMATES Sergey Korotov, Institute of Mathematics Helsinki University of Technology, Finland Academy of Finland 1 Main Problem in Mathematical
More informationtheorem for harmonic diffeomorphisms. Theorem. Let n be a complete manifold with Ricci 0, and let n be a simplyconnected manifold with nonpositive sec
on-existence of Some Quasi-conformal Harmonic Diffeomorphisms Lei i Λ Department of athematics University of California, Irvine Irvine, CA 92697 lni@math.uci.edu October 5 997 Introduction The property
More informationOle Christensen 3. October 20, Abstract. We point out some connections between the existing theories for
Frames and pseudo-inverses. Ole Christensen 3 October 20, 1994 Abstract We point out some connections between the existing theories for frames and pseudo-inverses. In particular, using the pseudo-inverse
More informationSimple Estimators for Semiparametric Multinomial Choice Models
Simple Estimators for Semiparametric Multinomial Choice Models James L. Powell and Paul A. Ruud University of California, Berkeley March 2008 Preliminary and Incomplete Comments Welcome Abstract This paper
More informationLinearized methods for ordinary di erential equations
Applied Mathematics and Computation 104 (1999) 109±19 www.elsevier.nl/locate/amc Linearized methods for ordinary di erential equations J.I. Ramos 1 Departamento de Lenguajes y Ciencias de la Computacion,
More informationTheorem 1. Suppose that is a Fuchsian group of the second kind. Then S( ) n J 6= and J( ) n T 6= : Corollary. When is of the second kind, the Bers con
ON THE BERS CONJECTURE FOR FUCHSIAN GROUPS OF THE SECOND KIND DEDICATED TO PROFESSOR TATSUO FUJI'I'E ON HIS SIXTIETH BIRTHDAY Toshiyuki Sugawa x1. Introduction. Supposebthat D is a simply connected domain
More informationON INTERPOLATION AND INTEGRATION IN FINITE-DIMENSIONAL SPACES OF BOUNDED FUNCTIONS
COMM. APP. MATH. AND COMP. SCI. Vol., No., ON INTERPOLATION AND INTEGRATION IN FINITE-DIMENSIONAL SPACES OF BOUNDED FUNCTIONS PER-GUNNAR MARTINSSON, VLADIMIR ROKHLIN AND MARK TYGERT We observe that, under
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 informationChapter 5 A priori error estimates for nonconforming finite element approximations 5.1 Strang s first lemma
Chapter 5 A priori error estimates for nonconforming finite element approximations 51 Strang s first lemma We consider the variational equation (51 a(u, v = l(v, v V H 1 (Ω, and assume that the conditions
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 informationAsymptotics of generating the symmetric and alternating groups
Asymptotics of generating the symmetric and alternating groups John D. Dixon School of Mathematics and Statistics Carleton University, Ottawa, Ontario K2G 0E2 Canada jdixon@math.carleton.ca October 20,
More informationTwo-scale convergence
Two-scale convergence Dag Lukkassen y, Gabriel Nguetseng z and Peter Wall x (Dedicated to the memory of Jacques-Louis Lions 1928-2001) Abstract This paper is devoted to the properties and applications
More informationMATHEMATICAL PROGRAMMING I
MATHEMATICAL PROGRAMMING I Books There is no single course text, but there are many useful books, some more mathematical, others written at a more applied level. A selection is as follows: Bazaraa, Jarvis
More informationA Finite Element Method for an Ill-Posed Problem. Martin-Luther-Universitat, Fachbereich Mathematik/Informatik,Postfach 8, D Halle, Abstract
A Finite Element Method for an Ill-Posed Problem W. Lucht Martin-Luther-Universitat, Fachbereich Mathematik/Informatik,Postfach 8, D-699 Halle, Germany Abstract For an ill-posed problem which has its origin
More informationScattering for the NLS equation
Scattering for the NLS equation joint work with Thierry Cazenave (UPMC) Ivan Naumkin Université Nice Sophia Antipolis February 2, 2017 Introduction. Consider the nonlinear Schrödinger equation with the
More informationVariational Formulations
Chapter 2 Variational Formulations In this chapter we will derive a variational (or weak) formulation of the elliptic boundary value problem (1.4). We will discuss all fundamental theoretical results that
More informationLinear Algebra Massoud Malek
CSUEB Linear Algebra Massoud Malek Inner Product and Normed Space In all that follows, the n n identity matrix is denoted by I n, the n n zero matrix by Z n, and the zero vector by θ n An inner product
More informationA Comparison between Solving Two Dimensional Integral Equations by the Traditional Collocation Method and Radial Basis Functions
Applied Mathematical Sciences, Vol. 5, 2011, no. 23, 1145-1152 A Comparison between Solving Two Dimensional Integral Equations by the Traditional Collocation Method and Radial Basis Functions Z. Avazzadeh
More information1. Subspaces A subset M of Hilbert space H is a subspace of it is closed under the operation of forming linear combinations;i.e.,
Abstract Hilbert Space Results We have learned a little about the Hilbert spaces L U and and we have at least defined H 1 U and the scale of Hilbert spaces H p U. Now we are going to develop additional
More informationThe Mortar Wavelet Method Silvia Bertoluzza Valerie Perrier y October 29, 1999 Abstract This paper deals with the construction of wavelet approximatio
The Mortar Wavelet Method Silvia Bertoluzza Valerie Perrier y October 9, 1999 Abstract This paper deals with the construction of wavelet approximation spaces, in the framework of the Mortar method. We
More informationInner products. Theorem (basic properties): Given vectors u, v, w in an inner product space V, and a scalar k, the following properties hold:
Inner products Definition: An inner product on a real vector space V is an operation (function) that assigns to each pair of vectors ( u, v) in V a scalar u, v satisfying the following axioms: 1. u, v
More informationSimple Estimators for Monotone Index Models
Simple Estimators for Monotone Index Models Hyungtaik Ahn Dongguk University, Hidehiko Ichimura University College London, James L. Powell University of California, Berkeley (powell@econ.berkeley.edu)
More informationSecond Order Elliptic PDE
Second Order Elliptic PDE T. Muthukumar tmk@iitk.ac.in December 16, 2014 Contents 1 A Quick Introduction to PDE 1 2 Classification of Second Order PDE 3 3 Linear Second Order Elliptic Operators 4 4 Periodic
More informationLEAST SQUARES APPROXIMATION
LEAST SQUARES APPROXIMATION One more approach to approximating a function f (x) on an interval a x b is to seek an approximation p(x) with a small average error over the interval of approximation. A convenient
More informationNonlinear Programming (NLP)
Natalia Lazzati Mathematics for Economics (Part I) Note 6: Nonlinear Programming - Unconstrained Optimization Note 6 is based on de la Fuente (2000, Ch. 7), Madden (1986, Ch. 3 and 5) and Simon and Blume
More information(x x 0 )(x x 1 )... (x x n ) (x x 0 ) + y 0.
> 5. Numerical Integration Review of Interpolation Find p n (x) with p n (x j ) = y j, j = 0, 1,,..., n. Solution: p n (x) = y 0 l 0 (x) + y 1 l 1 (x) +... + y n l n (x), l k (x) = n j=1,j k Theorem Let
More informationNonlinear Radon and Fourier Transforms
Nonlinear Radon and Fourier Transforms François Rouvière Université de Nice Laboratoire Dieudonné, UMR 7351 May 16, 2015 Abstract In this note we explain a generalization, due to Leon Ehrenpreis, of the
More informationFinite-dimensional spaces. C n is the space of n-tuples x = (x 1,..., x n ) of complex numbers. It is a Hilbert space with the inner product
Chapter 4 Hilbert Spaces 4.1 Inner Product Spaces Inner Product Space. A complex vector space E is called an inner product space (or a pre-hilbert space, or a unitary space) if there is a mapping (, )
More informationSPECTRAL PROPERTIES OF THE LAPLACIAN ON BOUNDED DOMAINS
SPECTRAL PROPERTIES OF THE LAPLACIAN ON BOUNDED DOMAINS TSOGTGEREL GANTUMUR Abstract. After establishing discrete spectra for a large class of elliptic operators, we present some fundamental spectral properties
More informationc 1995 Society for Industrial and Applied Mathematics Vol. 37, No. 1, pp , March
SIAM REVIEW. c 1995 Society for Industrial and Applied Mathematics Vol. 37, No. 1, pp. 93 97, March 1995 008 A UNIFIED PROOF FOR THE CONVERGENCE OF JACOBI AND GAUSS-SEIDEL METHODS * ROBERTO BAGNARA Abstract.
More informationSpectral properties of the transition operator associated to a multivariate re nement equation q
Linear Algebra and its Applications 292 (1999) 155±178 Spectral properties of the transition operator associated to a multivariate re nement equation q Rong-Qing Jia *, Shurong Zhang 1 Department of Mathematical
More informationStochastic integral. Introduction. Ito integral. References. Appendices Stochastic Calculus I. Geneviève Gauthier.
Ito 8-646-8 Calculus I Geneviève Gauthier HEC Montréal Riemann Ito The Ito The theories of stochastic and stochastic di erential equations have initially been developed by Kiyosi Ito around 194 (one of
More informationSOME ABSOLUTELY CONTINUOUS REPRESENTATIONS OF FUNCTION ALGEBRAS
Surveys in Mathematics and its Applications ISSN 1842-6298 Volume 1 (2006), 51 60 SOME ABSOLUTELY CONTINUOUS REPRESENTATIONS OF FUNCTION ALGEBRAS Adina Juratoni Abstract. In this paper we study some absolutely
More informationLecture Notes on PDEs
Lecture Notes on PDEs Alberto Bressan February 26, 2012 1 Elliptic equations Let IR n be a bounded open set Given measurable functions a ij, b i, c : IR, consider the linear, second order differential
More informationBoundary Integral Equations on the Sphere with Radial Basis Functions: Error Analysis
Boundary Integral Equations on the Sphere with Radial Basis Functions: Error Analysis T. Tran Q. T. Le Gia I. H. Sloan E. P. Stephan Abstract Radial basis functions are used to define approximate solutions
More informationGlobal Solutions for a Nonlinear Wave Equation with the p-laplacian Operator
Global Solutions for a Nonlinear Wave Equation with the p-laplacian Operator Hongjun Gao Institute of Applied Physics and Computational Mathematics 188 Beijing, China To Fu Ma Departamento de Matemática
More informationIt is known that Morley element is not C 0 element and it is divergent for Poisson equation (see [6]). When Morley element is applied to solve problem
Modied Morley Element Method for a ourth Order Elliptic Singular Perturbation Problem Λ Wang Ming LMAM, School of Mathematical Science, Peking University Jinchao u School of Mathematical Science, Peking
More informationStochastic Processes
Introduction and Techniques Lecture 4 in Financial Mathematics UiO-STK4510 Autumn 2015 Teacher: S. Ortiz-Latorre Stochastic Processes 1 Stochastic Processes De nition 1 Let (E; E) be a measurable space
More informationCombinatorial Dimension in Fractional Cartesian Products
Combinatorial Dimension in Fractional Cartesian Products Ron Blei, 1 Fuchang Gao 1 Department of Mathematics, University of Connecticut, Storrs, Connecticut 0668; e-mail: blei@math.uconn.edu Department
More informationON THE PARALLEL SURFACES IN GALILEAN SPACE
ON THE PARALLEL SURFACES IN GALILEAN SPACE Mustafa Dede 1, Cumali Ekici 2 and A. Ceylan Çöken 3 1 Kilis 7 Aral k University, Department of Mathematics, 79000, Kilis-TURKEY 2 Eskişehir Osmangazi University,
More informationMAT 257, Handout 13: December 5-7, 2011.
MAT 257, Handout 13: December 5-7, 2011. The Change of Variables Theorem. In these notes, I try to make more explicit some parts of Spivak s proof of the Change of Variable Theorem, and to supply most
More informationOptimal Boundary Control of a Nonlinear Di usion Equation y
AppliedMathematics E-Notes, (00), 97-03 c Availablefreeatmirrorsites ofhttp://math.math.nthu.edu.tw/»amen/ Optimal Boundary Control of a Nonlinear Di usion Equation y Jing-xueYin z,wen-meihuang x Received6
More informationMARKOV CHAINS: STATIONARY DISTRIBUTIONS AND FUNCTIONS ON STATE SPACES. Contents
MARKOV CHAINS: STATIONARY DISTRIBUTIONS AND FUNCTIONS ON STATE SPACES JAMES READY Abstract. In this paper, we rst introduce the concepts of Markov Chains and their stationary distributions. We then discuss
More informationLecture Notes on Metric Spaces
Lecture Notes on Metric Spaces Math 117: Summer 2007 John Douglas Moore Our goal of these notes is to explain a few facts regarding metric spaces not included in the first few chapters of the text [1],
More informationFinite Elements. Colin Cotter. February 22, Colin Cotter FEM
Finite Elements February 22, 2019 In the previous sections, we introduced the concept of finite element spaces, which contain certain functions defined on a domain. Finite element spaces are examples of
More informationLECTURE 12 UNIT ROOT, WEAK CONVERGENCE, FUNCTIONAL CLT
MARCH 29, 26 LECTURE 2 UNIT ROOT, WEAK CONVERGENCE, FUNCTIONAL CLT (Davidson (2), Chapter 4; Phillips Lectures on Unit Roots, Cointegration and Nonstationarity; White (999), Chapter 7) Unit root processes
More informationLegendre s Equation. PHYS Southern Illinois University. October 18, 2016
Legendre s Equation PHYS 500 - Southern Illinois University October 18, 2016 PHYS 500 - Southern Illinois University Legendre s Equation October 18, 2016 1 / 11 Legendre s Equation Recall We are trying
More informationSpectral Properties of Elliptic Operators In previous work we have replaced the strong version of an elliptic boundary value problem
Spectral Properties of Elliptic Operators In previous work we have replaced the strong version of an elliptic boundary value problem L u x f x BC u x g x with the weak problem find u V such that B u,v
More information