ANISOTROPIC MEASURES OF THIRD ORDER DERIVATIVES AND THE QUADRATIC INTERPOLATION ERROR ON TRIANGULAR ELEMENTS

Size: px
Start display at page:

Download "ANISOTROPIC MEASURES OF THIRD ORDER DERIVATIVES AND THE QUADRATIC INTERPOLATION ERROR ON TRIANGULAR ELEMENTS"

Transcription

1 SIAM J. SCI. COMPUT. Vol. 29, No. 2, pp c 2007 Society for Industrial and Applied Mathematics ANISOTROPIC MEASURES OF THIRD ORDER DERIVATIVES AND THE QUADRATIC INTERPOLATION ERROR ON TRIANGULAR ELEMENTS WEIMING CAO Abstract. The main purpose of this paper is to present a closer look at how the H - and L 2 -errors for quadratic interpolation on a triangle are determined by the triangle geometry and the anisotropic behavior of the third order derivatives of interpolated functions. We characterize quantitatively the anisotropic behavior of a third order derivative tensor by its orientation and anisotropic ratio. Both exact error formulas and numerical experiments are presented for model problems of interpolating a cubic function u at the vertices and the midpoints of three sides of a triangle. Based on the study on model problems, we conclude that when an element is aligned with the orientation of 3 u, the aspect ratio leading to nearly the smallest H - and L 2 -norms of the interpolation error is approximately equal to the anisotropic ratio of 3 u. With this alignment and aspect ratio taken, the H -seminorm of the error is proportional to the reciprocal of the anisotropic ratio of 3 u, the L 2 -norm of the error is proportional to the 3 th power of the anisotropic ratio, 2 and both of them are insensitive to the internal angles of the element. Key words. alignment anisotropic mesh, quadratic interpolation, anisotropic ratio, aspect ratio, mesh AMS subject classifications. 65D05, 65L50, 65N5, 65N50 DOI. 0.37/ Introduction. In anisotropic mesh generation and refinement, elements or cells can be of different length scales in different directions in order to better fit the behavior of the interpolated functions or the properties of the PDEs to be solved. There are two anisotropic characters of a triangular element. One is the orientation, which is roughly the direction of its longest side. The other is the aspect ratio, which measures how long and thin the triangle is. For linear interpolation over triangular meshes, the error is determined by the Hessian 2 u of the interpolated function u. There have been extensive studies on the optimal shape and orientation for minimizing the linear interpolation error in various norms. For instance, Nadler [6] studied the model problem of linear interpolation of quadratic functions and concluded that the optimal triangle for minimizing the L 2 -error is an equilateral under the Hessian metric. Rippa [7] concluded that to minimize the L p -error for linear interpolation, the triangular elements should be long and thin in the direction where the second order directional derivative of u is small. D Azevedo and Simpson [, 2] made similar conclusions for the maximum error and maximum derivative error in linear interpolation. They also developed several strategies for the anisotropic mesh generation and refinement based on 2 u [, 9]. Shewchuk [8] summarized various formulas for the linear interpolation error on a triangle in terms of its area and edge lengths. In [6] the author expresses the H - and L 2 -errors for the linear interpolation of a quadratic function u on a triangle K in terms of the size, orientation, and aspect ratio of K, and Received by the editors June 28, 2005; accepted for publication (in revised form) October 25, 2006; published electronically April 0, This work was supported in part by the NSF through grant DMS Department of Mathematics, University of Texas at San Antonio, San Antonio, TX (wcao@math.utsa.edu). 756

2 QUADRATIC INTERPOLATION ERROR ON TRIANGLE 757 the eigenvalues and eigenvectors of 2 u. It is identified that among all possible triangles of a fixed area, the smallest H -seminorm of the interpolation error is attained with the acute isosceles triangle that is aligned with the eigenvector (associated with the smaller eigenvalue) of 2 u, and has an aspect ratio 0.8 λ 2 /λ, where λ λ 2 are the eigenvalues of 2 u. For general triangular elements aligned with 2 u without the restriction on the maximum internal angles, the best aspect ratio for the H -error is about λ 2 /λ. This is also the best aspect ratio for minimizing the L 2 -error. Meanwhile, there have been quite a few papers on generalizing the classical interpolation error estimates on quasi-uniform meshes to those on anisotropic meshes. For instance, Formaggia and Perotto [3], Huang [4], Huang and Sun [5], Chen, Sun, and Xu [8], and Chen and Xu [9] derived various estimates for the W m,p -norm of the error for linear interpolation of general functions. They conclude similarly that the mesh leading to the smallest error bound is the one where all elements are aligned with the eigenvector of 2 u, and their aspect ratios are approximately equal to the square root of the ratio of the eigenvalues of 2 u. Chen, Sun, and Xu [8] further proved that their estimate of the L p -error is optimal for the class of functions with positive Hessians. In the case of quadratic interpolation, the understanding of the interplay between the geometric feature of elements and the anisotropic feature of interpolated functions has been mostly qualitative and crude [8]. As pointed by Apel in [], a more precise understanding of their effects on the interpolation errors relies on sufficiently fine description of the properties of the interpolated functions. We introduced in [7] two quantities to measure the anisotropic characters of third order and higher derivative tensors. One is the orientation, along which the absolute value of the higher order directional derivative is about the smallest, while along its perpendicular direction it is about the largest. Another is the anisotropic ratio, which measures the strength of the anisotropic behavior, or how differently the directional derivative behaves in different directions. These measures are invariant under rotation and translation of the coordinates. We also derived an interpolation error estimate in terms of these anisotropic measures and identified the optimal alignment direction and aspect ratio which minimize an upper bounds of the error estimate; see [7] for details. In this paper, we take a closer look at how the H - and L 2 -errors for quadratic interpolation on a triangle are determined by the triangle geometry and the anisotropic features of 3 u. Since any smooth function can be approximated locally by a cubic function to a higher order accuracy than by a quadratic function, we simplify our local error analysis over an element by assuming the interpolated functions u are cubics. Unfortunately, unlike the case of linear interpolation studied in [6], a closed formula for the quadratic interpolation error in terms of the magnitude, orientation, and anisotropic ratio of 3 u turns out to be too complicated. Nevertheless, for isosceles triangles that are aligned with 3 u, we are able to get some handy formulas for the H - and L 2 -norms of the error. It is found from these formulas that when a triangle is aligned with the orientation of 3 u, the optimal aspect ratio for minimizing both H - and L 2 -norms of the quadratic interpolation error is approximately equal to the anisotropic ratio of 3 u. This is true regardless of whether the element is an acute or an obtuse isosceles triangle. Therefore, in contrast to the case of linear interpolations, there seems to be no superaccuracy in favor of acute isosceles triangles for quadratic interpolations of general cubic functions; see [8]. For general triangle shape and orientations, we study numerically the effects of element alignment, aspect ratio, and internal angles on the H - and L 2 -norms of the interpolation errors. It is found that

3 758 WEIMING CAO (i) the interpolation error is nearly the smallest when an element is aligned with the orientation of 3 u; (ii) when an element is aligned with 3 u, the optimal aspect ratio is about equal to the anisotropic ratio of 3 u. With this aspect ratio, the H - seminorm of the interpolation error is proportional to the magnitude of 3 u and to the reciprocal of the anisotropic ratio of 3 u. The L 2 -norm of the error is proportional to the magnitude of 3 u and to the 3 2 th power of the anisotropic ratio of 3 u. (iii) When proper alignment and proper aspect ratio are maintained, the H -error is insensitive to the internal angles of the element. Otherwise, it increases as the largest internal angle of the element increases. In this situation the maximum angle condition is essential. The L 2 -error is always insensitive to the internal angles. An outline of this paper is as follows: We first explain in sections 2 and 3 how to measure the orientation and aspect ratio of a triangle, and how to define the orientation and anisotropic ratio of 3 u. Then we derive in section 4 the exact formulas for the H - and L 2 -norms of the error for quadratic interpolation of cubic functions on a triangle. In section 5 we study the special case with isosceles triangles that are aligned with the orientation of 3 u. In this case the H - and L 2 -errors can be expressed in simple formulas, and optimal aspect ratios can be identified. For general triangular elements we present a numerical study in section 6 on the effects of the element shape and orientation. We conclude this paper with a few discussions. 2. Anisotropic character of a triangular element. We first recall the definitions of orientation and aspect ratio for a triangular element described in [6]. Let ˆK be the standard element with vertices ξ =(0, ), ξ 2 =( 3 2, 2 ), ξ 3 =( 3 2, 2 ). Let K be a general triangular element with vertices x, x 2, and x 3. Let x c = 3 (x +x 2 +x 3 ) be the center of K. The affine mapping from ˆK to K can be expressed as x = F ξ+x c with ( ) F = 3 (x x 3 ), x 2 x c. Denote by F = UΣV the singular value decomposition (SVD) of matrix F. Without loss of generality, we assume Σ = diag(σ,σ 2 ) with σ σ 2 > 0, and U = R φu and V = R φv are the matrices for rotation transform by angles φ u and φ v (counterclockwise), respectively. The mapping x = F ξ transforms ˆK into a triangle centered at the origin. It also transforms the unit circle on the ξη-plane into an ellipse on the xy-plane, with σ and σ 2 being its semimajor and semiminor axes; see Figure. It is easy to see that φ u determines the direction of the semimajor axis of the ellipse. We define this direction as the orientation of triangle K. We define the aspect ratio of K as r = σ σ 2. These definitions are equivalent to the commonly used definition of orientation based on the longest side of K and the definition of aspect ratio based on the diameter of K and the radius of the inscribed circle of K. The angle φ v in the SVD of mapping F determines the internal angles of K. In particular, K is an obtuse isosceles triangle when φ v = 0 and an acute isosceles triangle when φ v = π/2. If K is an obtuse/acute isosceles triangle, then its orientation is parallel/perpendicular to its base. 3. Anisotropic measures of third order derivatives. By Taylor s expansion, any smooth function u can be approximated locally by lower order polynomials, u(x, y) = m j=0 j! [(x x c) ] j u(x c )+O( x x c m+ ).

