Studies on Barlow points, Gauss points and Superconvergent points in 1D with Lagrangian and Hermitian finite element basis

Size: px
Start display at page:

Download "Studies on Barlow points, Gauss points and Superconvergent points in 1D with Lagrangian and Hermitian finite element basis"

Transcription

1 Volume 7, N., pp. 75 0, 008 Copyright 008 SBMAC ISSN Studies on Barlow points, Gauss points and Superconvergent points in 1D with Lagrangian and Hermitian finite element basis DAVID SOARES PINTO JÚNIOR Department of Mathematics, Federal University of Sergipe São Cristóvão, SE, Brazil Abstract. In this work, we consider the superconvergence property of the finite element derivative for Lagrange s and Hermite s Family elements in the one dimensional interpolation problem. We also compare the Barlow points, Gauss points and Superconvergence points in the sense of Taylor s Series, confirming that they are not the same as believed before. We prove a not evident and new superconvergence property of Hermite s basis as well which shows that the centroid is not only a superconvergent for u h but an O(h5 ) accuracy point. Mathematical subject classification: 7S05. Key words: Gauss points, Barlow points, Superconvergence points, derivative, finite elements. 1 Introduction A mathematical argument to prove the existence of points where a higher order accuracy for derivatives exists is implied from the Rolle s theorem or the Mean Value Theorem for derivatives. Let u C 0 (Î ) and u h be a lagrangian finite element interpolant of u Î. Then, u h (x i ) = u i = u(x i ), i = 0,..., k and internally the field u is interpolated as u h (x) = k i=0 L i(x) u i. Defining the error function as e(x) = u(x) u h (x) it is a simple algebrism to prove that e(x i ) = 0, hence, one follows from the Mean Value Theorem that there is at least one point ξ inside Î so that e (ξ) = 0. Starting from this fact, one can #7/07. Received: 11/IX/07. Accepted: 0/V/08.

2 76 LAGRANGIAN AND HERMITIAN FINITE ELEMENT BASIS interpret the existence of points where the convergence order for derivatives is higher than the usual one. This observation was done by Strang and Fix 1 in the sense of a purely mathematical interpolation problem. What exactly means that the true field u and the interpolated field u h are such that in certain notable points ξ u (ξ) = u h (ξ). (1) Naturally, such kind of coincidence depends on the functional space to which the interpolant and exact field belong to. Several arguments and paradigms have been applied to overcome the fundamental problem in the determination of the superconvergent points for derivatives. The central point in this topic is summarized by the fact that the exact solution is unknown or equivalently the functional space to which u belongs to is not known as well. To overcome this, Prathap s paradigm assumes explicitly that the true field u P k+1 (Î ), therefore, u is a one polynomial order higher than the lagrangian finite element interpolant u h. This hypothesis was also assumed by MacNeal to determine the Barlow Points and to demonstrate that in general Gaussian quadrature rule points do not coincide with the former (see also recent paper by Zhang 16). The Gaussian quadrature points are defined as the zeros of the Legendre s Polinomials on 1, +1 (see Table 1). order n 1 ξ P n (ξ) (ξ 1) (5ξ ξ) 8(5ξ 0ξ + ) 5 80(6ξ 5 70ξ + 15ξ) Table 1 Gauss-Legendre s Polynomial. Definition of superconvergence Typically, if the error in the finite element field converges as h k+1, then, the error in the finite element gradient field converges as h k where h is the maximum diameter

3 DAVID SOARES PINTO JÚNIOR 77 of the finite element discretization and k is the spectral order of the interpolation. These facts are well known in the classical finite element interpolation theory and given by the classical estimates in L -norm u u h L Ch k+1 () u u h L Chk () Generally speaking, the superconvergence is defined as a higher order of convergence which is exhibited by interior points of the finite element solution where the derivative assumes an O(h k+1 ) convergence, thus, one order higher when compared with an O(h k ) of the finite element derivative field. Historically, the higher order accuracy property was first noticed by Barlow 1 and its existence was firstly formulated by Strand and Fix 1. This concept can be extended to similar properties but referring to O(h k+ ) convergence and O(h k+ ) convergence called simply ultraconvergence and hyperconvergence by using systematically the Taylor s Series Theorem 5, 6. The superconvergence is also linked to the concept of reduced integration and zero energy modes so important in the Finite Element Theory 15. Even more important, the superconvergence points are of utility as sampling points for the finite element designers in formulations like gradient smoothening or gradient recovery in the sense of The Superconvergent Patch Recovery as sketched by Zienkiewcz 1. However, the major significance of these points that explains all kind of numerical and analytical studies in this topic refers to its application in adaptive finite element analysis, especially for construction of error indicators based on the recovered gradient or hessian. The Taylor s series expansion theorem Limiting the discussion to a one dimensional problem for a discretization with equally spaced nodes and using a lagrangian basis, the finite element interpolant for a given exact function u is written simply as u h (x) = k u i L i (x), () i=0

4 78 LAGRANGIAN AND HERMITIAN FINITE ELEMENT BASIS where u i = u(x i ) is the degree of freedom calculated in the nodal point x i. The functional degree of freedom u i is, then, expanded around a point x inside the element by applying the Taylor s series expansion which can be expressed as u(x i ) = i=0 1 i! Di x u(x)hi x, (5) where h i x = x i x and Dx i = di dx. i Under these conditions the interpolant u h can be formally differentiated to form u h (x) = k i=0 u i L i (x), (6) The functional degree of freedom is, then, expanded around an arbitrary point x inside the element by applying the Taylor s Series Expansion and, hence, the derivative field u h is written in the form k u h (x) = L i (x) 1 j! D x j u(x)h x j i,, (7) i=0 where h xi = x i x. Rearranging the terms, u h (x) = k i=0 u i L i (x) can be expressed as ( N ) ( u h (x) = N ) L i (x) u(x) + L i (x i x) u (x) + i=1 j=0 i=1 ( N ) L i (x)(x i x) u (x) +....! i=1 After deriving the partition unity identity for Lagrange s Shape Function Basis one obtains ( N u (x) u i L i (x) = N ) L i (x)(x i x) j u ( j) (x) (9) j! where i=1 j= N i=1 i=1 L i (x) = 0. (8)

5 DAVID SOARES PINTO JÚNIOR 79 Defining the exact error in the derivative field as e (x) = u (x) u h (x) and noting that all terms vanish until the order k by applying the completeness properties of Lagrange s Basis then e (x) = j=k+1 ( N L i (x)(x i x) j i=1 j! u ( j) (x)). (10) By using the generalized triangular inequality, the error expression e (x) allows us to define a consistent superconvergence concept by using the equivalence binary relation α O(h p ) f (x) α + O(h p ), α, α + R + f = O(h p ), p N is the spectral order of the lagrangian element. Hence, the existence of superconvergent points for the first order derivative consist of the points x inside the element where the exact error expression satisfies the superconvergence condition given by u (x) u h (x) = O(hk+1 )..1 Definition of superconvergent points By a superconvergent point x for u h, one understands a point such as s k (x) = k L i (x)(x i x) k+1 i=0 (k + 1)! = 0 e (x) = O(h k+1 ). (11) The function s k (x) will be hereinafter referred to as superconvergence function or zero-error mode for a derivative field u (x)h. Similarly, one can define the ultraconvergent points and hyperconvergent points for the derivative field u h.. Definition of ultraconvergent points By a ultraconvergent point x for u h, one understands a point such as s k (x) = k L i (x)(x i x) k+1 i=0 = 0, (k+1)! u k (x) = k L i (x)(x i x) k+ i=0 = 0 (k+)! e (x) = O ( h k+). (1)

6 80 LAGRANGIAN AND HERMITIAN FINITE ELEMENT BASIS. Definition of hyperconvergent points By a ultraconvergent point x for u h, one understands a point such as s k (x) = k L i (x)(x i x) k+1 i=0 = 0, (k+1)! u k (x) = k L i (x)(x i x) k+ i=0 = 0, (k+)! h k (x) = k L i (x)(x i x) k+ i=0 = 0 (k+)! e (x) = O ( h k+). (1) Hence, starting from a Lagrange s Family element interpolant which derivative is calculated by differentiating the interpolant, a set of superconvergent points for the first order derivative is, then, obtained by calculating the zeros of the superconvergence function s k (x). Interestingly, the superconvergence function s k (x) can be expressed simply as the following polynomial s k (x) = k i=0 L i k+1 (x)xi (k + 1)x k = 0 (1) after using all completeness properties of Lagrange s basis, where {L i } k i=0 is the Lagrange s Basis, k is the spectral order of the interpolation and x is the coordinate of an arbitrary point inside the reference element. If the symbolic software, Mathematica, is used a remarkable set of points can be calculated analytically which are the zeros of Legendre polynomials and, hence, the Gaussian quadrature points but not for higher spectral order as inferred from Table 1. It s important to emphasize that the completeness property of the Lagrange s basis is fundamental in order to simplify the deduction by applying the ideas firstly discussed by Carey. Basically, the completeness consists of several identities that depend on the degree of lagrangian basis function. The fundamental expression in terms of completeness property represents the partition of unity and is written as k L i (x) = 1. (15) i=0 Similarly, expressions like the previous one can be proved but their number restricts their citation (see reference and references therein).

