ON APPROXIMATION OF LAPLACIAN EIGENPROBLEM OVER A REGULAR HEXAGON WITH ZERO BOUNDARY CONDITIONS 1) 1. Introduction
|
|
- Nathan Richards
- 5 years ago
- Views:
Transcription
1 Journal of Computational Mathematics, Vol., No., 4, ON APPROXIMATION OF LAPLACIAN EIGENPROBLEM OVER A REGULAR HEXAGON WITH ZERO BOUNDARY CONDITIONS ) Jia-chang Sun (Parallel Computing Division, Institute of Software, Chinese Academy of Sciences Beijing 8, China) ( sunjc@mail.rdcps.ac.cn) Dedicated to Professor Zhong-ci Shi on the occasion of his 7th birthday Abstract In my earlier paper [4], an eigen-decompositions of the Laplacian operator is given on a unit regular hexagon with periodic boundary conditions. Since an exact decomposition with Dirichlet boundary conditions has not been explored in terms of any elementary form. In this paper, we investigate an approximate eigen-decomposition. The function space, corresponding all eigenfunction, have been decomposed into four orthogonal subspaces. Estimations of the first eight smallest eigenvalues and related orthogonal functions are given. In particulary we obtain an approximate value of the smallest eigenvalue λ 9 4 π =7.555, the absolute error is less than.. Mathematics subject classification: 4B35, 65N5, 65T5 Key words: Laplacian eigen-decomposition, Regular hexagon domain, Dirichlet boundary conditions.. Introduction GivenanoriginpointO and two plane vectors e and e,e.g.e = {, }, e = { 3, }, we form a 3-direction -D partition as drawn in Fig.. To deal with symmetry along the three direction, we apply a 3-direction coordinates instead of the usual -D Cartesian coordinates and barycentry coordinates, which is a very useful within a triangle domain. Setting the origin point O =(,, ), each partition line is represented by t l =integer (l=,,3), and each -D point P is represented by P =(t,t,t 3 ), t + t + t 3 =, (.) and any function f(p ) defined on the plane can be written as f(p )=f(t,t,t 3 ). In particulary, P k is called an integer node if and only if P k =(k,k,k 3 ), k + k + k 3 =. Let Ω be the unit regular hexagon domain Ω={P P =(t,t,t 3 ) t + t + t 3 =, t,t,t 3 } (.) we consider the following eigenvalue problem u = λu, (.3) with zero Dirichlet boundary u Ω = (.4) In terms of the 3-direction partition form, the Laplacian operator can be written as L = 3 = ( ) ( ) ( ). (.5) t t t t 3 t 3 t Received January 3, 4. ) Project supported by the Major Basic Project of China (No.G99938) and National Natural Science Foundation of China (No. 673).
2 76 J.C. SUN (,,-) t (,-,) (3,,-3)(3,-,-)(3,-,-)(3,-3,) (,,-3) (,,-3) (,3,-3) (-,3,-) (-,3,-) (-3,3,) O (,,-) O (,-,) (,,) t t 3 (-,,) (-,,) Figure.: 3-direction partition Figure.: Parallel hexagon domain Ω Definition.. Afunctionf(P ), defined in the 3-direction coordinate, is called periodic, if for all P =(t,t,t 3 ) the equality f(p + Q) =f(p ) holds for any integer vector Q =(n,n,n 3 ) with n + n + n 3 = (mod 6) The following results have been proved in my earlier paper [4]. Theorem.. For all integer triple j =(j,j,j 3 ), the function system g j (P )=e i π 3 (jt+jt+j3t3) forms a complex eigen decomposition of the Laplacian operator (.3) with three direction periodic boundary conditions, where P =(t,t,t 3 ), j + j + j 3 =. The corresponding eigenvalues equal to λ j,j,j 3 =( π 3 ) ((j j ) +(j j 3 ) +(j 3 j ) ) (.6) Since λ j,j,j 3 = λ j,j 3,j = λ j3,j,j = λ j, j 3, j = λ j3, j, j = λ j, j, j 3 we have the following real eigen-decomposition. Corollary.. For all integer triple j =(j,j,j 3 ), two function system cos( π 3 (j t + j t + j 3 t 3 )) and sin( π 3 (j t + j t + j 3 t 3 )) form an eigen decomposition of the Laplacian operator (.3) with three direction periodic boundary conditions. Moreover, except the smallest eigenvalue is single, all other eigenvalues are six multiple. It is clear that the first eigenfunction is a trivial constant. Several figures of eigenfunctions, related from the second to the four without counting multiple, are drawn in Figure.3-.. Definition.. TSin j (P ):= i[ gj,j,j 3 (P )+g j,j 3,j (P )+g j3,j,j (P ) g j, j 3, j (P ) g j, j, j 3 (P ) g j3, j, j (P ) ] (.7) Definition.3. TCos j (P ):= [ gj,j,j 3 (P )+g j,j 3,j (P )+g j3,j,j (P ) +g j, j 3, j (P )+g j, j, j 3 (P )+g j3, j, j (P ) ] (.8)
3 On Approximation of Laplacian Eigenproblem over a Regular Hexagon with Zero Boundary Conditions 77 Figure.3: -nd eigen. function Figure.4: -nd eigen. function Figure.5: -nd eigen. function 3 Figure.6: -nd eigen. function 4 Theorem.. TSin j (P ) and TCos j (P ) form an eigen-decoposition system of the Laplacian operator (.3) on an equilateral triangle subdomain: t and t,t 3 with zero Dirichlet and Neumann boundary conditions, respectively. The range of integer triple j in eigenvalue expression (.6) corresponds j >, j,j 3 < and respectively. j, j,j 3. Two Kinds of Orthogonal Decomposition for a Function Defined on a Parallel Hexagon Definition.. Afunctionf, defined over a parallel hexagon domain Ω, is called partial symmetry with respect to direction t if f(t,t,t 3 )=f( t, t 3, t ) or is called partial asymmetry with respect to direction t if f(t,t,t 3 )= f( t, t 3, t )
4 78 J.C. SUN Figure.7: -nd eigen. function 5 Figure.8: -nd eigen. function 6 Figure.9: 3-nd eigen. function -3 Figure.: -nd eigen. function 4-6 Definition.. A function f, defined over a parallel hexagon domain Ω, is called partial symmetry with respect to axis t t3 if f (t, t, t3 ) = f (t, t3, t ) or is called partial asymmetry with respect to axis t t3 if f (t, t, t3 ) = f (t, t3, t ) Lemma.. If f is partial symmetry with respect to direction t and g is partial asymmetry Figure.: 4-th eigen. function -3 Figure.: 4-th eigen. function 4-6
5 On Approximation of Laplacian Eigenproblem over a Regular Hexagon with Zero Boundary Conditions 79 with respect to a direction t on the same parallel hexagon, then the two functions are orthogonal <f,g>:= f(p )ḡ(p )dp = Ω Lemma.. If f is partial symmetry with respect to axis t t 3 and g is partial asymmetry with respect to axis t t 3 on the same parallel hexagon, then the two functions are orthogonal. There are similar definitions and lemmas of partial symmetry and asymmetry with respect to direction t, t 3 and axes t 3 t and t t, respectively. By using the above lemmas, it leads to the following orthogonal decomposition theorem Theorem.. Any function f, defined over a parallel hexagon domain Ω, can be decomposed into following four orthogonal sub-functions f(t,t,t 3 )=f (t,t,t 3 )+f (t,t,t 3 )+f 3 (t,t,t 3 )+f 4 (t,t,t 3 ) (.) where f (t,t,t 3 )= 4 {f(t,t,t 3 )+f( t, t 3, t )+f(t,t 3,t )+f( t, t, t 3 )} is both partial symmetry with respect to direction t and the axis t t 3, f (t,t,t 3 )= 4 {f(t,t,t 3 ) f( t, t 3, t )+f(t,t 3,t ) f( t, t, t 3 )} is partial asymmetry with respect to direction t and partial symmetry with the axis t t 3 f 3 (t,t,t 3 )= 4 {f(t,t,t 3 )+f( t, t 3, t ) f(t,t 3,t ) f( t, t, t 3 )} is partial symmetry with respect to direction t and partial asymmetry with the axis t t 3 f 4 (t,t,t 3 )= 4 {f(t,t,t 3 ) f( t, t 3, t ) f(t,t 3,t )+f( t, t, t 3 )} is both partial asymmetry with respect to direction t and the axis t t 3. Now we turn to construct another orthogonal decomposition. Definition.3. Afunctionf, defined over a parallel hexagon domain Ω, iscalledcentered symmetry if f(t,t,t 3 )=f( t, t, t 3 ) or is called centered asymmetry if f(t,t,t 3 )= f( t, t, t 3 ) Lemma.3. If f is centered symmetry and g is centered asymmetry on the same parallel hexagon, then the two functions are orthogonal on the domain Definition.4. Afunctionf, defined over a parallel hexagon domain Ω, is called isotropic if f is centered symmetry and partial symmetry with respect to all three directions t,t and t 3. Denote H I := {f f isotropic} (.) H II := {f f centered asymmetry & partial asymmetry with respect to a direction} H III := {f f centered symmetry & partial asymmetry with respect to a direction} H IV := {f f centered asymmetry & partial symmetry with respect to three directions} Lemma.4. The above four function spaces H I, H II,H III and H IV are orthogonal each other.
6 8 J.C. SUN Lemma.5. For a regular hexagon domain, Laplacian operator preserves the above symmetry and asymmetry of the original function. Therefore, we lay down our foundation for find approximate eigenvalues and related orthogonal function in succeed sections. Lemma.6. Both of four spaces, f,f,f 3,f 4 defined in (.) and H I,H II,H III,H IV in (.), are orthogonal decomposition of any eigen-function of (.3) with (.4). defined 3. Approximation to the Smallest Eight Eigenvalues and Related Functions 3.. The smallest eigenvalue estimation As is well know, the smallest eigenvalue of (.3) with zero boundary conditions (.4) is the minimum of the following quadratic functional < u, u > λ = inf u H (Ω) <u,u> Denote Ω S and Ω B to be an interior circle with radius R = 3 and an exterior equilateral triangle with side length H = 3, respectively. It is obvious Ω S Ω Ω B, hence, by using comparison principle, we have the following inequalities Lemma π = 6 3H π = λ min (Ω B ) <λ := λ min (Ω) <λ min (Ω S ) (π +4) 4(π 4) π R =.784π The lower bound comes from eigenvalues expression of Laplacian in an equilateral triangle with side length 3, e.g. see [] and [4]. To get the righthand side we rewrite the Laplacian eigen-problem in terms of polar coordinates u = u (r r r r ) u r θ, u(r, θ) r=r = (3.) Hence, denote ξ,k to be zero points of the Bessel function J (r), then all isotropic eigenvalues of (3.) equal to ξ,k /R.SinceJ (ξ, ) ξ,=.45 =.9558, J (ξ, ) ξ,=5.5 = Hence, the first two isotropic eigenvalues on the circle equal to.45 4/3 = 7.73 and 5.5 4/3 =47 approximately, and the related Bessel functions J (ξ,k r), (k =, ) are the strict eigenfunctions. In general, all zero points ξ n,k of Bessel functions J n (r) correspond eigenvalues of the Laplacian operator on the unit circle with zero boundary condition λ n,k = ξn,k. The related double eigenfunctions are J n(ξ n,k r)cosnθ and J n (ξ n,k r)sinnθ. Because three areas of the circle, the regular hexagon and the equilateral triangle equal to S ΩS =3π/4, S Ω = 3 3, S Ω B = or log( SΩ S Ω = S t Ω S SΩ t S ΩS ) B, t = log( SΩ B S ΩS ) =.94 Corollary 3.. We may take an approximation for the first eigenvalue as a generalized geometry means between the upper bound and the lower bound of (3.) (3.) λ λ min (Ω S ) ( t) λ min (Ω B ) t π =.7499π, where t =.94. (3.3)
7 On Approximation of Laplacian Eigenproblem over a Regular Hexagon with Zero Boundary Conditions 8 To get an elementary approximation for the first eigenfunction, we substitute u(r) =cos rπ R into the following expression λ = inf u(r)=,u()bounded R R ru dr ru dr then λ (4 + π )/(6R ) (π 4)/(4π ) = (4 + π ) 4R (π 4) π = Hence, in this sense the function is a good approximate of the first eigenfunction. To obtain a further approximation for an approximation of the first eigenfunction, we denote F, =4cos t π cos t π cos t 3π =cost π +cost π +cost 3 π + ; (3.5) F, =( t )( t )( t 3 ). (3.6) These two functions are isotropic and belong to space H I. The graphics of the function F, is shown in Figure 3.. A straight computation leads to < F,, F, > <F,,F, > = π 3 3(5π + 6)/π = 4(8 + 3π )π 3(5π + 6) =.7674π < F,, F, > <F,,F, > = =.7358π 3 Further, if test is done in the space spanned of F, and F,. Therefore function F can be taken as the first eigen-function. Next, the computation can be done in the space spanned of F and F. In fact, set a stiffness matrix K = < F,, F, > < F,, F, > = < F,, F, > < F,, F, > (3.4) and mass matrix M = <F,,F, > < F,,F, > = <F,,F, > < F,,F, > The smallest eigenvalue of the related generalized matrix eigenvalue problem equals to =.78π. The estimation can be improve further if we take the minimum in more wide space F (t,t,t 3 )=Span ν=,...,6 {F,ν } where F 3 = W + W + W 3 ; W =4cos πt sin πt sin πt 3 ; W =4sinπt cos πt sin πt 3; W 3 =4sinπt sin πt cos πt 3 ; F 4 =4cos 3πt F 6 =4cos πt The minimum value cos πt cos πt 3 ; F 5 =4cos πt cos 3πt cos πt 3 ; cos πt cos 3πt 3. λ 7.65 =.76π reaches when F = 946F, F,.5F (F 4 + F 5 + F 6 )
8 8 J.C. SUN Finally, if we add the following extra five high frequency functions F 7 =4cos πt cos 3πt cos 3πt 3 ; F 8 =4cos 3πt cos πt cos 3πt 3 ; F 9 =4cos 3πt cos 3πt cos πt 3 ; F, =4cos 3πt cos 3πt cos 3πt 3 ; and F, = F, into the above space, we may obtain more accuracy upper bound for the smallest eigenvalue λ =.75π. As is well known that the numerical results of first smallest eigen-values are less than their true values. Therefore, we obtain a very close pair of upper bound and lower bound for the first smallest eigenvalue of (.3) with zero boundary conditions (.4). Proposition π <λ <.75π (3.7) 3.. The nd to 5th eigenvalue approximation According to the eigenvalue max-min property, we know λ =sup u inf u H (Ω) <u,u>= < u, u > <u,u> Since the first eigen-function is invariant under rotation 6 o with non zero within the hexagon domain, the second eigen function must be partial asymmetry along a bisection line, e.g. t 3 = or t = t, and the line in the only zero line within the domain. Therefore, the second eigenvalue is double multiple. Denote G =4sinπt cos πt cos πt 3 ; G =4cos πt sin πt cos πt 3 ; G 3 =4cos πt cos πt sin πt 3; The three functions are partial asymmetry along direction t, t and t 3, respectively. They have no zero lines except on their asymmetry axis. F = G + G 3 G ; F = 3(G G 3 ); It is obvious that function F and F are partial asymmetry with respect to direction t and t t 3, respectively. Hence, both of them belong to H II, orthogonal to F inh I,andtheyare orthogonal each other. By symmetry and asymmetry, it is obvious <G,F >=< G,F >=< G 3,F >=, <G,G >=< G,G 3 >=< G 3,G >, (3.8) <G,G >=< G,G >=< G 3,G 3 >. Hence Moreover <F,F >=< F,F >=< F,F >= <F,F >=< F,F >= 3 75π ( π + 675π )=6.764 < F,F >=< F,F >=( π +36π ) 3 = 39.6 λ = λ 3 = 39.6 =8.777 =.9π 6.764
9 On Approximation of Laplacian Eigenproblem over a Regular Hexagon with Zero Boundary Conditions Figure 3.3: Minimum surface approximation F, Similarly, the 4th and 5th eigenvalue are also double multiple. Their corresponding functions have two across bisection zero lines. Denote W =4cos πt sin πt sin πt 3 ; W =4sinπt cos πt sin πt 3; W 3 =4sinπt sin πtcos πt 3 ; F 3 = 3(W W 3 ); F 3 = W + W 3 W ; The two functions are orthogonal each other <F 3,F 3 >=, because of permutation symmetry, { <W,W >=< W,W 3 >=< W 3,W >, (3.9) <W,W >=< W,W >=< W 3,W 3 >. Note that both of F 3 and F 3 belong to H III, they are orthogonal to F H I and F,F H II. Moreover the two Rayleigh quotations are the same, because <F 3,F 3 >=< F 3,F 3 >= π ( π π )= < F 3,F 3 >=< F 3,F 3 >=( π +54π ) 3 = 39.9 λ 4 = λ 5 = 39.9 =33.33 = 3.377π The 6th to 8th eigenvalue approximation As another isotropic function in H I we may take F 6=W + W + W 3 ; By using (3.9) and isotropic property of F 6 H I, it is orthogonal to the above four functions F,F H II and F 3,F 3 H III. <F6,F >=< F6,F >=< F6,F 3 >=< F6,F 3 >=. To get an approximation to the second isotropic eigenfunction, we find a linear combination of two isotropic functions F, in (3.5) and the above F 6 such that F 6 =.78F +3F 6 It corresponding the larger generalized eigenvalues of the sub-space spanned of two functions F andf 6. And <F 6,F 6 >=.458, < F 6,F 6 >=94.353
10 84 J.C. SUN Figure 3.4: Two orthogonal surfaces F andf related to λ = λ Figure 3.5: Two orthogonal surfaces F3 and F3 related to λ4 = λ Figure 3.6: Isotropic surface F6 related to λ6
11 On Approximation of Laplacian Eigenproblem over a Regular Hexagon with Zero Boundary Conditions Figure 3.7: Two orthogonal surfaces F 7 and F 8 related to λ 7 and λ 8 (λ 7 <λ 8 ) the Rayleigh quotation λ = = 3.883π.458 The functions corresponding the 7th and 8th belong to space H IV. They are centered asymmetry and have zero lines on three direction t ν = integer or on the three bisection t µ t ν = integer, µ ν, respectively. F 7 =4sin(t t )π sin(t t 3 )π sin(t 3 t )πf ; F 8 =4sinπt sin πt sin πt 3 ; (3.) Since F 7 is partial symmetry to axis t t 3 and F 8 is partial asymmetry to t t 3, hence they are orthogonal both in ordinary sense and in energy sense. <F 7,F 8 >=< F 7,F 8 >= As F 7 and F 8 belong to space H IV, by Lemma.4, they are orthogonal to F,F 6 H I, F,F H II and F 3,F 3 H III. Moreover, a straight computation leads to < F 7,F 7 >=( π π ) 3= <F 7,F 7 >= 45π ( π + 5π )=.546 The Rayleigh quotation < F 7,F 7 > <F 7,F 7 > = 4.74 =48.3 = π.546 < F 8,F 8 > <F 8,F 8 > = 5.35 = = π Lower Bound of Eigenvalues Via Difference Scheme To get a lower bound of eigenvalues, we may use difference scheme of (.3) with zero boundary conditions (.4). Let mesh size h = /(N + ), using two variable Taylor expanding follows L h u j = 3h {6u(j,j,j 3 ) u(j,j + h, j 3 h) u(j,j h, j 3 + h) u(j + h, j,j 3 h) u(j h, j,j 3 + h) u(j h, j + h, j 3 ) u(j h, j,j 3 + h)} = u j h 6 u j h4 576 {u(6,) +5u (4,) +45u (,4) +9u (,6) } u=uj + O(h 6 ) (4.)
12 86 J.C. SUN Since the biharmonic operator is positive, hence, for sufficient smooth function and suitable small mesh size h, we can take eigenvalues of the partial difference equation as a lower bound of the related Laplacian eigenvalues. The number of total inner knots equals to 3N(N + ) +. The related stiffness matrix has tri-diagonal block form A = T ridiag{a,a ; A,A,A 3 ; ; A N,N,A N,N,A N,N+ ; ; A N,N,A N,N } As an example, for h=/, the related stiffness matrix becomes A = 3h For N = 48, the first eight approximate smallest eigenvalues are equal to {.749,.8363,.8363, 3.853, 3.853, 3.795, 4.899, 5.36}π (4.3) respectively. 5. Conclusion TSin j (P ) in Theorem., as eigenfunctions of Laplacian operator over an equilateral triangle with zero boundary conditions, still are a part of eigenfunctions in the regular hexagon case. The function space, corresponding all eigenfunction, have been decomposed into four orthogonal subspaces. For the smallest eight eigenvalues of (.3) over the regular hexagon with zero boundary condition (.4), we get an upper bound {.75,.9,.9, 3.377, 3.377, 3.883, , }π and a lower bound {.749,.8363,.8363, 3.853, 3.853, 3.795, 4.899, 5.36}π Their maximum relative gaps are less than 4%. The pictures of eigenfunction, corresponding from the smallest to 8th, are shown in Fig. 3. to Fig. 3.7, where λ = λ 3 and λ 4 = λ 5 are two double roots, other four eigenvalues are single roots. Moreover, so far only λ 8 and related eigenfunction (3.) are exact. Approximations to other eigenvalues and related functions can be constructed in a similar way. How to use these approximation of partial eigen-decomposition for constructing a fast solver of the related discrete system is our future work. References [] Mark. A. Pinsky, Completeness of the eigenfunctions of the equilateral triangle, SIAM J. Math. Anal., 6 (985), [] Milan Prager, An investigation of eigenfunctions over the equilateral triangle and square, Applications of mathematics, 43 (998), 3 3. [3] Jiachang Sun, Orthogonal piecewise polynomials basis on an arbitrary triangular domain and its applications, Journal of Computational Mathematics, 9 (), [4] Jiachang Sun, Multivariate Fourier Series over a Class of non Tensor-product Partition Domains, Journal of Computational Mathematics, (3), [5] Jiachang Sun and Huiyuan Li, Generalized Fourier transform on an arbitrary tirangular domain, Advances in Computational Mathematics, toappear. [6] Zhijie Yang and Jiachang Sun, The construction and classification of a set of complete orthogonal bases on an arbitrary triangular domain, Mathematica Numerica Sinica, 5: (3), 9 3. (4.)
Jiachang Sun (Institute of Software, Chinese Academy of Sciences, Beijing , China) Dedicated to the 70th birthday of Professor Lin Qun
Journal of Computational Mathematics, Vol.24, No.3, 2006, 305 322. MULTIVARIATE FOURIER TRANSFORM METHODS OVER SIMPLEX AND SUPER-SIMPLEX DOMAINS 1) Jiachang Sun (Institute of Software, Chinese Academy
More informationn 1 f n 1 c 1 n+1 = c 1 n $ c 1 n 1. After taking logs, this becomes
Root finding: 1 a The points {x n+1, }, {x n, f n }, {x n 1, f n 1 } should be co-linear Say they lie on the line x + y = This gives the relations x n+1 + = x n +f n = x n 1 +f n 1 = Eliminating α and
More informationSpectra of Multiplication Operators as a Numerical Tool. B. Vioreanu and V. Rokhlin Technical Report YALEU/DCS/TR-1443 March 3, 2011
We introduce a numerical procedure for the construction of interpolation and quadrature formulae on bounded convex regions in the plane. The construction is based on the behavior of spectra of certain
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 information1 Euclidean geometry. 1.1 The metric on R n
1 Euclidean geometry This chapter discusses the geometry of n-dimensional Euclidean space E n, together with its distance function. The distance gives rise to other notions such as angles and congruent
More informationOn the spectrum of the Laplacian
On the spectrum of the Laplacian S. Kesavan Institute of Mathematical Sciences, CIT Campus, Taramani, Chennai - 600113. kesh@imsc.res.in July 1, 2013 S. Kesavan (IMSc) Spectrum of the Laplacian July 1,
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 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 informationMath Theory of Partial Differential Equations Lecture 3-2: Spectral properties of the Laplacian. Bessel functions.
Math 412-501 Theory of Partial ifferential Equations Lecture 3-2: Spectral properties of the Laplacian. Bessel functions. Eigenvalue problem: 2 φ + λφ = 0 in, ( αφ + β φ ) n = 0, where α, β are piecewise
More informationLie Theory in Particle Physics
Lie Theory in Particle Physics Tim Roethlisberger May 5, 8 Abstract In this report we look at the representation theory of the Lie algebra of SU(). We construct the general finite dimensional irreducible
More informationMATH 311 Topics in Applied Mathematics Lecture 25: Bessel functions (continued).
MATH 311 Topics in Applied Mathematics Lecture 25: Bessel functions (continued). Bessel s differential equation of order m 0: z 2 d2 f dz 2 + z df dz + (z2 m 2 )f = 0 The equation is considered on the
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 informationThe Convergence of Mimetic Discretization
The Convergence of Mimetic Discretization for Rough Grids James M. Hyman Los Alamos National Laboratory T-7, MS-B84 Los Alamos NM 87545 and Stanly Steinberg Department of Mathematics and Statistics University
More informationTHE HOT SPOTS CONJECTURE FOR NEARLY CIRCULAR PLANAR CONVEX DOMAINS
THE HOT SPOTS CONJECTURE FOR NEARLY CIRCULAR PLANAR CONVEX DOMAINS YASUHITO MIYAMOTO Abstract. We prove the hot spots conjecture of J. Rauch in the case that the domain Ω is a planar convex domain satisfying
More informationREMARKS ON THE MEMBRANE AND BUCKLING EIGENVALUES FOR PLANAR DOMAINS. Leonid Friedlander
REMARKS ON THE MEMBRANE AND BUCKLING EIGENVALUES FOR PLANAR DOMAINS Leonid Friedlander Abstract. I present a counter-example to the conjecture that the first eigenvalue of the clamped buckling problem
More informationbe the set of complex valued 2π-periodic functions f on R such that
. Fourier series. Definition.. Given a real number P, we say a complex valued function f on R is P -periodic if f(x + P ) f(x) for all x R. We let be the set of complex valued -periodic functions f on
More informationMATH 220: INNER PRODUCT SPACES, SYMMETRIC OPERATORS, ORTHOGONALITY
MATH 22: INNER PRODUCT SPACES, SYMMETRIC OPERATORS, ORTHOGONALITY When discussing separation of variables, we noted that at the last step we need to express the inhomogeneous initial or boundary data as
More informationMULTIGRID PRECONDITIONING IN H(div) ON NON-CONVEX POLYGONS* Dedicated to Professor Jim Douglas, Jr. on the occasion of his seventieth birthday.
MULTIGRID PRECONDITIONING IN H(div) ON NON-CONVEX POLYGONS* DOUGLAS N ARNOLD, RICHARD S FALK, and RAGNAR WINTHER Dedicated to Professor Jim Douglas, Jr on the occasion of his seventieth birthday Abstract
More informationSOLUTIONS TO SELECTED PROBLEMS FROM ASSIGNMENTS 3, 4
SOLUTIONS TO SELECTED POBLEMS FOM ASSIGNMENTS 3, 4 Problem 5 from Assignment 3 Statement. Let be an n-dimensional bounded domain with smooth boundary. Show that the eigenvalues of the Laplacian on with
More informationLebesgue Measure on R n
CHAPTER 2 Lebesgue Measure on R n Our goal is to construct a notion of the volume, or Lebesgue measure, of rather general subsets of R n that reduces to the usual volume of elementary geometrical sets
More informationLinear Algebra using Dirac Notation: Pt. 2
Linear Algebra using Dirac Notation: Pt. 2 PHYS 476Q - Southern Illinois University February 6, 2018 PHYS 476Q - Southern Illinois University Linear Algebra using Dirac Notation: Pt. 2 February 6, 2018
More informationA Finite Element Method Using Singular Functions for Poisson Equations: Mixed Boundary Conditions
A Finite Element Method Using Singular Functions for Poisson Equations: Mixed Boundary Conditions Zhiqiang Cai Seokchan Kim Sangdong Kim Sooryun Kong Abstract In [7], we proposed a new finite element method
More informationLecture 2: Linear Algebra Review
EE 227A: Convex Optimization and Applications January 19 Lecture 2: Linear Algebra Review Lecturer: Mert Pilanci Reading assignment: Appendix C of BV. Sections 2-6 of the web textbook 1 2.1 Vectors 2.1.1
More informationHigh School Math Contest
High School Math Contest University of South Carolina February th, 017 Problem 1. If (x y) = 11 and (x + y) = 169, what is xy? (a) 11 (b) 1 (c) 1 (d) (e) 8 Solution: Note that xy = (x + y) (x y) = 169
More informationEquidistributions in arithmetic geometry
Equidistributions in arithmetic geometry Edgar Costa Dartmouth College 14th January 2016 Dartmouth College 1 / 29 Edgar Costa Equidistributions in arithmetic geometry Motivation: Randomness Principle Rigidity/Randomness
More informationarxiv: v1 [math.na] 29 Feb 2016
EFFECTIVE IMPLEMENTATION OF THE WEAK GALERKIN FINITE ELEMENT METHODS FOR THE BIHARMONIC EQUATION LIN MU, JUNPING WANG, AND XIU YE Abstract. arxiv:1602.08817v1 [math.na] 29 Feb 2016 The weak Galerkin (WG)
More informationAn angle metric through the notion of Grassmann representative
Electronic Journal of Linear Algebra Volume 18 Volume 18 (009 Article 10 009 An angle metric through the notion of Grassmann representative Grigoris I. Kalogeropoulos gkaloger@math.uoa.gr Athanasios D.
More informationSpectral element agglomerate AMGe
Spectral element agglomerate AMGe T. Chartier 1, R. Falgout 2, V. E. Henson 2, J. E. Jones 4, T. A. Manteuffel 3, S. F. McCormick 3, J. W. Ruge 3, and P. S. Vassilevski 2 1 Department of Mathematics, Davidson
More informationThe Cartan Dieudonné Theorem
Chapter 7 The Cartan Dieudonné Theorem 7.1 Orthogonal Reflections Orthogonal symmetries are a very important example of isometries. First let us review the definition of a (linear) projection. Given a
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 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 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 informationNodal O(h 4 )-superconvergence of piecewise trilinear FE approximations
Preprint, Institute of Mathematics, AS CR, Prague. 2007-12-12 INSTITTE of MATHEMATICS Academy of Sciences Czech Republic Nodal O(h 4 )-superconvergence of piecewise trilinear FE approximations Antti Hannukainen
More informationTwo special equations: Bessel s and Legendre s equations. p Fourier-Bessel and Fourier-Legendre series. p
LECTURE 1 Table of Contents Two special equations: Bessel s and Legendre s equations. p. 259-268. Fourier-Bessel and Fourier-Legendre series. p. 453-460. Boundary value problems in other coordinate system.
More informationFunctional Analysis. Franck Sueur Metric spaces Definitions Completeness Compactness Separability...
Functional Analysis Franck Sueur 2018-2019 Contents 1 Metric spaces 1 1.1 Definitions........................................ 1 1.2 Completeness...................................... 3 1.3 Compactness......................................
More informationEigenvalues and Eigenvectors
/88 Chia-Ping Chen Department of Computer Science and Engineering National Sun Yat-sen University Linear Algebra Eigenvalue Problem /88 Eigenvalue Equation By definition, the eigenvalue equation for matrix
More information5 Irreducible representations
Physics 129b Lecture 8 Caltech, 01/1/19 5 Irreducible representations 5.5 Regular representation and its decomposition into irreps To see that the inequality is saturated, we need to consider the so-called
More informationMath 102, Winter Final Exam Review. Chapter 1. Matrices and Gaussian Elimination
Math 0, Winter 07 Final Exam Review Chapter. Matrices and Gaussian Elimination { x + x =,. Different forms of a system of linear equations. Example: The x + 4x = 4. [ ] [ ] [ ] vector form (or the column
More informationA Lower Bound Theorem. Lin Hu.
American J. of Mathematics and Sciences Vol. 3, No -1,(January 014) Copyright Mind Reader Publications ISSN No: 50-310 A Lower Bound Theorem Department of Applied Mathematics, Beijing University of Technology,
More informationarxiv:math/ v1 [math.dg] 7 Jun 2004
arxiv:math/46v [math.dg] 7 Jun 4 The First Dirichlet Eigenvalue and Li s Conjecture Jun LING Abstract We give a new estimate on the lower bound for the first Dirichlet eigenvalue for the compact manifolds
More informationMath 302 Outcome Statements Winter 2013
Math 302 Outcome Statements Winter 2013 1 Rectangular Space Coordinates; Vectors in the Three-Dimensional Space (a) Cartesian coordinates of a point (b) sphere (c) symmetry about a point, a line, and a
More informationNon-positivity of the semigroup generated by the Dirichlet-to-Neumann operator
Non-positivity of the semigroup generated by the Dirichlet-to-Neumann operator Daniel Daners The University of Sydney Australia AustMS Annual Meeting 2013 3 Oct, 2013 The Dirichlet-to-Neumann operator
More informationDecomposition of Riesz frames and wavelets into a finite union of linearly independent sets
Decomposition of Riesz frames and wavelets into a finite union of linearly independent sets Ole Christensen, Alexander M. Lindner Abstract We characterize Riesz frames and prove that every Riesz frame
More informationEXAM MATHEMATICAL METHODS OF PHYSICS. TRACK ANALYSIS (Chapters I-V). Thursday, June 7th,
EXAM MATHEMATICAL METHODS OF PHYSICS TRACK ANALYSIS (Chapters I-V) Thursday, June 7th, 1-13 Students who are entitled to a lighter version of the exam may skip problems 1, 8-11 and 16 Consider the differential
More informationMidterm for Introduction to Numerical Analysis I, AMSC/CMSC 466, on 10/29/2015
Midterm for Introduction to Numerical Analysis I, AMSC/CMSC 466, on 10/29/2015 The test lasts 1 hour and 15 minutes. No documents are allowed. The use of a calculator, cell phone or other equivalent electronic
More informationSYMMETRIES IN R 3 NAMITA GUPTA
SYMMETRIES IN R 3 NAMITA GUPTA Abstract. This paper will introduce the concept of symmetries being represented as permutations and will proceed to explain the group structure of such symmetries under composition.
More informationINTRODUCTION TO FINITE ELEMENT METHODS
INTRODUCTION TO FINITE ELEMENT METHODS LONG CHEN Finite element methods are based on the variational formulation of partial differential equations which only need to compute the gradient of a function.
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 informationOn Polygonal Domains with Trigonometric Eigenfunctions of the Laplacian under Dirichlet or Neumann Boundary Conditions
Applied Mathematical Sciences, Vol. 2, 2008, no. 58, 2891-2901 On Polygonal Domains with Trigonometric Eigenfunctions of the Laplacian under Dirichlet or Neumann Boundary Conditions Brian J. M c Cartin
More informationThe Coupling Method with the Natural Boundary Reduction on an Ellipse for Exterior Anisotropic Problems 1
Copyright 211 Tech Science Press CMES, vol.72, no.2, pp.13-113, 211 The Coupling Method with the Natural Boundary Reduction on an Ellipse for Exterior Anisotropic Problems 1 Quan Zheng 2, Jing Wang 2 and
More informationNotes on Special Functions
Spring 25 1 Notes on Special Functions Francis J. Narcowich Department of Mathematics Texas A&M University College Station, TX 77843-3368 Introduction These notes are for our classes on special functions.
More informationFrame expansions in separable Banach spaces
Frame expansions in separable Banach spaces Pete Casazza Ole Christensen Diana T. Stoeva December 9, 2008 Abstract Banach frames are defined by straightforward generalization of (Hilbert space) frames.
More informationDirectional Field. Xiao-Ming Fu
Directional Field Xiao-Ming Fu Outlines Introduction Discretization Representation Objectives and Constraints Outlines Introduction Discretization Representation Objectives and Constraints Definition Spatially-varying
More informationOptimal multilevel preconditioning of strongly anisotropic problems.part II: non-conforming FEM. p. 1/36
Optimal multilevel preconditioning of strongly anisotropic problems. Part II: non-conforming FEM. Svetozar Margenov margenov@parallel.bas.bg Institute for Parallel Processing, Bulgarian Academy of Sciences,
More informationIntrinsic products and factorizations of matrices
Available online at www.sciencedirect.com Linear Algebra and its Applications 428 (2008) 5 3 www.elsevier.com/locate/laa Intrinsic products and factorizations of matrices Miroslav Fiedler Academy of Sciences
More informationA REMARK ON MINIMAL NODAL SOLUTIONS OF AN ELLIPTIC PROBLEM IN A BALL. Olaf Torné. 1. Introduction
Topological Methods in Nonlinear Analysis Journal of the Juliusz Schauder Center Volume 24, 2004, 199 207 A REMARK ON MINIMAL NODAL SOLUTIONS OF AN ELLIPTIC PROBLEM IN A BALL Olaf Torné (Submitted by Michel
More informationarxiv: v1 [math.co] 3 Nov 2014
SPARSE MATRICES DESCRIBING ITERATIONS OF INTEGER-VALUED FUNCTIONS BERND C. KELLNER arxiv:1411.0590v1 [math.co] 3 Nov 014 Abstract. We consider iterations of integer-valued functions φ, which have no fixed
More informationhomogeneous 71 hyperplane 10 hyperplane 34 hyperplane 69 identity map 171 identity map 186 identity map 206 identity matrix 110 identity matrix 45
address 12 adjoint matrix 118 alternating 112 alternating 203 angle 159 angle 33 angle 60 area 120 associative 180 augmented matrix 11 axes 5 Axiom of Choice 153 basis 178 basis 210 basis 74 basis test
More informationON BASICITY OF A SYSTEM OF EXPONENTS WITH DEGENERATING COEFFICIENTS
TWMS J. Pure Appl. Math. V.1, N.2, 2010, pp. 257-264 ON BASICITY OF A SYSTEM OF EXPONENTS WITH DEGENERATING COEFFICIENTS S.G. VELIYEV 1, A.R.SAFAROVA 2 Abstract. A system of exponents of power character
More informationMicrolocal Methods in X-ray Tomography
Microlocal Methods in X-ray Tomography Plamen Stefanov Purdue University Lecture I: Euclidean X-ray tomography Mini Course, Fields Institute, 2012 Plamen Stefanov (Purdue University ) Microlocal Methods
More informationSpectral Processing. Misha Kazhdan
Spectral Processing Misha Kazhdan [Taubin, 1995] A Signal Processing Approach to Fair Surface Design [Desbrun, et al., 1999] Implicit Fairing of Arbitrary Meshes [Vallet and Levy, 2008] Spectral Geometry
More informationInstitut de Recherche MAthématique de Rennes
LMS Durham Symposium: Computational methods for wave propagation in direct scattering. - July, Durham, UK The hp version of the Weighted Regularization Method for Maxwell Equations Martin COSTABEL & Monique
More informationRepresentation theory and quantum mechanics tutorial Spin and the hydrogen atom
Representation theory and quantum mechanics tutorial Spin and the hydrogen atom Justin Campbell August 3, 2017 1 Representations of SU 2 and SO 3 (R) 1.1 The following observation is long overdue. Proposition
More informationMath113: Linear Algebra. Beifang Chen
Math3: Linear Algebra Beifang Chen Spring 26 Contents Systems of Linear Equations 3 Systems of Linear Equations 3 Linear Systems 3 2 Geometric Interpretation 3 3 Matrices of Linear Systems 4 4 Elementary
More informationThe purpose of this lecture is to present a few applications of conformal mappings in problems which arise in physics and engineering.
Lecture 16 Applications of Conformal Mapping MATH-GA 451.001 Complex Variables The purpose of this lecture is to present a few applications of conformal mappings in problems which arise in physics and
More informationNotes on SU(3) and the Quark Model
Notes on SU() and the Quark Model Contents. SU() and the Quark Model. Raising and Lowering Operators: The Weight Diagram 4.. Triangular Weight Diagrams (I) 6.. Triangular Weight Diagrams (II) 8.. Hexagonal
More information3. Which of these numbers does not belong to the set of solutions of the inequality 4
Math Field Day Exam 08 Page. The number is equal to b) c) d) e). Consider the equation 0. The slope of this line is / b) / c) / d) / e) None listed.. Which of these numbers does not belong to the set of
More informationMATH JORDAN FORM
MATH 53 JORDAN FORM Let A,, A k be square matrices of size n,, n k, respectively with entries in a field F We define the matrix A A k of size n = n + + n k as the block matrix A 0 0 0 0 A 0 0 0 0 A k It
More information12x + 18y = 30? ax + by = m
Math 2201, Further Linear Algebra: a practical summary. February, 2009 There are just a few themes that were covered in the course. I. Algebra of integers and polynomials. II. Structure theory of one endomorphism.
More informationMAT 280: Laplacian Eigenfunctions: Theory, Applications, and Computations Lecture 7: Nodal Sets
MAT 280: Laplacian Eigenfunctions: Theory, Applications, and Computations Lecture 7: Nodal Sets Lecturer: Naoki Saito Scribe: Bradley Marchand/Allen Xue April 20, 2007 Consider the eigenfunctions v(x)
More informationThe Simplest Semidefinite Programs are Trivial
The Simplest Semidefinite Programs are Trivial Robert J. Vanderbei Bing Yang Program in Statistics & Operations Research Princeton University Princeton, NJ 08544 January 10, 1994 Technical Report SOR-93-12
More informationMathematical Modeling using Partial Differential Equations (PDE s)
Mathematical Modeling using Partial Differential Equations (PDE s) 145. Physical Models: heat conduction, vibration. 146. Mathematical Models: why build them. The solution to the mathematical model will
More informationNumerical tensor methods and their applications
Numerical tensor methods and their applications 8 May 2013 All lectures 4 lectures, 2 May, 08:00-10:00: Introduction: ideas, matrix results, history. 7 May, 08:00-10:00: Novel tensor formats (TT, HT, QTT).
More informationENERGY NORM A POSTERIORI ERROR ESTIMATES FOR MIXED FINITE ELEMENT METHODS
ENERGY NORM A POSTERIORI ERROR ESTIMATES FOR MIXED FINITE ELEMENT METHODS CARLO LOVADINA AND ROLF STENBERG Abstract The paper deals with the a-posteriori error analysis of mixed finite element methods
More informationConvexity of the Joint Numerical Range
Convexity of the Joint Numerical Range Chi-Kwong Li and Yiu-Tung Poon October 26, 2004 Dedicated to Professor Yik-Hoi Au-Yeung on the occasion of his retirement. Abstract Let A = (A 1,..., A m ) be an
More informationOn John type ellipsoids
On John type ellipsoids B. Klartag Tel Aviv University Abstract Given an arbitrary convex symmetric body K R n, we construct a natural and non-trivial continuous map u K which associates ellipsoids to
More informationScientific Computing
2301678 Scientific Computing Chapter 2 Interpolation and Approximation Paisan Nakmahachalasint Paisan.N@chula.ac.th Chapter 2 Interpolation and Approximation p. 1/66 Contents 1. Polynomial interpolation
More informationLINEAR ALGEBRA BOOT CAMP WEEK 4: THE SPECTRAL THEOREM
LINEAR ALGEBRA BOOT CAMP WEEK 4: THE SPECTRAL THEOREM Unless otherwise stated, all vector spaces in this worksheet are finite dimensional and the scalar field F is R or C. Definition 1. A linear operator
More informationExercises for Chapter 1
Solution Manual for A First Course in Abstract Algebra, with Applications Third Edition by Joseph J. Rotman Exercises for Chapter. True or false with reasons. (i There is a largest integer in every nonempty
More informationChapter 2 The Group U(1) and its Representations
Chapter 2 The Group U(1) and its Representations The simplest example of a Lie group is the group of rotations of the plane, with elements parametrized by a single number, the angle of rotation θ. It is
More informationLecture Semidefinite Programming and Graph Partitioning
Approximation Algorithms and Hardness of Approximation April 16, 013 Lecture 14 Lecturer: Alantha Newman Scribes: Marwa El Halabi 1 Semidefinite Programming and Graph Partitioning In previous lectures,
More informationLinear Algebra. Paul Yiu. 6D: 2-planes in R 4. Department of Mathematics Florida Atlantic University. Fall 2011
Linear Algebra Paul Yiu Department of Mathematics Florida Atlantic University Fall 2011 6D: 2-planes in R 4 The angle between a vector and a plane The angle between a vector v R n and a subspace V is the
More informationMath 660-Lecture 15: Finite element spaces (I)
Math 660-Lecture 15: Finite element spaces (I) (Chapter 3, 4.2, 4.3) Before we introduce the concrete spaces, let s first of all introduce the following important lemma. Theorem 1. Let V h consists of
More informationFinal: Solutions Math 118A, Fall 2013
Final: Solutions Math 118A, Fall 2013 1. [20 pts] For each of the following PDEs for u(x, y), give their order and say if they are nonlinear or linear. If they are linear, say if they are homogeneous or
More information# Points Score Total 100
Name: PennID: Math 241 Make-Up Final Exam January 19, 2016 Instructions: Turn off and put away your cell phone. Please write your Name and PennID on the top of this page. Please sign and date the pledge
More informationTwo new enriched multiscale coarse spaces for the Additive Average Schwarz method
346 Two new enriched multiscale coarse spaces for the Additive Average Schwarz method Leszek Marcinkowski 1 and Talal Rahman 2 1 Introduction We propose additive Schwarz methods with spectrally enriched
More informationEfficient packing of unit squares in a square
Loughborough University Institutional Repository Efficient packing of unit squares in a square This item was submitted to Loughborough University's Institutional Repository by the/an author. Additional
More informationAn additive average Schwarz method for the plate bending problem
J. Numer. Math., Vol. 10, No. 2, pp. 109 125 (2002) c VSP 2002 Prepared using jnm.sty [Version: 02.02.2002 v1.2] An additive average Schwarz method for the plate bending problem X. Feng and T. Rahman Abstract
More informationA posteriori error estimates for non conforming approximation of eigenvalue problems
A posteriori error estimates for non conforming approximation of eigenvalue problems E. Dari a, R. G. Durán b and C. Padra c, a Centro Atómico Bariloche, Comisión Nacional de Energía Atómica and CONICE,
More informationIsomorphisms between pattern classes
Journal of Combinatorics olume 0, Number 0, 1 8, 0000 Isomorphisms between pattern classes M. H. Albert, M. D. Atkinson and Anders Claesson Isomorphisms φ : A B between pattern classes are considered.
More informationSpectra of Adjacency and Laplacian Matrices
Spectra of Adjacency and Laplacian Matrices Definition: University of Alicante (Spain) Matrix Computing (subject 3168 Degree in Maths) 30 hours (theory)) + 15 hours (practical assignment) Contents 1. Spectra
More informationQR FACTORIZATIONS USING A RESTRICTED SET OF ROTATIONS
QR FACTORIZATIONS USING A RESTRICTED SET OF ROTATIONS DIANNE P. O LEARY AND STEPHEN S. BULLOCK Dedicated to Alan George on the occasion of his 60th birthday Abstract. Any matrix A of dimension m n (m n)
More informationTEST CODE: MMA (Objective type) 2015 SYLLABUS
TEST CODE: MMA (Objective type) 2015 SYLLABUS Analytical Reasoning Algebra Arithmetic, geometric and harmonic progression. Continued fractions. Elementary combinatorics: Permutations and combinations,
More informationMath 350 Fall 2011 Notes about inner product spaces. In this notes we state and prove some important properties of inner product spaces.
Math 350 Fall 2011 Notes about inner product spaces In this notes we state and prove some important properties of inner product spaces. First, recall the dot product on R n : if x, y R n, say x = (x 1,...,
More informationConsistency Estimates for gfd Methods and Selection of Sets of Influence
Consistency Estimates for gfd Methods and Selection of Sets of Influence Oleg Davydov University of Giessen, Germany Localized Kernel-Based Meshless Methods for PDEs ICERM / Brown University 7 11 August
More informationA 3 3 DILATION COUNTEREXAMPLE
A 3 3 DILATION COUNTEREXAMPLE MAN DUEN CHOI AND KENNETH R DAVIDSON Dedicated to the memory of William B Arveson Abstract We define four 3 3 commuting contractions which do not dilate to commuting isometries
More informationSuperconvergence of discontinuous Galerkin methods for 1-D linear hyperbolic equations with degenerate variable coefficients
Superconvergence of discontinuous Galerkin methods for -D linear hyperbolic equations with degenerate variable coefficients Waixiang Cao Chi-Wang Shu Zhimin Zhang Abstract In this paper, we study the superconvergence
More informationDiscrete Geometry. Problem 1. Austin Mohr. April 26, 2012
Discrete Geometry Austin Mohr April 26, 2012 Problem 1 Theorem 1 (Linear Programming Duality). Suppose x, y, b, c R n and A R n n, Ax b, x 0, A T y c, and y 0. If x maximizes c T x and y minimizes b T
More information1 Last time: least-squares problems
MATH Linear algebra (Fall 07) Lecture Last time: least-squares problems Definition. If A is an m n matrix and b R m, then a least-squares solution to the linear system Ax = b is a vector x R n such that
More informationOn the approximation of the principal eigenvalue for a class of nonlinear elliptic operators
On the approximation of the principal eigenvalue for a class of nonlinear elliptic operators Fabio Camilli ("Sapienza" Università di Roma) joint work with I.Birindelli ("Sapienza") I.Capuzzo Dolcetta ("Sapienza")
More information