4 QUADRATIC INTERPOLATION ERROR ON TRIANGLE 759 (a) (b) φ v (c) (d) σ 2 φ u σ Fig.. (a) standard element ˆK; (b) ˆK under R φv ; (c) ˆK under ΣR φ v ; (d) ˆK under F = R φu ΣR φ v. Let Π m be an interpolation operator that preserves the set of polynomials of total degree m. Then the leading term of the interpolation error u Π m u is equal to the interpolation error for polynomial m! ((x x c) ) m u(x c ), which is controlled by the partial derivative tensor m u(x c ). To understand the local behavior of the interpolation error around x c, we need to measure the anisotropic behavior of m u. Recall that there are three quantities, the area, orientation, and aspect ratio, to characterize the geometric features of a triangular element. We introduced in [7] three quantities to characterize the anisotropic behavior of m u. The first one is its magnitude, which is equivalent to the Frobenius norm of m u. The second is the orientation, along which direction the absolute value of the mth order directional derivative at x c is about the smallest, while along its perpendicular direction it is about the largest. The third quantity is the anisotropic ratio, which measures the strength of the anisotropic behavior of m u at x c. These quantities are determined by the distribution of the mth order directional derivatives. They are invariant under the rotation and translation transforms of the independent variables of u. We describe below in detail these definitions in the cases of m =2, Anisotropic measure of 2 u. We start from the case of 2 u, which will be needed for introducing the anisotropic measures of 3 u. Note that 2 u(x c )isa 2 2 symmetric matrix; it admits the eigendecomposition [ ] 2 λ (3.) u = R φ R T λ 2 φ, where λ λ 2, and R φ is the matrix for rotation with angle φ [ π 2, π 2 ] counterclockwise. The two eigenvectors of 2 u are v = [cos φ, sin φ] T and v 2 = v, which are in the directions of angle φ and φ + π 2 from the x-axis. When λ /λ 2 is small, the absolute value of the second order directional derivative is about the smallest along v, and it is the largest along its perpendicular direction. We define v as the orientation of 2 u at x c. Furthermore, we define the anisotropic ratio of 2 u as S( 2 λ 2 u) S 2 λ

5 760 WEIMING CAO and define the magnitude of 2 u as 2 u D 2 2 ( λ + λ 2 ). Clearly, S 2. The larger S 2 is, the stronger the anisotropic behavior of 2 u. Since 2 λ 2 D 2 λ 2, the magnitude 2 u is equivalent to the 2-norm, and hence the Frobenius norm, of 2 u. The above definition of the orientation, anisotropic ratio, and magnitude for 2 u can be interpreted geometrically in terms of the level curves of the following polynomial: p 2 (ξ,η) = 2 (ξ )2 u(x c ), where ξ =[ξ,η] T. For ξ =,p 2 (ξ,η) is one half of the second order directional derivative along ξ for u at x c. We first consider the case λ λ 2 < 0 (assume, more specifically, λ 0 and λ 2 0.) Let (r, t) be the polar coordinates of (ξ,η). Then by the eigendecomposition (3.) for 2 u, [ ] p 2 (ξ,η) = 2 (RT φ ξ) λ (R λ φ T (3.2) ξ) 2 = 2 r2 [λ cos 2 (t φ)+λ 2 sin 2 (t φ)]. Let α = tan ( λ λ 2 ). Then α [0, π 4 ] for λ λ 2, and Therefore, λ sin 2 α = λ + λ 2, cos2 α = λ + λ 2. p 2 (ξ,η)= 2 r2 ( λ + λ 2 ) [sin 2 α cos 2 (t φ) cos 2 α sin 2 (t φ)] = 2 r2 ( λ + λ 2 ) sin(α + t φ) sin(α t + φ). Clearly, p 2 (ξ,η) = 0 along the lines of angles φ + α + kπ and φ α + kπ from the ξ-axis. Let β β 2 be the two angles among them that lie in ( π/2,π/2]. Then we can express p 2 as p 2 (ξ,η) = ± 2 r2 ( λ + λ 2 ) sin(t β ) sin(t β 2 ) (3.3) = ± 2 r2 ( λ + λ 2 ) (cos t sin β sin t cos β ) (cos t sin β 2 sin t cos β 2 ) = ±D 2 l (ξ,η) l 2 (ξ,η), where D 2 = 2 ( λ + λ 2 ), and λ 2 (3.4) l i (ξ,η) =ξ sin β i η cos β i, i =, 2. We are ready to see that the orientation of 2 u is just the bisection direction of the smaller sector formed by the level-0 lines of p 2 (ξ,η); see Figure 2(a). The angle φ in (3.) for this direction can be expressed as φ = (β + β), 2

6 QUADRATIC INTERPOLATION ERROR ON TRIANGLE 76 case (a) case (b) l * 2 (ξ,η)=0 l (ξ,η)=0 l 2 (ξ,η)=0 l * (ξ,η)=0 α α β 2 φ α α β β 2 φ β Fig. 2. Contour lines of p 2 (ξ, η) and the orientation (bold line) of 2 u. (a) p 2 (ξ, η) has two linear factors. Here β = β 2 and β = β + π. (b) p 2 (ξ, η) does not change sign for all (ξ, η). l and l 2 are the linear factors of the associated polynomial p 2. Here β = β and β = β 2. where [β, β] is the smaller interval between [β,β 2 ] and [β 2,β + π]. Furthermore, the anisotropic ratio S( 2 u)= λ2 λ can be expressed in terms of the opening β β =2α of the smaller sector as S( 2 u) = cot α = cot(( β β)/2). The magnitude 2 u of 2 u is just the coefficient D 2 in the factoring (3.3) of p 2. Algebraically, λ λ 2 0 corresponds to the case where p 2 (,z) has two real roots z i = tan(β i ). Now we consider the case λ λ 2 > 0. In this case, p 2 (,z) has two conjugate complex roots, and p 2 (ξ,η) does not change sign for all (ξ,η). In this case, we introduce matrix [ ] λ (3.5) Ĥ = R φ λ 2 R T φ and define an associated polynomial p 2(ξ,η) = 2 (ξ Ĥξ); see Figure 2(b). Clearly, p 2 can be factored into the product of two linear functions l and l 2 as in (3.4). Since the magnitude, orientation, and anisotropic ratio of 2 u are identical to those of Ĥ, we can determine them equivalently by the level-0 lines for p 2 as in the case with λ λ 2 < 0. In summary, if p 2 (ξ,η) can be factored into the product of two linear functions, then the orientation and anisotropic ratio of 2 u can be determined by the level-0 lines of p 2 (ξ,η). Otherwise, they can be determined equivalently by the level-0 lines of p 2(ξ,η) defined by Ĥ in (3.5). In particular, the level-0 lines of p 2 or p 2 are of angles ±α = ± tan ( λ /λ 2 ) from the eigenvector v of 2 u Anisotropic measure of 3 u. To characterize the anisotropic behavior of 3 u at a point x c, we study p 3 (ξ) = 3! (ξ )3 u(x c ). For ξ =,p 3 (ξ) is one sixth of the third order directional derivative along ξ for u at x c. Since p 3 (ξ) is an homogeneous polynomial, we may write p 3 (ξ,η) =ξ 3 p 3 (,η/ξ),

7 762 WEIMING CAO with p 3 (,z) being a real polynomial of degree 3. p 3 (,z) can be factored into the product of linear polynomials and/or a positive quadratic polynomial of z. Therefore, we may factor p 3 (ξ,η) into either the product of three linear functions or the product of a linear function and a positive, homogeneous, quadratic function of ξ,η. We discuss the former case first. Assume (3.6) p 3 (ξ,η) =D 3 l (ξ,η) l 2 (ξ,η) l 3 (ξ,η), where D 3 0, and each l i is a linear function of the form (3.4) with π 2 <β β 2 β 3 π 2. These factors can be easily determined by the roots of p 3 (,z) = 0. Indeed, tan β i s are just the roots of p 3 (,z) = 0. Clearly, l i (ξ,η) =0, i =, 2, 3, are the level-0 lines of p 3. We define the magnitude of 3 u as 3 u = D 3. This is an upper bound of all the third order directional derivatives at x c. It is not difficult to show that 3 u is equivalent to the Frobenius norm of 3 u [7]. Moreover, when all three level- 0 lines of p 3 are close to a common direction, the absolute value of the third order directional derivative of u is about the smallest along this direction, while it is about the largest along its perpendicular direction. In this case, 3 u is strongly anisotropic. To determine the common direction to which the level-0 lines are all close, we consider the three sectors formed by every other line of l i = 0 for i =, 2, 3; see Figure 3(a). The ranges of the central angle of these sectors are, respectively, (3.7) [β,β 3 ], [β 2,β + π], [β 3,β 2 + π]. Let [β, β] be the shortest interval among the three of (3.7). Clearly, β β 2π 3. If β β, all the level-0 lines of p 3 (ξ,η) are close to the direction of angle φ = 2 (β+β) from the ξ-axis. We define this direction as the orientation of 3 u. Furthermore, the smaller β β is, the stronger the anisotropic behavior of 3 u. Hence, we define the anisotropic ratio of 3 u as S 3 S( 3 u) max(, cot(( β β)/2)). The artificial cutoff of S( 3 u) at the value reflects the fact that we consider only stretching an element in two perpendicular directions in anisotropic mesh refinements. When β β π 2, rescaling an element in two perpendicular directions (while keeping the area fixed) has little advantage in reducing the H -norm of the interpolation error; see Remark 2 in section 5 below. Therefore, we simply consider in this case that 3 u is isotropic and its anisotropic ratio S( 3 u)=. Next we study the case where p 3 (ξ,η) is the product of a linear function and a positive, homogeneous, quadratic function. Assume p 3 (ξ,η) =l 3 (ξ,η) q(ξ,η), where l 3 (ξ,η) is in the form of (3.4), and q(ξ,η) > 0 for all ξ 0. q = 2 ξt Qξ, where Q is the Hessian of q. Decompose Q into (3.8) Q = R [ λ λ 2 ] R T, We write

8 QUADRATIC INTERPOLATION ERROR ON TRIANGLE 763 case (a) l 3 (ξ,η)=0 case (b) l 3 (ξ,η)=0 l 2 (ξ,η)=0 l * 2 (ξ,η)=0 α α φ β 3 β 2 β α α φ β 2 β 3 β l (ξ,η)=0 l * (ξ,η)=0 case (c) l * 2 (ξ,η)=0 l * (ξ,η)=0 α α φ β β 2 β 3 l 3 (ξ,η)=0 Fig. 3. Contour lines of p 3 = 3! (ξ )3 u and the orientation (bold line) of 3 u. (a) p 3 has three linear (real) factors. (b) p 3 has a linear factor l 3 (ξ, η) and a positive quadratic factor q(ξ, η). l 3 =0lies inside the level-0 lines of q (ξ, η). (c) p 3 has a linear factor l 3 (ξ, η) and a positive quadratic factor q(ξ, η). l 3 =0lies outside the level-0 lines of q (ξ, η). where R is an orthogonal matrix, and 0 <λ λ 2. As explained in the previous subsection, the anisotropic feature of q(ξ,η) is identical to that of q (ξ,η) = 2 ξ ˆQξ, where [ λ (3.9) ˆQ = R R λ2] T. Therefore, we define the magnitude, orientation, and anisotropic ratio of 3 u based on (3.0) p 3(ξ,η) =l 3 (ξ,η) q (ξ,η); see Figure 3(b) and 3(c). Since p 3(ξ,η) can be factored into the product of three linear functions l,l 2, and l 3, these anisotropic measures can be determined by the position of the three level-0 lines of p 3. An important feature about the above definitions of magnitude, anisotropic ratio, and orientation for 3 u is that they are invariant under translation and rotation transforms of the independent variables of u. Remark. The above definitions of the anisotropic measures can be generalized to the case of m u for m>3; see [7]. Indeed, since p m (ξ,η) = m! (ξ )m u is

