THE FINITE ELEMENT METHOD FOR ELLIPTIC PROBLEMS
STUDIES IN MATHEMATICS AND ITS APPLICATIONS VOLUME 4
Editors : J.L. LIONS, Paris G . PAPANICOLAOU, New York R.T. ROCKAFELLAR, Seattle
NORTH-HOLLAND PUBLISHING COMPANY AMSTERDAM . NEW YORK * OXFORD
THE FINITE ELEMENT METHOD FOR ELLIPTIC PROBLEMS
PHILIPPE G . CIARLET Universitk Pierre et Marie Curie, Paris
NORTH-HOLLAND PUBLISHING COMPANY AMSTERDAM * NEW YORK * OXFORD
@ NORTH-HOLLAND PUBLISHING COMPANY
- 1978
All rights reserved. N o pat? of this publication may be reproduced, stored in a retrieval system, or transmitted, in any form or by any means, electronic, mechanical, photocopying, recording or otherwise, without the prior permission of the copyright owner.
Library of Congress Catalog Card Number 77-24471 North-Holland ISBN 0 444 85028 7
Published by: NORTH-HOLLAND PUBLISHING COMPANY AMSTERDAM. NEW YORK . OXFORD Sole distributors for the U.S.A. and Canada:
Elsevier North-Holland, Inc. 52 Vanderbilt Avenue New York, NY 10017
1s t edition 19 7 8 2nd printing 19 79
Library of Congress Cataloging in Publication Data
Ciarlet, Philippe G. The finite element method for elliptic problems. (Studies in mathematics and its applications; v. 4) Bibliography: p. 481 Includes index. 1. Partial differential equations, Elliptic-Numerical solutions. 2. Boundary value problems - Numerical solutions. 3. Finite element method. I. Title. 11. Series. QA377.CS3 515l.353 77-24477 ISBN 0-444-85028-7
PRINTED IN THE NETHERLANDS
TO Monique
This Page Intentionally Left Blank
PREFACE
The objective of this book is to analyze within reasonable limits (it is not a treatise) the basic mathematical aspects of the finite element method. The book should also serve as an introduction to current research on this subject. On the one hand, it is also intended to be a working textbook for advanced courses in Numerical Analysis, as typically taught in graduate courses in American and French universities. For example, it is the author’s experience that a one-semester course (on a three-hour per week basis) can be taught from Chapters 1, 2 and 3 (with the exception of Section 3.3), while another one-semester course can be taught from Chapters 4 and 6. On the other hand, it is hoped that this book will prove to be useful for researchers interested in advanced aspects of the numerical analysis of the finite element method. In this respect, Section 3.3, Chapters 5 , 7 and 8, and the sections on “Additional Bibliography and Comments” should provide many suggestions for conducting seminars. Although the emphasis is mathematical, it is one of the author’s wishes that some parts of the book will be of some value to engineers, whose familiar objects are perhaps seen from a different viewpoint. Indeed, in the selection of topics, we have been careful in considering only actual problems and we have likewise restricted ourselves to finite element methods which are actually used in contemporary engineering applications. The prerequisites consist essentially in a good knowledge of Analysis and Functional Analysis, notably: Hilbert spaces, Sobolev spaces, and Differential Calculus in normed vector spaces. Apart from these preliminaries and some results on elliptic boundary value problems (regularity properties of the solutions, for example), the book is mathematically self-contained. The main topics covered are the following: Description and mathematical analysis of linear second- and fourthvii
...
VLLL
PREFACE
order boundary value problems which are typically found in elasticity theory: System of equations of two-dimensional and three-dimensional elasticity, problems in the theory of membranes, thin plates, arches, thin shells (Chapters 1 and 8). Description and mathematical analysis of some nonlinear secondorder boundary value problems, such as the obstacle problem (and more generally problems modeled by variational inequalities), the minimal surface problem, problems of monotone type (Chapter 5). Description of conforming finite element methods for solving secondorder or fourth-order problems (Chapter 2). Analysis of the convergence properties of such methods for secondorder problems, including the uniform convergence (Chapter 3), and fourth-order problems (Section 6.1). Description and convergence analysis of finite element methods with numerical integration (Section 4.1). Description and convergence analysis of nonconforming finite element methods for second-order problems (Section 4.2) and fourth-order problems (Section 6.2). Description and interpolation theory for isoparametric finite elements (Section 4.3). Description and convergence analysis of the combined use of isoparametric finite elements and numerical integration for solving secondorder problems over domains with curved boundaries (Section 4.4). Convergence analysis of finite element approximations of some nonlinear problems (Chapter 5 ) . Description and convergence analysis of a mixed finite element method for solving the biharmonic problem, with an emphasis on duality theory, especially as regards the solution of the associated discrete problem (Chapter 7). Description and convergence analysis of finite element methods for arches and shells, including an analysis of the approximation of the geometry by curved and flat elements (Chapter 8). For more detailed information, the reader should consult the Introductions of the Chapters. It is also appropriate to comment on some of the omitted topics. As suggested by the title, we have restricted ourselves to elliptic problems, and this restriction is obviously responsible for the omission of finite element methods for time-dependent problems, a subject which would require another volume. In fact, for such problems, the content of this
PREFACE
ix
book should amply suffice for those aspects of the theory which are directly related to the finite element method. The additional analysis, due to the change in the nature of the partial differential equation. requires functional analytic tools of a different nature. The main omissions within the realm of elliptic boundary value problems concern the so-called hybrid and equilibrium finite element methods, and also mixed methods other than that described in Chapter 7. There are basically two reasons behind these omissions: First. the basic theory for such methods was not yet in a final form by the time this book was completed. Secondly, these methods form such wide and expanding a topic that their inclusion would have required several additional chapters. Other notable omissions are finite element methods for approximating the solution of particular problems. such as problems on unbounded domains. Stokes and Navier-Stokes problems and eigenvalue problems. Nevertheless, introductions to, and references for, the topics mentioned in the above paragraph are given in the sections titled “Additional Bibliography and Comments”. As a rule, all topics which would have required further analytic tools (such as nonintegral Sobolev spaces for instance) have been deliberately omitted. Many results are left as exercises, which is not to say that they should be systematically considered less important than those proved in the text (their inclusion in the text would have meant a much longer book). The book comprises eight chapters. Chapter n , 1 =sn 8. contains an introduction, several sections numbered Section n. I . Section n.2. etc. . . , and a section “Bibliography and Comments”, sometimes followed by a section “Additional Bibliography and Comments“. Theorems, remarks, formulas, figures, and exercises, found in each section are numbered with a three-number system. Thus the second theorem of Section 3.2 is “Theorem 3.3.3”, the fourth remark in Section 4.4 is “Remark 4.4.4”, the twelfth formula of Section 8.3 is numbered (8.3.12) etc. . . . The end of a theorem or of a remark is indicated by the symbol 0. Since the sections (which correspond to a logical subdivision of the text) may vary considerably in length, unnumbered subtitles have been added in each section to help the reader (they appear in the table of contents). The theorems are intended to represent important results. Their number have been kept to a minimum, and there are no lemmas, propositions, or corollaries. This is why the proofs of the theorems are
X
PREFACE
sometimes fairly long. In principle, one can skip the remarks during a first reading. When a term is defined, it is set in italics. Terms which are only given a loose or intuitive meaning are put between quotation marks. There are very few references in the body of the text. All relevant bibliographical material is instead indicated in the sections “Bibliography and Comments” and “Additional Bibliography and Comments”. Underlying the writing of this book, there has been a deliberate attempt to put an emphasis on pedagogy. In particular: All pertinent prerequisite material is clearly delineated and kept to a minimum. It is introduced only when needed. Compfeteproofs are generally given. However, some technical results or proofs which resemble previous proofs are occasionally left to the reader. The chapters are written in such a way that it should not prove too hard for a reader already reasonably familiar with the finite element method to read a given chapter almost independently of the previous chapters. Of course, this is at the expense of some redundancies, which are purposefully included. For the same reason, the index, the glossary of symbols and the interdependence table should be useful. It is in particular with an eye towards classroom use and self-study that exercises of varying difficulty are included at the end of the sections. Some exercises are easy and are simply intended to help the reader in getting a better understanding of the text. More challenging problems (which are generally provided with hints and/or references) often concern significant extensions of the material of the text (they generally comprise several questions, numbered (i), (ii), . . .). In most sections, a significant amount of material (generally at the beginning) is devoted to the introductive and descriptive aspects of the topic under consideration. Many figures are included, which hopefully will help the reader. Indeed, it is the author’s opinion that one of the most fascinating aspects of the finite element method is that it entails a rehabilitation of old-fashioned “classical” geometry (considered as completely obsolete, it has almost disappeared in the curriculae of French secondary schools). There was no systematic attempt to compile an exhaustive bibliography. In particular, most references before 1970 and/or from the engineering literature and/or from Eastern Europe are not quoted. The interested reader is referred to the bibliography of Whiteman (1975). An
PREFACE
XI
effort was made, however, to include the most recent references (published or unpublished) of which the author was aware. as of October, 1976. In attributing proper names to some finite elements and theorems, we have generally simply followed the common usages in French universities, and we hope that these choices will not stir up controversies. Our purpose was not to take issues but rather to give due credit to some of those who are clearly responsible for the invention, or the mathematical justification of, some aspects of the finite element method. For providing a very stimulating and challenging scientific atmosphere, I wish to thank all m y colleagues of the Laboratoire d’Analyse NumCrique at the UniversitC Pierre et Marie Curie, particularly Pierre-Arnaud Raviart and Roland Glowinski. Above all, it is my pleasure to express my very deep gratitude to Jacques-Louis Lions, who is responsible for the creation of this atmosphere. and to whom I personally owe so much. For their respective invitations to Bangalore and Montrtal, I express my sincere gratitude to Professor K.G. Ramanathan and to Professor A. Daigneault. Indeed, this book is an outgrowth of Lectures which I was privileged to give in Bangalore as part of t h e “Applied Mathematics Programme” of the Tata Institute of Fundamental Research, Bombay, and at the University of Montreal, as part of the “SCminaire de MathCmatiques Superieures”. For various improvements, such as shorter proofs and better exposition at various places, I am especially indebted to J. Tinsley Oden, Vidar ThomCe, Annie Puech-Raoult and Michel Bernadou, who have been kind enough to entirely read the manuscript. For kindly providing me with computer graphics and drawings of actual triangulations, I am indebted to Professors J. H. Argyris, C. Felippa, R. Glowinski and 0. C. Zienkiewicz, and to the Publishers who authorized the reprinting of these figures. For their understanding and kind assistance as regards the material realization of this book, sincere thanks are due to Mrs. Damperat, Mrs. Theis and Mr. Riguet. For their expert, diligent, and especially fast, typing of the entire manuscript, I very sincerely thank Mrs. Bugler and Mrs. Guille. For a considerable help in proofreading and in the general elaboration of the manuscript, and for a permanent comprehension in spite of a finite, but
xii
PREFACE
large, number of lost week-ends and holidays, I deeply thank the one to whom this book is dedicated. The author welcomes in advance all comments, suggestions, criticisms, etc. December 1976
Philippe G . Ciarlet
TABLE OF CONTENTS
PREFACE
. . . . . . . . .
GENERALPLAN
.
.
.
.
. . . . . . .
. . . .
vii
. .
.
. . . . .
.
xviii
. . . .
.
. . . . . . .
1
A N D INTERDEPENDENCE TABLE
1. ELLIPTICBOUNDARY V A L U E PROBLEMS
.
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . The symmetric case. Variational inequalities . . . . . The nonsymmetric case. The Lax-Milgram lemma . . . Exercises . . . . . . . . . . . . . . . . . 1.2. Examples of elliptic boundary value problems . . . . . The Sobolev spaces H"(R). Green's formulas . . . .
.
. . . . . . . . . . . . . . . . . . . . . First examples of second-order boundary value problems . . . The elasticity problem . . . . . . . . . . . . . . . .
Introduction
1.1. Abstract problems
Examples of problem . Exercises Bibliography
. . . . . .
.
. .
i
2 2 7 9 10 10 15
23
fourth-order problems: The biharmonic problem, the plate
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . and Comments . . . . . . . . . . . . . .
28 32 35
. . . . . . . . .
36
Introduction . . . . . . . . . . . . . . . . . . . . . 2.1. Basic aspects of the finite element method . . . . . . . . . . The Galerkirl and Ritz methods . . . . . . . . . . . . . . The three basic aspects of the finite element method. Conforming finite element methods . . . . . . . . . . . . . . . . . . . Exercises . . . . . . . . . . . . . . . . . . . . . 2.2. Examples of finite elements and finite element spaces . . . . . . Requirements for finite element spaces . . . . . . . . . . . First examples of finite elements for second order problems: nSimplices of type ( k ) . (3') . . . . . . . . . . . . . . . . Assembly in triangulations. The associated finite element spaces n-Rectangles of type ( k ) . Rectangles of type (2'). (3'). Assembly in triangulations . . . . . . . . . . . . . . . . . . . . First examples of finite elements with derivatives a s degrees of freedom: Hermite n-simplices of type (3). (3'). Assembly in triangulations . . . . . . . . . . . . . . . . . . . . First examples of finite elements for fourth-order problems: the
36 31 31
2. INTRODUCTION
TO T H E F I N I T E ELEMENT METHOD
xiii
38 43 43 43
44 51 55
64
xiv
CONTENTS
Argyris and Bell triangles. the Bogner-Fox-Schmit rectangle . Assembly in triangulations . . . . . . . . . . . . . . . . . . Exercises . . . . . . . . . . . . . . . . . . . . . 2.3. General properties of finite elements and finite element spaces . . . Finite elements as triples (K. P. 2). Basic definitions . The P-inter. . . . . . . . . . . . . . . . . . polation operator AfFine families of finite elements . . . . . . . . . . . . . Construction of finite element spaces xh . Basic definitions . The Xhinterpolation operator . . . . . . . . . . . . . . . . . Finite elements of class Vo and V' . . . . . . . . . . . . Taking into account boundary conditions. The spaces xoh and x m h . Final comments . . . . . . . . . . . . . . . . . . . Exercises . . . . . . . . . . . . . . . . . . . . . 2.4. General considerations on convergence . . . . . . . . . . . Convergent family of discrete problems . . . . . . . . . . Cia's lemma . First consequences . Orders of convergence . . . . Bibliography and comments . . . . . . . . . . . . . . .
3 . CONFORMINGFINITEELEMENT METHODS
FOR SECOND ORDER PROBLEMS
Introduction . . . . . . . . . . . . . . . . . . . . . 3.1. Interpolation theory in Sobolev spaces . . . . . . . . . . . . The Sobolev spaces Wmn.p(fl). The quotient space Wk".P(R)/Pk(fl) . Error estimates for polynomial preserving operators . . . . . . Estimates of the interpolation errors Iu - n K u ) m . q . K for affine families of finite elements . . . . . . . . . . . . . . . . . . Exercises . . . . . . . . . . . . . . . . . . . . . . 3.2. Application to second-order problems over polygonal domains . . . Estimate of the error IIu - uhlll.0 . . . . . . . . . . . . . Sufficient conditions for limh+& - uhlll. = 0 . . . . . . . . . Estimate of the error Iu - u ~ (The ~ Aubin-Nitsche . ~ lemma . . . . Concluding remarks . Inverse inequalities . . . . . . . . . . Exercises . . . . . . . . . . . . . . . . . . . . . 3.3. Uniform convergence . . . . . . . . . . . . . . . . . A model problem . Weighted semi-norms I.l+:m.R . . . . . . . Uniform boundedness of the mapping u + uh with respect to appropriate weighted norms . . . . . . . . . . . . . . . Estimates of the errors Iu - uhlOpo.and Iu - uhl,... Nitsche's method of weighted norms . . . . . . . . . . . . . . . . . . . Exercises . . . . . . . . . . . . . . . . . . . . . Bibliography and comments . . . . . . . . . . . . . . . 4 . OTHERFINITE ELEMENT
. . . . . . . . . . . . .
METHODS FOR SECOND-ORDER PROBLEMS
Introduction . . . . . . . . . . . . . . . . . . . . . . . 4.1. The effect of numerical integration Taking into account numerical integration . Description discrete problem . . . . . . . . . . . . Abstract error estimate: The first Strang !emma . .
69 77 78 78 82 88 95
96 99 101
103 103 104 106 110
110
112 I12 116 122 126 131 131 134 136 139 143 147 147 155
163 167 168 I74 174 178
of the resulting
. . . . . . . . . . . .
178 185
xv
CONTENTS
. . . . . . . . Sufficient conditions for uniform V,. ellipticity Consistency error estimates . The Bramble-Hilbert lemma . . . . Estimate of the error J1u- uhll,. . . . . . . . . . . . . . Exercises . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4.2. A nonconforming method Nonconforming methods for second-order problems . Description of the resulting discrete problem . . . . . . . . . . . . . . Abstract error estimate: The second Strang lemma . . . . . . . An example of a nonconforming finite element: Wilson’s brick . . Consistency error estimate . The bilinear lemma . . . . . . . . Estimate of the error (PKESAu- u ~ I : . ~ ) ’ ’ * . . . . . . . . . . Exercises . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4.3. Isoparametric finite elements lsoparametric families of finite elements . . . . . . . . . . Examples of isoparametric finite elements . . . . . . . . . . Estimates of the interpolation errors Iu - 17Kulm.q.K . . . . . . . Exercises . . . . . . . . . . . . . . . . . . . . . . . . . 4.4. Application to second order problems over curved domains Approximation of a curved boundary with isoparametric finite elements Taking into account isoparametric numerical integration . Description of the resulting discrete problem . . . . . . . . . . . . . Abstract error estimate . . . . . . . . . . . . . . . . Sufficient conditions for uniform V,. ellipticity . . . . . . . . Interpolation error and consistency error estimates . . . . . . Estimate of the error Ili - &,l(l.nh . . . . . . . . . . . . . Exercises . . . . . . . . . . . . . . . . . . . . . Bibliography and comments . . . . . . . . . . . . . . . . Additional bibliography and comments . . . . . . . . . . . . Problems on unbounded domains . . . . . . . . . . . . . The Stokes problem . . . . . . . . . . . . . . . . . Eigenvalue problems . . . . . . . . . . . . . . . . .
187 190
199 201 207 207 209 21 I 217 220 223 224 224 227 230 243 248 248 252 255 257 260 266 270 272 276 276 280 283
5 . APPLICATIONOF THE FINITE E L E M E N T METHOD TO SOME NONLINEAR
. . . . . . . . . . . . . . . . . . Introduction . . . . . . . . . . . . . . . The obstacle problem . . . . . . . . . . . . Variational formulation of the obstacle problem . .
PROBLEMS
5.1.
. . . . . . . . . . . . . . .
An abstract error estimate for variational inequalities . . . . . . Finite element approximation with triangles of type (1). Estimate of . . the error (Iu - u,,ll,. . . . . . . . . . . . . . Exercises . . . . . . . . . . . . . . . . 5.2. The minimal surface problem . . . . . . . . . . . . . . . A formulation of the minimal surface problem . . . . . . . . Finite element approximation with triangles of type (1). Estimate of the error 11u - uhlll.nr . . . . . . . . . . . . . . . . . Exercises . . . . . . . . . . . . . . . . . . . . . 5.3. Nonlinear problems of monotone type . . . . . . . . . . . .
287 287 289 289 291 294 297 301 301 302 310 312
xvi
CONTENTS
. .
A minimization problem over the space Wlj.(f2) 2 r p and its finite element approximation with n-simplices of type ( I ) . . . . . . Sufficient condition for lim, $lu - ~ ~ l = l~ 0 . ~ .. . . . . . . . The equivalent problem Au = f. Two properties of the operator A . Strongly monotone operators . Abstract error estimate . . . . . Estimate of the error I(u - Uhl1l.p.n . . . . . . . . . . . . . Exercises . . . . . . . . . . . . . . . . . . . . . Bibliography and comments . . . . . . . . . . . . . . . Additional bibliography and comments . . . . . . . . . . . . Other nonlinear problems . . . . . . . . . . . . . . . The Navier-Stokes problem . . . . . . . . . . . . . . 6 . FINITEELEMENTMETHODSFORTHEPLATEPROBLEM . . . . . . . Introduction . . . . . . . . . . . . . . . . . . . . . 6.1. Conforming methods . . . . . . . . . . . . . . . . . . Conforming methods for fourth-order problems . . . . . . . . Almost-affine families of finite elements . . . . . . . . . . A “polynomial” finite element of class V’:The Argyris triangle . . A composite finite element of class V1:The Hsieh-Clough-Tocher triangle . . . . . . . . . . . . . . . . . . . . . . A singular finite element of class V’:The singular Zienkiewicz triangle Estimate of the error IIu - ~ ~ l .l ~ . . ~ . . . . . . . . . . Sufficient conditions for limhJlu - uh1I2. = 0 . . . . . . . . Conclusions . . . . . . . . . . . . . . . . . . . . Exercises . . . . . . . . . . . . . . . . . . . . . 6.2. Nonconforming methods . . . . . . . . . . . . . . . . Nonconforming methods for the plate problem . . . . . . . . An example of a nonconforming finite element: Adini’s rectangle . Consistency error estimate . Estimate of the error GKe .rJ~ ~ ~ 1 . K. ) 1 ‘ 2 Further results . . . . . . . . . . . . . . . . . . . Exercises . . . . . . . . . . . . . . . . . . . . . Bibliography and comments . . . . . . . . . . . . . . . 7. A
MIXED FINITE ELEMENT METHOD
. . . . . . . . . . . . . .
Introduction . . . . . . . . . . . . . . . . . . . . . 7.1. A mixed finite element method for the biharmonic problem . . . . Another variational formulation of the biharmonic problem . . . . The corresponding discrete problem . Abstract error estimate . . . Estimate of the error (lu - uhll. R + IAu + &,lo .n) . . . . . . . . Concluding remarks . . . . . . . . . . . . . . . . . Exercise . . . . . . . . . . . . . . . . . . . . . 7.2. Solution of the discrete problem by duality techniques . . . . . . Replacement of the constrained minimization problem by a saddle. . . . . . . . . . . . . . . . . . . point problem Use of Uzawa’s method . Reduction to a seauence of discrete Dirichlet . . . . . . . . . . . . . . problems for the operator - A
312 317 318 321 324 324 325 330 330 331 333 333 334 334 335 336 340 347 352 354 354 356 362 362 364 367 373 374 376 381 381 383 383 386 390 391 392 395 395 399
xvii
CONTENTS
Convergence of Uzawa’s method . . . . . . . . . . Concluding remarks . . . . . . . . . . . . . . Exercises . . . . . . . . . . . . . . . . . . . Bibliography and comments . . . . . . . . . . . . Additional bibliography and comments . . . . . . . . . Primal dual and primal-dual formulations . . . . . . . Displacement and equilibrium methods . . . . . . . . Mixed methods . . . . . . . . . . . . . . . . Hybrid methods . . . . . . . . . . . . . . . . An attempt of general classification of finite element methods E L E M E N T METHODS FOR S H E L L S
. . . . . . . . . .
. . . . . . . . .
402 403 404 406 407 407 412 414 417 42 1
. . . . . . . . . . . .
425
.
8. FINITE
. . . . . . . . . .
Introduction . . . . . . . . . . . . . . . . . . . . . 8.1. The shell problem . . . . . . . . . . . . . . . . . . . Geometrical preliminaries . Koiter’s model . . . . . . . . . . . . . . . . Existence of a solution . Proof for the arch problem Exercises . . . . . . . . . . . . . . . . . . . . . 8.2. Conforming methods . . . . . . . . . . . . . . . . . . The discrete problem . Approximation of the geometry . Approximation of the displacement . . . . . . . . . . . . . . . . . . . . . Finite element methods conforming for the displacements Consistency error estimates . . . . . . . . . . . . . . . Abstract error estimate . . . . . . . . . . . . . . . . . . . . . Estimate of the error (Xi=, IJu, - U.hII?.fj+II& - U3hlli.fl)”’ Finite element methods conforming for the geometry . . . . . . . . . . . . . . Conforming finite element methods for shells 8.3. A nonconforming method for the arch problem . . . . . . . . . The circular arch problem . . . . . . . . . . . . . . . A natural finite element approximation . . . . . . . . . . . Finite element methods conforming for the geometry . . . . . . A finite element method which is not conforming for the geometry . Definition of the discrete problem . . . . . . . . . . . . Consistency error estimates . . . . . . . . . . . . . . . Estimate of the error (lu, - U l h l : . j + Iu2- ~~~l:.,)”’. . . . . . . Exercise . . . . . . . . . . . . . . . . . . . . . Bibliography and comments . . . . . . . . . . . . . . .
425 426 426 431 437 439
. . . . . . .
469
EPILOGUE: Some “real-life” finite element model examples BIBLIOGRAPHY
. . . . . . . . . . . . . .
GLOSSARYOF SYMBOLS
INDEX
. . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . . . . . . . .
439 440
443 447 448 450 450 451 451 452 453
453 461 465 466 466
481
512 52 I
GENERALPLAN ANDINTERDEPENDENCETABLE
r--
FUNDAMENTALS
t o the f.e.m.
Confonmng
1
II
sect. 4 . 1 Numrical lntriration
II
Sect. 4 . 3 . Isoparametric
-\7f.e.
'\
/'
Problems 4th-order p r .
BASIC THEORY
I I
MORL SPECIALIZED TOPICS
“A mathematician’s nightmare is a sequence n, that tends to 0 as becomes infinite.”
E
Paul R. HALMOS: How to Write Mathematics, A.M.S., 1973.
This Page Intentionally Left Blank
CHAPTER
1
ELLIPTIC BOUNDARY VALUE PROBLEMS
Introduction Many problems in elasticity are mathematically represented b y the following minimization problem: T h e unknown u, which is the displacement of a mechanical system, satisfies
uE U
and
J ( u )= hf,J(v),
where the set U of admissible displacements is a closed convex subset of a Hilbert space V, and the energy J of the system takes the form J ( u )=ia(u, u>-f(u),
where a ( . . is a symmetric bilinear form and f is a linear form, both defined and continuous over the space V. In Section 1.1, we first prove a general existence result (Theorem 1.1.1), the main assumptions being the completeness of the space V and the V-ellipticity of the bilinear form. We also describe other formulations of the same problem (Theorem l.l.2), known as its uariational formulations, which, in the absence of the assumption of symmetry for the bilinear form, make up uariational problems on their own. For such problems, we give an existence theorem when U = V (Theorem l.l.3), which is the well-known L a x 0
)
Milgram lemma.
All these problems are called abstract problems inasmuch as they represent a n “abstract” formulation which is common to many examples, such as those which are examined in Section 1.2. From the analysis made in Section 1.1, a candidate for the space V must have the following properties: It must be complete on the one hand, and it must be such that the expression J ( u ) is well-defined for all functions u E V on the other hand ( V is a “space of finite energy”). The Soboleu spaces fulfill these requirements. After briefly mentioning some of their properties (other properties will be introduced in later sections, I
2
ELLIPTIC BOUNDARY VALUE PROBLEMS
[Ch. 1, 0 1.1.
as needed), we examine in Section 1.2 specific examples of the abstract problems of Section 1.1, such as the membrane problem, the clamped plate problem, and the system of equations of linear elasticity, which is by far the most significant example. Indeed, even though throughout this book we will often find it convenient to work with the simpler looking problems described at the beginning of Section 1.2, it must not be forgotten that these are essentially convenient model problems for the system of linear elasticity. Using various Green’s formulas in Sobolev spaces, we show that when solving these problems, one solves, at least formally, elliptic boundary value problems of the second and fourth order posed in the classical way.
1.1. Abstract problems
The symmetric case. Variational inequalities All functions and vector spaces considered in this book are real. Let there be given a normed vector space V with norm 11.11, a continuous bilinear form a ( - , : V x V + R , a continuous linear form f: V + R and a non empty subset U of the space V. With these data we associate an abstract minimization problem: Find an element u such that a)
uEU
and J(u) = hiJ ( u ) ,
(1.1.1)
where the functional J : V + R is defined by J : u E V + J ( u ) = :a(u, u ) - f ( u ) .
( 1.1.2)
As regards existence and uniqueness properties of the solution of this problem, the following result is essential. Theorem 1.1.1. Assume in addition that
(i) the space V is complete, (ii) U is a closed convex subset of V , (iii) the bilinear form a(., .) is symmetric and V-elliptic, in the sense that Sa > o , t l u E V , allul12sa(u, u ) .
(1.1.3)
Ch. 1. 0 1.1.1
3
ABSTRACT PROBLEMS
Then the abstract minimization problem (1.1.1) has one and only one solution. Proof. The bilinear form a(., .) is an inner product over the space V, and the associated norm is equivalent to the given norm 11-11. Thus the space V is a Hilbert space when it is equipped with this inner product. By the Riesz representation theorem, there exists an element af E V such that Vv E
v,
f ( v )= a ( d , 01,
so that, taking into account the symmetry of the bilinear form, we may rewrite the functional as
J ( u ) = ta(u, u) - a(af,u) = ta(u - af,u - a f )- f a ( a f ,af).
Hence solving the abstract minimization problem amounts to minimizing the distance between the element uf and the set U,with respect to the norm Consequently, the solution is simply the projection of the element uf onto the set U,with respect to the inner product a(., By the projection theorem, such a projection exists and is unique, since U is a closed convex subset of the space V. 0
w.
a).
Next, we give equivalent formulations of this problem.
Theorem 1.1.2. A n element u is the solution of the abstract minimization problem (1.1.1) if and only if it satisfies the relations uEU
and V u E U , a ( u , u - u ) a f ( u - u ) ,
(1.1.4)
in the general case, or (1.1.5)
if U is a closed conuex cone with vertex 0, or uE
U and Vu E U, a(u, u ) = f ( u ) ,
(1.1.6)
if U is a closed subspace. Proof. The projection u is completely characterized by the relations
uEU
and VuEU, a ( u f - u , u - u ) S O ,
(1.1.7)
ELLIPTIC BOUNDARY VALUE PROBLEMS
4
[Ch. 1, 0 1.1.
Fig. 1.1.1
the geometrical interpretation of the last inequalities bemg that the angle between the vectors (uf-u)and ( u - u ) is obtuse (Fig. 1.1.1) for all u E U.These inequalities may be written as vuE
u,
a(u, u - u ) 3 a(uf,u - u ) = f ( u - u ) ,
which proves relations (1.1.4). Assume next U is a closed convex cone with vertex'0. Then the point ( u + u ) belongs to the set U whenever the point u belongs to the set U (Fig. 1.1.2).
Fig. 1.1.2
Ch. 1. 0 1.1.1
ABSTRACT PROBLEMS
5
Therefore, upon replacing u by ( u + u ) in inequalities (1.1.4), we obtain the inequalities v u E U, a(u, u ) a f ( u ) ,
so that, in particular, a(u, u ) a f ( u ) . Letting u = 0 in (1.1.4), we obtain a(u, u ) Q f(u), and thus relations (1.1.5) are proved. The converse is
clear. If U is a subspace (Fig. 1.1.3), then inequalities (1.1.5) written with u and - u yield a(u, u ) B f ( u ) and a(u, u ) C f ( u ) for all u E U,from which relations (1.1.6) follow. Again the converse is clear.
-V
Fig. 1.1.3
The characterizations (1.1.4), (1.1.5) and (1.1.6) are called variational formulations of the original minimization problem, the equations (1.1.6) are called variational equations, and the inequalities of (1.1.4) and (1.1.5) are referred to as uariational inequalities. The terminology “variational” will be justified in Remark 1.1.2.
Remark 1.1.1. Since the projection mapping is linear if and only if the subset U is a subspace, it follows that problems associated with uariational inequalities are generally non linear, the linearity or non linearity being that of the mapping f E V’+ u E V,where V’is the dual space of V,all other data being fixed. One should not forget, however, that if the resulting problem is linear when one minimizes over a subspace this is also because the functional is quadratic i.e., it is of the form (1.1.2). The
6
ELLIPTIC BOUNDARY VALUE PROBLEMS
[Ch. 1, 5 1.1.
minimization of more general functionals over a subspace would correspond to nonlinear problems (cf. Section 5.3). 0 Remark 1.1.2. The variational formulations o f Theorem 1.1.2 may be also interpreted from the point of view o f Differential Calculus, as follows. We first observe that the functional J is differentiable at every point u E V, its (Frkchet) derivative J ’ ( u ) E V‘ being such that V u E V , J’(u)u = a(u, v ) - f ( u ) .
(1.1.8)
Let then u be the solution of the minimization problem ( 1 . 1 . l), and let v = u + w be any point of the convex set U. Since the points ( u Ow)
+
belong to the set U for all 8 E [0, 11 (Fig. 1.1.4), we have, by definition of
Fig. 1.1.4
the derivative J ’ ( u ) ,
o s J ( U + e w ) - J ( U ) = eJ’(u)w + ellwlle(e) for all 8 E [0,1], with limo-.0r(O)= 0. As a consequence, we necessarily have J’(u)w 3 0 ,
( 1.1.9)
since otherwise the difference J(u + Ow) - J(u) would be strictly negative for 8 small enough. Using (1.1.8), inequality (1.1.9) may be rewritten as
J’(u)w = J‘(u)(v - u ) = a ( u , u - u ) - f ( u - u ) 3 0, which is precisely (1.1.4). Conversely, assume we have found an element u E U such that vuE
u,
J’(u)(u- u ) 3 0.
( 1.1.10)
Ch. 1, 8 1.1.1
7
ABSTRACT PROBLEMS
The second derivative J”(u)€L&(V;R) of the functional J is independent of u € V and it is given by tlu,w €
v,
J”(u)(v,w ) = a(v, w).
(1.1.11)
Therefore, an application of Taylor’s formula for any point u = u + w belonging to the set U yields 1 2
J(u + w )- J ( u ) = J‘(u)(w )+ - a ( w,w )3 Ellw((2, 2
(1.1.12)
which shows that u is a solution of problem (1.1.1). We have J ( u ) - J ( u ) > 0 unless u = u so that we see once again the solution is unique. Arguing as in the proof of Theorem 1.1.2, it is an easy matter to verify that inequalities (1.1.10) are equivalent to the relations t l v E U, J’(u)v 3 0 and
J ’ ( u ) u = 0,
(1.1.13)
when U is a convex cone with vertex 0, alternately, vvE
u,
J’(u)v = 0,
( 1.1.14)
when U is a subspace. Notice that relations (1.1.13) coincide with relations (1.1.5), while (1.1.14) coincide with (1.1.6). When U = V, relations (1.1.14) reduce to the familiar condition that the first variation of the functional J, i.e., the first order term J f ( u ) w in the Taylor expansion (1.1.12), vanishes for all w € V when the point u is a minimum of the function J : V + R , this condition being also sufficient if the function J is convex, as is the case here. Therefore the various relations (1.1.4), (1.1.5) and (1.1.6), through the equivalent relations (l.l.lO), (1.1.13) and (1.1.14), appear as generalizations of the previous condition, the expression a(u, u - u ) - f ( v - u ) = J’(u)(v- u ) , v E U , playing in the present situation the role of the first variation of the functional J relative to the conuex set U. It is in this sense that the 0 formulations of Theorem 1.1.2 are called “variational”.
The nonsymmetric case. The Lax-Milgram lemma Without making explicit reference to the functional J, we now define an abstract variational problem : Find an element u such that uEU
and Vv E U, a(u, u - u ) P f ( u - u ) ,
(1.1.15)
8
ELLIPTIC BOUNDARY V A L U E PROBLEMS
[Ch. 1, 8 1.1.
or, find an element u such that ( 1.1.16)
if U is a cone with vertex 0, or, finally, find an element u such that
uEU
and Vu E V,
a(u, u ) = f ( u ) ,
(1.1.17)
if U is a subspace. By Theorem 1.1.1, each such problem has one and only one solution if the space V is complete, the subset U of V is closed and convex, and the bilinear form is V-elliptic, continuous, and symmetric. If the assumption of symmetry of the bilinear form is dropped, the above variational problem still has one and only one solution (LIONS & STAMPACCHIA (1967)) if the space V is a Hilbert space, but there is no longer an associated minimization problem. Here we shall confine ourselves to the case where U = V.
Theorem 1.1.3 (Lax-Milgram lemma). Let V be a Hilbert space, let a(., .): V X V + R be a continuous V-elliptic bilinear form, and let f : V + R be a continuous linear form. Then the abstract variational problem: Find an element u such that uEV
and
V u E V,
a(u, v ) = f ( u ) ,
( 1.1.18)
has one and only one solution. Proof. Let M be a constant such that VU,E ~ V,
u)l C Mllull (lull.
( 1.1.19)
For each u E V, the linear form u E V + a(u, u ) is continuous and thus there exists a unique element A u E V’ (V’ is the dual space of V) such that Vv E V, a(u, u ) = Au(u).
Denoting by
11.11*
( 1.1.20)
the norm in the space V’, we have
Consequently, the linear mapping A: V + V’ is continuous, with IlAIlrecv;v’) =sM.
Let
T:
(1.1.21)
V’+ V denote the Riesz mapping which is such that, by
Ch. 1, 5 1.1.1
ABSTRACT PROBLEMS
9
definition,
vf E v',
vu
v,
f ( u ) = ((Tf, u ) ) ,
( I . 1.22)
denoting the inner product in the space V. Then solving the variational problem (1.1.18) is equivalent to solving the equation TAU= ~ fWe . will show that this equation has one and only one solution by showing that, for appropriate values of a parameter p > O , the affine mapping
));s((
uE V+u-p(~Av-~f)€V
(1.1.23)
is a contraction. To see this, we observe that IIv
- p ~ A u 1 1=~llulr - 2p((~Av,v ) ) + p'11~Au11~ Q
( I - 2pff
+ pZMZ)llu(lZ,
since, using inequalities (1.1.3) and ( I . 1.21), ((TAU,0))
= Au(v) = a(v, u ) z-aIlu11*,
11TA4l = IIA4* s IlAll ll4l s
Mll4
Therefore the mapping defined in (1.1.23) is a contraction whenever the number p belongs to the interval ]0,2a/M2[ and the proof is complete.
Remark 1.1.3. It follows from the previous proof that the mapping A : V + V' is onto. Since
ffll~I12= a ( u , u ) = f(u) c IVII*IIUII. the mapping A has a continuous inverse A-I, with
Therefore the variational problem (1.1.18) is well-posed in the sense that its solution exists, is unique, and depends continuously on the data f (all other data being fixed). 0 Exercises 1.1.1. Show that if ui,i = 1,2, are the solutions of minimization problems ( I . 1. I ) corresponding to linear form f i E V', i = I , 2, then
10
ELLIPTIC BOUNDARY VALUE PROBLEMS
[Ch. 1, § 1.2.
(i) Give a proof which uses the norm reducing property of the projection operator. (ii) Give another proof which also applies to the variational problem (1.1.15). 2.2.2. The purpose of this exercise is to give an alternate proof of the Lax-Milgram lemma (Theorem 1.1.3). As in the proof given in the text,
one first establishes that the mapping 1 = T . A: V + V is continuous with 11~411d M,and that aIJu(IG llS4ull for all u E V. It remains to show that
1(V )=
v.
(i) Show that 1 ( V ) is a closed subspace of V. (ii) Show that the orthogonal complement of 1 ( V )in the space V is reduced to (0). 1.2. Examples of elliptic boundary value problems
The Sobolev spaces H " ( R ) . Green's formulas Let us first briefly recall some results from Differential Calculus. Let there be given two normed vector spaces X and Y and a function u : A + Y,where A is a subset of X. If the function is k times differentiable at a point a E A, we shall denote D k u ( a ) ,or simply Du(a) if k = 1, its k-th (Fre'chet) derivative. It is a symmetric element of the space 2k(x;Y),whose norm is given by
We shall also use the alternate notations Du(a) = u'(a) and D 2 u (a )= u"(a). In the special case where X = R" and Y = R, let ei, 1 d i S n, denote the canonical basis vectors of R".Then the usual partial derivatives will be denoted by, and are given by, the following:
aiu(a)= Du(a)ei, aiju(a)= D2u(a)(ei,ei), aijku(a)= D3v(a)(ei,ei, ek),etc. . . Occasionally, we shall use the notation V u ( a ) , or grad u ( a ) ,to denote the gradient of the function u at the point a, i.e., the vector in R" whose components are the partial derivatives aiu(a), 1 s i d n.
Ch. I ,
B
1.2.1
11
EXAMPLES
We shall also use the multi-index notation: Given a multi-index
a = ( a 1a , 2 , .. . , a,,) E N " , we let la'(= X;='=, ai. Then the partial derivative aau(a) is the result of the application of the IaI-th derivative D%(a) to
any [at-vector of (R")lalwhere each vector ei occurs ai times, 1 S i G n. For instance, if n = 3, we have a l u ( a )= a(l*O.o)u(a), aluu(a) = a".'*"u(a), alllu(a)= a ( 3 * 0 * 0 ) ~ etc. ( a ).,. There exist constants C ( m , n ) such that for any partial derivative aau(a) with la1 = m and any function u, la"v(a)l
IID"'v(a)ll
C(m,n)
1s:
la"u(a)l,
where it is understood that the space R" is equipped with the Euclidean norm. As a rule, we shall represent by symbols such as D k u , u", a i U , 8% etc.. . , the functions associated with any derivative or partial derivative. When h l = hz = = hk = h, we shall simply write
- -
D ' ~ ( a ) ( h ih2,. , . . ,hk) = D k v ( a ) h k .
Thus, given a real-valued function u, Taylor's formula of order k is written as k 1 u(a + h ) = u ( a ) + 2 7 D'u(a)h' + -~ k + l u ( + a eh)hk+', /=I I . (k + I)! for some 8 E 10, I[ (whenever such a formula applies). Given a bounded open subset J2 in R",the space 9(0)consists of all indefinitely differentiable functions u : J2 +R with compact support. For each integer m a0,the Soboleu space H"'(f2) consists of those functions u E L'(J2) for which all partial derivatives a% (in the distribution sense), with ( a l b m , belong to the space L2(J2),i.e., for each multi-index a with la1 b m, there exists a function a"u E L2(J2)which satisfies
v#, E g(J2),
I
R
8%
4 dx = (-
1)la1
(1.2.1)
Equipped with the norm
the space H"'(J2) is a Hilbert space. We shall also make frequent use of the semi-norm
12
ELLIPTIC BOUNDARY V A L U E PROBLEMS
[Ch. I , 8 1.2.
We define the Sobolev space = (9(0))-,
the closure being understood in the sense of the norm II.llm,a. When the set 0 is bounded, there exists a constant C ( 0 ) such that
vv E Hdcn),
( u l 0 . n C(0)lvIl.n. ~
(1.2.2)
this inequality being known as the Poincark-Friedrichs inequality. Therefore, when the set 0 is bounded, the semi-norm I-Irnn is a norm over the space Ho"(R), equivalent to the norm lI.llm.n (another way of reaching the same conclusion is indicated in the proof of Theorem 1.2.1 below). The next definition will be sufficient for most subsequent purposes whenever some smoothness of the boundary is needed. It allows the consideration of all commonly encountered shapes without cusps. Following N E ~ A S(1%7), we say that an open set R has a Lipschitzcontinuous boundary r i f the following conditions are fulfilled: There exist constants a > 0 and i3 > 0, and a finite number of local coordinate systems and local maps a,, 1 c r c R, which are Lipschitz-continuous on their respective domains of definitions {arE R"-';1.3.1 d a}, such that (Fig. 1.2.1): R
r = U {(x:, a r ) ;x:= a r ( f r ) , lirl< a}, < a}C 0, 1 6 r c R , {(x:, a'); ar(ar)< x i < a r ( i r )+ B; a,(ir) - p < x l < a,(ar); lirl
i r ) ;
IcrcR, where 2' = (xb . . . ,x@, and lirl< a stands for 1x4 < a , 2 d i d n. Notice in passing that an open set with a Lipschitz-continuous boundary is bounded. Occasionally, we shaIl also need the following definitions: A boundary is of class 2 ' if the functions a,: 1.3'1 S a +R are of class 8? (such as %" or and a boundary is said to be suficiently smooth if it is of class %", or W".', for sufficient high values of m, or m and a (for a given problem). In the remaining part of this section, it will be always understood that 0 is an open subset in R" with a Lipschitz-continuous boundary. This being the case, a superficial measure, which we shall denote dy. can be
Ch. I ,
5 1.2.1
13
EXAMPLES
Fig. 1.2.1
defined along the boundary, so that it makes sense to consider the spaces L 2 ( r ) ,whose norm shall be denoted l l + l l L 2 ( r ) . Then it can be proved that there exists a constant C(R) such that
vv E %"(6),I l u l l L ' ( n ~C(R)lIUlll.I2. (1.2.3) Since in this case (zm(6))= H'(R), the closure being understood in the
sense of the norm JI.II1.~,there exists a continuous linear mapping tr: u E H ' ( R ) + tr u E L 2 ( r ) ,which is called the trace operator. However when no confusion should arise, we shall simply write tr u = u. The following characterization holds:
H ~ ( R ) = { U E H ' ( R ) U; = Since the unit outer normal v
O
on
r}.
= ( v , ,. . . , v,)
(Fig. 1.2.1) exists almost
14
[Ch. 1 , 5 1.2.
ELLIPTIC BOUNDARY V A L U E PROBLEMS
everywhere along
r, the (outer) normal derivative operator:
n
a,
=
C viai
i=l
is defined almost everywhere along r for smooth functions. Extending its definition to a, = Cy=, vi tr ai for functions in the space H2(L?),the following characterization holds:
Ht(L?)= { u E H2(L?); u
= a,u =
o
on
r).
Given two functions u, u E H ’ ( L ? ) ,the following fundamental Green’s formula u&u dx = -
a;u u dx
+
Ir
u uv; d y
(1.2.4)
holds f o r any i E [ I , n ] . From this formula, other Green’s formulas may be easily deduced. For example, replacing u by diu and taking the sum from 1 to n , we get (1.2.5)
for all u E H2(L?),u E H ’ ( R ) .As a consequence, we obtain by subtraction:
I R ( u A u - Au u ) dx =
Ir
(ua,u - a,u u ) d y
(1.2.6)
for all u, u E HZ(R).Replacing u by A u in formula (1.2.6), we obtain
1
n
AuAudx=I A’uudx-I R
r
aJuvdy+/
r
Aua,ndy ( I .2.7)
for all u E H4(L?),u E H2(L?).As another application of formula (1.2.4), let us prove the relation vu E H ; ( n ) ,
I A ~ I o , R =IuI2.0,
(1.2.8)
which implies that, over the space Ht(L?), the semi-norm u + IAu(o.n is a norm, equivalent to the norm 11*112,~: We have, by definition,
Ch. I , 8 1.2.1
I5
EXAMPLES
Clearly, it suffices to prove relations (1.2.8) for all functions u E 9(0). For these functions we have
as two applications of Green’s formula (1.2.4) show, and thus (1.2.8) is proved. For n = 2, let T = ( T ~T, ~ denote ) the unit tangential vector along the boundary oriented in the usual way. In addition to the normal derivative operator a,, we introduce the differential operators a,, am, a, defined by
r,
Then we shall make use of the following Green’s formula, whose proof is left as an exercise (Exercise 1.2.1):
=
Ir{-
d,ud,u
+ a,ua,u}
dy.
(1.2.9)
This relation holds for all functions u E H 3 ( 0 ) ,u E H ’ ( 0 ) . First examples of second-order boundary value problems
We next proceed to examine several examples of minimization and variational problems. According to the analysis made in Section 1 . 1 , we need to specify for each example the space V, a subset U of the space V, a bilinear form a(., V x V + R , and a linear form f : V + R . In fact, the examples given in this section correspond to the case where U = V, i.e., they all correspond to linear problems (Remark 1.1.1). A non linear problem is considered in Exercise 1.2.5, and another one will be considered in Section 5.1. 0 ) :
16
ELLIPTIC BOUNDARY V A L U E PROBLEMS
[Ch. I .
I
1.2.
The first example corresponds to the following data:
v = u = Hd(R), ( I .2.10)
and to the following assumptions on the functions a and f :
a E L"(R), a
2 0 a.e.
on
R, f~
~~(0).
(1.2.1 1)
To begin with. it is clear that the symmetric bilinear form a ( . ; ) is continuous since for all u, u E H1(R),
C
Ia (u. u I
i= I
I a i Io.nl ~ diu
1o.n + Ia lo,m.nI~Io.nIu 1o.n
s max { 1, la Io.m.dll~llI.dl~llI.~~
where and (-lO. m , n denote the norms of the space L2(R) and L"(R) respectively, and it is HA(R)-elliptic since, for all u E H'(R),
(the semi-norm 1 - 1 1 , ~ is a norm over the space HA(R), equivalent to the norm ~ ~ ~ ~ Next, ~ l . nthe ) . linear form f is continuous since for all u E H'(R),
If(.)l
6 Iflo.nl~l0.ns Iflo.nll~ll1.n.
Therefore, by Theorem 1.1.1, there exists a unique function u E Hd(R) which minimizes the functional
J : u +J(v)
=
51
I [i
( & u ) ~ +a u 2 ] dx -
R
i=l
I,f.
dx
( 1 .2.12)
over the space Hd(R), or equivalently, by Theorem 1.1.2, which satisfies the variational equations
vu E Hd(R),
{2 a,ua,u + auu] dx = lofu dx.
(1.2.13)
Using these equations, we proceed to show that we are also solving a partial differential equation in the distributional sense. More specifically, let 9'(R) denote the space of distributions over the set R, i.e., the dual
Ch. 1, 5 1.2.1
17
EXAMPLES
space of the space 9(0)equipped with the Schwartz topology, and let (., -) denote the duality pairing between the spaces 9'(0)and 9(0).If g
is a locally integrable function over 0, we shall identify it with the distribution g : 4 E 9 ( R ) + J n g 4 dx. Since the inclusion 9(0)c
v = HA(0)
holds, the variational equations (1.2.13) are satisfied for all functions v E 9(0).Therefore, by definition of the differentiation for distributions, we may write
V 4 E 9(0), a ( u , 4) =
(&u, & 4 ) + (au, 4) = ( - A u i=l
+ au, 4).
Since f(4)= (f, 4) for all 4 E 9(0),it follows from the above relations that u is a solution of the partial differential equation - Au + au = f in 9'(R). To sum up, the solution u of the minimization (or variational) problem associated with the data (1.2.10) is also a solution of the problem: Find a distribution u E 9'(0) such that
u E H d ( 0 ) and
-Au
+ au = f in 9'(0),
(1.2.14)
and conversely, if a distribution u satisfies (1.2.14), it is a solution of the original problem. To see this, we observe that the equalities
V 4 E 9(0), a ( u , 4) = ( - A u + au, 4) = (f, 4) = f(4) hold in fact for all functions 4 E H d ( 0 ) since 9(0)is a dense subspace of the space H d ( 0 ) . Remembering that the functions in the space H d ( 0 ) have a vanishing trace along we shall say that we have formally solved the associated boundary value problem
r,
- A u + a u = f in u = O on r.
0,
(1.2.15)
Problem (1.2.15) is called a homogeneous Dirichlet problem for the operator u --* - A u + au, since it is formally posed exactly as in the classical sense where, typically, one would seek a solution in the space %'(d)n Actually, when the data are sufficiently smooth, it can be proved (but this is non trivial) that the solution of (1.2.14) is also a solution of (1.2.15) in the classical sense. Nevertheless, one should keep
%'(a).
18
ELLIPTIC BOUNDARY V A L U E PROBLEMS
Ch. I . I 1.2.1
in mind that, in general, nothing guarantees that the partial differential equation - A u + au = f in R can be given a sense otherwise than in the space S‘(0). Likewise the boundary condition u = 0 on r cannot be understood in general in other than the sense of a vanishing trace, or even in no sense at all if the set R were “only” supposed to be bounded. With a = 0 and n = 2, the problem under analysis is called the membrane problem: It arises when one considers the problem of finding the equilibrium position of an elastic membrane, with tension 7 . under the action of a “vertical” force, of density F = 7f, and lying in the “horizontal” plane, of coordinates (xi,xz), when f = 0, as shown in Fig. 1.2.2 (where the vertical scale is considerably distorted if it were to correspond to an actual membrane). More general situations are considered in Exercise 1.2.2 and Section 5.1.
Fig. 1.2.2
The second example corresponds to the following data:
1 v = u = H1(R),
]
a(u, u ) =
1(5 R
i=l
&uaiu + a m ) dx,
( 1.2.16)
with the following assumptions on the functions a, f and g: a E L=(R), a 3 a.
> o a.e. on R, f E L 2 ( 0 ) ,
gE
~’(r), (1.2.17)
for some constant ao. The bilinear form is H1(R)-elliptic since a(v, u ) B min (1, ao}llull:,R for
Ch. 1, 0 1.2.1
19
EXAMPLES
all u E H ' ( 0 ) (in Exercise 1.2.3, a case where a. = 0 is considered). The linear form u E H'(O)+JrgU d y is continuous since by inequality (1.2.3),
1
J r g u dyl 6 ll~IIL2~nll~llL2(n C(~)ll~llL~tnll~II*.n.
Therefore there exists a unique function u E H ' ( 0 ) which minimizes the functional
J : u - J ( u ) = - 1/ 2
( x"( J i u ) ' + a u 2 R
r=l
over the space H ' ( 0 ) or equivalently, such that
In{2
Vu E H 1 ( 0 ) ,
aiuaiu
+ auu} dx =
In
f v dx + f r g u dy. ( 1.2.18)
Because 9(0) is a subspace of the space H ' ( 0 ) , an argument similar to the one used for the first example shows that u is also a solution of the partial differential equation - A u + au = f in 9'(0).Thus we have V u E H ' ( R ) , (- Au
+ au)u dx = a(u , u ) -
I,
gu dy.
To sum up, the solution u of the minimization (or variational) problem associated with the data (1.2.16) is also a solution of the problem: Find a distribution u E W(0) such that u E H'(R),
+ au = f in 9'(0), (-Au + au)u dx = a ( u , u ) -
-Au
(1.2.19)
and, conversely, if a distribution u is a solution of problem (l.2.19), it is clearly a solution of the variational equations (1.2.18). If we assume additional smoothness on the solution, the second relations (1.2.19) can be interpreted as playing the role of boundary conditions. If the solution u is in the space H2(0), for example, an application of Green's formula (1.2.5) shows that, for all u E H ' ( 0 ) , a(u, u ) =
I,(-Au +
= IRfu
a u ) u dx
+
dx + l r g u dy.
(1.2.20)
20
ELLIPTIC BOUNDARY VALUE PROBLEMS
[Ch. I , 9 1.2.
Therefore the conjunction of relations (1.2.19) and (1.2.20) implies that
I
V u EH’(R)
r
a,u u d y =
I
r
gu
dy.
(1.2.21)
r.
From these, one deduces that a,u = g on Consequently, we shall say that we have formally solued the a s sociated boundary value problem :
-Au+au= f a,u = g on
in
r,
0,
(1.2.22)
which is called a nonhomogeneous Neumann problem if g Z 0 , or a homogeneous Neumann problem if g = 0 , for the operator u + - A u + au.
Remark 1.2.1. Without using differentiation of distributions, Green’s formula (1.2.5) gives another way to obtain the partial differential equation since
V 4 E 9(0), a ( u , 4) =
I R
(- Au
+ a u ) 4 dx = (- Au + au, 4).
Of course, this is not a coincidence: The definition of differentiation for distributions is precisely based upon the fundamental Green’s for0 mula (1.2.4). In the third example, we shall extend in three directions the previous analysis: First the associated partial differential equation will have non constant coefficients. Secondly, the bilinear form will not be necessarily symmetric so that Theorem 1.1.3 will be needed for the existence analysis, and thirdly, the space V will be “intermediate” between the spaces HA(R) and H‘(R).The data are the following:
(1.2.23)
r-
where ro= rl is a dy-measurable subset of the boundary r with a strictly positive dy-measure, and the functions aii, a and f satisfy the
Ch. 1, 0 1.2.1
21
EXAMPLES
following assumptions:
3 p > 0,
vti,
I
i
n,
i aiititj p 5
i,j= I
3
i= I
a.e.
on
0.
(1.2.25) The V-ellipticity of the bilinear form will be a consequence of the following result.
Theorem 1.2.1. Let O be a connected bounded open subset of R". Then the space V defined in (1.2.23) is a closed subspace o f H1(R). If the dy-measure of r0is strictly positive, the semi-norm 1.11.nis a norm over the space V, equivalent to the norm ~ ~ . ~ I 1 . ~ .
Proof. Let ( V k ) be a sequence of functions in the space V which converges to an element u E H 1 ( 0 ) .Since the sequence (tr uk) converges to tr u in the space L * ( r ) (cf. inequalities (1.2.3)), it contains a subsequence which converges almost everywhere to tr u and thus tr u = 0 a.e. on This implies that the function u belongs to the space V. Next, let us show that is a norm over the space V. Let u be a function in the space V which satisfies 0. Then it is a constant by virtue of the connectedness of the set R and, being as such a smooth function, its trace is the same constant. That this constant is zero follows from the fact that the trace vanishes on the set To, whose dy-measure is strictly positive. Finally, assume that the two norms ( . J I . Rand ~ ~ ~ are ~ ~ not l , equivalent R over the space V. Then there exists a sequence (uk) of functions vk E V such that
r,.
I.I1.~
i
Vk,
llUkllI,R=
p J
IUI~.~=
1,
lvklI,R
= 0.
By Rellich's theorem, any bounded sequence in the space H1(R)contains a subsequence which converges in L 2 ( 0 ) , so that there exists a sequence ( u I ) of functions uI E V which converges in the space L 2 ( 0 ) and which is such that l i m l - ~ u , ~ l ,=R0. Thus the sequence (UI) is a
22
ELLIPTIC BOUNDARY V A L U E PROBLEMS
"3. 1. 5 1.2.
Cauchy sequence in the complete space V and therefore it converges in the norm Iljl,n to an element v E V. Since ( u I I , ~ liml,(ul(I,a=O, = we deduce that v = 0, which is in con0 tradiction with the equalities (Jut(J I.n= 1 for all k. From this theorem, we infer that the bilinear form of (1.2.23) is V-elliptic since we have a ( v , u ) S PluJ:,n for all u E H ' ( R ) , as an application of the inequalities of (1.2.24) and (1.2.25) shows. By the Lax-Milgram lemma (Theorem 1.1.3), there exists a unique function u E V which satisfies the variational equations
vc E v,
In{
ajja;uajv+ auu
i$l
(1.2.26)
Referring once again to formula (1.2.4), we obtain another Green's formula:
(1.2.27)
valid for all functions u E H *( R ) ,u E H1(R),provided the functions aii are smooth enough so that the functions aiidiu belong to the space H 1 ( R ) (for example, aijE %'(a)). Using ( I .2.27), we conclude that we haue formally solved the boundary value problem i.j= I
aj(aijaiu)+ au
u=O
on
=f
r,,
in
0, (1.2.28)
which is called a homogeneous mixed problem if g = 0 , or a nonhomogeneous mixed problem if g # 0, for the operator n
u -+ -
2 aj(u;ja;u)+ uu,
(1.2.29)
i.j= I
assuming in both cases the dy-measures of r,, and rl are strictly positive. Notice that condition (1.2.25) is the classical ellipticity con-
Ch. I . 8 1.2.1
23
EXAMPLES
dition for an operator such as that of (1.2.29). The operator u+
C aiiviaiu
i.i= I
is called the conormal derivative operator associated with the operator of (1.2.29). If = or r = rl,then we have formally solved a homogeneous Dirichlet problem, or a homogeneous or a nonhomogeneous Neumann problem, for the operator of (1.2.29) (in the second case, we would require an inequality such as a s a,> 0 a.e. on R to get existence).
r r,,
The elasticity problem We now come to the fourth example which is by far the most significant. Let R be a bounded open connected subset of R’ with a Lipschitzcontinuous boundary. We define the space
v = u = {u = (UI.
v2. u3) E (H1(R))’;
vi = 0 on
r,,
1sis3},
(1.2.30)
r,
where To is a dy-measurable subset of with a strictly positive dy-measure. The space V is equipped with the product norm
For any u
= ( v l , v2, v3) E (H’(R))3, we
let
eii(u)= e i i ( u )= :(i+q + aivi), 1 s i, j s 3,
(1.2.31)
and
where aii is the Kronecker’s symbol, and A and p are two constants which are assumed to satisfy A > 0, p > 0. We define the bilinear form a(u,u ) =
=
I c’ fl i.j=l
In{*
aii(u)cii(u)dx
c 3
div u div u + 2 p
i.i = I
q(u)q(u)
24
ELLIPTIC BOUNDARY V A L U E PROBLEMS
[Ch. I , 8 1.2.
and the linear form
where f = ( f ~fi, , f3) E (L2(n)Pand g = (gl,gz, gd E (L2(rl))3,with r~= r - To are given functions. It is clear that these bilinear and linear forms are continuous over the space V. T o prove the V-ellipticity of the bilinear form (see Exercise 1.2.4), one needs Korn's inequality: There exists a constant C ( 0 ) such that, for all u = ( u I , u2, u3)E (H1(f2))3, (1.2.35)
This is a nontrivial inequality, whose proof may be found in DUVAUT & LIONS(1972, Chapter 3, §3.3), or in FICHERA (1972, Section 12). From it, one deduces that over the space V defined in (1.2.30) the mapping = (ulr u2, u3)+
1.
3
=
( 2 lEij(u)li.n)
1/2
i,j= 1
is a norm, equivalent t o the product norm, as long as the d y-measure of Tois strictly positive, which is the case here (again the reader is referred to Exercise 1.2.4). The V-ellipticity is therefore a consequence of the inequalities A > O , p > 0, since by (1.2.33) a ( u , u ) z 2p(uJ2.
We conclude that there exists a unique function u E V which minimizes the functional
over the space V, or equivalently, which is such that
Ch. 1, 0 1.2.1
25
EXAMPLES
Since relations (1.2.37) are satisfied by all functions u E (9(f2))3, they could yield the associated partial differential equation. However, as was pointed out in Remark 1.2.1, it is equivalent to proceed through Green’s formulas, which in addition have the advantage of yielding boundary conditions too. Using Green’s formula (1.2.4), we obtain, for all u E (H2(f2))3and all 5 ) E (H’(R))3:
so that, using definitions (1.2.31) and (1.2.32), we have proved that the following Green’s formula holds:
for all functions u E (H2(f2))3and u E (H1(f2))3. Arguing as in the previous examples, we find that we are formally solving the equations 3
-CaJcjj(u)=fi, j=1
(1.2.39)
1sia3.
It is customary to write these equations in vector form: - p Au - (A
+ p ) grad div u = f
in
0,
which is derived from (1.2.39) simply by using relations (1.2.32). Taking equations (1.2.39) into account, the variational equations (1.2.37) reduce to
since u = o on To= r - r,. To sum up, we have formally solved the following associated boundary value problem :
I
- p Au - (A u =O
on
+ p ) grad div u = f
ro,
in
0, (1.2.40)
26
ELLIPTIC BOUNDARY V A L U E PROBLEMS
ICh. I , B 1.2.
which is known as the system of equations of linear elasticity. Let us mention that a completely analogous analysis holds in two dimensions, in which case the resulting problem is called the system of equations of two-dimensional, or plane, elasticity, the above one being also called by contrast the system of three-dimensional elasticity. Accordingly, the variational problem associated with the data (1.2.30), (1.2.33) and (1.2.34) is called the (three- o r two-dimensional) elasticity problem.
Fig. 1.2.3
Assuming “small” displacements and “small” strains, this system describes the state of a body (Fig. 1.2.3) which occupies the set d in the absence of forces, u denoting the displacement of the points of d under the influence of given forces (as usual, the scale for the displacements is distorted in the figure). The body d cannot move along r,,,and along r,,surface forces of density g are given. In addition, a volumic force, of density f, is prescribed inside the body 6. Then we recognize in ( e i j ( u ) ) the strain tensor while (uii(u)) is the stress tensor, the relationship between the two being given by the linear equations (1.2.32) known in Elasticity as Hooke’s law for isotropic bodies. The constants A and p are the Lamt coeficients of the material of which the body is composed.
Ch. 1, 5 1.2.1
EXAMPLES
21
The variational equations (1.2.37) represent the principle of virtual work, valid for all kinematically admissible displacements u, i.e., which satisfy the boundary condition u = 0 on To. The functional J of (1.2.36) is the total potential energy of the body. It is the sum of the strain energy:
and of the potential energy of the exterior forces: - ( J n f * u dx + * 0 dr). This example is probably the most crucial one, not only because it has obviously many applications, but essentially because its variational formulation, described here, is basically responsible f o r the invention of the finite element method by engineers.
Ir, g
Remark 1.2.2. It is interesting to notice that the strict positiveness of the dy-measure of r, has a physical interpretation: It is intuitively clear that in case the dy-measure rowould vanish, the body would be free and therefore there could not exist an equilibrium position in general. 0 Remark 1.2.3. The membrane problem, which we have already described, the plate problem, which we shall soon describe in this section, and the shell problem (Section 8.1), are derived from the elasticity problem, through a process which can be briefly described as follows: Because such bodies have a “small” thickness, simplifying a priori assumptions can be made (such as linear variations of the stresses over the thickness) which, together with other assumptions (on the constitutive material in the case of membranes, or on the orthogonality of the exterior forces in the case of membranes and plates), allow one to integrate the energy (1.2.36) over the thickness. In this fashion, the problem is reduced to a problem in two variables, and only one function (the “vertical” displacement) in case of membranes and plates. All this is at the expense of a greater mathematical complexity in case of plates and shells however, as we shall see. 0 Remark 1.2.4. Since problem (1.2.40) is called system of linear elasticity, the linearity being of course that of the mapping (1. g)+ u, it is worth saying how this problem might become nonlinear. This may happen in three nonexclusive ways:
28
ELLIPTIC BOUNDARY VALUE PROBLEMS
[Ch. 1 ,
§ 1.2.
(i) Instead of minimizing the energy over the space V, we minimize it over a subset U which is not a subspace. This circumstance, which we already commented upon (Remark 1.1.1) is examined in Exercise 1.2.5 for a simpler model. Another example is treated in Section 5.1. (ii) Instead of considering the ‘‘linearized’’ strain tensor (1.2.31), the “full” tensor is considered, i.e., we let 1 eii(v)= -(aiui 2
3
+ aiui + k=l C aivkaivk),
1 =z i, j c 3.
Actually, it suffices that for at least one pair ( i t j ) , the above expression be considered. This is the case for instance of the uon Karmann’s model of a clamped plate. (iii) The linear relation (1.2.32) between the strain tensor and the stress tensor is replaced by a nonlinear relation. 0
Examples of fourth-order problems: The biharmonic problem, the plate problem Whereas in the preceding examples the spaces V were contained in the space H ’ ( O ) , we consider in the last examples Sobolev spaces which involve second-order derivatives. We begin with the following data:
I I
v = u = Hi(O), ,-
(1.2.41)
Au Au dx,
a(u, u ) = In
Since the mapping u + l A ~ ( is ~ .a ~norm over the space Hi(O), as we showed in (1.2.81, the bilinear form is H:(O)-elliptic. Thus there exists a unique function u E H&O) which minimizes the functional 1
IAv 1’
J : u +J ( v ) = 2
dx -
f v dx
(1.2.42)
over the space H i ( 0 ) or, equivalently, which satisfies the variational equations Vv E H&O),
In
Au Au dx = I n f v dx.
(1.2.43)
Ch. 1, 8 1.2.1
EXAMPLES
29
Using Green’s formula (1.2.7): ~ o A u A u d x = ~ o A ’ ~u d x - ~ ~ ~ ~ A u u d y + ~dy, ~ A u d , u we find that we have formally solved the following homogeneous Dirichlet problem f o r the biharmonic operator A’: A z u = f in R, u = a,u = 0 on
(1.2.44)
r.
We shall indicate a physical origin of this problem in the section “Additional Bibliography and Comments” of Chapter 4. As our last example, we let, for n = 2,
v = u = H;(n), a(u, u ) =
I,
{Au A u
+ (1 - u ) ( 2 ~ 1 2 u ~-l zdllua22u u
-az@iiv))
dx
(1.2.45)
{UAU A V + (1 - u ) ( ~ I I u ~ I+ I u&ZU&~V +2aizuaizU))dx,
These data correspond to the variational formulation of the (clamped) plate problem, which concerns the equilibrium position of a plate of constant thickness e under the action of a transverse force, of density F = (Ee3/12(l- u2))fper unit area. The constants E = p(3A + 2 p ) / ( A + p ) and u = A/2(A + p ) are respectively the Young’s modulus and the Poisson’s coefficient of the plate, A and p being the LamC’s coefficients of the plate material. When f = 0 , the plate is in the plane of coordinates ( X Ix, d (Fig. 1.2.4). The condition u E H i ( R ) takes into account the fact that the plate is clamped (see the boundary conditions in (1.2.48) below). As we pointed out in Remark 1.2.3, the expressions given in (1.2.45) for the bilinear form and the linear form are obtained upon integration over the thickness of the plate of the analogous quantities for the elasticity problem. This integration results in a simpler problem, in that there are now only two independent variables. However, this advantage is compensated by the fact that second partial derivatives are now present
30
ELLIPTIC BOUNDARY VALUE PROBLEMS
[Ch. 1, 5 1.2.
Fig. 1.2.4
in the bilinear form. This will result in a fourth-order partial differential equation. See (1.2.48). The Poisson’s coefficient u satisfying the inequalities 0 < u < i, the bilinear form is H:(fl)-elliptic, since we have V u EH2(fl), a ( v , u ) = uIAu(i.n+(l - U ) I U I : . ~ .
Thus, there exists a unique function u E H:(fl) which minimizes the total potential energy of the plate: J ( ~ ) = -1~ ~ { l A v J ’ + 2- ~( 1) ( ( a ~ 2 u ) ~~- l l u ~ ~ 2 u ) } d x -dx, ~nfu 2 (1.2.46) over the space H;(fl) or, equivalently, which is solution of the variational equations {Au A V + ( 1 - ~ ) ( 2 d l 2 ~ 8 1 2~ ~I
=In
-C32zudllv)}dx
Using Green’s formulas (1.2.7) and (1.2.9):
f u dx.
I u ~ ~ Z U
(1.2.47)
Ch. 1, § 1.2.1
EXAMPLES
31
we find that we have again solved, at least formally, the homogeneous Dirichlet problem for the biharmonic operator A':
A 2 u = f in 0, u = a,u = 0 on I'.
(1.2.48)
Therefore, in spite of a different bilinear form, we eventually find the same problem as in the previous example. This is so because, in view of the second Green's formula which we used, the contribution of the integral (1
-
a ) { 2 d l ~ u a l-~ vd l , u d z z v- d z z u a l l v dx }
is zero when the functions v are in the space 9 ( R ) , and consequently in its closure H , ? ( 0 ) .Thus, the partial differential equation is still A 2 u = f in R. However different boundary conditions might result from another choice for the space V . See Exercise 1.2.7. To distinguish the two problems, we shall refer to a fourth-order problem corresponding to the functional of (1.2.42) as a biharmonic problem, while we shall refer to a fourth-order problem corresponding to the functional of (1.2.46) as a plate problem. In this section, we have examined various minimization or variational problems with each of which is associated a boundary value problem for which the partial differential operator is elliptic (incidentally, this correspondence is not one-to-one, as the last two examples show). This is why, by extension, these minimization or variational problems are themselves called elliptic boundary value problems. For the same reasons, such problems are said to be second-order problems, or fourthorder problems, when the associated partial differential equation is of order two or four, respectively. Finally, one should recall that even though the association between the two formulations may be formal, it is possible to prove, under appropriate smoothness assumptions on the data, that a solution of any of the variational problems considered here is also a solution in the classical sense of the associated boundary value problem.
Remark 1.2.5.
In this book, one could conceivably omit all reference to the associated classical boundary value problems, inasmuch as the finite element method is based only on the variational formulations. By
32
ELLIPTIC BOUNDARY VALUE PROBLEMS
[Ch. 1, 0 1.2.
contrast, finite difference methods are most often derived from the 0 classical formulations. Exercises 1.2.1. Prove Green's formula (1.2.9). The reader should keep in mind that the derivative a,u generally differs from the second derivative of the function u, considered as a function of the curvilinear abcissa along the boundary.) 1.2.2. Let the space V = U and the bilinear form be as in (1.2.10), and let the linear form be defined by
where the functions f and a satisfy assumptions (1.2.11) and uo is a given function in the space H ' ( 0 ) .Show that these data correspond to the formal solution of the nonhomogeneous Din'chlet problem for the operator u + - Au + au, i.e.,
-Au+au=f in 0, u = uo on I'. .Fdx
/ Fig. 1.2.5
Ch. 1, 8 1.2.1
33
EXAMPLES
Is it equivalent to minimizing the functional (1.2.12) over the subset
u = { u E H W ) ; ( u - uo) E Hd(R)} of the space V = H'(R)? With a = O and n = 2, this is another membrane problem. See Fig. 1.2.5, which is self-explanatory. 1.2.3. Find a variational problem which amounts to solving the nonhomogeneous Neumann problem for the operator -A, i.e., problem (1.2.22) when the function a vanishes identically, and when the equality J n f d x + J r g d y = O holds. [Hint: Use the fact that over the quotient space H ' ( R ) / P o ( R ) Po(R): , space of constant functions over R, the semi-norm I*II,n is a norm, equivalent to the quotient norm. See Theorem 3.1.1 for a proof.] 1.2.4. Let R be a connected open subset of R",with n = 2 or 3, and let r o b e a dy-measurable subset of its boundary r,assumed to be Lipschitzcontinuous. Let
v = {u
= ( u i ) E ( H ' ( R ) ) " ; ui =
o
on
ro, 1s i s n }
(i) Show that V is a closed subspace of the space ( H ' ( 0 ) ) " . (ii) Show that the mapping
is a norm over the space V, if the dy-measure of rois strictly positive. [Hint: Show that a function u E (H'(R))"which satisfies (ul = 0 is of the form u ( x ) = a x x + b for some constant vectors a and b, i.e., the displacement u is a rigid body motion. Such a result is proved for example in HLAVACEK& NECAS (1970, Lemma 11.1). See also Section 8.1 for analogous ideas.] (iii) Using Korn's inequality (1.2.35), show that the norm (-1 is equivalent to the norm Il.lll,n. [Hint: Argue as in Theorem 1.2.1.1 1.2.5. Let
v = H1(R),
a(u, u ) =
I {f:
0 i=l
diudiv
+ auu} dx,
f (U ) =
I,fu dx,
and let
U = { u EH'(R); u L O a.e. on r}. Show that U is a closed convex cone with vertex 0. Using charac-
34
[Ch. I , 5 1.2.
ELLIPTIC BOUNDARY V A L U E PROBLEMS
terizations ( 1 . I . 5 ) of Theorem 1.1.2 show that the associated variational problem amounts to formally solving the boundary value problem -Au+au=f
uso,
a,u
in
so,
R, ua,u
=0
on
r.
This type of nonlinear problem is a model problem for Signorini problems, i.e., problems in elasticity for which the boundary conditions are unilateral constraints such as the above ones. For extensive discussions of such problems, see DUVAUT & LIONS (l972), FICHERA (1972). 1.2.6. Extend the analysis made for the data (1.2.23) to the case where the bilinear form is given by
the functions ai being in the space L"(R).In particular, find sufficient conditions for the V-ellipticity of the bilinear form. 1.2.7. Let the bilinear form and the linear form be as in (1.2.45),and let
v = u = ~ ' (nH:,(n) 0) ={V
E ~'(0) u =;o
on
r}.
This is a mathematical model for a simply supported plate. Using the fact that u + ~ A U ( ~is, O again a norm over the space V, equivalent to the norm ~ ~ * ~ analyze ~ 2 , ~ , the associated variational problem. What is the associated boundary value problem? 1.2.8. Let
I
a(u,u ) =
[ f ( ~= )
10
Au A u dx,
f u dx - I r A d z , u dy, f E L'(R), A E L'(r).
Using as in Exercise 1.2.7 the fact that u + ( A U ( is ~ . a~ norm over the space V, equivalent to the norm ll*l12, R , analyze the associated variational problem. In particular, show that it can be decomposed into two second order problems. What is the associated boundary value problem? Does it share the same property?
Ch. I]
BIBLIOGRAPHY A N D COMMENTS
35
Bibliography and comments 1.1. The original reference of the Lax-Milgram lemma is LAX & MILGRAM(1954). Our proof follows the method of LIONS& STAMPACCHIA (1967), where it is applied to the general variational problem (1.1.15), and where the case of semi-positive definite bilinear forms is also considered. STAMPACCHIA (1964) had the original proof. For constructive existence proofs and additional references, see also GLOWINSKI, LIONS& TREMOLIERES (1976a). I. BABUSKA(BABUSKA& AZIZ(1972, Theorem 5.2.1)) has extended the Lax-Milgram lemma to the case of bilinear forms defined on a product of two distinct Hilbert spaces. This extension turns out to be a useful tool for the analysis of some finite element methods (BABUSKA(1971b)). 1.2. For treatments of Differential Calculus with FrCchet derivatives, the reader may consult CARTAN(1967), DIEUDONNE(1967), SCHWARTZ (1967). For the theory of distributions and its applications to partial differential equations, see SCHWARTZ (1966). Other references are (1968), VO-KHACKHOAN(1972a, 1972b). The TRBVES(1967), SHILOV Sobolev spaces are extensively studied in LIONS (1962) and N E ~ A S (1967). See also ADAMS(1975). The original reference is SOBOLEV (1950). Thorough treatments of the variational formulations of elliptic boundary value problems are given in LIONS(1962), AGMON(1965), N E ~ A S (1967), LIONS& MAGENES(1968), VO-KHACKHOAN(1972b). Shorter & AZIZ(1972), ODEN& accounts are given in AUBIN(1972), BABUSKA REDDY ( 1976a). More specialized treatments, particularly for nonlinear problems, are LADY~ENSKAJA & URALTEVA (1968), LIONS(1969), & TEMAM(1974). For regularity results, see GRISVARD (1976), EKELAND KONDRAT’EV(1967). For more classically oriented treatments, see for example BERS, JOHN & SCHECHTER (1964), COURANT & HILBERT(1953. 1962), MIRANDA (1970), STAKGOLD (1968). As an introduction to classical elasticity theory, notably for the elasticity problem, the clamped plate problem, the membrane & LIFSCHITZ (1967). For the variaproblem, see for example LANDAU tional formulations of problems in elasticity along the lines followed here, consult DUVAUT & LIONS(l972), FICHERA (1972), ODEN& REDDY (1976b).
CHAPTER
2
INTRODUCTION TO THE FINITE ELEMENT METHOD
Introduction The basic scope of this chapter is to introduce the finite element method and to give a thorough description of the use of this method for approximating the solutions of second-order or fourth-order problems posed in variational form over a space V . A well-known approach for approximating such problems is Galerkin's method, which consists in defining similar problems, called discrete problems, over finite-dimensional subspaces v h of the space V . Then the finite element method in its simplest form is a Galerkin's method characterized by three basic aspects in the construction of the space v h : First, a triangulation y h is established over the set d, i.e., the set d is written as a finite union of finite elements K E y h . Secondly, the function u h E v h are piecewise polynomials, in the sense that for each K E Y h , the spaces P K = { V h I R ; uh E v h } consist of polynomials. Thirdly, there should exist a basis in the space v h whose functions have small supports. These three basic aspects are discussed in Section 2.1, where we also give simple criteria which insure the validity of inclusions such as v h c H'(R), v h c H ~ ( L ? ) , etc. . . (Theorems 2.1.1 and 2.1.2). We also briefly indicate how the three basic aspects are still present in the more general finite element methods to be subsequently described. In this respect, we shall reserve the terminology conforming finite element method for the simplest such method (as described in this chapter). In Section 2.2, we describe various examples of finite elements, which are either n-simplices (simplicia1 finite elements) or n-rectangles (rectangular finite elements), in which either all degrees offreedom are point values (Lagrange finite elements) or some degrees of freedom are directional deriuatiues (Hermite finite elements), which yield either the inclusion X h c H ' ( R ) (finite elements of class go) or the inclusion 36
Ch. 2, 5 2.1.1
BASIC ASPECTS OF THE FINITE ELEMENT METHOD
37
x h C HZ(n)(finite elements of class %') when they are assembled in a finite element space x h . Then in Section 2.3, finite elements and finite element spaces are given general definitions, and we proceed to discuss their various properties. Of particular importance are the notion of an afine family of finite elements (where all the finite elements of the family can be obtained as images through affine mappings of a single reference finite element) and the notion of the PK-interpolation operator (a basic relationship between these two notions is proved in Theorem 2.3.1). The PK-interpolation operator and its global counterpart, the Xh-interpolation operator both play a fundamental role in the interpolation theory in Sobolev spaces that will be developed in the next chapter. We also show how to impose boundary conditions on functions in finite element spaces. We conclude Section 2.3 by briefly indicating some reasons for which a particular finite element should be preferred to another one in practical computations. In Section 2.4, we define the convergence and the order o f convergence for a family of discrete problems. In this respect, Ce'a's lemma (Theorem 2.4.1) is crucial: The error I I K - U h l l , i.e., the distance (measured in the norm of the space V ) between the solution K of the original problem and the solution uh of the discrete problem, is (up to a constant independent of the space v h ) bounded above by the distance inf u h E V h Ilu - tlhll between the function u and the subspace vh. Indeed, all subsequent convergence results will be variations on this theme !
2.1. Basic aspects of the finite element method
The Galerkin and Ritz methods Consider the linear abstract variational problem: Find
VV E v, a(K, V ) = f ( U ) ,
K
E V such that
(2.1.1)
where the space V , the bilinear form a ( . , .), and the linear form f are assumed to satisfy the assumptions of the Lax-Milgram lemma (Theorem 1.1.3). Then the Galerkin method for approximating the solution of such a problem consists in defining similar problems in finitedimensional subspaces of the space V . More specifically, with any finite-dimensional subspace vh of V , we associate the discrete problem :
38
INTRODUCTION TO THE FINITE ELEMENT METHOD
Find
Uh
[Ch. 2, 5 2.1.
E vh such that vvh
E
vh,
a(uh, v h ) = f ( V h ) .
(2.1.2)
Applying the Lax-Milgram lemma, we infer that such a problem has one and only one solution u h , which we shall call a discrete solution. Remark 2.1.1. In case the bilinear form is symmetric, the discrete solution is also characterized by the property (Theorem 1.1.2)
(2.1.3) where the functional J is given by J ( v ) = ta(v, v ) - f ( v ) . This alternate 0 definition of the discrete solution is known as the Ritz method.
The three basic aspects of the finite element method. Conforming finite elemen t met hods Let us henceforth assume that the abstract variational problem (2.1.1) corresponds to a second-order or to a fourth-order elliptic boundary value problem posed over an open subset R of R",with a Lipschitz-continuous boundary r. Typical examples of such problems have been studied in Section 1.2. In order to apply Galerkin method, we face, by definition, the problem of constructing finite-dimensional subspaces Vh of spaces V such as H ~ ( R H'(R), ), H;(O),etc.. . The finite element method, in its simplest form, is a specific process of constructing subspaces vh, which shall be called finite element spaces. This construction is characterized by three basic aspects, which for convenience shall be recorded as (FEM I ) , (FEM 2) and (FEM 3), respectively, and which shall be described in this section. (FEM I ) The first aspect, and certainly the most characteristic, is that a triangulation T h is established over the set 6, i.e., the set 6 is subdivided into a finite number of subsets K , called finite elements, in such a way that the following properties are satisfied:
d = U ~ c Ky. ~ (Th2) For each K E F,,,the set K is closed and the interior is non empty. (Yh3) For each distinct K I , K 2E Fh, one has Rl f l k2= 4. (Fh4) For each K E F,,, the boundary aK is Lipschitz-continuous. (yhhl)
Ch. 2, 5 2.1.1
BASIC ASPECTS O F THE FINITE ELEMENT METHOD
39
Remark 2.1.2. A fifth condition ( 9 h 5 ) relating “adjacent” finite elements, will be introduced in the next section. 0
Once such a triangulation 9 h is established over the set 6, one defines a finite element space x h through a specific process, which will be illustrated by many examples in the next section and subsequently. We shall simply retain for the moment that x h is a finite-dimensional space of functions defined over the set 6 (we shall deliberately ignore at this stage instances of finite element spaces whose “functions” may have two definitions across “adjacent” finite elements; see Section 2.3). Given a finite element space x h , we define the (finite-dimensional) spaces P K
= {UhlK;
vh
Ex
h }
spanned by the restrictions 1)hlK of the functions v h E x h to the finite elements K E y h . Without specific assumptions concerning the spaces P K , K E Y h , there is no reason for an inclusion such as x h C H ’ ( 0 )- let alone an inclusion such as x h c ~ ’ (-to 0 )hold. In order to obtain such inclusions, we need additional conditions of a particularly simple nature, as we show in the next theorems (converses of these results hold, as we shall show in Theorems 4.2.1 and 6.2.1). Remark 2.1.3. Here and subsequently, we shall comply with the use of the notation H ” ( K ) , in lieu of H ” ( R ) . 0 Theorem 2.1.1. Assume that the inclusions PK C H ’ ( K ) for all K E 9 and x h C %‘(6)hold. Then the inclusions x h
h
cH ’ ( o ) ,
x o h = { V h E X h ;
v h = o
on
r)cHd(n),
hold.
Proof. Let a function u E x h be given. We already know that it is in the space L’(0). Therefore, by definition of the space H ’ ( R ) ,we must find for each i = 1,. . . ,n, a function ui E L 2 ( 0 )such that
For each i, a natural candidate is the function whose restriction to
40
INTRODUCTION TO THE FINITE ELEMENT METHOD
[Ch. 2, 5 2.1.
each finite element K is the function d i ( u J K ) .Since each finite element K has a Lipschitz-continuous boundary dK, we may apply Green's formula (1.2.4): For each K E y h ,
where vLKis the i-th component of the unit outer normal vector along dK. By summing over all finite elements, we obtain
and the proof follows if we notice that the sum Z K ~ T , , . vIK4vi.i.K ~ ~ K dy vanishes: Either a portion of dK is a portion of the boundary r of R in which case 4 = 0 along this portion, or the contribution of adjacent elements is zero. The boundary r being Lipschitz-continuous by assumption, the second inclusion follows from the characterization
H ~ ( R ) = { u E H ' ( O ) ,V = O
on
which was mentioned in Section 1.2.
0, 0
Assuming Theorem 2.1.1 applies, we shall therefore use the finite element space v h = x,h if we are solving a second-order homogeneous Dirichlet problem, or v h = xh if we are solving a second-order homogeneous or nonhomogeneous Neumann problem. The proof of the next theorem is similar to that of Theorem 2.1.1 and, for this reason, is left to the reader as an exercise (Exercise 2.1.1). Theorem 2.1.2. and XI,C
Assume that the inclusions PK C H * ( K ) f o r all K E T,,
% ' ( dhold. ) Then the inclusions
Thus if we are to solve a simply supported plate problem, or a clamped plate problem, we shall use the finite element space vh = Xoh, or
Ch. 2 . 8 2.1.1
BASIC ASPECTS OF THE FINITE ELEMENT METHOD
41
the finite element space v h = Xooh, respectively, as given in the previous theorem. Let us return to the description of the finite element method. (FEM 2) The second basic aspect of the finite element method is that the spaces PK,K E Y h , contain polynomials, or, at least, contain f u n c tions which are “close to” polynomials. At this stage, we cannot be too specific about the underlying reasons for this aspect of the method but at least, we can say that (i) it is the key to all convergence results as we shall see, and (ii) it yields simple computations of the coefficients of the resulting linear system (see (2.1.4) below). Let us now briefly examine how the discrete problem (2.1.2) is solved in practice. Let ( w k ) E l be a basis in the space V,,. Then the solution uh = ZEI U k W k of problem (2.1.2) is such that the coeficients uk are solutions of the linear system
(2.1.4)
whose matrix is always invertible, since the bilinear form, being assumed to be V-elliptic, is a fortiori Vh-elliptic. By reference to the elasticity problem, the matrix ( a ( w k ,w,)) and the vector (f(w1))are often called the stiffness matrix and the load vector, respectively. In the choice of the basis (wk.F-1, it is of paramount importance, f r o m a numerical standpoint, that the resulting matrix possess as many zeros as possible. For all the examples which were considered in Section 1.2 the coefficients a ( w k ,w,) are integrals of a specific form: For instance, in the case of the first examples, one has a(wk,w,) =
I (i R
[=I
aiwkdiwI+ awkwl
so that a coefficient a ( w k ,w I ) vanishes whenever the dx-measure of the intersection of the supports of the basis functions Wk and w1 is zero. (FEM 3) As a consequence, we shall consider as the third basic aspect of the finite element method that there exists at least one “canonical” basis in the space vh whose corresponding basis functions have supports which are as “small” as possible, it being implicitly understood that these basis functions can be easily described.
42
INTRODUCTION TO T H E FINITE ELEMENT METHOD
[Ch. 2. 5 2.1.
Remark 2.1.4. When the bilinear form is symmetric, the matrix ( a ( w k ,w , ) ) is symmetric and positive definite, which is an advantage for the numerical solution of the linear system (2.1.4). By contrast, this is not generally the case for standard finite-difference methods, except for rectangular domains. Assuming again the symmetry of the bilinear form, one could conceivably start out with any given basis, and, using the Gram-Schmidt orthonormalization procedure, construct a new basis (w,*),”=,which is orthonormal with respect to the inner product a ( . , -). This is indeed an efficient way of getting a sparse matrix since the corresponding matrix ( a ( w f ,w ? ) ) is the identity matrix! However, this process is not recommended from a practical standpoint: For comparable computing times, it yields worse results than the solution by standard methods of the linear system corresponding to the “canonical” basis. 0 It was mentioned earlier that the three basic aspects were characteristic of the finite element method in its simplest f o r m . Indeed, there are more general finite element methods:
(i) One may start out with more general oariational problems, such as variational inequalities (see Section 5.1) or various nonlinear problems (see Sections 5.2 and 5.3), or different variational formulations (see Chapter 7). (ii) The space Vhr in which one looks for the discrete solution, may no longer be a subspace of the space V. This may happen when the boundary of the set R is curved, for instance. Then it cannot be exactly triangulated in general by standard finite elements and thus it is replaced by an approximate set R,, (see Section 4.4). This also happens when the functions in the space Vh lack the proper continuity across adjacent finite elements (see the “nonconforming” methods described in Section 4.2 and Section 6.2). (iii) Finally, the bilinear form and the linear form may be approximated. This is the case for instance when numerical integration is used for computing the coefficients of the linear system (2.1.4) (see Section 4.1), or for the shell problem (see Section 8.2). Nevertheless, it is characteristic of all these more general finite element methods that the three basic aspects are again present. To conclude these general considerations, we shall reserve the terminology conforming finite element methods for the finite element
Ch. 2, 52.2.1
FINITE ELEMENTS AND FINITE ELEMENT SPACES
43
methods described at the beginning of this section, i.e., for which Vh is a subspace of the space V, and the bilinear form and the linear form of the discrete problem are identical to the original ones. Exercises Prove Theorem 2.1.2. The purpose of this problem is to give another proof of the Lax-Milgram lemma (Theorem 1.1.3; see also Exercise 1.1.2) in case the Hilbert space V is separable. Otherwise the bilinear form and the linear form satisfy the same assumptions as in Theorem 1.1.3. (i) Let Vh be any finite-dimensional subspace of the space V, and let uh be the discrete solution of the associated discrete problem (2.1.2). Show that there exists a constant C independent of the subspace Vh such that I(uhlld C (as usual, there is a simpler proof when the bilinear form is symmetric). (ii) The space V being separable, there exists a nested sequence ( V”)”€N of finite-dimensional subspaces such that Vv)-= V. Let ( U ~ ) ” € Nbe the sequence of associated discrete solutions. Show that there exists a subsequence of the sequence ( u ” ) ” , =which ~ weakly converges to a solution u of the original variational problem. (iii) Show that the whole sequence converges in the norm of V to the solution u. (iv) Show that the Sobolev spaces H ” ( R ) are separable. 2.1.1. 21.2.
(u
2.2. Examples of finite elements and finite element spaces
Requirements f o r finite element spaces Throughout this section, we assume that we are using a conforming finite element method for solving a second-order or a fourth-order boundary value problem. Let us first summarize the various requirements that a finite element space X h must satisfy, according to the discussion made in the previous section. Such a space is associated with a triangulation TI, of a set d = KE9,, K (FEM I), and for each finite element K E T h , we define the space
u
P K
= {UhlK;
uh
E
xh}.
Then the requirements are the following:
(2.2.1)
44
INTRODUCTION TO THE FINITE ELEMENT METHOD
[Ch. 2 . 8 2.2.
(i) For each K € y h , the space PK should consist of functions which are polynomials or "nearly polynomials" (FEM 2). (ii) By Theorems 2.1.1 and 2.1.2, inclusions such as x h C %'(d) or x h C %'(d) should hold, depending upon whether we are solving a second-order or a fourth-order problem. For the time being, we shall ignore boundary conditions, which we shall take into account in the next section only. (iii) Finally, we must check that there exists one canonical basis in the space X h , whose functions have "small" supports and are easy to describe (FEM 3). In this section, we shall describe various finite elements K which are all polyedra in R",and which are sometimes called straight finite elements. As a consequence, we have to restrict ourselves to problems which are posed over sets d which are themselves polyedra, in which case we shall say that the set 0 is polygonal.
First examples of finite elements f o r second order problems: n-Simplices of type ( k ) , (3') We begin by examining examples f o r which the inclusion x h C %'(d) holds, and which are the most commonly used by engineers for solving second-order problems with conforming finite element methods. Inasmuch as such problems are most often found in mechanics of continua, it is clear that the value to be assigned in practice to the dimension n in the forthcoming examples is either 2 or 3 (see the examples given in Section 1.2). We equip the space R" with its canonical basis (ej)yZl. For each integer k 2 0, we shall denote by Pk the space of all polynomials of degree S k in the variables xI, x2,. . . ,x,, i.e., a polynomial p E Pk is of the form p : x = (xi, ~
. . . , x,)
2 ,
E R"+ P ( X )
for appropriate coefficients y a l a 2 . a. n , or using the multi-index notation,
The dimension of the space Pk is given by dim Pk
=
(n + k ).
(2.2.2)
Ch. 2 , § 2.2.1
FINITE ELEMENTS AND FINITE ELEMENT SPACES
45
If @ is a space of functions defined over R", and if A is any subset of R", we shall denote by @ ( A )the space formed by the restrictions to the set A of the functions in the space @. Thus, for instance, we shall let pk(A) = { p IA;
P E pk).
(2.2.3)
Notice that the dimension of the space Pk(A) is the same as that of the space p k = Pk(R") as long as the interior of the set A is not empty. In R", a (nondegenerate) n-simplex is the convex hull K of (n + 1) points aj = (aii)y=lE R", which are called the vertices of the n-simplex, and which are such that the matrix
(2.2.4)
is regular (equivalently, the ( n + 1) points uj are not contained in a hyperplane). Thus, one has
(2.2.5) Notice that a 2-simplex is a triangle and that a 3-simplex is a tetrahedron. For any integer m with 0 6 m d n, an m-face of the n-simplex K is any m-simplex whose (m + 1) vertices are also vertices of K. In particular, any ( n - 1)-face is simply called a face, any 1-face is called an edge, or a side. The barycentric coordinates Aj = A j ( x ) , 1 d j d n + 1, of any point x E R", with respect to the ( n + 1) points aj,are the (unique) solutions of the linear system
1%
(2.2.6) Aj
= 1,
j= I
whose matrix is precisely the matrix A of (2.2.4). By inspection of the linear system (2.2.6), one sees that the barycentric coordinates are afine
46
FINITE ELEMENTS A N D FINITE ELEMENT SPACES
functions o f
X I , x2,.
Ai =
[Ch. 2, 5 2.2.
. . , x, (i.e., they belong to the space PI):
2
J=I
+ bin+l,
1 s i zz n
+ 1,
(2.2.7)
where the matrix B = (b,) is the inverse of the matrix A. The barycenter, or center o f gravity, of an n-simplex K is the point of K whose all barycentric coordinates are equal to l / ( n + 1). To describe the first finite element, we need to prove that a polynomial p : x + E,rr141 yaxa of degree 1 is uniquely determined by its values at the ( n + 1) vertices ai of any n-simplex in R".T o see this, it suffices to show that the linear system
131ya(ai)"
= pi, 1 ~j
G II
+ 1,
has one and only one solution (yo,la1 C 1 ) f o r all right-hand sides pi, 1 C j C n + 1 . Since dim P = card { a j } )= n + 1, the matrix of this linear system is square, and therefore it suffices to prove either uniqueness or existence. In this case, the existence is clear: The barycentric coordinates verify Ai(ai)= aii, 1 4 i, j S n + 1 , and thus the polynomial
(uyz:
has the desired property. As a consequence, we have the identity n+l
V P E PI,P
=
2 P(ai)Ai.
(2.2.8)
r=l
Although we shall not repeat this argument in the sequel, it will be often implicitly used. A polynomial p E PI being completely determined by its values p ( a i ) , 1 S i G n + 1 , we can now define the simplest finite element, which we shall call n-simplex o f type ( 1 ) : The set K is an n-simplex with vertices ai, 1 6 i C n + 1, the space PK is the space P l ( K ) , and the degrees o f freedom of the finite element, i.e., those parameters which uniquely define a function in the space PK. consist of the values at the vertices. Denoting by .ZK the corresponding set of degrees o f freedom, we shall write symbolically
ZK = { p ( u l ) , 1 s i s n + 1 ) .
Ch. 2 . 5 2.2.1
FINITE ELEMENTS AND FINITE ELEMENT SPACES
47
In Fig. 2.2.1, we have recorded the main characteristics of this finite element for arbitrary n, along with the figures in the special cases n = 2 and 3. In case n = 2, this element is also known as Courant’s triangle (see the section “Bibliography and Comments”).
Courant‘s triangle. or triangle of type ( I )
tetrahedron of type ( 1 )
dim PK = 3
I
n-simplex of type ( I ) PK
2,
=
P , ( K ) ; dim PK = ( n + 1):
= { p ( a i ) , 1 s is n
+ I}.
Fig. 2.2.1
Let us call aij = ;(ai + ai), 1 s i < j s n + 1, the mid-points of the edges of the n-simplex K . Since Ak(aij>= t ( & i + & j ) , 1 s i < j s n + 1, 1 s k s n + 1, we obtain the identity (where, here and subsequently, indices i ,j , k , . . . , are always assumed to take all possible values in the set {1,2,. . . , n} whenever this fact is not specified) Ai(2Ai - l)p(ai) + 2 4AiAj~(aij),
V P E P z ~P = 1
(2.2.9)
i<j
which yields the definition of a finite element, called the n-simplex of type (2): the space PK is P z ( K ) ,and the set ZKconsists of the values at the vertices and at the mid-points of the edges (Fig. 2.2.2).
48
INTRODUCTION TO THE FINITE ELEMENT METHOD
triangle of type (2) dim PK = 6
[Ch. 2 , s 2.2.
tetrahedron of type (2) dim PK = 10
n-simplex of type (2)
( n + 1" PK = P , ( K ) ; dim PK = S K = {p(ai),
1G i 6n
+ I;
+ 2).
p(aii), I s i < j s n + i}.
Let aiii= f(2ai+ a i ) for i# j , and aiik= ;(ai + ai + a k )for i < j < k. From the identity
(2.2.10) we deduce the definition of the n-simplex of type ( 3 ) (Fig. 2.2.3). One may define analogous finite elements with polynomials of arbitrary degree, but they are not often used. In this respect, we leave to the reader the proof of the following theorem (Exercise 2.2.2), from which for any integer k, the definition of the n-simplex of type ( k ) can be easily derived.
Ch. 2 . 5 2.2.1
triangle of type ( 3 ) dim PK = 10
I
1
tetrahedron of type (3)
dim PK = 20
n-simplex
P,=b(aj),
49
FINITE ELEMENTS AND FINITE ELEMENT SPACES
of
type (3)
I
I s i ~ n + l ;p ( a i j i ) , l s i , j ~ n + l , i # j ; < j < k s n + 1).
p(ajik), 1 s i
Fig. 2.2.3
Theorem 2.2.1. Let K be an n-simplex with vertices aj, 1 j S n + 1 . Then for a given integer k 3 1 , any polynomial p E Pk is uniquely determined by its values on the set
Let us now examine a modification of the n-simplex of type (3), in ) no longer present, and which is which the degrees of freedom p ( a i j k are often preferred by the engineers to the previous element. To describe the corresponding finite element, we need the following result.
50
INTRODUCTION TO THE FINITE ELEMENT METHOD
Theorem 2.2.2.
[Ch. 2 , 8 2.2.
For each triple (i,j , k ) with i < j < k , let I i#m
Then any polynomial in the space
Pi = { p E P 3 ; &k(p)
1 a i <j
= 0,
< k a n + I}
is uniquely determined by its values at the vertices ai, 1 d i d n the points aiij,1 d i, j d n + 1 , i f j . In addition, the inclusion
(2.2.13)
+ 1, and at
P2C P;
(2.2.14)
holds. Proof. The ("f')degrees of freedom '$ijk are linearly independent (since ' $ i j k ( p ) = 12p(aijk)+ . . .) and thus, the dimension of the space Pi is dim Pi = dim P3-
(" ' )
=(n
+ 112,
i.e., precisely the number of degrees of freedom. Using the identity (2.2.10), and arguing as before, we obtain the identity
- 1)
+ T27A i A j k#i,j C, Ak)p(aiij), (2.2.15)
which proves the first part of the theorem. To prove that the inclusion (2.2.14) holds, let p be a polynomial of degree a 2 and let A E 2$(R"; R) be its second derivative (which is constant). From the expansions p ( a l ) = p(aijk)
valid for any triple Z
Dp(aijk)(ai - aijk) + iA(al - aijk)*, 1 E 1,
= {i,j ,
k } with i < j < k, we deduce
Ch.2, 5 2.2.1
FINITE ELEMENTS AND FINITE ELEMENT SPACES
51
l,mEI, IZm, we deduce
taking into account that a;jk = i(a;;j-k & k , ) Because A is a linear mapping, and because
= i(ajjk f G
k )
= f(akki i- aiii).
and the proof is complete.
a
From Theorem 2.2.2 we deduce the definition of the n-simplex o f type (3‘) (Fig. 2.2.4).
Assembly in triangulations. The associated finite element spaces Next we examine the question of constructing triangulations, using anyone of the finite elements previously described. Being non degenerate n-simplices, these have non empty interiors and Lipschitzcontinuous boundaries, and therefore properties (Yh2) and (9h4) are satisfied. To construct triangulations in the sense understood in Section 2.2, we shall write d = KGFh K in such a way that the n-simplices have piecewise disjoint interiors (cf. properties (.Th1 ) and (Yh3)).In order to satisfy inclusions such as x h c ~ ‘ ( f i(and ) X , c %‘(ji) later on), we shall impose a fifth condition on a triangulation made up of n-simplices, namely: (Yh5) Any f a c e of any n-simplex K , in the triangulation is either a subset of the boundary r, or a face of another n-simplex Kz in the triangulation. In the second case, the n-simplices K , and K 2 are said to be adjacenr. An example of a triangulation for n = 2 is given in Fig. 2.2.5, while
u
52
INTRODUCTION TO THE FINITE ELEMENT METHOD
triangle of type (3')
tetrahedron of type (3')
n-simplex of type (3')
PK = P : ( K ) (cf. (2.2.13)); dim PK = ( n + I)*; ZK = { p ( a , ) ,1 s i s n + I , p(aiii), 1 s i , j 6 n + 1, i+ j } . . Fig. 2.2.4
Fig. 2.2.5
[Ch. 2 . 8 2.2.
Ch. 2 , § 2.2.1
FINITE ELEMENTS AND FINITE ELEMENT SPACES
53
Fig. 2.2.6.
Fig. 2.2.6 shows an example of a “forbidden situation” since the intersection of K , and K 2 is not an edge of K2. Given a triangulation T h , we associate in a natural way a finite element space x h of functions u h : 6 + R with each type of finite element: With n-simplices of type ( l ) , a function uh E x h (i) is such that each restriction V h ( K is in the space PK = P , ( K )for each K E y h , and (ii) is completely determined by its values at all the vertices of the triangulation. Likewise, with n-simplices of type (2), a function of x h (i) is in the space PK = P , ( K ) for each K E y h h rand (ii) is completely determined by its values at all the vertices and all the mid-points of the edges of the triangulation. Similar constructions hold for n-simplices of type (3) or (3‘). In all cases, a function v h in the space x h is seen to be determined by degrees of freedom which make up a set of the form s h
={Uh(b);
b EN h ) ,
(2.2.16)
where N h is a finite subset of 6.The set &,is the set of degrees of freedom of the finite element space x h . One should observe that if there i s n o ambiguity in the definition of the degrees of freedom across adjacent finite elements, it is precisely because we have satisfied requirement ( Y h 5 ) . This requirement also plays a crucial role in the proof of the following result.
54
INTRODUCTION TO THE FINITE ELEMENT METHOD
[Ch. 2.5 2.2.
Theorem 2.2.3. Let x h be the finite element space associated with n-simplices of type ( k ) for any integer k a1 or with n-simplices of type (3'). Then the inclusion x h
c %'(h) n H ' ( 0 )
holds.
Proof. We shall give the proof in case n = 2 and for triangles of type ( 2 ) , leaving the other cases as a problem (Exercise 2.2.3). Given a function uh in the space X,, consider the two functions UhlK, and uLlK2 along the common side K' = [bi,b j ] of two adjacent triangles K 1and KZ (Fig. 2.2.7). Let t denote an abscissa along the axis containing the segment K'. Considered as functions of t , the two functions V h l K , and UhlK2 are quadratic polynomials along K', whose values coincide at the three points bi, bj, bij = (bi+ b j ) / 2 . Therefore these polynomials are identical, and the inclusion x h C Ceo(d)holds. Finally the inclusion x h c H'(R) is a consequence of Theorem 2.1.1. 0 It remains to verify requirement (FEM 3 ) , i.e., that there is indeed a canonical choice for basis functions with small supports. In each case,
it,
Fig. 2.2.7
Ch. 2. Fi 2.2.1
FINITE ELEMENTS AND FINITE ELEMENT SPACES
55
the set 2,, of degrees of freedom of the space is of the form s h
If we define functions Wk
1S k S M}.
= {(bk);
E
xh
Wk,
and
1 6k
S
(2.2.17)
M, by the conditions
W k ( b r ) = &I,
1 6 k,l s M ,
(2.2.18)
it is seen that (i) such functions form a basis of the space X,, and that (ii) they have "small" supports. In Fig. 2.2.8, we have represented the three types of supports which are encountered when triangles of type (3) are employed, for instance. n-Rectangles of type ( k ) . Rectangles of type (29, (3'). Assembly in triangulations
Before we turn to a second category of finite elements, we need a few definitions. For each integer k 3 0, we shall denote by Q k the space of all polynomials which are of degree s k with respect to each one of the n variables xI,x2,. . . , x,, i.e., a polynomial p E Qk is of the form p : x = ( X I , ~ 2 , ... ,x , ) €
R"+ P ( x )
h J P(4) Fig. 2.2.8
56
[Ch. 2 . 8 2.2.
INTRODUCTION TO THE FINITE ELEMENT METHOD
for appropriate coefficients y a l a 2 . . The dimension of the space Qk is given by .(In.
dim
Q k
= (k
+ 1)"
(2.2.19)
and the inclusions p k
c Qk c p n k
(2.2.20)
hold. Notice that the dimension of the space Qk(A) is the same as that of the space Q k = @(itn) as long as the interior of the set A C R" is not empty.
Theorem 2.2.4. A polynomial p E Qk is uniquely determined by its values on the set
, . . . , ;)€R'';
&=(x=(i,;
i i E { O , l, . . . , k } , l c j s n
I.
(2.2.21) Proof. It suffices to use the identity
In R", an n-rectangle, or simply a rectangle if n form
= 2,
is a set of the
n
K
[a;,bi] = {x
= r=l
= (xI,x2,. . . ,x n ) ;
ai zs xi c bi, 1
d
i d n}, (2.2.23)
with - m < ai < b i < + m for each i, i.e., it is a product of compact intervals with non-empty interiors. A f a c e of K is any one of the sets
i#i
i#i
while an edge of K, also called a side, is any one of the sets
n n
[aj, bjI x
i=I
i#i
{ci}.
Ch. 2 . 8 2.2.1
FINITE ELEMENTS AND FINITE ELEMENT SPACES
51
with ci = ai or bi, 1 G i d n, i# j , 1 s j d n. A vertex of K is any point x = (x,, XP,. . . ,x,) of K with xi = aior bi, 1 s i =sn. Observe that the set M k of (2.2.21) is a subset of a particular n-rectangle, namely the unit hypercube [0, 13". Then, given any nrectangle K, we infer that a polynomial p E Qk is uniquely determined by its values on the subset
Mk(K)= F K ( M ~ )
(2.2.24)
of the n-rectangle K , where FK is a diagonal afine mapping, i.e., of the form F K :x E R"+ F K ( x )= BKx + bK, with bK a vector in R" and BK an n x n diagonal matrix, such that K = FK([O,13"). From this, we deduce the definition of finite elements, called n-rectangles of type ( k ) . Just as in the case of n-simplices, the values k = 1 , 2 or 3 are the most commonly encountered. In Fig. 2.2.9, 2.2.10 and 2.2.1 1 , the corresponding elements are represented for n = 2 and 3, and the numbering of the points occurring in the sets of degrees of freedom is also indicated for n = 2. a 4,
,=3
rectangle of type ( I )
3-rectangle of type ( 1 ) =8
dim P ,
n-rectangle of type ( 1 )
P,
H,
=
Q , ( K ) : dim PK = 2":
={p(a);
LI
E M , ( K ) }(cf. (2.2.24))
Fig. 2.2.9
58
INTRODUCTION TO THE FINITE ELEMENT METHOD
I
[Ch. 2,
2.2.
/
r
el
{
%rectangle of type (2) dim PK = 21
rectangle of type (2) dim P , = 9
n-rectangle of type
(2)
P, = Q 2 ( K ) ; dim PK = 3 " ; a E M , ( K ) } (cf. (2.2.24)).
P, = { p ( a ) .
-
For the numbering of the nodes when n = 2, we have ..Alowed t..is rule: Assuming, without loss of generality, that the set K is the unit square [ O , 112, four points are consecutively numbered if they are the vertices of a square centered at the point (i.4). This rule allows for particularly simple expressions of the corresponding functions p; appearing in identities of the form VP E
P =
Qkr
P(ai)Pi9 I
which are special cases (for k = 1 ,2 ,3 and n = 2) of the identity (2.2.22). Notice that the coordinates of a given point with respect to the four vertices ai, 1 d i d 4, of the unit square are ( X I , XZ),
(x2, 1 - X I ) ,
(1 - XI. 1 - XZ),
(1 - x2, XI),
respectively. Then, if we introduce the variables x3
= 1 -XI,
xq
= 1 - x2,
(2.2.25)
Ch. 2 , 8 2.2.1
FINITE ELEMENTS AND FINITE ELEMENT SPACES
rectangle of type ( 3 )
I
59
3-rectangle of type ( 3 ) dim PK = 64
I
n-rectangle of type (3)
PK = Q , ( K ) ; dim PK = 4": a E M 3 ( K ) } (cf. (2.2.24)).
f K ={p(a);
Fig. 2.2. I 1
the four functions pi are obtained through circular permutations of the variables xI, x2, x3,x4 (such permutations correspond to rotations of + 7r/2 around the point (i, i)). Corresponding to the unit square of type (1) (recall that K = [ O , I]'), we have the identity
with Pl=(I-xl)(l-x?). P4 = ( 1 - X h ' .
pz=x,(l-x?),
p3=xlx?,
We may thus condense these expressions in PI = x3x4,.
...
(2.2.26)
Likewise, corresponding to the unit square of type (2). we have the
60
[Ch. 2 . 8 2.2.
INTRODUCTION TO THE FINITE ELEMENT METHOD
(2.2.27)
using the above rule. Finally, corresponding to the unit square of type (3), we have 1
Pl=qX3(3X3-
9
ps=-qX3(3X3-
1)(3X3-2)Xq(3Xql)(X3-
9
p9=-X3(3X3-2)(X34 81
p13=qX3(3X3-
1)(X3-
1)(3Xq-2),.
1)Xq(3Xq- 1)(3Xq-2), 1)Xq(3Xq- 1)(3Xq-2), 1)X4(3X4-
1)(Xq- I),
.. ...
I
(2.2.28)
... ....
Remark 2.2.1. The inconsistency for the notations a;, 5 4 i 4 9, between the rectangles of type (2) and (3), avoids the introduction of a new letter.
0 In analogy with the n-simplices of type (3’), one can derive two finite elements, in which the “internal” values of the rectangle of type (2) or (3) are no longer degrees of freedom (for simplicity, we shall restrict ourselves to the case n = 2). The existence of these finite elements is a consequence of the following two theorems.
Theorem 2.2.5. Let the points a;, 1 4 i 4 9, b e as in Fig.2.2.10. Then any polynomial in the space
is uniquely determined b y its values at the points a;, 1 s i s 8. In addition,
Ch. 2, P 2.2.1
61
FINITE ELEMENTS AND FINITE ELEMENT SPACES
the inclusion
P2C
QS
(2.2.30)
holds.
Proof. The first part of the proof is similar to the first part of the proof of Theorem 2.2.2. In particular, we have the identity
with (2.2.31)
To prove the inclusion (2.2.30), let p be a polynomial of degree 2, and let A denote its (constant) second derivative. From the expansions 1 p(ai) = p(a9) + Dp(a9)(ai- as)+-A(ai - ad2, 1 d i d 8, 2
we deduce
since
Because the mapping A is bilinear, and because as= ( a , + a2)/2,. . . ,we obtain
Combining the previous relations, we deduce that
and the proof is complete.
62
INTRODUCTION TO THE FINITE ELEMENT METHOD
Theorem 2.2.6. the space
[Ch. 2 , s 2.2.
Let the points ai, 1 d i =s 16, be as in Fig. 2.2.1 1. Define
Q ; = { p E Q3; & ( p ) = 0 , 1 C i C 4},
(2.2.32)
where
M P )=
+ 4 p ( a 1 )+ 2 p ( a ~+) p(a3)+ 2p(a4) -6p(a~) 3P(a6)- ~ P ( ~ -I ~I P) ( ~ I Z ) ,
(2.2.3 3)
and &(PI, $3(p), and t , ! ~ ~ (are p ) derived by circular permutations in the sets U ~ = , { u i }Uy=s{ai}, , U1$,{ai} and u:$13{ai}.Then any polynomial in the space Q ; is uniquely determined by its values at the points ai, 1 6 i d 12. In addition, the inclusion P3C Q;
(2.2.34)
holds. Proof. The proof is left as a problem (Exercise 2.2.5). We shall only record the identity 12
V PE Q L
P =
2 P(ai)pi, 1=I
with
(2.2.35)
From these two theorems, we derive the definition of the rectangle of type (2’) (Fig. 2.2.12) and of the rectangle of type (3’) (Fig. 2.2.13). I f it happens that the set b C R” is rectangular, i.e., it is either an n-rectangle or a finite union of n-rectangles, it can be conveniently “triangulated” by finite elements which are themselves n-rectangles: The fifth condition (Th5) on a triangulation now reads: (Fh5)Any f a c e of any n-rectangle K I in the triangulation is either a subset of the boundary I‘, o r a f a c e o f another n-rectangle K2 in the triangulation.
Ch.2 . 5 2.2.1
FINITE ELEMENTS AND FINITE ELEMENT SPACES
2, = { p ( a i ) , 1 < i S 8). Fig. 2.2.12
I
rectangle of type (3')
PK = Q ; ( K ) (cf. (2.2.32)): dim PK = 12;
& = (p(ai);
1 s is 12).
Fig. 2.2.13
I
63
64
INTRODUCTION TO THE FINITE ELEMENT METHOD
[Ch. 2 . 8 2.2.
In the second case, the n-rectangles K , and K 2 are said to be adjacent. An example of a triangulation made up of rectangles is given in Fig. 2.2.14. With such a triangulation, we m a y associate in a natural way a finite element space xh with each type of the rectangular finite elements which we just described. Since the discussion is almost identical to the one concerning n-simplices, we shall be very brief. In particular, one can prove the following analog of Theorem 2.2.3.
Theorem 2.2.7. Let xh be the finite element space associated with n-rectangles of type ( k ) f o r any integer k zz 1 or with rectangles of type (2’) or (3’). Then the inclusion x h
C go(&)f-I H ’ ( R )
(2.2.36)
0
holds.
Finally, arguing as before, it is easily seen that such finite element spaces possess a basis whose functions have “small” support (FEM 3).
First examples o f finite elements with derivatives as degrees of freedom: Hermite n-simplices of type (3), (3‘). Assembly in triangulations So far, the degrees of freedom of each finite element K have been “point values”, i.e., of the form p ( a ) , for some points a E K. We shall next introduce finite elements in which some degrees of freedom are partial derivatives, or, more generally, directional derivatives, i.e.,
Fig. 2.2.14
Ch. 2, § 2.2.1
FINITE ELEMENTS AND FINITE ELEMENT SPACES
65
expressions such as D p ( a ) b , D * p ( a ) ( b ,c ) , e t c . . . , where b, c are vectors in R”. The first example of this type of finite element is based on the following theorem. Theorem 2.2.8. Let K be an n-simplex with vertices ai, 1 c i c n + 1, and let aijk = ;(ai + uj + ak), 1 d i < j < k d n + 1 . Then any polynomial in the space P3 is uniquely determined by its values and the values of its n first partial derivatives at the vertices ai, 1 s i d n + 1 , and its values at the points aiik.1 d i < j < k d n + 1 .
Proof. It suffices to argue as usual so as to obtain the following identity : Vp EP3, p
= C (-2A;+3A:-7Ai
2
I
{ j #j:i#
AjAk)p(ai) i
The only novelty is that one needs to use the derivatives of the barycentric coordinates in order to show that D p ( a i )= D p ( a i ) , 1 S i d n + 1, denoting momentarily by p’ the right-hand side of (2.2.37). By differentiating the polynomial p’, we obtain
Dp’(ai)=
2 {Dp(ai)(ai- ai)}DAi. j#i
T o show that the above expression is equal to D p ( a i ) ,it is equivalent to show that Dp(ai)(uk- ai) = Dp(ai)(ak- a i ) , 1 d k d n
+ 1,
k # i.
These last relations are in turn consequences of the relations Dhj(ak - ai) =
- Ai(ai), 1 S k S
n
+ 1,
k f i,
which we now establish. Denoting by B the inverse matrix of the matrix A of (2.2.4),we obtain
&Ai=b,, l S j S n + l ,
ldlsn
66
INTRODUCTION TO THE FINITE ELEMENT METHOD
[Ch. 2, $ 2.2.
(cf. (2.2.7)). Therefore we have n
fl
DAj(ak - X ) =
bjlalk
-
b j ~ x=~ s j k - Aj(x)
for any x E R",and in particular for x
=
ai.
0
From this theorem, we deduce the definition of a finite element, which is called the Hermite n-simplex of type (3) (Fig. 2.2.15). where the directional derivatives Dp(ai)(ai- ai) are degrees of freedom. Of course, the knowledge of these n directional derivatives at a vertex ai is equivalent to the knowledge of the first derivative D p ( a i ) . Such a knowledge is indicated graphically by one small circle, or sphere, centered at the point ai. Since the first derivative @ ( a i ) is equally well determined by the partial derivatives ajp(ai), 1 6 j 6 n, another possible set of degrees of freedom for this element is the set 2; indicated in Fig. 2.2.15.
Hermite tetrahedron of type (3)
Hermite triangle of type (3) dim PK = 10
I
Hermite n-simplex of type (3)
Fig. 2.2.15
Ch. 2, P 2.2.1
FINITE ELEMENTS AND FINITE ELEMENT SPACES
67
The derivation of a related element without the degrees of freedom p(aijk), i C j < k, is based on the following theorem, whose proof is left to the reader (Exercise 2.2.6).
Theorem 2.2.9.
F o r each triple (i, j , k ) with i C j c k, let
Then any polynomial in the space
P'; = {p E P3; $ijk(p) = 0,
1 c i <j < k d n
+ 1)
(2.2.39)
is uniquely determined by its values and the values of its n first partial derivatives a t the vertices ai, 1 S i c n + 1. In addition, the inclusion
PZC P ; holds.
(2.2.40)
0
From this theorem, one deduces the definition of the Hermite nsimplex of type (37, which, in case n = 2, is also called the Zienkiewicz triangle (Fig. 2.2.16). Given a triangulation made up of n-simplices, we associate in a natural way a finite element space X h with either type of finite elements. To be specific, assume we are using Hermite n-simplices of type (3), the case of Hermite n-simplices of type (3') being quite similar. Then a function vh is in the space X,, if (i) each restriction vhlK is in the space PK = P 3 ( K )for each K E T,,,and (ii) it is defined by its values at all the vertices of the triangulation, its values at the centers of gravity of all triangles found as 2-faces of the n-simplices K E T,,,and the values of its n first partial derivatives at all the vertices of the triangulation. The corresponding set of degrees of freedom of the space X,, is thus of the form
where Nu denotes the set of all the vertices of the n-simplices of the triangulation and Nc denotes the set of all centers of gravity of all 2-faces of the n-simplices found in the triangulation. When a finite element space is constructed with n-simplices of type ( 3 ) or (37, the sets Zk are preferred to the sets X K (cf. Figs. 2.2.15 and
68
INTRODUCTION TO THE FINITE ELEMENT METHOD
[Ch. 2 . 5 2.2.
n
Hermite tetrahedron of type (3') dim P , = 16
triangle, o r Hermite triangle of type (3')
Hermite n-simplex of type (3')
2, = ( p ( a , ) ,
1 c i S n + 1; Dp(a,)(a,- a , ) , 1 < i , j G n + 1, i f j } . S ; = { p ( a i ) , ~ ~ i ~ n aip(a,), + t ; I G ~ S ~ + I I G, ~ s ~ ) .
Fig. 2.2.16
2.2.16) inasmuch a s they directly correspond to the set &, but this observation is of a purely practical nature. Again, requirement ( 9 h 5 ) insures that the degrees of freedom are unambiguously defined across adjacent finite elements, and it is also the basis for the following theorem.
Theorem 2.2.10. Let xh be the finite element space associated with Hermite n-simplices of type (3), or with Hermite n-simplices of type (3'). Then the inclusion
x,,c u0@)n ~
' ( 0 )
(2.2.41)
holds. Proof.
Arguing as in Theorem 2.2.3, it suffices to derive the inclusion
xh C qo(d):Along any side common to two adjacent triangles, there is a unique polynomial of degree 3 in one variable which takes on prescribed
Ch. 2, 8 2.2.1
69
FINITE ELEMENTS AND FINITE ELEMENT SPACES
values and prescribed first derivatives at the end points of the side. This argument easily extends to the n-dimensional case.
0
To verify requirement (FEM 3), let us assume for definiteness that we are considering Hermite triangles of type (3), so that the associated set of degrees of freedom of the space is of the form
&I,
1 s k,l
L, a I W k ( b 1 ) = & W k ( b , ) = 0, ’ l s k s L , lslsJ, w:(bl) = 0 , 1 d k S J, 1 C 1 d L, alw:(bl) = &I, &w:(bi) = 0, 1 s k, 1 s J, Wi(b1)= 0 , 1 k J,. 1 d 1 d L, alw:(bj) = 0 , azw:(bi) = &, 1 d k, 1 G J,
Wk(bl)=
(2.2.43)
First examples of finite elements f o r fourth-order problems: The Argyris and Bell triangles, the Bogner-Fox-Schmit rectangle. Assembly in triangulations Finally, we examine some examples of finite elements which yield the inclusion xh C and which may therefore be used for solving fourth-order problems. It is legitimate to restrict ourselves to the case where n = 2, in view of the examples given in Section 1.2. Our first example is based on the following result.
%‘(a),
Theorem 2.2.11. Let K be a triangle with uertices ai, 1 s i s 3, and let aii = ;(ai + ai), 1 d i < j 4 3, denote the mid-points of the sides. Then any polynomial p of degree 5 is uniquely determined by the following set o f 2 1 degrees of freedom : Z K = {aap(ai), JaI4 2,
1 s i s 3;
a,,p(aii), I s i < j d 3}, (2.2.44)
where a,, denotes the normal derivative operator along the boundary of K .
70
INTRODUCTION TO THE FINITE ELEMENT METHOD
[Ch. 2, 5 2.2.
Proof. Given a set of degrees of freedom, finding the corresponding polynomial of degree 5 amounts to solving a linear system with a square matrix, for which existence and uniqueness for all right-hand sides are equivalent properties, as we already observed. We shall prove the latter property, i.e., that any polynomial p E P5such that a”p(ai)=O, 1 ~ ~ 1 ~1 2~ , i s 3 ,a v p ( a i j ) = O , l d i C j ~ 3 ,
is identically zero. Let t denote an abscissa along the axis which contains the side K‘ = [al,a 2 ] .Then the restriction pIK,,considered as a function q of t, is a polynomial of degree 5 which satisfies q ( a i ) = q’(ai)= q“(ai)= q(a2) = q’(a2)= q’’(a2)= 0,
since, if
T
is a unit vector on the axis containing the side K’, we have q’(al) = a d a d ,
q ” ( a l )= a,p(al),
etc. . . ,
and thus q = 0. Likewise, considered as a function r of t , the normal derivative a y p along K’is a polynomial of degree 4 which satisfies
r(aJ = r‘(a1)= r(a12)= r(a2)= r’(a2) = 0 , since
d a d = ayp(a1), rYad = a,p(al>,
r(a12)= a V p ( a d etc.. , .,
and, thus, r = 0. Since we have alp = 0 along K’ (p = 0 along K’), we have proved that p and its first derivative Dp vanish identically along K’. This implies that the polynomial A: is a factor of p, as we now show: After using an appropriate affine mapping if necessary, we may assume without loss of generality that A3(xl,x2) = xI.We can write
where p i , 0 d i d 5, are polynomials of degree (5 - i) in the variable Theref ore Vx2 E R, ~ ( 0~ , 2 =) po(x2) = 0, VXZ E R, aip(0, ~ 2 =) P I ( X ~ ) 0, 9
which proves our assertion.
x2.
Ch. 2, 4 2.2.1
FINITE ELEMENTS AND FINITE ELEMENT SPACES
71
Similar arguments hold for the other sides, and we find that the polynomial (A:AiA:) is a factor of p. Since the Ai are polynomials of degree 1 which do not reduce to constants, it necessarily follows that p
=o.
With Theorem 2.2.11, we can define a finite element, the 21-degree of freedom triangle, also known as Argyris triangle (Fig. 2.2.17). Fig. 2.2.17 is self-explanatory as regards the graphical symbols used for representing the various degrees of freedom. We observe that at each vertex ai, the first and second derivatives D p ( a i ) and D 2 p ( a i )are known. With this observation in mind, we see that other possible definitions for the set of degrees of freedom are the sets 2k and 2;
Fig. 2.2.17
72
INTRODUCTION TO THE FINITE ELEMENT METHOD
[Ch. 2 . 8 2.2.
indicated in Fig. 2.2.17. In the expression of the set Xi, the indices are numbered modulo 3, and each vector v;, 1 d i d 3 , is the height originating at the point ai. It may be desirable to dispose of the degrees of freedom avp(aij), 1 d i < j d 3. This reduction will be a consequence of the following result.
Theorem 2.2.12. Any polynomial in the space
P ; ( K )= { p E P , ( K ) ; aVpE P3(K') for each side K' of K} (2.2.45)
is uniquely determined by the following set of 18 degrees of freedom:
ZK = { a a p ( a i ) ,(a(6 2,
1 6 i 6 3).
(2.2.46)
The space P X K ) satisfies the inclusion P4(K) c P ; ( K ) .
(2.2.47)
Proof. By writing aVpE P 3 ( K ' ) in definition (2.2.45), it is of course meant that, considered as a function of an abscissa along an axis containing the side K', the normal derivative &p is a polynomial of degree 3. The inclusion (2.2.47) being obvious, it remains to prove the first part of the theorem. To begin with, we prove a preliminary result: Let K' = [ai, ail be a segment in R", with mid-point aji, and let v be a function such that uIK.E P4(K'). Then we have v I K .E P3(K') i f and only if xii(v)= 0, where xij(V)
+
=4 ( ~ ( ~ i~ ) ( a j )-) 8v(aij)
+ Du(aj)(a;- U j ) .
+ D ~ ( a i ) (-~a;) j (2.2.48)
To see this, let, for any x E K', a4= D 4 v ( x ) ~ 4where , along K', so that a4is a constant. Then we have
+
1 2
-
T
v ( a ; )= v ( a j j ) Dv(aii)(ai aij)+ - D 2 v ( a j j ) ( a-i
+ -61 ~ ~ v ( a ; -~ aij)3 ) ( a+-I(a; ~24 a 4
- aiil14,
is a unit vector
Ch. 2.9 2.2.1
FINITE ELEMENTS AND FINITE ELEMENT SPACES
73
from which we deduce (ai - aij = -(aj - aij)):
Likewise,
1 Dv(aj)(aj- aij) = D2v(aij)(aj - aij)'+ -D3v(aii)(aj- aij)' 2 a 4 + xllaj - aij(I4v
and therefore, D2Y(a;j)(a;- aij)2+ D2v(a;j)(aj- a;$ = Dv(ai)(ai- aij) + Du(aj)(aj- aij) ff4
--{llai 6
- Uij1I4 + llaj - Uij114}.
Combining our previous relations, we get 1
2u(aij)= ~ ( a i+) ~ ( a j+)-{Du(u~)(u~ - aj) + Dv(aj)(ai- aj)} 4 ff4 + -1lai 96
-
and the assertion is proved. As a consequence of this preliminary result, the space P ; ( K ) may be also defined as
P X K ) = { p E P d K ) ; ,yii(dvp) = 0,
1G
i < j s 3},
(2.2.49)
i.e., in view of relations (2.2.48), we have characterized the space P ; ( K ) by the property that each normal derivative avp(aij)is expressed as a linear combination of the parameters a"p(ai), a"p(aj), la( = 1,2. Then the proof is completed by combining the usual argument with the result of Theorem 2.2.1 1. 0
14
INTRODUCTION TO THE FINITE ELEMENT METHOD
[Ch. 2. 8 2.2.
From Theorem 2.2.12, we deduce the definition of a finite element, called the 18-degree of freedom triangle, or, preferably, Bell’s triangle. See Fig. 2.2.18, where we have indicated three possible sets of degrees of freedom which parallel those of the Argyris triangle. Given a triangulation made up of triangles, we associate a finite dement space xh with either type of finite elements. We leave it to the reader to derive the associated set of degrees of freedom of the space X , and to check that the canonical basis is again composed of functions with “small” support. We shall only prove the following result. Theorem 2.2.13. Let xh be the finite element space associated with Argyris triangles o r Bell’s triangles. Then the inclusion
x,, c ui(d)n ~ * ( n ) holds.
Bell’s triangle or 18-degree of freedom triangle
Fig. 2.2.18
(2.2.50)
Ch. 2, 8 2.2.1
Proof.
FINITE ELEMENTS AND FINITE ELEMENT SPACES
75
By Theorem 2.1.2, it suffices to show that the inclusion XhC
Cge'(d) holds.
Let K1 and K 2 be two adjacent triangles with a common side K ' = [bi,bi] (Fig. 2.2.19) and let u h be a function in the space Xh constructed with Argyris triangles. Considered as functions of an abscissa t along an axis containing the side K ' , the functions Vh(K, and UhlK2 are, along K', polynomials of degree 5 in the variable t. Call these polynomials q1 and q2. Since, by definition of the space xh,we have q(bi)= q'(bi)= q"(bi)= q(bj)= q'(bj)= q"(bj)= 0 ,
with q = q1- q2, it follows that q = 0 and hence the inclusion V,,C Cg0(6) holds. Likewise, call rl and r2, the restrictions to the side K' of the functions & u , , ( ~ ,and -avuhlK2. Then both rl and r2 are polynomials of degree 4 in the variable t and, again by definition of the space X,,, we have
r( b i )= r'(b i )= r( bii)= r( bi) = r'( bi) = 0, with r = rl - r2, so that r = 0. We have thus proved the continuity of the normal derivative which, combined with the continuity of the tangential derivative ( q = 0 along K' implies q' = 0 along K'), shows that the first derivatives are also continuous on 6. If the space Xh is constructed with Bell's triang1es;the argument is
Fig. 2.2.19
76
INTRODUCTION TO THE FINITE ELEMENT METHOD
[Ch. 2 , s 2.2.
identical for the difference q = q 1- q2.The difference r = rl - r2 vanishes because it is a polynomial of degree 3 in the variable t which is such that
0
r( bi) = r’(bi) = r( b j )= r’(b j )= 0 .
To conclude, we give one instance of a rectangular finite element which may be used for solving fourth-order problems posed over rectangular domains. Its existence depends upon the following theorem, whose proof is left to the reader (Exercise 2.2.8).
Theorem 2.2.14. Let K denote a rectangle with vertices ai, 1 S i C 4 . Then a polynomial p E Q3 is uniquely determined by the following set of degrees of freedom:
ZK = {p(ai)y
aiP(ai), azP(ai), alzP(ai), 1
i
4).
0 (2.2.51)
The resulting finite element is the Bogner-Fox-Schmit rectangle. See Fig. 2.2.20, which is again self-explanatory for the graphical symbols. The proof of the next result is also left to the reader (Exercise 2.2.8):
I
Bogner-Fox-Schmit rectangle
Ch. 2, 5 2.2.1
FINITE ELEMENTS AND FINITE ELEMENT SPACES
77
Theorem 2.2.15. Let xh be the finite element space associated with Bogner- Fox- S c hm it rectangles. Then the inclusion
xh c %'(fi) n H 2 ( n )
(2.2.52)
0
holds.
Finally, the reader should.check, using the standard construction, that a finite element space constructed with any one of the last three finite elements indeed possesses canonical bases whose functions have "small" supports (FEM 3). Exercises 2.2.1. (i) Prove that the dimension of the space Pk, resp. Qk, is ("ik),. resp. ( k + I)". (ii) Prove that dim Pk(A) = dim p k . resp. dim Qk(A)= dim Qk, if the interior of the set A C R" is not empty. 2.2.2. Let K be an n-simplex with vertices aj, 1 s j s n + 1. For a given integer k 2 1, show that a polynomial of degree s k is uniquely defined by its values on the set Lk(K) defined in (2.2.1 1) (NICOLAIDES (1972)). The set L k ( K ) is called the principal lattice of order k of the n-simplex K. 2i2.3. Complete the proof of Theorem 2.2.3 so as to cover all cases. 2.2.4. Give another proof of Theorem 2.2.4 (i.e., without recurring to identjty (2.2.22)), by showing that if a polynomial of Qk vanishes on the set hfk defined in (2.2.21), then it is identically zero. 2.2.5. Prove Theorem 2.2.6. 2.2.6. Prove Theorem 2.2.9. Are the spaces P ; and P i (cf. (2.2.13) and (2.2.39), respectively) identical? 2.2.7. Given a triangle with vertices ai, 1 c i C 3, and mid-points aij = !(ai + a j ) , 1 d i < j s 3 , show that a polynomial p E P4 is completely determined by the following degrees of freedom ( ~ E N ~ S E(1974)): K
p ( a i ) , JiiP(ai), J u p ( a i ) , J z ~ ( a i ) ,1 C i s 3, p ( a i i ) , 1 6 i < j c 3. Does this element yield the inclusion
xh c %'(a)?
xh C %'(fin),
I
resp. the inclusion
2.2.8. (i) Given a rectangle with vertices ai, 1s i s 4 , show that a polynomial p E Q3 is completely determined by the following degrees of
78
INTRODUCTION TO T H E F I N I T E E L E M E N T M E T H O D
[Ch. 2 . 5 2.3.
freedom:
p ( a A aiP(ai), 4 P ( a i ) , aizP(ai), 1 s i s 4. (ii) Show that the corresponding space x h
x h
satisfies the inclusion
c c e l ( i - 3 ) n~ ~ ( 0 ) .
Consider the finite element space xh constructed with (Hermite) triangles of type (3) and let w:, 1 C k C MI,be the basis functions of the space xh associated with the values at the barycenters of all the triangles of the triangulation, so that the discrete solution takes the form
2.2.9.
M
Show that in this case the solution of the linear system (2.1.4) amounts, in fact, to solving a smaller linear system, in the unknowns u;, 1 C i S M2, only. This process, known as the static condensation of the degrees o f freedom, is of course to be distinguished from the use of (Hermite) triangles of type (3'). 2.3. General properties of finite elements and finite element spaces
Finite elements as triples ( K , P , 2).Basic definitions. The P-interpolation operator Let us begin by giving the general definition of a finite element. A finite element in R" is a triple ( K , P , 2 ) where: (i) K is a closed subset of R" with a non empty interior and a Lipschitz-continuous boundary, (ii) P is a space of real-valued functions defined over the set K , (iii) Z is a finite set of linearly independent linear forms 4i, 1 6 i S N, defined over the space P (in order to avoid ambiguities, the forms 4; need to be defined over a larger space; we shall examine this point later; cf. Remark 2.3.3). By definition, it is assumed that the set 2 is P unisofvent in the following sense: given any real scalars a;,I S i =z N, there exists a unique function p E P which satisfies + , ( p ) = a,, 1
s i S N.
(2.3.1)
Ch. 2 . 8 2.3.1
79
PROPERTIES OF FINITE ELEMENTS A N D SPACES
Consequently, there exist functions pi E P, 1 S i
4 j ( p i )= aij,
1sj s
N.
S
N , which satisfy
(2.3.2)
Since we have
(2.3.3) Of course this implies that the space P is finite-dimensional and that dim P = N. The linear forms &, 1 S i s N, are called the degrees of freedom o f the finite element, and the functions p i , 1 s i c N , are called the basis functions of the finite element. Whenever we find it convenient, we shall use the notations P K , Z K , &K and piK in lieu of P, 2,+i and pi. Remark 2.3.1. The set K itself is often called a finite element, as we did in the previous section, and as we shall occasionally do in the sequel. 0 Remark 2.3.2. The P-unisolvence of the set 2 is equivalent to the fact that the N linear forms 4i form a basis in the dual space of P. As a consequence, one may view the bases (4i)Lland (pi)EIas being dual bases, in the algebraic sense.
In the light of the definition of a finite element, let us briefly review the examples given in the previous section. We have seen examples for which the set K is either an n-simplex, in which case the finite element is said to be simplicial, or triangular if n = 2, or tetrahedral if n = 3, or an n-rectangle in R”,in which case the finite element is said to be rectangular. As we already mentioned, these are all special cases of straight finite elements, i.e., for which the set K is a polyhedron in R“.Other polygonal shapes are found in practice, such as quadrilaterals (see Section 4.3 and Section 6.1) or “prismatic” finite elements (see Remark 2.3.6). We shall also describe (Section 4.3) “curved” finite elements, i.e., whose boundaries are composed of “curved” faces. The main characteristic of the various spaces P encountered in the examples is that they all contain a “full” polynomial space Pk(K) f o r
80
INTRODUCTION TO THE FINITE ELEMENT METHOD
[Ch. 2, 5 2.3.
some integer k 2 1, a property that will be shown in subsequent chapters to be crucial as far as convergence properties are concerned. In all the examples described previously, the degrees of freedom were of some of the following forms:
(2.3.4)
where the points a:, r = 0, 1,2, belong to the finite element, and the (non zero) vectors .$iIk, ti, Si: are either constructed from the geometry of the finite element (e.g., D p ( a j ) ( a j- ai), a v p ( a j j ) ,etc. . .) or fixed vectors of R" (e.g., a i p ( a j ) , ajjp(ak)). The points a:, r = 0, 1,2, are called the nodes of the finite element and make up a set which shall be denoted JVK in general. Whereas only directional derivatives of order 1 or 2 occurred in the examples, one could conceivably consider degrees of freedom which would be partial derivatives of arbitrarily high order, but these are seldom used in practice. As we shall see later, however, (Section 4.2 and Section 6.2) there are practical instances of degrees of freedom which are not attached to nodes: They are instead averages (over the finite element or over one of its faces) of some partial derivative. When all the degrees of freedom of a finite element are of the form p + p ( a ; ) , we shall say that the associated finite element is a Lagrange finite element while if at least one directional derivative occurs as a degree of freedom, the associated finite element is said to be a Hermite finite element. As the examples in the previous section have shown, there are essentially two methods for proving that a given set 2 of degrees of freedom is P-unisolvent: A f t e r it has been checked that dim P = card(Z)), one either (i) exhibits the basis functions, or (ii) shows that if all the degrees of freedom are set equal to zero, then the only corresponding function in the space P is identically zero. We have used method (i) for all the examples, except for the Argyris triangle where we used method (ii). Given a finite element (K, P,2),and given a function u = K - R , sufficiently smooth so that the degrees of freedom di(u), 1 S i C N , are
Ch. 2 . 8 2.3.1
PROPERTIES OF FINITE ELEMENTS AND SPACES
81
well defined, we let
(2.3.5) denote the P-interpolant of the function u, which is unambiguously defined since the set Z is P-unisolvent. Indeed, the P-interpolant, also denoted &u, is equivalently characterized by the conditions
n u E P, and
di(17u) = di(u), 1 6 i Q N .
(2.3.6)
Whenever the degrees of freedom are of the form (2.3.4), let s denote the maximal order of derivatives occurring in the definition of the set 2. Then, for all finite elements of this type described here, the inclusion P c % " ( K ) holds. Consequently, we shall usually consider that the domain dom 17 of the P-interpolation operator 17 is the space dom I7 = FeS(K).
(2.3.7)
This being the case, it follows that ouer the space P C dom 17, the interpolation operator reduces t o the identity, i.e., VpEP, n p = p .
(2.3.8)
Remark 2.3.3. In order that the P-interpolation operator be unambiguously defined, it is necessary that the forms di be also defined on the space % ' ( K ) ,for the following reason. Assume again that the space P is contained in the space %'(K). Then if the domain of the operator 17 were only the space P, infinitely many extensions to the space %'(K) would exist. Let us give one simple example of such a phenomenon: Let K be an n-simplex with barycenter a. Then the linear form p E % O ( K ) + l/(meas ( K ) )J K p dx is one possible extension of the form p E Pl(K)+ p(a). Of course, these considerations are usually omitted inasmuch as when one considers a degree of freedom such as aip(aj) for instance, it is implicitly understood that this form is the usual one, i.e., defined over the space %'(K),not any one of its possible extensions from the space P to the space % ' ( K ) .For another illustration of this circumstance, see the description of Wilson's brick, in Section 4.2. 0 Whereas for a Lagrange finite element, the set of degrees of freedom is unambiguously defined - indeed, it can be conveniently identified with
82
INTRODUCTION TO THE FINITE ELEMENT METHOD
[Ch. 2 . 4 2.3.
the set of nodes - there are always several possible definitions for the degrees of freedom of a Hermite finite element which correspond to the “same” finite element. More precisely, we shall say that two finite elements ( K , P , 2 ) and ( L , Q. 8)are equal if we have K = L,
P = Q and
n~=n~.
(2.3.9)
As an example, let us consider the Hermite n-simplex of type (3’) with the two sets of degrees of freedom (cf. Fig. 2.2.16):
2 = { p ( a i ) , 1 s i s n + 1; Dp(ai)(ai- ai), 1si. j s n + l ,
i#j},
2’ = { p ( a i ) , 1 s i s n + 1; &p(ai), 1 d i s n + 1, 1c k c n}. Let us denote by n and n’ the corresponding P,(K)-interpolation operators. Then, for any function u E % ‘ ( K )= dom = dom nl, we have, with obvious notations, =
2 u(ai)pi + Ci.i fi(ai)(aj - ai)pij,
x i
nlv =
I
u(ai)p:+
c.
aku(ai)p:k.
i.k
One has, for each pair ( i , j ) , Du(ai)(aj- ai) = X L ,piikaku(ai)for appropriate coefficients pijk.To conclude that IZ = n’, it suffices to observe that for each polynomial p E P K , one also has D p ( a i ) ( a , - a i ) = Xi=,pi&p(ai) with the same coefficients pijk. Afine families of finite elements
We now come to an essential idea, which we shall first illustrate by an example. Suppose we are given a family (K, PK, Z K ) of triangles of type (2). Then our aim is to describe such a family as simply us possible. Let k be a triangle with vertices di, and mid-points of the sides ciij = (cii + h j ) / 2 , 1 6 i < j s 3, and let
2 = {p(cii). 1 s i s 3; p(cii,), 1 s i < j c 31, so that the triple (k,P, 2) with fi = PI(&) is also a triangle of
type (2).
Ch. 2,B 2.3.1
PROPERTIES OF FINITE ELEMENTS AND SPACES
8
83
Given any finite element K in the family (Fig. 2.3.1), there exists a unique invertible afine mapping
F K : 2 E R2+ F K ( ~= )BKi
+ bK,
i.e., with BK an invertible 2 x 2 matrix and bK a vector of R2, such that FK(cij)= ai, 1 d i c 3 . Then it automatically follows that FK(Bij)
= aii,
I s i < j c 3,
since the property for a point to be the mid-point of a segment is preserved by an affine mapping (likewise, the points which we called aiii or ajjk keep their geometrical definition through an affine mapping). Once we have established a bijection 2 E k + x = F K ( i E ) K between the points of the sets l? and K, it is natural to associate the space Pk=(p: K+R;
p=b-
Fi' j=Pl
Fig. 2.3. I
9
84
INTRODUCTION TO THE FINITE ELEMENT METHOD
[Ch. 2, § 2.3.
with the space P. Then it follows that
PW
= P , ( K ) = PK,
because the mapping FK is affine. In other words, rather than prescribing such a family by the data K , PK and Z K , it sufices to give one reference finite element (K.2, @ ) and the afine mappings FK.Then the generic finite element (K, P K ,Z K ) in the family is such that
K = FK(K), P K = ( P : K + R ; p = C * F - ' , CEP},
Z K = (P{FK(hi)),
1 s i s 3;
p(FK(&i,)), 1 =Z i < j s 3).
I
With this example in mind, we are in a position to give the general definition: Two finite elements ( k , @ , $ and ) (K, P , Z ) , with degrees of freedom of the form (2.3.4), are said to be afine-equivalent if there exists an invertible afine mapping:
F : 2 E R" + F ( i ) = B i + b E R",
(2.3.10)
such that the following relations hold:
K = F(K), P = { p : K + R ; p = f i * F - ' , CEP}, a:= F(S9, r = 0,1,2, (i'k = BiA, 8; = B& 6; = B&, whenever the nodes a:, resp. S:, and vectors occur in the definition of the set Z, resp. 2.
(ilk,
(2.3.1 1 ) (2.3.12) (2.3.13) (2.3.14) (;,
ti, resp. jilk,li, &,
Remark 2.3.4. The justification of the relations (2.3.14) will become apparent in the proof of Theorem 2.3.1. 0 With this definition of affine-equivalence, let us return to the examples given in Section 2.2 (the reader should check for oneself the various statements to come). T o begin with, it is clear that two n-simplices of type k for a given integer k 2 1 , are affine equivalent, and that this is also the case for n-simplices of type ( 3 ' ) , in view of the definition (2.2.13) of the associated space PK. Likewise, two n-rectangles of type ( k ) for a given
Ch. 2 , 8 2.3.1
85
PROPERTIES OF FINITE ELEMENTS A N D SPACES
integer k L 1, or two rectangles of type (2') or (3') are affine equivalent through diagonal affine mappings. In other words, any two identical Lagrange finite elements that we considered are afine-equivalent. When we come to Hermite finite elements, the situation is less simple. Consider for example two Hermite n-simplices of type (3) with sets of degrees of freedom in the form ,ZK (Fig. 2.2.15). Then it is clear that they are affine-equivalent because the relations ai- ai = F ( h j )- F(hi)= B(hj - hi), 1 S i, j =sn + I ,
j # i,
hold, among other things. However, had we taken the sets of degrees of freedom in the form Zk, it would not have been clear to decide whether the two finite elements were affine-equivalent, and yet these two sets of degrees of freedom correspond to the same finite element, as we already pointed out. The same analysis and conclusion apply to the Hermite n-simplex of type (3') or to the Bogner-Fox-Schmit rectangle. In this last case, it suffices to observe that this finite element can also be defined by the following set of degrees of freedom (the index i is counted modulo 4)
-Zk = { P ( a i ) , Dp(aiI(ai-1- ai), Dp(ai)(ai+l- ai), D*p(ai)(ai-,- ai, ai+,- a i ) , 1 s i s 4},
(2.3.15)
for which relations (2.3.14) hold. There are counter-examples. For instance, consider a finite element where some degrees of freedom are normal derivatives at some nodes. Then two such finite elements are not in general affine equivalent: The property for a vector to be normal to a hyperplane is not in general preserved through an affine mapping. Thus two Argyris triangles are not affine equivalent in general, except for instance if they happen to be both equilateral triangles. The case of Bell's triangles is left as a problem (Exercise 2.3.4). Let us return to the general case. We shall constantly use the correspondences (2.3.16) (2.3.17) between the points 2 E K and x E K, and the functions p^ E and p E P corresponding to two affine-equivalent finite elements. As a consequence
86
INTRODUCTION TO THE FINITE ELEMENT METHOD
[Ch. 2, 8 2.3.
of the correspondences (2.3.16) and (2.3.17), notice that we have $(.t)=p(x)
for all
~EKD , EP.
(2.3.18)
We next prove a crucial relationship between the P-interpolation operator fi and the P-interpolation operator ll associated with affineequivalent finite elements. This relationship will be itself a consequence of the fact that the basis functions are also in the correspondence (2.3.17). Theorem 2.3.1. Let ( & , p , s ) and ( K ,P , S ) be two afine-equivalent finite elements with degrees o f freedom in the form (2.3.4). Then if Bi, 1 d i d N , are the basis functions of the finite element K,the functions pi, 1 d i d N , are the basis functions of the finite element K. The interpolation operators l 7 and fi are such that
(nu)^ = dd
(2.3.19)
for any functions v^ E dom d and u +dom ll associated in the correspondence
9 Edom d-+v= 6 .F - ' E d o m
T.
(2.3.20)
Proof. The P-interpolation operator ll is of the form (with obvious notations):
Using the derivation of composition of functions, we obtain
and, taking also into account that D2F = 0,
Thus we also have
Ch. 2 . 8 2.3.1
PROPERTIES OF FINITE ELEMENTS AND SPACES
87
from which we deduce, using the correspondence (2.3.17),
If we apply the previous identity to a function u E P, we infer that the functions fi!, fii, fii are the basis functions of the finite element ( k ,$, $), by virtue of identity (2.3.8). Using this result, we conclude that the function (nu)*is equal to the function fi;, by definition of the $-interpolation operator fi. 0
Remark 2.3.5. To obtain the conclusion of the previous theorem when the sets of degrees of freedom are in the general form f = {&; 1 < i S N} and 2 = {&; 1 S i d N}, it is necessary and sufficient that the degrees of freedom be such that Vv^E dom fi, &(;)
= &(u),
I
(2.3.21)
and, in essence, the proof of Theorem 2.3.1 consisted in showing that the above relations d o hold (as consequences of relations (2.3.13H2.3.14)) for the type of degrees of freedom heretofore encountered. In Section 4.2, we shall consider a new type of degrees of freedom for which the validity of relations (2.3.21) will be verified.
A family of finite elements is called an afine family if all its finite elements are affine-equivalent to a single finite element, which is called the reference finite element of the family (the reference finite element (k,$, f ) need not belong itself to the family). In the case of an affine family of simplicia1 finite elements, a cusis the unit n-simplex with vertices tomary choice for the set
I
6 , = ( 1 , 0) . . . , O ) , a^2 = (0, l , O , . . . ,O ) ,
6, = ( 0 , . . . ,o, l), &.+I = (O,O, .. . O), 9
88
INTRODUCTION TO THE FINITE ELEMENT METHOD
[Ch. 2 , s 2.3.
for which the barycentric coordinates take the simple form n
hi = xi, 1 S i S n, and
A,,+, = 1-2 xi. i=l
In the case of an affine family of rectangular finite elements, a usual choice for the set k is either the unit hypercube [0,1]“ or the hypercube [- 1,
+ 11”.
The concept of an afine family of finite elements is of importance, basically for the following reasons: (i) In practical computations, most of the work involved in the computation o f the coeficients of the linear system (2.1.4) is performed on a reference finite element, not on a generic finite element. This point will be illustrated in Section 4.1. (ii) For such affine families, a fairly elegant interpolation theory can be developed (Section 3.1), which is, in turn, the basis of most convergence theorems. (iii) Even when a family of finite elements of a given type is not an affine family, it is generally associated in an obvious way with an affine family whose “intermediate” role is essential. For example, when we shall study in Section 6.1 the interpolation properties of the Argyris triangle, an important step will consist in introducing a slightly different finite element (called the “Hermite triangle of type ( 5 ) ” ; cf. Exercise 2.3.5) which can be imbedded in an affine family. In the same fashion, we shall consider (Section 4.3) the “isoparametric” families of curved finite elements essentially as perturbations of affine families.
Construction of finite element spaces Xh. Basic definitions. The X h interpolation operator Our next task is to give a precise description of the construction of a finite element space from the data of finite elements ( K , P K ,ZK).For the sake of simplicity however, we shall restrict ourselves to the case where the finite elements K are all polygonal, so that the set d = K ~ KT is~ necessarily polygonal, and to the case where the finite elements are all of Lagrange type. These restrictions essentially avoid difficulties (of a purely technical nature) pertaining to appropriate definitions (i) of “faces” of non polygonal elements in general and (ii) of compatibility conditions for the degrees of freedom of adjacent
u
Ch. 2 , 8 2.3.1
PROPERTIES OF FINITE ELEMENTS AND SPACES
89
finite elements along common faces in the case of Hermite finite elements.
Remark 2.3.6. There are indeed polygonal finite elements which are used in actual computations by engineers and which are neither nsimplices nor n-rectangles. Of course, such finite elements are not just arbitrary polygonal domains. Rather they are adapted to special circumstances: Thus, if the domain d is a cylindrical domain in R3 it might be interesting to use prismatic finite elements, an example of which is given in Fig. 2.3.2. In this case, the space P is the tensor product of the space PI in the variables x I ,x2 by the space PI in the variable x3, i.e., a function p in the space P is of the form P(xl, x29 x3) = TI + y2xI + y3x2+ y4x3+
ySXlx3
+ y6x2x3.
0
We shall assume that each polygonal set K has a non-empty interior and that the interiors of the sets K are pairwise disjoint, so that requirements (Yhi), 1 < i < 4, are satisfied (a polygonal domain has a Lipschitz-continuous boundary). A portion K' of the boundary of a polygonal finite element K is a face of K if it is a maximal connected subset of an affine hyperplane X of R" with a nonempty interior relatively to X. In order to unambiguously define the functions of the finite element a.
Fig. 2.3.2
90
INTRODUCTION TO THE FINITE ELEMENT METHOD
[Ch. 2 . 8 2.3.
space (see below), we need the following obvious extension of the condition ( 5 h 5 ) already seen for n-simplices and n-rectangles: ( 5 h 5 ) A n y f a c e of a finite element K , is either a f a c e o f another finite element K 2 , in which case the finite elements K , and K , are said to be adjacent, o r a portion of the boundary r o f the set R. Finally, the sets of degrees of freedom of adjacent finite elements shall be related as follows: Whenever ( K ! ,PKI,S K I ) with ZKI= { p ( a ( ) ,1 d i d N I } , 1 = 1 , 2 , are t w o adjacent finite elements, then
(2.3.22) We define the set
(2.3.23) where, for each finite element K E Yh, NK denotes the set of nodes. For each b E J h , we let K A , A E A ( b ) , denote all those finite elements for which b is a node. Then the associated finite element space x h is the (generally proper) subspace of the product space nKEVh PK defined by
Therefore a function in the space
x h
is uniquely determined by the set
which is called the set of degrees of freedom of the finite element space. It is thus realized that an element u E X,, is nor in general a “function” defined over the set 6,since it need not have a unique definition along faces common to adjacent finite elements. Nevertheless, by virtue of assumption (2.3.22), it is customary to say that the “functions” in the space x h are at least “continuous at all nodes common to adjacent finite elements’’ (the inclusions PK C %‘(K), K E s h , hold in practice). It is also a usual practice to consider the functions UK. K E y h r as being the restrictions to the finite elements K of the function ‘o E x h , just as if u were an “ordinary” function defined over the set h.This is why we shall use the alternate notation uIK = uK.
Ch. 2 , Q2.3.1
PROPERTIES OF FINITE ELEMENTS AND SPACES
91
If it happens, however, that for each function v E X,,, the restrictions and vIK, coincide along the face common to any pair of adjacent finite elements K , and KZ,then the function v can indeed be identified with a function defined over the set 6.
VIK,
Remark 2.3.7. Although this last property was true for all the examples of Section 2.2, it is by no means necessary. Following CROUZEIX& RAVIART(1973), let us consider for example the finite element space constructed with the following finite element (K, P, 2):The set K is an n-simplex with vertices aj, 1 d j d n + 1, the space P is the space P l ( K ) and the set of degrees of freedom is the set 2~ = { p ( b i ) , 1 d i S n + l}, where for each i the point bi is the barycenter of the face which does not contain the point ai, i.e., 1 n+l
b i = - C aj, l d i ~ n + l . n j=l j#i
In Fig. 2.3.3, we have represented this finite element for n
=2
and n = 3.
To show that the set ZK is PI(K)-unisolvent, it suffices to observe that the points bi = (bji);=l, 1 d i d n + I , are also the vertices of a (nondegenerate) n-simplex: If we let B denote the (n + 1) X ( n + 1) matrix
a,
a,
Fig. 3.3.3
92
INTRODUCTION TO THE FINITE ELEMENT METHOD
[Ch. 2 . 8 2.3.
defined by
B=
... it is easily verified that det B = (- l / n ) " det A , where A is the matrix of (2.2.4) and thus det B # 0. One may also notice that the functions pi= 1 - n h i ,
lSiSn+l,
are the associated basis functions. Then it is clear that the functions of the corresponding finite element space generally have two definitions along faces common to adjacent finite elements, except at the centroids of these faces. 0 All the previous considerations can be extended so as to include the case of finite element spaces constructed with Hermite finite elements, and the details are left to the reader (Exercise 2.3.8). We shall simply point out that it is often necessary to choose between various possible sets of degrees of freedom (corresponding to the same finite element) so as to unambiguously define a set &, of degrees of freedom of the corresponding finite element space. These considerations have been illustrated at various places in Section 2.2. When the degrees of freedom of all finite elements are of some of the forms (2.3.4), the degrees of freedom of the finite element space are of some of the following forms: (2.3.25)
where the points bl, r = 0 , 1,2, called the nodes of the finite element space, make up a set which shall be generally denoted N h . If we write the set & as s h
= (4j.hr
1
j
M},
(2.3.26)
then the basis functions wi, 1 s j s M, of the finite element space are
Ch. 2 . 5 2.3.1
PROPERTIES OF FINITE ELEMENTS AND SPACES
93
defined by the relations wi E xh
and
4i,h(Wj)
=8 ,
1 d i d M.
(2.3.27)
We leave it to the reader to verify on each example that the basis functions of the finite element space are derived from the basis functions o f the finite elements, as follows: Let &, E x h be of one of the form (2.3.25), let b be the associated node, and let KA, A E A ( b ) , denote all the finite elements of y h for which b is a node (see Fig. 2.3.4 in the case of rectangles of type (2)). For each A € A ( b ) , let p A denote the basis function of the finite element KA associated with the restriction of &, to KA. Then the function w E xh defined by w = ( pAover KA, A E A ( b ) , 0 elsewhere,
(2.3.28)
is the basis function of the space xh associated with the degree o f freedom As a practical consequence, requirement (FEM 3) (which was set up in Section 2.1) is always satisfied in the examples. The reader should refer to Fig. 2.2.8 where, on an example, it was shown that the basis functions constructed in this fashion have indeed “small” supports. The “worst” case concerns a basis function attached to a vertex, say b, of the triangulation. In this case, the corresponding support is the union of those finite elements which have b as a vertex. In most commonly encountered triangulations in the plane, the number of such finite elements is very low (six or seven, for example).
+,,.
Fig. 2.3.4
94
INTRODUCTION TO THE FINITE ELEMENT METHOD
[Ch. 2, 5 2.3.
Let there be given a finite element space xh with a set of degrees of freedom of the form (2.3.26). Then with any function u : f l + R sufficiently smooth so that the degrees of freedom 4 j . h ( U ) , 1 C j d M, are well defined, we associate the function M
nhu =
(2.3.29)
4j,h(u)Wj’ j=1
where the functions wi are the basis functions defined in (2.3.27). The function nhv, called the Xh-interpolant of the function u, is equivalently characterized by the conditions nhu E xh
and
+ji.h(nhV) = +j,h(u),
1sj
s M.
(2.3.30)
If we let s denote the maximal order of directional derivatives occurring in the finite elements (K, Pt, ZK),K E Yh, we shall usually consider, in view of definition (2.3.7), that the domain dom n h of the Xh-interpolation operator &, is the space dom n
h
=
%’(d).
(2.3.31)
It might be helpful to keep in mind the following tableau (Fig. 2.3.5) where we have recapitulated the main “global” (i.e., on 6 )versus “local” (i.e., on a generic finite element K) notations, definitions and correspondences. We next state a relationship of paramount importance between the “Global” definitions
ii
Boundary of the set 0:r Triangulation of the set 6 :9, Finite element space: X , Generic function of X,: u or uh Set of degrees of freedom of X,: 2, Degrees of freedom of X , : 4, or 1 sj s M Basis functions of xh: w,, I c j c M Nodes of X,: b, X,-interpolation operator: l7,
+,,
“Local” definitions
K : Finite element a K : Boundary of K K‘: Side, or face, of K P or PK or p K : Generic function of P , P or 2,: Set of degrees of freedom of K 1 c i c N : Degrees of freedom of K 6, or p
or P , , ~ 1, s i s N : Basis functions of K a,, a,,, . . . : Nodes of K Il or II,: PK-interpolation operator p,
Fig. 2.3.5
Ch. 2. 5 2.3.1
PROPERTIES OF FINITE ELEMENTS AND SPACES
“global” interpolation operator n
h
95
and the “local” interpolation operators
HK.
Theorem 2.3.2. Let u be any function in the space dornnh. Then the restrictions belong to the spaces dom nK,and we haue
UIK
(2.3.32) Proof. The above relations are direct consequences of the way in which the set &, is derived from the sets xK,K E yh. 0
Finite element of class %’ and V 1 It has always been assumed thus far that all the finite elements
( K , PK,Z K ) , K E y h r which are used in the definition of a finite element space are all of the same type: By this, we mean that, for instance. the finite elements are all n-simplices of type (2), or that the finite elements are all Argyris triangles, etc.. . . If this is the case, we shall say that any finite element ( K , PK, Z K ) , K E yh, is the generic finite element of the finite element space. We next state two definitions which are of particular importance, in view of Theorems 2.1.1 and 2.1.2. We shall say that a finite element ( K ,P K , Z K is ) of class %’ if (i) the inclusion PK C U 0 ( K ) holds and (ii) whenever it is the generic finite element of a triangulation and K , and K 2 are two adjacent finite elements, the restrictions U h ( & and 2)hlKz coincide along the face common to K1and K 2 for any function u h of the corresponding finite element space. As a consequence, it is legitimate in this case to consider that the inclusion x h c ~ ‘ ( dholds. ) Likewise, we shall say that a finite element ( K , P K ,Z K )of a given type is of class % I if (i) the inclusion PK C % ‘ ( K )holds and (ii) whenever it is the generic finite element of a triangulation and K , and K 2 are two adjacent finite elements, for any function uh in the corresponding finite element space the restrictions UhlK, and u h l K 2 coincide along the face K’ common to K I and K 2 and the outer normal derivatives a v u h l K l and a v u h 1 K 2 have a zero sum along K’. As a consequence, it is legitimate in this case to consider that the inclusion x h C %‘(d) holds. Thus for instance, all the finite elements seen in Section 2.2 are of class %’, and the Argyris and Bell triangles and the Bogner-FoxSchmit rectangle are in addition of class % I . There are also finite
96
[Ch. 2.8 2.3.
INTRODUCTION TO THE FINITE ELEMENT METHOD
elements which are not of class go,such as the one that was considered in Remark 2.3.7.
Remark 2.3.8. One may of course use finite elements of diferent types in a triangulation, provided some compatibility conditions are satisfied along faces which are common to adjacent finite elements, in such a way that a function in the space x h is still unambiguously defined on the one hand, and an inclusion such as x h C %“(d) (for example) holds on the other hand. Thus one may combine triangles of type ( k ) or ( k ’ ) with rectangles of type ( k ) and still obtain the inclusion x h C Eo(d), etc.. . . Such an example is considered in Fig. 2.3.6. 0
Taking into account boundary conditions. The spaces
XOh
and
xrnh
The last topic we wish to examine in this section is the way in which boundary conditions are taken into account in a finite element space. Again, we shall essentially concentrate on examples. Let X h be a finite element space whose generic finite element is any one of the following: n-simplex of type (k), k 1, or of type (3’), n-rectangle of type ( k ) , k 1, rectangle of type (2’) or (3’). Then the inclusion x h C fl H ’ ( R ) holds (Theorems 2.2.3 and 2.2.7) and it follows that the inclusion
%‘(a)
XI), = { o h E x
h ;
o h l r = 0)
c Hd(0)
(2.3.33)
holds. In each of the above cases, it is easily verified that a sufficient (and obviously necessary) condition for a function u h E x h to vanish along is that it vanishes at all the boundary nodes, i.e., those nodes of the space X h which are on the boundary r. In other words, if we let .Irh denote the set of nodes of the space x h , the finite element space x o h of (2.3.33) is simply given by
r
XOh={VhEXh;
V b E N h n r ,
Rectangle
of
t y p e (2’)
Fig. 2.3.6
Uh(b)=O}.
(2.3.34)
Ch. 2 . 8 2.3.1
PROPERTIES OF FINITE ELEMENTS AND SPACES
91
When Hermite finite elements are used, the situation is less simple. Let us consider for example the case of Hermite n-simplices of type (39, in which case the set of nodes of the triangulation coincides with the set of all the vertices of the triangulation. Then for each boundary node b E N h fir, we let T y ( b ) , y E T ( b ) , denote a maximal set of linearly independent vectors in R" with the property that the points ( b + ~ ~ ( b ) ) , y E r ( b ) ,belong to the boundary Following the notation introduced in Section 1.2, we recall that the differential operator a, is defined by d,v(a) = Du(u)T. Then the space Xoh of (2.3.33) is given in this case by
r.
xh ; V b E Nh n r, V h ( b ) = 0, V b E N h n I', V y E T ( b ) , a s , ( b , u h ( b )
x o h = { Uh E
= 0).
(2.3.35)
We have indicated in Fig. 2.3.7 the directional derivatives which must be set equal to zero along a specific portion of the boundary of a polygonal set in RZ. In particular, one should observe that at a corner such as b*, the directional derivatives a,,u(b) and a,u(b) must necessarily vanish. If we next assume that the inclusion X h C %"(d) n HZ(fl)holds, it follows that we have the inclusions
Xoh= {uh E X h ;
uhlj-
= 0}c
~ ' (n0 )
X o o h = { ~ h ~ X h ;V h ( j - = a v ~ h = O } C H 0 2 ( f l ) ,
(2.3.36) (2.3.37)
so that we are facing the problem of constructing such spaces xoh and Xmh. Again they are obtained by canceling appropriate values and directional derivatives at boundary nodes. As an example, we have indicated in Fig. 2.3.8 all the directional derivatives which must be set b*
Fig. 2.3.1
98
INTRODUCTION TO THE FINITE EL-EMENT METHOD
[Ch. 2 , 9: 2.3.
equal to zero when Argyris triangles are used and the second inclusion (2.3.37) is needed. It should be realized that at a boundary node such as b2, the only “free” degree of freedom is d,,(b2) while all degrees of freedom are zero at a corner such as b l . We shall also record for subsequent uses (particularly in the next chapter) the following crucial properties:
(i) All finite elements of class 2.2 have the property that U €
dom n h
and
%O
and of class %’ described in Section
V ( r= 0 3 n h V E Xoh,
(2.3.38)
where the finite element space Xohis defined as in (2.2.33), or (2.3.36) for finite elements of class %I. (ii) All finite elements of class described in Section 2.2 haue the property that V
E dom n h
and
Vlr
where the finite element space
= d,V = 0 3 n h v E XOOh,
XWh
(2.3.39)
is defined as in (2.3.37).
Remark 2.3.9. It is clearly possible to extend the previous analyses SO as to include the case where boundary conditions are imposed only over a portion roof the boundary r, provided such a portion r, is exactly the union of some faces of the finite elements found in the triangulation. 0
Ch. 2 , § 2.3.1
PROPERTIES OF FINITE ELEMENTS AND SPACES
99
Final comments Remark 2.3.10. Let us briefly point out how some of the previously studied properties of finite elements and finite element spaces may be in fact derived from a single “local” property. For ease of exposition, we shall restrict ourselves to the case of Lagrange finite elements, leaving as a problem (Exercise 2.3.10) the case of Hermite finite elements. Let ( K , P, 2)be a Lagrange finite element, with X as its set of nodes, i.e., the set of degrees of freedom is of the form 2 = { p ( a ) ;a E X } . If K‘ is any face of the set K , we let
21Kf= { p ( a ) ;
uE
x nK’},
(2.3.40)
P ( K ’ )= { P I K ~K : ’ + R ; p E P}. (2.3.41) Then all the Lagrange finite elements heretofore described, with the exception of the finite element of Remark 2.3.7, have the property that f o r each one of their faces, say K ’ , the set 21K,defined in (2.3.40) is P(K’)-unisoluent, where the space P ( K ’ ) is defined in (2.3.41). This is a crucial underlying basic property, which has the following easily established consequences: (i) The PK-interpolant of a function v E dom ITK which vanishes along a face K’ is also zero along K’. As a consequence, the global property (2.3.38) holds. (ii) Let 4 : p E P + p ( a ) be any one of the degrees of freedom of the finite element and let p be the associated basis function. Then the function p vanishes along any face which does not contain the node a. From the way the basis functions of the space xh are constructed from the basis functions of the finite elements (cf. (2.3.28)), we in turn deduce the “global” property that the basis functions of the space xh have indeed small supports (FEM 3). (iii) Assume in addition that, for each pair ( K , ,K 2 ) of adjacent finite elements found in a triangulation, one has P K , ( K=~ P&, along the common face K’, and that the inclusions PK C Vo(K), K E hold. 0 Then the inclusion xh C %‘(fin) hold. In the choice of a finite element for solving a given problem, the following considerations are usually taken into account: (i) The finite element must be well adapted to the geometry of the problem. For example, assembling three-dimensional finite elements is
100
INTRODUCTION TO THE FINITE ELEMENT METHOD
[Ch. 2 , 8 2.3.
not an easy task. This is especially true for tetrahedra, so that prismatic finite elements (Remark 2.3.6) are usually preferred whenever possible. In this respect, see the discussion in ZIENKIEWICZ(1971, Chapter 6). Geometrical considerations also justify the choice of curved finite elements instead of straight finite elements in the case of “particularly curved” domains. (ii) The finite element must of course be appropriate for the problem to be solved. For conforming finite element methods, we have seen that this requires the use of finite elements of class %’ or %’. In addition, we shall see that a mathematical proof of convergence requires (among other things) the inclusions P , ( K )C P K , K E T,,,for second-order problems and the inclusions P , ( K ) C P K , K E T,,,for fourth-order problems. Incidentally, the engineers were well aware of these conditions, which they discovered empirically, long before the mathematicians arrived! (iii) Once the two previous criteria have been satisfied, it remains to obtain a linear system whose coefficients are easy to compute on the one hand and which is as easy as possible to solve on the other hand. We shall not go very far into this interesting and manifold aspect of finite element methods. However, we shall record two rules which tend to reduce certain computational difficulties: A first guideline is that, if possible, the sets of degrees of freedom associated with a given node in the triangulation be all alike, so as to avoid different instructions depending on the node. This explains why Hermite n-simplices of type (3’) may be preferred to Hermite n-simplices of type (3), or why Bell’s triangles may be preferred to Argyris triangles, even though there is in both cases a decrease of one in the order of convergence, as we shall see (in addition, such choices slightly reduce the dimension of the resulting linear system). A second guideline is that each node of the space should be common to the greatest number of finite elements. For example, the reader will easily convince himself that for a giuen triangulation, Hermite triangles of type (3) lead to a smaller linear system than triangles of type (3) (with the same order of convergence). (iv) In addition, miscellaneous questions may be considered. For instance, one may argue in the above example that the use of Hermite triangles of type (3) introduces artificial constraints (the continuity of the first derivatives at the vertices) o n the one hand, but on the other hand, this is an advantage if one needs to compute the stresses at the vertices. Likewise, one may argue that the use of Argyris triangles for solving a
Ch. 2 . 5 2.3.1
PROPERTIES OF FINITE ELEMENTS AND SPACES
101
plate problem introduces artificial constraints (the continuity of the second derivatives at the vertices and “extra” boundary conditions as shown in Fig. 2.3.8) on the one hand, but on the other hand, this is an advantage if one needs to compute the bending moments at the vertices (such moments are obtained from the second partial derivatives of the solution), etc.. . . To conclude this discussion, we shall simply emphasize the fact that, for all practical purposes, nothing replaces the numerical experience accumulated over the years by the engineers.
Exercises Let the points ai, 5s i C 8 , be as in Fig. 2.2.10. Is (p(ai), 5 s i c 8) a Q,-unisolvent set? 2.3.2. Let there be given a triangle with vertices ai, 1 C i 6 3. Among the following sets of degrees of freedom, which ones are P2-unisolvent? 2.3.1.
2
= {p(aiii), 1 c i, j c 3,
X” = { p ( a i ) , (in
i # j},
Dp(ai)(ai+, - a i ) , 1 c i c 3)
X”,the indices are counted
modulo 3). Let (k,B, 2 ) be a finite element with degrees of freedom of the form (2.3.4), and let K , P and 2 be defined through relations (2.3.11), (2.3.12), (2.3.13) and (2.3.14), with F any invertible affine mapping. (i) Show that the triple (K, P, 2)is a finite element. (ii) Is a generalization possible so as to include more general (and smooth enough) invertible mappings F? (iii) Let (kz,B,$) be an n-rectangle of type (k). Then the above process, with F affine, allows the derivation of finite elements which are parallelograms for n = 2, parallelepipeds for n = 3, etc.. . (such finite elements are seldom used in practice however). Describe the corresponding space P. 2.3.4. Are two Bell’s triangles affine-equivalent in general? 2.3.5. Let K be a triangle with vertices ai, 1 s i c 3. 2.3.3.
102
INTRODUCTION TO THE FINITE ELEMENT METHOD
[Ch.2, 8 2.3.
(i) Show that the set
2 = @ ( a i ) , 1 d i c 3 ; D p ( a i ) ( aj ai), 1 c i,i d 3 , j # i; D2p(ai)(ai- ai, ak - a i l , 1 s i, j . k c 3 , j # i,
Dp(aij)(ak- aij), 1 d i < j c 3 ,
k # i;
k # i, k # j }
is P5(K)-unisolvent. The corresponding finite element is called the Hermite triangle of type ( 5 ) . (ii) Show that this finite element differs in general from the Argyris triangle. (iii) Is it a finite element of class % I ? 2.3.6. Give a definition and a proof of the statement: “The barycentric coordinates are invariant through an invertible affine mapping”. How is this fact reflected when the basis functions of finite elements, such as the n-simplices of type ( k ) , or the Hermite triangle of type (3’), are expressed in terms of barycentric coordinates? 2.3.7. Is a finite element space xh completely specified by the data of the spaces pK,K E T h , and of the inclusion X , c (e0(d)? 2.3.8. Give a complete description of the construction of a finite element space made up of Hermite finite elements. In particular, extend condition (2.3.22) so as to include degrees of freedom which involve directional derivatives of the first and second order. 2.3.9. Let K be a triangle with vertices ai, 1 c i c 3 . In each one of the following cases, prove the P-unisolvence of the set 2 of degrees of freedom. Which finite elements are of class %’? (These finite elements have been considered by CROUZEIX & RAVIART ( 1 9 7 3 ) , who showed that they could be used for approximating the solution of the Stokes problem):
(i) P
= v{A?,
1 C i 6 3 ; AiAj, 1 C i < j
C
2 = { p ( a i ) , 1 C i C 3 ; p ( a i j ) ,1 C i < j
3 ; hlA2A3}, C
3 ; p(alz3)}.
In particular show that the inclusion P2C P holds. (ii) P
=
V { A ~ ,I c i c 3 ; 1di
d
A~A,
I c i <j s 3 ; A ? A ~ + A + ~ .
3 (mod. 3 ) } ,
2 = (p(ai), 1 d i C 3 ; p ( a i i j ) , 1 C i, j p(aX
C
3,
i.2 j ;
I =si s 3 } ,
where a ? = :(l - a ) a 1 2 3 + i ( 3 a- l)ai, 1 c i d 3 , and a is any number
Ch. 2, 8 2.4.1
GENERAL CONSIDERATIONS ON CONVERGENCE
103
which satisfies O < a < 1, a # f. In particular show that the inclusion P3 C P holds. (iii) The space P is the same as in (ii),
2 = { p ( a i j ) , 1 =z i < j
d
3; p ( a $ ) , 1 d i, j d 3 , i f j ; p ( b T ) ,
1 s i d 3},
where
a*, = ylai + y2a,, 1 6 i, j d 3 ,
i# j,
t,
(notice that the points yI, y2 are the Gaussian quadrature points of the interval [ O , I]), I-a
b? = aai + -(ai+l 2
+ ai+2),
1 s i s 3 (mod. 3),
and a is any number which satisfies 0 < a < 1, a # 3. 2.3.10. Extend the content of Remark 2.3.10 so as (i) to cover the cases of Hermite finite elements and (ii) to obtain ''local'' conditions which imply the inclusion X,, C %'(d). 2.3.21. The following finite element which resembles the Hermite triangle of type (3') has sometimes been used for solving two-dimensional problems: The set K is a triangle with vertices ai, 1 d i d 3, the space P is the space P T ( K ) , where
(obviously the inclusion P , ( K ) C P T ( K ) holds), and
2 = {p(ai), aiP(ai). d2p(ai), I
i
a},
so that this finite element is of class %'. (i) Is 2 a PT(K)-unisolvent set? (ii) Can this finite element be imbedded in an affine family?
2.4. General considerations on convergence
Convergent family of discrete problems Whereas up to now, our discussion has been concerned with one discrete problem, we shall now consider families of discrete problems.
104
INTRODUCTION TO THE FINITE ELEMENT METHOD
[Ch.2, 8 2.4.
More specifically, assume that we are approximating the solution u of the variational equations V v E V,
a(u, v ) = f ( v ) ,
(2.4.1)
where the space V, the bilinear form a ( . , .) and the linear form f satisfy the assumptions of the Lax-Milgram lemma (Theorem 1.1.3). Confining ourselves to the case of conforming finite element methods, we consider a family (Vh) of subspaces of the space V, where it is understood that the parameter h (which shall be given a specific meaning in Section 3.2) is the defining parameter of the family and has limit zero. With each finite element space vh is associated the discrete solution uh which satisfies vvh E
vh,
a(uh?vh) = f(vh).
(2.4.2)
Then we shall say that the associated family of discrete problems is convergent, or equivalently, that convergence holds, if, for any problem of the form (2.4.1) posed in the space V, one has
$3IIu - Uhll = 0, where
11.(1
(2.4.3)
denotes the norm in the space V.
Cia's lemma. First consequences. Orders of convergence We are therefore interested in giving sufficient conditions for convergence and, as a first result in this direction, we have the following basic abstract error estimate.
Theorem 2.4.1. (Cka's lemma). There exists a constant C independent upon the subspace v h such that IIU
- Uhll
c $thI(u -
UhII.
(2.4.4)
Consequently, a suficient condition for convergence is that there exists a family (vh) of subspaces of the space V such that, f o r each u E V , (2.4.5) Proof. Let wh be an arbitrary element in vh: It follows from (2.4.1) and (2.4.2) that a(u - Uk, wh) = 0. Using the same constants a,M as in (1.1.3)
Ch. 2, 8 2.4.1
GENERAL CONSIDERATIONS ON CONVERGENCE
I05
Remark 2.4.1. When the bilinear form is symmetric, there is a remarkable interpretation of the discrete solution: Since we have a ( u uh, wh) = 0 for all wh E Vh, it follows that uh is the projection over v h of the exact solution u, with respect to the inner product a ( . , -). Therefore, we have in this case a ( u - uh, u - uh) = inf a ( u - vh, u - uh). uh E v h
Using the V-ellipticity and the continuity of the bilinear form, we deduce
Thus we have obtained a “better” constant than in the proof of Theorem 2.4.1, since the constant M is necessarily larger than the constant a. 0 The simple, yet crucial, inequality (2.4.4) shows that the problem of estimating the error IIu is reduced to a problem in Approximation Theory: To evaluate the distance d ( u , vh) = inf IIu - uhl( between a function u E V and a subspace Vh C V. This explains why this problem will be a central theme of the next chapter, where we shall essentially prove results of the following type: Assuming appropriate smoothness on the function u, we shall show that the distance d ( u , vh) is itself bounded by a constant (which usually involves norms of higher order derivatives of the function u ) times ha, for some exponent p > 0. As a consequence, we have the additional information that, for a given solution u, there exists a constant C ( u ) independent of h such that I(u- uhll G C ( u ) h a .
(2.4.6)
If this is the case, we shall say that the order of convergence is p, or equivalently, that we have an O(hs) conuergence, and we shall simply write I(u - Uhll = O(hS).
(2.4.7)
106
INTRODUCTION TO THE FINITE ELEMENT METHOD
[Ch. 2.
Using more elaborated techniques, we shall also evaluate the difference ( K - K h ) in other norms, or semi-norms, than the norm of the space V (which is either the ll-ll,.n or the 11*112. R norm), such as the I.lo.n and the (*IO.m.~ norms (cf. Sections 3.2 and 3.3 respectively), and we shall also call error the corresponding norms I K - KhIO.R, I K - KhlO,m.Q, etc.. . . Whereas a mathematician is generally satisfied with a sufficient condition for convergence such as that of Theorem 2.4.1, this condition rightly appears as a philosophical matter to many an engineer, who is much more concerned in getting (even rough) estimates of the error f o r a given space vh: For practical problems, one chooses often one, sometimes two, seldom more, subspaces Vhrbut certainly not an infinite family. In other words, the parameter h never approaches zero in practice ! Nevertheless, we found it worth examining such questions of convergence because (besides providing the subject of this book.. .) (i) the problem of estimating the error for a given h (i.e., of getting a realistic estimate of the constant C ( K )which appears in inequality (2.4.6)) is at the present time not solved in a satisfactory way, and (ii) at least there is a “negative” aspect that few people contest: Presumably, a method should not be used in practice if it were impossible to mathematically prove its convergence.. . .
Bibliography and comments 2.2. The finite element method was first conceived in a paper by COURANT(1943), but the importance of this contribution was ignored at that time. Then the engineers independently re-invented the method in the early fifties: The earliest references generally quoted in the engineering literature are those of ARGYRIS(1954-1959, TURNER, CLOUGH,MARTIN& TOPP (1956). The name of the method was proposed by CLOUGH(1960). Historical accounts on the development of the method, from the engineering point of view, are given in ODEN(1972a), and ZIENKIEWICZ (1973). It is only in the sixties that mathematicians, notably MIKHLIN(1964, 1971), showed real interest in the analysis of the Galerkin and Ritz methods. Although they were not aware of the engineers contributions, it is interesting to notice that the approximate methods which they studied resembled more and more the finite element method, as exem-
Ch. 21
BIBLIOGRAPHY A N D C O M M E N T S
107
plified by the basic contributions of CEA (1964), VARCA(1966) (for the & VARGA(1968) (for the one-dimensional case), BIRKHOFF,SCHULTZ multidimensional - but still tensor-product like - case). Then the outbreak came with the paper of ZLAMAL (1968), which is generally regarded as the first mathematical error analysis of the “general” finite element method as we know it to-day. 2.2 and 2.3. The finite elements which are described in these sections can be found in the book of ZIENKIEWICZ(1971), where they are sometimes given different names. In this respect, the reader who wishes to look into the Engineering literature may consult the following table, which lists a few correspondences. N a m e given in this book
N a m e given in Zienkiewicz’ book
Triangle or tetrahedron of type (I), (3) Rectangle of type (l), (2). (3) Rectangle of type (T), (3’)
Linear, quadratic, cubic triangle or tetrahedron Linear, quadratic, cubic rectangle Quadratic, cubic rectangle of the serendipity family right prism or rectangular prism area or volume co-ordinates shape functions
3-rec tangle barycentric coordinates basis functions
Regarding the attribution of names to finite elements, we have tried to follow the most common usages. In particular, Courant’s triangle is named after COURANT (1943). The rectangles of type (2’) and (3’) are also called serendipity finite elements, because their discovery required some ingenuity indeed! Other examples of serendipity finite elements may be found in ZIENKIEWICZ (1971, p. 108, p. 121, p. 126), particularly for n = 3. We mention that ZLAMAL (1973d) has given an interesting alternate approach for such serendipity finite elements. The Zienkiewicz triangle is named after BAZELEY, CHEUNG,IRONS& ZIENKIEWICZ (1965). The Argyris triangle is named after ARGYRIS,FRIED& SCHARPF (1968), while Bell’s triangle is named after BELL (1969). Although these last two finite elements have appeared in these and several other publications around 1968-1969 (cf. the references given in ZIENKIEWICZ (1971, p. 209)), it was recently brought to the author’s attention that they should also be attributed to FELIPPA (1966), where they appeared for the first time.
108
INTRODUCTION TO THE FINITE ELEMENT METHOD
[Ch. 2.
For the numerical handling of the Argyris triangle (derivation of the basis functions, e t c . . .), the reader is referred to ARGYRIS,FRIED& SCHARPF (1968). See also THOMASSET(1974). Finally the Bogner-FoxSchmit rectangle is named after BOGNER,Fox & SCHMIT (1965). We also note that Theorem 3 of ZLAMAL(1968) yields an alternate proof of Theorem 2.2.1 1. Whereas it is fairly easy to conceive finite element spaces contained in the construction of finite element spaces contained in %‘(6) is less obvious, as shown by the last three examples of Section 2.2 (and also by additional examples that will be seen in Section 6.1). In this direction, see the discussion in ZIENKIEWICZ (1971, Section 10.3), whose heuristic considerations have been recently justified by a beautiful result ofiENfSEK (1973, 1974), who has proved the fOllOWing: Let n = 2, let xh be a finite element space for which all finite elements K are triangles, and for which the spaces PK are spaces of polynomials, i.e., there exists some integer 1 such that the inclusions PK C P , ( K ) hold for all K E yh (therefore finite elements of class %’ using “singular functions”, or of “composite” type, as described in Section 6.1 are excluded from the present analysis). Then for any integer m 3 0, the inclusion xh c %“‘(d) implies that, at each vertex b of the triangulation, the linear forms uh + d ” u h ( b ) are degrees of freedom of the space Xh for all la1 d 2m. As a corollary, the inequality I 2 4m + 1 holds (the proof of the corollary is simple, but the proof of the first result is by no means trivial). Thus for instance the particular choice m = 1 shows that Bell’s triangle is the optimal finite element for fourth-order problems inasmuch as the dimension of its space P X K ) is the smallest possible, at least for conforming finite element methods using piecewise polynomial spaces. ~ E N ~ S (1972) E K has also extended his results to the case of higher dimensions, and there has been recently substantial interest in the study of the properties of finite element spaces whose functions are piecewise polynomials and which are contained in %“‘(6). In this respect, we mention BARNHILL& GREGORY(1975b), DELEZE & GOEL (1976), MORGAN& SCOTT(1975, 1976), SCOTT (1974), STRANG (1973, 1974a). There is a large literature on the various aspects of the numerical implementation of the finite element method. We shall quote here only a few papers: BIRKHOFF& FIX(1974), BOISSERIE& PLANCHARD (19711, BOSSAVIT(1973), BOSSAVIT& FREMOND (1976), DESCLOUX(1972a, 1972b), FIX& LARSEN (1971), FRIED(1971a, 1973a, 1973b), FREMOND (1974), GOEL (1968a, 1968b). We also mention BRAUCHLI & ODEN(1971),
%‘(a),
Ch. 21
BIBLIOGRAPHY A N D COMMENTS
109
ODEN (1973a), ODEN & REDDY (1976a, Section 6.5) for the “conjugate basis functions” approach. The paper of FELIPPA & CLOUGH(1970) is a nice blend of mathematical analysis and practical aspects. Finally, we mention that the definition of a finite element as a triple (K, P, 2)is due to CIARLET(1975). 2.4. Cea’s lemma (Theorem 2.4.1) appeared in C E A (1964, Proposition 3.1) in the case of a symmetric bilinear form. It was independently rediscovered by VARGA(1966), and extended to the nonsymmetric case in BIRKHOFF,SCHULTZ & VARGA(1968, Theorem 13).
CHAPTER
3
CONFORMING FINITE ELEMENT METHODS FOR SECOND-ORDER PROBLEMS
Introduction
In this chapter, we consider the problem of determining estimates in various norms of the difference ( u - U h ) , where u E V is the solution of a second-order boundary value problem and uh E v h is the discrete solution obtained in a subspace vh of V . From CCa’s lemma (Theorem 2.4. l), the best error estimate would result in exhibiting the element &,u E vh which is such that inf u h E V h IIu - U , , ( I ~ . ~ = IIu - &,UllI,R, i.e., the projection of the solution u on the space V,. However, such a projection is not particularly easy to work with, and it turns out that it is much more convenient to use the Xh-interpolant n h u of the solution u, so that we shall get instead the error estimate
cllu - nh UII1.R.
- uhl1l.R
Since we shall assume in this chapter that the set d is polygonal, it can be written as a union fi = K e y h K of polygonal finite elements K , such as the ones which have been heretofore described. This in turn implies that the corresponding spaces v h will be contained in the space V (the domains of definition of their functions are identical), i.e., that the corresponding finite element method is indeed conforming. Taking into account that we are using the norm II-II1.~and that ( n h u ) ( K = nK u for all K E % (Theorem ‘, 2.3.2), we can write
u
1.
-n h ulIl,R =
I I2
(
IIu - n K ull:.fC) . K€yh
Therefore, the problem o f finding an estimate f o r the error ((u- UhI(I.R is reduced t o the problem o f evaluating quantities such as IIu - DKu I I ~ , K and the solution of such “local” interpolation problems is the object of Section 3.1. In view of other future needs, we shall in fact estimate the difference ( u - 17, u ) with respect to more general norms and seminorms. I10
Ch. 3.1
111
INTRODUCTION
A typical - and crucial - result in this direction is that, for a finite element ( K , P K , Z K )which can be imbedded in an afine family and whose PK-interpolation operator leaves invariant the polynomials of degree d k (equivalently, the inclusions P k ( K )C PK hold), there exists a constant C independent of K such that
where
hK = diameter of K, pK = supremum of the diameters of the spheres inscribed in K. Such a result is proved (in a more general form) in Theorem 3.1.5. One key idea in the process of getting such estimates is to go from any finite element K of an affine family to the reference finite element of the family and then back to the finite element K. Another key is to use a basic result about Sobolev spaces. due to J. Deny and J.L. Lions, which pervades the tnathematical analysis of the finite element method: Over the quotient space Hk"(L2)/Pk(L2), the semi-norm ( * l k + l , R is a norm equivalent to the quotient norm. This result is proved in Theorem 3.1.1, for the more general Soboleu spaces W ,.P( 0). In practice, one often considers a regular family of finite elements, in the sense that the diameters hK approach zero, and that there exists a constant (T independent of K such that hK s a p ~ For . such a regular family, the previous interpolation error estimate becomes (Theorem 3.1.6)
IU
- UKv
I,.K
= O(hP'-,),
06m s k
+ 1.
Using CCa's lemma, we obtain in Section 3.2 the error estimates (Theorem 3.2.2). (Iu - Uh((1.Rs C ( ( u- IZI,u I I ~ . R
=
O ( h k ) , with h
=
pz$ hK,
under basically the same assumptions as before about the family of finite elements which make up the finite element spaces. It is worth mentioning here that, although the above error estimate is not the best, it is generally possible to show that the order of convergence is the best possible: In other words, it would not be improved by replacing n h u by ehu.
112
CONFORMING FINITE E L E M E N T METHODS
[Ch. 3, 8 3.1.
Nevertheless the range of applicability of the above results is limited inasmuch as the Xh-interpolant of the solution u is defined only if some smoothness is assumed on the solution u, and likewise, the above error estimates are obtained provided the solution is sufficiently smooth ( u E H k + ' ( 0 ) )Fortunately, . we show in Theorem 3.2.3 that, with the minimal assumptions that the solution u is in the space H ' ( O ) and that the spaces PK contain the space P , ( K ) , K E y h , convergence still holds, i.e., one has limh4 JIu - uhl1I.R = 0. Next, using a method due to J.P. Aubin and J.A. Nitsche (cf. the Aubin-Nitsche lemma; Theorem 3.2.4), we show that there is in most cases an improvement in the error estimate in the norm l-lO.R in the sense that (Theorem 3.2.5)
Section 3.2 ends up with the so-called inverse inequalities (Theorem 3.2.6). Finally, in Section 3.3, we follow the penetrating method o f weighted norms o f J.A. Nitsche, who has recently shown that, if u E Wk+'."(0),
1' - 'hIO.m.R=
O(h2-') for any E > O (O(hk+l)
if k = 1, if k 3 2 ,
where I ~ ~ O . m and ,R ~ ~ ~ ~ stand ~ l , for m , the ~ norms of the spaces L"(O) and W',"(O),respectively. Restricting ourselves for brevity to the case k = 1, the corresponding error estimates are obtained in Theorem 3.3.7. It is worth pointing out that all the error estimates found in Section 3.2 and 3.3 are optimal in the sense that, with the same regularity assumptions on the function u, one gets the same asymptotic estimates (or "almost" the same for the norms I.lO,m,R and Il-l l.m,n when k = 1) when the discrete solution u h E v h is replaced by the Xh-interpolant n h u E vh.
3.1. Interpolation theory in Sobolev spaces
The Sobolev spaces W m s p ( 0The ) . quotient space W k + l ' P ( 0 ) / P k ( f l ) We shall consider the Soboleu space W m . p ( 0which, ) for any integer m 3 0 , and any number p satisfying 1 S p S m , consists of those func-
Ch. 3, 5 3.1.1
INTERPOLATION THEORY IN SOBOLEV SPACES
113
tions u E L p ( R )for which all partial derivatives 8% (in the distribution sense) with IaI d m belong to the space L P ( R ) Equipped . with the norm
1 1
(IUJJ,,,,~,~ =(
laaulp dx)'",
if 1
P < 00,
(3.1.1)
lalsrn
IIUllrn.m,n = max {ess.sup laau(x)l} XER
if p = Q),
laldm
the space W m * p ( R is)a Banach space. We shall also use the semi-norms
(,F
jRlilLIuIpdx)'",
JVJ,,,~.~=
LI
if 1 S p
(Q),
=m
lUlm.m.n=
(3.1.2) {esze%upI ~ Q U ( ~ ) I ] if P
= 00.
The Soboleu space WCp(R)is the closure of the space 9 ( R ) in the space W m V p ( R ) . Given a subset A of R" and given a function u E %"(A), the notation I ~ ~ ~ l m . mand ,A 1Vlrn.m.A will also denote the norm maxl,lsm supxEA laau(x)l and the semi-norm maxlol=m supxEA la"u(x)l, respectively. Notice that
wm*2(n) = H"(R), ll-llm.~.R = ll*llm.~,
W,m**(R)= H,m(R),
1.lm.Z.R
= I*lm.R-
As usual, the open sets R that will be considered in this section will be assumed to have a Lipschitz-continuous boundary. In addition they will be assumed to be connected when needed (this assumption is used in the proof of Theorem 3.1.1). In view of future needs, we shall record here some basic properties of the Sobolev spaces that will be often used. In what follows, the notation X 4 Y indicates that the normed linear space X is contained in the no;med linear space Y with a continuous injection, and the notation x C Y indicates in addition the compactness of the injection. Finally, for any integer m 2 0 and any number a €10. I], %"'.u(fi) denotes the space of all functions in cern(fi)whose m-th derivatives satisfy a Holder's condition with exponent a. Equipped with the norm
where 11.11 denotes the Euclidean norm in R", the space (ern,"(fi)is a Banach space.
I I4
CONFORMING FINITE ELEMENT METHODS
[Ch. 3, 5 3.1.
By the Soboleu's imbedding theorems. the following inclusions hold, for all integers m 2 0 and all I c p c 03,
W r n @ ( RL) p* 4 (0) with
-P1_* -
1 rn --P n'
n if m <-, P
By the Kondrasov theorems, the compact injections C
W"'."(R) C L q ( R ) for all
1 s q
n if -< m , P
hold for all 1 C p
C m.
The compact injection
t
H ' ( R ) LZ(R) (i.e., the special case p = q = 2) is known as the Rellich theorem. Of course, analogous inclusion can be derived by "translating" the orders of derivations. Thus for instance, one has Wrn'""(R)4 W r * p * ( R ) if rn <:, etc.. . We also note that, for 1 zs p < 00, one has
(V(d))-= W"-"(R). Remark 3.1.1. The assumption that the boundary is Lipschitz-continuous is not always necessary for proving the above pcroperties. For example, one can derive the compact inclusion W'vp(f2)C L q ( R )for all 1 S q S p , or the above density property, as long as the boundary of R is continuous and the set R is bounded, etc.. . 0
Ch. 3, 5 3.1.)
INTERPOLATION THEORY IN SOBOLEV SPACES
115
Since an open set 0 with a Lipschitz-continuous boundary is bounded, it makes sense to consider the quotient space W k + l . P ( f 2 ) / P k ( 0 ) . This space is a Banach space when it is equipped with the quotient norm
where
u = {w E Wk+lJyR); (w - v ) E Pk(R)}
(3.1.6)
denotes the equivalence class of the element v E Wk+13p(0). Then the mapping
fi E W k + l . p ( a ) / P k ( O+ ) 1c1k+l.p.R
I
(3.1.7)
= vl k+l.p.R
is a priori only a semi-norm on the quotient space Wk+I'P(fl)/Pk(a)r which satisfies the inequality
vzj E Wk'1.P(a)lPk(a),
Iulk+l.p.Rs
(3.1.8)
IldlIk+l,p.O
(to see this, observe that, for any polynomial p E Pk(R), IIv
+Pllk+l.p,R=
(Ivlf+l.p.R+Ilv
+pl(f.p.O)l'P
a Ivlk+l.p.R,
with the standard modification for p = 00). It is a fundamental result that it is in fact a norm over the quotient space, equivalent to the quotient norm ( 3 . 1 3 , as we now prove (cf. Exercise 3.1.1 for a generalization).
Proof. Let N =dim Pk(R) and let f i , 1 S is N, be a basis of the dual space of Pk(R). Using the Hahn-Banach extension theorem, there exist ) , denoted f i , 1 s continuous linear forms over the space W k + ' 3 p ( 0again i s N , such that for any p E P k ( 0 ) ,we have f i ( p )= 0, 1 s i s N, if and only if p = 0. We will show that there exists a constant C(R) such that
vv wk'''p(a), IblIk+l.p.Rs
N
2
C ( f l ) ( l c ! k + i . p . R + i = l I.fi(U)l).
(3.1.11)
116
[Ch. 3. § 3.1.
CONFORMING FINITE ELEMENT METHODS
Inequality (3.1.9) will then be a consequence of inequality (3.1.1 1): Given any function u E Wk''@(f2),let q E Pk(f2) be such that f i ( u + q ) = = 0, 1 s is N. Then, by (3.1.11), inf
PGPk(0)
Ib + P l l k + l . p . R ~Ib + q l l k + l . p . R ~C ( f 2 ) l ~ l k + l . p . R I
which proves (3.1.9). If inequality (3.1.11) is false, there exists a sequence ( U I ) T = ~of functions uI E Wk+'3P(f2), such that N
1,
1,
lIUillk+l.p.R=
and
\k(Iuilk+I,p,n+C
i= I I f i ( U l ) l ) = o .
(3.1.12)
Since the sequence ( u I ) is bounded in Wk+lVp(f2), there exists a subsequence, again denoted (q),and a function u E Wk*p(f2),such that
yz lbl -
uIIk,p.R
(3.1.13)
=0
(this follows from the Kondrasov or Rellich theorems for 1 zs p < 00 and from Ascoli's Theorem for p = a).Since, by (3.1.12),
V i
Iullk+l,p,R=
(3.1.14)
0,
and since the space Wk+l.p(f2)is complete, we conclude from (3.1.13) and (3.1.14) that the sequence ( u I ) converges in the space Wk+l.p(f2). The limit u of this sequence is such that Va
with
la( = k
+ 1,
J~"U(~,~,l , =i i (d"ul(o,p,n=0,
and thus 8% = 0 for all multi-index a with la1 = k + 1 . With the connectedness of 0,it follows from distribution theory that the function u is a polynomial of degree d k. Using (3.1.12), we have fi(u)=
fi(Vl)
= 0,
so that we conclude that u = 0, from the properties of the linear forms f i . But this contradicts the equality ~ ~ u l ~ ~ k=+ l1, for p , R all 1. 0
Error estimates f o r polynomial preserving operators Our main objective in this section is to estimate the interpolation errors Iu - IZK Ulm,q.k and IIu - nK~ll,,,,~,~, where IZK is the PK-interpolation operator associated with some finite element. At other places, however,
Ch. 3, 5 3.1.1
INTERPOLATION THEORY IN SOBOLEV SPACES
117
we shall need similar estimates, but for more general polynomial preserving operators, i.e., not necessarily of interpolation type. This is why we shall develop an approximation theory valid also for such general operators. To begin with, we need a definition: We shall say that two open subsets 0 and h of R" are afine-equivalent if there exists an invertible affine mapping
F : f E R"+ F(f)= Bf
+ b E R"
(3.1.15)
such that
0 = F(&).
(3.1.16)
As in the case of affine-equivalent finite elements (compare with (2.3.16)-(2.3.17)), we shall use the correspondences f E h + X = F(f)E 0,
(3.1.17) (3.1.18)
h + R ) + ( v = I? F ' :0 +R), between the points f E h and x E R, and between functions defined over the set h and the set 0.Notice that we have (I?:
I?(f) = u(x)
*
(3.1.19)
for all points f, x in the correspondence (3.1.17) and all functions I?, u in the correspondence (3.1.18). Remark 3.1.2. In case the functions u and I? are defined only almost everywhere (as in the next theorem for instance), it is understood that relation (3.1.19) is to hold for almost all points f E h, and thus for almost all points x E 0. 0 We need to know how the Sobolev semi-norms defined in (3.1.2) behave from an open set to an affine-equivalent one. This is the object of the next theorem. Here and subsequently, 11.11 stands for both the Euclidean norm in R" and the associated matrix norm. Theorem 3.1.2. Let R and & be two afine-equivalent open subsets of R". If a function u belongs to the space W m . " ( 0for ) some integer m 2 0 and some number p E [ l , 001, the function ii = u . F belongs to the space
1 I8
[Ch. 3, 0 3.1.
CONFORMING FINITE ELEMENT METHODS
WmSp(fi), and in addition, there exists a constant C = C ( m , n ) such that Vu E wmo(O),( G l r n , p , f i C CllBII" Jdet(B)I-"PIuIrn,p.n,
(3.1.20)
where B is the matrix occurring in the mapping F of (3.1.15). Analogously, one has VG E W " W h
(uI
m . p . ~C
CIIB-'ll"(det(B)I''P~G~ m.p.fi.
(3.1.21)
Proof. (i) Let us first assume that the function u belongs to the space %'"(fi), so that the function G belongs to the space %'"(d). Since, for any multi-index a with JaI= in, one has
a a G ( P ) = D";(P)(ea,,e,, . . . ,earn), where the vectors eai, 1 s i s m, are some of the basis vectors of R", we deduce that
laafi(a)ld IIDmG(a)ll= 1SUP lDm;(P)(81,527 . 1611~
*
s.9
Zm)l.
1
Ihism
Consequently we obtain
(3.1.22)
where the constant Cl(m,n) may be chosen as C d m , n ) = sup (card{@E N"; IaJ= m})"P. Ihp
(3.1.23)
Ch. 3, 5 3.1.1
119
INTERPOLATION THEORY IN SOBOLEV SPACES
Using the formula of change of variables in multiple integrals, we get
I
Id
I(D"u(F(3))JJP d i = Jdet(B-')J
R
IlD"u(x)llp dx.
(3.1.24)
Since there exists a constant C2(m,n) such that
IlD"v(x)lI
s Cdm, n) max b"u(x)(, la(=m
we obtain
(~RIID"~(X)IJPdx)'"
s G ( m ,n ) I u I m , p , R .
(3.1.25)
Inequality (3.1.20) is then a consequence of inequalities (3.1.22), (3.1.23), (3.1.24) and (3.1.25). (ii) To complete the proof when p # 03, it remains to use the continuity of the linear operator I : u € C"(d)+ 5 € W"."(h)with respect to in the the norms II.IIm.p.~ and II.IIm,p.nrthe denseness of the space %"(d) ) , the definition of the (unique) extension of the space W m v p ( Rand mapping I to the space W m * p ( R ) . (iii) Let us finally consider the case p = 03. A function u E Wm*"(R) belongs to the spaces W m s ( R )for all p < w (recall that the assumption of Lipschitz-continuity of the boundary implies the boundedness of the set 0). Therefore, by part (ii), the function 5 belongs to the spaces W m @ ( hfor ) all p < CQ, and there exists a constant C ( m ,n ) such that V a EN",
v p 3 1, Iaa510.p.d
(a14 m,
s I5Ilml.p.d s ~ ( m~)IIBIII~' , SUP Idet(B)I-"PIIuIJm.p.R. I' P
Since the upper bound on the semi-norm la"uI0.,i, is independent of the number p, this shows that, for each la1 S rn, the function aa5 is in the space L"(0)for each l a l s m . Consequently, the function 5 belongs to the space W"."(h).To conclude, it suffices to use inequality (3.1.21) for all p 3 1 in conjunction with the property that for any function w € L"(R), R bounded, one has Iwl0.m.n =
FE Iwl0.p.n.
Inequality (3.1.21) is proved in a similar fashion. To apply Theorem 3.1.2, it is desirable to evaluate the norms 11l311 and
120
[Ch. 3,
CONFORMING FINITE ELEMENT METHODS
P 3.1.
llB-'ll in terms of simple geometric quantities. This is the object of the next theorem, where we use the following notations: h = diam(R), h^ = diam(fi), p = sup{diam(S); S is a ball contained in
I
R},
6 = sup(diam(3); 3 is a ball contained in d!}.
(3.1.26) (3.1.27)
Theorem 3.1.3. Let d! and R = F ( d ) be two afine-equivalent open subsets of R", where F : f E R"+ (B2+ b ) E R" is an invertible afine mapping. Then the upper bounds
hold. Proof. We may write
Fig. 3.1.1
Ch. 3, 5 3.1.1
121
INTERPOLATION THEORY IN SOBOLEV SPACES
-
Given a vector 6 satisfying ll[ll= p, there exist two points 9, f E h such that 9 - i = 6, by definition of 6 (Fig. 3.1.1). Since B t = F ( 9 )- F ( 2 ) with F ( j ) E f ? ,F ( i ) € f ? , we deduce that IlBSllC h, and thus the first inequality (3.1.28) is proved. The other inequality is proved in a similar fashion. 0 We are now in a position to prove an important property of p o l y nomial preserving operators, i.e., which satisfy a relation of the form (3.1.30) below for some integer k b 0.
Theorem 3.1.4. For some integers k 0 and m b 0 and some numbers p , q E [ l , 001, let W'+'@(fi) and W m V q ( be f i )Sobolev spaces satisfying the inclusion Wk+I.P(fi) 4
and let
(3.1.29)
Wm.q(fi),
fi E 2(Wk+I*'(fi);
W m * q ( f ibe ) ) a mapping such that
vg E Pk(fi), fig
= B.
(3.1.30)
For any open set R which is afine-equivalent to the set mapping Il, be defined by
(n,u y = fi;,
fi, let
the
(3.1.31)
for all functions 6 E Wk+'Vp(fi) and u E Wk",P(R)in the correspondence (3.1.18). Then there exists a constant C(fi,fi) such that, f o r all afineequivalent sets R,
(3.1.32)
with h and p defined as in (3.1.26) and (3.1.27) respectively. Proof.
Using the polynomial invariance (3.1.30), we obtain the identity V; E Wk+l.p (fib vg E Pk(fi), ii - fi;
= (I -
fi)(ii+ B ) ,
where I, the identity mapping from W k + ' . p ( finto i ) W m . q ( f i )is, con-
122
[Ch. 3, 8 3.1.
CONFORMING FINITE ELEMENT METHODS
tinuous by (3.1.29). From this identity we deduce that
;1 - fifilm,q.ns I ~ -z
fillp(W~+l.P(n):Wm.q(n))
inf
bEPk(h)
1(; + B l l k + l , p . n
c C(fi, f m l k + l . p . n 9
(3.1.33)
by Theorem 3.1.1. It follows from relation (3.1.31) that 0 -fie
=(v -n n v y ,
and therefore an application of Theorem 3.1.2 yields Iv
-
d
CIIB-lllmldet(B)l"ql;- f i 6 l m . q . n .
(3.1.34)
By the same theorem,
I; I k+i.p,n s CIIBII'"Idet(B)I-"pIvI
k+i,p,n,
(3.1.35)
and thus, to obtain inequality (3.1.32), it suffices to combine inequalities (3.1.33), (3.1.34) and (3.1.35), the upper bounds llBll s h/6 and llB-llld &/P (Theorem 3.1.3), and, finally, to observe that meas(0) Jdet(B)(= 7 meas( )
Estimates of the interpolation errors Iv - Z I K finite elements
0 vI,,,,~,K
for afine families of
By specializing the above result to finite elements, we obtain estimates of the interpolation errors Iv - I Z K u ~ ~ . ~(for , K another approach, see Exercise 3.1.2; for a refined analysis of the dependence upon the geometry, see Exercise 3.1.4).
Theorem 3.1.5. Let (K, P, f ) be a finite element, f o r which s denotes the greatest order o f partial derivatives occurring in the definition of %.Zf the following inclusions hold, for some integers m 2 0 and k 3 0 and f o r some numbers p . q E [ l , 031, Wk+l.P(lZ) 4
%"(rz),
(3.1.36)
Wk+IJqlZ)4 W".'(K),
(3.1.37)
Pk(R) c B
(3.1.38)
c W"*"K),
there exists a constant C(K,P,%)such that, f o r all afine-equivalent
Ch. 3, 8 3.1.1
123
INTERPOLATION THEORY IN SOBOLEV SPACES
finite elements ( K , P, S), and all functions u E W k + ' . " ( K ) ,
IU
k+l
uI,,~,K
s C ( k ,P, ~)(meas(K))'"q'-'"P'hKm
- ZIK
lUlk+l.p.K*
PK
(3.1.39) where ZIK u denotes the PK-interpolant of the function u, and meas(l0 = dx - measure of K , hK = diam ( K ) , p~ = sup {diam(S);S is a ball contained in K } .
(3.1.40)
Proof. The inclusion P k ( k )C $ in conjunction with the fact that the $-interpolation operator fi reduces to the identity over the space $ (cf. (2.3.8)) implies that
vfi E P k ( k ) ,
fifi
= $.
(3.1.41)
Let then 6 be a function in the space W k + ' * p ( Eso ) , that it belongs to the space dom fi = W(k) (cf. (2.3.7)) since the inclusion W k + " * p C (k) %'(k) holds. For definiteness, let us assume that s = 2 (recall that in practice, s = 0, 1 or 2) so that the $-interpolant of the function 3 takes the form
(3.1.42) We proceed to show that the linear mapping fi: W k + ' , p ( k ) -W , mVq(k) (by (3.1.38), the space is contained in the space W m * q ( k )is) continuous: From (3.1.42), we deduce that IIfifillm,q.g
Q
C I;<6p>t
IIfiPIIm,q.g+
3I{o~(~i')ii'k)t
IIfii4Im.q.g
where in the last inequality, we have made use of the inclusion (3.1.36). Since the P K - and $-interpolation operators are related through the
124
[Ch. 3, § 3.1.
CONFORMING FINITE E L E M E N T METHODS
correspondence
( n K v ) ^= fifi
for all
u E dom 17,
(cf. (2.3.19)), we may apply Theorem 3.1.4, and inequality (3.1.39) is just a re-statement of inequality (3.1.32) in the present case. 0
Remark 3.1.3. If necessary, the factor (meas(K))(”q)-(’’P) may also be expressed in terms of the parameters hK and pK by means of the inequalities a . p L S meas(K) s g,,h;,
where
(T,,
denotes the dx-measure of the unit sphere in R”.
0
It is possible to dispose of the parameter pK in the upper bound (3.1.39) provided we restrict ourselves to finite elements which do not become “flat” in the limit, as we shall show (Theorem 3.1.6). First, we need a definition, of a purely geometrical nature. We shall say that a family of finite elements (K,PK,XK)is regular if the following two conditions are satisfied: (i) There exists a constant (T such that (3.1.43) (see Exercise 3.1.3 for an equivalent formulation of this condition for triangles). (ii) The diameters hK approach zero (in order to avoid introducing new letters, K is viewed as the parameter of the family). For such families, the interpolation error estimate of Theorem 3.1.5 can be immediately converted into simple estimates of the norms (Iu - n K vlIrn.q,K.
Theorem 3.1.6. Let there be given a regular afine family of finite B, 2) satisfies elements (K, PK, ZK) whose reference finite element (K, assumptions (3.1.36), (3.1.37) and (3.1.38). Then there exists a constant C(K, such that, f o r all finite elements K in the family, and all functions u E W‘+’.’’(K),
$,e)
IIu
-
n~~ l l , , , , ~ S. ~ C(K, P, ~)(meas(K))(”q)-(”P)hkc’-rn Ivlk+l.p.K. K
(3.1.44)
0
Ch. 3. 9: 3.1.)
125
INTERPOLATION THEORY IN SOBOLEV SPACES
Remark 3.1.4. Only the boundedness of the diameters h~ (implied by 0 condition (ii)) is used in the derivation of the upper bound (3.1.44). In order to get a more concrete understanding of such estimates, we have recorded in the next table (Fig. 3.1.2) some interpolation error estimates in the Il.llm.K norms ( p = q = 2) for various finite elements which can be imbedded in affine families.
Remark 3.1.5.
If the function u lacks the “optimal” regularity, interort12, ’”)
v -IIKVI,”
K
0
m - 2
(k
1)
~
~
Regularity of the function v
Upper bound on the dimension n, (to insure that HK”(K) f/”(K))
H4 I K i
H2(KI
n
Is
~
3
I1
0)
/s
~
5
I1 ’
0)
js
3 ~
1)
v
Simplicia1 finite elements
v 5
Rectangular finite elements
TJ Fig. 3.1.2
1 11‘
Is
=
3 2)
126
[Ch. 3, 5 3.1.
CONFORMING FINITE ELEMENT METHODS
polation error estimates may still hold provided the PK-interpolant is still defined, with smaller values of k, however. If we are considering Hermite triangles of type (3) for instance, if the function u is “only” in the space H ’ ( K ) and if n s 3, one has IIu - nKull,,,.~= O(hi-“‘) for 0 d m d 3, and so on.. . 0
Remark 3.1.6. Further conditions may be added in the definition of a regular family made up of a specific finite element. For example, this will be the case for the isoparametric n-simplex of type (2) (cf. Section 4.3) and the Hsieh-Clough-Tocher triangle (cf. Section 6.1).
Exercises 3.1.1. The following abstract generalization of both Theorems 3.1.1 and 3.1.4 is due to L. TARTAR (unpublished) and can be found in BREZZI& MARINI(1975). Let V be a Banach space and let V1, Vz and W be three normed vector spaces. Let Ai E 2’(V; Vi),i = 1,2, be two given mappings, the mapping A l being compact. It is assumed that there exists a constant co such that
vu E v,
llullv s co(llAIUllv, + llA*vllv*).
Finally, let L E 6p( V ; W) be a mapping such that u E ker A 2 j Lu = 0.
(i) Show that the space P = ker A2 is finite-dimensional. (ii) Show that there exists a constant cI such that Vu E V,
$fpIJu - P [ ~ V =S C I I I A ~ ~ I I V ~ .
(iii) Deduce from (ii) that there exists a constant C such that vu E V,
IILuIIw
CllA2~lIv,.
(iv) Let (for simplicity only, we restrict ourselves to p k + 1)
= q = 2,
rn
=
v = w = Hk+l(fl), VI = Hk(fl), A l = 1, Vz = (L2(0))rk+l, A2: u E Hk+l(fl)~(~a~)~,~=k+~,
Ch. 3.
5 3.1.1
where
INTERPOLATION THEORY IN SOBOLEV SPACES
127
rk+l= card{a E N";(a1= k + 1) and the mapping L is given by L : u E H k + ' ( 0 ) + ( u -nu)E H k + ' ( O ) ,
where the mapping Il E 2 ( H k + l ( 0 ) is ) such that VP E M O ) , n p
= p.
Then derive a n inequality similar to that of (3.1.33) (we could as well let VI = L 2 ( 0 ) ;see below). (v) Let
v = w = Hk"(O), VI = L 2 ( 0 ) , A , = I, V2 = (L2(0))", A2: u E H k + l ( 0 ) +{ D k + l u ( - ) ( e ~ + " E)(} ~ ~='l( n ) ) " , L : 2, E H k + ' ( O ) + ( u -nu)E H k + " ( 0 ) , where the mapping
E 9 ( H k + ' ( 0is ) )such that
VP E Qk(n), n p = P *
Then show that there exists a constant C ( n ,0) such that IIU
- nuIlk+l.a
an,0 ) [ U I k + l , R ,
where
[Hint: Use the following result due to N. Aronszajn and K.T. Smith, and proved in SMITH (1961): There exists a constant C such that Vu E wrn."(O), I I ~ l l r n , p , nC(1uIo.p.n ~ + [vIrn.p.n),
where
3.1.2. Let ( K , P K , S K )be a Lagrange finite element such that the inclusions
pk(K)c PK
c qk(K)
hold f o r some integer k, and let there be given a function u : K +R which
128
[Ch. 3, 5 3.1.
CONFORMING FINITE ELEMENT METHODS
will be assumed to be sufficiently smooth for all subsequent purposes. For any integer m SO, we let Iu1m.m.K
= SUP IIDmU(x)ll9,,,(Rn:R) xEK
(we recall that there exists a constant C ( m , n ) such that
s Iulm,m.K s C ( m ,n ) l U l m . m . d . and x are two points in the set K (assumed here to be convex), 1ulm.m.K
If a Taylor's formula of order k reads
1
u ( a )= u ( x ) + Du(x)(a- x) + . . . + - D k u ( x ) ( a
k!
- X)k
+
+ % k ( U ; a, x), where the remainder % ! k ( u ;a, x ) is given by I
(1 - t ) k D k + ' U ( t U
+ (1 - t ) X ) ( a - X ) k + l dt
In fact, we shall only need the estimates %k(u;
1
a, x)l s ___ ( k + I)!
lulk+l.-.Kb
- Xllk+l
which follow from either expression of the remainder. (i) Let p i , 1 d i S N, be the basis functions associated with the set 2~ = { p ( a i ) . 1 =S i s N}. Show that, for all x E K (CIARLET& RAVIART (1972a)). N ~ ' " ( UV K - U ) ( X ) = %!k(u; ai, x ) D " p i ( X ) , 0 s m k.
2 r=l
Notice that for m = 0 , one obtains a multi-point Taylor formula (CIARLET& WACSCHAL(1971)):
(ii) Let (K,F,$) be an affine-equivalent finite element. Show that (with the usual notations) hpl 1. - U K u 1m.m.K c ( g ,F, 2)7.1 lk+i.m,K, 0 s m s k , PK
Ch. 3, 8 3.1.1
INTERPOLATION THEORY IN SOBOLEV SPACES
129
where
Thus, this yields an estimate of the constant which appears in (3.1.39) when p = q = 00. (iii) In the sequel, p is any number which satisfies 1 d p d m and k + 1 > ( n l p ) , so that the inclusion Wk+l,p(K)G%o(K) holds. Show that I%k(U;
a, * ) ( O , p , K
(
1
k! k+l--
);
hFllU(k+l,p.K~
for all a E K. (iv) Deduce from (iii) that
(v) Assume that K is an n-simplex and that the basis functions p i are expressed uniquely in terms of the barycentric coordinates (in this respect, cf. also Exercise 2.3.6):
i s N,
P i ( X ) = f i ( A l ( X ) , . . . A ~ + I ( x ) ) ,1 9
where the (smooth) functions f i are independent of ( K , P K ,Z K ) . Then show that ( A R C A N G ~& L IGOUT (1976))
1
I U - ~ K ~ ~ , , , ,c ~( K , K, B~ . s ) ~ 7 " Iv k+ 1 . p . K ~ PK
where
C(',
P, 2) =
m!
k!(k+ I
-$)
X
Therefore this provides another estimate of the constants which appear in the interpolation error estimate. [Hint: As in CIARLET& WAGSCHAL(1971), prove and use the in-
I30
CONFORMING FINITE ELEMENT METHODS
[Ch. 3. 5 3.1.
equalities 1
s -,
(Ai(l.m,K
1s i
s N.]
PK
(vi) Using the result of (v), show that, for triangles of type ( I ) ,
and that, for triangles of type ( 2 ) ,
hi
I U - ~ K U I , , K ~ Cwith ~ ~ ~ C iU= 2~, ~C:=6, J
C,'=9.
PK
These estimates can be further improved. See ARCANGELI & GOUT (1976) and GOUT (1976). 3.2.3. Show that for a family of triangular finite elements, condition (3.1.43) is equivalent to Zla'mal's condition ( Z L A M A L (1968)) that there exists a constant O0 such that VK,
e K 3eo>o,
where for each triangle K, OK denotes the smallest angle of K. 3.2.4. The object of this problem is to study (in the special case m = I for simplicity) the improvement of JAMET (1976b) concerning the dependence of the interpolation error estimates upon the geometry of the finite elements. (i) Let R be an open subset of R" with h = diam 0.In addition, let ZI, E 5?( Wk(+')@(R); W'@(R))be a mapping such that (a) H o p = p for all p E Pk(R) and (b) there exists a non zero vector 5 E R" such that if Du( x ) t = 0 for all x E R for some function u E W"'+"''(R), then DUo u ( x ) e = 0 for all x E 0.
Show that there exists a mapping @ E 2(W k . p ( R )L; P ( R ) such ) that V UE Wk".p(R), DUO u ( * ) t = @ ( D u ( * ) ~ ) , v p E Pk-l(O),
@p = P .
(ii) Let h be an open set which is affine-equivalent to R and let the mapping fi be defined in the usual way. Using (i), show that there exists a constant C ( f i ,h)such that vu E
wk"'p(0),IDU(.)e-
U ( . ) t l ~ . ~ , nc(fi,f i ) h k ( + l ) l V l k + i . p , o .
Ch. 3, § 3.2.1
APPLICATION TO SECOND-ORDER PROBLEMS
131
(iii) Assume that the property of (i) is satisfied for n linearly independent vectors &, 1 C i s n. Show that there exists a constant C ( f i ,d) such that (compare with (3.1.32))
where the angle 8 (a function of the n vectors ti,1 d i S n ) is defined as follows: Given any vector 7 with ))q1) = 1, let Bi(v)E [0, ~ / 2 be ] the angle between the directions of the vectors 7 and ti,1 d i d n. Then we let
B = max {min vER"
IGsn
q7)}.
(iv) Assume that k > ( n l p ) . In the case of n-simplices of type ( k ) , show that we may choose for vectors ti,1 ~ i a n any , n vectors out of the n(n + 1)/2 vectors of the form ( a j - ail, 1 s i < j s n + 1. As a consequence show that in the case of triangles for instance, we may have IIuIIK U I I ~ . ~ . O = O ( h k )even though Zlfimal's condition is violated. (v) Apply the previous analysis to rectangles of type (k).
3.2. Application to second-order problems over polygonal domains
Estimate of the error IIu
- Uh1II.R
Let there be given a second-order boundary value problem, posed over a space V which satisfies the usual inclusions H d ( 0 ) C V = C H1(R). One basic hypothesis will be that the set d is polygonal, essentially because such an assumption allows us to exactly cover the set d with polygonal finite elements. Then with any such finite element, we associate a finite element space xh. Next, we define an appropriate subspace vh of xh (this takes into account the boundary conditions contained in the definition of the space V) which is included in the space V, so that we are using a conforming finite element method. One main property that we shall assume is that the space v h contains the Xh-interpolant of the solution u : See Section 2.3 where the special cases v h = xh C V = H ' ( R ) and vh = XOh C V = Hd(R) have been thoroughly discussed. This would also be true of a problem where V = { u E H ' ( R ) ; u = O on r0} provided the subset of can be written exactly as a union of faces of some finite elements. By contrast, this is not true in general of a
v
r,, r
132
[Ch. 3, 0 3.2.
CONFORMING FTNITE ELEMENT METHODS
nonhomogeneous Dirichlet problem. In this direction, see Exercises 3.2.1 and 3.2.2. Throughout this section, we shall make the following assumptions, denoted (H l), (H 2) and (H 3), whose statements will not be repeated. (H 1) We consider a regular family of triangulations T h in the following sense: (i) There exists a constant u such that (3.2.1) (ii) The quantity (3.2.2) approaches zero. In other words, the family formed by the finite elements ( K , PK,Z K ) , K E uh fi-h, is a regular family of finite elements, in the sense of Section 3.1. Remark 3.2.1. There is of course an ambiguity in the meaning of h, which was first considered as a defining parameter of both families ( T h ) and (&), and which was next specifically defined in (3.2.2). We have nevertheless conformed to this often followed usage. 0
uh
(H 2) All the finite elements (K, PK,Z K ) , K E r h , are affineIn other words, equivalent to a single reference finite element (k,fi, the family (K, P K , ~ ~K )E, T h f o r all h, is an afine family of finite elements, in the sense of Section 2.3. (H 3) All the finite elements ( K , PK,Z K ) , K E uhrh, are of class Ce0. We first prove an approximation property of the family (vh)(Theorem 3.2.1), from which we derive an estimate for the error in the norm (l*Ill,a (Theorem 3.2.2). In the sequel, C stands for a constant independent of h and of the various functions involved (not necessarily the same at its various occurences).
e).
Theorem 3.2.1. In addition to (H l), (H 2) and (H 3), assume that there exist integers k 3 0 and 1 3 0 with 1 S k, such that the following inclusions
Ch. 3, 5 3.2.1
I33
APPLICATION TO SECOND-ORDER PROBLEMS
are satisfied:
(3.2.3) (3.2.4) where s is the maximal order o f partial derivatives occurring in the definitions o f the set 2. Then there exists a constant C independent of h such that, f o r any function u E ~ ~ " n ( V0, ) I(U
-n h Ullm,ns Chk+'-"l ~ l k + ~ . R ,0 s m s
(c
minil, 0,
I12
IIU
-n
h Ull'm,~)
s Chk+'-"( ~ l k + ~ . R 2, G m
d
KEYh
(3.2.5)
min{k + 1, I } (3.2.6)
where n h u E vh is the Xh-interpo/antof the function u. Proof. Applying Theorem 3.1.6 with p
11
-n K
uJI,.K
G
= q = 2,
we obtain
O G m s min{k Chf;+l-mlvlk+l,K,
+ 1, I}.
Using the relations (nhu ) I K = nKv, K E y h (cf. (2.3.32)) and the inequalities hK s h, K E y h (cf. (3.2.2)), we get
= Chk+l-mlvlk+l.n, OSmGmin{k+
I,/}.
Thus inequalities (3.2.6) are proved and inequalities (3.2.5) follow by observing that
for m
X, c
=0
and for rn
%'(a)implies
=1 x h
(when 13 1) since the inclusions
c ~ ' ((Theorem 0) 2.1.1).
C
H ' ( k ) and
0
Remark 3.2.2. Analogous interpolation error estimates hold if the function u is "only" in the spaces ( % " ( a ) n n ~ , , N " " ( K )V).nIt suffices to replace the semi-norm I U ~ ~ + ~ . R by the semi-norm ( E K ~I UTI : ~ + I , K ) ~ I ~ in the right-hand sides of inequalities (3.2.5) and (3.2.6). 0 Such more general estimates are seldom needed.
134
CONFORMING FINITE ELEMENT METHODS
[Ch. 3, 5 3.2.
Theorem 3.2.2. In addition to ( H l), ( H 2) and (H 3), assume that there exists an integer k 3 1 such that the following inclusions are satisfied:
p k ( k )c P c H ’ ( R ) , H k + ’ ( k )4 %“k),
(3.2.7) (3.2.8)
where s is the maximal order of partial derivatives occurring in the definition of the set %. Then if the solution u E V of the variational problem is also in the space Hk+’(L?),there exists a constant C independent o f h such that IIU
- uhlll,ns
ChklUlk+l.a,
(3.2.9)
where uh E vh is the discrete solution. Proof. It suffices to use inequality (3.2.5) with u = u and m conjunction with CCa’s lemma (Theorem 2.4. I), which yields
=
1, in
Suficient conditions f o r limh4 IIu - UhI(1.R = 0 The previous result has been established under the assumptions that the solution u is suficiently smooth (in Hk+’(L?) for some k 3 1) and that the Xh-interpolant n h u exists (cf. the inclusion Hk’’(k)b%’(k) which is satisfied if k > (n/2)- 1 + s). If these hypotheses are not valid, it is still possible to prove the convergence of the method if the solution u belongs to the space V n H ’ ( 0 ) and if the “minimal” assumptions (3.2.10) below hold, using a “density argument” as we now show (one should notice that the assumption s =s1 in the next theorem is not a restriction in practice for second-order problems). For a different approach, see Exercise 3.2.3. Theorem 3.2.3. In addition to ( H l), ( H 2) and (H 3), assume that the inclusions (3.2.10) P * ( I z )c P c H ’ ( k )
are satisfied, and that there are no directional derivatives of order 2 2 in the set %. Then we have
qg Ilu - Uh(I1.R = 0.
(3.2.11)
Ch. 3, 8 3.2.1
135
APPLICATION TO SECOND-ORDER PROBLEMS
Proof. Define the space Y=
w2qn)n v.
(3.2.12)
Since the inclusions (3.2.10) and
w2*”(IZ)b %’(IZ),
s=O
or
I,
W2’(R) 4 H’(IZ), hold, we may apply Theorem 3.1.6 with k = 1 , p = 00, rn = 1 , q = 2: There exists a constant C such that Vu E Y9
llu - n K ~ l 1 1 . K
~(mea~(K))’”hKl~)2.~,K,
from which we deduce that
and thus we have proved that
h uI(I.o= 0. lim I(u - n
(3.2.13)
h 4
For all h and all u E Y, we can write IlU
-
nh Ulll,o
1IU
- U1II.R -t
IIu
-n h UIII.R.
(3.2.14)
Given the solution u E V and any number E > 0, we first determine a function u, E Y which satisfies the inequality I(u - u,II I,R s 4 2 . This is possible because fhe space Y is dense in the space V . Then by (3.2.13), there exists an h , , ( ~ such ) that IIu, - n h u , l l , , ~S ~ / for 2 all h S h d ~ ) In . view of inequality (3.2.14), we have therefore shown that
and the conclusion follows from CCa’s lemma (Theorem 2.4.1).
0
A close look at the above proof shows that the choice (3.2.12) of the space Y is the result of the following requirements: On the one hand it had to be dense in the space V and on the other hand the value k = 1 was needed in order to apply Theorem 3.1.6 so as to obtain property (3.2.13) with the assumption PI(& C @.Therefore the space Y had to contain derivatives of order s 2 (this condition limits in turn the admissible values of s to 0 and 1 ) and consequently, one is naturally led to the space of the form (3.2.12). In fact, any space of the form ‘If=
136
CONFORMING FINITE ELEMENT METHODS
[Ch. 3, 6 3.2.
W2,p(12) r l V with p sufficiently large, would have also been acceptable, as one may verify. Estimate of the error Iu - UhlO.0. The Aubin-Nitsche lemma In theorem 3.2.2, we have given assumptions which insure that IIu i.e., the quantity - U h l ( l . 0 = O ( h k ) so that the error in the norm I-lo.O, lu - UhIO.0. is at least of the same order. Our next objective is to show that, under mild additional assumptions, one has in fact Iu - uhlO,O= O(hk+l). Let us first define an abstract setting which is well adapted to this type of improved error estimates: In addition to the space V , with norm 11.11, we are given a Hilbert space H , with norm 1.1 and inner product (.;), such that V = H with a continuous injection (in the present case, we shall have typically V = Hd(l2), H ' ( O ) , or any closed space contained in between these two spaces, and H = L 2 ( 0 ) ) . Then we shall identify the space H with its dual, so that the space H may be identified with a subspace o f the dual space V' of V , as we now show: Let f € H be given. Since V C H with a continuous injection L, we have
VvE v ,
I(f9
v)lG
If1 bl ll4 VI IbII,
(3.2.15)
and therefore the mapping u E V - + ( f u, ) defines an element f E V ' . The mapping f E H + f € V' is an injection for if (f, u ) = 0 for all u E V , then ( f , u ) = 0 for all u E H since V is dense in H,and thus f = 0. We shall henceforth identify f and f,i.e., we shall write
V fE H,
vu E v,
cf, u ) = f(u).
(3.2.16)
We next prove an abstract error estimate. With the same assumptions as for the Lax-Milgram lemma (Theorem 1.1.3), we let as usual u E V and uh E vh denote the solutions of the variational problems
V u E V , a(u, u ) = f ( u ) , vuh
E
vh,
a(uh. V h ) = f(uh),
(3.2.17) (3.2.18)
respectively. We recall that M denotes an upper bound for the norm of the bilinear form a ( - ,-) (cf. (1.1.19)).
Ch. 3, 8 3.2.1
APPLICATION TO SECOND-ORDER PROBLEMS
137
Theorem 3.2.4 (Aubin-Nitsche lemma). Let H be a Hilbert space, with norm 1.1 and inner product (., such that , ) s
V=H
and
V 4 H .
(3.2.19)
Then one has (3.2.20)
where, f o r any g E H, rp, E V is the unique solution of the variational problem : V v E V , a ( v , Cp,) = (g, u ) . Proof.
(3.2.21)
To estimate lu - uhl, we shall use the characterization (3.2.22)
Using the identification (3.2.16), we can solve problem (3.2.21) for all g E H (the proof is exactly the same as that of the Lax-Milgram lemma). Since ( u - uh) is an element of the space V, we have in
particular
a ( u - Uhr (pB) = (8, u - uh), on the one hand, and we have vph
E
vh,
a ( u - uh, ( P h ) = 0,
on the other, which we obtain by subtracting (3.2.17) and (3.2.18). Using the above relations, we obtain vph
E
vh,
(8,u - uh) = a ( u - uhy pg - (Ph)r
and therefore, ( ( g ,u - uh)l
- Uhll
$ch 11%
- (Phil.
(3.2.23)
Inequality (3.2.20) is therefore a consequence of the characterization (3.2.22) and inequality (3.2.23). 0 A look at the above proof shows that pR had to be the solution of problem (3.2.21), i.e., where the arguments are interchanged in the bilinear form. Problem (3.2.21) is a special case of the following varia-
138
CONFORMING FINITE ELEMENT METHODS
[Ch. 3. 5 3.2.
tional problem: Given any element g E V', find an element rp E V such that vu E
v,
a ( u , rp) = g ( u ) .
Such a problem is called the adjoint problem of problem (3.2.17). Of course the two problems coincide if the bilinear form is symmetric. It is easily verified that when the variational problem (3.2.17) corresponds to a second-order boundary value problem (cf. the examples given in Section 1.2), the same is true for its adjoint problem. As we shall see, the abstract error estimate of Theorem 3.2.4 yields an improvement in the order of convergence for a restricted class of second-order problems, which we now define: A second-order boundary value problem whose variational formulation is (3.2.17), resp. (3.2.21), is said to be regular if the following two conditions are satisfied:
(9 For any f E L2(fl), resp. any g E L2(fl),the corresponding solution uf,resp. uB,is in the space H2(fl)f l V. (ii) There exists a constant C such that (3.2.24) (3.2.25) Remark 3.2.3. Consider for instance problem (3.2.17). Then without the assumption of regularity, we simply know that (use Remark 1.1.3 and the identification (3.2.16)):
Indeed, this regularity is not too restrictive a condition: For example the homogeneous Dirichlet problem and homogeneous Neumann problem associated with the data of (1.2.23) (with g = 0) are regular if 0 is convex and if the functions aii and a are sufficiently smooth. However, this would not be the case for the homogeneous mixed problem of (1.2.28). We are now in a position to estimate the error in the norm l.IO.R. Theorem 3.2.5. In addition to (H I ) , (H 2) and (H3). assume that s = 0 . that the dimension n is s 3. and that there exists an integer k 3 I such
[Ch. 3. 8 3.2.
I39
APPLICATION TO SECOND-ORDER PROBLEMS
that the solution u is in the space Hk"(f2) and such that the inclusions
Pk(R)c r; c H ' ( R )
(3.2.26)
hold. Then if the adjoint problem is regular, there exists a constant C independent o f h such that (3.2.27)
Iu - Uh(0.ns Chk+'IUIk+l.n.
Proof. Since n s 3, the inclusion H 2 ( & 4 Y o ( @ holds (if s = 1, the inclusion H ' ( k ) 4 %'(I?) holds only if n = 1; this is why we have restricted ourselves to the case s = 0). Applying Theorem 3.2.1 and inequality (3.2.25), we obtain, for each g E H = L 2 ( 0 ) , inf
Ch 6 vh
II% - cphl1i.n s IIPg- nh(P&i.ns
ChIpgIz.n Chlglo,n.
Combining the above inequality with inequality (3.2.20) yields IU
- UhIo.a
Chllu - Uhlli.n,
and it remains to use inequality (3.2.9) of Theorem 3.2.2.
0
Concluding remarks. Inverse inequalities Although we restricted ourselves to the case of a single partial differential equation, it should be clear that the analysis of this section includes the systems o f equations of plane and three-dimensional elasticity (cf. (1.2.40)) posed over polygonal domains. In this case, the space vh is a product of two or three identical finite element spaces vh: With each degree of freedom of the space vh, one associates two or three unknowns which are the corresponding components of the approximate displacement. The asymptotic estimates obtained in Theorems 3.2.2 and 3.2.5 are the best one could hope for, inasmuch as the orders of conoergence are the same a s if the discrete solution uh were replaced by the Xh-interpolant o f the function u : Compare (3.2.9) and (3.2.5) with m = 1 , and (3.2.27) and (3.2.5) with m = 0. Consequently, the table in Fig. 3.1.2 is also useful for getting a practical appraisal of the upper bounds of Theorems 3.2.2 and 3.2.5. For instance, one gets IIu - ~ ~ =l O(h2-"), l ~ . m~ = 0 , 1, with n-simplices or rectangles of type ( I ) , or IIu - Uhllm.0 = 0(h3-'"), m = 0 , 1 , with n-simplices of type (2) or (3') or rectangles of type (2) or (3'), e t c . . . Neverthe-
140
CONFORMING FINITE ELEMENT METHODS
[Ch. 3, 5 3.2.
less, the higher the order of convergence, the higher the assumed regularity of the solution, and this observation limits considerably the practical value of such estimates. For example, let us assume that we are using n-simplices of type (3) while the solution is “only” in the space H’(f2): Then the application of Theorems 3.2.2 and 3.2.5 with k = 1 shows that one gets only ((u- U , , ( ( ~ , R= O ( h 2 - m ) ,m = 0 , l . Therefore, unless the solution is very smooth, the use of polynomials of high degree does not improve the quality of the approximation. Interestingly, the same conclusion was also drawn through purely practical considerations, by the engineers who seldom use polynomials of degree 3 4 for approximating the solution of second-order boundary value problems. To conclude this section, we shall define a simple property of a family of triangulations (of the type described at the beginning of this section), whose value lies essentially (as usual) in the consequences which we shall derive (cf. Theorem 3.2.6). Although we had no immediate need for this property in the present section, it shall be used subsequently at various places, beginning in the next section, so that it seemed appropriate to record it here. We shall say that a family of triangulations satisfies an inverse assumption, in view of the inverse inequalities to be established in the next theorem, if there exists a constant Y such that h hK
--d
(3.2.28)
Y.
Notice that this is by no means a restrictive condition in practice. For such families, we are able to estimate the equivalence constants between familiar semi-norms (we remind the reader that u is the constant which appears in the regularity assumption; cf. (3.2.1)). Theorem 3.2.6. Let there be given a family of triangulations which satisfies hypotheses (H I), (H 2) and an inverse assumption, and let there be given t w o pairs ( I , r ) and ( m , q ) with 1, m 3 0 and ( r , q ) E [ I , 001 such that
I
S
m
and
@ C W ’ - r ( Kn) W m . q ( k ) .
Then there exists a constant C
=
(3.2.29)
C(u, v, I, r, m , q ) such that
(3.2.30)
Ch. 3, 8 3.2.1
141
APPLICATION TO SECOND-ORDER PROBLEMS
if p , < 00, with
Proof. Given a function by Theorem 3.1.2,
uh
Ex
h
and a finite element K E Yh, we have
(3.2.31) where the function GK is in the standard correspondence with the function UhIK. Define the space
Since 1 s m by assumption, the implication
B E fi
+ 1PlIrn.q.k
=0
holds and therefore the mapping
8 E p/fi+ 118IIm.q.k = fin!€ N IB
- 2lm.q.t
is a norm over the quotient space p/fi.Since this quotient space is finite-dimensional, this norm is equivalent to the quotient norm ll-ll/.r.k and therefore there exists a constant = r, m,q ) such that
c c(1,
B li E p* IB Im,q,k = II8IIm.q.R c cII8II/,r,k= ~ I I l.r,k.
( 3.2.32)
Taking into account the regularity hypothesis and the inverse assumption, we obtain from inequalities (3.2.31) and (3.2.32) and Theorem 3.1.3,
Assume first that q = m, so that there exists a finite element K OE y such that, using (3.2.33),
h
142
[Ch. 3, I 3.2.
CONFORMING FINITE ELEMENT METHODS
Assume next that q < 03. We deduce from inequality (3.2.33) that
Then we distinguish three cases: Either r s q, so that
and inequality (3.2.30) is proved in all cases.
0
Inequalities of the form (3.2.30) are of course immediately converted into inequalities involving the semi-norms I . l m , q . ~ or I . I I . r . ~ if it so happens that the inclusions x h c ~ “ - ~ ( ( . or n ) x h c w’.‘((.n) holds. For example, let us assume that hypothesis (H 3) is satisfied and that the inclusion P C HI(& holds so that the inclusion x h C r l H’(R) holds. Then we have
%‘(a)
C vuh
xh,
vvh E X h ,
(3.2.34)
bh(o.-.RGj;;;Ti(~h(o.R~
1Uhll.R s ~ l ~ h l O , ~ e, t c . .
.
If now hypothesis (H3) is satisfied and if the inclusion holds, then we get similarly C vuh E xh, ( ~ h ~ l , m . ~ 2 ~ h ( ~ h ( 0etc. . c n ,.R. l
(3.2.35)
@ c W’.yk) (3.2.36)
Another observation is that similar inequalities between izorms can be directly derived from these inequalities. For instance, we obtain
Ch. 3, 5 3.2.)
APPLICATION TO SECOND-ORDER PROBLEMS
143
Remark 3.2.4. Inverse inequalities can be likewise established between the above semi-norms and other semi-norms or norms, such as II*IIL~(n. In this direction, see Exercise 3.2.4. 0
Exercises 3.2.1. The object of this problem is to indicate a way of approximating the solution of a nonhomogeneous Dirichlet problem (see also the next problem) whose solution u E H ' ( R )satisfies (cf. Exercise 1.2.2)
i
( u - uo) E Hd(R),
vu E Hd(W,
a(u,v ) =f ( u ) ,
where uo is a given function in the space H ' ( R ) , and the forms a(., .) and f ( - ) satisfy the usual assumptions of the Lax-Milgram lemma, the bilinear form being assumed to be symmetric in addition. Given a finite element space x h , we let as usual XOh ={vh
E X h ;
(i) Given a function Uh
Ex
h
r
Uoh
uh
=o
on
r}.
E x h , show that the discrete problem: Find
such that U h E UOh+XOh={VhEXh; v u h
EXOh,
(Uh-UOh)EXOh}
a(Uh9 u h ) = f ( u h ) .
has a unique solution. (ii) Show that (STRANG & FIX(1973, p. 200)):
(iii) Assume that the spaces x h are made up of n-simplices of type ( k ) . Indicate how should one choose the function U 0 h in order that
IIu - U h l I I . R =
o(hk),
assuming the functions u and uo are sufficiently smooth. 3.2.2. This problem describes a penalty method for approximating the solution of a nonhomogeneous Dirichlet problem, whose solution u E H'(R) satisfies (cf. Exercise 1.2.2):
t
( u - uo) E H ; ( o ) , vu E
Hd(R), a ( u , u ) = f ( u ) ,
144
[Ch. 3, 8 3.2.
CONFORMING FINITE ELEMENT METHODS
where uo is a given function in the space H ' ( R ) and where for simplicity, we shall assume that a(u, u ) =
I
&u&u dx,
R i=l
f(u)
= fRfu
dx, f € L2(R).
In what follows, we consider a family of finite element spaces x h . We are also given a family of real numbers E ( h ) > 0 with limh4 e ( h ) = 0. (i) Show that, for each h, the discrete problem: Find uh E x h such that Vvh E x h ,
I
a(uh9 uh)+(uh - u0)Uh d y 4h) r
= f(Uh).
has a unique solution. (ii) Assume that the solution u is in the space H Z ( R )Show . that, for all v h E xh, 1 Iu-uhI:.R+-(Iuh-u0112L2(r)=
4h)
a(uh-u, uh-u)
+Lj (Uh-fd)(Uh-U)dy 4h)
-Ir
r
& u ( u ~, u )dy a#(u - V h ) dy.
-
Using this identity and the inequality ab d q a 2 + ( 1 / q ) b 2 valid for all q > O , derive the following abstract error estimate: There exists a constant C independent of h such that
Iu - uhll.Rs
c
inf
'JhsXh
Iu - UhI:.R+-1IUO-
1
4h)
2
uhII~2(n
(iii) Assume that the spaces x h are made up of n-simplices of type (k) and that the solution u is sufficiently smooth. Show that, for some constant C independent of h,
and thus deduce the optimal choice for E(h), so as to maximize the order
Ch. 3. 5 3.2.1
APPLICATION TO SECOND-ORDER PROBLEMS
145
of convergence (therefore, as far as the order of convergence is concerned, the method proposed in the previous exercise is preferable). 3.2.3. The purpose of this problem is to analyze a procedure of CLEMENT (1975) for defining an operator whose approximation properties are similar to those of the standard interpolation operator but which can be defined in more general situations. For simplicity, we shall consider finite element spaces xh made up of triangles of type (I), but the analysis can be extended to triangular finite elements with polynomials of higher degree. With each vertex bi, 1 d i d M , of the triangulation, we associate a basis function w iE X h in the usual manner, i.e., one has
w i ( b j )= aij, 1 d i, j S M.
For each i, we set
si = supp w;. Given a function u E L 2 ( R )we , let Piu denote, for each i = 1 , . . . , M , the projection of the function u in the space L2(Si)over the subspace P l ( S i ) , i.e., one has
PiuE P l ( S i ) and Vp E Pl(Si), and we set
I,
( u - Piu)p dx = 0,
M
Piu(bi)wi.
rhu = i=l
In this fashion, we have defined a mapping In the sequel, we consider a family of spaces xh associated with a regular family of triangulations. (i) Show that there exists a constant C independent of h such that
Vi E [ 1 , MI, K
C
S; 3 diam Si s ChK,
and that there exists an integer v independent of h such that
Vi E [ I , MI, card{K
€ y h ;
K
c S i } s v.
(ii) Show that there exists a constant C independent of h such that
Vi E [ I . MI, Vu E H ' ( S i ) ,
146
[Ch. 3, 8 3.2.
CONFORMING FINITE EL E M ENT METHODS
OC ( u - Piulm,siCC(diam Si)’-m~u~,.si,
msI c ~ .
(iii) Show that there exists a constant C independent of h such that
V K E y h , vp E Pl(K), Ip I m,a.K c C(meas(K))-”2him(pJO.K, m
= 0,
I.
(iv) Show that there exists a constant C independent of h such that
Vi E [ I , MI, I w ; ~ , , , ~ s C(meas(K))”*hg”, m
= 0,
I.
(v) Show that
vu E L’(R),
{
Iu - r h U I O . R s CIUIO.R,
lim Iu - rhulo.n= 0, h 4
v u E H’(R),
I/?
where C denotes as usual various constants independent of h. [Hint: Let K E F,, be a triangle with vertices bi, 1 s i s 3 . Prove the identity 3
(rhu - u ) l K = (plu - u ) l K
+
i=2
(piu(bi) --
PIu(b;))WilK
and use the previous questions to estimate appropriate semi-norms of the functions (Plu- u ) l ~and 23=2 (Piu(bi)- P , u ( ~ ~ ) ) w ~ J K . I (vi) If the function t’ belongs to t h e space Hh(R),is the function rhu in the space X,, = { D,, E X , , ; vh = 0 on r)? (vii) Apply the results of question (v) to the approximation of a second-order boundary value problem. Compare with Theorems 3.2.2 and 3.2.5. 3.2.4. Let there be given a family of triangulations which satisfies hypothesis (H 2) and an inverse assumption. It is also assumed that P C %“(K).Then show that for each p E [ I , m], there exists a constant C = C ( p ) independent of h such that V u h E Xh.
llt’hllL”
C p(UhlO.p.0.
Ch. 3.
B
UNIFORM CONVERGENCE
3.3.1
147
3.3. Uniform convergence A model problem. Weighted semi-norms J.lb:m.n
For ease of exposition, we shall simply consider the homogeneous Dirichlet problem for the operator -A, which corresponds to the following data:
(3.3.1)
Assuming that d is a convex polygonal subset of R2, we shall restrict ourselves to finite element spaces xh which are made up of triangles of type ( l ) , so that the corresponding discrete problems are posed in the (results concerning the use of trianspaces v h = { U h E xh; uh = 0 on gles of type (k) and higher dimensions are indicated at the end of this section and in the section “Bibliography and Comments”). We shall assume once and for all that we are given a family of triangulations of the set d which (i) is regular and (ii) satisfies an inverse assumption, i.e., there exist two constants u and v such that
r}
(3.3.2)
Our main tool in the study of the error in the norms ( * l O , m , ~ and J(.Jll.m,~ will be the consideration of appropriate weighted norms and semi-norms. Accordingly, the first part of this section will be devoted to the study of those properties of such semi-norms which are of interest for our subsequent analysis (cf. Theorems 3.3.1 to 3.3.4). Given a weight-function 4, i.e., a function which satisfies
4 E L ” ( R ) and 4 a O a . e . we define, for each integer m
3 0,
on 0,
(3.3.3)
the weighted semi-norms (3.3.4)
I48
CONFORMING FINITE ELEMENT METHODS
[Ch. 3.
B 3.3.
To begin with, we observe that, if the function 4-I exists and is also in the space L " ( 0 ) ,an application of Cauchy-Schwarz inequality gives V a E R , V u , u E H 1 ( 0 ) , a ( u , u ) S lul+~:l.nluJ+-a:l.~.(3.3.5)
Departing from the general case, we shall in fact concentrate our subsequent study on weighted semi-norms of the particular type (Y E R, where the function 4 is of the form (3.3.7) below. Our first task is to extend to such weighted semi-norms the property that there exists a constant cI,solely dependent upon the set 0,such that
I.ld~:m.R,
V W E f f d ( 0 ) n H2(a),IwIz.RS cilAwlo,n.
(3.3.6)
Theorem 3.3.1. There exists a constant CI = C1(a)such that, f o r all functions 4 of the f o r m
4:xEcL4(x)=
1
IIx - zl12+ e2'
8 > 0,
2 = (ZI, 22) E R2,
(3.3.7)
(3.3.8) Proof. Let u be an arbitrary function in the space H d ( 0 ) n H W ) . Then the function w = (XI - 2 l ) U
also belongs to the space H A ( 0 ) n H 2 ( 0 ) ,and
a1,w - 2 a l q - 2l)al2u = a12w - azu,
(XI - 2 , ) a , , u= (XI
= azzw, AW = ( X I - .TI)Au + 2 8 1 ~ .
( X I - Pl)a22u
Using these relations and inequality (3.3.6), we find a constant c2 such that
Ch. 3,
P 3.3.1
UNIFORM CONVERGENCE
149
Since we have likewise
we eventually obtain
As exemplified by the above computations, we shall depart in this section from our practice of letting the same letter C denote various constants, not necessarily the same in their various occurrences. This is due not only to the unusually large number of such constants which we shall come across, but also - and essentially - to their sometimes intricate interdependence. Therefore, constants will be numbered and, in addition, their dependence on other quantities will be made explicit when necessary. However the possible dependence upon the set R and the constants u and Y of (3.3.2) will be systematically omitted. While we shall use capital letters Ci,i 2 1 , for constants occurring in important inequalities, small letters ci, i L 1, will rather be reserved for intermediate computations. In the next two theorems, we examine the relationships between the weighted semi-norms I*Jd=:m,a (the function 4 being as in (3.3.7)) and the standard semi-norms I . l m , m . n . Such relationships will play a crucial role in the derivation of the eventual error estimates.
Theorem 3.3.2. For each number a > 1 and each integer m 3 0, there exists a constant C2(a,m ) such that, f o r all functions 4 of the f o r m
4 :x € 6 + ( x )
=
1 IJx - -f1I2 + e*' e > o , n ~ 6 ,
(3.3.9)
we have 1 Vu E WmTm(fl),1 U J ~ " ; m . RG~ ( a ,m ) F l u l m , - , n .
(3.3.10)
For each number p €10, 1 [ , and each integer m 3 0 , there exists a
150
CONFORMING FINITE ELEMENT METHODS
[Ch.3. 5 3.3.
constant C3(p,m) such that f o r all functions 4 of the form (3.3.9), we have
ve s p,
vv E
wrn-”(n), Ivl+;,.,,n =sc,(P, m)lln 011/21Ulrn.m.n. (3.3.1 1)
Proof.
Clearly, one has
Next let 6 = diam(O), so that
If a > 1 , write
and inequality (3.3.10) is proved with C 2 ( a ,m ) = c 3 ( m ) ( d ( a- l))”2. If a=l,wehavefor 8 S p < 1 ,
with
and inequality (3.3.1 1) is proved with C3(/3,m) = ~ ~ ( m ) ( 2 r c @ ) ) ” ~ . 0 We next obtain inequalities in the opposite direction. In order that they be useful for our subsequent purposes, however, we shall establish these inequalities only for functions in the finite element space Xhrand further, we shall restrict ourselves to weight-functions of the form 4 or d 2 , with 4 as in (3.3.9), for which (i) the parameter 8 cannot approach zero too rapidly when h approaches zero (cf. (3.3.13)), and for which (ii) the points 3 depend upon the particular function uh E X h under consideration (cf. (3.3.13 and (3.3.17)).
Ch. 3, 0 3.3.1
UNIFORM CONVERGENCE
151
Theorem 3.3.3. For each number y > 0 , there exist constants C d y ) and C,(y) such that, i f for each h, we are given a function c b h of the form
in such a way that (3.3.13)
37 > 0, V h , 6 h 2 yh, then (i) we have V u h
Ex
h ,
if, f o r each function such a way that Ivh(xh)(
IvhlO.m,flC
l)h
6,’
C4(Y’)~I~hI&;O,fl
E x h , the point
xh
(3.3.14)
E d in (3.3.12) is chosen in (3.3.15)
= (vh(O.m.fl,
and (ii) we have v u h
Exh,
if, for each function such a way that
l ~ h I l p , f l C CS(Y)h o lhv h l & : I . O
uh
maxi181v h ( x h ) l ,
E x h , the point
xh
1 8 2 u h ( x h ) ( } = 1 vh I
(3.3.16)
E d in (3.3.12) is chosen in
I.m.fl.
Proof. (i) Let u h be an arbitrary function in the space point x h be chosen as in (3.3.15). We can write
(3.3.17)
xh,and k t the
for some constant c5 (in the last inequality we have used the fact that the family of triangulations satisfies an inverse assumption; cf. Theorem 3.2.6). In other words,
152
CONFORMING FINITE ELEMENT METHODS
[Ch. 3, 8 3.3.
and consequently ( B ( a ; r ) = { x E R2;Ilx - all C r}),
The set
d being polygonal,
there exists a constant
c6
such that
We also have
and
by assumption (3.3.13). Combining the previous inequalities, we obtain an inequality of the form (3.3.14) with
(ii) Let v h be an arbitrary function in the space xh, let the point x h be chosen as in (3.3.17), and let K h E y h denote a triangle which contains the point xh. Since the gradient v v h is constant over the set Khrwe deduce dx lUhl$h:l.n5
lUhli.m.OfKh
1lx - xh112+ 4;.
With this inequality and the inequalities meas Kh3 c d u , u ) h 2 ,
we obtain an inequality of the form (3.3.16) with C 4 Y )=
Jm.
0
Ch. 3, 0 3.3.1
UNIFORM CONVERGENCE
153
T o conclude this analysis of weighted semi-norms, we examine in the next theorem the interpolation error estimates in the semi-norms (-I+g:,,,.n where, for each h, the function +h is of the form (3.3.12). The conclusion (cf. (3.3.20)) is that the error estimates are exactly the same as in the case of the usual semi-norms I.lrnTn provided the parameter 6 h does not approach zero too rapidly with h (cf. (3.3.19)). Notice, however, that if the behavior of the function 6h can be “at best” linear a s in the previous theorem, the constant which appears in inequality (3.3.19) is not arbitrary, by contrast with the constant y which appeared in inequality (3.3.13). Finally, observe that no restriction will be imposed upon the points xh.
Theorem 3.3.4. There exists a constant c 6 and, f o r each a E R - {o}, there exist constants C,((Y)> 0 and Cs(a) such that, if for each h, we are given a function +h of the form (3.3.18)
in such a way that Vh,
6h 3
(3.3.19)
C,(a)h,
then (i) we have
Proof. (i) There exists a constant cs such that
V u E H Z ( 0 ) , V K E Y,,, ( u - nKu ( , . ~s C & ~ - ~ ( U ) Z . K , rn = 0, 1. Next, we have IV
-n K Ul4R:m.K
Iu(2.K
(4t(XK))'/21u- n
K u(rn,Kv
(4t(XK))-'/Z)U16R:2.K~
where, for each K E Y,,, the points x K E K and X K E K are chosen in
154
CONFORMING FINITE ELEMENT METHODS
[Ch. 3, 5 3.3.
we obtain
and therefore
Consequently, if we let
the conjunction of the above inequalities yields inequality (3.3.20) with
ca= f i e * .
%'(a)
(ii) Since the function 4tuh is in the space = dom n h and since the restrictions 4 E u h l K belong to the space H 2 ( K )for all K E Yh, the same argument as in (i) shows that
Ch. 3. § 3.3.1
UNIFORM CONVERGENCE
155
Using the inequalities
we deduce that
we conclude that there exists a constant
c9(a) such
that
and thus,
Therefore we have proved inequality (3.3.21), with C,(a) = C , d / c s o .
0
Uniform boundedness of the mapping u + u h with respect to appropriate weighted norms After the above preliminaries, we now come to the central object of this section, i.e., the estimate of the errors Iu - uhlo.m,n and ( u - u h l l . m . f l via the method of weighted norms of J.A. Nitsche. The analysis will comprise three stages. In the first stage (cf. the next theorem), we consider for each h the projection operator Ph: u E Hd(n)*Phu E v h
(3.3.22)
associated with the inner product a ( . , .) of (3.3.1), and which is therefore
I56
CONFORMING FINITE ELEMENT METHODS
[Ch. 3.
B
3.3.
defined for each u E Hd(0 by the relations
phv E
v h
vwh E
and
vh,
a(U - P h V , wh) = 0.
(3.3.23)
Thus we have in particular uh = phu, where uh is the discrete solution found in the space v h and u is the solution of the problem defined in (3.3.1). We shall then show that for an appropriate choice of the parameters Oh in the functions 4 h (cf. (3.3.25) and (3.3.26) below), the mappings Ph are also bounded independently of h when both spaces Hd(0) and v h are equipped with the weighted norm
(3.3.24)
Theorem 3.3.5. There exist three constants h o E ] O ,1[, C9> 0 and Clo such that, if f o r each h, we are given a function +h of the form (3.3.25)
in such a way that Vh,
Oh
(3.3.26)
= C9hIln h ) 1 / 2 ,
Proof. For convenience, the proof will be divided in four steps. (i) There exist two constants C I Iand CI2such that, if
V h , & 3 Clih,
(3.3.28)
then
v v Hd(0), For brevity, let = phu.
Since
lPhui$h:I.nd
c12(IphulifXl.R+
(‘1ihh:l.d.
(3’3.29)
Ch. 3, 5 3.3.1
157
UNIFORM CONVERGENCE
and
we deduce that
1 V h I2&,h:I.R
a ( V h r '$huh)
(3.3.30)
+ 2)Vh l:$:O.t2-
Using relations (3.3.23) we can write a(Uh9 4 h V h )
=
a(uh
- u, &huh
-nh(4huh))+
An application of inequality (3.3.5) with a
=
(3.3.31)
a(u, 4hUh).
1 shows that
By Theorem 3.3.4, we have that, if
Vh,
then (cf. inequality (3.3.21) with a
I+huh
(3.3.32)
Oh b cloh, with clo= C7(1),
-n h(
h u h
)I&61:I,R
=
1)
CI I
-Oh (Ih
I
I I ; I .d?
uh 6f;O.n+ Uh
6h
with cI1= C8(l). Combining the previous inequalities, we find that, for Oh 2 cloh, la(uk
- u, 4 h U h - n h ( 4 h u h ) ) l s
By another application of inequality (3.3.5) with a = 1 , we obtain a(u, &huh)
~~16h;I,Rl&h~h~6h1;l.R.
(3.3.34)
Using the inequality
(3.3.35) (3.3.35)
158
[Ch. 3, 5 3.3.
CONFORMING FINITE ELEMENT METHODS
Combining relations (3.3.30) to (3.3.33, we have found that, for cioh,
O h B
i.e., an inequality of the form
h A'S 2C2+ cI~B(A+ C ) + cll-(A Oh
+ B)(A + C ) .
Assuming
Vh,
(3.3.36)
32 ~ l I h ,
we get A' c 4C2+ (1 + 2clz)BC + A ( ( l + 2clz)B + C ) A2 c 4c2+ - + c12 (B2 + C2) + + (1 + 2c12)2B2+ c2, 2
G
)
and therefore step (i) is proved with (cf. (3.3.32) and (3.3.36)) (3.3.37)
CII= max(clo,2~11) in relation (3.3.28) and C12= max{l1+ 2 ~ 1 2(1. + 2cI2)(3+ 4~12))
in relation (3.3.29). (ii) There exists a constant C13such that, if we assume constant CI1has been determined in step (i)), we have
(3.3.38) Oh
3 Cllh
(the
vu E Hd(R),IPhvI$f;O.fl+
IPhvI$h:*,flc
cl,(lv
where, for each h,
@h
I:f:o.fl
+ I v l $ h i l , f l + h21
@hI$i';2d?
(3.3.39)
= @ , , ( l ) ) is the soh.ition of the variational problem:
(3.3.40) Notice that because the set R is assumed to be convex, the function
Ch. 3, 0 3.3.1
UNIFORM CONVERGENCE
159
$h is in the space H2(f2) and therefore, it is legitimate to consider the semi-norm I* I+;I ;2.nin inequality (3 3.39). Using the definition of the function $h, and letting again u h = p h u , we can write (3.3.41) Il)hI:f:o.n = a ( u h - V , $h - n h $ h ) + 4 ' , u h u dx-
I,
By applying inequality (3.3.5) with (Y = 1 and inequality (3.3.20) with a = - 1 (this is possible because we assume o h a Cllh and CII2 cI0=
C7(- 1); cf. (3.3.32) and (3.3.37)), we obtain
(3.3.42)
so that, by combining relations (3.3.41), (3.3.42) and (3.3.43), we obtain the inequality
I u h I26f:O.R
C 7 M l ~ h l d h : I . R+ l ~ l ~ ~ : l . R ) l J l h I 6 5 ; ~ : 2 , n
1
+3 (I uhl$:o.n + Iul&:o.n), which in turn implies the inequality
(3.3.44) Let then 6 = 1/(3Cl2),where CI2is the constant appearing in inequality (3.3.29). The corresponding inequality (3.3.44) added to inequality (3.3.29) times the factor 2/(3CI2)yields
i.e., an inequality of the form (3.3.39).
160
CONFORMING FINITE ELEMENT METHODS
[Ch. 3, 5 3.3.
(iii) Given any number 8oE]0,1[, there exists a constant Cl4(O0)such
1
Iv h l$i;O.O
Iv h I$i;O.O*
(3.3.47)
To take care of the other term which appears in the right-hand side of inequality (3.3.46), we shall prove that f o r each number O0 E 30, 1[, there exists a constant cl3(O0)such that, f o r all functions 4 of the f o r m
4: x E 6 +(b(X)
=
(Ix
1
+ e2'
- 2112
2 E 6,
o < 8 s eo,
(3.3.48)
we have V + E Hd(0) n H 2 ( 0 ) , l+l?,~s C I ~ ( lln ~ O81) ~ I A I , ~ I (3.3.49) $-~;O.~.
Taking into account that lA+h14i2:o.R
= IVhl42,:o.a.
and applying inequalities (3.3.49) (with I,b = I,bh and 4 = & ) , (3.3.46), and (3.3.47), we then find an inequality of the form (3.3.43, with
cl4(e0) = cl(m 1
+ cl3(eO)).
(3.3S O )
It therefore remains to prove relation (3.3.49) (another method for proving the same relation is suggested in Exercise 3.3.1). Given an arbitrary function E H d ( 0 ) n H 2 ( 0 ) ,we have
+
(3.3.51)
Ch. 3,
P 3.3.1
UNIFORM CONVERGENCE
161
Let then G denote the Green’s function associated with the operator - A in R and the boundary condition u = 0 on R, so that
X
{IR
42(v)G(x, 7 ) ds} dx} d5.
There exists a constant P. 143))
(3.3.52)
such that (cf. for example STAKGOLD (1968,
~ 1 4
Vx, y E 6, x # y, 0 c G(x, y ) S c1411nIIx - ylll.
(3.3.53)
Using this inequality, we proceed to show that for arbitrary points x, 2 E R and for any number 8 with OC 8 C 8,< 1, there exists a constant c15(8,)such that
To see this, write
where
R, = ~ d x0), = (77 E 0 ; 1177 - xII s 81,
n2= R ~ ( x8, ) = {77 E 0 ;8 c 1177 -XI] R3 = R,(x)
= (17
c I},
E 0; 1 s 1177 - xll}.
We then obtain the following inequalities (observe that the last two inequalities make sense only if the sets R2 and R 3 are not empty, and that we have diam R 3 1 if the set 0,is not empty):
162
[Ch. 3, 0 3.3.
CONFORMING FINITE ELEMENT METHODS
Consequently, inequality (3.3.54) is proved, with
The conjunction of inequalities (3.3.5 1) to (3.3.54) then implies inequality (3.3.49) with 1
cl3(e0)= 2 (1 + ~ ? ~ ( e ~ ) ) . (iv) It remains to combine the results of steps (ii) and (iii): W e have determined constants CII,CI3 and Cl4(e0)for each O O E ] O , 1[ such that (cf. inequalities (3.3.39) and (3.3.45))
Cllh s o h
cO< 1
)PhuI$gO,R+ IPhvl$,,;l,f2
[In OhJh2
s C,~(IUI:~:~.~ + l ~ l $ , , : ~+,c13c,4(eo) ~) ___ 1Phu 1 $f.O.R6:
(3.3.55) Let for example O0 = 4 and let
(3.3.56) Then there exists a number ho E 10, 1 [ such that
(3.3.57)
Ch. 3, 8 3.3.1
UNIFORM CONVERGENCE
I63
This being the case, we have found an inequality of type (3.3.27) with ClO =
2
c
.
(3.3.58)
0
Estimates of the errors Iu - Uh(O.m,R and ( u - Uh1l.m.R. Nitsche's method of weighted norms We next develop the second stage of our analysis. Using the inequalities (cf. Theorems 3.3.2 and 3.3.3) between the semi-norms l-lm,m,~, m = 0 , 1, and the weighted semi-norms which appear in inequality (3.3.27), we show in the next theorem that the projection operators Ph of (3.3.22), considered as acting from the subspace Hd(0)fl Wl+"(0) of the space H d ( 0 ) onto the space vh, are bounded independently o f h when the space Hd(0) n W'*"(0)is equipped with the norm 21
+
IuI0.m.R
and the space
v h
Theorem 3.3.6.
(u(i.m.~
(3.3.59)
is equipped with the norm
u + (In h
Remark 3.3.1. norms.
+ hlln hl
1-' 21
v IO,m,R
+ h I 1 I,m,R.
(3.3.60)
Such norms may be viewed as "weighted W'*"(R)-like"
0 There exists a constant CISsuch that
V h c ho, V u E H d ( 0 ) n W'*m(0), lln hl-''21Phu10.m,R+ hlPhull,m,R CdIvI0,m.n + hIln hI IuIl.m.R),
(3.3.61)
where the constant ho> 0 has been determined in Theorem 3.3.5. Proof. Let there be given a function u in the space Hd(0)flW'."(0). For each h c ho, we define the function
(3.3.62)
164
CONFORMING FINITE ELEMENT METHODS
[Ch. 3. 5 3.3.
where ho and C9 are the constants determined in Theorem 3.3.5. Since o h 3 C I I for ~ h s ho (cf. (3.3.57), we may apply inequality (3.3.14)): There exists a constant cl6
(3.3.64)
= c4(cll)
such that lPhu(0.m.R
c16
0;
(3.3.65)
IPhU(&:O,fl-
By inequality (3.3.27), Clo((u(&:o.fl
(PhU(&h:o.fl
+ lu(&h:l.n)7
(3.3.66)
and by inequalities (3.3.10) and (3.3.1 I ) , there exists a constant ( o h C O0 =
4 for h s ho: cf. (3.3.57)) cl7
=
max{c2(2,o),
C& 1))
(3.3.67)
such that Iul&:o.fl
+ IUl&h:l.flS
1
+ Iln eh11/21ull.m.o).
c ~ 7 (o-h ~ ~ ~ o , m . ~
(3.3.68)
Combining inequalities (3.3.65) to (3.3.68), we find that
Using the relation &, = C9h(In (cf. (3.3.26)) and the inequality (In &,I s 21111 h ( (cf. (3.3.57)), we eventually get, for all h c ho,
lln
hl-'/2)Phu10.m.fl
cI8
=
CldlulO.m.fl + hlln
hl lul~.m,d9
(3.3.69)
with cIOc16c17
Likewise, for each h
S
max{C9, d5 c;}.
(3.3.70)
h,, define the function
(3.3.71)
Ch. 3, § 3.3.1
165
UNIFORM CONVERGENCE
Then there exists (cf. inequality (3.3.16)) a constant (3.3.73)
cl9 = c5(cII)
such that IPhuIl.m.0
oh
(3.3.74)
cl9h IPhul,lh:I.O,
and, by inequality (3.3.27), IPhulblh:I.fl
cIo(Iuld:h:o.n
+ Iuldlh:l,a)’
(3.3.75)
Then, arguing as before, we get, for all h s ho, (3.3.76)
. R hl IvI1,m.n) hlPhvll.=.ns C Z O ( ) ~ ~ O+, ~hlln
with cz0=
~
~max{l,~fi GI.c
~
~
c
(3.3.77) ~
The conjunction of inequalities (3.3.69) and (3.3.76) implies inequality (3.3.61) with
0
CIS = CIS + c20.
Remark 3.3.2. In Theorem 3.3.5, the behavior of the function Oh was somehow “bounded below” by a constant times (hlln hI’’*). The key to the success of the present argument was that such a function o h tends nevertheless sufficiently rapidly vers zero with h so as to produce the right factors (as functions of h ) in the inequalities (3.3.69) and (3.3.76).
0 In the third -and final - stage of our study, the uniform boundedness of the projection mappings p h which we just established allows us in turn to easily derive the desired error estimates (recall that the discrete solution uh is nothing but the projection Phu of the solution u ) . Theorem 3.3.7. Assume that the solution u E Hd(0) of the boundary value problem associated with the data (3.3.1) is also in the space W2.”(0). Then there exists a constant C independent of h such that lu - Uh(O.m.0s Ch2/lnh13”Ju12.m.n,
(3.3.78)
Iu - Uhll.=.R
(3.3.79)
Chlln hl
IUIZ.~.~.
~
166
[Ch. 3. B 3.3.
C O N F O R M I N G FINITE ELEMENT METHODS
The norm of the identity mapping acting from the space H,,'(O)n W'*"(O)equipped with the norm of (3.3.59) into the same space, but equipped with the norm of (3.3.60), is bounded above by 11n h01-1'2for all h s hh = min{ho, l/e}. Next we have the identity
Proof.
vuh
E
vh,
u
- uh = u - Phu
= (1 - P h ) ( U - O h ) ,
so that we infer from Theorem 3.3.6 that, for all h Iln h l - I ' * ( U --
uhlO.m.0
S
hh,
+ hlu - uhllp.0
s (IIn h01-1/2 + cis) inf 1%
(lu - UhlO.a.0
E vh
+ h(In hl ( u - uhll.=.n)
Since there exists a constant c21such that
inequalities (3.3.78) and (3.3.79) follow with
C = czl(lln hol-"'
+ cis).
0
In fact, the error estimate of (3.3.78) is not optimal: J.A. NITSCHE (1976b) gets the improved error bound Iu - u h l O . m . 0
s Ch211nhl I ~ J 2 . m , 0 r
(3.330)
at the expense, however, of a technical refinement in the argument, special to triangles of type (1). At any rate, the discrepancy between (3.3.78) and (3.3.80) is somehow insignificant: Both error estimates (3.3.78) and (3.3.80) show an O(h2-')convergence for any E > 0. To conclude, we point out that all the essential features of Nitsche's method of weighted norms have been presented: Indeed, the extension to more general cases proceeds along the same lines. In particular, the use of higher-order polynomial spaces (i.e., Px = P k ( K )for some k Z= 2, n arbitrary) yields a simplification in that the "lln hl" term present for k = 1 disappears in the norms then considered. Thus inequality (3.3.61) is replaced by an inequality of the simpler form (cf. NITSCHE(1975)) IPhUlO.m.0
+ hlPhvIl.m.0
C(lvlO.m.0 + h l U l l . m . 0 ) .
(3.3.8 1)
Such inequalities are obtained after inequalities reminiscent of that of (3.3.27) have been established for appropriate weighted norms of the
Ch. 3, 5 3.3.1
I67
UNIFORM CONVERGENCE
form I - J ~ ~ + ~ :+o ,l*14g~l.~, o (n/2) < a < ( 4 2 ) + I , with functions 4,, again defined as in (3.3.25).
Exercises 3.3.1. Following NITSCHE(1977), the object of this problem is to provide another proof of inequality (3.3.49). i.e., that for any OOE 30,1[, there exists a constant ~ ( 6 , such ) that, for any function 4 of the form fEfi.
0 < e =s 00,
we have
(i) Let
A(O)=
inf
lA+l :-l.o.n
-
IL€Hh(flNlH2(0)
I$l:.fl
and show that A ( 0 ) is the smallest eigenvalue of the eigenvalue problem
[
-Au = A ~ * in u 0, u =Oonr,
so that A ( 0 ) is a strictly positive quantity (references about eigenvalue problems can be found in the section “Additional Bibliography and Comments” at the end of Chapter 4). (ii) Let 6 = B ( f ; diam (0)) and show by a direct computation that
(iii) Conclude, by using the implication
01C 0 2 3 h(Rz) A(O1). 3.3.2. The object of this exercise is to show how an error estimate in the norm I.lo.mn can be quickly derived, once one is willing to accept a poorer order of convergence than that obtained in Theorem 3.3.7. The terminology is the same as in Section 3.2. In addition to ( H l ) , (H2) and (H3), assume that s = 0 , that the
168
CONFORMING FINITE ELEMENT METHODS
[Ch. 3,
P
3.3.
dimension n is G3, that the family of triangulations satisfies an inverse assumption, and that the inclusions
P , ( I z )c F c H’(EZ) hold (notice that by hypothesis (H3), we also have fi c L“(k)). Let then uh be the corresponding discrete solution which approximates the solution u of a general second order boundary value problem of the type considered in Section 3.2. Show that if the adjoint problem is regular, and if u E H2(L!)n V , there exists a constant C independent of h such that Iu
- UhlO.m.0
n = 2, d(uIz.n i if n = 3.
6 Chlu12,n if
Iu - uhl0.rn.n G
~
[Hint: write Iu - UhlO.m,R luh - nhul0.rn.R + J u appropriate inverse inequality for the first term.]
and use an
Bibliography and comments 3.1. The content of this section is essentially based on, and slightly improved upon, CIARLET& RAVIART(1972a). In particular, R. ArcangCli suggested the simpler proof of inequality (3.1.33) given here. For reference about the Sobolev spaces W m . p ( 0and ) their various properties, see ADAMS(1975), LIONS(1962), NECAS (1967), ODEN & REDDY(1976a, chapter 3). Theorem 3.1.1 was originally proved in DENY & LIONS(1953-1954) for open sets which satisfy the “cone property” (such sets are slightly more general than those with Lipschitz-continuous boundaries). An abstract extension of this lemma is indicated in Exercise 3.1.1. There has been considerable interest in interpolation theory and approximation theory in several variables during the past decade, one reason behind this recent interest being the need of such theories for studying convergence properties of finite element methods. Special mention must be made however of the pioneering works of P ~ L Y(1952) A and SYNGE (19571, for what we call here rectangles of type ( 1 ) and triangles of type ( l ) , respectively. The “classical” approach consists in obtaining error estimates in Cm-norms. In this direction, see the contributions of BARNHILL&
Ch. 3.1
BIBLIOGRAPHY AND COMMENTS
169
GREGORY(1976b), BARNHILL& WHITEMAN(1973), BIRKHOFF(1971, 1972), BIRKHOFF,SCHULTZ & VARGA(1968), CARLSON& HALL (1973), CIARLET& RAVIART(1972a), CIARLET& WAGSCHAL(1971), COATMBLEC (1966), LEAF& KAPER (1974), NICOLAIDES (1972, 1973), NIELSON (1973), SCHULTZ (1969b, 1973), STRANG (1971, 1972a), AENfSEK (1970, 1973), ZLAMAL(1968, 1970). Although in most cases a special role is played by the canonical Cartesian coordinates, a more powerful coordinate-free approach, using FrCchet derivatives, can be developed, such as in CIARLET& RAVIART(1972a), CIARLET& WAGSCHAL(1971), where the interpolation error estimates are obtained as corollaries of multi-point Taylor formulas (Exercise 3.1.2). See also COATMBLEC (1966). Another frequently used tool is the kernel Theorem of SARD (196