Acta Numerica 2003: Volume 12 (Acta Numerica) 0521825237, 9780521825238

Citation preview

Acta Numerica 2003

Managing editor A. Iserles DAMTP, University of Cambridge, Silver Street Cambridge CBS 9EW, England

Editorial Board C. de Boor, University of Wisconsin, Madison, USA F. Brezzi, Instituto di Analisi Numerica del CNR, Italy J. C. Butcher, University of Auckland, New Zealand P. G. Ciarlet, City University of Hong Kong, China G. H. Golub, Stanford University, USA H. B. Keller, California Institute of Technology, USA H.-O. Kreiss, University of California, Los Angeles, USA K. W. Morton, University of Oxford, England M. J.D. Powell, University of Cambridge, England R. Temam, Universite Paris-Sud, France

eta umerica Volume 12 2003

CAMBRIDGE UNIVERSITY PRESS

Published by the Press Syndicate of the University of Cambridge The Pitt Building, Trumpington Street, Cambridge CB2 1RP 40 West 20th Street, New York, NY 10011-4211, USA 10 Stamford Road, Oakleigh, Melbourne 3166, Australia © Cambridge University Press 2003 First published 2003 Printed in Great Britain at the University Press, Cambridge Library of Congress cataloguing in publication data available A catalogue record for this book is available from the British Library ISBN 0-521-82523-7 hardback ISSN 0962-4929

Contents

Survey of meshless and generalized finite element methods: A unified approach

1

Ivo Babuska, Uday Banerjee and John E. Osborn

Continuous dependence and error estimation for viscosity methods

127

Bernardo Cockburn

Computational high frequency wave propagation

181

Bjorn Engquist and Olof Runborg

Model reduction methods based on Krylov subspaces

267

Roland W. Freund

A mathematical view of automatic differentiation

321

Andreas Griewank

Geometric numerical integration illustrated by the Stormer-Verlet method

399

Ernst Hairer, Christian Lubich and Gerhard Wanner

Entropy stability theory for difference approximations of nonlinear conservation laws and related time-dependent problems Eitan Tadmor

451

Ada Numerica (2003), pp. 1-125 DOI: 10.1017/S0962492902000090

© Cambridge University Press, 2003 Printed in the United Kingdom

Survey of meshless and generalized finite element methods: A unified approach Ivo Babuska* Institute for Computational Engineering and Sciences, ACE 6.412, University of Texas at Austin, Austin, TX 78712, USA

Uday Banerjee* Department of Mathematics, 215 Carnegie, Syracuse University, Syracuse, NY 13244, USA E-mail: [email protected] http://bhaskara.syr.edu

John E. Osbornt Department of Mathematics, University of Maryland, College Park, MD 20742, USA E-mail: j eoOmath. umd. edu http://www.math.umd.edu/~j eo In the past few years meshless methods for numerically solving partial differential equations have come into the focus of interest, especially in the engineering community. This class of methods was essentially stimulated by difficulties related to mesh generation. Mesh generation is delicate in many situations, for instance, when the domain has complicated geometry; when the mesh changes with time, as in crack propagation, and remeshing is required at each time step; when a Lagrangian formulation is employed, especially with nonlinear PDEs. In addition, the need for flexibility in the selection of approximating functions {e.g., the flexibility to use non-polynomial approximating functions), has played a significant role in the development of meshless methods. There are many recent papers, and two books, on meshless methods; most of them are of an engineering character, without any mathematical analysis. In this paper we address meshless methods and the closely related generalized finite element methods for solving linear elliptic equations, using variational principles. We give a unified mathematical theory with proofs, briefly address implementational aspects, present illustrative numerical examples, and provide a list of references to the current literature. * Supported by NSF grant DMS-98-02367 and ONR grant N00014-99-1-0724. ^ Partially supported by the TICAM Visiting Faculty Research Fellowship Program.

Downloaded from Cambridge Books Online by IP 202.121.96.27 on Tue Nov 09 09:28:40 GMT 2010.

I. BABUSKA, U. BANERJEE AND J. E. OSBORN

The aim of the paper is to provide a survey of a part of this new field, with emphasis on mathematics. We present proofs of essential theorems because we feel these proofs are essential for the understanding of the mathematical aspects of meshless methods, which has approximation theory as a major ingredient. As always, any new field is stimulated by and related to older ideas. This will be visible in our paper.