9 764 WEIMING CAO an homogeneous polynomial, we may write p m (ξ,η) =ξ m p m (,η/ξ), with p m (,z) being a real polynomial of degree m. By the fundamental theorem of algebra, p m (,z) can be factored into the product of linear functions and/or positive quadratic functions of z. Therefore, p m (ξ,η) can be factored into the product of linear functions and/or positive, homogeneous, quadratic functions of ξ,η. We may convert each positive quadratic function q(ξ,η) intoq (ξ,η). Then the magnitude, orientation, and anisotropic ratio of m u can be determined by the positions of the level-0 lines of p m(ξ,η) Examples for anisotropic measures. We give several examples to demonstrate how to calculate the orientation and anisotropic ratio of 3 u. Assume ɛ is a small positive number. Example. u(x, y) =y 3 +(ɛx) 3. Here p 3 (ξ,η) = 3! (ξ )3 u = η 3 +(ɛξ) 3 =(η + ɛξ)(η 2 ɛξη + ɛ 2 ξ 2 ), which is the product of a linear function and a positive quadratic function. q(ξ,η) =η 2 ɛξη + ɛ 2 ξ 2. Then 2 q = [ ] 2ɛ 2 ɛ. ɛ 2 Let The eigenvalues of 2 q are λ =(ɛ 2 +) ɛ 4 ɛ 2 + (ɛ 2 +) ( ɛ 2 /2) = 3ɛ 2 /2, λ 2 =(ɛ 2 +)+ ɛ 4 ɛ 2 + (ɛ 2 +)+( ɛ 2 /2) = 2 + ɛ 2 /2. The eigenvector of 2 q, associated with the smaller eigenvalue λ, is v =[, (ɛ 2 + ɛ 4 ɛ 2 +)/ɛ] T [,ɛ/2] T. Note that the level-0 lines of q (ξ,η) are along the angles φ ± α from the x-axis, where φ tan ( ɛ 2 ) is the angle of v and α = tan λ λ 2. Thus in this case the two level-0 lines of q (ξ,η) are along the angles tan ( ɛ 2 ) ± tan 3ɛ ( 2 4+ɛ ) ɛ 2 2 ± 3 2 ɛ. Combining the direction of linear factor y + ɛx = 0, we have the three level-0 lines of p 3(ξ,η) in approximately the directions of angle ɛ, 3 2 ɛ and ɛ, which implies β ɛ and β ɛ. Therefore, the orientation of 3 u is and the anisotropic ratio is φ = 2 (β + β) + 3 ɛ, 4 S( 3 u) = cot( 2 ( β β)) ɛ. Example 2. u(x, y) =(x + y) 3 + ɛ(x 3 + y 3 ). Here p 3 (ξ,η) =(ξ + η) 3 + ɛ(ξ 3 + η 3 ) =(ξ + η) [( + ɛ)ξ 2 +(2 ɛ)ξη +(+ɛ)η 2 ],

10 QUADRATIC INTERPOLATION ERROR ON TRIANGLE [S 3 ] φ+π/ ε Fig. 4. Example 3: The anisotropic ratio S 3 and orientation φ + π 4 versus parameter ɛ. which is the product of a linear function and a positive quadratic function. q(ξ,η) =(+ɛ)ξ 2 +(2 ɛ)ξη +(+ɛ)η 2. Then 2 q = [ ] 2+2ɛ 2 ɛ. 2 ɛ 2+2ɛ Let Its two eigenvalues are 3ɛ and 4 + ɛ, and the eigenvector associated with the smaller eigenvalue is [, ]. Therefore, the two level-0 lines of q (ξ,η) are along angles tan ( ) ± tan 3ɛ 4+ɛ. Together with the level-0 line x + y = 0 due to the linear factor, we are ready to see that the orientation of 3 u is along angle φ = tan ( ) = π 4, and the anisotropic ratio is S( 3 u) = cot [ tan ( 3ɛ 4+ɛ )] 2 Example 3. u(x, y) =(x+y) 3 +ɛ(x 3 y 3 ). In this case, p 3 (ξ,η) =(ξ +η) 3 +ɛ(ξ 3 η 3 ), which is again the product of a linear function and a positive quadratic function. However, the asymptotic analysis for the level-0 lines of p (ξ,η) is rather complicated. Instead we use a numerical method to determine the angles of the orientation and the anisotropic ratio; see Figure 4. It turns out that the orientation is still close to the line y + x = 0, but the anisotropic ratio is of the magnitude O( 3 ɛ ). 4. Quadratic interpolation error. In this section, we study the model problem of interpolating a cubic function by quadratic polynomials at the three vertices and the midpoints of three sides of a triangular element K. We derive the exact formulas for the H -seminorm and L 2 -norm of the interpolation error. Let x, x 2, and x 3 be the vertices of K (numbered counterclockwise), and let l = x 3 x 2, l 2 = x x 3, l 3 = x 2 x. Let c i (x, y), i =, 2, 3, be the barycentric coordinates of a point (x, y) ink. We call a triple index (i, j, k) in cyclic order if it is one of the 3ɛ.

11 766 WEIMING CAO following three: (, 2, 3), (2, 3, ), (3,, 2). For (i, j, k) in cyclic order, define (4.) b 0 = c c 2 c 3 and b i = c j c k (c j c k ), i =, 2, 3. We are ready to see that b i s are linearly independent. Let u be a cubic function, and let Π 2 u be its quadratic interpolation at the vertices and side midpoints of K. Then the error e = u Π 2 u can be expressed as (4.2) e = 3 v i b i (x, y). i=0 To determine the constants v i,0 i 3, we first list a few basic formulas. Their proofs are elementary. Lemma 4.. Let τ i = l i / l i, and let n i be the unit outward normal on the side l i. Then we have c i = l i (4.3) 2 K n i, 0 if i = j, (4.4) τ i c j = if (i, j) =(, 2), (2, 3), (3, ), l i + if (i, j) =(2, ), (3, 2), (, 3). l i (4.5) Lemma b i τ 3 i 3 b i τ 3 j = 2 l i 3 i =, 2, 3, =0 i j. Note that Π 2 u is of degree 2, and we get from the above two lemmas that (4.6) v i = l i u, i =, 2, 3. τ 3 i Next we determine the coefficient v 0. It is natural to consider the symmetric differentiation 3 τ τ 2τ 3 on both sides of (4.2). However, since (4.7) 3 b 0 τ τ 2 τ 3 = 0 and 3 b i 4 =, i =, 2, 3, τ τ 2 τ 3 l l 2 l 3 this operation leads only to an identity (4.8) 3 u = τ τ 2 τ 3 3 l l 2 l 3 3 i= l i 3 3 u τi 3. Therefore, we consider taking the following operation on both sides of (4.2): (4.9) L = 3 τ 2 τ τ 2 2τ τ 2 3τ.

12 (4.0) QUADRATIC INTERPOLATION ERROR ON TRIANGLE 767 Lemma 4.3. Let (i, j, k) be in cyclic order. Then 3 b 0 τ 2 = 2 i τ j l i 2 l j, 3 b 0 τ 2 = +2 i τ k l i 2 l k, 3 b i τ 2 = 6 i τ j l i 2 l j, 3 b i τ i τ 2 = +2 j l i l j 2, 3 b i τ 2 = 6 i τ k l i 2 l k, 3 b i τ i τ 2 k 3 b i τ 2 = 2 jτ k l j 2 l k, 3 b i τ j τ 2 k We have from the above formulas that Lb 0 = = +2 l i l k 2, = 2 l j l k 2. 2 l 2 l l 2 2 l l 3 2 l and (4.) Lb i = 6 l i 2 l j + 2 l j 2 l k + +2 l k 2, i =, 2, 3. l i Now the coefficient v 0 can be solved from which yields (4.2) 3 Lu = v 0 Lb 0 + v i Lb i, i= ( ) 3 v 0 = Lu v i Lb i /Lb 0. i= Now we derive the formulas for the H -seminorm and L 2 -norm of the interpolation error. Clearly, (4.3) e 2 dxdy = v B v, K where v =[v 0,v,v 2,v 3 ] T, and B = ( K b i b j dxdy ). By the identity [0] α (c ) α (c 2 ) α2 (c 3 ) α3!α 2!α 3! dxdy =2 K K (α + α 2 + α 3 + 2)!, we have (4.4) B = 720 K l 2 + l l 3 2 2( l 3 2 l 2 2 ) 2( l 2 l 3 2 ) 2( l 2 2 l 2 ) 4(2 l 2 3l 2 l 3 ) 4l l 2 4l l 3. 4(2 l 2 2 3l l 3 ) 4l 2 l 3 sym. 4(2 l 3 2 3l l 2 )

13 768 WEIMING CAO For the L 2 -norm of the interpolation error, we similarly have (4.5) e 2 dxdy = v B 0 v, where (4.6) K ( ) B 0 = b i b j dxdy K = K 7! sym Optimal aspect ratios: A case study. Since error formulas (4.3) and (4.5) involve complicated interaction between the geometric features of K and the orientation and anisotropic ratio of 3 u, it is rather difficult, if not impossible, to decipher from them some quantitative guidelines for anisotropic mesh generation. In particular, among triangles that are of unit area and aligned with the orientation of 3 u, we would like to identify those which produce the smallest quadratic interpolation errors. We study this issue in the case when the triangle is an acute or obtuse isosceles triangle. Because the error is invariant under the rotation transform of the coordinates, we may assume the orientation of 3 u is simply the x-axis. Furthermore, since we are mainly concerned with the local behavior of the error, we assume u is an homogeneous cubic function. In this case, p 3 (ξ) =u(ξ) is either the product of three linear functions or the product of a linear function and a positive quadratic function. Suppose the anisotropic ratio of 3 u is ɛ. By the definition of the orientation and anisotropic ratio, u must be a multiple of one of the following three types of functions. Case (i). u is the product of three linear functions. In this case u must be a multiple of (5.) u (x, y) = 3! (y δx)(y2 ɛ 2 x 2 ), where δ ɛ; see Figure 3(a). Case (ii). u is the product of a linear function l 3 and a positive quadratic function q, with the linear factor lying inside the quadratic factor (see Figure 3(b)). In this case, the orientation of 3 u is determined by the directions of l and l 2 in q. Hence, u is a multiple of (5.2) u 2 (x, y) = 3! (y δx)(y2 + ɛ 2 x 2 ), where δ ɛ. Case (iii). u is the product of a linear function l 3 and a positive quadratic function q, with the linear factor lying outside the quadratic factor (see Figure 3(c)). In this case, the orientation of 3 u is determined by the directions of l 3 and one of the factors l or l 2 in q. Therefore, u must be a multiple of (5.3) where u 3 (x, y) = (y ɛx)q(x, y), 3! q(x, y) =(R T γ x) [ sin 2 ] γ 0 0 cos 2 γ (R T γ x),