7 DAVID SOARES PINTO JÚNIOR 81 The superconvergence curve s k (x) is plotted against the x-coordinate in Figure 1 for k = 1,,,, 5 over the interval 1, +1. In each case, the curve s k intersects the x-axes k times at the superconvergent points where the e (x) = O(h k+1 ). The zero-error points for the derivative field are summarized in Table 1. Similarly, the Gauss-Legendre polynomials P n (x) are plotted against the x-coordinate in Figure for n = 1,,,, 5. It is then obvious that, by comparing Figure 1 and Figure, the fact notified by Prathap that the Gauss points may or may not coincide with the Barlow points especially for higher order elements. Comparison of Figure 1 and Figure shows that the curves s k (x) and P n (x) are similar qualitatively both in shape and number of zeros whenever k = n although significantly different in terms of quantification as observed from the algebraic expressions for s k (x) and P n (x), summarized in Table 1 and Table. The ultraconvergence functions u k (x) for the derivative field are listed in Table. These functions do not coincide with the superconvergence functions for the case of k = 1,,,, 5 as summarized in Table. By comparing the zeros of u k and s k (see Table and Table 5) one can conclude that an O(h k+ ) convergence is impossible to happen mathematically with a straightforward application of the Taylor s Series paradigm. Therefore, the ultraconvergence phenomenon as notified by Zienkiewicz in his numerical experiments are believed to be a numerical coincidence (see reference 1). It is important to comment the existence of purely imaginary ultraconvergent zeros as one can infer from Table. It is not a simple matter of interpreting the significance of such kind of points in terms of numerical convergence. Note also that the centroid is a ultraconvergent point for quadratic, cubic and quartic lagrangian elements, unlike in the case of k = 1 and k = 5. This can explain consistently the usual choice of the geometric center of the element as the natural sampling point for the calculation of the gradient finite element designers. Superconvergence invariance Let x = G(ξ) be a geometric transformation from the reference element onto a lagrangian finite element with nodes x 0, x 1,,, x k. Assuming that the set of nodes is equally spaced the isoparametric mapping x = G(ξ) is defined

8 8 LAGRANGIAN AND HERMITIAN FINITE ELEMENT BASIS x 1 a) x b) x c) 1.5 Figure 1 (a, b, c) Zero-error modes s k (x) for u h (x), k = 1,,,, 5.

9 DAVID SOARES PINTO JÚNIOR 8 x d) x e) Figure 1 (d, e) Zero-error modes s k (x) for u h (x), k = 1,,,, 5. order k s k (x) 1 x x + 1 x x 5x + 15 x 1 5 6x x x Table Zero-error modes for u h.

10 8 LAGRANGIAN AND HERMITIAN FINITE ELEMENT BASIS x 1 a) x b) x 1 c) Figure (a, b, c) Gauss-Legendre s Polynomials P n (x) for n = 1,,,, 5.

11 DAVID SOARES PINTO JÚNIOR x d) x 6 e) 8 Figure (d, e) Gauss-Legendre s Polynomials P n (x) for n = 1,,,, 5. order k u k (x) x x + 8x x + 15x x 5 x + x x 015x +1875x 6 65 Table Ultraconvergence function for u h.

12 86 LAGRANGIAN AND HERMITIAN FINITE ELEMENT BASIS k 1 ± Ultraconvergent points i 0, ± 1 0, ± = ±0.7967, ± = ± i 0, ± 1, ± 5 ± ± i, ±0.87 ± i, ± ± i Table Zeros of the ultraconvergence function for u h. k Superconvergent points Gauss points ± / = ± ± / = ± , ± 5/ = ± , ± /5 = ± ± 9/5 ± = ±0.7195, ±0.81 ± 7 ± 6 7 = ±0.998, ± , ± 5± ± 10/7 = ±0.98, ± , ± = ±0.586, ± Table 5 Numerical values of superconvergent points and Gauss points. simply as x = G(ξ) = k L i (ξ)x i. (16) i=1 By a simple algebrism one can express the transformation above for a linear lagrangian element as x = x 0+x 1 + x 1 x 0 ξ. Similarly, for a quadratic lagrangian element the mapping becomes simply x = x 1 + x x 0 ξ + x 0 x 1 +x ξ. Noting that by hypothesis the nodes are equally spaced then the quadratic term vanishes and thus, for k =, x = x 1 + x x 0 ξ. Analogously, for k = the isoparametric transformation is expressed as x = x 0 + 9x x (x 0 x 1 x + x ) 16 + x 0 7x 1 + 7x x ξ 16 ξ + 9x 0 + 7x 1 7x + 9x ξ. 16

13 DAVID SOARES PINTO JÚNIOR 87 Hence, after applying the assumption of equally spaced nodes within a cubic element, one obtains x = x 0 + x + x x 0 ξ. (17) For a quartic lagrangian element the isoparametric mapping is of the form x = x + x 0 8x 1 + 8x x 6 + x 0 + 8x 1 8x + x 6 ξ + x x 1 0x + 16x x ξ 6 ξ + x 0 16x 1 + x 16x + x ξ. 6 Again, with a uniform distribution of nodes within the element, the isoparametric transformation can be expressed as x = x 0 + x + x x 0 ξ. (18) The explicit analytical expression for the isoparametric mapping corresponding to a quintic lagrangian element can also be deduced which is represented by the polynomial x = a 0 + a 1 ξ + a ξ + a ξ + a ξ + a 5 ξ 5 where the coefficients are a 0 = 9x 0 75x 1 +50x +50x 75x +9x 5, 768 a 1 = 9x 0+15x 1 50x +50x 15x +9x 5 768, a = 50x x x 1700x +1950x 50x = 0, a = 50x 0 50x1+8500x 8500x +50x 50x = 0, a = 65x x x +150x 1875x +65x = 0, a 5 = 65x 0+15x 1 650x +650x 15x +65x = 0. (19) It s simple to verify that the coefficients of higher degree are identically null under the nodal uniformity condition, thus, the mapping above has its linear part reduced to the affine map x = x 0 + x 5 + x 5 x 0 ξ. (0) Starting from a uniformity condition of nodal distribution inside the one dimensional lagrangian element, having nodal points x i = x 0 + ih, i = 1,..., k,

