UNIFIED ERROR ANALYSIS
|
|
- Dylan Gregory
- 7 years ago
- Views:
Transcription
1 UNIFIED ERROR ANALYSIS LONG CHEN CONTENTS 1. Lax Equivalence Teorem 1 2. Abstract error analysis 2 3. Application: Finite Difference Metod 3 4. Application: Finite Element Metod 4 5. Application: Conforming Discretization of Variational Problems 5 6. Application: Perturbed Discretization 6 7. Application: Nonconforming Finite Element Metods 8 8. Application: Finite Volume Metod 8 9. Application: Superconvergence of linear finite element metod 9 References 11 Let X, Y be two Banac spaces and L L (X, Y ) be a linear and bounded operator. We consider solving an operator equation: given y Y, find x X suc tat (1) Lx = y. We assume (1) is well defined, i.e., for any y Y, tere exists a unique solution to (1). Ten L is a one-to-one linear and bounded map and so is L 1 by te open mapping teorem. We sall study te convergence analysis in tis capter and refer to Capter: Inf-sup conditions for operator equations for well-posedness of (1). 1. LAX EQUIVALENCE THEOREM We are interested in te approximation of L. For H, 0, suppose L L (X, Y ) is a family of discretization of L. We consider te problem: given y Y, find x X, suc tat (2) L x = y. We also assume (2) is well defined. So L 1 is a linear and bounded map. But te norm L 1 could depend on te parameter. Te uniform boundedness will be called te stability of discretization. Namely, tere exists a constant C independent of suc tat (3) L 1 Y X C, for all H. Te consistency measures te approximation of L to L. We call te discretization is consistent if, for all x X, (4) Lx L x Y 0 as 0. Date: Oct, Last updated April 24,
2 2 LONG CHEN Te convergence of te discretization is defined as (5) x x X 0 as 0, were x and x are solutions to (2) and (1), respectively. We follow te book [4] to present te Lax equivalence teorem. Teorem 1.1 (Lax equivalence teorem). Suppose te discretization L of L is consistent, i.e., (4) olds for all x X, ten te stability (3) is equivalent to te convergence (5). Proof. We write te error as x x = L 1 (L x L x ) = L 1 (L x Lx). Here we use te fact L x = Lx = y. If te sceme is stable, ten x x X C Lx L x Y 0 as 0. On te oter and, for any y Y, let x = L 1 y and x = L 1 y. Te convergence x x means for any y Y L 1 y L 1 y as 0. By uniformly boundedness principle, we conclude L 1 is uniformly bounded. 2. ABSTRACT ERROR ANALYSIS Te Lax equivalence teorem may not be ready to use for te error analysis of discretizations since discrete spaces X, Y are used to approximate X, Y, respectively. Te equation may not be solved exactly, i.e., L x Lx. Instead, it solves approximately in Y, i.e., L x = y for some y Y. In some cases X X but in general X and X are different spaces so tat even x x does not make sense. Te norm X could be an approximation of X etc. We now refine te analysis to andle tese cases. Here we follow closely Temam [3]. Let us introduce two linear operators I : X X, and Π : Y Y. We consider te discrete problem: given y Y, find x X suc tat (6) L x = Π y in Y. Te consistency error is revised to and te stability is te same as before Π Lx L I x Y, L 1 Y X C, for all H. We sall prove if te sceme is consistent and stable, ten te discrete error I x x is convergent. Teorem 2.1. Suppose te sceme (L, Π ) is consistent wit order r, i.e., tere exists an operator I suc tat Π Lx L I x Y C r, and stable L 1 Y X C for all H, ten we ave te discrete convergence wit order r: I x x X C r.
3 UNIFIED ERROR ANALYSIS 3 Proof. Te proof is straigtforward using te definition, assumptions, and te identity: I x x = L 1 L (I x x ) = L 1 (L I x Π Lx). Remark 2.2. Te operator Π is in fact part of te discretization wile te operator I is introduced for te error analysis. For a given Π, te coices of I is not unique. If we really want to control x x, we need to define anoter linear operator P : X X to put a discrete function x into X in a stable way, i.e., P x X C x X. Ten by te triangle inequality, we ave x P x X x P I x X + P (I x x ) X x P I x X + C I x x X. Te additional error term x P I x X measures te approximation property of X by P X. Teorem 2.3. Suppose consistency: Π Lx L I x Y C 1 r, stability: L 1 Y X C 2 H, approximability: x P I x X C 3 s, ten we ave convergence x P x X C 2 (C 1 r + C 3 s ). Remark 2.4. Te domain of te operator L could be just a subspace of X. Strictly speaking we sould write L : dom(l) X Y. We leave a bigger space X in te analysis suc tat te embedding P : X X is easier to construct. And wit operators I and Π, te space X and Y do not ave to be Banac spaces. Under certain circumstance, e.g. wen L can be defined on X + X, we can break te consistence error Π Lx L I x into tree parts Π Lx Lx = L x Lx = y y: perturbation of te data Lx L x: consistence error L (x I x): approximation error. Te first term measures te approximation of te data in te subspace Y and te tird one measures te approximation of te function. Te middle one is te traditional consistence error introduced in Section 1. Te setting is 3. APPLICATION: FINITE DIFFERENCE METHOD (X, X ) = (Y, Y ) = (C( Ω),,Ω ); (X, X ) = (Y, Y ) = (R N, l ) I = Π as nodal interpolation; P : X X can be defined using bilinear finite element space on uniform grid; L = and L = is te 5-point stencil matrix. Note tat te domain of L is a subspace of X.
4 4 LONG CHEN Te consistency error is ( u) I u I l = max 1 i N u(v i) ( u I ) i C(u) 2, wic can be easily analyzed by te Taylor expansion. Here C(u) = d D4 i u,ω. Te stability 1 l l may be proved using te discrete maximum principle; see Capter: Finite Difference Metods. Te approximation property is given by te interpolation error estimate Here we use te same notation u I for P u I. u u I,Ω C 2 D 2 u,ω. 4. APPLICATION: FINITE ELEMENT METHOD Te setting is (X, X ) = (H0 1 (Ω), 1 ), and (Y, Y ) = (H 1 (Ω), 1 ); (X, X ) = (V, 1 ), and (Y, Y ) = (V, 1,). Here te dual norm f, v f 1, = sup, for f Y. v V v 1 I : H 1 0 (Ω) V is arbitrary; Π = Q : H 1 (Ω) = (H 1 0 (Ω)) V, i.e., Q f, v := f, v, v V. Wen Q is restricted to L 2 (Ω), it is te L 2 projection. Note tat (H 1 0 (Ω)) V, te operator Q can be also tougt as te natural embedding of te dual space and tus is omit in te notation sometimes. P : V H 1 0 (Ω) is te natural embedding since now V H 1 0 (Ω); L = : H 1 0 (Ω) H 1 (Ω) and L = Q LP : V V. Te equation is not solved exactly. It is solved in a weaker topology. Given a f H 1 (Ω), find u V suc tat L u = Q f in V. Te correct (comparing wit finite difference metod) stability for L 1 (7) u 1 Q f 1,, and can be proved as follows u 2 1 = L u, u = Q f, u Q f 1, u 1. is L 1 1, 1 : Comparing wit finite difference metod, now te consistency error is measured in a muc weaker norm. We could control te weaker norm Q f 1, by a stronger one f 1. Indeed implies (Q f, u ) = f, u f 1 u 1, (8) Q f 1, f 1. Let us denoted by v = I u. Using te fact L = Q LP and inequality (8), te consistency error is Q Lu L v 1, = Q L(u v ) 1, L(u v ) 1 u v 1.
5 UNIFIED ERROR ANALYSIS 5 By te stability result (7), we obtain u v 1 u v 1. Since v is arbitrary, by te triangle inequality, we obtain te Céa lemma (9) u u 1 2 inf v V u v 1. Te approximation property can be proved using Bramble-Hilbert lemma. For example, for linear finite element metod and u H 2 (Ω), inf u v 1 C u 2. v V Ten Teorem 2.3 will give optimal error estimate for finite element metods. Remark 4.1. Here we use only te stability and consistency. If we use te inner product structure and te ortogonality (or more general te variational formulation), we could improve te constant to 1 in (9). 5. APPLICATION: CONFORMING DISCRETIZATION OF VARIATIONAL PROBLEMS We now generalize te analysis for Poisson equation to general elliptic equations and sow te connection wit traditional error analysis of variational problems. Te operator L : V V is defined troug a bilinear form: for u, v V Lu, v := a(u, v). We consider te conforming discretization by coosing V V and te discrete operator L : V V V being te restriction of te bilinear form: for u, v V L u, v = a(u, v ). If we denoted by P : V V and Q : V V as te natural embedding. Ten by definition L = Q LP : V V. By defining in tis way, te operator L can be also tougt of as an extension of L. Te well known Lax-Milgram teorem (Lax again!) says if te bilinear form satisfies: coercivity: continuity: α u 2 V a(u, u). a(u, v) β u V v V. Ten tere exists a unique solution to te variational problem: given f V find u V suc tat (10) a(u, v) = f, v for all v V. Since V V, it also implies te existence and uniqueness of te solution u V (11) a(u, v ) = f, v for all v V. Tis establis te well posedness of (10) and (11). Te coercivity condition can be relaxed to te so-called inf-sup condition; see Capter: Inf-sup conditions for operator equations. Te continuity of te bilinear form a(, ) implies te continuity of L and L. Te coercivity can be used to prove te stability of L 1 in a straigtforward way: u 2 V a(u, u ) = f, u f V u V.
6 6 LONG CHEN For te conforming discretization, we ave te ortogonality (borrowed te name wen a(, ) is an inner product) i.e., a(u u, v ) = 0 for all v V. Lu = L u in V, wic can be also interpreted as a consistency result: Lu = f in V or in a less precise notation L u = Lu in V wit L u understood as Q Lu. Note tat te consistency is measured in te weak norm V but not in V. Te residual Lu L u 0 in V. In our setting, te consistence means: for any v V Lv = L v in V. In operator form, it is simply L = Q LP. Te traditional error analysis is as follows u u 2 V 1 α a(u u, u u ) (coercivity) = 1 α a(u u, u v ) (ortogonality) β α u u V u v V (continuity) wic implies te Céa lemma u u V β α inf u v V. v V Using our new framework of using stability and consistency, te estimate is like u v V 1 α L (u v ) V (stability) = 1 α Lu L v V (ortogonality) = 1 α L(u v ) V (consistency) β α u v V (continuity). Combined wit te triangle inequality, we get ( u u V 1 + β ) inf u v V. α v V 6. APPLICATION: PERTURBED DISCRETIZATION We first consider te quadrature of te rigt and side, i.e., f, v f, v. Te setting is as before except Π : V V defined as Π f, v = f, v. Note tat in tis case, we are solving te equation L u = Π f in V.
7 UNIFIED ERROR ANALYSIS 7 Te stability of L 1 is uncanged. We only need to estimate te consistency error Π L u L v V = Π f L v V. By te triangle inequality, we ave By te definition Π f L v V Q f L v V + Π f Q f V u v V + Π f Q f V. Π f Q f, w f, w f, w Π f Q f V = sup = sup. w V w w V w We end up wit te first Strang lemma u u V f, w f, w inf u v V + sup. v V w V w V Tat is, a perturbation of te data in V is included. Exercise 6.1. Use tree vertices quadrature rule, i.e. for a triangle τ formed by tree vertices x i, i = 1, 2, 3, g(x)dx 1 3 g(x i ) τ, 3 τ to compute te rigt and side (f, φ i ) and sow it can be simply written as Mf I, were M is a diagonal matrix. Prove optimal first order approximation in H 1 -norm for Poisson equation using tis quadrature. We ten include te approximation of te bilinear form wic includes te case of using numerical quadrature to compute te bilinear form a(, ) or a non-conforming discretization of L. We are solving te equation L u = Π f in V. To get similar estimate, we need to assume L is defined on V + V satisfying te stability and continuity wic migt be derived from te coercivity and continuity of te corresponding bilinear form ã (, ). Te space V is now endowed by a possibly different norm. Coercivity: for all v V L v, v α v 2. Continuity: for all u V + V, v V L u, v β u v. Ten it is straigtforward to prove te stability of L : (V, V ) (V, ). For te consistency error, Π f L v V Π f L u V + L (u v ) V f, w L u, w sup + u v. w V w Terefore we end up wit te second Strang lemma u u inf u v + C v V sup w V f, w L u, w. w
8 8 LONG CHEN 7. APPLICATION: NONCONFORMING FINITE ELEMENT METHODS 8. APPLICATION: FINITE VOLUME METHOD We consider te vertex-centered finite volume metod and refer to Capter: Finite Volume Metods for a detailed description and proof of corresponding results. Simply speaking, if we coose te dual mes by connecting a interior point to middle points of edges in eac triangle, te stiffness matrix is te same as tat from te linear finite element metod. So we sall use all te setting for te finite element metod. Te only difference is te rigt and side, i.e., Π : L 2 (Ω) V. Here we need to srink te space Y from H 1 (Ω) to L 2 (Ω). To define suc Π, let us introduce te piecewise constant space on te dual mes B and denoted by V 0,B. We rewrite te linear finite element space as V 1,T. Troug te point values at vertices, we define te following mapping N Π : V 1,T V 0,B as Π v = v (x i )χ bi. For any f L 2 (Ω), we ten define Π f V as Π f, v = (f, Π v ), for all v V. Te analysis below follows closely to Hackbusc [2]. Denoted by u G as te standard Galerkin (finite element) approximation and u B is te box (finite volume) approximation. Te equivalence of te stiffness matrices means Terefore by te stability of L 1, we ave By te definition L u G = Q f, L u B = Π f. u G u B 1 Q f Π f 1,. Q f Π f, v = (f, v Π v ). Denote te support te at basis function at x i as ω i. Note tat b i ω i and te operator I Π preserve constant function in te patc ω i and tus (f, v Π v ) bi f bi v Π v ωi C f bi v 1,ωi. Summing up and using Caucy Scwarz inequality, we get te first order convergence u G u B 1 C f. Furtermore, if te dual mes is symmetric in te sense tat we use barcenters as a vertex of control volumes. Ten we ave v = Π v, τ and tus, let f be te L 2 projection f to te piecewise constant function in eac triangle, (f, v Π v ) = (f f, v Π v ) f f v Π v V C 2 f 1 v 1. We ten obtain te second order convergence or te supercloseness of u G and ub : (12) u G u B 1 C 2 f 1. Wit suc relation, we can obtain optimal L 2 error estimate for u B and quasi-optimal L error estimate in two dimensions. Tat is u u B u u G + u G u B C 2 u 2 + u G u B 1 C 2 ( u 2 + f 1 ), τ
9 UNIFIED ERROR ANALYSIS 9 and similarly wit discrete embedding v C log v 1, u u B u u G + u G u B C 2 u 2 + C log u G u B 1 C log 2 ( u 2 + f 1 ). Remark 8.1. For non-symmetric dual mes but uniform triangulation, it is still possible to derive te super-closeness result using te tecnique in te next section. 9. APPLICATION: SUPERCONVERGENCE OF LINEAR FINITE ELEMENT METHOD In some cases we may ave a sarper estimate of te consistency error in te weak norm 1,. For example, for 1-D Poisson problem, using integration by parts and noting tat (u u I ) τ = 0, we get ((Q f L) u I, ϕ i ) = (u u I, ϕ i) = (u u I, ϕ i ) τ = 0, τ T wic implies te discrete error is zero. Namely u (x i ) = u(x i ) at eac grid points x i. On certain meses, we ave te following strengtened Caucy-Scwarz inequality (13) Q f L u I, v = ( u u I, v ) C 2 u 3 v 1. Ten consequently we obtain te superconvergence result u u I 1 Q f L u I 1, C 2 u 3. Rougly speaking, te symmetry of te mes will bring more cancelation wen measuring te consistency error. For example, te estimate (13) olds wen te two triangles saring an interior edge forms an O( 2 ) approximate parallelogram for most edges in te triangulation; See [1] for detailed condition on triangulation and a proof of (13). We sall give a simple proof of (13) on uniform grids by using te cancelation from te Taylor series. Here uniform grids we mean te tree directional triangulation obtained by using diagonals wit te same direction of uniform rectangular grids; see Fig. 1. FIGURE 1. A uniform mes for a square We assume tat te truncation error in l norm is of second order, i.e., ( u) I u I l C 2.
10 10 LONG CHEN Here u I is a vector and is te stencil matrix, c.f., te notation in te analysis of finite difference metod. We sall use te relation between finite element and finite difference metods, tat is, for uniform grids, we ave L u, v = u t A v = 2 u t v. Here we use boldface letters to denoted te vector formed by te function values at vertices. Namely for u V, we define u R N suc tat (u ) i = u (x i ). We scale te stiffness matrix A by 2 to get te five-point stencil. We coose I as te nodal interpolation and define Π : C 0 (Ω) V as Π f, v = 2 f t Iv = We divide te consistency error into two parts N 2 f(x i )v (x i ). Q f L u I 1, Q f Π f 1, + Π f L u I 1, = I 1 + I 2. To estimate I 1, we note Q f, v = N ( ω i fφ i )v (x i ) and 2 f(x i ) is a quadrature for te integral ω i fφ i. It is only exact for constant f restricted to one simplex. But for uniform grids, due to te configuration of ω i, te support of te at function φ i, te linear functional E i (f) = fφ i dx 2 f(x i ) ω i preserve linear polynomials in P 1 (ω i ). Namely E i (f ) = 0 for f P 1 (ω i ). Terefore E i (f) = E i (f f ) f f f 2,. Remark 9.1. For finite volume approximations, one can estimate te difference E i (f) = f dx 2 f(x i ). b i In tis case, b i is symmetric and b i = 2 and tus E i (f) can preserve linear polynomial in P 1 (b i ). Note tat for linear finite volume metods, te triangulation is more flexible. For triangulations consists of isosceles triangles, no matter wat te direction of te leg is, it results in te same discretization if we coose b i as type B control volume; see my notes on finite volume metods. Terefore we can estimate te I 1 as Q f Π f, v = Here we use estimate So we ave N E i (f)v (x i ) C f 2 N N 2 v (x i ) C v L 1 C v V C v 1. Q f Π f 1, C(f) 2. 2 v (x i ) C f 2 v 1.
11 UNIFIED ERROR ANALYSIS 11 To estimate I 2, by te consistency assumption, we ave Π f L u I, v = 2 (f I + u I ) v f I + u I C(u) 2 v 1. N 2 v (x i ) Terefore Π f L u I 1, C(u) 2. Here we consider Diriclet boundary condition and assume te truncation error for interior nodes is second order. For Neumann boundary condition or cell centered finite difference metods, te boundary or near boundary stencil is modified and te truncation error could be only first order O(); see Capter: Finite Difference Metods. We sall sow tat boundary stencil could be just first order wile te sceme is still second order in H 1 -norm. Suppose we label te boundary (or near boundary) nodes from 1 : N b and interior nodes from N b + 1 : N and te truncation error for boundary nodes is only O() and for interior nodes is still O( 2 ). Ten Π f L u I, v = 2 (f I + u I ) v f I + u I ( Nb = 2 v (x i ) + N i=n b +1 2 v (x i ) C(u) 2 ( ) v L1 ( Ω) + v L1 (Ω) C(u) 2 v 1. In te last step, we apply te following inequality v L1 ( Ω) v L2 ( Ω) v 1,Ω v 1. ) N 2 v (x i ) Te trick is to bound te boundary part by te L 1 norm of te trace and ten use te trace teorem to cange to H 1 -norm of te wole domain. In conclusion, we ave proved te superconvergence for finite difference metods (fivepoint stencil) or te linear finite element metod on uniform grids u I u 1 C(u, f) 2, by estimating te consistency error in a weaker norm. In tis approac we need stronger smootness assumption. For example, te constant C(u, f) = D 4 u + D 2 f. REFERENCES [1] R. E. Bank and J. Xu. Asymptotically exact a posteriori error estimators, Part I: Grids wit superconvergence. SIAM J. Numer. Anal., 41(6): , [2] W. Hackbusc. On first and second order box scemes. Computing, 41(4): , [3] R. Temam. Numerical Analysis. D. Reidel Publising Company, [4] G. Zang and Y. Lin. Functional analysis: I. Beijing University, 1987.
FINITE DIFFERENCE METHODS
FINITE DIFFERENCE METHODS LONG CHEN Te best known metods, finite difference, consists of replacing eac derivative by a difference quotient in te classic formulation. It is simple to code and economic to
More informationVerifying Numerical Convergence Rates
1 Order of accuracy Verifying Numerical Convergence Rates We consider a numerical approximation of an exact value u. Te approximation depends on a small parameter, suc as te grid size or time step, and
More informationOPTIMAL DISCONTINUOUS GALERKIN METHODS FOR THE ACOUSTIC WAVE EQUATION IN HIGHER DIMENSIONS
OPTIMAL DISCONTINUOUS GALERKIN METHODS FOR THE ACOUSTIC WAVE EQUATION IN HIGHER DIMENSIONS ERIC T. CHUNG AND BJÖRN ENGQUIST Abstract. In tis paper, we developed and analyzed a new class of discontinuous
More informationDerivatives Math 120 Calculus I D Joyce, Fall 2013
Derivatives Mat 20 Calculus I D Joyce, Fall 203 Since we ave a good understanding of its, we can develop derivatives very quickly. Recall tat we defined te derivative f x of a function f at x to be te
More informationf(a + h) f(a) f (a) = lim
Lecture 7 : Derivative AS a Function In te previous section we defined te derivative of a function f at a number a (wen te function f is defined in an open interval containing a) to be f (a) 0 f(a + )
More informationIn other words the graph of the polynomial should pass through the points
Capter 3 Interpolation Interpolation is te problem of fitting a smoot curve troug a given set of points, generally as te grap of a function. It is useful at least in data analysis (interpolation is a form
More informationInstantaneous Rate of Change:
Instantaneous Rate of Cange: Last section we discovered tat te average rate of cange in F(x) can also be interpreted as te slope of a scant line. Te average rate of cange involves te cange in F(x) over
More informationThe Derivative as a Function
Section 2.2 Te Derivative as a Function 200 Kiryl Tsiscanka Te Derivative as a Function DEFINITION: Te derivative of a function f at a number a, denoted by f (a), is if tis limit exists. f (a) f(a+) f(a)
More informationACT Math Facts & Formulas
Numbers, Sequences, Factors Integers:..., -3, -2, -1, 0, 1, 2, 3,... Rationals: fractions, tat is, anyting expressable as a ratio of integers Reals: integers plus rationals plus special numbers suc as
More informationLecture 10: What is a Function, definition, piecewise defined functions, difference quotient, domain of a function
Lecture 10: Wat is a Function, definition, piecewise defined functions, difference quotient, domain of a function A function arises wen one quantity depends on anoter. Many everyday relationsips between
More information1.6. Analyse Optimum Volume and Surface Area. Maximum Volume for a Given Surface Area. Example 1. Solution
1.6 Analyse Optimum Volume and Surface Area Estimation and oter informal metods of optimizing measures suc as surface area and volume often lead to reasonable solutions suc as te design of te tent in tis
More informationChapter 7 Numerical Differentiation and Integration
45 We ave a abit in writing articles publised in scientiþc journals to make te work as Þnised as possible, to cover up all te tracks, to not worry about te blind alleys or describe ow you ad te wrong idea
More informationGeometric Stratification of Accounting Data
Stratification of Accounting Data Patricia Gunning * Jane Mary Horgan ** William Yancey *** Abstract: We suggest a new procedure for defining te boundaries of te strata in igly skewed populations, usual
More informationSAT Subject Math Level 1 Facts & Formulas
Numbers, Sequences, Factors Integers:..., -3, -2, -1, 0, 1, 2, 3,... Reals: integers plus fractions, decimals, and irrationals ( 2, 3, π, etc.) Order Of Operations: Aritmetic Sequences: PEMDAS (Parenteses
More informationIntroduction to the Finite Element Method
Introduction to the Finite Element Method 09.06.2009 Outline Motivation Partial Differential Equations (PDEs) Finite Difference Method (FDM) Finite Element Method (FEM) References Motivation Figure: cross
More informationTangent Lines and Rates of Change
Tangent Lines and Rates of Cange 9-2-2005 Given a function y = f(x), ow do you find te slope of te tangent line to te grap at te point P(a, f(a))? (I m tinking of te tangent line as a line tat just skims
More informationCHAPTER 7. Di erentiation
CHAPTER 7 Di erentiation 1. Te Derivative at a Point Definition 7.1. Let f be a function defined on a neigborood of x 0. f is di erentiable at x 0, if te following it exists: f 0 fx 0 + ) fx 0 ) x 0 )=.
More informationA New Cement to Glue Nonconforming Grids with Robin Interface Conditions: The Finite Element Case
A New Cement to Glue Nonconforming Grids wit Robin Interface Conditions: Te Finite Element Case Martin J. Gander, Caroline Japet 2, Yvon Maday 3, and Frédéric Nataf 4 McGill University, Dept. of Matematics
More informationMath 113 HW #5 Solutions
Mat 3 HW #5 Solutions. Exercise.5.6. Suppose f is continuous on [, 5] and te only solutions of te equation f(x) = 6 are x = and x =. If f() = 8, explain wy f(3) > 6. Answer: Suppose we ad tat f(3) 6. Ten
More informationA Multigrid Tutorial part two
A Multigrid Tutorial part two William L. Briggs Department of Matematics University of Colorado at Denver Van Emden Henson Center for Applied Scientific Computing Lawrence Livermore National Laboratory
More information2 Limits and Derivatives
2 Limits and Derivatives 2.7 Tangent Lines, Velocity, and Derivatives A tangent line to a circle is a line tat intersects te circle at exactly one point. We would like to take tis idea of tangent line
More informationHøgskolen i Narvik Sivilingeniørutdanningen STE6237 ELEMENTMETODER. Oppgaver
Høgskolen i Narvik Sivilingeniørutdanningen STE637 ELEMENTMETODER Oppgaver Klasse: 4.ID, 4.IT Ekstern Professor: Gregory A. Chechkin e-mail: chechkin@mech.math.msu.su Narvik 6 PART I Task. Consider two-point
More informationThe finite element immersed boundary method: model, stability, and numerical results
Te finite element immersed boundary metod: model, stability, and numerical results Lucia Gastaldi Università di Brescia ttp://dm.ing.unibs.it/gastaldi/ INdAM Worksop, Cortona, September 18, 2006 Joint
More informationMetric Spaces. Chapter 7. 7.1. Metrics
Chapter 7 Metric Spaces A metric space is a set X that has a notion of the distance d(x, y) between every pair of points x, y X. The purpose of this chapter is to introduce metric spaces and give some
More informationM(0) = 1 M(1) = 2 M(h) = M(h 1) + M(h 2) + 1 (h > 1)
Insertion and Deletion in VL Trees Submitted in Partial Fulfillment of te Requirements for Dr. Eric Kaltofen s 66621: nalysis of lgoritms by Robert McCloskey December 14, 1984 1 ackground ccording to Knut
More informationNote nine: Linear programming CSE 101. 1 Linear constraints and objective functions. 1.1 Introductory example. Copyright c Sanjoy Dasgupta 1
Copyrigt c Sanjoy Dasgupta Figure. (a) Te feasible region for a linear program wit two variables (see tet for details). (b) Contour lines of te objective function: for different values of (profit). Te
More informationON LOCAL LIKELIHOOD DENSITY ESTIMATION WHEN THE BANDWIDTH IS LARGE
ON LOCAL LIKELIHOOD DENSITY ESTIMATION WHEN THE BANDWIDTH IS LARGE Byeong U. Park 1 and Young Kyung Lee 2 Department of Statistics, Seoul National University, Seoul, Korea Tae Yoon Kim 3 and Ceolyong Park
More informationSolutions by: KARATUĞ OZAN BiRCAN. PROBLEM 1 (20 points): Let D be a region, i.e., an open connected set in
KOÇ UNIVERSITY, SPRING 2014 MATH 401, MIDTERM-1, MARCH 3 Instructor: BURAK OZBAGCI TIME: 75 Minutes Solutions by: KARATUĞ OZAN BiRCAN PROBLEM 1 (20 points): Let D be a region, i.e., an open connected set
More informationProjective Geometry. Projective Geometry
Euclidean versus Euclidean geometry describes sapes as tey are Properties of objects tat are uncanged by rigid motions» Lengts» Angles» Parallelism Projective geometry describes objects as tey appear Lengts,
More informationThe EOQ Inventory Formula
Te EOQ Inventory Formula James M. Cargal Matematics Department Troy University Montgomery Campus A basic problem for businesses and manufacturers is, wen ordering supplies, to determine wat quantity of
More informationSections 3.1/3.2: Introducing the Derivative/Rules of Differentiation
Sections 3.1/3.2: Introucing te Derivative/Rules of Differentiation 1 Tangent Line Before looking at te erivative, refer back to Section 2.1, looking at average velocity an instantaneous velocity. Here
More informationMATH 304 Linear Algebra Lecture 20: Inner product spaces. Orthogonal sets.
MATH 304 Linear Algebra Lecture 20: Inner product spaces. Orthogonal sets. Norm The notion of norm generalizes the notion of length of a vector in R n. Definition. Let V be a vector space. A function α
More informationThe modelling of business rules for dashboard reporting using mutual information
8 t World IMACS / MODSIM Congress, Cairns, Australia 3-7 July 2009 ttp://mssanz.org.au/modsim09 Te modelling of business rules for dasboard reporting using mutual information Gregory Calbert Command, Control,
More informationAn Additive Neumann-Neumann Method for Mortar Finite Element for 4th Order Problems
An Additive eumann-eumann Method for Mortar Finite Element for 4th Order Problems Leszek Marcinkowski Department of Mathematics, University of Warsaw, Banacha 2, 02-097 Warszawa, Poland, Leszek.Marcinkowski@mimuw.edu.pl
More informationInner Product Spaces
Math 571 Inner Product Spaces 1. Preliminaries An inner product space is a vector space V along with a function, called an inner product which associates each pair of vectors u, v with a scalar u, v, and
More informationDistances in random graphs with infinite mean degrees
Distances in random graps wit infinite mean degrees Henri van den Esker, Remco van der Hofstad, Gerard Hoogiemstra and Dmitri Znamenski April 26, 2005 Abstract We study random graps wit an i.i.d. degree
More information2.1: The Derivative and the Tangent Line Problem
.1.1.1: Te Derivative and te Tangent Line Problem Wat is te deinition o a tangent line to a curve? To answer te diiculty in writing a clear deinition o a tangent line, we can deine it as te iting position
More informationCHAPTER 8: DIFFERENTIAL CALCULUS
CHAPTER 8: DIFFERENTIAL CALCULUS 1. Rules of Differentiation As we ave seen, calculating erivatives from first principles can be laborious an ifficult even for some relatively simple functions. It is clearly
More informationAN INTRODUCTION TO NUMERICAL METHODS AND ANALYSIS
AN INTRODUCTION TO NUMERICAL METHODS AND ANALYSIS Revised Edition James Epperson Mathematical Reviews BICENTENNIAL 0, 1 8 0 7 z ewiley wu 2007 r71 BICENTENNIAL WILEY-INTERSCIENCE A John Wiley & Sons, Inc.,
More informationBANACH AND HILBERT SPACE REVIEW
BANACH AND HILBET SPACE EVIEW CHISTOPHE HEIL These notes will briefly review some basic concepts related to the theory of Banach and Hilbert spaces. We are not trying to give a complete development, but
More informationSection 3.3. Differentiation of Polynomials and Rational Functions. Difference Equations to Differential Equations
Difference Equations to Differential Equations Section 3.3 Differentiation of Polynomials an Rational Functions In tis section we begin te task of iscovering rules for ifferentiating various classes of
More information13 PERIMETER AND AREA OF 2D SHAPES
13 PERIMETER AND AREA OF D SHAPES 13.1 You can find te perimeter of sapes Key Points Te perimeter of a two-dimensional (D) sape is te total distance around te edge of te sape. l To work out te perimeter
More informationWriting Mathematics Papers
Writing Matematics Papers Tis essay is intended to elp your senior conference paper. It is a somewat astily produced amalgam of advice I ave given to students in my PDCs (Mat 4 and Mat 9), so it s not
More informationHøgskolen i Narvik Sivilingeniørutdanningen
Høgskolen i Narvik Sivilingeniørutdanningen Eksamen i Faget STE6237 ELEMENTMETODEN Klassen: 4.ID 4.IT Dato: 8.8.25 Tid: Kl. 9. 2. Tillatte hjelpemidler under eksamen: Kalkulator. Bok Numerical solution
More informationNo: 10 04. Bilkent University. Monotonic Extension. Farhad Husseinov. Discussion Papers. Department of Economics
No: 10 04 Bilkent University Monotonic Extension Farhad Husseinov Discussion Papers Department of Economics The Discussion Papers of the Department of Economics are intended to make the initial results
More informationAn inquiry into the multiplier process in IS-LM model
An inquiry into te multiplier process in IS-LM model Autor: Li ziran Address: Li ziran, Room 409, Building 38#, Peing University, Beijing 00.87,PRC. Pone: (86) 00-62763074 Internet Address: jefferson@water.pu.edu.cn
More informationResearch on the Anti-perspective Correction Algorithm of QR Barcode
Researc on te Anti-perspective Correction Algoritm of QR Barcode Jianua Li, Yi-Wen Wang, YiJun Wang,Yi Cen, Guoceng Wang Key Laboratory of Electronic Tin Films and Integrated Devices University of Electronic
More informationNew Vocabulary volume
-. Plan Objectives To find te volume of a prism To find te volume of a cylinder Examples Finding Volume of a Rectangular Prism Finding Volume of a Triangular Prism 3 Finding Volume of a Cylinder Finding
More information2.3 Convex Constrained Optimization Problems
42 CHAPTER 2. FUNDAMENTAL CONCEPTS IN CONVEX OPTIMIZATION Theorem 15 Let f : R n R and h : R R. Consider g(x) = h(f(x)) for all x R n. The function g is convex if either of the following two conditions
More informationCan a Lump-Sum Transfer Make Everyone Enjoy the Gains. from Free Trade?
Can a Lump-Sum Transfer Make Everyone Enjoy te Gains from Free Trade? Yasukazu Icino Department of Economics, Konan University June 30, 2010 Abstract I examine lump-sum transfer rules to redistribute te
More informationComputer Science and Engineering, UCSD October 7, 1999 Goldreic-Levin Teorem Autor: Bellare Te Goldreic-Levin Teorem 1 Te problem We æx a an integer n for te lengt of te strings involved. If a is an n-bit
More informationMean Value Coordinates
Mean Value Coordinates Michael S. Floater Abstract: We derive a generalization of barycentric coordinates which allows a vertex in a planar triangulation to be expressed as a convex combination of its
More informationDetermine the perimeter of a triangle using algebra Find the area of a triangle using the formula
Student Name: Date: Contact Person Name: Pone Number: Lesson 0 Perimeter, Area, and Similarity of Triangles Objectives Determine te perimeter of a triangle using algebra Find te area of a triangle using
More informationNotes: Most of the material in this chapter is taken from Young and Freedman, Chap. 12.
Capter 6. Fluid Mecanics Notes: Most of te material in tis capter is taken from Young and Freedman, Cap. 12. 6.1 Fluid Statics Fluids, i.e., substances tat can flow, are te subjects of tis capter. But
More informationInner product. Definition of inner product
Math 20F Linear Algebra Lecture 25 1 Inner product Review: Definition of inner product. Slide 1 Norm and distance. Orthogonal vectors. Orthogonal complement. Orthogonal basis. Definition of inner product
More informationTRADING AWAY WIDE BRANDS FOR CHEAP BRANDS. Swati Dhingra London School of Economics and CEP. Online Appendix
TRADING AWAY WIDE BRANDS FOR CHEAP BRANDS Swati Dingra London Scool of Economics and CEP Online Appendix APPENDIX A. THEORETICAL & EMPIRICAL RESULTS A.1. CES and Logit Preferences: Invariance of Innovation
More informationPart II: Finite Difference/Volume Discretisation for CFD
Part II: Finite Difference/Volume Discretisation for CFD Finite Volume Metod of te Advection-Diffusion Equation A Finite Difference/Volume Metod for te Incompressible Navier-Stokes Equations Marker-and-Cell
More informationMethods for Finding Bases
Methods for Finding Bases Bases for the subspaces of a matrix Row-reduction methods can be used to find bases. Let us now look at an example illustrating how to obtain bases for the row space, null space,
More informationComputational Geometry Lab: FEM BASIS FUNCTIONS FOR A TETRAHEDRON
Computational Geometry Lab: FEM BASIS FUNCTIONS FOR A TETRAHEDRON John Burkardt Information Technology Department Virginia Tech http://people.sc.fsu.edu/ jburkardt/presentations/cg lab fem basis tetrahedron.pdf
More informationAverage and Instantaneous Rates of Change: The Derivative
9.3 verage and Instantaneous Rates of Cange: Te Derivative 609 OBJECTIVES 9.3 To define and find average rates of cange To define te derivative as a rate of cange To use te definition of derivative to
More information- 1 - Handout #22 May 23, 2012 Huffman Encoding and Data Compression. CS106B Spring 2012. Handout by Julie Zelenski with minor edits by Keith Schwarz
CS106B Spring 01 Handout # May 3, 01 Huffman Encoding and Data Compression Handout by Julie Zelenski wit minor edits by Keit Scwarz In te early 1980s, personal computers ad ard disks tat were no larger
More information6. Differentiating the exponential and logarithm functions
1 6. Differentiating te exponential and logaritm functions We wis to find and use derivatives for functions of te form f(x) = a x, were a is a constant. By far te most convenient suc function for tis purpose
More informationCatalogue no. 12-001-XIE. Survey Methodology. December 2004
Catalogue no. 1-001-XIE Survey Metodology December 004 How to obtain more information Specific inquiries about tis product and related statistics or services sould be directed to: Business Survey Metods
More informationA PRIORI ESTIMATES FOR SEMISTABLE SOLUTIONS OF SEMILINEAR ELLIPTIC EQUATIONS. In memory of Rou-Huai Wang
A PRIORI ESTIMATES FOR SEMISTABLE SOLUTIONS OF SEMILINEAR ELLIPTIC EQUATIONS XAVIER CABRÉ, MANEL SANCHÓN, AND JOEL SPRUCK In memory of Rou-Huai Wang 1. Introduction In this note we consider semistable
More information1. Introduction. O. MALI, A. MUZALEVSKIY, and D. PAULY
Russ. J. Numer. Anal. Math. Modelling, Vol. 28, No. 6, pp. 577 596 (2013) DOI 10.1515/ rnam-2013-0032 c de Gruyter 2013 Conforming and non-conforming functional a posteriori error estimates for elliptic
More informationUnemployment insurance/severance payments and informality in developing countries
Unemployment insurance/severance payments and informality in developing countries David Bardey y and Fernando Jaramillo z First version: September 2011. Tis version: November 2011. Abstract We analyze
More informationLecture 10. Finite difference and finite element methods. Option pricing Sensitivity analysis Numerical examples
Finite difference and finite element methods Lecture 10 Sensitivities and Greeks Key task in financial engineering: fast and accurate calculation of sensitivities of market models with respect to model
More informationMath 4310 Handout - Quotient Vector Spaces
Math 4310 Handout - Quotient Vector Spaces Dan Collins The textbook defines a subspace of a vector space in Chapter 4, but it avoids ever discussing the notion of a quotient space. This is understandable
More informationTraining Robust Support Vector Regression via D. C. Program
Journal of Information & Computational Science 7: 12 (2010) 2385 2394 Available at ttp://www.joics.com Training Robust Support Vector Regression via D. C. Program Kuaini Wang, Ping Zong, Yaoong Zao College
More informationf(x + h) f(x) h as representing the slope of a secant line. As h goes to 0, the slope of the secant line approaches the slope of the tangent line.
Derivative of f(z) Dr. E. Jacobs Te erivative of a function is efine as a limit: f (x) 0 f(x + ) f(x) We can visualize te expression f(x+) f(x) as representing te slope of a secant line. As goes to 0,
More informationPOLYNOMIAL HISTOPOLATION, SUPERCONVERGENT DEGREES OF FREEDOM, AND PSEUDOSPECTRAL DISCRETE HODGE OPERATORS
POLYNOMIAL HISTOPOLATION, SUPERCONVERGENT DEGREES OF FREEDOM, AND PSEUDOSPECTRAL DISCRETE HODGE OPERATORS N. ROBIDOUX Abstract. We show that, given a histogram with n bins possibly non-contiguous or consisting
More informationSimilarity and Diagonalization. Similar Matrices
MATH022 Linear Algebra Brief lecture notes 48 Similarity and Diagonalization Similar Matrices Let A and B be n n matrices. We say that A is similar to B if there is an invertible n n matrix P such that
More information100 Austrian Journal of Statistics, Vol. 32 (2003), No. 1&2, 99-129
AUSTRIAN JOURNAL OF STATISTICS Volume 3 003, Number 1&, 99 19 Adaptive Regression on te Real Line in Classes of Smoot Functions L.M. Artiles and B.Y. Levit Eurandom, Eindoven, te Neterlands Queen s University,
More informationMATHEMATICAL MODELS OF LIFE SUPPORT SYSTEMS Vol. I - Mathematical Models for Prediction of Climate - Dymnikov V.P.
MATHEMATICAL MODELS FOR PREDICTION OF CLIMATE Institute of Numerical Matematics, Russian Academy of Sciences, Moscow, Russia. Keywords: Modeling, climate system, climate, dynamic system, attractor, dimension,
More informationNumerical Analysis Lecture Notes
Numerical Analysis Lecture Notes Peter J. Olver 5. Inner Products and Norms The norm of a vector is a measure of its size. Besides the familiar Euclidean norm based on the dot product, there are a number
More informationMultigrid computational methods are
M ULTIGRID C OMPUTING Wy Multigrid Metods Are So Efficient Originally introduced as a way to numerically solve elliptic boundary-value problems, multigrid metods, and teir various multiscale descendants,
More informationON SEQUENTIAL CONTINUITY OF COMPOSITION MAPPING. 0. Introduction
ON SEQUENTIAL CONTINUITY OF COMPOSITION MAPPING Abstract. In [1] there was proved a theorem concerning the continuity of the composition mapping, and there was announced a theorem on sequential continuity
More informationLinear Algebra I. Ronald van Luijk, 2012
Linear Algebra I Ronald van Luijk, 2012 With many parts from Linear Algebra I by Michael Stoll, 2007 Contents 1. Vector spaces 3 1.1. Examples 3 1.2. Fields 4 1.3. The field of complex numbers. 6 1.4.
More informationThese axioms must hold for all vectors ū, v, and w in V and all scalars c and d.
DEFINITION: A vector space is a nonempty set V of objects, called vectors, on which are defined two operations, called addition and multiplication by scalars (real numbers), subject to the following axioms
More informationError estimates for nearly degenerate finite elements
Error estimates for nearly degenerate finite elements Pierre Jamet In RAIRO: Analyse Numérique, Vol 10, No 3, March 1976, p. 43 61 Abstract We study a property which is satisfied by most commonly used
More informationLet H and J be as in the above lemma. The result of the lemma shows that the integral
Let and be as in the above lemma. The result of the lemma shows that the integral ( f(x, y)dy) dx is well defined; we denote it by f(x, y)dydx. By symmetry, also the integral ( f(x, y)dx) dy is well defined;
More informationNotes on Symmetric Matrices
CPSC 536N: Randomized Algorithms 2011-12 Term 2 Notes on Symmetric Matrices Prof. Nick Harvey University of British Columbia 1 Symmetric Matrices We review some basic results concerning symmetric matrices.
More informationMATHEMATICS FOR ENGINEERING DIFFERENTIATION TUTORIAL 1 - BASIC DIFFERENTIATION
MATHEMATICS FOR ENGINEERING DIFFERENTIATION TUTORIAL 1 - BASIC DIFFERENTIATION Tis tutorial is essential pre-requisite material for anyone stuing mecanical engineering. Tis tutorial uses te principle of
More informationx1 x 2 x 3 y 1 y 2 y 3 x 1 y 2 x 2 y 1 0.
Cross product 1 Chapter 7 Cross product We are getting ready to study integration in several variables. Until now we have been doing only differential calculus. One outcome of this study will be our ability
More informationCyber Epidemic Models with Dependences
Cyber Epidemic Models wit Dependences Maocao Xu 1, Gaofeng Da 2 and Souuai Xu 3 1 Department of Matematics, Illinois State University mxu2@ilstu.edu 2 Institute for Cyber Security, University of Texas
More information17. Inner product spaces Definition 17.1. Let V be a real vector space. An inner product on V is a function
17. Inner product spaces Definition 17.1. Let V be a real vector space. An inner product on V is a function, : V V R, which is symmetric, that is u, v = v, u. bilinear, that is linear (in both factors):
More informationTheoretical calculation of the heat capacity
eoretical calculation of te eat capacity Principle of equipartition of energy Heat capacity of ideal and real gases Heat capacity of solids: Dulong-Petit, Einstein, Debye models Heat capacity of metals
More informationNotes on metric spaces
Notes on metric spaces 1 Introduction The purpose of these notes is to quickly review some of the basic concepts from Real Analysis, Metric Spaces and some related results that will be used in this course.
More informationSchedulability Analysis under Graph Routing in WirelessHART Networks
Scedulability Analysis under Grap Routing in WirelessHART Networks Abusayeed Saifulla, Dolvara Gunatilaka, Paras Tiwari, Mo Sa, Cenyang Lu, Bo Li Cengjie Wu, and Yixin Cen Department of Computer Science,
More information1 VECTOR SPACES AND SUBSPACES
1 VECTOR SPACES AND SUBSPACES What is a vector? Many are familiar with the concept of a vector as: Something which has magnitude and direction. an ordered pair or triple. a description for quantities such
More informationVector Spaces 4.4 Spanning and Independence
Vector Spaces 4.4 and Independence October 18 Goals Discuss two important basic concepts: Define linear combination of vectors. Define Span(S) of a set S of vectors. Define linear Independence of a set
More informationFourth-Order Compact Schemes of a Heat Conduction Problem with Neumann Boundary Conditions
Fourth-Order Compact Schemes of a Heat Conduction Problem with Neumann Boundary Conditions Jennifer Zhao, 1 Weizhong Dai, Tianchan Niu 1 Department of Mathematics and Statistics, University of Michigan-Dearborn,
More informationA gentle introduction to the Finite Element Method. Francisco Javier Sayas
A gentle introduction to the Finite Element Method Francisco Javier Sayas 2008 An introduction If you haven t been hiding under a stone during your studies of engineering, mathematics or physics, it is
More informationSolving partial differential equations (PDEs)
Solving partial differential equations (PDEs) Hans Fangor Engineering and te Environment University of Soutampton United Kingdom fangor@soton.ac.uk May 3, 2012 1 / 47 Outline I 1 Introduction: wat are
More informationStress Recovery 28 1
. 8 Stress Recovery 8 Chapter 8: STRESS RECOVERY 8 TABLE OF CONTENTS Page 8.. Introduction 8 8.. Calculation of Element Strains and Stresses 8 8.. Direct Stress Evaluation at Nodes 8 8.. Extrapolation
More informationT ( a i x i ) = a i T (x i ).
Chapter 2 Defn 1. (p. 65) Let V and W be vector spaces (over F ). We call a function T : V W a linear transformation form V to W if, for all x, y V and c F, we have (a) T (x + y) = T (x) + T (y) and (b)
More information3. INNER PRODUCT SPACES
. INNER PRODUCT SPACES.. Definition So far we have studied abstract vector spaces. These are a generalisation of the geometric spaces R and R. But these have more structure than just that of a vector space.
More informationMath 312 Homework 1 Solutions
Math 31 Homework 1 Solutions Last modified: July 15, 01 This homework is due on Thursday, July 1th, 01 at 1:10pm Please turn it in during class, or in my mailbox in the main math office (next to 4W1) Please
More informationVector and Matrix Norms
Chapter 1 Vector and Matrix Norms 11 Vector Spaces Let F be a field (such as the real numbers, R, or complex numbers, C) with elements called scalars A Vector Space, V, over the field F is a non-empty
More informationClassification of Cartan matrices
Chapter 7 Classification of Cartan matrices In this chapter we describe a classification of generalised Cartan matrices This classification can be compared as the rough classification of varieties in terms
More information