14 QUADRATIC INTERPOLATION ERROR ON TRIANGLE 769 where R γ is the matrix of rotation by angle γ, and γ tan (ɛ). The magnitude of the first two types of functions is ( + ɛ 2 ) +δ 2, while for the third type it is +ɛ 2. Under the assumption ɛ, we have for all three cases the magnitude being approximately. We shall simplify the error formulas (4.3) and (4.5) for the first two types of functions when the element is an acute or obtuse isosceles triangle aligned with the 3 u. In this case, optimal aspect ratios leading to the smallest interpolation errors can be identified. The error formulas for the third type of function are still too complicated. For this case we study the optimal aspect ratio numerically in the next section. 5.. H -seminorm of the interpolation error. First, we present the formula for the H -seminorm of the interpolation error for function (5.). We first consider element K being an acute isosceles triangle aligned with the orientation of 3 u, i.e., φ u =0,φ v = π 2. Denote by K the area of K, and denote by r its aspect ratio. With the help of Maple, we have in this case [ ] 4 K 0 l =, l 3r 2 = and (5.4) B = K 3r [ 3r ], l 3 = K 3r [ 3r 3 2 (r + r ) (r r ) 3 2 (r r ) 5r + 9 r sym. 2 r 6r + 8 r 2 r 3r r 6r + 8 r By using formulas (4.6) (4.2) in section 4, we have the coefficients v i,0 i 3, as v 0 =0, v = K 3/2 r 3/2, v 2 = 33/4 08 K 3/2 (3r 2 ɛ 2 )(3δr 3) r 3/2, v 3 = 33/4 08 K 3/2 (3r 2 ɛ 2 )(3δr + 3) r 3/2, and the H -seminorm of the interpolation error e = u Π 2 u is e 2 L 2 (K) = K [r2 ɛ 4 (9+54δ 2 )+(7ɛ 4 +2δ 2 ɛ 2 6ɛ 2 +6δ 2 ) + r 2 (33+6δ 2 +6ɛ 2 )+5r 4 ]. Now consider the optimal choice of the aspect ratio r for a given anisotropy ratio ɛ. It is easy to verify that the minimum of e L 2 (K) is attained when r solves the equation (3+8δ 2 )r 6 ɛ 4 (+2δ 2 +2ɛ 2 )r 2 0=0. Use the formula for roots of cubic polynomials, we have the only positive solution of the above equation, r 2 = 2 +2δ 2 +2ɛ 2 ( ) θ 3ɛ 2 +6δ 2 cos, 3. ],

15 770 WEIMING CAO where [ ] θ = cos 45ɛ 2 +6δ 2 (+2δ 2 +2ɛ 2 ) 3. When δ ɛ, we have θ π 2 and r2 ratio r is approximately r 4 3 ɛ.383 ɛ. With this aspect ratio, the interpolation error is 3 ɛ 2. Therefore, the optimal aspect e 2 L 2 (K) ( ɛ δ 2 ) K 3. Next we consider the case where K is an obtuse isosceles triangle aligned with the orientation of 3 u, i.e., φ u =0,φ v =0. Simplifying error formula (4.3), we end up with e 2 L 2 (K) = K [5r4 δ 2 ɛ 4 + r 2 (33δ 2 ɛ 4 +6ɛ 2 δ 2 +6ɛ 4 ) +( 6ɛ 2 δ 2 +6ɛ 4 +2ɛ 2 +7δ 2 )+r 2 (54+9δ 2 )]. The critical points of the right-hand side function are the solutions of 0r 6 δ 2 ɛ 4 + r 4 (δ 2 ɛ 4 +2ɛ 2 δ 2 +2ɛ 4 ) (8+3δ 2 )=0. Let z = r 2 ; then z satisfies the cubic equation z 3 δ2 ɛ 4 +2ɛ 2 δ 2 +2ɛ 4 8+3δ 2 z = 0δ2 ɛ 4 8+3δ 2. By studying the positive solution of the above equation for all δ ɛ, we conclude that the optimal value of the aspect ratio is in the range.047ɛ r.732ɛ, and the optimal interpolation error is in the range K 3 ɛ 2 e 2 L 2 (K) K 3 ɛ 2. We may study the H -error for the second type of function (5.2) in a similar way. The error formulas and the optimal aspect ratios are summarized in Table 5.. A noticeable observation is that the optimal aspect ratio for both types of functions is proportional to the anisotropic ratio ɛ of 3 u, and the H -seminorm of the error is proportional to ɛ. This is also true for the third type of function (5.3); see the numerical study of this case in the next section. Thus we conclude that when an element is aligned with the orientation of 3 u, the optimal aspect ratio that leads to the smallest H -seminorm of the quadratic interpolation errors is about cs 3, with c (.047,.732). With this direction and aspect ratio taken, the interpolation error e 2 L 2 (K) is of the magnitude c(d 3) 2 (S 3 ) 2 K 3 for c ( , ). Here D 3 and S 3 are the magnitude and anisotropic ratio of 3 u defined in section 3.

16 QUADRATIC INTERPOLATION ERROR ON TRIANGLE 77 Table 5. H -seminorm of the quadratic interpolation error for functions (5.) and (5.2) when element K is an isosceles triangle aligned with 3 u. K and r are the area and aspect ratio of the triangle, respectively. u = 3! (y δx)(y2 ɛ 2 x 2 ): K = acute isosceles e 2 L 2 (K) = K [r2 ɛ 4 (9 + 54δ 2 )+(7ɛ 4 +2δ 2 ɛ 2 6ɛ 2 +6δ 2 ) + r 2 (33 + 6δ 2 +6ɛ 2 )+5r 4 ], r.383 ɛ, e 2 L 2 (K) ( ɛ δ 2 ) K 3. K = obtuse isosceles e 2 L 2 (K) = K [5r4 δ 2 ɛ 4 + r 2 (33δ 2 ɛ 4 +6ɛ 2 δ 2 +6ɛ 4 ) +( 6ɛ 2 δ 2 +6ɛ 4 +2ɛ 2 +7δ 2 )+r 2 (54 + 9δ 2 )], r cɛ, with c (.047,.732), e 2 L 2 (K) c K 3 ɛ 2, with c ( , ). u = 3! (y δx)(y2 + ɛ 2 x 2 ): K = acute isosceles e 2 L 2 (K) = K [r2 ɛ 4 (9 + 54δ 2 )+(7ɛ 4 2δ 2 ɛ 2 +6ɛ 2 +6δ 2 ) + r 2 (33 + 6δ 2 6ɛ 2 )+5r 4 ], r.383 ɛ, e 2 L 2 (K) ( ɛ δ 2 ) K 3. K = obtuse isosceles e 2 L 2 (K) = K [5r4 δ 2 ɛ 4 + r 2 (33δ 2 ɛ 4 6ɛ 2 δ 2 +6ɛ 4 ) +(6ɛ 2 δ 2 +6ɛ 4 2ɛ 2 +7δ 2 )+r 2 (54 + 9δ 2 )], r cɛ, with c (.03,.743), e 2 L 2 (K) c K 3 ɛ 2, with c ( , ). Another important observation is that the optimal aspect ratio is about the same for both acute and obtuse isosceles triangles. This is in contrast to the case of linear interpolations, where a much higher accuracy can be achieved for acute isosceles triangles with a much larger aspect ratio than that for obtuse isosceles triangles. This phenomenon is termed as superaccuracy by Shewchuk in [8]. The study in this subsection indicates that there is no superaccuracy in favor of acute isosceles triangles for quadratic interpolation of general cubic functions L 2 -norm of the interpolation error. For the L 2 -norm of the interpolation error, we may study similarly the optimal choice of the aspect ratio r for the first two types of functions (5.) and (5.2). The results are summarized in Table 5.2 for

17 772 WEIMING CAO Table 5.2 L 2 -norm of the quadratic interpolation error for functions (5.) and (5.2) when element K is an isosceles triangle aligned with 3 u. K and r are the area and aspect ratio of the triangle, respectively. u = 3! (y δx)(y2 ɛ 2 x 2 ): K = acute isosceles e 2 L 2 (K) = 3 K [27ɛ4 δ 2 r 3 +3(ɛ 2 +2δ 2 )ɛ 2 r + (δ 2 0ɛ 2 )r +9r 3 ], r cɛ, with c (0.9265,.732), e 2 L 2 (K) c K 4 ɛ 3, with c ( , ). K = obtuse isosceles e 2 L 2 (K) = 3 K [9ɛ4 δ 2 r 3 + (ɛ 2 0δ 2 )ɛ 2 r +3(δ 2 +2ɛ 2 )r +27r 3 ], r cɛ, with c (.079,.732), e 2 L 2 (K) c K 4 ɛ 3, with c ( , ). u = 3! (y δx)(y2 + ɛ 2 x 2 ): K = acute isosceles e 2 L 2 (K) = 3 K [27ɛ4 δ 2 r 3 +3(ɛ 2 2δ 2 )ɛ 2 r + (δ 2 +0ɛ 2 )r +9r 3 ], r cɛ, with c (.000, 2.57), e 2 L 2 (K) c K 4 ɛ 3, with c ( , ). K = obtuse isosceles e 2 L 2 (K) = 3 K [9ɛ4 δ 2 r 3 + (ɛ 2 +0δ 2 )ɛ 2 r +3(δ 2 2ɛ 2 )r +27r 3 ], r cɛ, with c (.000,.567), e 2 L 2 (K) c K 4 ɛ 3, with c ( , ). the cases φ u =0,φ v = π 2 (aligned acute isosceles triangle) and φ u =0,φ v = 0 (aligned obtuse isosceles triangle) separately. When the triangle is aligned with the orientation of 3 u, the aspect ratio leading to the smallest L 2 -error is approximately equal to cs 3, with c (0.9264, 2.57). With this aspect ratio, e 2 L 2 (K) is of the magnitude c(d 3 ) 2 (S 3 ) 3 K 4 for c ( , ). It is interesting to note that when a triangle is aligned with 3 u, the optimal aspect ratios for both the H -seminorm and L 2 -norm are close to the anisotropic ratio of 3 u. In practice, an aspect ratio r S( 3 u) can be used generally. Remark 2. We emphasize the fact that the optimal aspect ratios listed in Tables 5. and 5.2 are derived under the assumption that K is aligned with the orientation of 3 u defined in section 3. This orientation direction is only an estimate