14 88 LAGRANGIAN AND HERMITIAN FINITE ELEMENT BASIS where h = x i x i 1 and after expanding x = G(ξ) = k L i (ξ)x i i=1 one can prove that all higher degree, nonlinear terms vanish. Generalizing by induction the isoparametric mapping is simply the affine mapping x = x + J x ξ (1) where x is the geometric centroid of the element, J x = h x / is the jacobian of the transformation and h x is the length of the element. Therefore, if equally spaced nodes are used the isoparametric mapping can be expressed as an affine transformation which is obviously bijective and thus invertible. In this particular case, the set of superconvergent points S k,î = {ξ i Î s k (ξ i ) = 0, 1 i k} is such that card S k,î = k = card (G(S k,î ). In conclusion, whenever the nodes are uniformly distributed the isoparametric mapping is an affine transformation and under this condition the number of zeros for s k (x) is equal to those for (s k G 1 )(x). It means that the superconvergent points are preserved on a general uniform element. In this section, we analyse the question of the invariance of the superconvergence properties if the nodal points are not equally spaced inside the element. In order to study the variation of the superconvergent coordinates inside the reference element a single node can move freely while all remainders are kept on fixed. The consistence of formulas can also be applied to explain the coincidence between the Barlow points and Gaussian quadrature points for linear elements in 1D with nodes x 0 and x 1. In this particular case, the superconvergent points are simply the zero of the superconvergence function s 1 (x) = x + x 0 + x 1 = 0. () Obviously, the zero is the centroid of the element which coincides exactly with the Gauss quadrature point obtained by calculating the zero of the Legendre s polynomial over the reference element 1, +1. One can reproduce exactly

15 DAVID SOARES PINTO JÚNIOR 89 the superconvergence function for a two node element by comparing the former with the Legendre s polynomial written in the form P n (x) = Dx n (x 1) n, Dx n = dn dx, () n for n = 0 and determining the zeros of P n+1 (x) = P 0+1 (x) = D 1 x (x 1) 1. Let us consider a three node one dimensional element. Assuming that the midpoint x 1 is free the superconvergence function s (x) is written as s (x) = a (x 1 )x + a 1 (x 1 )x + a 0 (x 1 ) = 0. () If the nodal points are equally spaced inside the element this polynomial coincides with the Legendre polynomial where a (x 1 ) =, a 1 (x 1 ) = 0, a 0 (x 1 ) = 1, which zeros are the Gaussian quadrature points. However, if the midpoint is randomly positioned inside the element, then, the superconvergence function is s (x) = x + x 1 x 1 = 0. (5) Therefore, the polynomial coefficients are not invariant under a coordinate changing of the nodal points. Such counter-example shows clearly that the superconvergent points position may vary inside the element for an arbitrary element with randomly distributed nodes. Similar calculations can be performed for a four nodes one dimensional element by assuming, without limitation of generality, that x 1 and x are varying freely under the symmetric configuration of nodes expressed as x 1 = x while the end nodes are fixed and set to be x 0 = 1 and x = +1. In this case, the superconvergence function is written in the form s (x) = x ( 1 + x 1) x = 0. (6) By comparing the superconvergence function s (x) for a cubic element with a Legendre s polynomial of third degree which zeros are calculated from 5x x = 0, one can infer that the zeros of s (x) reproduce exactly the Barlow points, setting x 1 = x = 1/ as illustrated in Table 1. Let us now assume that the nodal configuration inside a five nodes one dimensional element permits x 1 and x vary freely while x 0 = 1, x = 0 and

16 90 LAGRANGIAN AND HERMITIAN FINITE ELEMENT BASIS x = +1. To simplify the algebrism, it is assumed that x 1 and x are symmetrically placed, thus, x 1 = x. After substituting all completeness properties for a quartic element and the imposed symmetry condition, the superconvergence function up to a signal is written as s (x) = 5x + ( 1 + x 1) x + x 1 = 0. (7) For the purpose of expressing the superconvergence function s 5 (x) in terms of a single free node let us enforce the symmetry condition x = x for a six nodes lagrangian finite element. Using this condition, the s 5 (x) becomes ( ) ( ) s 5 (x) = 6x x 68x x x = 0. (8) 5 Firstly, this confirms one more time that the coefficients depend on, in general, the nodal coordinates. In conclusion, the superconvergence function is not invariant for a configuration of randomly distributed nodes inside the element. In fact, MacNeal found out that Gaussian quadrature points and Barlow points are coincident for lower order elements whereas it is not true for higher order elements as illustrated in Table 1. Similarly, Prathap 10 showed how to determine the Barlow points from a variational basis and from the Taylor s Series approach it is also possible to work out that for not equally spaced nodes inside the element, in general, the superconvergence point can change its coordinate. 5 The Hermitian Basis For the purpose of calculating optimal points x in case of a Hermitian Basis H i (x), i = 0, 1,,, the hermitian interpolant is assumed to be the linear combination u h (x) = u 0 H 0 (x) + u 1 H 1 (x) + u 0 H (x) + u 1 H (x). (9) By deriving the equation (9), one follows that u h (x) = u(x 0)H 0 (x) + u(x 1)H 1 (x) + u (x 0 )H (x) + u (x 1 )H (x) (0) Expanding the degree of freedom u 0, u 1, u 0, u 1 with h x 0 = x 0 x e h x1 = x 1 x around the x one obtains u 0 = u(x 0 ) = u(x) + u (x)h x0 + u (x) h x 0! + u () h x 0! + u () (x) h x 0! + (1)

17 DAVID SOARES PINTO JÚNIOR 91 u 1 = u(x 1 ) = u(x) + u (x)h x1 + u (x) h x 1! + u () (x) h x 1! + u () (x) h x 1! + () u 0 = u (x 0 ) = u (x) + u (x)h x0 + u () (x) h x 0! + u () (x) h x 0! + () u 1 = u (x 1 ) = u (x) + u (x)h x1 + u () (x) h x 1! + u () (x) h x 1! + () After substituting equations (1), (), (), () in equation (9), u h (x) takes the form u h (x) = u(x) + u (x)h x0 + u (x) h x 0! + u(x) + u (x)h x1 + u (x) h x 1! + u (x) + u (x)h x0 + u () (x) h x 0! + u (x) + u (x)h x1 + u () (x) h x 1! + u () (x) h x 0! + u () (x) h x 1! + u () (x) h x 0! + u () (x) h x 1! + u () (x) h x 0! + + u () (x) h x 1 +! + + H (x) H (x). H 0 (x) H 1 (x) Rearranging the terms in the equation (5), the resulting equation is then (5) u h (x) = H 0 (x) + H 1 }{{ (x) u(x) } I 1 + H 0 (x)h x 0 + H 1 (x)h x 1 + H (x) + H }{{ (x) u (x) } I + H 0 (x) h x 0 + H 1! (x) h x 1 + H! (x)h x 0 + H (x)h x 1 u (x) }{{} I + H 0 (x) h x 0 + H 1! (x) h x 1 + H! (x) h x 0 + H! (x) h x 1 u () (x)! }{{} I + H 0 (x) h x 0 + H 1! (x) h x 1 + H! (x) h x 0 + H! (x) h x 1 u () (x)! }{{} I 5 + (6)

18 9 LAGRANGIAN AND HERMITIAN FINITE ELEMENT BASIS Now, considering the Hermite shape functions over the reference element Î = 1, +1 their derivatives in the optimal point are expressed as H 0 (x) = 1 ( ) + x, H 1 (x) = 1 ( ) x, (7) H (x) = 1 ( 1 x + x ), H (x) = 1 ( 1 + x + x ). (8) It is a simple algebrism to prove that the identity I 1 in equation (6) is null since that Hermite shape functions satisfy H 0 (x) + H 1 (x) = 1 that implies H 0 (x) + H 1 (x) = 0 after deriving in x. Substituting the expressions for h x 0 and h x1 the identity I in (6) becomes I = H 0 (x) + H 1 (x) + H (x) H (x) x H 0 (x) + H 1 (x) (9) Noting that the wronskian of the Hermite s shape functions is not zero then set {H i } i=0 is a basis therefore, combining with the completeness property one follows that x = x 0 H 0 (x)+ x 1 H 1 (x)+ H (x)+ H (x) and if x 0 = 1, x 1 = +1 then H (x) + H (x) = 1 + H 0 (x) H 1 (x) that implies I = 1 in (6). Following the arguments above let us prove that the coefficient I below I = 1 H 0 (x) + H 1 (x) + x (H 0 (x) + H 1 (x)) +x (0) H 0 (x) H 1 (x) H (x) + H (x) H (x) + H (x). is identically null. To do this note initially that H 0 (x) + H 1 (x) = 0 and hence I is given by I = x H (x) + H }{{ (x) = 0. (1) } x Starting from the analogous arguments and hypothesis it is possible to demonstrate the nulling of the coefficient I in (6) expressed as I = 1 x H 0 (x) + H 1 (x) 1 6 x H 0 (x) + H 1 (x) 1 H 6 0 (x) H 1 (x) + 1 x H 0 (x) H 1 (x) + 1 H (x) + H (x) + x H (x) H (x) () + 1 x H (x) + H (x).

19 DAVID SOARES PINTO JÚNIOR 9 By using the Hermitian basis properties in equation (), one obtains I = 1 H 0 (x) 1 H 1 (x) + x H (x) H (x) + 1 x + 1 () that implies I = 0. Surprisingly, the coefficient I 5 as defined in equation (6) is not identically null and it becomes after simplification I 5 = 1 6( x x ). () Assuming that u C 5 (Î ) then an O(h 5 ) convergence is obtained at the points where I 5 (x) = 0, thus, the optimal points are x = 0, ±1. Obviously, these points are exactly the nodal points where not only the nodal values u 0 and u 1 are coincident but also the derivative values u 0 and u 1. As expected, the centroid is an optimal point, exhibiting an O(h k+ ) convergence, therefore, it is an ultracovergent point if Hermite s finite elements are used since k = in this particular case. Hence, Hermite s basis shows higher accuracy when compared with the Lagrange s finite element for which the centroid is only superconvergent while the former is ultraconvergent. It makes sense then that the superconvergence phenomenon depends on the basis selected. 6 Barlow points for one dimensional Lagrange s elements The Barlow s Method for computing the optimal points usually assumes that the exact polynomial displacement field is one order higher than that of the finite element field. The arbitrariness of this assumption is necessary in order to derive the coordinates of the optimal points in the sense of Barlow since the exact field is unknown for the real world problems. Starting from the finite element displacement field written as u = Nu n which in a polynomial form is expressed as u = p(x) t a (5) where N is the shape function matrix, p(x) t is a matrix of monomial terms, and a is a vector of generalized parameters, after substituting the nodal co-ordinates

20 9 LAGRANGIAN AND HERMITIAN FINITE ELEMENT BASIS of the element for x in equation (5), the nodal displacement, u n, can be expressed as u n = Pa (6) where P is a matrix defined as P = p(x 1 ),..., p(x n ) t where n is the number of nodes in the finite element, x i are the nodal point co-ordinate vectors. If the element geometry is such that the inverse of P exists, then, the equation (6) is rewritten as From equations (5) and (7) follows that Now let the exact displacement field be expressed as a = P 1 u n (7) N = p(x) t P 1 (8) u = p(x) t b + q(x) t c = r(x) t d (9) where r(x) t = p(x) t q(x) t and d = b c t, q(x) t is a matrix of monomial terms, and c, the vector of arbitrary constants. After substituting the nodal coordinates x in equation (9), one obtains u n = Pb + Qc (50) From equations (5) and (9), the finite element strain and exact strain field are expressed as ɛ n = (LN)u n (51) ɛ = Lr(x) t d (5) where L is a differential operator matrix. Using equation (8) and (50), equation (5) simplifies to ɛ = L ( Nu n NQc + q(x) t c ) (5) The error in the stress, e σ, with the Barlow s hypothesis that u n calculated by = u n, is e σ = D(ɛ ɛ) = DL(NQ q(x) t )c) (5)