CONTENTS 1 Introduction 2 The model problem 3 Approximation by local functions in W1: the h-version analysis 4 Construction and selection of particle shape functions 5 Superconvergence of the gradient of the solution in L

for a11 x G Rn

>

for

N ^ k>

( 3 - 10 )

where Aa ^ 0, it might appear that this would lead to a larger class of functions. This, however, is not the case; it is easily shown that if (f> satisfies (3.10), then Aa = A, for |a| < k. In one dimension we can prove more. Theorem 3.2. (Strang and Fix 1973) Suppose e # 9 (R) (in one dimension) has compact support and satisfies condition (1) of Theorem 3.1, that is, it satisfies (3.5) and (3.6). Then

f/2 where Z(£) is an entire function. Proof. Because 4> has compact support, (£) is an entire function and, because of (3.5) and (3.6), ^>(0) ^ 0, and (£) has zeros of at least order k at 2-rrj, 0 / j ' e Z . Let

The function 0, 2

" '

(3.14)

2

Proof. Suppose, on the contrary, that supp 0 C [-(fc + l)/2 + e, (fc + l ) / 2 - e ] ,

for some e > 0.

(3.15)

We will show that this assumption leads to a contradiction. The function (/>(£) is entire and, with £ = £i + ^6) (3.15) implies (3.16)


C-

,

for | 6 | large.

(3.17)

Using (3.5), (3.6), (3.16), and (3.17), we have

\z(Z)\ =

Ck+l\ti\

fc+l

k+1

(3.18)

5/2

where Z{£) is as in (3.11). Since Z(£) is entire, estimate (3.18) implies (via a generalization of Liouville's theorem for entire functions) that Z ( 0 is a polynomial of degree < k + 1. Next, we use (3.11) and (3.16) to get fc+i

= 10(01
(x ~ 3) = b-

Downloaded from Cambridge Books Online by IP 202.121.96.27 on Tue Nov 09 09:28:44 GMT 2010.

(3.21)

14

I. BABUSKA, U. BANERJEE AND J. E. OSBORN

Hence the functions (f)(x — j)/b,j sets rfc form an open cover of R n .

E Z n , form a partition of unity. Thus

R e m a r k 5. Condition (2), i.e., (3.7), of Theorem 3.1 is the definition of the notion of quasi-reproducing of order k, and from Theorem 3.1 we see that this notion is equivalent to condition (1), i.e., to (3.5) and (3.6). It is of interest to have a condition similar to (3.5) and (3.6) that is equivalent to the related notion of reproducing of order k, which can be stated as — j) = p(x),

for all polynomials p(x) of degree < k.

It can be shown that 4> is reproducing of order k if and only if (a) 0(0) = 1, (b) Daj>(0) = 0, for 1 < \a\ < k, (c) Da4>(2Trj) = 0, for O ^ j e Z " and \a\ < k. The proof follows the argument of the proof of Theorem 3.1 in Strang and Fix (1973). R e m a r k 6. The B-spline of order k, denoted by o~k{x), is the (k + l)-fold convolution of the characteristic function of the cube (—1/2, l / 2 ) n . The support of 1, since 1. In one dimension (n = 1), we can say more. If (f){x) satisfies (3.5) and (3.6), then from Theorem 3.2, 0(£) is the product of (£). We can thus express (3.11) as

Thus any (j>(x) that satisfies (3.5) and (3.6), which may or may not be piecewise polynomial, can be constructed via the convolution of the B-spline with a distribution with compact support. If n > 1, no such divisor (j>/&k exists in general. R e m a r k 7. Theorem 3.3 has an especially simple interpretation for satisfying (3.5) and (3.6), and whose support is a symmetric interval about 0;

Downloaded from Cambridge Books Online by IP 202.121.96.27 on Tue Nov 09 09:28:44 GMT 2010.

SURVEY OF MESHLESS AND GENERALIZED FINITE ELEMENT METHODS

15

namely, supp D [ - ^ S ^2^], and hence grows with k. As mentioned above, the support of Uk{%) is [~^2^> ^2^]' an. For example, * can be constructed as a linear combination of translates of (j). R e m a r k 1 1 . For the sake of simplicity, suppose k = 2 or 3 in this remark. Consider the function