18 QUADRATIC INTERPOLATION ERROR ON TRIANGLE 773 of the direction along which the absolute value of third order directional derivative is about the smallest, while along its perpendicular direction it is about the largest. It is close to, but may not be exactly, the triangle orientation leading to the minimum interpolation error among all possible choices. Therefore, for elements aligned with the orientation of 3 u we may expect only a nearly optimal interpolation error. Unlike the case of linear interpolation studied in [6], we do not know precisely in what alignment direction the quadratic interpolation error would be minimum (among all possible triangle shapes and orientations). Furthermore, it seems that the optimal choice of this direction is dependent on the norm used to measure the error. For instance, if we consider the L 2 -norm of the interpolation error for function u(x, y) = 6 xy2, then e 2 L 2 (K) = K 4 r and K 4 r on an acute/obtuse isosceles triangle K aligned with the x-axis, respectively. In this case, the x-axis and a large r are good choices for the alignment and aspect ratio. On the other hand, if we consider the H -seminorm of the error for the above function, we have e 2 L 2 (K) = 2960 K 3 (6+6r 2 ) and 2960 K 3 (7+9r 2 ) on an acute/obtuse isosceles triangle aligned with the x-axis, respectively. In this case, using triangles of high aspect ratios helps little to reduce the H -error. We may consider in this case 3 u isotropic with no preferred alignment direction. Remark 3. In a recent work studying mesh quality measures and variational mesh generation methods [4], Huang suggested use the following matrix to determine the element orientation and aspect ratio in the case of quadratic interpolation: H( u) = 2 ( x u) + 2 ( y u), where A =(A T A) /2 for a matrix A. More precisely, let (λ, v ) and (λ 2, v 2 )bethe eigenpairs of H( u). He suggested choosing the element length scale to be / λ i in the v i direction, i =, 2, i.e., to use v as element orientation and λ 2 /λ as element aspect ratio (assume λ λ 2 ). We believe H( u) cannot accurately characterize the anisotropic behavior of 3 u, and the guidelines based on H( u) may not be helpful. While there is no numerical result in [4] for quadratic interpolation, we tested this choice for the function u = y 3 +(ɛx) 3, i.e., our Example in section 3.3. In this case H( u) = [ ] 6ɛ Its eigenvalues are λ =6ɛ 3,λ 2 = 6, and the corresponding eigenvectors are along the x-axis and y-axis. Suppose K is an isosceles triangle aligned with the x-axis and of aspect ratio r; then we may derive the exact formula of the interpolation error. Indeed, it is found that e 2 L 2 (K) = K (33r 2 +5r 4 +54ɛ 6 r 2 ), e 2 3 K L 2 (K) = (9r 3 +27ɛ 6 r 3 ) for acute isosceles triangle K and that e 2 L 2 (K) = K [54r 2 + ɛ 6 (5r 4 +33r 2 )], e 2 L 2 (K) = 3 K (27r 3 +9ɛ 6 r 3 )

19 774 WEIMING CAO for obtuse isosceles triangle K. If r is chosen as λ 2 /λ = ɛ 3/2 as determined in [4], then e 2 L 2 (K) = O() K 3 for obtuse isosceles triangle K. This H -error is in the same magnitude as that over a shape regular triangle of the same area. In other words, using obtuse anisotropic elements with such an aspect ratio helps little to reduce the H -error. For the L 2 -error, r = ɛ 3/2 leads to e 2 L 2 (K) = O(ɛ3/2 ) K 4 for both acute and obtuse isosceles triangles K. They are a factor of O(ɛ 3/2 ) larger than with the choice suggested in this paper. 6. Effects of element orientation, aspect ratio, and internal angles: A numerical study. We present in this section a numerical study on the effects of the element alignment, aspect ratio, and internal angles in quadratic interpolations. Let K be a triangle of unit area but in general shape and orientation. Since, under rotation of the coordinates, any cubic function can be written as a multiple of the three types of functions (5.) (5.3), we study only the interpolation errors over K for these functions. Note that they are all of anisotropic ratio ɛ and approximately of magnitude. We test with various values of ɛ in (0, ). We also experiment with different δ values for functions (5.) and (5.2) and with various γ for γ tan (ɛ) for function (5.3). We calculate exactly the H -seminorm and L 2 -norm of the error u Π 2 u over K by a numerical quadrature for triangles based on 28 Fekete points described in [20]. This quadrature formula is exact for integrands of total degree up to 6, which is sufficient to evaluate precisely the H - and L 2 -error for interpolation of cubic functions. We study mainly () the effects of the triangle aspect ratios when the element is aligned with 3 u; (2) the effects of the element alignments; and (3) the effects of the element internal angles. Because the numerical results for functions (5.) and (5.2) are very similar, we report only those for (5.). In particular, we report the results for (5.) with δ = 0 and δ = ɛ. The errors with general δ ɛ are in between these two cases. Our main observations are the following: () Optimal r: If the triangle is aligned with the orientation of 3 u, then the optimal aspect ratios to produce the smallest interpolation error in both L 2 - and H 2 - norms are close to the anisotropic ratio of 3 u. We plot in Figure 5 the H -seminorm and L 2 -, L -, and L -norms of the error versus the aspect ratio of the element for test functions of different anisotropic ratios. The linear dependency of the optimal r on the anisotropic ratio ɛ is clearly observed. In addition, with the optimal aspect ratio, the H -seminorm of the interpolation error is proportional to ɛ, and the L 2 -, L -, and L -norms are proportional to ɛ.5. (2) Optimal φ u : We study the effects of the element alignment by varying the angle φ u in the SVD of the affine mapping for it; see section 2. We plot in Figure 6 the L 2 -norm and H -seminorm of the error for test functions of various anisotropic ratios. In all the cases, the smallest interpolation error occurs when φ u is close to 0, i.e., when the element is oriented in about the same direction of 3 u. Furthermore, this conclusion is true regardless of whether the element is an acute or obtuse isosceles triangle. It indicates that mesh alignment is crucial for minimizing the interpolation error. (3) Optimal φ v : The internal angles of a triangular element are controlled by φ v in the SVD of its affine mapping. When φ v = mπ/3, the triangle is an obtuse isosceles triangle, and when φ v =(2m +)π/6, it is an acute isosceles triangle. We plot in Figures 7 and 8 the L 2 - and H -errors versus φ v for elements with φ u =0 and r = ɛ, 0ɛ. When the aspect ratio r = ɛ, the L 2 - and H -errors do not depend much on the value of φ v, and thus the element internal angles have little

20 QUADRATIC INTERPOLATION ERROR ON TRIANGLE 775 effect on the interpolation error. When the aspect ratio r =0ɛ, which is far away from the optimal values, the H -seminorm of the error is about the smallest when φ v = π/6,π/2, 5π/6, which correspond to acute isosceles triangles, and the largest error occurs at φ v =0,π/3, 2π/3,π, which correspond to obtuse isosceles triangles. The L 2 -norm is still insensitive to the internal angles. Hence, we conclude that when proper aspect ratio r S( 3 u) is chosen and proper alignment is maintained, the H -seminorm of the interpolation error is insensitive to the element internal angles. If a much larger aspect ratio is used, then the H -error depends on the internal angles. The larger the maximum internal angle is, the larger the H -error. In this case, the maximum angle condition is essential [2]. The L 2 -norm of the interpolation error is always insensitive to the internal angles. 7. Conclusion and discussions. In the previous sections we described how to measure the anisotropic behavior of the third order derivative 3 u at a fixed point based on the distribution of the third order directional derivatives at the point. In particular, the orientation of 3 u is defined as the direction along which the third order directional derivative is about the smallest, while along the perpendicular direction it is about the largest. The anisotropic ratio S( 3 u) measures the strength of the anisotropic behavior of 3 u. These quantities are invariant under translation and rotation of the independent variables. Then we considered the model problem of quadratic interpolation of cubic functions over a triangular element. In particular, we studied the optimal choice of the aspect ratio for elements aligned with the orientation of 3 u. It turns out that () when an element is aligned with the orientation of 3 u, both the H -seminorm and L 2 -norm of the error are about the smallest if its aspect ratio is approximately equal to S( 3 u). This is true regardless of whether the element is an acute or an obtuse isosceles triangle. In practice, we may use the orientation of 3 u for the mesh alignment direction and the anisotropic ratio S( 3 u) for the element aspect ratio. Our study also indicates that unlike the case of linear interpolation [8, 6], there is no superaccuracy in favor of the acute isosceles triangles for quadratic interpolation in general. While there is no rigorous proof of it yet, we believe the reason is because 3 u has richer geometric features than a triangle can capture. (Indeed, 3 u has four degree of freedoms, while a triangle has only three: area, aspect ratio, and orientation.) (2) When an element is aligned with 3 u and is of aspect ratio S( 3 u), the H -seminorm of the error is proportional to [S( 3 u)], and the L 2 -norm of the error is proportional to [S( 3 u)] 3/2. Both of them are insensitive to the internal angles of the element. However, if the element aspect ratio is much larger than the anisotropic ratio of 3 u, the H -seminorm of the error increases greatly as the largest internal angle increases. The maximum angle condition is essential in this situation. The L 2 -error is always insensitive to the internal angles. The definitions of the orientation and the anisotropic ratio for 3 u can be generalized to the case of m u for m>3. It is also possible to derive more precise and coordinate independent error estimates for higher order interpolation based on these anisotropic measures; see [7]. These results can be used to better understand and improve the anisotropic mesh generation and local refinement. They can also be used for global mesh refinement strategies like the r-refinement or the moving mesh method. In these techniques, one typically needs to define a mesh metric (or monitor function) M(x) and looks for a mesh that is quasi-uniform under the metric [3, 4, 5, 8, 9, 5]. For quadratic interpolation, one may choose the metric in the following form based on the anisotropic behavior of the third order derivatives of interpolated function u:

21 776 WEIMING CAO 0 function u=y(y 2 ε 2 x 2 ) and φ ε=2 u =0, φ v =π/2 function u=y(y 2 ε 2 x 2 ) and φ u =0, φ v = ε=2 various norms of interpolation error H seminorms maximum norms L norms L 2 norms various norms of interpolation error H seminorms maximum norms L norms L 2 norms aspect ratio r aspect ratio r function u=(y ε x)(y 2 ε 2 x 2 ) and φ u =0, φ v =π/2 function u=(y ε x)(y 2 ε 2 x 2 ) and φ ε=2 u =0, φ v =0 0 ε=2 0 various norms of interpolation error H seminorms maximum norms various norms of interpolation error H seminorms maximum norms L norms L norms L 2 norms L 2 norms aspect ratio r aspect ratio r function (5.3) and φ u =0, φ v =π/2 function (5.3) and φ u =0, φ v =0 0 ε=2 0 ε=2 various norms of interpolation error H seminorms maximum norms various norms of interpolation error H seminorms maximum norms L norms L norms L 2 norms L 2 norms aspect ratio r aspect ratio r Fig. 5. The H -seminorm and L -, L 2 -, and maximum norms of the quadratic interpolation errors on an aligned element versus the element aspect ratio r. (i) Upper panel: for function u = y(y 2 ɛx 2 ); (ii) middle panel: for function u =(y ɛx)(y 2 ɛ 2 x 2 ); (iii) bottom panel: for function (5.3) with various γ [0, arctan(ɛ)]. The left panel is for the case φ u =0and φ v = π/2 (i.e., aligned acute isosceles triangle), and the right panel is for the case φ u =0and φ v =0(i.e., aligned obtuse isosceles triangle).

4.2. ORTHOGONALITY 161

4.2. ORTHOGONALITY 161 4.2. ORTHOGONALITY 161 Definition 4.2.9 An affine space (E, E ) is a Euclidean affine space iff its underlying vector space E is a Euclidean vector space. Given any two points a, b E, we define the distance

More information

MTH 2032 SemesterII