21 DAVID SOARES PINTO JÚNIOR 95 Since c is an arbitrary constant, the Barlow Points are given by the zeros of the nonlinear vector equation DL ( NQ q(x) t) = 0 (55) 6.1 Linear elements Using the linear lagrangian element, Equations (5), (6), (7) and (8) yield to u(x 1 ) u = Nu n u h = L 1 L (56) u(x ) u = p(x) t a u h = 1 x a 1 a (57) u(x 1 ) = a 1 + a x 1 u(x ) = a 1 + a x u(x 1 ) 1 x 1 a 1 =. (58) u(x ) 1 x a }{{}}{{}}{{} u n P a Obviously, x 1 = x, then P 1 exists. Assuming that the exact field is one order higher than the linear finite element interpolant, then equation (9) gives b 1 u = 1 x + x c 1 (59) b u(x 1 ) = b 1 + b x 1 + c 1 x1 u(x ) = b 1 + b x + c 1 x u(x 1 ) u(x ) }{{} 1 x 1 b 1 x 1 = + 1 x b x c 1. (60) }{{}}{{}}{{}}{{} c P b Q u n u = L 1 (x) u(x 1 ) c 1 x 1 + L (x) u(x ) c 1 x + x c 1. (61)

22 96 LAGRANGIAN AND HERMITIAN FINITE ELEMENT BASIS Deriving equation (61) and the linear finite element interpolant and substituting in equation of the error (5), one obtains e σ = c 1 (x 1 + x x). Thus, the Barlow point for a two-noded lagrangian element coincides with the centroid of the element. 6. Quadratic elements Following the same procedure one has u(x 1 ) u = Nu n u h = L 1 L L u(x ) (6) u(x ) a 1 u = p(x) t a u h = 1 x x (6) u(x 1 ) = a 1 + a x 1 + a x1 u(x ) = a 1 + a x + a x u(x ) = a 1 + a x + a x u(x 1 ) u(x ) } u(x ) {{ } u n a a 1 x 1 x1 = 1 x x } 1 x {{ x } P Putting in the form of equation (9) one obtains b 1 u = p(x) t b + q(x) t c = 1 x x + u(x 1 ) = b 1 + b x 1 + b x1 + c 1x1 u(x ) = b 1 + b x + b x + c 1x u(x ) = b 1 + b x + b x + c 1x 1 x 1 x1 b 1 = 1 x x b + } 1 x {{ x } b }{{} P b b b x1 x x u(x 1 ) u(x ) x } u(x ) {{ } } {{ } Q u n a 1 a a }{{} a. (6) c 1. (65) c 1. (66) }{{} c

23 DAVID SOARES PINTO JÚNIOR 97 Hence, by deriving the exact displacement field u = L 1 (x) u(x 1 ) c 1 x1 + L (x) u(x ) c 1 x +L (x) u(x ) c 1 x + x c 1. (67) and substituting into the stress error e σ given by the equation (5), one obtains e σ = c 1 L 1 (x)x 1 + L (x)x + L (x)x x. (68) 6. Cubic elements In case of cubic lagrangian finite element from equations (5), (6), (7) and (8) follows that u = Nu n u h = L 1 L L L u = p(x) t a u h = 1 x x x u(x 1 ) u(x ) u(x ) u(x ) a 1 a a a (69) (70) u h (x 1 ) = u(x 1 ) = a 1 + a x 1 + a x1 + a x1 u h (x ) = u(x ) = a 1 + a x + a x + a x u h (x ) = u(x ) = a 1 + a x + a x + a x u h (x ) = u(x ) = a 1 + a x + a x + a x u(x 1 ) 1 x 1 x1 x1 a 1 u(x ) 1 x x x a = u(x ) 1 x x x. (71) a u(x ) 1 x x x a }{{}}{{}}{{} u n P a

24 98 LAGRANGIAN AND HERMITIAN FINITE ELEMENT BASIS Using the equation (9) follows that u = p(x) t b + q(x) t c = 1 x x x b 1 b b + x c 1. (7) b u(x 1 ) = b 1 + b x 1 + b x1 + b x1 + c 1x1 u(x ) = b 1 + b x + b x + b x + c 1x u(x ) = b 1 + b x + b x + b x + c 1x u(x ) = b 1 + b x + b x + b x + c 1x 1 x 1 x1 x1 b 1 1 x x x b = 1 x x x + b } 1 x x {{ x } b }{{} P b x1 x x x } {{ } Q Deriving the exact displacement field given below u = L 1 (x) u(x 1 ) c 1 x 1 + L (x) u(x ) c 1 x u(x 1 ) u(x ) u(x ) u(x ) }{{} u n c 1. (7) }{{} c +L (x) u(x ) c 1 x + L (x) u(x ) c 1 x + x c 1. and substituting into the stress error expression given by (5), then (7) e σ = c 1 L 1 (x)x 1 + L (x)x + L (x)x + L (x)x x. (75) 6. Fourth order elements Similarly, for fourth order lagrangian finite element from equations (5), (6), (7) and (8) follows that u(x 1 ) u(x ) u = Nu n u h = L 1 L L L L 5 u(x ) (76) u(x ) u(x 5 )

25 DAVID SOARES PINTO JÚNIOR 99 u = p(x) t a u h = 1 x x x x a 1 a a a (77) a 5 u h (x 1 ) = u(x 1 ) = a 1 + a x 1 + a x1 + a x1 + a 5x1 u h (x ) = u(x ) = a 1 + a x + a x + a x + a 5x u h (x ) = u(x ) = a 1 + a x + a x + a x + a 5x u h (x ) = u(x ) = a 1 + a x + a x + a x + a 5x u h (x 5 ) = u(x 5 ) = a 1 + a x 5 + a x5 + a x5 + a 5x5 u(x 1 ) 1 x 1 x1 x1 x1 a 1 u(x ) 1 x x x x a u(x ) = 1 x x x x a. (78) u(x ) 1 x x x x a u(x 5 ) 1 x 5 x5 x5 x5 a 5 }{{}}{{}}{{} u n P a Again, by deriving the exact displacement field given below u = L 1 (x) u(x 1 ) c 1 x1 5 + L (x) u(x ) c 1 x 5 + L (x) u(x ) c 1 x 5 + L (x) u(x ) c 1 x 5 + L 5 (x) u(x 5 ) c 1 x5 5 + x 5 c 1. and substituting into the stress error expression given by (5), then (79) e σ = c 1 L 1 (x)x L (x)x5 + L (x)x5 + L (x)x5 + L 5 (x)x5 5 5x. (80) 6.5 Fifth order elements u = Nu n u h = L 1 L L L L 5 L 6 u(x 1 ) u(x ) u(x ) u(x ) u(x 5 ) u(x 6 ) (81)

26 00 LAGRANGIAN AND HERMITIAN FINITE ELEMENT BASIS u = p(x) t a u h = 1 x x x x x 5 a 1 a a a a 5 (8) a 6 Calculating u h in each node and expressing it in both basis, it turns out that u n = Pa a = P 1 u n. But the Vandermonde s matrix P 1 x 1 x1 x1 x1 x1 5 1 x x x x x 5 P = 1 x x x x x 5 1 x x x x x 5 (8) 1 x 5 x5 x5 x5 x5 5 1 x 6 x6 x6 x6 x6 5 is invertible with equally spaced nodes. Hence, after substituting the exact field and the finite element interpolant field into the error equation in stress, one obtains e σ = c 1 L 1 (x)x L (x)x6 + L (x)x6 + L (x)x6 + L 5 (x)x6 5 + L 6 (x)x6 6 6x5. (8) All analytical expressions for the error e σ and the points where it is null are summarized in Table 6 and Table 7. By comparing Gauss points, Barlow points and Superconvergent points we can conclude that coordinates are different for each kind of optimal point, especially if higher order elements are used. 7 Concluding remarks In this paper, Gaussian quadrature points, Superconvergent points in the sense of Taylor s Expansion and Barlow points are studied, proving the existence and summarizing the exact locations and convergence order as well for several spectral orders. As expected, the superconvergence property is not invariant under a changing in the node distribution inside the element, emphasizing the full importance of this open question related to non-uniform discretizations. The phenomenon of ultraconvergence, i.e. O(h k+ ) convergence, is proved to be a

27 DAVID SOARES PINTO JÚNIOR 01 order k ɛ σ (x) 1 cx c(1 x ) c ( 0 x x ) 5 9 ) c ( 1+15x 0x ) c ( 59x+1750x 1875x 5 65 Table 6 Barlow s functions in 1D. k 1 0 Barlow s points ± 0, ± 5 ± 5 0, ± 9 ± 5 5±8 7 5 Table 7 Barlow s points. numerical coincidence since the zeros of the superconvergence and ultraconvergence function are different in general if a Lagrange s Basis is used. In case of Hermitian basis, the centroid shows an O(h 5 ) convergence in the sense of Taylor Expansion, confirming that the center of the element is still the optimal position to calculate the derivative and more importantly a higher accuracy is also obtained from Hermitian finite element interpolants. Two further points need to be discussed. The first is the invertibility of the isoparametric mapping which is related to the existence of superconvergent points if distorted and higher order elements are used. The natural question is now directed to the geometric transformation under which the reference element is mapped onto an arbitrary, general element. What assumptions should be imposed to the geometric mapping x = F(ξ) in order to keep on the superconvergent point? In summary, what kind of geometric transformation can

28 0 LAGRANGIAN AND HERMITIAN FINITE ELEMENT BASIS preserve the set of superconvergent points inside the element? It is a particularly important point since in finite element applications the mesh refinement leads to varying valence discretizations and several error indicators are based on gradient recovery and sampling superconvergent points 1. The second point is that for higher spatial dimensions the complexity is seriously higher since the set of superconvergent points represents a superconvergence curve in D case or a superconvergence surface in D case. These topics will be considered in further discussion. REFERENCES 1 J. Barlow, Optimal stress locations in finite element models. Int. J. for Num. Meth. in Engng., 10 (1976), 51. K.M. Liew and S. Rajendran, New superconvergent points of the 8-node serendipity plane element for patch recovery. Int. J. for Num. Meth. in Engng., 5 (00), R.G. Mackinnon and G.F. Carey, Superconvergent derivatives: A Taylor Series Analysis. Int. J. for Num. Meth. in Engng., 8 (1989), R.H. MacNeal, Finite Elements: Their Design and Performance. Marcel Dekker, New York (199). 5 D.S. Pinto Jr., Superconvergent Derivatives in Finite Element Method. PIBIC-CNPq/UFS, Technical Report (001-00) (in portuguese). 6 D.S. Pinto Jr., On Higher Order Accuracy Points for First and Second Order Derivatives of Lagrangian Finite Element Interpolants. XXV CNMAC, Nova Friburgo, RJ (00). 7 D.S. Pinto Jr., Numerical and Analytical Studies of Superconvergence for First and Second Order Derivatives in Finite Element Interpolations. Procedings of st Ibero-Latin American Congress on Computer Methods in Engineering, GiuliaNova, Italy (00). 8 D.S. Pinto Jr., The Superconvergence Points for Gradient and Hessian in the Quadrilateral Lagrangian Element. Procedings of th Ibero-Latin American Congress on Computer Methods in Engineering, Ouro Preto/MG, Brazil (00). 9 D.S. Pinto Jr., Studies on Barlow Points, Gauss Points and Superconvergent Points in 1D for Lagrange s Finite Elements. Procedings of 7 th Ibero-Latin American Congress on Computer Methods in Engineering, Campinas/SP, Brazil (006). 10 G. Prathap, Barlow Points and Gauss Points and the aliasing and best fit paradigms. Computers and Structures, 58 (1996), G. Prathap, The Finite Element Method in Structural Mechanics. Kluwer Academic Publishers, Dordrecht, (199).

29 DAVID SOARES PINTO JÚNIOR 0 1 G. Strang and GJ. Fix, An analysis of the finite element method. Prentice-Hall:Englewood Cliffs, NJ (197). 1 O.C. Zienkiewicz and J.Z. Zhu, The Superconvergent patch recovery and a posteriori error estimates. Part 1: The recovery technique. Int. J. for Num. Meth. in Engng., (199), O.C. Zienkiewicz and J.Z. Zhu, The Superconvergent patch recovery and a posteriori error estimates. Part : Error Estimates and Adaptivity. Int. J. for Num. Meth. in Engng., (199), M. Zlamal, Superconvergence and reduced integration in the finite element method. Math. Computations, (1978), X. Zhang, Why do Barlow points not coincide with the reduced Gauss quadrature points or higher-order finite elements. Commun. Numer. Meth. Engng., (in press).

arxiv: v1 [math.na] 1 May 2013

arxiv: v1 [math.na] 1 May 2013 arxiv:3050089v [mathna] May 03 Approximation Properties of a Gradient Recovery Operator Using a Biorthogonal System Bishnu P Lamichhane and Adam McNeilly May, 03 Abstract A gradient recovery operator based

More information

Ultraconvergence of ZZ Patch Recovery at Mesh Symmetry Points

Ultraconvergence of ZZ Patch Recovery at Mesh Symmetry Points Ultraconvergence of ZZ Patch Recovery at Mesh Symmetry Points Zhimin Zhang and Runchang Lin Department of Mathematics, Wayne State University Abstract. The ultraconvergence property of the Zienkiewicz-Zhu

More information

Finite Elements. Colin Cotter. January 18, Colin Cotter FEM

Finite Elements. Colin Cotter. January 18, Colin Cotter FEM Finite Elements January 18, 2019 The finite element Given a triangulation T of a domain Ω, finite element spaces are defined according to 1. the form the functions take (usually polynomial) when restricted

More information

AN ALTERNATIVE TECHNIQUE FOR TANGENTIAL STRESS CALCULATION IN DISCONTINUOUS BOUNDARY ELEMENTS

AN ALTERNATIVE TECHNIQUE FOR TANGENTIAL STRESS CALCULATION IN DISCONTINUOUS BOUNDARY ELEMENTS th Pan-American Congress of Applied Mechanics January 04-08, 00, Foz do Iguaçu, PR, Brazil AN ALTERNATIVE TECHNIQUE FOR TANGENTIAL STRESS CALCULATION IN DISCONTINUOUS BOUNDARY ELEMENTS Otávio Augusto Alves

More information

2. Polynomial interpolation

2. Polynomial interpolation 2. Polynomial interpolation Contents 2. POLYNOMIAL INTERPOLATION... 1 2.1 TYPES OF INTERPOLATION... 1 2.2 LAGRANGE ONE-DIMENSIONAL INTERPOLATION... 2 2.3 NATURAL COORDINATES*... 15 2.4 HERMITE ONE-DIMENSIONAL

More information

Nodal O(h 4 )-superconvergence of piecewise trilinear FE approximations

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

Transactions on Modelling and Simulation vol 12, 1996 WIT Press, ISSN X

Transactions on Modelling and Simulation vol 12, 1996 WIT Press,   ISSN X Simplifying integration for logarithmic singularities R.N.L. Smith Department ofapplied Mathematics & OR, Cranfield University, RMCS, Shrivenham, Swindon, Wiltshire SN6 SLA, UK Introduction Any implementation

More information

Lecture Note 3: Interpolation and Polynomial Approximation. Xiaoqun Zhang Shanghai Jiao Tong University

Lecture Note 3: Interpolation and Polynomial Approximation. Xiaoqun Zhang Shanghai Jiao Tong University Lecture Note 3: Interpolation and Polynomial Approximation Xiaoqun Zhang Shanghai Jiao Tong University Last updated: October 10, 2015 2 Contents 1.1 Introduction................................ 3 1.1.1

More information

On the positivity of linear weights in WENO approximations. Abstract

On the positivity of linear weights in WENO approximations. Abstract On the positivity of linear weights in WENO approximations Yuanyuan Liu, Chi-Wang Shu and Mengping Zhang 3 Abstract High order accurate weighted essentially non-oscillatory (WENO) schemes have been used

More information

Lecture Note 3: Polynomial Interpolation. Xiaoqun Zhang Shanghai Jiao Tong University

Lecture Note 3: Polynomial Interpolation. Xiaoqun Zhang Shanghai Jiao Tong University Lecture Note 3: Polynomial Interpolation Xiaoqun Zhang Shanghai Jiao Tong University Last updated: October 24, 2013 1.1 Introduction We first look at some examples. Lookup table for f(x) = 2 π x 0 e x2

More information

3. Numerical integration

3. Numerical integration 3. Numerical integration... 3. One-dimensional quadratures... 3. Two- and three-dimensional quadratures... 3.3 Exact Integrals for Straight Sided Triangles... 5 3.4 Reduced and Selected Integration...

More information

Recovery Techniques in Finite Element Methods

Recovery Techniques in Finite Element Methods Chapter 8 Recovery Techniques in Finite Element Methods Zhimin Zhang Department of Mathematics Wayne State University Detroit, MI 48202 USA zhang@math.wayne.edu Contents 8. Introduction and preliminary.............................

More information

Interpolation Functions for General Element Formulation

Interpolation Functions for General Element Formulation CHPTER 6 Interpolation Functions 6.1 INTRODUCTION The structural elements introduced in the previous chapters were formulated on the basis of known principles from elementary strength of materials theory.

More information

on! 0, 1 and 2 In the Zienkiewicz-Zhu SPR p 1 and p 2 are obtained by solving the locally discrete least-squares p

on! 0, 1 and 2 In the Zienkiewicz-Zhu SPR p 1 and p 2 are obtained by solving the locally discrete least-squares p Analysis of a Class of Superconvergence Patch Recovery Techniques for Linear and Bilinear Finite Elements Bo Li Zhimin Zhang y Abstract Mathematical proofs are presented for the derivative superconvergence

More information

ETNA Kent State University

ETNA Kent State University Electronic Transactions on Numerical Analysis. Volume 37, pp. 166-172, 2010. Copyright 2010,. ISSN 1068-9613. ETNA A GRADIENT RECOVERY OPERATOR BASED ON AN OBLIQUE PROJECTION BISHNU P. LAMICHHANE Abstract.

More information

On an Approximation Result for Piecewise Polynomial Functions. O. Karakashian

On an Approximation Result for Piecewise Polynomial Functions. O. Karakashian BULLETIN OF THE GREE MATHEMATICAL SOCIETY Volume 57, 010 (1 7) On an Approximation Result for Piecewise Polynomial Functions O. arakashian Abstract We provide a new approach for proving approximation results

More information

POLYNOMIAL INTERPOLATION IN NONDIVISION ALGEBRAS

POLYNOMIAL INTERPOLATION IN NONDIVISION ALGEBRAS Electronic Transactions on Numerical Analysis. Volume 44, pp. 660 670, 2015. Copyright c 2015,. ISSN 1068 9613. ETNA POLYNOMIAL INTERPOLATION IN NONDIVISION ALGEBRAS GERHARD OPFER Abstract. Algorithms

More information

Fixed point iteration and root finding

Fixed point iteration and root finding Fixed point iteration and root finding The sign function is defined as x > 0 sign(x) = 0 x = 0 x < 0. It can be evaluated via an iteration which is useful for some problems. One such iteration is given

More information

JEPPIAAR ENGINEERING COLLEGE

JEPPIAAR ENGINEERING COLLEGE JEPPIAAR ENGINEERING COLLEGE Jeppiaar Nagar, Rajiv Gandhi Salai 600 119 DEPARTMENT OFMECHANICAL ENGINEERING QUESTION BANK VI SEMESTER ME6603 FINITE ELEMENT ANALYSIS Regulation 013 SUBJECT YEAR /SEM: III

More information

Numerical Analysis: Interpolation Part 1

Numerical Analysis: Interpolation Part 1 Numerical Analysis: Interpolation Part 1 Computer Science, Ben-Gurion University (slides based mostly on Prof. Ben-Shahar s notes) 2018/2019, Fall Semester BGU CS Interpolation (ver. 1.00) AY 2018/2019,

More information

(0, 0), (1, ), (2, ), (3, ), (4, ), (5, ), (6, ).

(0, 0), (1, ), (2, ), (3, ), (4, ), (5, ), (6, ). 1 Interpolation: The method of constructing new data points within the range of a finite set of known data points That is if (x i, y i ), i = 1, N are known, with y i the dependent variable and x i [x

More information

LECTURE 16 GAUSS QUADRATURE In general for Newton-Cotes (equispaced interpolation points/ data points/ integration points/ nodes).

LECTURE 16 GAUSS QUADRATURE In general for Newton-Cotes (equispaced interpolation points/ data points/ integration points/ nodes). CE 025 - Lecture 6 LECTURE 6 GAUSS QUADRATURE In general for ewton-cotes (equispaced interpolation points/ data points/ integration points/ nodes). x E x S fx dx hw' o f o + w' f + + w' f + E 84 f 0 f

More information

Scientific Computing WS 2018/2019. Lecture 15. Jürgen Fuhrmann Lecture 15 Slide 1

Scientific Computing WS 2018/2019. Lecture 15. Jürgen Fuhrmann Lecture 15 Slide 1 Scientific Computing WS 2018/2019 Lecture 15 Jürgen Fuhrmann juergen.fuhrmann@wias-berlin.de Lecture 15 Slide 1 Lecture 15 Slide 2 Problems with strong formulation Writing the PDE with divergence and gradient

More information

Two hours. To be provided by Examinations Office: Mathematical Formula Tables. THE UNIVERSITY OF MANCHESTER. 29 May :45 11:45

Two hours. To be provided by Examinations Office: Mathematical Formula Tables. THE UNIVERSITY OF MANCHESTER. 29 May :45 11:45 Two hours MATH20602 To be provided by Examinations Office: Mathematical Formula Tables. THE UNIVERSITY OF MANCHESTER NUMERICAL ANALYSIS 1 29 May 2015 9:45 11:45 Answer THREE of the FOUR questions. If more

More information

Nodal bases for the serendipity family of finite elements

Nodal bases for the serendipity family of finite elements Foundations of Computational Mathematics manuscript No. (will be inserted by the editor) Nodal bases for the serendipity family of finite elements Michael S. Floater Andrew Gillette Received: date / Accepted:

More information

The Closed Form Reproducing Polynomial Particle Shape Functions for Meshfree Particle Methods

The Closed Form Reproducing Polynomial Particle Shape Functions for Meshfree Particle Methods The Closed Form Reproducing Polynomial Particle Shape Functions for Meshfree Particle Methods by Hae-Soo Oh Department of Mathematics, University of North Carolina at Charlotte, Charlotte, NC 28223 June

More information

Numerical Methods. King Saud University

Numerical Methods. King Saud University Numerical Methods King Saud University Aims In this lecture, we will... find the approximate solutions of derivative (first- and second-order) and antiderivative (definite integral only). Numerical Differentiation

More information

ONE - DIMENSIONAL INTEGRATION

ONE - DIMENSIONAL INTEGRATION Chapter 4 ONE - DIMENSIONA INTEGRATION 4. Introduction Since the finite element method is based on integral relations it is logical to expect that one should strive to carry out the integrations as efficiently

More information

Numerical Analysis Preliminary Exam 10.00am 1.00pm, January 19, 2018

Numerical Analysis Preliminary Exam 10.00am 1.00pm, January 19, 2018 Numerical Analysis Preliminary Exam 0.00am.00pm, January 9, 208 Instructions. You have three hours to complete this exam. Submit solutions to four (and no more) of the following six problems. Please start

More information

Numerical Analysis Preliminary Exam 10 am to 1 pm, August 20, 2018

Numerical Analysis Preliminary Exam 10 am to 1 pm, August 20, 2018 Numerical Analysis Preliminary Exam 1 am to 1 pm, August 2, 218 Instructions. You have three hours to complete this exam. Submit solutions to four (and no more) of the following six problems. Please start

More information

Preliminary Examination in Numerical Analysis

Preliminary Examination in Numerical Analysis Department of Applied Mathematics Preliminary Examination in Numerical Analysis August 7, 06, 0 am pm. Submit solutions to four (and no more) of the following six problems. Show all your work, and justify

More information

PIECEWISE LINEAR FINITE ELEMENT METHODS ARE NOT LOCALIZED

PIECEWISE LINEAR FINITE ELEMENT METHODS ARE NOT LOCALIZED PIECEWISE LINEAR FINITE ELEMENT METHODS ARE NOT LOCALIZED ALAN DEMLOW Abstract. Recent results of Schatz show that standard Galerkin finite element methods employing piecewise polynomial elements of degree

More information

CS 450 Numerical Analysis. Chapter 8: Numerical Integration and Differentiation

CS 450 Numerical Analysis. Chapter 8: Numerical Integration and Differentiation Lecture slides based on the textbook Scientific Computing: An Introductory Survey by Michael T. Heath, copyright c 2018 by the Society for Industrial and Applied Mathematics. http://www.siam.org/books/cl80

More information

Non-Conforming Finite Element Methods for Nonmatching Grids in Three Dimensions

Non-Conforming Finite Element Methods for Nonmatching Grids in Three Dimensions Non-Conforming Finite Element Methods for Nonmatching Grids in Three Dimensions Wayne McGee and Padmanabhan Seshaiyer Texas Tech University, Mathematics and Statistics (padhu@math.ttu.edu) Summary. In

More information

Polynomial Interpolation Part II

Polynomial Interpolation Part II Polynomial Interpolation Part II Prof. Dr. Florian Rupp German University of Technology in Oman (GUtech) Introduction to Numerical Methods for ENG & CS (Mathematics IV) Spring Term 2016 Exercise Session

More information

Interpolation and Approximation

Interpolation and Approximation Interpolation and Approximation The Basic Problem: Approximate a continuous function f(x), by a polynomial p(x), over [a, b]. f(x) may only be known in tabular form. f(x) may be expensive to compute. Definition:

More information

Triangular Plate Displacement Elements

Triangular Plate Displacement Elements Triangular Plate Displacement Elements Chapter : TRIANGULAR PLATE DISPLACEMENT ELEMENTS TABLE OF CONTENTS Page. Introduction...................... Triangular Element Properties................ Triangle

More information

Finite Element Method-Part II Isoparametric FE Formulation and some numerical examples Lecture 29 Smart and Micro Systems

Finite Element Method-Part II Isoparametric FE Formulation and some numerical examples Lecture 29 Smart and Micro Systems Finite Element Method-Part II Isoparametric FE Formulation and some numerical examples Lecture 29 Smart and Micro Systems Introduction Till now we dealt only with finite elements having straight edges.

More information

Chapter 10 INTEGRATION METHODS Introduction Unit Coordinate Integration

Chapter 10 INTEGRATION METHODS Introduction Unit Coordinate Integration Chapter 0 INTEGRATION METHODS 0. Introduction The finite element analysis techniques are always based on an integral formulation. At the very minimum it will always be necessary to integrate at least an

More information

Polynomial Harmonic Decompositions

Polynomial Harmonic Decompositions DOI: 10.1515/auom-2017-0002 An. Şt. Univ. Ovidius Constanţa Vol. 25(1),2017, 25 32 Polynomial Harmonic Decompositions Nicolae Anghel Abstract For real polynomials in two indeterminates a classical polynomial

More information

MA 3021: Numerical Analysis I Numerical Differentiation and Integration

MA 3021: Numerical Analysis I Numerical Differentiation and Integration MA 3021: Numerical Analysis I Numerical Differentiation and Integration Suh-Yuh Yang ( 楊肅煜 ) Department of Mathematics, National Central University Jhongli District, Taoyuan City 32001, Taiwan syyang@math.ncu.edu.tw

More information

Engg. Math. II (Unit-IV) Numerical Analysis

Engg. Math. II (Unit-IV) Numerical Analysis Dr. Satish Shukla of 33 Engg. Math. II (Unit-IV) Numerical Analysis Syllabus. Interpolation and Curve Fitting: Introduction to Interpolation; Calculus of Finite Differences; Finite Difference and Divided

More information

Examination paper for TMA4215 Numerical Mathematics

Examination paper for TMA4215 Numerical Mathematics Department of Mathematical Sciences Examination paper for TMA425 Numerical Mathematics Academic contact during examination: Trond Kvamsdal Phone: 93058702 Examination date: 6th of December 207 Examination

More information

Introduction. Finite and Spectral Element Methods Using MATLAB. Second Edition. C. Pozrikidis. University of Massachusetts Amherst, USA

Introduction. Finite and Spectral Element Methods Using MATLAB. Second Edition. C. Pozrikidis. University of Massachusetts Amherst, USA Introduction to Finite and Spectral Element Methods Using MATLAB Second Edition C. Pozrikidis University of Massachusetts Amherst, USA (g) CRC Press Taylor & Francis Group Boca Raton London New York CRC

More information

Contents as of 12/8/2017. Preface. 1. Overview...1

Contents as of 12/8/2017. Preface. 1. Overview...1 Contents as of 12/8/2017 Preface 1. Overview...1 1.1 Introduction...1 1.2 Finite element data...1 1.3 Matrix notation...3 1.4 Matrix partitions...8 1.5 Special finite element matrix notations...9 1.6 Finite

More information

9th and 10th Grade Math Proficiency Objectives Strand One: Number Sense and Operations

9th and 10th Grade Math Proficiency Objectives Strand One: Number Sense and Operations Strand One: Number Sense and Operations Concept 1: Number Sense Understand and apply numbers, ways of representing numbers, the relationships among numbers, and different number systems. Justify with examples

More information

Method of Finite Elements I

Method of Finite Elements I Method of Finite Elements I PhD Candidate - Charilaos Mylonas HIL H33.1 and Boundary Conditions, 26 March, 2018 Institute of Structural Engineering Method of Finite Elements I 1 Outline 1 2 Penalty method

More information

Numerical integration in the axisymmetric finite element formulation

Numerical integration in the axisymmetric finite element formulation Advances in Engineering Software 31 (2000) 137 141 Short Communication Numerical integration in the axisymmetric finite element formulation J.D. Clayton a, J.J. Rencis b, * a The George W. Woodruff School

More information

Error formulas for divided difference expansions and numerical differentiation

Error formulas for divided difference expansions and numerical differentiation Error formulas for divided difference expansions and numerical differentiation Michael S. Floater Abstract: We derive an expression for the remainder in divided difference expansions and use it to give

More information

General elastic beam with an elastic foundation

General elastic beam with an elastic foundation General elastic beam with an elastic foundation Figure 1 shows a beam-column on an elastic foundation. The beam is connected to a continuous series of foundation springs. The other end of the foundation

More information

THE PATCH RECOVERY FOR FINITE ELEMENT APPROXIMATION OF ELASTICITY PROBLEMS UNDER QUADRILATERAL MESHES. Zhong-Ci Shi and Xuejun Xu.

THE PATCH RECOVERY FOR FINITE ELEMENT APPROXIMATION OF ELASTICITY PROBLEMS UNDER QUADRILATERAL MESHES. Zhong-Ci Shi and Xuejun Xu. DISCRETE AND CONTINUOUS Website: http://aimsciences.org DYNAMICAL SYSTEMS SERIES B Volume 9, Number, January 2008 pp. 63 82 THE PATCH RECOVERY FOR FINITE ELEMENT APPROXIMATION OF ELASTICITY PROBLEMS UNDER

More information

Code No: RT41033 R13 Set No. 1 IV B.Tech I Semester Regular Examinations, November - 2016 FINITE ELEMENT METHODS (Common to Mechanical Engineering, Aeronautical Engineering and Automobile Engineering)

More information

MA2501 Numerical Methods Spring 2015

MA2501 Numerical Methods Spring 2015 Norwegian University of Science and Technology Department of Mathematics MA5 Numerical Methods Spring 5 Solutions to exercise set 9 Find approximate values of the following integrals using the adaptive

More information

Numerical Solutions of Laplacian Problems over L-Shaped Domains and Calculations of the Generalized Stress Intensity Factors

Numerical Solutions of Laplacian Problems over L-Shaped Domains and Calculations of the Generalized Stress Intensity Factors WCCM V Fifth World Congress on Computational Mechanics July 7-2, 2002, Vienna, Austria Eds.: H.A. Mang, F.G. Rammerstorfer, J. Eberhardsteiner Numerical Solutions of Laplacian Problems over L-Shaped Domains

More information

1 Solutions to selected problems

1 Solutions to selected problems Solutions to selected problems Section., #a,c,d. a. p x = n for i = n : 0 p x = xp x + i end b. z = x, y = x for i = : n y = y + x i z = zy end c. y = (t x ), p t = a for i = : n y = y(t x i ) p t = p

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

MATH 590: Meshfree Methods

MATH 590: Meshfree Methods MATH 590: Meshfree Methods Chapter 14: The Power Function and Native Space Error Estimates Greg Fasshauer Department of Applied Mathematics Illinois Institute of Technology Fall 2010 fasshauer@iit.edu

More information

Roots and Coefficients Polynomials Preliminary Maths Extension 1

Roots and Coefficients Polynomials Preliminary Maths Extension 1 Preliminary Maths Extension Question If, and are the roots of x 5x x 0, find the following. (d) (e) Question If p, q and r are the roots of x x x 4 0, evaluate the following. pq r pq qr rp p q q r r p

More information

ME 1401 FINITE ELEMENT ANALYSIS UNIT I PART -A. 2. Why polynomial type of interpolation functions is mostly used in FEM?

ME 1401 FINITE ELEMENT ANALYSIS UNIT I PART -A. 2. Why polynomial type of interpolation functions is mostly used in FEM? SHRI ANGALAMMAN COLLEGE OF ENGINEERING AND TECHNOLOGY (An ISO 9001:2008 Certified Institution) SIRUGANOOR, TIRUCHIRAPPALLI 621 105 Department of Mechanical Engineering ME 1401 FINITE ELEMENT ANALYSIS 1.

More information

Numerical Integration exact integration is not needed to achieve the optimal convergence rate of nite element solutions ([, 9, 11], and Chapter 7). In

Numerical Integration exact integration is not needed to achieve the optimal convergence rate of nite element solutions ([, 9, 11], and Chapter 7). In Chapter 6 Numerical Integration 6.1 Introduction After transformation to a canonical element,typical integrals in the element stiness or mass matrices (cf. (5.5.8)) have the forms Q = T ( )N s Nt det(j

More information

Mathematics FINITE ELEMENT ANALYSIS AS COMPUTATION. What the textbooks don't teach you about finite element analysis. Chapter 3

Mathematics FINITE ELEMENT ANALYSIS AS COMPUTATION. What the textbooks don't teach you about finite element analysis. Chapter 3 Mathematics FINITE ELEMENT ANALYSIS AS COMPUTATION What the textbooks don't teach you about finite element analysis Chapter 3 Completeness and continuity: How to choose shape functions? Gangan Prathap

More information

Mapped elements and numerical integration - 'infinite' and 'singularity' elements

Mapped elements and numerical integration - 'infinite' and 'singularity' elements Mapped elements and numerical integration - 'infinite' and 'singularity' elements 9.1 Introduction In the previous chapter we have shown how some general families of finite elements can be obtained for

More information

CAAM 454/554: Stationary Iterative Methods

CAAM 454/554: Stationary Iterative Methods CAAM 454/554: Stationary Iterative Methods Yin Zhang (draft) CAAM, Rice University, Houston, TX 77005 2007, Revised 2010 Abstract Stationary iterative methods for solving systems of linear equations are

More information

ELEMENT BY ELEMENT POSTPROCESSING IN THE FINITE ELEMENT METHOD

ELEMENT BY ELEMENT POSTPROCESSING IN THE FINITE ELEMENT METHOD ELEMENT BY ELEMENT POSTPROCESSING IN THE FINITE ELEMENT METHOD Harri Isoherranen Jukka Aalto Rakenteiden Meka.n.llkka, Vol. 29 Nro 2, 1996, s. 19-30 ABSTRACT This paper deals with postprocessing method

More information

(f(x) P 3 (x)) dx. (a) The Lagrange formula for the error is given by

(f(x) P 3 (x)) dx. (a) The Lagrange formula for the error is given by 1. QUESTION (a) Given a nth degree Taylor polynomial P n (x) of a function f(x), expanded about x = x 0, write down the Lagrange formula for the truncation error, carefully defining all its elements. How

More information

PUTNAM TRAINING POLYNOMIALS. Exercises 1. Find a polynomial with integral coefficients whose zeros include

PUTNAM TRAINING POLYNOMIALS. Exercises 1. Find a polynomial with integral coefficients whose zeros include PUTNAM TRAINING POLYNOMIALS (Last updated: December 11, 2017) Remark. This is a list of exercises on polynomials. Miguel A. Lerma Exercises 1. Find a polynomial with integral coefficients whose zeros include

More information

3.1 Interpolation and the Lagrange Polynomial

3.1 Interpolation and the Lagrange Polynomial MATH 4073 Chapter 3 Interpolation and Polynomial Approximation Fall 2003 1 Consider a sample x x 0 x 1 x n y y 0 y 1 y n. Can we get a function out of discrete data above that gives a reasonable estimate

More information

The partition of unity quadrature in meshless methods

The partition of unity quadrature in meshless methods INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING Int. J. Numer. Meth. Engng 2002; 54:987 1006 (DOI: 10.1002/nme.455) The partition of unity quadrature in meshless methods A. Carpinteri, G. Ferro

More information

Generalized Finite Element Methods for Three Dimensional Structural Mechanics Problems. C. A. Duarte. I. Babuška and J. T. Oden

Generalized Finite Element Methods for Three Dimensional Structural Mechanics Problems. C. A. Duarte. I. Babuška and J. T. Oden Generalized Finite Element Methods for Three Dimensional Structural Mechanics Problems C. A. Duarte COMCO, Inc., 7800 Shoal Creek Blvd. Suite 290E Austin, Texas, 78757, USA I. Babuška and J. T. Oden TICAM,

More information

1 Solutions to selected problems

1 Solutions to selected problems Solutions to selected problems Section., #a,c,d. a. p x = n for i = n : 0 p x = xp x + i end b. z = x, y = x for i = : n y = y + x i z = zy end c. y = (t x ), p t = a for i = : n y = y(t x i ) p t = p

More information

WRT in 2D: Poisson Example

WRT in 2D: Poisson Example WRT in 2D: Poisson Example Consider 2 u f on [, L x [, L y with u. WRT: For all v X N, find u X N a(v, u) such that v u dv v f dv. Follows from strong form plus integration by parts: ( ) 2 u v + 2 u dx

More information

Chapter Two: Numerical Methods for Elliptic PDEs. 1 Finite Difference Methods for Elliptic PDEs

Chapter Two: Numerical Methods for Elliptic PDEs. 1 Finite Difference Methods for Elliptic PDEs Chapter Two: Numerical Methods for Elliptic PDEs Finite Difference Methods for Elliptic PDEs.. Finite difference scheme. We consider a simple example u := subject to Dirichlet boundary conditions ( ) u

More information

PART IV Spectral Methods

PART IV Spectral Methods PART IV Spectral Methods Additional References: R. Peyret, Spectral methods for incompressible viscous flow, Springer (2002), B. Mercier, An introduction to the numerical analysis of spectral methods,

More information

x x2 2 + x3 3 x4 3. Use the divided-difference method to find a polynomial of least degree that fits the values shown: (b)

x x2 2 + x3 3 x4 3. Use the divided-difference method to find a polynomial of least degree that fits the values shown: (b) Numerical Methods - PROBLEMS. The Taylor series, about the origin, for log( + x) is x x2 2 + x3 3 x4 4 + Find an upper bound on the magnitude of the truncation error on the interval x.5 when log( + x)

More information

A note on accurate and efficient higher order Galerkin time stepping schemes for the nonstationary Stokes equations

A note on accurate and efficient higher order Galerkin time stepping schemes for the nonstationary Stokes equations A note on accurate and efficient higher order Galerkin time stepping schemes for the nonstationary Stokes equations S. Hussain, F. Schieweck, S. Turek Abstract In this note, we extend our recent work for

More information

Chapter 1. Preliminaries. The purpose of this chapter is to provide some basic background information. Linear Space. Hilbert Space.

Chapter 1. Preliminaries. The purpose of this chapter is to provide some basic background information. Linear Space. Hilbert Space. Chapter 1 Preliminaries The purpose of this chapter is to provide some basic background information. Linear Space Hilbert Space Basic Principles 1 2 Preliminaries Linear Space The notion of linear space

More information

Chapter 4: Interpolation and Approximation. October 28, 2005

Chapter 4: Interpolation and Approximation. October 28, 2005 Chapter 4: Interpolation and Approximation October 28, 2005 Outline 1 2.4 Linear Interpolation 2 4.1 Lagrange Interpolation 3 4.2 Newton Interpolation and Divided Differences 4 4.3 Interpolation Error

More information

Lecture 10 Polynomial interpolation

Lecture 10 Polynomial interpolation Lecture 10 Polynomial interpolation Weinan E 1,2 and Tiejun Li 2 1 Department of Mathematics, Princeton University, weinan@princeton.edu 2 School of Mathematical Sciences, Peking University, tieli@pku.edu.cn

More information

Functions of Several Variables

Functions of Several Variables Functions of Several Variables The Unconstrained Minimization Problem where In n dimensions the unconstrained problem is stated as f() x variables. minimize f()x x, is a scalar objective function of vector

More information

Algebra III Chapter 2 Note Packet. Section 2.1: Polynomial Functions

Algebra III Chapter 2 Note Packet. Section 2.1: Polynomial Functions Algebra III Chapter 2 Note Packet Name Essential Question: Section 2.1: Polynomial Functions Polynomials -Have nonnegative exponents -Variables ONLY in -General Form n ax + a x +... + ax + ax+ a n n 1

More information

A Mixed Nonconforming Finite Element for Linear Elasticity

A Mixed Nonconforming Finite Element for Linear Elasticity A Mixed Nonconforming Finite Element for Linear Elasticity Zhiqiang Cai, 1 Xiu Ye 2 1 Department of Mathematics, Purdue University, West Lafayette, Indiana 47907-1395 2 Department of Mathematics and Statistics,

More information

Math 660-Lecture 15: Finite element spaces (I)

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

The Plane Stress Problem

The Plane Stress Problem The Plane Stress Problem Martin Kronbichler Applied Scientific Computing (Tillämpad beräkningsvetenskap) February 2, 2010 Martin Kronbichler (TDB) The Plane Stress Problem February 2, 2010 1 / 24 Outline

More information

A GLOBAL COLLOCATION METHOD FOR TWO-DIMENSIONAL RECTANGULAR DOMAINS

A GLOBAL COLLOCATION METHOD FOR TWO-DIMENSIONAL RECTANGULAR DOMAINS JOURNAL OF MECHANICS OF MATERIALS AND STRUCTURES Vol., No., A GLOBAL COLLOCATION METHOD FOR TWO-DIMENSIONAL RECTANGULAR DOMAINS CHRISTOPHER G. PROVATIDIS This paper proposes the use of a global collocation

More information

Jim Lambers MAT 460/560 Fall Semester Practice Final Exam

Jim Lambers MAT 460/560 Fall Semester Practice Final Exam Jim Lambers MAT 460/560 Fall Semester 2009-10 Practice Final Exam 1. Let f(x) = sin 2x + cos 2x. (a) Write down the 2nd Taylor polynomial P 2 (x) of f(x) centered around x 0 = 0. (b) Write down the corresponding

More information

Exam in TMA4215 December 7th 2012

Exam in TMA4215 December 7th 2012 Norwegian University of Science and Technology Department of Mathematical Sciences Page of 9 Contact during the exam: Elena Celledoni, tlf. 7359354, cell phone 48238584 Exam in TMA425 December 7th 22 Allowed

More information

Vibration of Thin Beams by PIM and RPIM methods. *B. Kanber¹, and O. M. Tufik 1

Vibration of Thin Beams by PIM and RPIM methods. *B. Kanber¹, and O. M. Tufik 1 APCOM & ISCM -4 th December, 23, Singapore Vibration of Thin Beams by PIM and RPIM methods *B. Kanber¹, and O. M. Tufik Mechanical Engineering Department, University of Gaziantep, Turkey. *Corresponding

More information

MATH 205C: STATIONARY PHASE LEMMA

MATH 205C: STATIONARY PHASE LEMMA MATH 205C: STATIONARY PHASE LEMMA For ω, consider an integral of the form I(ω) = e iωf(x) u(x) dx, where u Cc (R n ) complex valued, with support in a compact set K, and f C (R n ) real valued. Thus, I(ω)

More information

Abstract. 1. Introduction

Abstract. 1. Introduction Journal of Computational Mathematics Vol.28, No.2, 2010, 273 288. http://www.global-sci.org/jcm doi:10.4208/jcm.2009.10-m2870 UNIFORM SUPERCONVERGENCE OF GALERKIN METHODS FOR SINGULARLY PERTURBED PROBLEMS

More information

We consider the problem of finding a polynomial that interpolates a given set of values:

We consider the problem of finding a polynomial that interpolates a given set of values: Chapter 5 Interpolation 5. Polynomial Interpolation We consider the problem of finding a polynomial that interpolates a given set of values: x x 0 x... x n y y 0 y... y n where the x i are all distinct.

More information

Lecture 4: Numerical solution of ordinary differential equations

Lecture 4: Numerical solution of ordinary differential equations Lecture 4: Numerical solution of ordinary differential equations Department of Mathematics, ETH Zürich General explicit one-step method: Consistency; Stability; Convergence. High-order methods: Taylor

More information

Interpolation and polynomial approximation Interpolation

Interpolation and polynomial approximation Interpolation Outline Interpolation and polynomial approximation Interpolation Lagrange Cubic Splines Approximation B-Splines 1 Outline Approximation B-Splines We still focus on curves for the moment. 2 3 Pierre Bézier

More information

Simple Examples on Rectangular Domains

Simple Examples on Rectangular Domains 84 Chapter 5 Simple Examples on Rectangular Domains In this chapter we consider simple elliptic boundary value problems in rectangular domains in R 2 or R 3 ; our prototype example is the Poisson equation

More information

Quintic beam closed form matrices (revised 2/21, 2/23/12) General elastic beam with an elastic foundation

Quintic beam closed form matrices (revised 2/21, 2/23/12) General elastic beam with an elastic foundation General elastic beam with an elastic foundation Figure 1 shows a beam-column on an elastic foundation. The beam is connected to a continuous series of foundation springs. The other end of the foundation

More information

A Reverse Technique for Lumping High Dimensional Model Representation Method

A Reverse Technique for Lumping High Dimensional Model Representation Method A Reverse Technique for Lumping High Dimensional Model Representation Method M. ALPER TUNGA Bahçeşehir University Department of Software Engineering Beşiktaş, 34349, İstanbul TURKEY TÜRKİYE) alper.tunga@bahcesehir.edu.tr

More information

MA22S3 Summary Sheet: Ordinary Differential Equations

MA22S3 Summary Sheet: Ordinary Differential Equations MA22S3 Summary Sheet: Ordinary Differential Equations December 14, 2017 Kreyszig s textbook is a suitable guide for this part of the module. Contents 1 Terminology 1 2 First order separable 2 2.1 Separable

More information

SMOOTHED PARTICLE HYDRODYNAMICS METHOD IN MODELING OF STRUCTURAL ELEMENTS UNDER HIGH DYNAMIC LOADS

SMOOTHED PARTICLE HYDRODYNAMICS METHOD IN MODELING OF STRUCTURAL ELEMENTS UNDER HIGH DYNAMIC LOADS The 4 th World Conference on Earthquake Engineering October -7, 008, Beijing, China SMOOTHE PARTICLE HYROYAMICS METHO I MOELIG OF STRUCTURAL ELEMETS UER HIGH YAMIC LOAS. Asprone *, F. Auricchio, A. Reali,

More information

Numerical Methods for Partial Differential Equations

Numerical Methods for Partial Differential Equations Numerical Methods for Partial Differential Equations Eric de Sturler University of Illinois at Urbana-Champaign Read section 8. to see where equations of type (au x ) x = f show up and their (exact) solution

More information

March Algebra 2 Question 1. March Algebra 2 Question 1

March Algebra 2 Question 1. March Algebra 2 Question 1 March Algebra 2 Question 1 If the statement is always true for the domain, assign that part a 3. If it is sometimes true, assign it a 2. If it is never true, assign it a 1. Your answer for this question

More information

King Fahd University of Petroleum and Minerals Prep-Year Math Program Math Term 161 Recitation (R1, R2)

King Fahd University of Petroleum and Minerals Prep-Year Math Program Math Term 161 Recitation (R1, R2) Math 001 - Term 161 Recitation (R1, R) Question 1: How many rational and irrational numbers are possible between 0 and 1? (a) 1 (b) Finite (c) 0 (d) Infinite (e) Question : A will contain how many elements

More information