MTH 2032 SemesterII MTH 202 SemesterII 2010-11 Linear Algebra Worked Examples Dr. Tony Yee Department of Mathematics and Information Technology The Hong Kong Institute of Education December 28, 2011 ii Contents Table of Contents

More information

COMP 558 lecture 18 Nov. 15, 2010

COMP 558 lecture 18 Nov. 15, 2010 Least squares We have seen several least squares problems thus far, and we will see more in the upcoming lectures. For this reason it is good to have a more general picture of these problems and how to

More information

SUPERCONVERGENCE ANALYSIS OF THE LINEAR FINITE ELEMENT METHOD AND A GRADIENT RECOVERY POSTPROCESSING ON ANISOTROPIC MESHES

SUPERCONVERGENCE ANALYSIS OF THE LINEAR FINITE ELEMENT METHOD AND A GRADIENT RECOVERY POSTPROCESSING ON ANISOTROPIC MESHES MATHEMATICS OF COMPUTATION Volume 84, Number 29, January 205, Pages 89 7 S 0025-578(204)02846-9 Article electronically published on May 28, 204 SUPERCONVERGENCE ANALYSIS OF THE LINEAR FINITE ELEMENT METHOD

More information

Linear Algebra: Matrix Eigenvalue Problems

Linear Algebra: Matrix Eigenvalue Problems CHAPTER8 Linear Algebra: Matrix Eigenvalue Problems Chapter 8 p1 A matrix eigenvalue problem considers the vector equation (1) Ax = λx. 8.0 Linear Algebra: Matrix Eigenvalue Problems Here A is a given

More information

8. Diagonalization.

8. Diagonalization. 8. Diagonalization 8.1. Matrix Representations of Linear Transformations Matrix of A Linear Operator with Respect to A Basis We know that every linear transformation T: R n R m has an associated standard

More information

Applied Linear Algebra in Geoscience Using MATLAB

Applied Linear Algebra in Geoscience Using MATLAB Applied Linear Algebra in Geoscience Using MATLAB Contents Getting Started Creating Arrays Mathematical Operations with Arrays Using Script Files and Managing Data Two-Dimensional Plots Programming in

More information

The Generalized Eigenvalue-Eigenvector Problem or How to Simultaneously Diagonalize Two Quadratic Forms

The Generalized Eigenvalue-Eigenvector Problem or How to Simultaneously Diagonalize Two Quadratic Forms The Generalized Eigenvalue-Eigenvector Problem or How to Simultaneously Diagonalize Two Quadratic orms The following records deal with the generalized eigenvalue problem of two positive definite matrices

More information

Functional Analysis Review

Functional Analysis Review Outline 9.520: Statistical Learning Theory and Applications February 8, 2010 Outline 1 2 3 4 Vector Space Outline A vector space is a set V with binary operations +: V V V and : R V V such that for all

More information

MAT1035 Analytic Geometry

MAT1035 Analytic Geometry MAT1035 Analytic Geometry Lecture Notes R.A. Sabri Kaan Gürbüzer Dokuz Eylül University 2016 2 Contents 1 Review of Trigonometry 5 2 Polar Coordinates 7 3 Vectors in R n 9 3.1 Located Vectors..............................................

More information

Lecture 2: Linear Algebra Review

Lecture 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 information

Applied Linear Algebra in Geoscience Using MATLAB

Applied Linear Algebra in Geoscience Using MATLAB Applied Linear Algebra in Geoscience Using MATLAB Contents Getting Started Creating Arrays Mathematical Operations with Arrays Using Script Files and Managing Data Two-Dimensional Plots Programming in

More information

ELLIPSES. Problem: Find the points on the locus. Q(x, y) = 865x 2 294xy + 585y 2 = closest to, and farthest from, the origin. Answer.

ELLIPSES. Problem: Find the points on the locus. Q(x, y) = 865x 2 294xy + 585y 2 = closest to, and farthest from, the origin. Answer. ELLIPSES Problem: Find the points on the locus closest to, and farthest from, the origin. Answer. Q(x, y) 865x 2 294xy + 585y 2 1450 This is a Lagrange multiplier problem: we want to extremize f(x, y)

More information

Greedy bisection generates optimally adapted triangulations

Greedy bisection generates optimally adapted triangulations Greedy bisection generates optimally adapted triangulations Jean-Marie Mirebeau and Albert Cohen October, 008 Abstract We study the properties of a simple greedy algorithm introduced in [9] for the generation

More information

Math 102, Winter Final Exam Review. Chapter 1. Matrices and Gaussian Elimination

Math 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 information

Hp-Adaptivity on Anisotropic Meshes for Hybridized Discontinuous Galerkin Scheme

Hp-Adaptivity on Anisotropic Meshes for Hybridized Discontinuous Galerkin Scheme Hp-Adaptivity on Anisotropic Meshes for Hybridized Discontinuous Galerkin Scheme Aravind Balan, Michael Woopen and Georg May AICES Graduate School, RWTH Aachen University, Germany 22nd AIAA Computational

More information

Spectral Algorithms I. Slides based on Spectral Mesh Processing Siggraph 2010 course

Spectral Algorithms I. Slides based on Spectral Mesh Processing Siggraph 2010 course Spectral Algorithms I Slides based on Spectral Mesh Processing Siggraph 2010 course Why Spectral? A different way to look at functions on a domain Why Spectral? Better representations lead to simpler solutions

More information

LECTURE 7, WEDNESDAY

LECTURE 7, WEDNESDAY LECTURE 7, WEDNESDAY 25.02.04 FRANZ LEMMERMEYER 1. Singular Weierstrass Curves Consider cubic curves in Weierstraß form (1) E : y 2 + a 1 xy + a 3 y = x 3 + a 2 x 2 + a 4 x + a 6, the coefficients a i

More information

Information About Ellipses

Information About Ellipses Information About Ellipses David Eberly, Geometric Tools, Redmond WA 9805 https://www.geometrictools.com/ This work is licensed under the Creative Commons Attribution 4.0 International License. To view

More information

Review of Some Concepts from Linear Algebra: Part 2

Review of Some Concepts from Linear Algebra: Part 2 Review of Some Concepts from Linear Algebra: Part 2 Department of Mathematics Boise State University January 16, 2019 Math 566 Linear Algebra Review: Part 2 January 16, 2019 1 / 22 Vector spaces A set

More information

Dot Products. K. Behrend. April 3, Abstract A short review of some basic facts on the dot product. Projections. The spectral theorem.

Dot Products. K. Behrend. April 3, Abstract A short review of some basic facts on the dot product. Projections. The spectral theorem. Dot Products K. Behrend April 3, 008 Abstract A short review of some basic facts on the dot product. Projections. The spectral theorem. Contents The dot product 3. Length of a vector........................

More information

Synopsis of Numerical Linear Algebra

Synopsis of Numerical Linear Algebra Synopsis of Numerical Linear Algebra Eric de Sturler Department of Mathematics, Virginia Tech sturler@vt.edu http://www.math.vt.edu/people/sturler Iterative Methods for Linear Systems: Basics to Research

More information

Numerical Optimization

Numerical Optimization Numerical Optimization Unit 2: Multivariable optimization problems Che-Rung Lee Scribe: February 28, 2011 (UNIT 2) Numerical Optimization February 28, 2011 1 / 17 Partial derivative of a two variable function

More information

1 Matrices and vector spaces

1 Matrices and vector spaces Matrices and vector spaces. Which of the following statements about linear vector spaces are true? Where a statement is false, give a counter-example to demonstrate this. (a) Non-singular N N matrices

More information

15 Singular Value Decomposition

15 Singular Value Decomposition 15 Singular Value Decomposition For any high-dimensional data analysis, one s first thought should often be: can I use an SVD? The singular value decomposition is an invaluable analysis tool for dealing

More information

CS 143 Linear Algebra Review

CS 143 Linear Algebra Review CS 143 Linear Algebra Review Stefan Roth September 29, 2003 Introductory Remarks This review does not aim at mathematical rigor very much, but instead at ease of understanding and conciseness. Please see

More information

ON APPROXIMATION OF LAPLACIAN EIGENPROBLEM OVER A REGULAR HEXAGON WITH ZERO BOUNDARY CONDITIONS 1) 1. Introduction

ON APPROXIMATION OF LAPLACIAN EIGENPROBLEM OVER A REGULAR HEXAGON WITH ZERO BOUNDARY CONDITIONS 1) 1. Introduction Journal of Computational Mathematics, Vol., No., 4, 75 86. ON APPROXIMATION OF LAPLACIAN EIGENPROBLEM OVER A REGULAR HEXAGON WITH ZERO BOUNDARY CONDITIONS ) Jia-chang Sun (Parallel Computing Division,

More information

2. Review of Linear Algebra

2. Review of Linear Algebra 2. Review of Linear Algebra ECE 83, Spring 217 In this course we will represent signals as vectors and operators (e.g., filters, transforms, etc) as matrices. This lecture reviews basic concepts from linear

More information

Review problems for MA 54, Fall 2004.

Review problems for MA 54, Fall 2004. Review problems for MA 54, Fall 2004. Below are the review problems for the final. They are mostly homework problems, or very similar. If you are comfortable doing these problems, you should be fine on

More information

TEST CODE: MMA (Objective type) 2015 SYLLABUS

TEST 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 information

Mathematical Properties of Stiffness Matrices

Mathematical Properties of Stiffness Matrices Mathematical Properties of Stiffness Matrices CEE 4L. Matrix Structural Analysis Department of Civil and Environmental Engineering Duke University Henri P. Gavin Fall, 0 These notes describe some of the

More information

MATH 350: Introduction to Computational Mathematics

MATH 350: Introduction to Computational Mathematics MATH 350: Introduction to Computational Mathematics Chapter V: Least Squares Problems Greg Fasshauer Department of Applied Mathematics Illinois Institute of Technology Spring 2011 fasshauer@iit.edu MATH

More information

Optimal 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. 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 information

ASYMPTOTICALLY EXACT A POSTERIORI ESTIMATORS FOR THE POINTWISE GRADIENT ERROR ON EACH ELEMENT IN IRREGULAR MESHES. PART II: THE PIECEWISE LINEAR CASE

ASYMPTOTICALLY EXACT A POSTERIORI ESTIMATORS FOR THE POINTWISE GRADIENT ERROR ON EACH ELEMENT IN IRREGULAR MESHES. PART II: THE PIECEWISE LINEAR CASE MATEMATICS OF COMPUTATION Volume 73, Number 246, Pages 517 523 S 0025-5718(0301570-9 Article electronically published on June 17, 2003 ASYMPTOTICALLY EXACT A POSTERIORI ESTIMATORS FOR TE POINTWISE GRADIENT

More information

Mathematics, Algebra, and Geometry

Mathematics, Algebra, and Geometry Mathematics, Algebra, and Geometry by Satya http://www.thesatya.com/ Contents 1 Algebra 1 1.1 Logarithms............................................ 1. Complex numbers........................................

More information

ENERGY DECAY ESTIMATES FOR LIENARD S EQUATION WITH QUADRATIC VISCOUS FEEDBACK

ENERGY DECAY ESTIMATES FOR LIENARD S EQUATION WITH QUADRATIC VISCOUS FEEDBACK Electronic Journal of Differential Equations, Vol. 00(00, No. 70, pp. 1 1. ISSN: 107-6691. URL: http://ejde.math.swt.edu or http://ejde.math.unt.edu ftp ejde.math.swt.edu (login: ftp ENERGY DECAY ESTIMATES

More information

Integration, differentiation, and root finding. Phys 420/580 Lecture 7

Integration, differentiation, and root finding. Phys 420/580 Lecture 7 Integration, differentiation, and root finding Phys 420/580 Lecture 7 Numerical integration Compute an approximation to the definite integral I = b Find area under the curve in the interval Trapezoid Rule:

More information

Chapter 8B - Trigonometric Functions (the first part)

Chapter 8B - Trigonometric Functions (the first part) Fry Texas A&M University! Spring 2016! Math 150 Notes! Section 8B-I! Page 79 Chapter 8B - Trigonometric Functions (the first part) Recall from geometry that if 2 corresponding triangles have 2 angles of

More information

MTHE 227 Problem Set 2 Solutions

MTHE 227 Problem Set 2 Solutions MTHE 7 Problem Set Solutions 1 (Great Circles). The intersection of a sphere with a plane passing through its center is called a great circle. Let Γ be the great circle that is the intersection of the

More information

Week Quadratic forms. Principal axes theorem. Text reference: this material corresponds to parts of sections 5.5, 8.2,

Week Quadratic forms. Principal axes theorem. Text reference: this material corresponds to parts of sections 5.5, 8.2, Math 051 W008 Margo Kondratieva Week 10-11 Quadratic forms Principal axes theorem Text reference: this material corresponds to parts of sections 55, 8, 83 89 Section 41 Motivation and introduction Consider

More information

TEST CODE: MIII (Objective type) 2010 SYLLABUS

TEST CODE: MIII (Objective type) 2010 SYLLABUS TEST CODE: MIII (Objective type) 200 SYLLABUS Algebra Permutations and combinations. Binomial theorem. Theory of equations. Inequalities. Complex numbers and De Moivre s theorem. Elementary set theory.

More information

Singular Value Decomposition

Singular Value Decomposition Singular Value Decomposition Motivatation The diagonalization theorem play a part in many interesting applications. Unfortunately not all matrices can be factored as A = PDP However a factorization A =

More information

THE SINGULAR VALUE DECOMPOSITION MARKUS GRASMAIR

THE SINGULAR VALUE DECOMPOSITION MARKUS GRASMAIR THE SINGULAR VALUE DECOMPOSITION MARKUS GRASMAIR 1. Definition Existence Theorem 1. Assume that A R m n. Then there exist orthogonal matrices U R m m V R n n, values σ 1 σ 2... σ p 0 with p = min{m, n},

More information

Econ 204 Differential Equations. 1 Existence and Uniqueness of Solutions

Econ 204 Differential Equations. 1 Existence and Uniqueness of Solutions Econ 4 Differential Equations In this supplement, we use the methods we have developed so far to study differential equations. 1 Existence and Uniqueness of Solutions Definition 1 A differential equation

More information

Review of Linear Algebra Definitions, Change of Basis, Trace, Spectral Theorem

Review of Linear Algebra Definitions, Change of Basis, Trace, Spectral Theorem Review of Linear Algebra Definitions, Change of Basis, Trace, Spectral Theorem Steven J. Miller June 19, 2004 Abstract Matrices can be thought of as rectangular (often square) arrays of numbers, or as

More information

Math 108b: Notes on the Spectral Theorem

Math 108b: Notes on the Spectral Theorem Math 108b: Notes on the Spectral Theorem From section 6.3, we know that every linear operator T on a finite dimensional inner product space V has an adjoint. (T is defined as the unique linear operator

More information

Linear Algebra & Geometry why is linear algebra useful in computer vision?

Linear Algebra & Geometry why is linear algebra useful in computer vision? Linear Algebra & Geometry why is linear algebra useful in computer vision? References: -Any book on linear algebra! -[HZ] chapters 2, 4 Some of the slides in this lecture are courtesy to Prof. Octavia

More information

Review exercise 2. 1 The equation of the line is: = 5 a The gradient of l1 is 3. y y x x. So the gradient of l2 is. The equation of line l2 is: y =

Review exercise 2. 1 The equation of the line is: = 5 a The gradient of l1 is 3. y y x x. So the gradient of l2 is. The equation of line l2 is: y = Review exercise The equation of the line is: y y x x y y x x y 8 x+ 6 8 + y 8 x+ 6 y x x + y 0 y ( ) ( x 9) y+ ( x 9) y+ x 9 x y 0 a, b, c Using points A and B: y y x x y y x x y x 0 k 0 y x k ky k x a

More information

LINEAR ALGEBRA BOOT CAMP WEEK 4: THE SPECTRAL THEOREM

LINEAR 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 information

2.10 Saddles, Nodes, Foci and Centers

2.10 Saddles, Nodes, Foci and Centers 2.10 Saddles, Nodes, Foci and Centers In Section 1.5, a linear system (1 where x R 2 was said to have a saddle, node, focus or center at the origin if its phase portrait was linearly equivalent to one

More information

Three remarks on anisotropic finite elements

Three remarks on anisotropic finite elements Three remarks on anisotropic finite elements Thomas Apel Universität der Bundeswehr München Workshop Numerical Analysis for Singularly Perturbed Problems dedicated to the 60th birthday of Martin Stynes

More information

Malfatti s problems 165. Malfatti s problems. Emil Kostadinov Mathematics High School Acad. S. Korolov, 11 grade Blagoevgrad, Bulgaria.

Malfatti s problems 165. Malfatti s problems. Emil Kostadinov Mathematics High School Acad. S. Korolov, 11 grade Blagoevgrad, Bulgaria. Malfatti s problems 165 Malfatti s problems Emil Kostadinov Mathematics High School Acad. S. Korolov, 11 grade Blagoevgrad, Bulgaria Abstract The purpose of the present project is to consider the original

More information

Taylor and Laurent Series

Taylor and Laurent Series Chapter 4 Taylor and Laurent Series 4.. Taylor Series 4... Taylor Series for Holomorphic Functions. In Real Analysis, the Taylor series of a given function f : R R is given by: f (x + f (x (x x + f (x

More information

AM 106/206: Applied Algebra Madhu Sudan 1. Lecture Notes 12

AM 106/206: Applied Algebra Madhu Sudan 1. Lecture Notes 12 AM 106/206: Applied Algebra Madhu Sudan 1 Lecture Notes 12 October 19 2016 Reading: Gallian Chs. 27 & 28 Most of the applications of group theory to the physical sciences are through the study of the symmetry

More information

Linear Algebra & Geometry why is linear algebra useful in computer vision?

Linear Algebra & Geometry why is linear algebra useful in computer vision? Linear Algebra & Geometry why is linear algebra useful in computer vision? References: -Any book on linear algebra! -[HZ] chapters 2, 4 Some of the slides in this lecture are courtesy to Prof. Octavia

More information

Notes on Conditioning

Notes on Conditioning Notes on Conditioning Robert A. van de Geijn The University of Texas Austin, TX 7872 October 6, 204 NOTE: I have not thoroughly proof-read these notes!!! Motivation Correctness in the presence of error

More information

(x, y) = d(x, y) = x y.

(x, y) = d(x, y) = x y. 1 Euclidean geometry 1.1 Euclidean space Our story begins with a geometry which will be familiar to all readers, namely the geometry of Euclidean space. In this first chapter we study the Euclidean distance

More information

Lecture 7. Econ August 18

Lecture 7. Econ August 18 Lecture 7 Econ 2001 2015 August 18 Lecture 7 Outline First, the theorem of the maximum, an amazing result about continuity in optimization problems. Then, we start linear algebra, mostly looking at familiar

More information

10.2,3,4. Vectors in 3D, Dot products and Cross Products

10.2,3,4. Vectors in 3D, Dot products and Cross Products Name: Section: 10.2,3,4. Vectors in 3D, Dot products and Cross Products 1. Sketch the plane parallel to the xy-plane through (2, 4, 2) 2. For the given vectors u and v, evaluate the following expressions.

More information

Cambridge University Press The Mathematics of Signal Processing Steven B. Damelin and Willard Miller Excerpt More information

Cambridge University Press The Mathematics of Signal Processing Steven B. Damelin and Willard Miller Excerpt More information Introduction Consider a linear system y = Φx where Φ can be taken as an m n matrix acting on Euclidean space or more generally, a linear operator on a Hilbert space. We call the vector x a signal or input,

More information

QUESTION BANK ON. CONIC SECTION (Parabola, Ellipse & Hyperbola)

QUESTION BANK ON. CONIC SECTION (Parabola, Ellipse & Hyperbola) QUESTION BANK ON CONIC SECTION (Parabola, Ellipse & Hyperbola) Question bank on Parabola, Ellipse & Hyperbola Select the correct alternative : (Only one is correct) Q. Two mutually perpendicular tangents

More information

Outline schemes of work A-level Mathematics 6360

Outline schemes of work A-level Mathematics 6360 Outline schemes of work A-level Mathematics 6360 Version.0, Autumn 013 Introduction These outline schemes of work are intended to help teachers plan and implement the teaching of the AQA A-level Mathematics

More information

Improved Approximation Bounds for Planar Point Pattern Matching

Improved Approximation Bounds for Planar Point Pattern Matching Improved Approximation Bounds for Planar Point Pattern Matching Minkyoung Cho Department of Computer Science University of Maryland College Park, Maryland, USA David M Mount Department of Computer Science

More information

EAD 115. Numerical Solution of Engineering and Scientific Problems. David M. Rocke Department of Applied Science

EAD 115. Numerical Solution of Engineering and Scientific Problems. David M. Rocke Department of Applied Science EAD 115 Numerical Solution of Engineering and Scientific Problems David M. Rocke Department of Applied Science Taylor s Theorem Can often approximate a function by a polynomial The error in the approximation

More information

Linear Systems. Carlo Tomasi. June 12, r = rank(a) b range(a) n r solutions

Linear Systems. Carlo Tomasi. June 12, r = rank(a) b range(a) n r solutions Linear Systems Carlo Tomasi June, 08 Section characterizes the existence and multiplicity of the solutions of a linear system in terms of the four fundamental spaces associated with the system s matrix

More information

Lecture 10 - Eigenvalues problem

Lecture 10 - Eigenvalues problem Lecture 10 - Eigenvalues problem Department of Computer Science University of Houston February 28, 2008 1 Lecture 10 - Eigenvalues problem Introduction Eigenvalue problems form an important class of problems

More information

Deep Learning Book Notes Chapter 2: Linear Algebra

Deep Learning Book Notes Chapter 2: Linear Algebra Deep Learning Book Notes Chapter 2: Linear Algebra Compiled By: Abhinaba Bala, Dakshit Agrawal, Mohit Jain Section 2.1: Scalars, Vectors, Matrices and Tensors Scalar Single Number Lowercase names in italic

More information

Directional Field. Xiao-Ming Fu

Directional 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 information

Department of Applied Mathematics and Theoretical Physics. AMA 204 Numerical analysis. Exam Winter 2004

Department of Applied Mathematics and Theoretical Physics. AMA 204 Numerical analysis. Exam Winter 2004 Department of Applied Mathematics and Theoretical Physics AMA 204 Numerical analysis Exam Winter 2004 The best six answers will be credited All questions carry equal marks Answer all parts of each question

More information

Notes on Eigenvalues, Singular Values and QR

Notes on Eigenvalues, Singular Values and QR Notes on Eigenvalues, Singular Values and QR Michael Overton, Numerical Computing, Spring 2017 March 30, 2017 1 Eigenvalues Everyone who has studied linear algebra knows the definition: given a square

More information

Duke University, Department of Electrical and Computer Engineering Optimization for Scientists and Engineers c Alex Bronstein, 2014

Duke University, Department of Electrical and Computer Engineering Optimization for Scientists and Engineers c Alex Bronstein, 2014 Duke University, Department of Electrical and Computer Engineering Optimization for Scientists and Engineers c Alex Bronstein, 2014 Linear Algebra A Brief Reminder Purpose. The purpose of this document

More information

Linear Systems. Carlo Tomasi

Linear Systems. Carlo Tomasi Linear Systems Carlo Tomasi Section 1 characterizes the existence and multiplicity of the solutions of a linear system in terms of the four fundamental spaces associated with the system s matrix and of

More information

Practical Linear Algebra: A Geometry Toolbox

Practical Linear Algebra: A Geometry Toolbox Practical Linear Algebra: A Geometry Toolbox Third edition Chapter 12: Gauss for Linear Systems Gerald Farin & Dianne Hansford CRC Press, Taylor & Francis Group, An A K Peters Book www.farinhansford.com/books/pla

More information

AM 205: lecture 8. Last time: Cholesky factorization, QR factorization Today: how to compute the QR factorization, the Singular Value Decomposition

AM 205: lecture 8. Last time: Cholesky factorization, QR factorization Today: how to compute the QR factorization, the Singular Value Decomposition AM 205: lecture 8 Last time: Cholesky factorization, QR factorization Today: how to compute the QR factorization, the Singular Value Decomposition QR Factorization A matrix A R m n, m n, can be factorized

More information

In these chapter 2A notes write vectors in boldface to reduce the ambiguity of the notation.

In these chapter 2A notes write vectors in boldface to reduce the ambiguity of the notation. 1 2 Linear Systems In these chapter 2A notes write vectors in boldface to reduce the ambiguity of the notation 21 Matrix ODEs Let and is a scalar A linear function satisfies Linear superposition ) Linear

More information

Applications of Singular-Value Decomposition (SVD)

Applications of Singular-Value Decomposition (SVD) Applications of Singular-Value Decomposition (SVD Alkiviadis G Akritas and Gennadi I Malaschonok Summer 00 Abstract Let A be an m n matrix with m n Then one form of the singular-value decomposition of

More information

INTRODUCTION TO FINITE ELEMENT METHODS

INTRODUCTION 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 information

Nonlinear Autonomous Systems of Differential

Nonlinear Autonomous Systems of Differential Chapter 4 Nonlinear Autonomous Systems of Differential Equations 4.0 The Phase Plane: Linear Systems 4.0.1 Introduction Consider a system of the form x = A(x), (4.0.1) where A is independent of t. Such

More information

(D) (A) Q.3 To which of the following circles, the line y x + 3 = 0 is normal at the point ? 2 (A) 2

(D) (A) Q.3 To which of the following circles, the line y x + 3 = 0 is normal at the point ? 2 (A) 2 CIRCLE [STRAIGHT OBJECTIVE TYPE] Q. The line x y + = 0 is tangent to the circle at the point (, 5) and the centre of the circles lies on x y = 4. The radius of the circle is (A) 3 5 (B) 5 3 (C) 5 (D) 5

More information

Classical Mechanics. Luis Anchordoqui

Classical Mechanics. Luis Anchordoqui 1 Rigid Body Motion Inertia Tensor Rotational Kinetic Energy Principal Axes of Rotation Steiner s Theorem Euler s Equations for a Rigid Body Eulerian Angles Review of Fundamental Equations 2 Rigid body

More information

Linear Algebra for Machine Learning. Sargur N. Srihari

Linear Algebra for Machine Learning. Sargur N. Srihari Linear Algebra for Machine Learning Sargur N. srihari@cedar.buffalo.edu 1 Overview Linear Algebra is based on continuous math rather than discrete math Computer scientists have little experience with it

More information

Matrices and Deformation

Matrices and Deformation ES 111 Mathematical Methods in the Earth Sciences Matrices and Deformation Lecture Outline 13 - Thurs 9th Nov 2017 Strain Ellipse and Eigenvectors One way of thinking about a matrix is that it operates

More information

QUESTION BANK ON STRAIGHT LINE AND CIRCLE

QUESTION BANK ON STRAIGHT LINE AND CIRCLE QUESTION BANK ON STRAIGHT LINE AND CIRCLE Select the correct alternative : (Only one is correct) Q. If the lines x + y + = 0 ; 4x + y + 4 = 0 and x + αy + β = 0, where α + β =, are concurrent then α =,

More information

Candidates are expected to have available a calculator. Only division by (x + a) or (x a) will be required.

Candidates are expected to have available a calculator. Only division by (x + a) or (x a) will be required. Revision Checklist Unit C2: Core Mathematics 2 Unit description Algebra and functions; coordinate geometry in the (x, y) plane; sequences and series; trigonometry; exponentials and logarithms; differentiation;

More information

Some remarks on the stability coefficients and bubble stabilization of FEM on anisotropic meshes

Some remarks on the stability coefficients and bubble stabilization of FEM on anisotropic meshes Some remarks on the stability coefficients and bubble stabilization of FEM on anisotropic meshes Stefano Micheletti Simona Perotto Marco Picasso Abstract In this paper we re-address the anisotropic recipe

More information

Notes on Radian Measure

Notes on Radian Measure MAT 170 Pre-Calculus Notes on Radian Measure Radian Angles Terri L. Miller Spring 009 revised April 17, 009 1. Radian Measure Recall that a unit circle is the circle centered at the origin with a radius

More information

Notes on Cellwise Data Interpolation for Visualization Xavier Tricoche

Notes on Cellwise Data Interpolation for Visualization Xavier Tricoche Notes on Cellwise Data Interpolation for Visualization Xavier Tricoche urdue University While the data (computed or measured) used in visualization is only available in discrete form, it typically corresponds

More information

without annihilating, and q is the number of times E α can. This is encoded in the Cartan matrix for the simple roots, A ji = 2 α j α i = q p.

without annihilating, and q is the number of times E α can. This is encoded in the Cartan matrix for the simple roots, A ji = 2 α j α i = q p. Chapter 8 Dynkin Diagrams We now describe how to use the constraints = q p where p is the number of times E can hit without annihilating, and q is the number of times E can. This is encoded in the Cartan

More information

14 From modular forms to automorphic representations

14 From modular forms to automorphic representations 14 From modular forms to automorphic representations We fix an even integer k and N > 0 as before. Let f M k (N) be a modular form. We would like to product a function on GL 2 (A Q ) out of it. Recall

More information

11. Periodicity of Klein polyhedra (28 June 2011) Algebraic irrationalities and periodicity of sails. Let A GL(n + 1, R) be an operator all of

11. Periodicity of Klein polyhedra (28 June 2011) Algebraic irrationalities and periodicity of sails. Let A GL(n + 1, R) be an operator all of 11. Periodicity of Klein polyhedra (28 June 2011) 11.1. lgebraic irrationalities and periodicity of sails. Let GL(n + 1, R) be an operator all of whose eigenvalues are real and distinct. Let us take the

More information

Lagrange Multipliers

Lagrange Multipliers Optimization with Constraints As long as algebra and geometry have been separated, their progress have been slow and their uses limited; but when these two sciences have been united, they have lent each

More information

Solving the 3D Laplace Equation by Meshless Collocation via Harmonic Kernels

Solving the 3D Laplace Equation by Meshless Collocation via Harmonic Kernels Solving the 3D Laplace Equation by Meshless Collocation via Harmonic Kernels Y.C. Hon and R. Schaback April 9, Abstract This paper solves the Laplace equation u = on domains Ω R 3 by meshless collocation

More information

8 Eigenvectors and the Anisotropic Multivariate Gaussian Distribution

8 Eigenvectors and the Anisotropic Multivariate Gaussian Distribution Eigenvectors and the Anisotropic Multivariate Gaussian Distribution Eigenvectors and the Anisotropic Multivariate Gaussian Distribution EIGENVECTORS [I don t know if you were properly taught about eigenvectors

More information

EE/ACM Applications of Convex Optimization in Signal Processing and Communications Lecture 17

EE/ACM Applications of Convex Optimization in Signal Processing and Communications Lecture 17 EE/ACM 150 - Applications of Convex Optimization in Signal Processing and Communications Lecture 17 Andre Tkacenko Signal Processing Research Group Jet Propulsion Laboratory May 29, 2012 Andre Tkacenko

More information

Chapter. Triangles. Copyright Cengage Learning. All rights reserved.

Chapter. Triangles. Copyright Cengage Learning. All rights reserved. Chapter 3 Triangles Copyright Cengage Learning. All rights reserved. 3.5 Inequalities in a Triangle Copyright Cengage Learning. All rights reserved. Inequalities in a Triangle Important inequality relationships

More information

MATH 167: APPLIED LINEAR ALGEBRA Least-Squares

MATH 167: APPLIED LINEAR ALGEBRA Least-Squares MATH 167: APPLIED LINEAR ALGEBRA Least-Squares October 30, 2014 Least Squares We do a series of experiments, collecting data. We wish to see patterns!! We expect the output b to be a linear function of

More information

Positive Definite Matrix

Positive Definite Matrix 1/29 Chia-Ping Chen Professor Department of Computer Science and Engineering National Sun Yat-sen University Linear Algebra Positive Definite, Negative Definite, Indefinite 2/29 Pure Quadratic Function

More information

Matrix Vector Products

Matrix Vector Products We covered these notes in the tutorial sessions I strongly recommend that you further read the presented materials in classical books on linear algebra Please make sure that you understand the proofs and

More information

An introduction to Birkhoff normal form

An introduction to Birkhoff normal form An introduction to Birkhoff normal form Dario Bambusi Dipartimento di Matematica, Universitá di Milano via Saldini 50, 0133 Milano (Italy) 19.11.14 1 Introduction The aim of this note is to present an

More information

Stabilization and Acceleration of Algebraic Multigrid Method

Stabilization and Acceleration of Algebraic Multigrid Method Stabilization and Acceleration of Algebraic Multigrid Method Recursive Projection Algorithm A. Jemcov J.P. Maruszewski Fluent Inc. October 24, 2006 Outline 1 Need for Algorithm Stabilization and Acceleration

More information