Acta Numerica (2011), pp. 1–119 doi:10.1017/S096249291100002X
c Cambridge University Press, 2011 Printed in the United Kingdom
Topics in structure-preserving discretization∗ Snorre H. Christiansen Centre of Mathematics for Applications and Department of Mathematics, University of Oslo, NO-0316 Oslo, Norway E-mail:
[email protected]
Hans Z. Munthe-Kaas Department of Mathematics, University of Bergen, N-5008 Bergen, Norway E-mail:
[email protected]
Brynjulf Owren Department of Mathematical Sciences, Norwegian University of Science and Technology, NO-7491 Trondheim, Norway E-mail:
[email protected] In the last few decades the concepts of structure-preserving discretization, geometric integration and compatible discretizations have emerged as subfields in the numerical approximation of ordinary and partial differential equations. The article discusses certain selected topics within these areas; discretization techniques both in space and time are considered. Lie group integrators are discussed with particular focus on the application to partial differential equations, followed by a discussion of how time integrators can be designed to preserve first integrals in the differential equation using discrete gradients and discrete variational derivatives. Lie group integrators depend crucially on fast and structure-preserving algorithms for computing matrix exponentials. Preservation of domain symmetries is of particular interest in the application of Lie group integrators to PDEs. The equivariance of linear operators and Fourier transforms on non-commutative groups is used to construct fast structure-preserving algorithms for computing exponentials. The theory of Weyl groups is employed in the construction of high-order spectral element discretizations, based on multivariate Chebyshev polynomials on triangles, simplexes and simplicial complexes. The theory of mixed finite elements is developed in terms of special inverse systems of complexes of differential forms, where the inclusion of cells corresponds to pullback of forms. The theory covers, for instance, composite ∗
Colour online available at journals.cambridge.org/anu.
2
S. H. Christiansen, H. Z. Munthe-Kaas and B. Owren piecewise polynomial finite elements of variable order over polyhedral grids. Under natural algebraic and metric conditions, interpolators and smoothers are constructed, which commute with the exterior derivative and whose product is uniformly stable in Lebesgue spaces. As a consequence we obtain not only eigenpair approximation for the Hodge–Laplacian in mixed form, but also variants of Sobolev injections and translation estimates adapted to variational discretizations.
CONTENTS 1 2
Introduction Integration methods based on Lie group techniques 3 Schemes which preserve first integrals 4 Spatial symmetries, high-order discretizations and fast group-theoretic algorithms 5 Finite element systems of differential forms Appendix References
2 5 21 32 65 108 112
1. Introduction The solution of partial differential equations (PDEs) is a core topic of research within pure, applied and computational mathematics. Both measured in the volume of published work1 and also in terms of its practical influence on application areas such as computational science and engineering, PDEs rank above all other mathematical subjects. Historically, the field of numerical solutions of PDEs has its roots in seminal papers by Richard Courant and his students Kurt Friedrichs and Hans Lewy, in the early twentieth century. Among the nearly 4000 academic descendants of Courant we find a large fraction of the key contributors to the field, such as Friedrichs’ student Peter Lax, who received the Abel Prize in 2005 for his ground-breaking contributions to the theory and application of PDEs. Fundamental properties of PDE discretizations, which have been recognized as crucial ever since the days of the Old Masters, include accuracy, stability, good convergence properties and the existence of efficient computational algorithms. In more recent years various aspects of structure preservation have emerged as important in addition to these fundamental properties. 1
A count of all mathematical publications from 2001 to 2010, sorted according to the AMS Mathematics Subject Classification, reveals that number 35 PDEs ranks highest of all primary topics with 46 138 entries; in second place is 62 Statistics, with 39 176.
Topics in structure-preserving discretization
3
Within the topics of ordinary differential equations and time integration, a systematic study of structure-preserving discretizations was undertaken by Feng Kang in Beijing, starting in the 1980s. During the past decade a systematic study of the preservation of various geometric structures2 has evolved into a mature branch of numerical analysis, termed the geometric integration of differential equations (Hairer, Lubich and Wanner 2006, Leimkuhler and Reich 2004, Sanz-Serna and Calvo 1994). Experience has shown that the preservation of geometric properties can have a crucial influence on the quality of the simulations. In long-term simulations, structure preservation can have a dramatic effect on stability and global error growth. Examples of such structures are symplecticity, volume, symmetry, reversibility and first integrals. In short-term simulations it is frequently seen that discretization schemes designed with structure preservation in mind enjoy small errors per step, and hence become efficient for shorter time simulations too. An important class of problems is that of partial differential equations whose solutions may be subject to blow-up in finite time. We have seen that schemes which are designed to inherit certain symmetries of the continuous problem tend to perform well in capturing such finite-time singularities in the solution. For spatial PDEs, a parallel investigation of compatible discretizations has been undertaken (Arnold, Bochev, Lehoucq, Nicolaides and Shashkov 2006a). The equations of mathematical physics (describing fluids, electromagnetic waves or elastic bodies, for instance) have been presented in geometric language, easing the construction of discretizations which preserve important geometric features, such as topology, conservation laws, symmetries and positivity structures. When well-posedness of the continuous PDE depends on the conservation or monotonicity of certain quantities, such as energy, it seems equally important for the stability of numerical schemes that they enjoy similar properties. Rather than approximately satisfying the exact conservation law, as – it could be argued – any consistent scheme would do, it seems preferable, in order to obtain stable methods, to exactly satisfy a discrete conservation law. For PDEs written in terms of grad, curl and div acting on scalar and vector fields, one is led to construct operators acting on certain finite-dimensional spaces of scalar and vector fields, forming a complex which, in spatial domains with trivial topology, is an exact sequence. More generally, various discretizations of the de Rham sequence of differential forms have been introduced, and the successful ones are related to constructs of combinatorial topology such as simplicial cochain complexes (Arnold, Falk and Winther 2010).
2
A geometric structure is understood as a structural property which can be defined independently of particular coordinate representations of the differential equations.
4
S. H. Christiansen, H. Z. Munthe-Kaas and B. Owren
This survey paper takes a view of PDEs analogous to looking at the moon through a telescope with very high magnification. In the vast lunar landscape we will focus on a small number of craters with particularly beautiful properties, and leave the rest of the lunar surface out of our main focus. One goal of the paper has been to tie together recent time integration techniques, in particular Lie group techniques and integral-preserving integration, and combine these with recent developments in structure-preserving spatial discretizations. The paper consists of four main parts: Sections 2–5. Section 2 covers integration methods based on Lie group techniques. We provide an introduction to the theory of Lie group integrators and describe how computational algorithms can be devised, given a group action on a manifold and coordinates on the acting group. Various choices of coordinates are discussed. Another type of Lie group integrator consists of those based on compositions of flows, and we discuss some applications of these methods to the time integration of PDEs. We focus in particular on applications outside the class of exponential integrators for semilinear problems. In Section 3 we discuss integral-preserving schemes. These methods apply to any PDE which has a known first integral, for instance an energy functional. We demonstrate how the method of discrete variational derivatives can be used to devise integral-preserving time integration schemes for PDEs. We consider, in particular, schemes that are linearly implicit, and therefore need the solution of only one linear system per time step. We also discuss methods which apply discrete variational derivatives, or discrete gradients, to conserve an arbitrary number of first integrals. In Section 4 we cover spatial symmetries, high-order discretizations and fast group-theoretic algorithms. The topic of this section is the exploitation of spatial symmetries. A recurring theme is that of linear differential operators commuting with groups of isometries acting on the domain. We investigate high-order spectral element discretization techniques based on simplicial subdivisions (into triangles, tetrahedra and simplexes in general) using high-order multivariate Chebyshev bases on the triangles. The efficient computation of matrix (and operator) exponentials is crucial for time integrators based on Lie group actions. We survey recent work on high-order discretization techniques, fast Fourier algorithms based on group-theoretic concepts and fundamental results from representation theory. In Section 5 we discuss finite element systems for differential forms. A framework for mixed finite elements is developed, general enough to allow for non-polynomial basis functions and a decomposition of space into noncanonical polytopes, but restrictive enough to yield spaces with local bases, interpolators commuting with the exterior derivative, and exact sequences where desirable. A smoothing technique gives Lq -stable commuting quasiinterpolation operators, from which various error estimates can be derived.
Topics in structure-preserving discretization
5
2. Integration methods based on Lie group techniques The use of Lie group techniques for obtaining solutions to differential equations dates back to the Norwegian mathematician Sophus Lie in the second half of the nineteenth century. In Lie’s time these were used exclusively as analytical tools; however, more recently it has become increasingly popular to include Lie groups as an ingredient in numerical methods. The use of Lie groups in the numerical approximation of differential equations can be divided into two categories: one in which the aim is to preserve symmetries or invariance of the continuous model, and another in which Lie groups are used as building blocks for a time-stepping procedure. In this section we shall give a brief introduction to the mathematical machinery we use, and we will focus on the second category, that of using Lie groups as a fundamental component when designing numerical time integrators. We shall give a short introduction to the basics of Lie group integrators; for more details consult Iserles, Munthe-Kaas, Nørsett and Zanna (2000) and Hairer et al. (2006). The variety of studies related to Lie group integrators is now too large to cover in an exposition of this type. For this reason we shall focus on a selected part of the theory, and mostly consider integrators designed for nonlinear problems. Important classes of schemes that we shall not discuss here are methods based on the Magnus expansions and Fer expansions, usually applied to linear differential equations. This work developed in the 1990s, in large part due to Iserles and Nørsett: see, e.g., Iserles and Nørsett (1999). There are several excellent sources for a summary of these methods and their analysis, for instance the Acta Numerica article by Iserles et al. (2000), the monograph by Hairer et al. (2006) and the more recent survey by Blanes, Casas, Oteo and Ros (2009), which also contains many applications of these integrators. 2.1. Background and notation Let M be some differentiable manifold and let X (M ) be the set of smooth vector fields on M . We consider every X ∈ X (M ) as a differential operator on the set of smooth functions F(M ) on M . Thus, in local coordinates (x1 , . .∂. , xm ) in which X has components X1 , . . . , Xm , we write X = i Xi (x) ∂xi , so X[f ] = df (X), f ∈ F(M ) is the directional derivative of f along the vector field X. The flow of a vector field X ∈ X (M ) is a one-parameter family of maps exp(tX) : Dt → M , where Dt ⊂ M . For any x ∈ Dt we have exp(tX)x = γ(t), where γ(t) ˙ = X|γ(t) ,
γ(0) = x,
t ∈ (a(x), b(x)), a(x) < 0 < b(x).
The domain for exp(tX) is the set Dt = {x ∈ M : t ∈ (a(x), b(x))}; for further details see, e.g., Warner (1983, 1.48).
6
S. H. Christiansen, H. Z. Munthe-Kaas and B. Owren
The chain rule for the derivative of compositions of maps between manifolds is (ψ ◦ φ) = ψ ◦ φ , φ : M → N, ψ : N → P. From this, we easily obtain the useful formula X[f ◦ φ](x) = φ (X|x )[f ](y),
φ : M → N, X ∈ X (M ), f ∈ F(N ), (2.1) for x ∈ M, y = φ(x).
The Lie–Jacobi bracket on X (M ) is defined simply as the commutator of vector fields Z = [X, Y ] = XY − Y X. With respect to coordinates (x1 , . . . , xm ) it has the form Zi = [X, Y ]i =
m j=1
Xj
∂Yi ∂Xi − Yj . ∂xj ∂xj
This bracket makes X (M ) a Lie algebra; the important properties of the bracket is that it is bilinear, skew-symmetric and satisfies the Jacobi identity [X, [Y, Z]] + [Y, [Z, X]] + [Z, [X, Y ]] = 0,
∀X, Y, Z ∈ X (M ).
It is an easy consequence of (2.1) that φ ([X, Y ]) = [φ (X), φ (Y )],
X, Y ∈ X (M ), φ : M → N.
(2.2)
We say that Y is φ-related to X ∈ X (M ) if Y |φ(x) = φ (X|x ) for each x ∈ M . Note that Y is not generally a vector field on N : since φ does not have to be either injective or surjective, we must treat Y as a pullback section of φ∗ T N over M . In the particular case when φ is a diffeomorphism, there is a unique Y ∈ X (N ) which is φ-related to X; this vector field is then called the pushforward of X with respect to φ: Y = φ∗ X = φ (X) ◦ φ−1 . A Lie group G is a differentiable manifold which is furnished with a group structure such that the multiplication is a smooth map from G × G to G, and the map g → g −1 , g ∈ G is smooth as well. We briefly review some important concepts related to Lie groups. Every Lie group G has a Lie algebra associated to it, which can be defined as the linear subspace g ⊂ X (G), of right-invariant vector fields on G equipped with the Lie–Jacobi bracket. By right-invariance we mean invariance under right translation. Consider the diffeomorphism Rg : G → G defined as Rg (h) = h · g. A vector field X ∈ X (G) is right-invariant if it is Rg -related to itself, i.e., Rg∗ X = X. By (2.2) it follows that the Lie–Jacobi bracket between two right-invariant vector fields is again right-invariant. For every v ∈ Te G, where e is the identity element, there is a unique Xv ∈ g such that Xv |g = Rg (v), and for X ∈ X (G) there is an element vX ∈ Te G given as vX = X|e . This shows that g is isomorphic to Te G, and it may often be convenient to represent
Topics in structure-preserving discretization
7
g as Te G rather than as right-invariant vector fields on G. We next let the group act locally on a manifold. A left group action on a differentiable manifold M by a Lie group G is a map G × M → M , which we denote as y = g · x ∈ M or simply y = gx for g ∈ G and x ∈ M . The group action must satisfy the conditions e · x = x, ∀x ∈ M,
g · (h · x) = (g · h) · x.
The group action is said to be free if g · x = x ⇒ g = e, so that the only group element which leaves x ∈ M fixed is the identity element. If it is true that for every pair of points x ∈ M, y ∈ M there exists a group element g such that y = g · x, the action is called transitive. We usually just need a local version of transitivity, requiring that for every x ∈ M , G · x contains some open neighbourhood of x. The orbit of the group action containing x is the set Ox = {g · x | g ∈ G}. It is sometimes useful to restrict the action to an orbit when transitivity is a desired property. Similarly, if one needs the group action to be free, it may be useful to extend the action to multispace M ×r M (r copies of M ) or to a suitable jet space whenever M takes the form of a fibred space. Let G be a Lie group with Lie algebra g. Assume that G acts locally on the manifold M , and set Λx (g) = g · x for g ∈ U ⊆ G, x ∈ M where U is some open neighbourhood of the identity element. For every fixed v ∈ g there is a vector field Xv ∈ X (M) defined by d Xv |x = λ∗ (v)|x = Λx (v) = γ(t) · x, dt t=0
where γ(t) is any smooth curve on G such that γ(0) = e, γ(0) ˙ = v. So λ∗ is a Lie algebra homomorphism of g into its image in X (M ). For Lie group integrators, it is important that the action is locally transitive; in this case it is true that for every x ∈ X λ∗ (g)|x = Tx M. This property means, in particular, that for any smooth vector field F ∈ X (M ) there exists a map f : M → g such that F |x = λ∗ (f (x))|x ,
(2.3)
a formulation called the generic presentation of ODEs on manifolds by Munthe-Kaas (1999). If the action is free then the map f (x) is unique for a given vector field F . Suppose further that the Lie algebra g is of dimension d and let e1 , . . . , ed be a basis for g. Let Ei = λ∗ (ei ), i = 1, . . . , d. We ¯ = span{E1 , . . . , Em }, that is, call the set {E1 , . . . , Ed } a frame,3 and let g 3
In the literature, a ‘frame’ is often used as a local object requiring that E1 |x , . . . , Ed |x is a basis for Tx M . We do not impose this condition here per se, as we find it useful to have a global representation of vector fields on M .
8
S. H. Christiansen, H. Z. Munthe-Kaas and B. Owren
the linear span of the frame fields over R or C. Now we can represent any smooth vector field X ∈ X (M ) by means of d functions fi : M → R: F |x =
d
fi (x) Ei |x .
(2.4)
i=1
The set of functions fi is uniquely given only if the action is free. There are two alternative ways to proceed, following either the terminology introduced by Crouch and Grossman (1993) or that of Munthe-Kaas (1995, 1998, 1999). ¯ In the former case, one introduces a freeze operator Fr : M × X (M ) → g relative to the frame. It is defined by fi (p)Ei |x . (2.5) Xp |x := Fr(p, X)|x = i
The frozen vector field Xp has the property that it coincides with the unfrozen field X at the point x = p, i.e., Xp |x = X|x . A main assumption underlying many Lie group integrators is that flows of frozen vector fields can be calculated, or in some cases approximated with acceptable computational cost. 2.2. Integrators based on coordinates on the Lie group In what follows, we shall take g to be Te G. Consider a diffeomorphism defined from some open subset of U ⊆ g containing 0, i.e., Ψ : U → G and we require that Ψ(0) = e, Ψ0 (v) = v, ∀v ∈ g. For convenience, we shall work with a right-trivialized version of Ψu , setting ◦ dΨu , Ψu = RΨ(u)
dΨu : g → g.
Let the group act locally on the manifold M ; suppose that the action is defined on a subset Gp ⊆ G, where Ψ(U ) ⊂ Gp for every p ∈ M . For any p ∈ M and u ∈ U , set λp (u) = Ψ(u) · p, and let f : M → g represent the vector field F ∈ X (M ) through the form (2.3). We define the vector field F˜p on X (U ) by F˜p = dΨ−1 (2.6) u f (λp (u)). u
A simple calculation (Munthe-Kaas 1999, Owren and Marthinsen 2001) shows that F is λp -related to F˜ such that, for any u ∈ U , we have F |λp (u) = λp u (F˜p |u ). This local relatedness between vector fields F of the form (2.3) whose flows are to be approximated, and vector fields on the algebra of the acting group serves as the key underlying principle of many Lie group integrators. The idea is that near any point p ∈ M one may represent curves in the form y(t) = λp (σ(t)), and if the differential equation for y(t) is given by F , then a differential equation for σ(t) is that of F˜ . Most of the known integrators for ODEs have the property that when the solution belongs to
Topics in structure-preserving discretization
9
some linear space, the numerical method will provide approximations for the solution belonging to the same linear space. So one may now approximate solutions to the ODE given by F˜ , and obtain numerical approximations in the linear space g. The map λp will then map these approximations onto M by definition. One may typically choose the initial value in each step to be p, so that when solving for σ in g one sets σ(tn ) = 0. Suppose that a one-step method map which preserves linear structure is denoted Φh,F˜p , where h is the time step. Algorithm 2.1. for n = 0, 1, . . . do p ← yn σn+1 ← Φh,F˜p (0) yn+1 ← λp (σn+1 ) end for We may be more specific and for instance insist that the scheme Φh,F˜ to be used in the Lie algebra is an explicit Runge–Kutta method, with weights bi and coupling coefficients aji , 1 ≤ j < i ≤ s. In this case we can phrase the scheme as follows for integrating a system in the form (2.3) from t0 to t0 + h, with initial value y(t0 ) = y0 ∈ M . Algorithm 2.2. (Runge–Kutta–Munthe-Kaas) for i = 1 → s do j ui ← h i−1 j=1 ai kj ki ← f (Ψ(ui ) · y0 ) ki ← dΨ−1 ui (ki ) end for v ← h sj=1 bj kj y1 = Ψ(v) · y0 An obvious benefit of schemes of this form is that they will preserve the manifold structure, a feature which cannot be expected when M is modelled as some embedded submanifold of Euclidean space. If the manifold happens to belong to a level set of one or more first integrals, then the Lie group integrators will automatically preserve these integrals. There are, however, other interesting situations, when the group action is used as a building block for obtaining a more accurate representation of the exact solution than is possible with other methods. The idea behind Lie group integrators can also be seen as a form of preconditioning. Coordinate maps. The computational cost of the Lie group integrators is an important issue, and the freedom one has in choosing the coordinate map Ψ may be used to optimize the computational cost. The generic choice for Ψ(u) is of course the exponential map Ψ(u) = exp u. This choice is called
10
S. H. Christiansen, H. Z. Munthe-Kaas and B. Owren
canonical coordinates of the first kind. If the Lie group and its Lie algebra are realized as matrices, we have exp u =
∞ uk k=0
k!
.
Issues related to computing the matrix exponential have been thoroughly debated in the literature, going back to the seminal paper of Moler and Van Loan (1978), and its follow-up, Moler and van Loan (2003). For dense n × n matrices one would normally expect a computational complexity of approximately C n3 , where C will depend on several factors, as the tolerance for the accuracy, the size of the matrix elements and the conditioning of the matrix. The methods presented in these papers, however, do not usually respect the Lie group structure, such that an approximation g˜ ≈ exp u, u ∈ g will not belong to the group, i.e., g˜ ∈ G; this is a crucial issue as far as exact conservation is concerned. In practice, one is left with two alternatives. (1) Apply a standard method which yields g = exp u to machine accuracy. For relevant examples with Lie group integrators, the factor C typically lies in the range 20–30 (Owren and Marthinsen 2001). (2) Apply some approximation which is not exact, but which respects the Lie group structure, i.e., g˜ ≈ exp u with g˜ ∈ G. This approach has been pursued by Celledoni and Iserles (2000, 2001) for approximation by low-rank decomposition, as well as Zanna and Munthe-Kaas (2001/02) and Iserles and Zanna (2005) by means of the generalized polar decomposition. These approaches still have a computational cost of C n3 for Lie algebras whose matrix representation yields dense matrices, but the constant C may be smaller than for the general algorithms. It is interesting to explore other possible choices of analytic matrix functions than the exponential. One then replaces the exponential map with some local diffeomorphism from a neighbourhood of 0 ∈ g to G, usually required to map 0 → e. But it turns out that the exponential map is the only possible choice of analytic map that works for all Lie groups: this is asserted, for instance, using a result by Kang and Shang (1995). Lemma 2.3. Let sl(d) denote the set of all d × d real matrices with trace equal to zero and let SL(d) be the set of all d × d real matrices with determinant equal to one. Then, for any real analytic function R(z) defined in a neighbourhood of z = 0 in C satisfying the conditions: R(1) = 1 and R (0) = 1, we have that R(sl(d)) ⊆ SL(d) for some d ≥ 3 if and only if R(z) = exp(z). They prove this result by taking the Lie group SL(d) of unit determinant d × d matrices, d ≥ 3, whose Lie algebra sl(d) consists of d × d matrices with
11
Topics in structure-preserving discretization
trace zero as an example: see also Hairer et al. (2006, p. 102). There are, however, exceptions when certain specific Lie groups are considered. For instance, if a matrix group GJ and its corresponding Lie algebra gJ can be characterized as GJ = {A ∈ GL(d) : A JA = J},
gJ = {a ∈ gl(d) : a J + Ja = 0}, (2.7)
for some fixed d × d matrix J, it turns out that every analytic function R(z) satisfying R(z)R(−z) = 1
(2.8)
will have the property a ∈ gJ ⇒ R(a) ∈ GJ . Such groups include the symplectic group Sp(d), the orthogonal groups O(d), SO(d), and the Lorenz groups SO(, d − ). One of the most popular choices of maps that satisfies (2.8) is the Cayley transformation Ψcay (z) =
1+z . 1−z
This transformation was used by Lewis and Simo (1994), and later by Diele, Lopez and Peluso (1998) for the group SO(d), Lopez and Politi (2001) for general groups of the form (2.7), and Marthinsen and Owren (2001) for linear equations. If one does not require the map to be realizable as an analytic function of the Lie algebra matrix, there are other choices, for instance the canonical coordinates of the second kind. This map requires the use of a basis for g, say v1 , . . . , vs where s = dim g. Then the map is defined as Ψccsk : v = α1 v1 + · · · + αs vs → exp(α1 v1 ) · exp(α2 v2 ) · · · exp(αs vs ). Here, the choice as well as the ordering of the basis is clearly an issue. In Owren and Marthinsen (2001) this coordinate map was, together with a generic basis of the Lie algebra, known as the Chevalley basis. The main advantage of this map is that when matrices are used, natural choices of bases are frequently realized as sparse matrices whose exponentials may be explicitly known. As an example, one may consider the special linear group SL(d), which can be realized as the set of d × d matrices with unit determinant. The Lie algebra is then the set of trace-free d × d matrices, and the Chevalley basis is obtained by choosing d − 1 trace-free diagonal matrices, say ei+1 e i+1 − ei ei , 1 ≤ i ≤ d − 1 together with all matrices ei ej , j = i. Also, hybrid variants are possible, where, for instance, the Lie algebra is decomposed into a direct sum of subspaces, say g = g1 ⊕ g2 ⊕ · · · ⊕ gs¯,
s¯ j=1
dim(gj ) = s,
12
S. H. Christiansen, H. Z. Munthe-Kaas and B. Owren
and a coordinate map can be realized as Ψhyb : v = v1 + · · · + vs¯ → exp(v1 ) · · · exp(vs¯),
vi ∈ gi .
In fact, such coordinate maps derived from the generalized polar decomposition were considered in Krogstad, Munthe-Kaas and Zanna (2009). Computing the inverse differential. In the transformation of the vector field to the Lie algebra, one needs to compute the inverse of the differential dΨ−1 u v. For the case of the exponential mapping, it was found by Baker (1905) and Hausdorff (1906) that it can be expanded in an infinite series of commutators. Defining the operator adu (v) = [u, v], for any u and v in g, we have ∞ Bk k −1 ad (v). (2.9) dexpu v = k! u k=0
Here, the constants Bk are the Bernoulli numbers, B2k+1 = 0, k ≥ 1, and the first non-zero ones are B0 = 1, B1 = −1/2, B2 = 1/12, B4 = −1/720. We will not dwell on the convergence properties of this series (discussed, for instance, in Varadarajan (1984)), the reason being an observation made by Munthe-Kaas (1999). The series (2.9) may be truncated at any point to yield an approximation in the Lie algebra g. Since one usually requires that the initial point of each time step in the Lie algebra, σ0 = 0, it follows that the term of index k will be of at least order hk as h → 0. It is therefore sufficient to truncate the series at an index that is consistent with the convergence order of the time-stepper Φh,F˜ . An extensive analysis of the number of terms that must be kept in such commutator expansions was presented in Munthe-Kaas and Owren (1999), but see also McLachlan (1995). Considering the coordinate maps Ψccsk and Ψhyb , their inverse differential maps are studied in Owren and Marthinsen (2001) and Krogstad et al. (2009) respectively. In these cases, the maps are computed exactly, but by carefully studying the structural properties of the respective Lie algebras it is possible to find computationally inexpensive algorithms: typically, if the 3/2 ). dimension of the Lie algebra is d, the cost of computing dΨ−1 u (v) is O(d Choosing the group and the group action. A particularly interesting case for a global group action is the homogeneous space. If the group G is acting transitively on M , then the manifold is called a homogeneous space. In this case it is well known (see, e.g., Bryant (1995)) that M is naturally diffeomorphic to G/Gp , where Gp is the isotropy or stabilizer subgroup of G, Gp = {g ∈ G : g · p = p}. The simplest case is when the action is free, so that Gp = e for all p ∈ M , meaning M ∼ = G. In this case the function f in (2.3) is unique, and there is no isotropy. In the case that there is a non-trivial isotropy group, the choice
Topics in structure-preserving discretization
13
of f is not unique, in fact f may be replaced by f + w, where w(x) ∈ ker λ∗ for every x ∈ M . It turns out that the choice of w affects the numerical integrator. We proceed to give some examples frequently seen in applications: see Munthe-Kaas and Zanna (1997). Suppose that the Lie group G = SO(d) is a group of orthogonal d × d matrices. Its Lie algebra is so(d), the set of d × d matrices which are real and skew-symmetric. The manifold M is a connected open subset of the d × r matrices, and we give two examples. (1) Let the Lie group action be left multiplication g · m where · is now just matrix–matrix multiplication. We may now write the ODE vector field as: F |y = f (y) · y,
f : M → g.
(a) M is the set of vectors in Rd with unit length, identified with the (d − 1)-dimensional sphere S d−1 . (b) M is the set of d × r matrices with orthonormal columns, identified with the Stiefel manifold Vr (Rd ). (2) r = d, and the Lie group action is the conjugation g · m = gmg , the right-hand side is just products of matrices. We may choose M to be some isospectral set, such as the set of all matrices with a given prescribed Jordan form; one may also restrict to the set of symmetric matrices with a fixed set of eigenvalues. Another interesting choice is the affine group, first discussed in the context of Lie group integrators in Munthe-Kaas (1999). One may start with the group G = GL(d) Rd , the semidirect product between the general linear group and Rd . G is the group of all affine linear maps acting on Rd ; we have (A, a) · y = Ay + a. The group product is given as (A, a) · (B, b) = (AB, Ab + a). The corresponding Lie algebra is g = gl(d) Rd and the Lie bracket is given as [(A, a), (B, b)] = ([A, B], Ab − Ba). The exponential mapping can be expressed in terms of the matrix exponential exp(A, b) = (exp(A), dexpA (b)), where
∞
dexpA (b) =
exp(A) − I 1 b= Aj b. A (j + 1)! j=0
Munthe-Kaas made the observation that this action has a large isotropy group: the dimension of the group is d(d + 1) whereas the manifold M = Rd
14
S. H. Christiansen, H. Z. Munthe-Kaas and B. Owren
only has dimension d. Setting λp (A, a) = exp(A, a)·p = exp(A)p+dexpA (a), we find λ∗ (A, a)(y) = Ay + a, such that the isotropy algebra at y consists of all elements in G of the form (A, −Ay). Suppose that the ODE vector field is F . Then at one extreme one may choose f (y) = (0, F |y ), in which case one would recover the method Φh,F in the algorithm described above. However, as suggested in Munthe-Kaas (1999), one may instead add to this the element (J, −Jy), J ∈ GL(d) from ker λ∗ (.)(y), to obtain the function f (y) = (J, F |y − Jy), and a natural choice for J would be the Jacobian of the vector field F evaluated at some point near y. One may also replace the group GL(d) by a subgroup: the group SO(d) yields the special Euclidean group SE(d), whereas in applications to PDEs a popular choice is to select some oneparameter subgroup exp(tL), L ∈ gl(d). The Lie subalgebra elements are now of the form (αL, a) with fixed L; thus one may just write (α, a) ∈ R×Rd , and the Lie bracket of this subalgebra is simply [(α, a), (β, b)] = [0, L(αb − βa)].
(2.10)
The isotropy group Gp is now only one-dimensional; its Lie algebra is spanned by the element (1, −Lp). Time-symmetric Lie group integrators. For many problems it is of interest to apply integrators which are symmetric in time or self-adjoint. For onestep methods, say y1 = φh (y0 ), this means that if the integrator is applied backwards in time, i.e., with step size −h and y1 as input, the output y0 results, such that φh = φ−1 −h . For Lie group integrators, one may consider as an example the Runge–Kutta–Munthe-Kaas scheme based on the midpoint rule, using the coordinate map Ψ = exp. This scheme is an implicit counterpart to the method given in Algorithm 2.2: u=
h k, 2
k = f (exp(u) · y0 ),
y1 = exp(hk) · y0 .
Here we have omitted the correction dexp−1 u , since it is not going to alter the order of the method. Following Zanna, Engø andMunthe-Kaas (2001), we define the midpoint approximation y 1 = exp 12 hu · y0 ; the method may 2 be written in the form h h f y 1 .y 1 , y0 = exp − f y 1 .y 1 , y1 = exp 2 2 2 2 2 2
Topics in structure-preserving discretization
15
which is easily seen to be symmetric. Unfortunately, Lie group integrators based on coordinates on the Lie group are not generally symmetric even if the underlying scheme on the Lie algebra is a symmetric method. Zanna et al. (2001) considers how a recentering of the coordinate system for the Lie group can be used to obtain symmetric integrators. Rather than letting Ψ(0) = e be the base point of the coordinate chart, one may choose a θ ∈ g and define a new base point q := Ψ(θ)−1 · y0 . The curve y(t) ∈ G is now represented locally by a curve σ(t) ∈ g, as y(t) = Ψ(σ(t)) · q = Ψ(σ(t)) · Ψ(θ)−1 · y0 . This shift of coordinate chart results in the same differential equation for σ(t), but with initial value σ(0) = θ corresponding to y(0) = y0 . An implicit Runge–Kutta-type method generalizes Algorithm 2.2 as follows: σi = θ + h sj=1 aji kj , −1 i = 1, . . . , s, (2.11) ki = f (Ψ(σi ) · Ψ(θ) · y0 ), ki = dΨ−1 σi (ki ), v = θ + h si=1 bi ki , y1 = Ψ(v) · Ψ−1 (θ) · y0 . The idea is now to choose the centre θ depending on the stages ki and h in such a way that the resulting method is symmetric whenever the underlying Runge–Kutta scheme is symmetric. From Zanna et al. (2001) we find that this can be achieved by setting θ = θ(h; k1 , . . . , ks ) and requiring it to satisfy θ(−h; ks , . . . , k1 ) = θ(h; k1 , . . . , ks ) + h
s
bi ki .
(2.12)
i=1
There is of course no unique way of satisfying (2.12). An obvious choice which has been called the geodesic midpoint is h i b ki , 2 s
θ(h, k1 , . . . , ks ) = −
i=1
but in fact, one may choose more generally θ(h; k1 , . . . , ks ) = −h
s i=1
w i ki ,
where ws+1−i + wi = bi ,
i = 1, . . . , s.
16
S. H. Christiansen, H. Z. Munthe-Kaas and B. Owren
A concrete example of a symmetric scheme in the format (2.11), using the geodesic midpoint for θ and the 2-stage Gauss method is h θ = − (k1 + k2 ), 4√ 3 k2 , σ1 = −h 6 k1 = f (Ψ(σ1 ) · Ψ(θ)−1 · y0 ),
√
3 k1 , 6 k2 = f (Ψ(σ2 ) · Ψ(θ)−1 · y0 ),
σ2 = h
k2 = dΨ−1 k1 = dΨ−1 σ1 (k1 ), σ2 (k2 ), h y1 = Ψ(v) · Ψ(θ)−1 · y0 . v = (k1 + k2 ), 4 McLachlan, Quispel and Tse (2009) recently studied symmetric and symplectic schemes which are linearization-preserving at fixed points, meaning that if y¯ is such that f (¯ y ) = 0 in the initial value problem y = f (y), y(0) = y0 then the integrator has the Taylor expansion about y¯:
y1 − y¯ = exp(hf (¯ y ))(y0 − y¯) + O(y0 − y¯2 ). Symmetric schemes for a class of exponential integrators applied to semilinear problems were proposed by Celledoni, Cohen and Owren (2008). 2.3. Lie group integrators based on compositions of flows A pioneering article by Crouch and Grossman (1993) suggests applying compositions of flows of frozen vector fields (2.5) to construct integration methods for vector fields which have been expressed in the form (2.4). They propose such generalizations both of multistep methods and of explicit Runge– Kutta methods. The latter takes a step from t0 to t0 + h as follows. Algorithm 2.4. (Crouch–Grossman) Y1 ← y0 F1 ← Fr(Y1 , F ) for r = 2 → s do 1 Yr ← exp(har−1 r Fr−1 ) · · · exp(har F1 )(y0 ) Fr ← Fr(Yr , F ) end for y1 ← exp(hbs Fs ) · · · exp(hb1 F1 )(y0 ) Here, br , akr are the weights and the coupling coefficients of the Runge– Kutta method. Explicit third-order with s = 3 were presented in Crouch and Grossman (1993), and Owren and Marthinsen (1999) presented a general theory of order conditions and examples of fourth-order methods with four stages. A potential drawback of the Crouch–Grossman methods is that they require the computation of a large number of flows of frozen vector fields in every time step. This led Celledoni, Marthinsen and Owren
Topics in structure-preserving discretization
17
(2003) to consider a version of these methods where flows of arbitrary linear combinations of frozen vector fields were considered. The methods take the following form. Algorithm 2.5. (Commutator-free methods) Y 1 ← y0 F1 ← Fr(Y1 , F ) for r = 2 → s do k k F ) · · · exp(h Yr ← exp(h k αr,J k k αr,1 Fk )(y0 ) Fr ← Fr(Yr , F ) end for y1 ← exp(h k βJk Fk ) · · · exp(h k β1k Fk )(y0 ) Note that when the vector fields commute, the expressions for Yr and y1 collapse to k k ar Fk (y0 ), y1 = exp b Fk (y0 ), Yr = exp k
k
where akr
=
J j=1
k αr,j ,
k
b =
J
βjk .
j=1
These coefficients correspond to the akr , bk in the Runge–Kutta–MuntheKaas methods, and they must in particular satisfy the classical order conditions for Runge–Kutta methods. The key idea of the commutator-free methods is to keep the number of exponentials or flows as low as possible in each stage. In Celledoni et al. (2003) the following fourth-order method was presented: Y 1 = y0 , Y2 Y3 Y4 y1
F1 = Fr(Y1 , F ), = exp 2 hF1 (y0 ), F2 = Fr(Y2 , F ), 1 = exp 2 hF2 (y0 ), F3 = Fr(Y3 , F ), (2.13) 1 = exp − 2 hF1 + hF3 (Y2 ), F4 = Fr(Y4 , F ), h h = exp 12 (−F1 + 2F2 + 2F3 + 3F4 ) exp 12 (3F1 + 2F2 + 2F3 − F4 ) (y0 ). 1
Note that if the number of exponentials is counted according to the format of Algorithm 2.5, we would have two exponentials in the expression for Y4 , but since the rightmost exponential coincides with Y2 , we effectively compute only one exponential in each stage Yr , r = 2, 3, 4 and two exponentials in y1 , and thus the total number of flow calculations in this method is 4. In comparison, the methods of Crouch and Grossman would require 10 flow calculations. A complete description of the order theory for this type of method was given in Owren (2006). Wensch, Knoth and Galant (2009)
18
S. H. Christiansen, H. Z. Munthe-Kaas and B. Owren
extend the idea of re-using flow calculations, as with Y2 in (2.13), to allow for the composition of exponentials to be applied to more general expressions involving y0 and the stage values Yi . For the case of linear differential equations, one can design commutator-free methods based on the Magnus series expansions: see Blanes and Moan (2006). 2.4. Applications of Lie group integrators to PDEs The Lie group integrators described in the preceding sections can be used as time-steppers in solving partial differential equations. It should come as no surprise that these integrators are intimately linked to a well-known class of methods known as ‘exponential integrators’, which go back to the early 1960s in pioneering work by Certaine (1960), Nørsett (1969) and Lawson (1967). An excellent account of these methods was presented in a recent Acta Numerica article by Hochbruck and Ostermann (2010), and we refer the reader to that article and the references therein for a detailed account of exponential integrators. There are several important papers which study analytical properties of exponential integrators, in particular for parabolic problems. An important issue is to describe the convergence order in the presence of unbounded operators: see, for instance, Hochbruck and Ostermann (2005) and Ostermann, Thalhammer and Wright (2006) and the references therein. In studying such time integrators one possibility is to apply the time-stepper without discretizing in space, thereby interpreting the method as a discrete trajectory in some abstract space of infinite dimension. Another option is to first do a spatial discretization to obtain a finite-dimensional system, and then apply the time-stepping scheme to this finite-dimensional problem. The most widespread application of exponential integrators is perhaps to the semilinear problem (2.14) ut = Lu + N (t, u). Here L is a linear operator, and N (t, u) is a nonlinear function or mapping. In many interesting cases, L may be a differential operator of higher order than those appearing in N (t, u); we refer to Minchev (2004) for an extensive treatment of this case. Such a problem lends itself to a formulation by the action of the affine group as described above; then any Lie group integrator can be applied. Cox and Matthews (2002) found an exponential integrator for (2.14) which turned out to be identical to the general commutatorfree Lie group integrator in Celledoni et al. (2003) applied with the affine action adapted to (2.14), when the Lie algebra g is a subalgebra of the affine Lie algebra consisting of elements (αL, b) as described above. Also, Krogstad (2005) derived exponential integrators with excellent properties for semilinear problems. In what follows we shall consider the application of Lie group integrators to some non-standard cases, differing from (2.14).
Topics in structure-preserving discretization
19
Celledoni–Kometa methods. Whereas the most common application of exponential integrators is to problems of the form (2.14), there are other examples in the literature. One is a class of schemes proposed by Celledoni and Kometa (Celledoni 2005, Celledoni and Kometa 2009). They consider convection–diffusion problems of the form ∂u + V(u) · ∇u = ν∇2 u + f, (2.15) ∂t where the convection term V(u) · ∇u is dominating, and 0 < ν 1. A semidiscretized version of (2.15) is obtained as yt − C(y)y = Ay + f,
y(0) = y0 .
(2.16)
Here the nonlinear convection term is assumed to take the form C(y)y for some matrix C(y) and the diffusion operator is similarly replaced by a constant matrix A. A typical strategy is now to treat the convection term and the diffusion term separately, using an explicit and possibly high-order approximation for the convection term, and an implicit integrator for the comparably stiff diffusion term. This is the idea behind the IMEX methods, for instance: see Kennedy and Carpenter (2003) for a general theory. Note that the matrix or linear operator A will usually be symmetric and negative definite: therefore implicit schemes can be implemented efficiently in such a splitting. The approach of Celledoni and Kometa (2009) is to use a non-trivial flow calculation for the convection part. A model example of a method in the class they consider for (2.16) is y1 = exp(h C(y0 ))y0 + h Ay1 + h f. This scheme can be generalized by adding stages in a Runge–Kutta fashion and by introducing compositions of exponentials in a similar way to that of commutator-free Lie group integrators. This leads to a semi-Lagrangian approach in which linearized versions of the convection part of the problem are solved exactly by the method of characteristics, for example. The general form of the method applied to (2.16) is Yi = φi y0 + h sj=1 ai,j φi,j AYj , k k i = 1, . . . , s, φi = exp h k αi,J C(Yk ) · · · exp h k αi,1 C(Yk ) , φi,j = φi φ−1 j , ¯ 0 + h s bi φ¯i AYj , y1 = φy i=1 k φ¯ = exp h β k C(Yk ) · · · exp h β C(Yk ) , k
¯ −1 . φ¯i = φφ i
J
k
1
Examples of schemes of order two and three are provided in Celledoni and Kometa (2009).
20
S. H. Christiansen, H. Z. Munthe-Kaas and B. Owren
Commutator-free methods. Wensch et al. (2009) introduce the multirate infinitesimal step method for differential equations formulated on Euclidean space of the form (2.17) y = f (y) + g(y). The method is defined by the authors as follows. (1) Define the initial points of the stage flows as αij (Ynj − yn ). Zni (0) = yn + j
(2) Compute the stages by solving the following equations exactly: 1 Zni (τ ) = γij (Ynj − yn ) + βij f (Ynj ) + di g(Zni (τ )), h j
j
Yni = Zni (h), and the update stage, yn+1 , can be interpreted as an additional stage Yn,s+1 . It is thus assumed that one can calculate exactly flows of vector fields of the form (2.18) y = c + f (y), and the explicitness of the scheme is ensured by requiring that αij = βij = one assumes that the method is balanced, γij = 0 for j ≥ i. Furthermore, meaning that di = j βij for every i. The order analysis can be treated by the theory developed in Owren (2006), and third-order methods are derived under some simplifying assumptions, setting the γij = 0 and demanding that precisely one αij = 0 for each i. When g(y) ≡ 0, the scheme reduces to a standard Runge–Kutta method. In practical situations one may relax the requirement that the flow of (2.18) is solved exactly, but one may instead approximate it with high order of accuracy, for instance by using much smaller time steps than the h which features in the method format above – hence the name multirate methods. The main application of these methods in Wensch et al. (2009) is the 2D Euler equations for atmosphere processes, in which the two main scales are the fast acoustic waves and the slower advection terms: ∂ρ = −∇ · (ρu), ∂t ∂p ∂ρu = −∇ · (u ⊗ ρu) − ∇Θ − f (ρ), ∂t ∂Θ ∂Θ = −∇ · (Θu), ∂t p = ΘR(p/p0 )κ .
Topics in structure-preserving discretization
21
Here u = (u, w) denotes the horizontal and vertical velocity, ρ is the density, Θ = θρ where θ is the potential temperature, p is the pressure and R, p0 , κ are physical parameters. The spatial discretizations used are third-order upwind differences for the advection terms and centred differences for the pressure terms.
3. Schemes which preserve first integrals The development of energy-preserving finite difference schemes go all the way back to the seminal work of Courant, Friedrichs and Lewy (1928) where the celebrated energy method was presented for the first time. Energy is an example of a first integral, a functional which is preserved along exact solutions of the PDE. In the early days of integral-preserving methods, the focus was mostly on stability issues, the preservation of energy, for instance, is an invaluable tool in proving stability of numerical methods for evolutionary problems. More recently some of the interest has shifted to the conservation property itself, considering not only stability issues, but also the ability of the numerical solution to inherit structural properties of the continuous system. In this section we shall discuss some rather general procedures that can be used to construct numerical schemes which exactly preserve one or more first integrals of the partial differential equations. The framework we present includes, but is not limited to, Hamiltonian PDEs. That is, we shall consider systems which can be written in the form δH , (3.1) δu where D is a skew-adjoint operator, which is applied to the variational derivative of a first integral H. In general, the operator D may depend on the solution itself as well as its partial derivatives with respect to spatial variables. In the literature one can also find several examples in which ‘dissipative versions’ of (3.1) are studied, where the operator D is replaced by an operator which causes the functional H to decrease monotonically along exact solutions, the aim then being to design a numerical method which has the same dissipation property. Here we shall consider only the conservative case, and our aim is to derive numerical schemes which, at each time level t = tn , produce a numerical approximation U n to the exact solution u(tn , ·) of (3.1), satisfying H(U n ) = H(U 0 ) for all n ≥ 1, or Hd (un ) = Hd (u0 ) where Hd is a suitable spatially discretized version of H and un is the corresponding space discretization of U n . We shall also assume that the spatial domain X and boundary conditions are of such a type that (possibly repeated) integration by parts does not cause boundary terms to appear. In the rest of this section we define M to be a fixed connected open subset M ⊂ X × U , where X is the space of independent variables x1 , . . . , xp , and ut = D
22
S. H. Christiansen, H. Z. Munthe-Kaas and B. Owren
U is the space of dependent variables u1 , . . . , uq . The spaces of prolongations M (n) ⊂ U (n) are then open subsets of the corresponding jet spaces. Following Olver (1993), we define the C-algebra of smooth differential functions A from M (n) to C. The space Aq is the set of q-plets of differential functions. Usually, the order n of the prolongation is of minor importance to the arguments presented here, and thus we just write F [u] or F ((uαJ )) for F ∈ Aq . We shall make use of operators D = D[u], whose adjoint D∗ [u] is defined via P D∗ Q
DP Q = X
X
for all compactly supported differential functions P and Q. The operator D is skew-adjoint if D∗ = −D. We consider the subclass of evolution equations which can be written in the form ∂u δH = F [u] = D[u] [u], ∂t δu
(3.2)
where D[u] is skew-adjoint. The functional H[u] is usually of the form H[u] = G[u]. (3.3) Equations of this form include the set of Hamiltonian PDEs, but here we do not need to assume that the operator D[u] defines a Poisson bracket. The general formula for the variational derivative expressed in terms of the Euler operator is included here for later use: δH δu is an m-vector depending on uαJ for |J| ≤ ν where ν ≥ ν, defined via (Olver 1993, p. 245) ∂ δH · ϕ dx = H[u + ϕ], (3.4) ∂ =0 Ω δu for any sufficiently smooth m-vector of functions ϕ(x). One may calculate δH δu by applying the Euler operator to G[u]; the α-component is given by δH α = Eα G[u], (3.5) δu where Eα =
|J|≤ν
(−1)|J| DJ
∂ , ∂uαJ
(3.6)
so that the sum ranges over all J corresponding to derivatives uαJ featuring in G. We have used total derivative operators: ∂uα ∂ J D J = D j1 . . . D jk , D i = . ∂xi ∂uαJ α,J
23
Topics in structure-preserving discretization
Another example of a Hamiltonian PDE is a generalized version of the Korteweg–de Vries equation ut + uxxx + (up−1 )x = 0, which can be cast in the form (3.2), with 1 2 1 p u − u dx, H[u] = 2 x p
D=
(3.7) ∂ . ∂x
(3.8)
Clearly, the functional H[u] is conserved along solutions of (3.2), since δH δH δH d H[u] = [u] ut = [u]D[u] [u] = 0, dt δu δu δu because D is skew-adjoint. The idea behind conservative integration schemes is to construct numerical methods which exactly reproduce this property as the numerical method advances from time tn to tn+1 , i.e., assuming that the solution to (3.2) at time t = tn is approximated by U n , we ask the scheme to satisfy (3.9) H[U n ] = H[U 0 ], ∀n ≥ 1. Alternatively, (3.9) may be imposed for some approximation Hd to H. The methodology we present here has its source in the ODE literature. One of the most prevalent approaches is that of discrete gradients, examples of which were proposed by LaBudde and Greenspan (1974), and treated systematically by Gonzalez (1996) and McLachlan, Quispel and Robidoux (1999). A finite-dimensional counterpart to (3.2) is the system y˙ = S(y)∇H(y) = f (y),
y ∈ Rm ,
(3.10)
where S(y) is an antisymmetric matrix. The idea is to introduce a discrete approximation to the gradient, letting ∇H : Rm ×Rm → Rm be a continuous map satisfying H(u) − H(v) = ∇H(v, u) (u − v), ∇H(u, u) = ∇H(u). The existence of such discrete gradients is well established in the literature, and their construction is not unique: see, for instance, the monograph by Hairer et al. (2006). The averaged vector field (AVF) gradient, for example, is defined by 1 ∇AVF (v, u) = ∇H(ξu + (1 − ξ)v) dξ. (3.11) 0
Once a discrete gradient has been found, one immediately obtains an integral-preserving method, simply letting y n+1 − y n = S(y n , y n+1 ) ∇(y n , y n+1 ). ∆t
24
S. H. Christiansen, H. Z. Munthe-Kaas and B. Owren
Here ∆t is the time step, and S(y n , y n+1 ) is some approximation to the matrix S in (3.10); one would normally require that S(y) = S(y, y). Discrete gradient methods are usually implicit. The generalization of this approach to PDEs is immediate, and has been developed independently of the ODE literature by Furihata, Matsuo and co-authors (Furihata 1999, Furihata 2001a, Furihata 2001b, Furihata and Matsuo 2003, Matsuo 2007, Matsuo 2008, Matsuo and Furihata 2001, Matsuo, Sugihara, Furihata and Mori 2000, Matsuo, Sugihara, Furihata and Mori 2002, Yaguchi, Matsuo and Sugihara 2010), and recently presented in its full generality in Dahlby and Owren (2010). One may define a discrete variational derivative of the Hamiltonian H[u] to be a continuous (differential) function of two arguments δH satisfying the relations u and v δ(v,u) δH (u − v) dx, (3.12) H[u] − H[v] = δ(v, u) Ω δH δH = . δ(u, u) δu
(3.13)
To obtain a conservative scheme we simply replace the skew-adjoint operator D[u] in (3.2) by some approximation D[v, u] satisfying D[u, u] = D[u], and define the method as δH U n+1 − U n = D[U n , U n+1 ] . (3.14) n ∆t δ(U , U n+1 ) The AVF scheme can of course also be interpreted as a discrete variational derivative method, where 1 δHAVF δH = [ξu + (1 − ξ)v] dξ. (3.15) δ(v, u) 0 δu The fact that (3.15) verifies the condition (3.12) is seen from the elementary identity 1 d H[ξu + (1 − ξ)v] dξ. (3.16) H[u] − H[v] = 0 dξ The derivative under the integral is written d d H[ξu + (1 − ξ)v] = H[v + (ξ + ε)(u − v)] dξ dε ε=0 δH [ξu + (1 − ξ)v](u − v) dx. = Ω δu Now substitute this into (3.16) and interchange the integrals to obtain (3.12). We illustrate the discrete variational derivative method to the Korteweg– de Vries equaton (3.7)–(3.8) using (3.15). The variational derivative is
Topics in structure-preserving discretization δH δu
25
= −uxx − up−1 such that 1 δHAVF =− (ξu + (1 − ξ)v)xx + (ξu + (1 − ξ)v)p−1 dξ δ(v, u) 0 uxx + vxx 1 up − v p − . =− 2 p u−v
Thus, taking D = D = U n+1 − U n + ∆t
∂ ∂x , the conservative method for (3.7) reads n+1 + U n Uxxx 1 ∂ (U n+1 )p − (U n )p xxx = 0. + 2 p ∂x U n+1 − U n
3.1. Linearly implicit methods for polynomial Hamiltonians A major principle behind the conservative schemes is that they preserve the (discretized) first integral exactly. This means that for an implicit scheme, the nonlinear equation to be solved in each time step must be solved exactly or to machine accuracy, and this may sometimes cause the overall method to be expensive compared to other approaches. A possible remedy would be to look for an iteration method having the property that the first integral is preserved in every iteration; another possibility is to design schemes which are linearly implicit by construction, thereby requiring only one linear solve for every time step. In the second of these two approaches, discussed in Dahlby and Owren (2010), one may apply a polarization technique if the Hamiltonian is of polynomial type, meaning that the differential function G in (3.3) is a multivariate polynomial in the jet space coordinates u(n) . The idea is to substitute G[u] by a function of k ≥ 2 indeterminates G[w1 , . . . , wk ], satisfying G[u, . . . , u] = G[u] G[w1 , w2 , . . . , wk ] = G[w2 , . . . , wk , w1 ]
(consistency),
(3.17)
(cyclicity).
(3.18)
In particular, whenever G[u] = G((uαJ )) is a multivariate polynomial of degree p, one may construct G[w1 , . . . , wk ] satisfying (3.17)–(3.18), which is also multi-quadratic as long as k ≥ (p + 1)/2. We next replace the skewadjoint operator D[u] by some skew-adjoint approximation D[w1 , . . . , wk−1 ] of k − 1 arguments, satisfying D[u, . . . , u] = D[u] D[w1 , w2 , . . . , wk−1 ] = D[w2 , . . . , wk−1 , w1 ] Defining
(consistency), (cyclicity).
(3.19) (3.20)
H[w1 , . . . , wk ] =
Ω
G[w1 , . . . , wk ],
we may now define a polarized version of the discrete variational derivative in a similar way to (3.12)–(3.13), but it is now a function of k +1 arguments.
26
S. H. Christiansen, H. Z. Munthe-Kaas and B. Owren
We refer to Dahlby and Owren (2010) for the general definition and give only the particular expression for the AVF case: 1 δH δH = [ξwk+1 + (1 − ξ)w1 , w2 , . . . , wk ] dξ. (3.21) δ(w1 , . . . , wk+1 ) 0 δw1 δH , is defined as Here the variational derivative on the right-hand side, δw 1 before, considering H as a function of its first argument only, leaving the others fixed. The following method was proposed in Dahlby and Owren (2010):
δH U n+k − U n = kD , k∆t δ(U n , . . . , U n+k )
n ≥ 0.
(3.22)
Remark 3.1. Note that the method (3.22) is a multistep method, and thus approximations U 1 , . . . , U k−1 to the first time steps are required. Remark 3.2. The procedure is linear, in the sense that if the Hamiltonian can be split into a sum of two terms H1 + H2 , the method can be applied to each term separately. We summarize some important properties of the scheme (3.22), the proof of which can be found in Dahlby and Owren (2010). Theorem 3.3. • The scheme (3.22) is conservative in the sense that H[U n , . . . , U n+k−1 ] = H[U 0 , . . . , U k−1 ],
∀n ≥ 1,
for any polarized Hamiltonian function H satisfying (3.17)–(3.18). • The polarized AVF scheme (3.22) using (3.21) has formal order of consistency two for any polarized Hamiltonian satisfying (3.17)–(3.18), and skew-symmetric operator D satisfying (3.19)–(3.20). • If G[w1 , . . . , wk ] is multi-quadratic in all its k arguments, (wJα )j , j = 1, . . . , k, then the polarized AVF method (3.22) is linearly implicit. To illustrate the linearly implicit scheme just presented, consider (3.7) with p = 6, the mass critical generalized Korteweg–de Vries equation. We then have 1 1 G[u] = u2x − u6 . 2 6 As indicated in Remark 3.2, we can treat the two terms separately. For the second term, one needs to use k ≥ 3: choosing k = 3 leads to the unique multi-quadratic choice G2 [w, v, u] = G2 (w, v, u) = − 16 u2 v 2 w2 . In the first term we have several options, but for reasons to be explained later, ¯ := D = ∂/∂x. we choose G1 [w, v, u] = 16 (u2x + vx2 + wx2 ). As before, we let D
27
Topics in structure-preserving discretization
This now leads to the scheme
n + U n+3 U n+3 − U n Uxxx ∂ U n + U n+3 n+1 2 n+2 2 xxx + + (U ) (U ) = 0. 3∆t 2 ∂x 2
Thus the scheme is linear in U n+3 , and preserves exactly the time-averaged Hamiltonian 1 n 2 n n+1 n+2 ,U ]= H[U , U (Ux ) + (Uxn+1 )2 + (Uxn+2 )2 6 2 1 + U n U n+1 U n+2 dx. 6 We remark that some care should be taken when choosing the polarization. Since the resulting method is a multistep scheme, it has spurious solutions which might be unstable. Considering as a test case the term H[u] = u2x , letting D be a constant operator having the exponentials as eigenfunctions, such as in differentiation operators with constant coefficients, one may choose the one-parameter family of polarizations 2 ux + vx2 1 θ + (1 − θ)ux vx dx. H[v, u] = 2 2 Dahlby and Owren (2010) remark that this leads to a stable scheme only if θ ≥ 12 . 3.2. Preserving multiple first integrals The preservation of more than one first integral may often be of interest. For instance, in PDEs which have soliton solutions, a well-known technique for proving stability of the exact solution is based on using the preservation of two specific invariants: see the articles by Benjamin and co-authors (Benjamin 1972, Benjamin, Bona and Mahony 1972). A procedure for preserving multiple first integrals by a numerical integrator for ODEs was described in McLachlan et al. (1999). Their method was based on finding a presentation of the ODE vector field f (y) by means of a completely skewsymmetric rank q + 1 tensor field S, writing y˙ = f (y) = S(·, ∇H1 , . . . , ∇Hq ),
(3.23)
where H1 , . . . , Hq are q known first integrals. This form effectively encodes the preservation of all the q first integrals, since, for 1 ≤ i ≤ q, d Hi (y) = ∇Hi (y) · f (y) = S(y)(∇Hi (y), ∇H1 (y), . . . , ∇Hq (y)) = 0. dt Proof of the existence of the formulation (3.23), along with constructive examples, is provided in McLachlan et al. (1999). The discrete gradient method is now easily implemented. Given a discrete gradient, ∇Hi (y n , y n+1 )
28
S. H. Christiansen, H. Z. Munthe-Kaas and B. Owren
for each of the first integrals, one may, for instance, define the method via y n+1 − y n ¯ n , y n+1 )( · , ∇H1 , . . . , ∇Hq ), = S(y ∆t for a suitable approximation S¯ to S. Another method for preserving multiple first integrals was presented in Minesaki and Nakamura (2006) for a subclass of Hamiltonian ODEs called St¨ackel systems. In a recent paper by Dahlby, Owren and Yaguchi (2010), the problem of retaining several first integrals simultaneously has been considered. Again we explain this approach for ODEs, or in the case when our PDE has already been discretized in space to yield a system y˙ = f (y), y ∈ Rm , with first integrals H1 , . . . , Hq . Using the Euclidean structure on Rm one may consider the immersed submanifold Mc ⊂ Rm , a leaf of the foliation induced by the integrals M = Mc = {y ∈ Rm : H1 (y) = c1 , H2 (y) = c2 , . . . , Hq (y) = cq }. The tangent space to this manifold may be characterized as the orthogonal complement to span(∇H1 , . . . , ∇Hq ). In order to adapt this setting to the situation with discrete tangents, the discrete tangent space was defined relative to two points, sufficiently close to each other in M × M . For all y in a neighbourhood of a point p ∈ Mc , let T(p,y) M = {η ∈ Rm : ∇Hj (p, y), η = 0, 1 ≤ j ≤ q} for the Euclidean inner product ·, · on Rm . A vector η = η(p,y) ∈ T(p,y) M is called a discrete tangent vector. Note that this definition causes T(y,y) M = Ty M . The following observation is immediate. Any integrator satisfying y n+1 − y n ∈ T(yn+1 ,yn ) M
(3.24)
preserves all integrals, in the sense that Hi (y n+1 ) = Hi (y n ), 1 ≤ i ≤ q. The obvious approach to adopt in order to obtain a method satisfying (3.24) is to combine a non-conservative scheme with projection as follows. For simplicity, let φ∆t denote a one-step method of order p, φ∆t : Rm → Rm . For any y ∈ M , let y also denote its injection into Rm . Then consider un+1 = φ∆t (yn ),
yn+1 = yn + P(yn+1 , yn )(un+1 − yn ),
(3.25)
where P(yn , yn+1 ) is a smooth projection operator onto the discrete tangent space T(yn ,yn+1 ) M . An alternative scheme is yn+1 = yn + ∆tP(yn , yn+1 )ψ∆t (yn+1 , yn ), where ψ∆t is an integrator which can be written in the form yn+1 = yn + ∆t ψ∆t (yn+1 , yn ).
(3.26)
Topics in structure-preserving discretization
29
This method is itself assumed to be of order p, that is, y(t + ∆t) − y(t) − h ψ∆t (y(t + ∆t), y(t)) = O(∆tp+1 ).
(3.27)
The following result was proved in Dahlby et al. (2010). Theorem 3.4. If the non-conservative methods φ∆t , ψ∆t are of order p, then so are the schemes (3.25) and (3.26): y(t + h) − y(t) − P(y(t), y(t + ∆t))(un+1 − y(t)) = O(∆tp+1 ),
(3.28)
where un+1 = φ∆ t(y(t)), and y(t + h) − y(t) − hP(y(t + h), y(t))ψh (y(t + h), y(t)) = O(hp+1 ).
(3.29)
An alternative approach to projection is to derive methods based on a local coordinate representation of the manifold. Based on the assumption that the q first integrals are all independent, we can define a coordinate chart centred at a point p ∈ M as follows. Suppose y ∈ M is sufficiently close to p such that all discrete gradients ∇H1 (p, y), . . . , ∇Hq (p, y) form a linearly independent set of vectors in Rm . Let Tp (y) be a smooth map from the manifold M into the set of orthogonal m × m matrices T : M → O(m) such that its last q columns form a basis for the linear span of the discrete gradients. We now define the coordinate map implicitly to be η m−q . (3.30) → M : χp (η) = y : y − p = Tp (y) χp : R 0q That these maps induce an atlas on M is proved in Dahlby et al. (2010). One may now express the original differential equation in terms of η: (f (χp ◦ η))η + T (χp ◦ η)f (χp ◦ η). (3.31) η˙ = −T (χp ◦ η)DTp χp ◦η
The method proposed takes one step as follows. (1) Let η0 = 0. (2) Take a step with any pth-order method applied to the ODE (3.31), using p = y n in (3.30). The result is η1 . (3) Compute y n+1 = χ(η1 ). The method defined in this way will clearly be of order at least p. Using this approach, one clearly needs to compute DTp because it is needed explicitly in (3.31), and this map may also be useful in computing the implicitly defined coordinate map. It is shown in Dahlby et al. (2010) how DTp |y (v)η can be computed with a complexity of order O(mq 2 + q 3 ). 3.3. Discretizing in space The adaptation of the approaches just presented to PDEs which have already been discretized in space is of course straightforward: the integral in
30
S. H. Christiansen, H. Z. Munthe-Kaas and B. Owren Continuous calculus
Discrete calculus
First integral H[u] = G[u]
-
Discrete first integral Hd [u] = (Gd [u])k ∆x k
?
? Discrete variational δHd derivative δ(v, u)
Variational derivative δH δu
?
?
PDE ut = D[u]
-
δH δu
Finite difference scheme u δHd − un ¯ =D ∆t (δun , δun+1 ) n+1
Figure 3.1. The Furihata formalism. This illustration is taken from Furihata (1999).
(3.3) may be replaced by a quadrature rule, resulting in a discrete version, for instance, Hd : Rm → R. The skew-adjoint operator D must be replaced by a skew-symmetric m × m matrix, Dd . We now consider finite difference approximations. The function space to which the solution u belongs is replaced by a finite-dimensional space with functions on a grid indexed by Ig ⊂ Zd . We use boldface symbols for these functions. Let there be Nr grid points in the space direction r so that N = N1 · · · Nd is the total number of grid points. We denote by uα the approximation to uα on such a grid, and by u the vector consisting of (u1 , . . . , um ). We will replace each derivative uαJ by a finite difference approximation δJ uα , and replace the integral by a quadrature rule. We then let bi (Gd ((δJ u)))i ∆x. (3.32) Hd (u) = i∈Ig
Here ∆x is the volume (length, area) of a grid cell and b = (bi )i∈Ig are the
Topics in structure-preserving discretization
31
weights in the quadrature rule. The discretized Gd has the same number of arguments as G, and each input argument as well as the output are vectors in RN . We have here approximated the function uαJ by a difference approximation δJ uα , where δJ : RN → RN is a linear map. As in the continuous case, we use square brackets, say F [u], as shorthand for a list of arguments involving difference operators F [u] = F (u, δJ1 u, . . . , δJq u). We compute 1 ∂Gd bi [ξu + (1 − ξ)v]dξ(δJ (uα − vα )) ∆x Hd [u] − Hd [v] = ∂δJ uα i 0 J,α i∈Ig δHd = ,u − v , (3.33) δ(v, u) where
δHd = δJ B δ(v, u) J,α
1 0
∂Gd α α [ξu + (1 − ξ)v ] dξ , ∂uJ
B is the diagonal linear map B = diag(bi ), i ∈ Ig , and the discrete inner product used in (3.33) is uαi viα . u, v = α,i∈Ig
Notice the resemblance between the operator acting on Gd in (3.33) and the continuous Euler operator in (3.6). We make the following assumptions. (1) The spatially continuous method (3.14) (using (3.15)) is discretized in space, using a skew-symmetric Dd and a selected set of difference quotients δJ for each derivative ∂J . (2) Considering (3.5) and (3.6), the choice of discretization operators δJ used in ∂G/∂uαJ [u] is arbitrary, but the corresponding DJ is replaced by the transpose δJ . In this case, using the same Dd , an identical set of difference operators in discretizing H (3.32), and choosing all the quadrature weights bi = 1, the resulting scheme is the same. Letting er denote the rth canonical unit vector in Rd , we define the most common first-order difference operators ui+er − ui , (δr+ u)i = ∆xr ui − ui−er , (δr− u)i = ∆xr ui+er − ui−er . (δr1 u)i = 2∆xr
32
S. H. Christiansen, H. Z. Munthe-Kaas and B. Owren
These difference operators are all commuting, but only the last one is skewsymmetric. However, for the first two we have the useful identities (δr+ ) = −δr− ,
(δr− ) = −δr+ .
Higher-order difference operators δJ can generally be defined by taking compositions of these operators: in particular, we shall consider examples in the next section using the second and third derivative approximations δr2 = δr+ ◦ δr− ,
δ 3 = δ 1 ◦ δ 2 .
We may now introduce numerical approximations Un representing the fully discretized system: the scheme is δHd Un+1 − Un = Dd . n ∆t δ(U , Un+1 ) The conservative schemes based on polarization are adapted in a straightforward manner, introducing a function Hd [w1 , . . . , wk ] which is consistent and cyclic, and a skew-symmetric map Dd depending on at most k − 1 arguments. The scheme is then δHd Un+k − Un = kDd . k∆t δ(Un , . . . , Un+k )
(3.34)
This scheme conserves the function Hd in the sense that Hd [Un+1 , . . . , Un+k ] = Hd [U0 , . . . , Uk−1 ],
n ≥ 0.
4. Spatial symmetries, high-order discretizations and fast group-theoretic algorithms In this chapter we survey some group-theoretic techniques applied to the discretization and solution of PDEs. Inspired by recent active research in Lie group and exponential time integrators for differential equations, we will in Section 4.1 present algorithms for computing matrix and operator exponentials based on Fourier transforms on finite groups. As a final example, we consider spherically symmetric PDEs, where the discretization preserves the 120 symmetries of the icosahedral group. This motivates the study of spectral element discretizations based on triangular subdivisions. In Section 4.2 we introduce novel applications of multivariate non-separable Chebyshev polynomials in the construction of spectral element bases on triangular and simplicial subdomains. These generalized Chebyshev polynomials are intimately connected to kaleidoscopes of mirrors acting on a vector space, i.e., groups of isometries generated by mirrors placed on each face of a triangle (2D), a tetrahedron (3D) or in general simplexes. Mathematically this is described by the theory of root systems and Weyl groups,
Topics in structure-preserving discretization
33
which we will review. Group-theoretic techniques lead to FFT-based fast computational algorithms. This is well known in the case of commutative groups, but it turns out to be important to understanding such ideas in the setting of non-commutative groups as well. Lie group integrators enjoy a number of nice geometrical properties, of which we will here focus on their symmetry and equivariance properties. Fundamental to the theory of differential equations is the equivariance of the solution curves with respect to any diffeomorphism φ : M → M acting on the domain. Let φ∗ F denote the pushforward of the vector field F , i.e., (φ∗ F )(z) = T φ · F (φ−1 (z)) for all z ∈ M, where T φ denotes the tangent map (in coordinates, the Jacobian matrix). Then the two differential equations y (t) = F (y(t)), y(0) = y0 and z (t) = (φ∗ F )(z(t)), z(0) = φ(y0 ) have analytical solution curves related by z(t) = φ(y(t)). In particular, if φ∗ F = F , we say that φ is a symmetry of the vector field, and in that case φ maps solution curves to other solution curves of the same equation. For numerical integrators it is in general impossible to satisfy equivariance with respect to arbitrary diffeomorphisms, since this would imply an analytically correct solution. (There always exists a local diffeomorphism that straightens the flow to a constant flow in the x1 direction, and this is integrated exactly by any reasonable numerical method.) The equivariance group of a numerical scheme is the largest group of diffeomorphisms under which the numerical solutions transform equivariantly. It is known that the equivariance group of classical Runge–Kutta methods is the group of all affine linear transformations of Rn . Lie group integrators based on exact computation of exponentials have equivariance groups that include the Lie group G on which the method is based; hence, if some elements g ∈ G are symmetries of the differential equation, then G-equivariant Lie group integrators will exactly preserve these symmetries. However, if the exact exponential is replaced with approximations, care must be taken not to destroy G-equivariance and symmetry preservation of the numerical scheme. In the case of PDEs, symmetry preservation also depends on symmetry-preserving spatial discretizations. Equivariance is the foundation of Fourier analysis. Classical Fourier analysis can be defined as the study of linear operators L which are equivariant with respect to an (abelian) group of translations acting on a domain, i.e., L◦τ = τ ◦L for all translations τ (t) : t → t + τ . The fact that exponential functions are the eigenfunctions of translation operators, exp(2πiλ(t + τ )) = exp(2πiλτ ) exp(2πiλt), and hence also eigenfunctions for L, is the explanation for the omnipresence of Fourier bases in computational science. The more specialized cos and sin bases appear naturally when boundary conditions are taken into account, as symmetrization and skewsymmetrization of the exponentials with respect to the reflection t → −t. Chebyshev polynomials again occur naturally through a change of variables
34
S. H. Christiansen, H. Z. Munthe-Kaas and B. Owren
cos(t) → y. The availability of fast computational algorithms (FFT-based) for all these bases again relies in a crucial manner upon the underlying group structures provided by the equivariance. Products of equivariant operators lead naturally to the convolution product, which is diagonalized by Fourier transforms. Many important operators are equivariant with respect to larger noncommutative groups of transformations, such as the important Laplacian ∇2 which is equivariant with respect to every isometry of the domain.4 The generalized Fourier theory of linear operators equivariant with respect to non-commutative groups of transformations is not as widely known as the abelian theory within computational science. Convolution products also occur naturally in this setting. However, due to non-commutativity, exponential bases are no longer sufficient to diagonalize convolutions. Instead one must also use the higher-dimensional representations of the group, which can be understood as homomorphisms of the group into a space of (unitary) matrices. Exponentials are one-dimensional representations of abelian groups. In the natural bases obtained from representation theory, equivariant operators are block-diagonalized. This is a starting point for constructing fast algorithms for matrix exponentials, eigenvalue computations and linear equations in cases where the operator is equivariant. We start our presentation with a discussion of matrices equivariant with respect to a finite non-abelian group acting upon the index set. This is a good example for understanding some basic concepts of non-commutative harmonic analysis, without having to consider more technical analysis questions which occur in the case of infinite groups. 4.1. Introduction to discrete symmetries and equivariance The topic of this subsection is the application of Fourier analysis on groups to the computation of matrix exponentials. Assuming that the domain is discretized with a symmetry-respecting discretization, we will show that by a change of basis derived from the irreducible representations of the group, the operator is block-diagonalized. This simplifies the computation of matrix exponentials. The basic mathematics here is the representation theory of finite groups (James and Liebeck 2001, Lomont 1959, Serre 1977). Applications of this theory in scientific computing have been discussed by a number of authors: see, e.g., Allgower, B¨ohmer, Georg and Miranda (1992), Allgower, Georg, Miranda and Tausch (1998), Bossavit (1986), Douglas and Mandel (1992) and Georg and Miranda (1992). Our exposition, based on the group algebra, is explained in detail in ˚ Ahlander and Munthe-Kaas (2005). 4
The Laplacian can indeed be defined as the unique (up to constant) second-order linear differential operator which commutes with all isometries.
Topics in structure-preserving discretization
35
G-equivariant matrices. A group is a set G with a binary operation g, h → gh, inverse g → g −1 and identity element e, such that g(ht) = (gh)t, eg = ge = g and gg −1 = g −1 g = e for all g, h, t ∈ G. We let |G| denote the number of elements in the group. Let I denote the set of indexes used to enumerate the nodes in the discretization of a computational domain. We say that a group G acts on a set I (from the right) if there exists a product (i, g) → ig : I × G → I such that ie = i for all i ∈ I, i(gh) = (ig)h for all g, h ∈ G and i ∈ I.
(4.1) (4.2)
The map i → ig is a permutation of the set I, with the inverse permutation being i → ig −1 . An action partitions I into disjoint orbits Oi = {j ∈ I | j = ig for some g ∈ G},
i ∈ I.
We let S ⊂ I denote a selection of orbit representatives, i.e., one element from each orbit. The action is called transitive if I consists of just a single orbit, |S| = 1. For any i ∈ I we let the isotropy subgroup at i, Gi be defined as Gi = {g ∈ G | ig = i}. The action is free if Gi = {e} for every i ∈ I, i.e., there are no fixed points under the action of G. Definition 4.1.
A matrix A ∈ CI×I , is G-equivariant if
Ai,j = Aig,jg
for all i, j ∈ I and all g ∈ G.
(4.3)
The definition is motivated by the result that if L is a linear differential operator commuting with a group of domain symmetries G, and if we can find a set of discretization nodes I such that every g ∈ G acts on I as a permutation i → ig, then L can be discretized as a G-equivariant matrix A: see Allgower et al. (1998) and Bossavit (1986). The group algebra. We will establish that G-equivariant matrices are associated with (scalar or block) convolutional operators in the group algebra. Definition 4.2. The group algebra CG is the complex vector space CG where each g ∈ G corresponds to a basis vector g ∈ CG. A vector a ∈ CG can be written as a(g)g where a(g) ∈ C. a= g∈G
The convolution product ∗ : CG × CG → CG is induced from the product in G as follows. For basis vectors g, h, we set g ∗ h ≡ gh, and in general,
36
S. H. Christiansen, H. Z. Munthe-Kaas and B. Owren
a(g)g and b = h∈G b(h)h, then a∗b= a(g)g ∗ b(h)h = a(g)b(h)(gh) = (a ∗ b)(g)g,
if a =
g∈G
g∈G
where
h∈G
(a ∗ b)(g) =
g∈G
g,h∈G
a(gh−1 )b(h) =
h∈G
a(h)b(h−1 g).
(4.4)
h∈G
Consider a G-equivariant A ∈ Cn×n in the case where G acts freely and transitively on I. In this case there is only one orbit of size |G| and hence I may be identified with G. Corresponding to A there is a unique A ∈ CG, given as A = g∈G A(g)g, where A is the first column of A, i.e., A(gh−1 ) = Agh−1 ,e = Ag,h .
Cn
(4.5)
Similarly, any vector x ∈ corresponds uniquely to x = g∈G x(g)g ∈ CG, where x(g) = xg for all g ∈ G. Consider the matrix vector product Ag,h xh = A(gh−1 )x(h) = (A ∗ x)(g). (Ax)g = h∈G
h∈G
If A and B are two equivariant matrices, then AB is the equivariant matrix, where the first column is given as Ag,h B h,e = A(gh−1 )B(h) = (A ∗ B)(g). (AB)g,e = h∈G
h∈G
We have shown that if G acts freely and transitively, then the algebra of G-equivariant matrices acting on Cn is isomorphic to the group algebra CG acting on itself by convolutions from the left. In the case where A is G-equivariant with respect to a free, but not transitive, action of G on I, we need a block version of the above theory. Let Cm× G ≡ Cm× ⊗CG denote the space of vectors consisting of |G| matrix blocks, each block of size m × . Thus A ∈ Cm× G can be written as A= A(g) ⊗ g where A(g) ∈ Cm× . (4.6) g∈G
The convolution product (4.4) generalizes to a block convolution ∗ : Cm× G × C×k G → Cm×k G given as A(g) ⊗ g ∗ B(h) ⊗ h = (A ∗ B)(g) ⊗ g, A∗B = g∈G
where
(A ∗ B)(g) =
A(gh−1 )B(h) =
h∈G
and
A(h)B(h−1 g)
g∈G
h∈G
denotes a matrix product.
h∈G
A(h)B(h−1 g),
(4.7)
Topics in structure-preserving discretization
37
If the action of G on I is free, but not transitive, then I splits into m orbits, each of size |G|. We let S denote a selection of one representative from each orbit. We will establish an isomorphism between the algebra of G-equivariant matrices acting on Cn and the block-convolution algebra Cm×m G acting on Cm G. We define the mappings µ : Cn → Cm G, ν : Cn×n → Cm×m G by µ(y)i (g) = yi (g) = y ig ∀i ∈ S, g ∈ G, ν(A)i,j (g) = Ai,j (g) = Aig,j ∀i, j ∈ S g ∈ G.
(4.8) (4.9)
In ˚ Ahlander and Munthe-Kaas (2005) we show the following. Proposition 4.3. Let G act freely on I. Then µ is invertible and ν is invertible on the subspace of G-equivariant matrices. Furthermore, if A, B ∈ Cn×n are G-equivariant, and y ∈ Cn , then µ(Ay) = ν(A) ∗ µ(y), ν(AB) = ν(A) ∗ ν(B).
(4.10) (4.11)
To complete the connection between G-equivariance and block convolutions, we need to address the general case where the action is not free, and hence some of the orbits in I have reduced size. One way to treat this case is to duplicate the nodes with non-trivial isotropy subgroups; thus a point j ∈ I is considered to be |Gj | identical points, and the action is extended to a free action on this extended space. Equivariant matrices on the original space is extended by duplicating the matrix entries, and scaled according to the size of the isotropy. We define µ(x)i (g) = xi (g) = xig ∀i ∈ S, g ∈ G, 1 Aig,j ∀i, j ∈ S g ∈ G. ν(A)i,j (g) = Ai,j (g) = |Gj |
(4.12) (4.13)
With these definitions it can be shown that (4.10)–(4.11) still hold. It should be noted that µ and ν are no longer invertible, and the extended block convolutional operator ν(A) becomes singular. This poses no problems for the computation of exponentials since this is a forward computation. Thus we just exponentiate the block convolutional operator and restrict the result back to the original space. However, for inverse computations such as solving linear systems, the characterization of the image of µ and ν as subspaces of Cm G and Cm×m G is an important issue for finding the correct solution (˚ Ahlander and Munthe-Kaas 2005, Allgower, Georg and Miranda 1993). The generalized Fourier transform (GFT). So far we have argued that a symmetric differential operator becomes a G-equivariant matrix under discretization, which again can be represented as a block convolutional operator. In this subsection we will show how convolutional operators are
38
S. H. Christiansen, H. Z. Munthe-Kaas and B. Owren
block-diagonalized by a Fourier transform on G. This is the central part of Frobenius’s theory of group representations from 1897–1899. We recommend the monographs by F¨ assler and Stiefel (1992), James and Liebeck (2001), Lomont (1959) and Serre (1977) as introductions to representation theory with applications. Definition 4.4. Cd×d such that
A d-dimensional group representation is a map R : G → R(gh) = R(g)R(h)
for all g, h ∈ G.
(4.14)
Generalizing the definition of Fourier coefficients we define for any A ∈ ˆ ∈ Cm×k ⊗ Cm×k G and any d-dimensional representation R a matrix A(R) d×d as C ˆ A(g) ⊗ R(g). (4.15) A(R) = g∈G
Proposition 4.5. (Convolution theorem) Ck× G and any representation R we have
For any A ∈ Cm×k G, B ∈
ˆ ˆ (A ∗ B)(R) = A(R) B(R).
(4.16)
Proof.
The statement follows from ˆ ˆ A(g) ⊗ R(g) B(h) ⊗ R(h) A(R)B(R) = g∈G
=
h∈G
A(g)B(h) ⊗ R(g)R(h) =
g,h∈G
=
A(g)B(h) ⊗ R(gh)
g,h∈G
A(gh−1 )B(h) ⊗ R(g) = (A ∗ B)(R).
g,h∈G
Let dR denote the dimension of the representation. For use in practical computations, it is important that A ∗ B can be recovered by knowing (A ∗ B)(R) for a suitable selection of representations, and furthermore that their dimensions dR are as small as possible. Note that if R is a represen˜ = XR(g)X −1 is tation and X ∈ CdR ×dR is non-singular, then also R(g) ˜ a representation. We say that R and R are equivalent representations. If ˜ ˜ has a there exists a similarity transform R(g) = XR(g)X −1 such that R(g) block diagonal structure, independent of g ∈ G, then R is called reducible, otherwise it is irreducible. Theorem 4.6. (Frobenius) For any finite group G there exists a complete list R of non-equivalent irreducible representations such that d2R = |G|. R∈R
39
Topics in structure-preserving discretization
Defining the GFT for a ∈ CG as a(g)R(g) a ˆ(R) =
for every R ∈ R,
(4.17)
g∈G
we may recover a by the inverse GFT (IGFT): 1 a(g) = dR trace (R(g −1 )ˆ a(R)). |G|
(4.18)
R∈R
For the block transform of A ∈ Cm×k G given in (4.15), the GFT and the IGFT are given componentwise as Ai,j (g)R(g) ∈ CdR ×dR , (4.19) Aˆi,j (R) = g∈G
Ai,j (g) =
1 dR trace (R(g −1 )Aˆi,j (R)). |G|
(4.20)
R∈R
Complete lists of irreducible representations for several common groups are to be found in Lomont (1959). Applications to the matrix exponential. We have seen that via the GFT, any G-equivariant matrix is block-diagonalized. Corresponding to an irreducible ˆ representation R, we obtain a matrix block A(R) of size mdR × mdR , where m is the number of orbits in I and dR is the size of the representation. Let Wdirect denote the computational work, in terms of floating-point operations, for computing the matrix exponential on the original data A, and let Wfspace be the cost of doing the same algorithm on the corresponding block diagonal ˆ Thus GFT-based data A. 3 3 3 d2R , Wfspace = cm3 d3R Wdirect = c(m|G|) = cm R∈R
and the ratio becomes O(n ) : 3
Wdirect /Wfspace =
R∈R
R∈R
d2R
3 / d3R . R∈R
Table 4.1 lists this factor for the symmetries of the triangle, the tetrahedron, the 3D cube and the maximally symmetric discretization of a 3D sphere (icosahedral symmetry with reflections). The cost of computing the GFT is not taken into account inthis estimate. There exist fast GFT algorithms of complexity O |G| log (|G|) for a number 2 | , the of groups, but even if we use a slow transform of complexity O |G total cost of the GFT becomes just O m2 |G|2 , which is much less than Wfspace .
40
S. H. Christiansen, H. Z. Munthe-Kaas and B. Owren
Table 4.1. Gain in computational complexity for matrix exponential via GFT. Domain Triangle Tetrahedron Cube Icosahedron
G
|G|
{dR }R∈R
D3 S4 S4 × C 2 A5 × C 2
6 24 48 120
{1, 1, 2} {1, 1, 2, 3, 3} {1, 1, 1, 1, 2, 2, 3, 3, 3, 3} {1, 1, 3, 3, 3, 3, 4, 4, 5, 5}
Wdirect /Wfspace 21.6 216 864 3541
Example 4.7. (Equilateral triangle) The non-commutative group of smallest order is D3 , the symmetries of an equilateral triangle. There are six linear transformations that map the triangle onto itself: three pure rotations and three rotations combined with reflections. In Figure 4.1(a) we indicate the two generators α (rotation 120◦ clockwise) and β (right–left reflection). These satisfy the algebraic relations α3 = β 2 = e, βαβ = α−1 , where e denotes the identity transform. The whole group is D3 = {e, α, α2 , β, αβ, α2 β}. Given an elliptic operator L on the triangle such that L(u◦α) = L(u)◦α and L(u◦β) = L(u)◦β for any u satisfying the appropriate boundary conditions on the triangle, let the domain be discretized with a symmetryrespecting discretization: see Figure 4.1(b). In this example we consider a finite difference discretization represented by the nodes I = {1, 2, . . . , 10}, such that both α and β map nodes to nodes. In finite element discretizations one would use basis functions mapped to other basis functions by the symmetries. We define the action of D3 on I as (1, 2, 3, 4, 5, 6, 7, 8, 9, 10)α = (5, 6, 1, 2, 3, 4, 9, 7, 8, 10), (1, 2, 3, 4, 5, 6, 7, 8, 9, 10)β = (2, 1, 6, 5, 4, 3, 7, 9, 8, 10), and extend to all of D3 using (4.2). As orbit representatives, we may pick S = {1, 7, 10}. The action of the symmetry group is free on the orbit O1 = {1, 2, 3, 4, 5, 6}, while the points in the orbit O7 = {7, 8, 9} have isotropy subgroups of size 2, and finally O10 = {10} has isotropy of size 6. The operator L is discretized as a matrix A ∈ C10×10 satisfying the equivariances Aig,jg = Ai,j for g ∈ {α, β} and i, j ∈ S. Thus we have, e.g., A1,6 = A3,2 = A5,4 = A4,5 = A2,3 = A6,1 . D3 has three irreducible representations given in Table 4.2 (extended to the whole group using (4.14)). To compute exp(A), we find A = ν(A) ∈ C3×3 G from (4.13) and find Aˆ = GFT(A) from (4.19). The transformed maˆ 1 ) ∈ Cm×m and A(ρ ˆ 2 ) ∈ Cm×m ⊗C2×2 ˆ 0 ), A(ρ trix Aˆ has three blocks, A(ρ 2m×2m , where m = 3 is the number of orbits. We exponentiate each of C these blocks, and find the components of exp(A) using the inverse GFT (4.20).
41
Topics in structure-preserving discretization Table 4.2. A complete list of irreducible representations for D3 .
ρ0 ρ1 ρ2
α
β
1 1 √ −1/2 − 3/2 √ 3/2 −1/2
1 −1 1 0 0 −1 7
4
5
α 3
6
10
β 9
(a)
2
1
8
(b)
Figure 4.1. Equilateral triangle with a symmetry-preserving set of 10 nodes.
We should remark that in Lie group integrators, it is usually more important to compute y = exp(A) · x for some vector x. In this case, we ˆ i ))·ˆ x(ρi ), and recover y by inverse GFT. Note that compute yˆ(ρi ) = exp(A(ρ x ˆ(ρ2 ), yˆ(ρ2 ) ∈ Cm ⊗C2×2 C2m×2 . Example 4.8. (Icosahedral symmetry) As a second example illustrating the general theory, we solve the simple heat equation u t = ∇2 u on the surface of a unit sphere. See Trønnes (2005) for details of the implementation. The sphere is divided into 20 equilateral triangles, and each triangle is subdivided into a finite difference mesh respecting all the 120 symmetries of the full icosahedral symmetry group (including reflections). To understand this group, it is useful to realize that five tetrahedra can be simultaneously embedded in the icosahedron, so that the 20 triangles correspond to the (in total) 20 corners of these five tetrahedra. From this one sees that the
42
S. H. Christiansen, H. Z. Munthe-Kaas and B. Owren
icosahedral rotation group is isomorphic to A5 , the group of all 60 even permutations of the five tetrahedra. The 3D reflection matrix −I obviously commutes with any 3D rotation, and hence we realize that the full icosahedral group is isomorphic to the direct product C2 × A5 , where C2 = {1, −1}. The irreducible representations of A5 have dimensions {1, 3, 3, 4, 5}, and the representations of the full icosahedral group are found by taking tensor products of these with the two one-dimensional representations of C2 . The fact that the full icosahedral group is a direct product is also utilized in faster computation of the GFT. This, however, is not of major importance, since the cost of the GFT in any case is much less than the cost of the matrix exponential. 4.2. Spatial symmetries and high-order discretizations In this subsection we will discuss novel techniques for spatial discretizations based on reflection groups and multivariate Chebyshev polynomials. Given high-order time integration methods, such as Lie group methods, it is desirable to also use high-order discretizations in space. We will see that it is important to employ discretizations respecting spatial symmetries, both for the quality of the discretization error and also for efficiency of linear algebra computations such as matrix exponentials, eigenvalue computations and solution of linear systems. Spectral methods are important discretization techniques, where special function systems are used to expand the solution on simple (e.g., boxshaped) domains. For PDEs with analytic solutions spectral discretization techniques enjoy exponentially fast convergence (Canuto, Hussaini, Quarteroni and Zang 2006). On more general domains spectral element methods are constructed by patching together simple subdomains. Typically the basis functions on the subdomains arise as eigenfunctions for a self-adjoint linear operator, such as the exponential Fourier basis on periodic domains and orthogonal polynomials (Legendre or Chebyshev) on bounded domains with homogeneous boundary conditions. Most of the popular orthogonal polynomial systems used in current spectral (and spectral-element) methods are special cases of Jacobi polynomials, which are the solutions of singular Sturm–Liouville problems on a bounded domain, i.e., they are eigenfunctions of a second-order linear differential operator which is self-adjoint with respect to a weighted inner product, where the weight function is singular on the boundary. A problem with standard polynomial-based spectral element methods is a lack of flexibility with respect to geometries. On box-shaped domains it is easy to construct polynomial bases by tensor products of univariate polynomials. Box-shaped domains are, however, difficult to patch together in more general geometries, and difficult to match with domain symmetries,
Topics in structure-preserving discretization
43
e.g., for problems on spherical surfaces. For these reasons, it is desirable to explore high-order function systems based on triangles (2D), tetrahedra (3D) and in general simplexes for higher dimensions. 4.2.1. Root systems and Laplacian eigenfunctions on triangles and simplexes For certain triangular or simplicial domains with homogeneous Dirichlet or Neumann boundary conditions, the eigenfunctions of the Laplacian are known explicitly. We will see later that these systems are closely related to reflection groups (crystallographic groups and Coxeter groups) and root systems. In order to motivate a discussion of reflection groups, we start with an important particular example, the eigenfunctions of the Laplacian on an equilateral triangle . What is the sound of an equilateral drum? A detailed discussion of this example is also found in Huybrechs, Iserles and Nørsett (2010). Without loss of generality, the triangle has corners in the origin [0; 0], √ √ we assume that √ √ λ1 = [1/ 2; 1/ 6] and λ2 = [0; 2/ 3], shown as the shaded domain in Figure 4.4(a), labelled A2 (see p. 50). Let {sj }3j=1 denote reflections of R2 ˜ denote the full group of isometries of about the edges of the triangle. Let W 2 3 R generated by {sj }j=1 . This is an example of a crystallographic group,5 a group of isometries of Rd where the subgroup of translations form a lattice in Rd . From this fact we will derive the Laplacian eigenfunctions on . Recall that a lattice L in Rd is the Z-linear span of d linearly independent vectors in Rd , L = spanZ {α1 , . . . , αd }; thus L is an abelian group isomorphic to Zd . The reciprocal lattice L∗ = {λ ∈ Rd : (λ, α) ∈ Z for all λ ∈ Λ and α ∈ L}, where (·, ·) is the standard inner product on Rd . We have L∗ = spanZ {λ1 , . . . , λd }, where {λ1 , . . . , λd } is the dual basis of {α1 , . . . , αd }, i.e., (λj , αk ) = δj,k . The reciprocal lattice serves as the index set for the Fourier basis for L-periodic functions on Rd . Consider the L-periodic domain (a d-torus) Td = Rd /L and the space of square-integrable periodic functions L2 (Td ). The Fourier basis for L2 (Td ) is the L2 -orthogonal family of exponential functions indexed by the dual lattice, {exp(2πi(λ, y))}λ∈L∗ . ˜ is the Back to our equilateral triangle, where the translation lattice of W lattice L = spanZ {α1 , α2 } < R2 √ √ √ √ generated by the vectors α1 = ( 2, 0) and α2 = (−1 2, 3/ 2). The unit 5
More specifically it is an affine Weyl group, to be defined below.
44
S. H. Christiansen, H. Z. Munthe-Kaas and B. Owren
cell of L can be taken as either the rhombus spanned by α1 and α2 or the hexagon indicated in Figure 4.4. The hexagon is the Voronoi cell of the origin in the lattice L, i.e., its interior consists of the points in R2 that are closer to the origin than to any other lattice points. As a first step in our construction, we consider the L-periodic eigenfunctions of the Laplacian ∇2 . Since (λj , αk ) = δj,k , the dual lattice is L∗ = spanZ {λ1 , λ2 } and the periodic eigenfunctions are ∇2t e2πi(λ,t) = −(2π)2 λ2 e2πi(λ,t)
for all λ ∈ L∗ , t ∈ R2 /L.
We continue to find the Laplacian eigenfunctions on by folding the expo˜ be the linear subgroup which leaves the origin fixed nentials. Let W < W (the symmetries of ): W = {e, s1 , s2 , s1 s2 , s2 s1 , s1 s2 s1 }, where e is the identity and si , i ∈ {1, 2} act on v ∈ R2 as si v = v − 2(αi , v)/(αi , αi ). We define even and odd (cosine- and sine-type) foldings of the exponentials 1 2πi(λ,wt) 1 2πi(w λ,t) e = e , (4.21) cλ (t) = |W | |W | w∈W
sλ (t) =
1 |W |
w∈W
w∈W
det(w)e2πi(λ,wt) =
1 det(w)e2πi(w λ,t) , |W |
(4.22)
w∈W
where, in our example, |W | = 6. The Laplacian commutes with any isometry, in particular ∇2 (f ◦ w) = (∇2 f ) ◦ w for w ∈ W . Hence, reflected exponentials and the functions cλ (t) and sλ (t) are also eigenfunctions with the same eigenvalue. Lemma 4.9. The eigenfunctions of ∇2 on the equilateral triangle with Dirichlet (f = 0) and Neumann boundary conditions (∇f · n = 0) are given by ∇2t cλ (t) = −(2π)2 λ2 cλ (t), ∇2t sλ (t) = −(2π)2 λ2 sλ (t), respectively, for λ ∈ spanN {λ1 , λ2 }, the set of all non-negative integer combinations of λ1 = [1/2; 1/6] and λ2 = [0; 2/3]. The set spanN {λ1 , λ2 } ⊂ L∗ contains exactly one point from each W -orbit: see the discussion of Weyl chambers below. An important question is how good (or bad!) these eigenfunctions are as bases for approximating analytic functions on . It is well known from the univariate case that a similar construction, yielding the eigenfunctions cos(kθ) and sin(kθ) on [0, π], does not give fast convergence. For an analytic function f (θ) where f (0) = f (π) = 0, the even 2π-periodic extension is piecewise smooth, with only C 0
Topics in structure-preserving discretization
45
continuity at θ ∈ {0, π}. Hence the Fourier cosine series converges only as O(k −2 ). There are several different ways to achieve spectral convergence O(exp(−ck)). One possible solution is to approximate f (θ) in a frame (not linearly independent) consisting of both {cos(kθ)}k∈Z and {sin(kθ)}k∈Z+ . Another possibility is to employ a change of variables x = cos(θ), yielding (univariate) Chebyshev polynomials of the first and second kind: Tk (x) = cos(kθ), Uk (x) = sin((k + 1)θ)/ sin(θ). These polynomials (in particular the first kind) are ubiquitous in approximation theory and famous for their excellent approximation properties. We will develop the corresponding multivariate theory and see that we have similar possibilities for constructing spectrally converging frames and bases. Root systems and affine Weyl groups. Let V be a finite-dimensional real Euclidean vector space with standard inner product (·, ·). The construction above can be generalized to all those simplexes ⊂ V with the property ˜ generated by reflecting about its faces is a that the group of isometries W crystallography group. All such simplexes are determined by a root system, a set of vectors in V which are perpendicular to the reflection planes of W passing through the origin. We review some basic definitions and results about root systems. For more details we refer to Bump (2004). Definition 4.10. A root system in V is a finite set Φ of non-zero vectors, called roots, that satisfy the following conditions. (1) The roots span V. (2) The only scalar multiples of a root α ∈ Φ that belong to Φ are ±α. (3) For every root α ∈ Φ, the set Φ is invariant under reflection in the hyperplane perpendicular to α, i.e., for any two roots α and β, the set Φ contains the reflection of β, sα (β) := β − 2
(α, β) α ∈ Φ. (α, α)
(4) (Crystallographic restriction.) For any α, β ∈ Φ, we have 2
(α, β) ∈ Z. (α, α)
Condition (4) implies that the obtuse angle between two different reflection planes must be either 90◦ , 120◦ , 135◦ or 150◦ . This is a fundamental fact in crystallography, implying that rotational symmetries of a crystal must be either 2-fold, 3-fold, 4-fold or 6-fold. The rank of the root system is the dimension d of the space V. Any root system contains a subset (not uniquely defined) Σ ⊂ Φ of so-called simple
46
S. H. Christiansen, H. Z. Munthe-Kaas and B. Owren
An g
g
g
g
g
g> g
Cn g
g
g
g< g g
Dn g
g
g @g
E8 g
g
G2 g< g
Bn
g
g
g E6 g
g
g
g
g
g E7 g
g
g
g
g
g
g
g
g
g
g> g
g
g
F4
g
g
g
Figure 4.2. Dynkin diagrams for irreducible root systems.
positive roots. This is a set of d linearly independent roots Σ = {α1 , . . . , αd } such that any root β ∈ Φ can be written either as a linear combination of αj with non-negative integer coefficients, or as a linear combination with nonpositive integer coefficients. We call Σ a basis of the root system Φ. A root system is conveniently represented by its Dynkin diagram. This is a graph with d nodes corresponding to the simple positive roots. Between two nodes j and k, no line is drawn if the angle between αj and αk is 90◦ , a single line is drawn if it is 120◦ , a double line for 135◦ and a triple line for 150◦ . It is only necessary to understand the geometry of irreducible root systems when the Dynkin diagram is connected. Disconnected Dynkin diagrams (reducible root systems) are trivially understood in terms of products of irreducible root systems. For irreducible root systems, the roots are either all of the same length, or have just two different lengths. In the latter case a marker < or > on an edge indicates the separation of long and short roots (short < long). Since the work of W. Killing and E. Cartan in the late nineteenth century it has been known that Dynkin diagrams of irreducible root systems must belong to one of four possible infinite cases, An (n > 0), Bn (n > 1), Cn (n > 2), Dn (n > 3), or five special cases, E6 , E7 , E8 , F4 , G2 , shown in Figure 4.2. We say that two root systems are equivalent if they differ only by a scaling or an isometry. Up to equivalence, there corresponds a unique root system to each Dynkin diagram. We will see that the root system and also the Weyl group can be explicitly computed (as real vectors and matrices) using from the Cartan matrix defined below. A root system Φ is associated with a dual root system Φ∨ defined such that a root α ∈ Φ corresponds to a co-root α∨ := 2α/(α, α) ∈ Φ∨ . If all roots have equal lengths then Φ∨ = Φ (up to equivalence), i.e., the root system is self-dual. For the cases with two root lengths we have Bn∨ = Cn , F4∨ = F4 and G∨ 2 = G2 . The Cartan matrix is defined as Cj,k = (αj , αk∨ ) = 2(αj , αk )/(αk , αk ). Its diagonal is Cj,j = 2. Off-diagonal entries Cj,k are found from the number of edges between αj and αk and their
47
Topics in structure-preserving discretization
relative lengths: 0 −1 Cj,k = −2 −3
if if if if
no edge, single edge, or multiple edge where αj < αk , double edge and αj > αk , triple edge and αj > αk .
The ratio of long and short roots is as follows. If αj > αk then αj = √ > = is a double edge and αj = √2αk in the cases where the division = 3αk when it is triple ≡ > ≡. It is convenient such √ to choose normalization ∨ that the longest roots have length αj = 2. This leads to αj = αj for the long roots. For short roots this implies αk∨ = 2αk in the double-line cases > ≡. = > = and αk∨ = 3αk in the triple-edge case ≡ Let D be the diagonal matrix Dk,k = αk . Then S = D−1 CD/2 is a symmetric matrix, and we compute bases for the root system Φ and the dual root system Φ∨ as the columns of the matrices6 Σ and Σ∨ given as Σ = RD, ∨
Σ = 2RD
(4.23) −1
,
(4.24)
where R is the Cholesky factorization of S, i.e., R is upper-triangular, with positive diagonal elements, such that R R = D−1 CD/2. A root system leads to the definition of Weyl groups and affine Weyl groups. Let Φ be a d-dimensional root system with dual root system Φ∨ . For any root α ∈ Φ consider the reflection sα : V → V given by sα (t) = t −
2(t, α) α = t − (t, α∨ )α. (α, α)
For the dual roots α∨ ∈ Φ∨ we define translations τα∨ : V → V by τα∨ (t) = t + α∨ . The Weyl group of Φ is the finite group of isometries on V generated by the reflections sα for α ∈ Σ: W = {sα }α∈Σ . The dual root lattice L∨ is the lattice spanned by the translations τα∨ for α∨ ∈ Σ∨ . We identify this with the abelian group of translations on V generated by the dual roots L∨ = {τα∨ }α∨ ∈Σ∨ . ˜ is the infinite crystallographic symmetry group The affine Weyl group W of V generated by the reflections sα for α ∈ Σ and the translations τα∨ for 6
By abuse of notation we use Σ to denote both the basis for the root system and the matrix whose columns form the basis of the root system.
48
S. H. Christiansen, H. Z. Munthe-Kaas and B. Owren
α∨ ∈ Σ∨ , thus it is the semidirect product of the Weyl group W with the dual7 root lattice L∨ ˜ = {sα }α∈Σ , {τα∨ }α∨ ∈Σ∨ = W L∨ . W Let Λ denote the reciprocal lattice of L∨ , i.e., for all λ ∈ Λ and all α∨ ∈ Φ∨ we have (λ, α∨ ) ∈ Z. The lattice Λ is spanned by vectors {λj }dj=1 such that (λj , αk∨ ) = δj,k for all αk∨ ∈ Σ∨ . The vectors λj are called the fundamental dominant weights of the root system Φ and Λ is called the weights lattice. We use the weights λj and dual roots αk∨ to represent the Weyl group in matrix form as follows: wj,k := (λj , wαk∨ )
for all w ∈ W .
(4.25)
In particular, the reflections sαr for αr ∈ Σ are represented as (sαr )j,k = δj,k − Cr,k δr,j ⇒ sαr = I − er e r C, where C is the Cartan matrix and {er } is the standard basis on Rd . This shows that the Weyl group can be represented as integer matrices with respect to the basis Σ∨ and the dual basis {λ1 , . . . , λd } for V. The positive Weyl chamber C+ is defined as the closed conic subset of V containing the points with non-negative coordinates with respect to the dual basis {λ1 , . . . , λd }, in other words C+ = {t ∈ V : (t, αj ) ≥ 0}. This is a fundamental domain for the Weyl group acting on V. The boundary of C+ consists of the hyperplanes perpendicular to {α1 , . . . , αd }. The affine Weyl group contains reflection symmetries about affine planes perpendicular to the roots, shifted a half-integer multiple of the length of a co-root away from the origin, i.e., for each α∨ ∈ Φ∨ and each k ∈ Z there is an affine plane consisting of the points Pk,α∨ = {t ∈ V : 2(t, α∨ ) = k(α∨ , α∨ )} = {t ∈ V : (t, α) = k}, and this affine plane is invariant under the affine reflection τkα∨ · sα . A connected closed subset of V limited by such affine planes is ˜. called an alcove, and is a fundamental domain for the affine Weyl group W The situation is particularly simple for irreducible root systems, where the alcoves are always d-simplexes. Recall that any root α ∈ Φ can be expressed as α = dk=1 nk αk , where the nk = 2(α, λk )/(αk , αk ) are either all non-negative or all non-positive integers. A root α ˜ strictly dominates another root α, written α ˜ α, if n ˜ k ≥ nk for all k, with strict inequality for at least one k. Irreducible root systems have a unique dominant root 7
Since the Weyl groups of Φ and of Φ∨ are identical, it is no problem to instead define ˜ = W L as the semidirect product of the Weyl group with the primal root lattice. W We have, however, chosen here to follow the most common definition, which leads to a slightly simpler notation for the Fourier analysis.
Topics in structure-preserving discretization
49
A × A root system 1 1 α 2
λ
2
λ1
α1
Figure 4.3. Fundamental domains of reducible root system A1 × A1 .
α ˜ ∈ Φ such that α ˜ α for all α = α ˜ . The dominant root α ˜ is the unique long root in the Weyl chamber (possibly on the boundary). Basic geometric properties of affine Weyl groups are summarized by the following lemma. Lemma 4.11. (i) If Φ is irreducible with dominant root α ˜ then a fundamental domain ˜ is the simplex ⊂ V given by for W = {t ∈ V : (t, α ˜ ) ≤ 1 and (t, αj ) ≥ 0 for all αj ∈ Σ}, ˜ ) for where has corners in the origin and in the points λj /(λj , α j = 1, . . . , d. (ii) The affine Weyl group is generated by the affine reflections8 about the boundary faces of the fundamental domain . For irreducible Φ these are ˜ = {sα }dj=1 , τα˜ · sα˜ . W j (iii) If Φ is reducible then a fundamental domain for the affine Weyl group is given as the Cartesian product of the fundamental domains for each of its irreducible components. Example 4.12. The simplest rank d root system is the reducible system A1 × · · · × A1 , where the Dynkin diagram consists of d non-connected dots. Figure 4.3 shows A1 × A1 . The square outlined in black is the fundamental domain of the root lattice, and the small shaded square is the fundamental ˜ . Reducible root systems can be easily domain of the affine Weyl group W understood as products of irreducible root systems. For instance, the multivariate Chebyshev polynomials corresponding to A1 ×· · ·×A1 are the tensor products of d univariate (classical) Chebyshev polynomials on a d-cube. 8
˜ is generated by reflections it is also a special case of a Coxeter group. Since W
50
S. H. Christiansen, H. Z. Munthe-Kaas and B. Owren α2 A2 root system α
2
λ
λ
2
1
2
λ2
α2
λ1
λ1 α1
α
α1
(a)
G root system
B2 root system
λ2
1
(b)
(c)
Figure 4.4. The 2D irreducible root systems.
Figure 4.5. Fundamental domains of A3 root system.
Example 4.13. The 2D and 3D irreducible root systems are A2 , B2 , G2 , A3 , B3 and C3 . The Cartan matrix, the matrix representation of generators for the Weyl group, and the size of the Weyl group are shown in Table 4.3. Figure 4.4 shows the 2D cases with roots α (large dots), dominant root α ˜ (larger dot), simple positive roots (α1 , α2 ), and their fundamental dominant weights√(λ1 , λ2 ). The roots are normalized such that the longest roots have length 2, thus for long roots α∨ = α. For short roots we have for B2 that α∨ = 2α2 and for G2 that α∨ = 3α. The fundamental domain of the dual root lattice (Voronoi region of L∨ ) is indicated by , and , and the fundamental domain for the affine Weyl group is indicated by triangles. Figure 4.5 shows the A3 case (self-dual), where the fundamental domain (Voronoi region) of the root lattice is a rhombic dodecahedron, a convex polyhedron with 12 rhombic faces. Each of these faces (composed of two triangles) is part of a plane perpendicular to one of the 12 roots, half-way out to the root (roots are not drawn). The fundamental domain of the affine Weyl group is the tetrahedron with an inscribed octahedron. The
51
Topics in structure-preserving discretization Table 4.3. The Cartan matrix, the matrix representation of generators for the Weyl group, and the size of the Weyl group. C A2 B2 G2 A3
B3
C3
2 −1 −1 2 2 −2 −1 2 2 −1 −3 2
2 −2 0 2 −1 0 2 −1 0
s1
−1 0 2 −1 −1 2 −1 0 2 −2 −1 2 −1 0 2 −1 −2 2
s2
−1 1 0 1 −1 2 0 1 −1 1 0 1
−1 0 0 −1 0 0 −1 0 0
1 0 1 0 0 1 1 0 1 0 0 1 1 0 1 0 0 1
1 0 1 −1 1 0 1 −1 1 0 3 −1
|W |
s3
6 8
1 0 0 −1 1 −1 1 0 0 0 1 0 1 0 0 −1 1 −1 2 0 0 0 1 0 1 0 0 −1 1 −1 1 0 0 0 1 0
12 0 1 1 0 1 1 0 1 2
0 0 −1 0 0 −1 0 0 −1
24
48
48
corners of this tetrahedron constitute the fundamental dominant weights λ1 , λ2 , λ3 . The regular octahedron drawn inside the Weyl chamber is important for application of multivariate Chebyshev polynomials, discussed in Section 4.2.2. Laplacian eigenfunctions on triangles, tetrahedra and simplexes. In this subsection we will consider real- or complex-valued functions on V-respecting symmetries of an affine Weyl group. Consider first L2 (T), the space of complex-valued L2 -integrable periodic functions on the torus T = V/L∨ i.e., functions f such that f (y + α∨ ) = f (y) for all y ∈ V and α∨ ∈ L∨ . Since the weights lattice Λ is reciprocal to L∨ , the Fourier basis for periodic functions is given as {exp(2πi(λ, t))}λ∈Λ and Fourier transforms are defined for f ∈ L2 (T): 1 f (λ) = F(f )(λ) = f (t)e−2πi(λ,t) dt, (4.26) vol(T) T (4.27) f(λ)e2πi(λ,t) . f (t) = F −1 (f)(t) = λ∈Λ
We are interested in functions which are periodic under translations in L∨ ˜ , e.g., functions and which in addition respect the other symmetries in W
52
S. H. Christiansen, H. Z. Munthe-Kaas and B. Owren
˜ (we will with odd or even symmetry with respect to the reflections in W see below that there are also other possibilities). Due to the semi-direct ˜ can be written ˜ = W L∨ it follows that any w ˜∈W product structure W ∨ ∨ ∨ w ˜ = w · τα , where w ∈ W and α ∈ L . Thus, on the space of periodic ˜ and the finite group W are identical. We functions L2 (T) the action of W define subspaces of symmetric and skew-symmetric periodic functions as follows: L2∨ (T) = {f ∈ L2 (T) : f (wt) = f (t) for all w ∈ W , t ∈ T }, L2∧ (T) = {f ∈ L2 (T) : f (wt) = (−1)|w| f (t) for all w ∈ W , t ∈ T }, where |w| denotes the length, defined as |w| = , where w = sαj1 · · · sαj is written in the shortest possible way as a product of reflections about the simple positive roots αj ∈ Σ. Thus (−1)|w| = det(w) = ±1 depending on whether w is a product of an even or odd number of reflections. We define L2 -orthogonal projections π∨W and π∧W on these subspaces as 1 π∨W f (t) = f (wt), (4.28) |W | w∈W 1 W (−1)|w| f (wt). (4.29) π∧ f (t) = |W | w∈W
Orthogonal bases for these subspaces are obtained by projecting the exponentials, yielding the cosine- and sine-type basis functions cλ (t) := π∨W exp 2πi(λ, t), sλ (t) := π∧W exp 2πi(λ, t) as in (4.21)–(4.22). Note that these are not all distinct functions. Since they possess symmetries cλ (t) = cwλ (t), sλ (t) = (−1)|w| swλ (t), for every w ∈ W , we need only one λ from each orbit of W . The weights in the Weyl chamber, Λ+ = C+ ∩ Λ, form a natural index set of orbit representatives, and we find L2 -orthogonal bases by taking the corresponding cλ (t) and sλ (t). Lemma 4.9 also holds in the following more general case. Lemma 4.14. Let φ be a rank d root system with weights lattice Λ. Let W be the Weyl group and let denote the fundamental domain of the affine ˜ = W L∨ . The functions {cλ (t)}λ∈Λ and {sλ (t)}λ∈Λ Weyl group W + + form two distinct L2 -orthogonal bases for L2 (). These basis functions are eigenfunctions of the Laplacian ∇2 on satisfying homogeneous Neumann and Dirichlet boundary conditions, as in Lemma 4.9.
Topics in structure-preserving discretization
53
Unfortunately, truncations of these bases do not form excellent approximation spaces for analytic functions on . Approximation of a function f , defined on , in terms of {cλ (t)} is equivalent to Fourier approximation of the even extension of f in L2∨ (T), and in general we only observe quadratic convergence due to discontinuity of the gradient across the boundary of . A route to spectral convergence is by a change of variables, which turns the trigonometric polynomials {cλ (t)} and {sλ (t)} into multivariate Chebyshev polynomials of the first and second kind. Before we dive into this topic, we remark on an alternative approach. Trigonometric polynomials with generalized symmetries. In 1D it is known that spectral (exponentially converging) approximations for analytic f defined on can be obtained by employing the frame (i.e., a spanning set of vectors which is not linearly independent) generated by taking both the cosine and sine functions. In the frame we compute an approximating function by solving the following periodic extension problem. Find a smooth extension of f to L2 (T) and approximate this by the frame on . A detailed discussion of such techniques is found in Huybrechs (2010). One question is whether a frame consisting of only cλ (t) and sλ (t) might also be sufficient to obtain spectral convergence for higher-dimensional domains, or whether we have to include basis functions with other kinds of symmetries. Consider L2 (T, W), the space of functions periodic on T returning values in a Hilbert space W with inner product (·, ·)W . The inner product on L2 (T, W) is (f, g) = (f (t), g(t))W dt. T
Recall that a representation of the group W on W is a map ρ : W → Gl(W), defining a linear action of W on W, i.e., for w ∈ W , ρ(w) is an invertible linear map on W such that ρ(ww) ˜ = ρ(w)ρ(w). ˜ The integer dρ = dim(W) is called the dimension of the representation ρ. We will (without loss of generality) always assume representations are unitary with respect to (·, ·)W . We say that f ∈ L2 (T, W) is ρ-symmetric if f (wt) = ρ(w)f (t)
for all w ∈ W , t ∈ T.
The space of such symmetric functions is denoted L2ρ (T, W). As an example, the functions in L2∨ (T) and L2∧ (T) are ρ-symmetric with respect to the trivial representation ρs (w) = 1 and the alternating representation ρa (w) = (−1)|w| acting on W = R. Since the Weyl group W is constructed as a group of linear transformations on V, we always also have the faithful identity representation ρI (w) = w, acting on W = V. Seen through a kaleidoscope,
54
S. H. Christiansen, H. Z. Munthe-Kaas and B. Owren
a vector field on appears to be ρI -symmetric on T, where the vectors are reflected in the mirrors. We define a projection πρW : L2 (T, W) → L2ρ (T, W) as πρW f (t) =
1 ρ(w−1 )f (wt). |W |
(4.30)
w∈W
Since ρ is unitary, it can be shown that πρW is an L2 -orthogonal projection. Note that scalar functions f : T → C can be symmetrized with respect to representations on any vector space W in a similar manner, i.e., 1 ρ(w−1 )f (wt), πρW f (t) = |W | w∈W
which yields a function πρW f (t) returning values in the space of all matrices over W. Using Theorem 4.6, we can recover f on T from its symmetrizations on . Proposition 4.15. Let f be a periodic scalar function f ∈ L2 (T). Given the symmetrizations fρ = πρW f ∈ L2ρ (T, W) for all ρ ∈ R, where R is a complete list of irreducible representations of W , we recover f on all of T as dρ trace (ρ(w)fρ (t)), for all t ∈ and w ∈ W . f (wt) = ρ∈R
It should be remarked that for the root system An the Weyl group is W Sn+1 , the symmetric group consisting of all permutations of n + 1 items. The representation theory of Sn+1 is well known, and there also exist fast algorithms for computing the corresponding transforms. Similarly to the symmetrization of f we can symmetrize the Fourier basis with respect to ρ and obtain matrix-valued symmetrized exponentials defined as the dρ × dρ matrices expρ,λ (t) := πρW e2πi(λ,t) ,
(4.31)
where dρ = dim(W). Restricting to λ ∈ Λ+ and ρ ∈ R, where R is a complete list of irreducible representations of W , the components of {expρ,λ }λ∈Λ+ ,ρ∈R form an L2 -orthogonal basis for L2 (T). Restricted to they form a tight frame with frame bound |W |: see Huybrechs (2010) for a treatment of the classical case A1 . These generalized symmetric exponential functions are (almost) equivalent to the irreducible representations of the ˜ obtained by the technique of small groups (Serre 1977). affine Weyl group W In Section 4.2.2 we will see that the odd and even symmetrized exponentials cλ (t) and sλ (t) transform to multivariate Chebyshev polynomials of the first and second kind under a particular change of variables. Also, the
Topics in structure-preserving discretization
55
more general ρ-symmetrized exponentials expρ,λ (t) are related to multivariate Chebyshev polynomials of ‘other kinds’. Approximation theory on the simplex using the frame spanned by {expρ,λ }, and the theory of multivariate Chebyshev polynomials of other kinds, is currently under investigation.9 It is known in the A2 case that the frame consisting only of cλ (t) and sλ (t) is not sufficient to guarantee spectral convergence of arbitrary analytic functions on . By including the last four basis functions arising from the irreducible two-dimensional representation ρI (w) = w we do obtain spectral convergence. However, practical use of these techniques in discretizations of PDEs has not yet been completed. 4.2.2. Multivariate Chebyshev polynomials Bivariate Chebyshev polynomials were constructed independently by Koornwinder (1974) and Lidl (1975) by folding exponential functions. Multidimensional generalizations (the A2 family) appeared first in Eier and Lidl (1982). Hoffman and Withers (1988) presented a general folding construction. Characterization of such polynomials as eigenfunctions of differential operators is found in Beerends (1991) and Koornwinder (1974). Applications to the solution of differential equations are found in Munthe-Kaas (2006) and to triangle-based spectral element Clenshaw–Curtis-type quadratures in Ryland and Munthe-Kaas (2011). Recall that classical Chebyshev polynomials of the first and second kind, Tk (x) and Uk (x), are obtained from cos(kθ) and sin(kθ) by a change of variable x = cos(θ), as Tk (x) = cos(kθ), sin((k + 1)θ) . Uk (x) = sin(θ) We want to understand this construction in the context of affine Weyl groups. We recognize cos(kθ) and sin(kθ) as the symmetrized and skewsymmetrized exponentials. The cos(θ) used in the change of variables is the 2π-periodic function, which is symmetric, non-constant and has the longest wavelength (as such, uniquely defined up to constant). In other words cos(θ) = π∨ exp(λ1 θ), where λ1 = 1 is the generator of the weights lattice. Any periodic band-limited even function f has a symmetric Fourier series of finite support on the weights lattice, and must hence be a polynomial in the variable x = cos(θ). The denominator sin(θ) is similarly the odd function of longest possible wavelength. Any periodic band-limited odd function f has a skew-symmetric Fourier series on the weights lattice. Dividing out sin(θ) results in a band-limited even function which again must 9
H. Munthe-Kaas and D. Huybrechs, work in progress.
56
S. H. Christiansen, H. Z. Munthe-Kaas and B. Owren
map to a polynomial under our change of variables. The denominator, which in our special case is sin(θ), we call the Weyl denominator. It plays an important role in the representation theory of compact Lie groups as the denominator in Weyl’s character formula, the jewel in the crown of representation theory. We will detail these constructions below. Notation. As in Section 4.2.1, we let Φ be a rank d root system on V = Rd , ˜ = W L∨ . with Weyl group W , co-root lattice L∨ and affine Weyl group W ∨ Let T = V/L be the torus of periodicity and Λ = spanZ {λ1 , . . . , λd } the reciprocal lattice of L∨ . The lattice Λ is an abelian group known as the Pontryagin dual of the abelian group T. Specifically, each λ ∈ Λ corresponds uniquely to an exponential function exp(2πi(λ, t)), which is one of the irreducible one-dimensional representations on T. These form an abelian group under multiplication. In the following, it is convenient to write the group Λ in multiplicative form as follows. Let {eλ }λ∈Λ denote the elements of the multiplicative group,10 understood as formal symbols such that for λ, µ ∈ Λ we have eλ · eµ = eλ+µ . Let E = E(C) denote the free complex over the symbols eλ . vector space λ This consists of all formal sums a = λ∈Λ a(λ)e where the coefficients a(λ) ∈ C and all but a finite number of these are non-zero. This is the complex group algebra over the multiplicative group Λ, with a commutative product induced from the group product a(λ) b(µ) = a(λ)b(µ) · eν . λ∈Λ
We define conjugation
µ∈Λ
ν∈Λ
λ+µ=ν
: E → E as a= a(λ)e−λ . λ∈Λ
An element a ∈ E is identified with a trigonometric polynomial f (t) = F −1 (a)(t) on the torus T (i.e., a band-limited periodic function) through the Fourier transforms given in (4.26)–(4.27). Multiplication and conjugation in E corresponds to pointwise multiplication and complex conjugation of the functions on T. Let E∨W ⊂ E denote the symmetric subalgebra of those elements that are invariant under the action of the Weyl group W on E. This consists of those a ∈ E where a(λ) = a(wλ) for all λ and all w ∈ W . Similarly, E∧W ⊂ E denotes those a ∈ E whose sign alternates under reflections sα , i.e., where the coefficients satisfy a(λ) = (−1)|w| a(wλ). Here |w| denotes the length 10
Those who prefer can simply consider eλ to be shorthand for exp(2πi(λ, t)), as a function of t ∈ T.
Topics in structure-preserving discretization
57
of w, the length of the shortest factorization of w into a product of simple reflections. Thus (−1)|w| = det(w). The alternating elements do not form a subalgebra, since the product of two alternating functions is symmetric. The subspaces E∨W and E∧W correspond to W -symmetric and W -alternating trigonometric polynomials on T. As a digression we remark that a parallel theory is the representation theory of compact connected Lie groups G: see Bump (2004) for an excellent exposition. In this setting T is the maximal torus of G, i.e., a maximal abelian subgroup. Any g ∈ G is conjugate to a point in T, i.e., there exist a k ∈ G such that kgk −1 ∈ T. The normalizer N (T) is composed of those elements of G which fix T under conjugation, N (T) = {k ∈ GkTk −1 = T}. The Weyl group is W = N (T)/T, which is always finite. It can be shown that the action of W on T through conjugation can be represented in terms of a root system. This implies that class functions on G, i.e., functions such that f (g) = f (kgk −1 ) for all k, can be represented as W invariant functions on T, and that any function in E∨W can be interpreted as a class function on G. Of particular interest are the class functions which arise as traces of the irreducible representations on G. These are called the irreducible characters, and are known explicitly through the celebrated Weyl character formula. We will see that the irreducible characters and multivariate Chebyshev polynomials of the second kind are equivalent: see Beerends (1991). Multivariate Chebyshev polynomials. Define a projection π∧W : E → E∧W by its action on the coefficients a → π∧W a: (π∧W a)(λ) =
1 (−1)|w| a(wλ). |W | w∈W
The projection π∨W : E → E∨W is defined similarly, omitting (−1)|w| . The algebra E is generated by {eλj }dj=1 ∪ {e−λj }dj=1 where λj are the fundamental dominant weights. E∨W is the subalgebra generated by the symmetric generators {zj }dj=1 defined by zj = π∨W eλj =
1 wλj 2 wλj e = e , |W | |W | + w∈W
w∈W
where W + denotes the even subgroup of W containing those w such that |w| is even. The latter identity follows from sαj λj = λj , so it is enough to consider w of even length. The action of W + on λj is free and effective. It can be shown that E∨W is a unique factorization domain over the generators {zj }, i.e., any a ∈ E∨W can be expressed uniquely as a polynomial in {zj }dj=1 .
58
S. H. Christiansen, H. Z. Munthe-Kaas and B. Owren
The skew subspace E∧W does not form an algebra, but this can be corrected by dividing out the Weyl denominator. Define the Weyl vector ρ ∈ Λ as ρ=
d
λj =
j=1
1 α. 2 + α∈Φ
We define the Weyl denominator D ∈ E∧W as (−1)|w| ewρ . D= w∈W
Proposition 4.16. Any a ∈ E∧W is divisible by D, i.e., there exists a unique b ∈ E∨W such that a = bD. Proof.
See Bump (2004, Proposition 25.2).
Any a ∈ E∨W can be written as a polynomial in z1 , . . . , zd , and hence the following polynomials are well-defined. Definition 4.17. For λ ∈ Λ we define multivariate Chebyshev polynomials of the first and second kind, Tλ and Uλ , as the unique polynomials that satisfy 1 wλ e , (4.32) Tλ (z1 , . . . , zd ) = π∨W eλ = |W | w∈W |w| w(ρ+λ) |W |π∧W eλ+ρ w∈W (−1) e = . (4.33) Uλ (z1 , . . . , zd ) = |w| wρ D w∈W (−1) e By a slight abuse of notation we will also consider zj as W -invariant functions on T as 2 2πi(λj ,t) e . (4.34) zj (t) = F −1 (zj )(t) = |W | + w∈W
We will study coordinates on T obtained from these. The functions zj (t) may be real or complex. If there exists an w ∈ W + such that wλj = λj , then zj = zj is real. Otherwise there must exist an index j = j and a w ∈ W + such that wλj = λj and we have zj = zj . In the latter case we can 1 replace these with d real coordinates xj = 12 (zj + zj ), xj = 2i (zj − zj ). ∨ d Using the basis {αj }, we identify T (R/Z) , and let tj ∈ [0, 1) denote standard coordinates on this unit-periodic torus. Let Jk,l (t) =
∂zk (t) ≡ (αl∨ · ∇t )zj (t) ∂αl∨
k, l ∈ {1, . . . , d}
be the Jacobian matrix of the map (t1 , . . . , td ) → (z1 , . . . , zd ).
59
Topics in structure-preserving discretization
Proposition 4.18. The Fourier transform of the Jacobian determinant, J := F(det(J)(t)), is the alternating function J = cD ∈ E∧W , where D is the Weyl denominator and the constant c =
4πi d |W |
.
Proof. Let sα be any reflection in W . Since z(t) = z(sα t) we have J(t) = J(sα t)sα . Hence det(J(t)) = − det(J(sα t)) and we conclude that J ∈ E∧W . By Proposition 4.16, D divides J. We need to confirm that J/D is constant. We compute 4πi α , wλk ewλk . J k, = |W | + w∈W
+ Thus, J k, is supported on W λk and J is supported on the set w j λj . w1 ,...,wd ∈W +
The highest weight in this set is the Weyl vector ρ = dj=1 λj , which is reached if and only if w1 = w2 = · · · wd = I. Since the highest weight is ρ we conclude that J/D = c. The constant c is computed as follows: d sign(σ) c = J(ρ) = Jj,σj (ρ) j=1
σ∈Sd
=
sign(σ)
σ∈Sd
=
d j=1
4πi d
|W |
Jj,σj (λj ) =
σ∈Sd
sign(σ)
σ∈Sd
d j=1
δσj ,j =
d 4πi ασj , λj sign(σ) |W |
j=1
4πi |W |
d
.
Finally, in this paragraph, we want to remark that (4.33) is exactly the same formula as Weyl’s character formula, giving the trace of all the irreducible characters on a semi-simple Lie group (Bump 2004). These characters form an L2 -orthogonal basis for the space of class functions on the Lie group. Thus, expansions in terms of multivariate Chebyshev polynomials of the second kind is equivalent to expansions in terms of irreducible characters on a Lie group. Just as the basis given by the irreducible representations block-diagonalize equivariant linear operators on a Lie group, we can also use irreducible characters to obtain block diagonalizations: see James and Liebeck (2001). Thus, our software, which is primarily constructed to deal with spectral element discretizations of PDEs, may also have important applications to computations on Lie groups. This opens up a whole area
60
S. H. Christiansen, H. Z. Munthe-Kaas and B. Owren
of possible applications of these approximations, such as in random matrix theory. We will not pursue these topics here. We will focus below on applications of Chebyshev polynomials of the first kind in spectral element discretizations. Analytical properties. The polynomials Tλ (z) of the first kind are by construction W-symmetric in λ, Tλ = Twλ for all w ∈ W . Thus the full space of multivariate polynomials is spanned by {Tλ }λ∈Λ+ , where Λ+ are the weights within the positive Weyl chamber. We will first show that this is a family of multivariate orthogonal polynomials. ˜ . The change of variLet ⊂ T denote the fundamental domain of W ables t → z in (4.34) has a Jacobian determinant proportional to the Weyl denominator D. It is known from representation theory that D is always zero on the boundary of and non-zero in the interior. Thus the coordinate map t → z is invertible on , regular in the interior of and singular on the boundary. Let δ = z(). This is a domain which in the A2 case is a deltoid or three-cusp Steiner hypocycloid: see Figure 4.6(b). Note that D ∈ E∧W is an alternating function, thus DD ∈ E∨W is a symmetric function, hence it is a real multivariate polynomial in z. Proposition 4.19. The coordinate map t → z is invertible on δ = z(). The absolute value of the Jacobian determinant is = |c| DD, |J| is a real polynomial in z. The boundary of δ is given as an where DD algebraic ideal, DD = 0. In the A1 case we have J = sin(t), hence DD = sin2 (t) = 1 − z 2 . In the A2 case we have DD =
1 8 3 + (x − 3xy 2 ) − (x2 + y 2 )2 − 2(x2 + y 2 ), 3 3
where x = 12 (z + z) and y = 12 (z − z). Proposition 4.20. The polynomials {Tλ }λ∈Λ+ are orthogonal on δ with respect to the weighted inner product 1 dz. (f, g) = f (z)g(z) √ δ DD Proof. Under the change of variable z → t, we have that Tλ maps to π∨W exp(2πi(λ, t)), and these are L2 -orthogonal on . The weight follows from the formula for the Jacobian determinant.
Topics in structure-preserving discretization
(a)
(b)
61
(c)
Figure 4.6. The equilateral domain ∆ in (a) maps to the deltoid δ in (b) under coordinate map t → z, and to a triangle in (c) under a straightening map.
From the convolution product in E∨W one finds that the Tλ satisfy the recurrence relations T0 = 1,
(4.35)
Tλ j = z j ,
(4.36)
Tλ = Twλ for w ∈ W, T−λ = Tλ , Tλ Tµ =
1 |W |
(4.37) (4.38)
Tλ+wµ .
(4.39)
w∈W
These reduce to classical three-term recurrences for A1 and four-term recurrences for A2 : see Munthe-Kaas (2006). The recurrences provide a practical way of computing values of Tk (z) at arbitrary points z. For special collocation points we will see below that FFT-based computations are much more efficient. Discrete properties. Pulled back to t-coordinates, polynomials in z become band-limited symmetric functions f ∈ L2∨ (T). Due to the Shannon sampling theorem, any band-limited function f ∈ L2 (T) can be exactly reconstructed from sampling on a sufficiently fine lattice S ⊂ T. Due to periodicity, the reciprocal lattice S ∗ must be a sublattice of Λ. The condition for perfect reconstruction is that the only point of the reciprocal lattice S ∗ within the support of f in Λ is the origin. In addition to this condition, we also require the sampling lattice to be W -invariant, W S = S.
62
S. H. Christiansen, H. Z. Munthe-Kaas and B. Owren
There are several ways to construct such a lattice. A convenient way is to let S be a down-scaled version of the co-root lattice, S = L∨ /M,
(4.40)
where M is an integer sufficiently large to ensure the Shannon condition for perfect reconstruction. On the lattice S the sampled function fS becomes a symmetric function on a finite abelian group. Thus we can employ FFTs to find f ∈ E∨W . Special group-theoretic versions of symmetrized FFTs can also be used, which are more efficient, but harder to program than the standard FFT: see Munthe-Kaas (1989). The lattice S maps to collocation points z(S) for the multivariate polynomials, as shown in Figure 4.6 for the A2 case, M = 12. The nodal points z(S) ⊂ δ form the two-dimensional analogue of Chebyshev extremal points. The straight lines in Figure 4.6(a), which are in the direction of a root, map to straight lines in Figure 4.6(b). Along these lines inside δ, the nodal points distribute like 1D classical Chebyshev collocation points (either as Chebyshev zeros, or as Chebyshev extremal points). Similarly, the multivariate Chebyshev points in higher dimensions contain flat hyperplanes of lower dimension, and under restriction to these one restricts to lower-dimensional Chebyshev nodes. This is an important feature of these polynomials, which simplifies restriction of polynomials to (certain specific) linear subspaces. In particular, we note that the hexagon in Figure 4.6(a) maps to an equilateral triangle embedded nicely inside δ (Figure 4.6(b)). The fact that the collocation nodes distribute as 1D Chebyshev nodes on the boundary of this triangle allows us to express in closed form conditions for continuity of polynomials patched together along these triangle boundaries. For high-order polynomial collocation it is extremely important that the Lebesgue number of the collocation points grows slowly in M . It is well known that for classical Chebyshev polynomials the Lebesgue number grows at the optimal rate O(log(M )). From properties of the Dirichlet kernel, one can show a similar result for multivariate Chebyshev polynomials. Proposition 4.21. For the collocation points z(S), where S = L∨ /M ⊂ Rd , the Lebesgue number grows as O(logd (M )). 4.2.3. Spectral element methods based on triangles and simplexes Triangle-based spectral element methods were first considered in Dubiner (1991), where a basis was constructed by a ‘warping’ of a 2D tensor product to a triangle. More recent work is Giraldo and Warburton (2005), Hesthaven (1998) and Warburton (2006), based on interpolation of polynomials in good interpolation nodes on a triangle. Our approach differs from these by basing the construction on the multivariate Chebyshev polynomials, which allows for fast FFT-based computations of all the basic operations on the polynomials. It is well known
Topics in structure-preserving discretization
63
that a logarithmic growth of the Lebesgue number implies exponentially fast (spectral) convergence of polynomial approximations to analytic functions (Canuto et al. 2006). This result, together with the availability of FFT-based algorithms is, just as in the univariate case, among the most important properties of the multivariate Chebyshev polynomials as a practical tool in computational approximation theory and solution of PDEs. Thus, as a conclusion, the coordinate map t → z has a dramatic positive effect on the convergence rate of finite approximations using multivariate Chebyshev polynomials, compared to expansions in the symmetric exponentials π∧W exp(2πi(λ, t). A practical difficulty is, however, the fact that under this change of coordinates the simplex becomes a significantly more complicated domain with cusps in the corners. This has to be dealt with in an efficient manner if we want to construct practical spectral element methods. We have been working with three possible solutions to this problem. • Work with the domain ⊂ T. Use the tight frame provided by the ρ-symmetrized exponentials for ρ ∈ R, and solve the periodic extension problem. This approach has not been developed in detail yet. • Straighten δ to a nearby simplex by a straightening map (MuntheKaas 2006). We have had reasonably good experiences with this approach, but the straightening maps must be singular in the cusps. In numerical experiments with this approach we have seen quite good Lebesgue numbers, and reasonably good convergence rates: see MuntheKaas (2006). However, we have not been able to obtain spectral convergence, probably due to the corner singularities of the straightening map. • Patch together deltoids with overlap, so that the equilateral triangles that are inscribed in the deltoid form a simplicial subdivision of the total space. This approach is working successfully, and will be discussed below. One important question is whether or not this inscribed triangle is a particular feature for the A2 case, or if the higher-dimensional cases also have a similar structure with a nicely inscribed simplex in δ. This is indeed the case. We can prove this for the An family (which is the most important case), and we conjecture that a similar property also holds for the other infinite families of Dynkin diagrams. In Figure 4.7 we illustrate the δ domain in the A3 case. The 3D deltoid-shaped domain contains an inscribed tetrahedron. This tetrahedron is the image of the regular octahedron inscribed in ⊂ T as seen in Figure 4.5. On the faces of this tetrahedron, the nodal points distribute as the Chebyshev points for the A2 case.
64
S. H. Christiansen, H. Z. Munthe-Kaas and B. Owren
Figure 4.7. The deltoid domain δ in the A3 case. The inscribed tetrahedron is the image of the regular octahedron inscribed in the Weyl chamber of : see Figure 4.5.
Numerical experiments. A library of routines has been implemented for the A2 case, both in MATLAB and in C++. All basic algorithms such as products of functions, derivation and integration is implemented using FFTbased techniques; see Ryland and Munthe-Kaas (2011) for more details. Algorithms exist for exactly integrating the polynomials both over δ and also over the inscribed triangle, with respect to weight function 1 or the 1 weight function (DD)− 2 . In Ryland and Munthe-Kaas (2011) we demonstrate the use of these bases in spectrally converging Clenshaw–Curtis-type cubatures based on triangular subdivisions. The software allows for triangles mapped from the equilateral reference triangle both with linear and with non-linear non-singular coordinate maps. The Jacobian of these maps can be supplied analytically, or computed numerically from the sampling values. One problem with this type of quadrature is that, since the deltoid stretches outside its inscribed triangle, one has to evaluate functions at points outside the domain. If this is not possible, one could use the collocation points of the straightened triangle, Figure 4.6(c), for the triangles on the boundary. This, however, reduces the convergence rate. We are currently exploring spectral element discretizations for PDEs based on similar subdivisions. In the experiments, we have explicitly imposed continuity across triangle boundaries. The numerical experiments confirm the exponential convergence rate for these approximations.
65
Topics in structure-preserving discretization solution N=48
100 80 60 40 20 0 −20 50 40
50 30
40 30
20
20
10
10 0
0
Figure 4.8. The numerical experiment shows spectral element solution of ∇2 u = −1 on an L-shaped domain composed of three squares, with Dirichlet boundary conditions. Each square is divided into two isosceles triangles, and all these 6 subdomains are patched together by explicitly imposing conditions for continuity across common boundaries of two triangles. Each triangle has a Chebyshev A2 family of Chebyshev polynomials, in this figure using the root lattice down-scaled with the factor 48 as collocation lattice.
5. Finite element systems of differential forms Many partial differential equations (PDEs) can be naturally thought of as expressing that a certain field, say a scalar field or a vector field, is a critical point of a certain functional. Often this functional will be of the form L(x, u(x), ∇u(x), . . .) dx. S(u) = S
u is a section of a vector bundle over S and L is Here S is a domain in a Lagrangian involving x ∈ S as well as values of u and its derivatives. In this context the functional S is called the action. Criticality of the action can be written as Rd ,
∀u
DS(u)u = 0.
More generally, a PDE written in the form F(u) = 0 can be given a variational formulation: ∀u
F(u), u = 0.
(5.1)
The operator F is continuous from a Banach space X to another one Y , and ·, · denotes a duality product on Y × Y .The unknown u is sought in
66
S. H. Christiansen, H. Z. Munthe-Kaas and B. Owren
X and the equation is tested with u in Y . The duality product is most often a generalization of the L2 (S) scalar product, such as a duality between Sobolev spaces. In the case of least action principles it is of interest to find X such that one can take Y = X (and Y = X). This point of view leads quite naturally to discretizations. We construct a trial space Xn ⊆ X and a test space Yn ⊆ Y , and solve u ∈ Xn , ∀u ∈ Yn
F(u), u = 0.
(5.2)
In theory we have sequences indexed by n ∈ N and establish convergence properties of the method as n → ∞. This discretization technique is called the Galerkin method when Xn = Yn and the Petrov–Galerkin method when Xn and Yn are different. The finite element (FE) method consists in constructing finite-dimensional trial and test spaces adapted to classes of PDEs. Mixed FE spaces have been constructed to behave well for the differential operators grad, curl and div. They provide a versatile tool-box for discretizing PDEs expressed in these terms. Thus Raviart–Thomas div-conforming finite elements (Raviart and Thomas 1977) are popular for PDEs in fluid dynamics and N´ed´elec’s curl-conforming finite elements (N´ed´elec 1980) have imposed themselves in electromagnetics. For reviews and references see Brezzi and Fortin (1991), Roberts and Thomas (1991), Hiptmair (2002) and Monk (2003). These spaces fit the definition of a finite element given by Ciarlet (1978). In particular they are equipped with unisolvent degrees of freedom, which determine inter-element continuity and provide interpolation operators: projections In onto Xn which are defined at least for smooth fields. In applications one often needs a pair of spaces Xna × Xnb , and these spaces should be compatible in the sense of satisfying a Brezzi inf-sup condition (Brezzi 1974). The spaces are linked by a differential operator d : Xna → Xnb (one among grad, curl, div), and the proof of compatibility would follow from a commuting diagram: Xa
d
Ina
Xna
d
/ Xb
Inb
/ Xb
n
A technical problem is that one would like the interpolators to be defined and bounded on the Banach spaces X a , X b , whereas the natural degrees of freedom are not bounded on these. For instance X a is usually of the form: X a = {u ∈ L2 (S) ⊗ E a : du ∈ L2 (S) ⊗ E b }, for some finite-dimensional fibres E a , E b , but this continuity is usually insufficient for degrees of freedom, such as line integrals, to be well-defined. The convergence of eigenvalue problems requires even more boundedness prop-
Topics in structure-preserving discretization
67
erties of the interpolation operators, something more akin to boundedness in L2 (S) (see Christiansen and Winther (2010) for precise statements). Mixed finite elements have been constructed to contain polynomials of arbitrarily high degree. Applying the Bramble–Hilbert lemma to the interpolators gives high orders of approximation, and under stability conditions this gives a high order of convergence for numerical methods. But here too the intention is hampered by the lack of continuity of interpolators. As remarked by Bossavit (1988), lowest-order mixed finite elements, when translated into the language of differential forms, correspond to constructs from differential topology called Whitney forms (Weil 1952, Whitney 1957). The above-mentioned differential operators can all be interpreted as instances of the exterior derivative. From this point of view it becomes natural to arrange the spaces in full sequences linked by operators forming commuting diagrams: X0
d
In0
Xn0
d
/ X1
d
/ ...
d
In1
/ X1
n
d
/ . . .
d
/ Xd
Ind
/ X d. n
An important property is that the interpolators should induce isomorphisms on cohomology groups. This is essentially de Rham’s theorem, when the top row consists of spaces of smooth differential forms and the bottom row consists of Whitney forms. In particular, on domains homeomorphic to balls, the sequences of FE spaces should be exact. This applies in particular to single elements such as cubes and simplexes. High-order FE spaces of differential forms naturally generalizing Raviart– Thomas–N´ed´elec elements were presented by Hiptmair (1999). For a comprehensive review, encompassing Brezzi–Douglas–Marini elements (Brezzi, Douglas and Marini 1985), see Arnold, Falk and Winther (2006b). Elements are constructed using the Koszul operator, or equivalently the Poincar´e homotopy operator, to ensure local sequence exactness, that is, exactness of the discrete sequence attached to a single element. Mixed FE spaces have thus been defined for simplexes. Tensor product constructions yield spaces on Cartesian products. Given spaces defined on some mesh, it would sometimes be useful to have spaces constructed on the dual mesh, matching the spaces on the primal mesh in some sense. Since the dual mesh of a simplicial mesh is not simplicial, this motivates the construction of FE spaces on meshes consisting of general polytopes. On these, it seems unlikely that good FE spaces can be constructed with only polynomials: one should at least allow for piecewise polynomials. In some situations, such as convection-dominated fluid flow, stability requires some form of upwinding. This could be achieved by a
68
S. H. Christiansen, H. Z. Munthe-Kaas and B. Owren
Petrov–Galerkin method, by including upwinded basis functions in either the trial space Xn or the test space Yn . For a recent review of this topic see Morton (2010). This provides another motivation for constructing a framework for finite elements that includes non-polynomial functions. Discretization of PDEs expressed in terms of grad, curl and div on polyhedral meshes has long been pursued in the framework of mimetic finite differences, reviewed in Bochev and Hyman (2006). The convergence of such methods has been analysed in terms of related mixed finite elements (Brezzi, Lipnikov and Shashkov 2005). For connections with finite volume methods see Droniou, Eymard, Gallou¨et and Herbin (2010). While recent developments tend to exhibit similarities and even equivalences between all these methods, the FE method, as it is understood here, could be singled out by its emphasis on defining fields inside cells, and ensuring continuity properties between them, in such a way that the main discrete differential operators acting on discrete fields are obtained simply by restriction of the continuous ones. Ciarlet’s definition of a finite element does not capture the fact that mixed finite elements behave well with respect to restriction to faces of elements. From the opposite point of view, once this is realized, it becomes natural to prove properties of mixed finite elements by induction on the dimension of the cell. The goal is then to construct a framework for FE spaces of differential forms on cellular complexes accommodating arbitrary functions. One requires stability of the ansatz spaces under restriction to subcells and under the exterior derivative. For the good properties of standard spaces to be preserved, one must impose additional conditions on the ansatz spaces, essentially surjectivity of the restriction from the cell to the boundary, and sequence exactness under the exterior derivative on each cell. As it turns out, these conditions, which we refer to as compatibility, imply the existence of interpolation operators commuting with the exterior derivative. Degrees of freedom are not part of the definition of compatible finite element systems but are rather deduced, and it becomes more natural to compare various degrees of freedom for a given system. The local properties of surjectivity and sequence exactness also ensure global topological properties by the general methods of algebraic topology. Interpolation operators still lack desired continuity properties. But combining them with a smoothing technique yields commuting projection operators that are stable in L2 (S). Stable commuting projections were first proposed in Sch¨oberl (2008). Smoothing was achieved by taking averages over perturbations of the grid. Another construction using cut-off and smoothing by convolution on reference macro-elements was introduced in Christiansen (2007). While commutativity was lost, the lack of it was controlled by an auxiliary parameter. As observed in Arnold et al. (2006b), for quasi-uniform
Topics in structure-preserving discretization
69
meshes one can simplify these constructions and use smoothing by convolution on the physical domain. If, in the method of Sch¨ oberl (2008), one can say that the nodes of the mesh are shaken independently, smoothing by convolution consists in shaking them in parallel. Much earlier, in Dodziuk and Patodi (1976), convergence for the eigenvalue problem for the Hodge– Laplacian, discretized with Whitney forms, was proved using smoothing by the heat kernel. For scalar functions, smoothing by convolution in the FE method has been used at least as far back as Strang (1972) and Hilbert (1973), but Cl´ement interpolation (Cl´ement 1975) seems to have supplanted it. Christiansen and Winther (2008) introduced a space-dependent smoothing operator, commuting with the exterior derivative, allowing for general shape-regular meshes. These constructions also require a commuting extension operator, extending differential forms outside the physical domain. This section is organized as follows. In Section 5.2, cellular complexes and the associated framework of finite element systems are introduced. Basic examples are included, as well as some constructions like tensor products. Section 5.2 serves to introduce degrees of freedom and interpolation operators on FE systems. In Section 5.3, we construct smoothers and extensions which commute with the exterior derivative and preserve polynomials locally. When combined with interpolators they yield Lq (S)-stable commuting projections for scale-invariant FE systems. In Section 5.4 we apply these constructions to prove discrete Sobolev injections and a translation estimate. The framework of FE systems was implicit in Christiansen (2008a) and made explicit in Christiansen (2009), but we have improved some of the proofs. Upwinding in this context is new, as well as the discussion of interpolation and degrees of freedom. The construction of smoothers and extensions improves that of Christiansen and Winther (2008) by having the additional property of preserving polynomials locally, up to any given maximal degree. The analysis is also extended from L2 to Lq estimates, for all finite q. This is used in the proof of the Sobolev injection and translation estimate, which are also new (improving Christiansen and Scheid (2011) and Karlsen and Karper (2010)). 5.1. Finite element systems Cellular complexes. For any natural number k ≥ 1, let Bk be the closed unit ball of Rk and Sk−1 its boundary. For instance S0 = {−1, 1}. We also put B0 = {0}. Let S denote a compact metric space. A k-dimensional cell in S is a closed subset T of M for which there is a Lipschitz bijection Bk → T with a Lipschitz inverse. If a cell T is both k- and l-dimensional then k = l. For k ≥ 1, we denote by ∂T its boundary, the image of Sk−1 by the chosen
70
S. H. Christiansen, H. Z. Munthe-Kaas and B. Owren
bi-Lipschitz map. Different such maps give the same boundary. The interior of T is by definition T \ ∂T (it is open in T but not necessarily in S). Definition 5.1. A cellular complex is a pair (S, T ) where S is a compact metric space and T is a finite set of cells in S, such that the following conditions hold. • Distinct cells in T have disjoint interiors. • The boundary of any cell in T is a union of cells in T . • The union of all cells in T is S. In this situation we also say that T is a cellular complex on S. We first make the following remarks. Proposition 5.2. The intersection of two cells in T is a union of cells in T . Proof. Let T, U be two cells in T and suppose x ∈ T ∩ U . Choose a cell T included in T of minimal dimension such that x ∈ T . Choose also a cell U included in U of minimal dimension such that x ∈ U . Suppose neither of the cells T and U are points. Then x belongs to the interiors of both T and U , so that T = U . Therefore there exists a cell included in both T and U to which x belongs. This conclusion also trivially holds if T or U is a point. In fact, if (S, T ) is a cellular complex, S can be recovered from T as follows. Proposition 5.3.
Let (S, T ) be a cellular complex.
• S is recovered as a set from T as its union. • The topology of S is determined by the property that a subset U of S is closed if and only if, for any cell T in T , of dimension k, the image of U ∩ T under the chosen bi-Lipschitz map is closed in Bk . • A compatible metric on S can be recovered from metrics dT on each cell T in T inherited from Bk , for instance by (max ∅ = +∞): d(x, y) = min{1, max{dT (x, y) : x, y ∈ T and T ∈ T }}. A simplicial complex is a cellular complex in which the intersection of any two cells is a cell (not just a union of cells) and such that the boundary of any cell is split into subcells in the same way as the boundary of a reference simplex is split into sub-simplexes. The reference simplex ∆k of dimension k is k+1 : xi = 1 and ∀i xi ≥ 0 . (x0 , . . . , xk ) ∈ R i
Topics in structure-preserving discretization
71
Its sub-simplexes are parametrized by subsets J ⊆ {0, · · · , k} as the solution spaces {x ∈ ∆k : ∀i ∈ J xi = 0}. For each k ∈ N the set of k-dimensional subsets of T is denoted by T k = {T ∈ T : dim T = k}. The k-skeleton of T is the cellular complex consisting of cells of dimension at most k: T (k) = T 0 ∪ · · · ∪ T k . The boundary ∂T of any cell T of T can be naturally equipped with a cellular complex, namely {T ∈ T : T ⊆ T and T = T }. We use the same notation for the boundary of a cell and the cellular complex it carries. A refinement of a cellular complex T on S is a cellular complex T on S such that each element of T is the union of elements of T . We will be particularly interested in simplicial refinements of cellular complexes. A cellular subcomplex of a cellular complex T on S is a cellular complex T on some closed part S of S such that T ⊆ T . For instance, if T ∈ T is a cell, its subcells form a subcomplex of T , which we denote by T˜. We have seen that the boundary of any cell T ∈ T can be equipped with a cellular complex which is a subcomplex of T˜. Fix a cellular complex (S, T ). In the following we suppose that for each T ∈ T of dimension ≥ 1, the manifold T has been oriented. The relative orientation of two cells T and T in T , also called the incidence number , is denoted o(T, T ) and defined as follows. For any edge e ∈ T 1 its vertices are ordered, from say e˙ to e¨. Define o(e, e) ˙ = −1 and o(e, e¨) = 1. As for higher-dimensional cells, fix k ≥ 1. Given T ∈ T k+1 and T ∈ T k such that T ⊆ T , we define o(T, T ) = 1 if T is outward-oriented compared with T and o(T, T ) = −1 if it is inward-oriented. For all T, T ∈ T not covered by these definitions we put o(T, T ) = 0. For each k, let C k (T ) denote the set of maps c : T k → R. Such maps associate a real number with each k-dimensional cell and are called k-cochains. The coboundary operator δ : C k (T ) → C k+1 (T ) is defined by o(T, T )cT . (δc)T = T ∈T k
The space of k-cochains has a canonical basis indexed by T k . The coboundary operator is the operator whose canonical matrix is the incidence matrix o, indexed by T k+1 × T k . We remark that the coefficients in the sum can be non-zero only when T ∈ ∂T ∩ T k .
72
S. H. Christiansen, H. Z. Munthe-Kaas and B. Owren
Lemma 5.4. Proof.
We have that δδ = 0 as a map C k (T ) → C k+2 (T ).
See, e.g., Christiansen (2009, Lemma 3.6).
In other words the family C • (T ) is a complex, called the cochain complex and represented by 0 → C 0 (T ) → C 1 (T ) → C 2 (T ) → · · · . When S is a smooth manifold we denote by Ωk (S) the space of smooth differential k-forms on S. Differential forms can be mapped to cochains as follows. Let S be a manifold and T a cellular complex on S. For each k we denote by ρk : Ωk (S) → C k (T ) the de Rham map, which is defined by k u . ρ : u → T ∈T k
T
Proposition 5.5.
For each k the following diagram commutes:
ρk
ρk+1
/ C k+1 (T )
δ
C k (T ) Proof.
/ Ωk+1 (S)
d
Ωk (S)
This is an application of Stokes’ theorem.
Suppose T is a cellular complex equipped with an orientation (of the cells) and T is a cellular refinement also equipped with an orientation (for instance the same complex but with different orientations). For each cell T ∈ T k and each T ∈ T k define ι(T, T ) = ±1 if T ⊆ T and they have the same/different orientation, and ι(T, T ) = 0 in all other cases. Proposition 5.6.
The map ι : C • (T ) → C • (T ), defined by (ιu)T = ι(T, T )uT , T ∈T
is a morphism of complexes, meaning that ι and δ commute. Proof.
See, e.g., Christiansen (2009, Proposition 3.5).
We also remark that for a manifold S we have the following. Proposition 5.7.
The following diagram commutes: Ω(S)
w ww ww w w {w w ρ
C(T )
ι
GG GG ρ GG GG # / C(T )
Topics in structure-preserving discretization
73
Element systems. For any cell T , we denote by Ωks,q (T ) the space of differential k-forms on T with Ws,q (T ) Sobolev regularity, and put Ωkq (T ) = Ωk0,q (T ). Fix q ∈ [1, +∞[ and define X k (T ) = {u ∈ Ωkq (T ) : du ∈ Ωkq (T )}. When i : T → T is an inclusion of cells and u is a smooth enough form on T we denote by u|T = i u the pullback of u to T . Thus we restrict to the subcell and forget about the action of u on vectors not tangent to it. In the topology (5.1), restrictions to subcells T of codimension one are well-defined, for instance as elements of Ωk−1,q (T ). When T is a cell in a given cellular complex T we may therefore set ˆ k (T ) = {u ∈ X k (T ) : ∀T ∈ T X
T ⊆ T ⇒ u|T ∈ X k (T )}.
Definition 5.8. Suppose T is a cellular complex. For each k ∈ N and each ˆ k (T ) called a differential T ∈ T we suppose we are given a space Ak (T ) ⊆ X k-element on T . We suppose that the exterior derivative induces maps d : Ak (T ) → Ak+1 (T ) and that if i : T ⊆ T is an inclusion of cells, pullback induces a map i : Ak (T ) → Ak (T ). Such a family of elements is called an element system. A differential element is said to be finite if it is finite-dimensional. A finite element system is an element system in which all the elements are finite. ˆ • (•) themselves define an element system. It Example 5.9. The spaces X is far from finite. Example 5.10. Let U be an open subset of a vector space V . We denote by Pp (U ) the space of real polynomials of degree at most p on U . For k ≥ 1 the space of alternating maps V k → R is denoted Ak (V ). The space of differential k-forms on U , which are polynomial of degree at most p, is denoted PAkp (U ). We identify PAkp (U ) = Pp (U ) ⊗ Ak (V )
and
PA0p (U ) = Pp (U ).
Choose a cellular complex where all cells are flat. Choose a function π : T × N → N and define Ak (T ) = PAkπ(T,k) (T ). One gets a finite element system when the following conditions are satisfied: T ⊆ T ⇒ π(T , k) ≥ π(T, k)
and
π(T, k + 1) ≥ π(T, k) − 1.
Example 5.11. Denote the Koszul operator on vector spaces by κ. It is the contraction of differential forms by the identity, considered as a vector field: (κu)x (ξ1 , . . . , ξk ) = ux (x, ξ1 , . . . , ξk ).
74
S. H. Christiansen, H. Z. Munthe-Kaas and B. Owren
Alternatively one can use the Poincar´e operator associated with the canonical homotopy from the identity to the null-map. Let T be a simplicial complex. Define, for non-zero p ∈ N, k+1 k Λkp (T ) = {u ∈ PAkp (T ) : κu ∈ PAk−1 p (T )} = PAp−1 (T ) + κPAp−1 (T ).
For fixed p we call this the trimmed polynomial finite element system of order p. The case p = 1 corresponds to constructs in Weil (1952) and Whitney (1957). Arbitrary order elements were introduced in N´ed´elec (1980) for vector fields in R3 . In Hiptmair (1999) these spaces were extended to differential forms. The correspondence between lowest-order mixed finite elements and Whitney forms was pointed out in Bossavit (1988). See Arnold et al. (2006b) for a comprehensive review. It was usual to start the indexing at p = 0 but, as remarked in the preprint of Christiansen (2007), the advantage of letting the lowest order be p = 1 is that the wedge product induces maps: +k1 (T ). ∧ : Λkp00 (T ) × Λkp11 (T ) → Λkp00 +p 1
See also Arnold et al. (2006b, p. 34). In words, the wedge product respects the grading in k and the filtering in p. This observation was useful in the implementation of a scheme for the Yang–Mills equation (Christiansen and Winther 2006). The first example of a finite element system yields quite useless Galerkin spaces in general, whereas the second one yields good ones. We shall elaborate on this in what follows, starting by defining what the Galerkin space associated with a finite element system is. For any subcomplex T of T we define Ak (T ) as follows: k k A (T ) : ∀T, T ∈ T T ⊆ T ⇒ uT |T = uT . A (T ) = u ∈ T ∈T
Elements of Ak (T ) may be regarded as differential forms defined piecewise, which are continuous across interfaces between cells, in the sense of equal pullbacks. For a cell T its collection of subcells is the cellular complex T˜. Applied to this case, the above definition gives a space canonically isomorphic to Ak (T ). We can identify Ak (T˜) = Ak (T ). An FE system over a cellular complex is an inverse system of complexes: for an inclusion of cells there is a corresponding restriction operator. The space A• (T ) defined above is an inverse limit of this system and is determined by this property up to unique isomorphism. We also point out that this kind of construction, involving glueing of polynomial differential forms on cellular complexes, has been used to study homotopy theory (Griffiths and Morgan 1981).
75
Topics in structure-preserving discretization
Of particular importance is the application of the above construction to the boundary ∂T of a cell T , considered as a cellular complex consisting of all subcells of T except T itself. Considering ∂T as a cellular complex (not only a subset of T ), we denote the constructed space by Ak (∂T ). If i : ∂T → T denotes the inclusion map, the pullback by i defines a map i : Ak (T ) → Ak (∂T ), which we denote by ∂ and call restriction. Conventions. In the following, the arrows starting or ending at 0 are the only possible ones. Arrows starting at R are, unless otherwise specified, the maps taking a value to the corresponding constant function. Arrows ending at R are integration of forms of maximal degree. Other unspecified arrows are instances of the exterior derivative. Consider now the following conditions on an element system A on a cellular complex T . • Extensions. For each T ∈ T and k ∈ N, restriction ∂ : Ak (T ) → Ak (∂T ) is onto. • Exactness. The following sequence is exact for each T : 0 → R → A0 (T ) → A1 (T ) → · · · → Adim T (T ) → 0. The first condition can be written symbolically as
∂Ak (T )
=
(5.3)
Ak (∂T ).
Definition 5.12. We will say that an element system admits extensions if the first property holds, is locally exact if the second condition holds and is compatible if both hold. Given a finite element system A, we say that its points carry reals if, for each point T ∈ T 0 , A0 (T ) contains the constant maps T → R (so that A0 (T ) = RT ≈ R). Proposition 5.13. If A admits extensions and its points carry reals, then for each cell T , Adim T (T ) contains a form with non-zero integral. Proof.
By induction on the dimension of the cell, using Stokes’ theorem.
Notation. We let Ak0 (T ) denote the kernel of ∂ : Ak (T ) → Ak (∂T ). Proposition 5.14.
We have dim Ak (T ) ≤
dim Ak0 (T ),
T ∈T
with equality when the finite element system admits extensions. Proof. For a given m ≥ 0, let T (m) be the m-skeleton of T . We have a sequence: Ak0 (T ) → Ak (T (m) ) → Ak (T (m−1) ) → 0. 0→ T ∈T m
76
S. H. Christiansen, H. Z. Munthe-Kaas and B. Owren
The second arrow is bijective onto the kernel of the third. If all cells of dimension m admit extensions, the whole sequence is exact. The proposition follows from applying these remarks for all m. Combining Propositions 5.13 and 5.14, we get the following. Corollary 5.15. If A admits extensions and its points carry reals, then Ak (T ) has dimension at least the number of k-dimensional subcells of T . Proposition 5.16. When the element system is compatible, the de Rham map ρ• : A• (T ) → C • (T ) induces isomorphisms in cohomology. Proof. We use induction on the dimension of T . In dimension 0 it is clear. Suppose now that m ≥ 1, and that we have proved the theorem when dim T < m. Suppose that T has dimension m. Note that the de Rham map gives isomorphisms in cohomology on cells, A• (T ) → C • (T˜), since both complexes are acyclic. Denote by U the (m − 1)-skeleton of T . Consider the diagram: • • A (U ) A (T ) A• (∂T ) • / / / A (T ) 0 T ∈T m
0
/ C (T ) •
• / C (U )
T ∈T m
T ∈T m
C • (T˜)
C • (∂T ) / T ∈T m
/0
/0
The vertical maps are de Rham maps. The second horizontal arrow consists of restricting to the summands whereas the third one consists of restricting and comparing, as in the Mayer–Vietoris sequence. Both rows are exact sequences of complexes, the diagram commutes, and the last two vertical arrows induce isomorphisms in cohomology by the induction hypothesis. Write the long exact sequences of cohomology groups associated with both rows (e.g., Christiansen (2009, Theorem 3.1)) and connect them with the induced morphisms. Applying the five lemma (e.g., Christiansen (2009, Lemma 3.2)) gives the result for T . Proposition 5.17. For an element system with extensions the exactness of (5.3) on each T ∈ T is equivalent to the combination of the following two conditions. • For each T ∈ T , A0 (T ) contains the constant functions. • For each T ∈ T , the following sequence (with boundary condition) is exact: (5.4) 0 → A00 (T ) → A10 (T ) → · · · → Adim T (T ) → R → 0.
77
Topics in structure-preserving discretization
Proof. When the extension property is satisfied on all cells, both versions (with and without boundary condition) of the cohomological condition guarantee that for each T , Adim T (T ) contains a form with non-zero integral, by Proposition 5.13. When the spaces A0 (T ) all contain the constant functions, we may consider the following diagrams, where T is a cell of dimension m and Am − (T ) denotes the space of forms with zero integral: 0
/R O
/ A0 (∂T ) O
/ ··· O
/ Am−1 (∂T ) O
/R O
/0
0
/R O
/ A0 (T ) O
/ ··· O
/ Am−1 (T ) O
/ Am (T ) O
/0
0
/ A0 (T )
/ ···
/ Am−1 (T )
/ Am (T ) −
/0
0
0
(5.5) The columns, extended by 0, are exact if and only if the extension property holds on T and Am (T ) contains a form of non-zero integral. In this case, if one row is exact, the two other rows are either both exact or both inexact. We now prove the stated equivalence. (i) If compatibility holds then in (5.5) the extended columns are exact, as well as the first and second row, so also the third. Hence (5.4) is exact. (ii) Suppose now exactness of (5.4) holds for each T . Choose m ≥ 1 and suppose that we have proved exactness of (5.3) for cells of dimension up to m − 1. Let T be a cell of dimension m. In (5.5) the extended columns are exact. Apply Proposition 5.16 to the boundary of T to get exactness of the first row. The third row is exact by hypothesis, and we deduce exactness of the second. The induction, whose initialization is trivial, is complete. ˆ is a compatible element system. Corollary 5.18. X Tensor products. Suppose we have two manifolds M and N , equipped with cellular complexes U and V. We suppose we have differential elements Ak (U ) for U ∈ U and B k (V ) for V ∈ V, both forming systems as defined above. Let U × V denote the product cellular complex on M × N , whose cells are all those of the form U × V for U ∈ U and V ∈ V. Recall that the tensor product of differential forms u on U and v on V , is the form on U × V defined as the wedge product of their pullbacks by the respective canonical projections pU : U × V → U and pV : U × V → V . In symbols we can write u ⊗ v = (pU u) ∧ (pV v). We equip U × V with elements C • (U × V ) = A• (U ) ⊗ B • (V ).
78
S. H. Christiansen, H. Z. Munthe-Kaas and B. Owren
Explicitly we put C k (U × V ) =
Al (U ) ⊗ B k−l (V ).
l
This defines an element system C, called the tensor product of A and B. Proposition 5.19.
We have C0• (U × V ) = A•0 (U ) ⊗ B0• (V ).
Proof.
See Christiansen (2009, Lemma 3.10).
Proposition 5.20.
When A and B admit extensions we have C • (U × V) = A• (U ) ⊗ B • (V).
Proof. The right-hand side is included in the left-hand side. Moreover, by Proposition 5.14, dim C(U × V) ≤ U,V dim C0 (U × V ). On the other hand Proposition 5.19 gives U,V dim C0 (U × V ) = U,V dim A0 (U ) ⊗ B0 (V ) = U,V dim A0 (U ) dim B0 (V ) = U dim A0 (U ) V dim B0 (V ) = dim A(U ) dim B(V). This completes the proof. Proposition 5.21. product. Proof.
If A and B admit extensions, so does their tensor
Consider cells U ∈ U and V ∈ V. Note that (∂U × V ) ∪ (U × ∂V ) = ∂(U × V ), (∂U × V ) ∩ (U × ∂V ) = ∂U × ∂V.
The Mayer–Vietoris principle gives an exact sequence, 0 → C(∂(U × V )) → C(∂U × V ) ⊕ C(U × ∂V ) → C(∂U × ∂V ) → 0, where the second and third mappings are w→ w|∂U ×V ⊕ w|U ×∂V , u⊕v → u|∂U ×∂V − v|∂U ×∂V . It follows that dim C(∂(U × V )) = dim C(∂U × V ) + dim C(U × ∂V ) − dim C(∂U × ∂V ).
Topics in structure-preserving discretization
79
Applying Proposition 5.20 three times, we get dim C(∂(U × V )) = dim A(∂U ) dim B(V ) + dim A(U ) dim B(∂V ) − dim A(∂U ) dim B(∂V ) = dim A(U ) dim B(V ) − dim A0 (U ) dim B0 (V ) = dim C(U × V ) − dim C0 (U × V ) = dim ∂C(U × V ). Therefore we obtain ∂C(U × V ) = C(∂(U × V )), as claimed. Proposition 5.22. product.
If A and B are locally exact, then so is their tensor
Proof. This follows from the Kunneth theorem (e.g., Christiansen (2009, Theorem 3.2)). Nesting. Suppose T is a cellular complex and that (Ξ, #) is an ordered set. Suppose that, for each parameter ξ ∈ Ξ, an FE system A[ξ] on T has been chosen. We assume that if ξ # ξ then A[ξ]k (T ) ⊆ A[ξ ]k (T ). Choose now a parameter function π : T → Ξ, which is order-preserving in the sense that if T ⊆ T then π(T ) # π(T ). Define an FE system A[π] by A[π]k (T ) = {u ∈ A[π(T )]k (T ) : ∀T ∈ T
T ⊆ T ⇒ u|T ∈ A[π(T )]k (T )}.
Proposition 5.23. If, for each ξ ∈ Ξ, the system A[ξ] is compatible, then the constructed system A[π] is too. Proof. Note that if u ∈ A[π]k (∂T ) then u ∈ A[ξ(T )]k (∂T ) so it can be extended to an element u ∈ A[ξ(T )]k (T ). This element is in A[π]k (T ). Thus A[π]k (T ) admits extensions. We also have A[π]k0 (T ) = A[π(T )]k0 (T ), which gives local exactness thanks to Proposition 5.17. Example 5.24. For a simplicial complex T , let A[p] denote the trimmed finite element system of order p. We model variable orders of approximation by a function π : T → N∗ such that when T ⊆ T we have π(T ) ≤ π(T ). The above construction defines an FE system A[π], of the type used for hp-methods (Demkowicz, Kurtz, Pardo, Paszy´ nski, Rachowicz and Zdunek 2008). We will check later that the trimmed systems for fixed order p are compatible, and then the above result gives compatibility of the variableorder system defined by π. Locally harmonic forms. Let T be a cell where, for each k, Ak (T ) is equipped with a scalar product a. Orthogonality with respect to a will be denoted
80
S. H. Christiansen, H. Z. Munthe-Kaas and B. Owren
by ⊥. We say that a k-form u on T is A-harmonic if du ⊥ dAk0 (T )
and
u ⊥ dAk−1 0 (T ).
(5.6)
One can, for instance, take a to be the L2 scalar product on differential forms, associated with some Riemannian metric. Denote by d the formal adjoint of d with respect to this scalar product. The continuous analogue of the above condition (5.6) is d du = 0 and
d u = 0.
(5.7)
From the other point of view, (5.6) is the Galerkin variant of (5.7). Proposition 5.25. Let A be a finite element system where each Ak (T ) is equipped with a scalar product a. Suppose T is a cell such that (5.4) is exact. Put m = dim T . m • For
each α ∈ R, there is a unique A-harmonic u ∈ A (T ) such that T u = α.
• For k < m, any u ∈ Ak (∂T ) admitting an extension in Ak (T ), has a unique A-harmonic extension in Ak (T ). Let A be a finite element system on T . Define a finite element system ˚ A by ˚k (T ) = {u ∈ Ak (T ) : ∀T ∈ T A
T ⊆ T ⇒ u|T is A-harmonic}.
˚ is the subsystem of locally harmonic forms. We say that A ˚ is a compatProposition 5.26. If A is a compatible FE system then A k k ˚ ible FE system such that the de Rham map ρ : A (T ) → C k (T ) is an isomorphism. Proof.
This was essentially proved in Christiansen (2008a).
This construction generalizes Kuznetsov and Repin (2005), in which divconforming finite elements are defined on polyhedra in R3 . Since C k (T ) has a canonical basis, the de Rham map determines a corresponding canonical ˚k (T ). Its elements can be constructed by recursive harmonic basis of A extension. Example 5.27. On simplexes, lowest-order trimmed polynomial differential forms are locally harmonic in the sense of (5.7), with respect to the L2 -product associated with any piecewise constant Euclidean metric (Christiansen 2008a). Example 5.28. Locally harmonic forms can be used to define finite element spaces on the dual cellular complex of a given simplicial one (Buffa and Christiansen 2007). Choose a simplicial refinement of the dual mesh,
Topics in structure-preserving discretization
81
for instance the barycentric refinement of the primal mesh. Consider Whitney forms on this refinement as a compatible finite element system on the dual mesh. Then take the subsystem of locally harmonic forms. In space dimension d, this provides a space of k-forms with the same dimension as the space of (d−k)-forms on the primal mesh. Duality in the sense of an inf-sup condition was proved in Buffa and Christiansen (2007) with applications to the preconditioning of integral operators appearing in electromagnetics. Duality methods are quite common in finite volume settings; for a recent development see Andreianov, Bendahmane and Karlsen (2010). Example 5.29. For a given fine mesh one can agglomerate elements into a coarser cellular mesh. The finite element system on the fine mesh then provides a finite element system on the coarse one, with identical function spaces. If the former system is compatible so is the latter. Associated with the latter, we can consider the subsystem of locally harmonic forms. This procedure can be applied recursively: at each level one can consider the locally harmonic forms of the finer level. This yields a multilevel analysis which can be used for multigrid preconditioning (Pasciak and Vassilevski 2008). Here is a third application, again involving the dual finite elements. Example 5.30. written as
Recall that the incompressible Euler equation can be
u˙ + div(u ⊗ u) + grad p = 0
and
div u = 0.
Here, u is a vector field with time derivative u. ˙ One uses div-conforming Raviart–Thomas elements for u: let Xh denote this space. One uses a weak formulation with locally harmonic curl-conforming elements on the dual grid as test functions: let Yh denote this space. The L2 duality and its extensions to Sobolev spaces are denoted ·, ·. It is invertible on Xh × Yh , at least in dimension 2, as proved in Buffa and Christiansen (2007). The semi-discrete problem reads as follows. Find a time-dependent uh ∈ Xh such that, for all vh ∈ Yh which are orthogonal to the subspace of Yn of curl-free elements, we have u˙h , vh + div(uh ⊗ uh ), vh = 0. To see that the second bracket is well-defined, note that div(uh ⊗ uh ) and div div(uh ⊗ uh ) both have W−1,q Sobolev regularity for all q < 2. On the other hand vh and curl vh have W0,q -regularity, for q > 2. Analogous spaces, with regularity expressed by a second-order operator, have been used for Regge calculus (Christiansen 2008b) and elasticity (Sch¨oberl and Sinwel 2007).
82
S. H. Christiansen, H. Z. Munthe-Kaas and B. Owren
In computational fluid dynamics it is often important to include some form of upwinding in the numerical method to obtain stability. A model problem for this situation is the equation ∆u + V · grad u = f,
(5.8)
where the field u ∈ H1 (S) satisfies homogeneous Dirichlet boundary condition, f is a given forcing term, whereas V is a given flow field, which we take to be divergence-free. One is interested in the asymptotic behaviour for small positive (viscosity). Such problems can for instance be solved with Petrov–Galerkin methods. Consider a cellular complex and a large compatible finite element system on it, obtained for instance by refinement. We let one space (say the trial space) consist of locally harmonic forms for the standard L2 -product. For the other space (say the test space) we use locally harmonic forms for a weighted L2 -product. To motivate our choice of weight we introduce some more notions of differential geometry. Given a 1-form α we define the covariant exterior derivative: dα : u → du + α ∧ u, These operators do not form a complex, but we have dα dα u = (dα) ∧ u. In gauge theory the term dα is called curvature. Supposing that α = dβ for a function β, we have dα = exp(−β) d exp(β)u. One says that u → exp(β)u is a gauge transformation. We suppose the domain S is equipped with a Riemannian metric. It provides in particular an L2 scalar product on differential forms. We denote by dα the formal adjoint of d. When α = exp(−β), we have dα u = exp(β)d exp(−β). A natural generalization of (5.7) is dα du = 0 and
dα u = 0,
which can be written as d exp(−β)du = 0 and Example 5.31.
d exp(−β)u = 0.
To address (5.8) define the 1-form α by α(ξ) = −−1 V · ξ,
and note that (5.8) can be rewritten as dα du = −−1 f.
(5.9)
Topics in structure-preserving discretization
83
Given a cellular complex T on S, with flat cells, and a large compatible FE system A, we construct two spaces of locally harmonic forms, distinguished by the choice of scalar product a. For one (the trial space) take a to be the L2 scalar product. For the other (the test space), we choose for each T a constant approximation αT of the pullback of α to T . Let βT be the affine function with zero mean on T such that dβT = αT . For the trial spaces, use the scalar product defined on a cell T by exp(−βT )u · v (5.10) a(u, v) = T
to define the locally harmonic functions. If v is a constant differential form, u = exp(βT )v satisfies the equations (5.9). The canonical basis of the test space will then be upwinded or downwinded (depending on the sign in front of βT in (5.10)), compared with the canonical basis of the trial space. Example 5.32. equation:
Similar notions can be used to address the Helmholtz ∆u + k 2 u = 0.
(5.11)
We wish to construct a compatible FE system over C, which contains a certain number of plane waves: uξ : x → exp(iξ · x). To contain just one of them we remark that for any (flat) cell T , if ξT is the tangent component of ξ on T we have, on T , ∆T uξ |T − iξT · gradT uξ |T = 0. Connecting with the previous example, on a cell T we let βT be the affine real function with zero mean and gradient ξT on T . Define exp(−iβT )u · v. a(u, v) = T
Here, extra care must be taken because this bilinear form is not positive definite and will in fact be degenerate at interior resonances of the cell. Away from them, the locally harmonic forms for the infinite-dimensional ˆ (with q = 2) are well behaved, in the sense of satisfying element system X Proposition 5.26, and contain the plane wave uξ . More generally, suppose one wants to construct an FE system containing a good approximation to a particular solution of (5.11). To the extent that the solution can be locally approximated by a plane wave, the finite element system will contain a good approximation of it, for a choice of a family of functions βT , one for each cell T , to be determined (maybe adaptively).
84
S. H. Christiansen, H. Z. Munthe-Kaas and B. Owren
5.2. Interpolators Mirrors and interpolators. The notion of a mirror system formalizes that of degrees of freedom, with particular emphasis on their geometric location. Definition 5.33. A mirror system is a choice, for each k and T , of a ˆ k (T ) , called a k-mirror on T . subspace Z k (T ) of X ˆ k (T ) then gives a linear form ·, u on Z k (T ), which Any k-form u in X we call the mirror image of u. For a global k-form u the mirror images can be collected into a single object. We define Φk u = ·, u|T T ∈T ∈ Z k (T ) , where, for any subcomplex T of T , we define a (global) mirror Z k (T ) by Z k (T ). Z k (T ) = T ∈T
We say that a mirror system is faithful to an element system A if, for any subcomplex T , restricting Φ to T determines an isomorphism: Φk (T ) : Ak (T ) → Z k (T ) . Example 5.34. The canonical mirror system for the trimmed polynomial FE system of order p is the following, where dim T = m:
Z k (T ) = {u → T v ∧ u : v ∈ PAm−k p−m+k−1 (T )}. It follows from results in Arnold et al. (2006b) that it is faithful. Proposition 5.35. When A admits extensions, a given mirror system Z is faithful if and only if the duality product on Z k (T ) × Ak0 (T ) is invertible for each k and T . Proof. (i) Suppose Z is faithful. By induction on dimension, dim Z k (T ) = dim Ak0 (T ). Moreover, Φk (T ) induces an injection Ak0 (T ) → Z k (T ) . Thus duality on Z k (T ) × Ak0 (T ) is invertible. (ii) Suppose duality on Z k (T ) × Ak0 (T ) is invertible for all k and T . Then dim Ak (T ) = T ∈T dim Ak0 (T ) = dim Z k (T ) . Moreover, Φk (T ) is injective. Indeed, if Φk u = 0 then for T ∈ T , u|T is proved to be 0 by starting with cells T of dimension k, and incrementing cell dimension inductively using u|∂T = 0. Definition 5.36. For a finite element system A, an interpolator is a colˆ k (T ) → Ak (T ), one for each k ∈ N lection of projection operators I k (T ) : X and T ∈ T , which commute with restrictions to subcells.
Topics in structure-preserving discretization
85
One can then denote it simply with I • and extend it unambiguously to any subcomplex T of T . Any faithful mirror system defines an interpolator by Φk I k u = Φk u. We call this the interpolator associated with the mirror system. Proposition 5.37.
The following are equivalent.
• A admits extensions. • A has a faithful mirror system. • A can be equipped with an interpolator. Proof. (i) Suppose A admits extensions. For each k and T , choose a closed ˆ k (T ) and let Z k (T ) be its annihilator. The supplementary of Ak0 (T ) in X duality product on Z k (T ) × Ak0 (T ) is then invertible for each k and T , so that Z is faithful to A. (ii) As already stated, any faithful mirror system defines an interpolator. ˆ k (T ) and (iii) Suppose A has an interpolator. If u ∈ Ak (∂T ) extend it in X k interpolate it to get an extension in A (T ). Example 5.38. In particular, the trimmed polynomial FE system of order p is compatible. As remarked in Christiansen (2010), it is minimal among compatible finite element systems containing polynomial differential forms of order p − 1. For a given element system A, admitting extensions, it will be useful to construct extension operators Ak (∂T ) → Ak (T ), i.e., linear left inverses of the restriction. One also remarks that a faithful mirror system determines a particular extension. Namely, to u ∈ Ak (∂T ) one associates the unique v ∈ Ak (T ) extending u and such that, for all l ∈ Z k (T ), l(v) = 0. Proposition 5.39. Let A be an element system on T admitting extensions. Let M denote the set of mirror systems that are faithful to A, let I be the set of interpolators onto A and let E be the set of extensions in A. The natural map M → I × E is bijective. Proof. For a given interpolator I ∈ I and E ∈ M, define a mirror system z(I, E) as follows. For k ∈ N and T ∈ T consider the map ˆ k (T ) → X ˆ k (T ). QkT = (id −E∂) ◦ I : X It is a projector with range Ak0 (T ). Let z(I, E)k (T ) denote the annihilator of its kernel. In other words l ∈ z(I, E)k (T ) if and only if ˆ k (T ) ∀u ∈ X
Iu = EI∂u ⇒ l(u) = 0.
86
S. H. Christiansen, H. Z. Munthe-Kaas and B. Owren
We claim that z inverts the given map a : M → I × E. (i) Given (I, E), we check that the interpolator and extension defined by z(I, E) are I and E. ˆ k (T ). We have I(u − Iu) = 0 and EI∂(u − Iu) = 0, hence • Pick u ∈ X l(u − Iu) = 0. The interpolator deduced from z(I, E) is thus I. • Pick u ∈ Ak (∂T ). We have IEu = EI∂Eu, hence for all l ∈ z(I, E)k (T ) we have l(u) = 0. The extension deduced from z(I, E) is thus E. (ii) Given a faithful mirror system Z with associated interpolators I and E, we check that z(I, E) = Z. ˆ k (T ) is such that Iu = EI∂u then l(u) = Pick l ∈ Z k (T ). If u ∈ X l(Iu) = l(EI∂u) = 0. Hence l ∈ z(I, E)k (T ). On the other hand z(I, E) is also faithful to A by Proposition 5.35. The inclusion Z k (T ) ⊆ z(I, E)k (T ) then implies equality. ˆ k (T ) Example 5.40. Let A be a finite element system. Equip each X k with a continuous bilinear form a which is non-degenerate on A0 (T ) (e.g., ˆ k (T ) is continuously embedded in a Hilbert space). One can define a X mirror system by Z k (T ) = {a(·, v) : v ∈ Ak0 (T )}. When the FE system admits extensions, the associated interpolator can be interpreted as a recursive a-projection, starting from cells of minimal dimension, and continuing by incrementing dimension at each step, projecting with respect to a with given boundary conditions. Commuting interpolators. It is of interest to construct interpolators that commute with the exterior derivative. When T ⊆ T , restriction maps ˆ k (T ), so that a k-mirror Z k (T ) on T can also be considered ˆ k (T ) → X X as a k-mirror on T . If the mirror system is faithful it must be in direct sum with Z k (T ). Proposition 5.41. An interpolator commutes with the exterior derivative if and only if its mirror system satisfies ∀T ∈ T ∀l ∈ Z k (T )
l ◦ d ∈ Z k−1 (T˜).
(5.12)
ˆ k−1 (T ). Suppose first that Φk−1 u = 0. Then, Proof. (If ) Pick u ∈ X k ˜ for all l ∈ Z (T ), l(du) = 0, hence Φk (du) = 0. In the general case, since Φk−1 (u − Φk−1 u) = 0, we deduce Φk (du − dΦk−1 u) = 0, so that Φk du = dΦk−1 u. ˆ k−1 (T ) such (Only if ) Suppose l ∈ Z k (T ) and l ◦ d ∈ Z k−1 (T˜). Pick u ∈ X k−1 (T˜), l (u) = 0. Then I k du = 0 but that l(du) = 0, but for all l ∈ Z I k−1 u = 0 (so dI k−1 u = 0).
Topics in structure-preserving discretization
87
Example 5.42. The canonical mirror system of trimmed polynomials of order p yields a commuting interpolator. Suppose that Z is a mirror system on T such that (5.12) holds. Then we ˆ : l → l ◦ d from Z k (T ) to Z k−1 (T ). Denote by δ have a well-defined map d its adjoint, which maps from Z k−1 (T ) to Z k (T ) . Remark 5.43.
The following diagram commutes: ˆ k−1 (T ) X
Φk−1
Z k−1 (T ) Proof.
d
δ
/X ˆ k (T )
Φk
/ Z k (T )
ˆ k−1 (T ). We have Pick l ∈ Z k (T ) and u ∈ X ˆ = (Φu)(l ◦ d) = l(du) = (Φdu)(l). (δΦu)(l) = (Φu)(dl)
This concludes the proof. ˆ k (T ) with a continuous scalar product Proposition 5.44. Equip each X a. For any compatible finite element system A, the following is a faithful mirror system yielding a commuting interpolator. For k = dim T ,
Z k (T ) = {a(·, v) : v ∈ dAk−1 0 (T )} + {R ·}. For k < dim T , k Z k (T ) = {a(·, v) : v ∈ dAk−1 0 (T )} + {a(d·, v) : v ∈ dA0 (T )}.
This is the natural generalization, to the adopted setting, of projectionbased interpolation, as defined in Demkowicz and Babuˇska (2003) and Demkowicz and Buffa (2005). When the scalar products a are all the L2 -product on forms, we call it harmonic interpolation. Suppose U is a cellular complex on M and V is a cellular complex on N giving rise to the product complex U × V on M × N . If Z is a mirror system on U and Y is a mirror system on V, then Z ⊗ Y is a mirror system on U × V defined by Z l (U ) ⊗ Y(V )k−l . (Z ⊗ Y)k (U × V ) = l
Proposition 5.45. faithful.
The tensor product of two faithful mirror systems is
Proof. We have three FE systems, A, B and A ⊗ B, all admitting extensions. Moreover, by Proposition 5.19, Al0 (U ) ⊗ B0k−l (V ). (A ⊗ B)k0 (U × V ) = l
88
S. H. Christiansen, H. Z. Munthe-Kaas and B. Owren
Now apply Proposition 5.35. Extension–projection interpolators. It will also be of interest to construct extension operators which commute with the exterior derivative. More precisely, for a cell of dimension m a commuting extension operator is a family of operators E k : Ak (∂T ) → Ak (T ) for 0 ≤ k ≤ m − 1, together with a map E m : R → Am (T ) such that the following diagram commutes: 0
0
/R
/ A0 (∂T )
/R
/ ···
/ Am−1 (∂T )
/ ···
E0
/ A0 (T )
E m−1
/ Am−1 (T )
/R
/0
Em
/ Am (T )
/0
(5.13) has an element with non-zero integral an such that When the above diagram commutes, is uniquely determined by E m−1 and exists if and only if E m−1 sends elements with zero integral to closed forms. Am−1 (∂T )
Em
Proposition 5.46. Let A be a finite element system where each Ak (T ) is equipped with a scalar product a. Suppose T is a cell such that (5.4) is exact. Put m = dim T . If T admits extensions, the harmonic extension operators defined by Proposition 5.25 commute in the sense of diagram (5.13). We suppose that for each cell T , extension operators E : A• (∂T ) → A (T ) and projections P : X • (T ) → A• (T ) have been defined. Then E and P uniquely determine an interpolator J as follows. One constructs J inductively. The initialization on cells of dimension 0 (points) is trivial. Now let T be a cell and suppose that J has been constructed for all cells on ˆ k (T ) with k < dim T , its boundary. On T we define, for u ∈ X •
Ju = EJ∂u + (id −E∂)P u = P u + E(J∂u − ∂P u), and for k = dim T we simply put Ju = P u. The only thing to check is that J commutes with restriction from T to cells on the boundary, which is trivial. We call J the associated extension– projection (EP) interpolator. Let T be cell of dimension m. endomorphism F of X m (T )
We say that an m preserves integrals if F u = u for all u ∈ X (T ). An interpolator is said to preserve integrals if it preserves integrals on all cells. For an interpolator I, this is equivalent to commutation of the following diagram, involving
89
Topics in structure-preserving discretization
de Rham maps: / A• (T ) vv vv v vv ρ zv v
I
ˆ • (T ) X
II II II ρ III $
C • (T )
Furthermore, we would like the interpolator to commute with the exterior derivative. Proposition 5.47. Suppose that the projectors P : X • (T ) → A• (T ) commute with the exterior derivative, that the extensions E commute in the sense of diagram (5.13) and that P preserves integrals. Then the associated EP interpolator commutes with the exterior derivative and preserves integrals. Proof. We use induction on the dimension of cells. Let T be a cell of dimension m. ˆ k (T ) with k ≤ m − 2, the commutation dJu = Jdu follows If u ∈ X immediately from the commutation of P , E and ∂, as well as J on ∂T (which follows from the induction hypothesis). ˆ m−1 (T ) we have For u ∈ X dJu = dP u + dE(J∂u − ∂P u). But we have
(J∂u − ∂P u) =
∂T
∂T
∂u −
∂T
∂u −
dP u = T
∂u −
=
∂T
P du, T
du = 0. T
The first thing we used is that J preserves integrals on the boundary (which is an induction hypothesis). Hence, by (5.13), dE(J∂u − ∂P u) = 0. Thus dJu = dP u = P du = Jdu. That J preserves integrals simply from the fact that, for
on T follows
u ∈ X m (T ), we have Ju = P u = u. Compared with the use of mirror systems, the advantage of defining an interpolator from extensions and projections is that approximation properties of the interpolator follow directly from estimates on the extensions and projections. In the following we denote the Lq (U )-norm simply by · U .
90
S. H. Christiansen, H. Z. Munthe-Kaas and B. Owren
Proposition 5.48. Let (Tn ) be a sequence of cellular complexes, each ˜ k (T ) equipped with a compatible FE system. Suppose that for each T , X is equipped with a densely defined seminorm |·|T . We also suppose that we have functions λn : Tn → R∗+ and τn : Tn → R∗+ and extensions and projections satisfying u − Pn uT # τn (T )|u|T , u − Pn u∂T # τn (T )λn (T )−1 |u|T , En uT # λn (T )u∂T . We suppose that for T, T ∈ Tn , if T ⊆ T then λn (T ) λn (T ) and τn (T ) τn (T ). Then the associated EP interpolator satisfies λn (T )dim T −dim T |u|T , u − In uT # τn (T ) T ⊆T
where we sum over subcells T of T in Tn . We shall express this bound as order optimality. Proof. We use induction. Suppose T is a cell and that In is order-optimal ˆ k (T ) with k < dim T , we then have on its boundary. For u ∈ X u − In uT # u − Pn uT + λn (T )In ∂u − ∂Pn u∂T # u − Pn uT + λn (T )u − Pn u∂T + λn (T )u − In u∂T # τn (T )|u| + λn (T )u − In u∂T . This completes the proof. This proposition was designed with the p-version of the finite element method in mind. One can think of τn (T ) = p−1 and λn (T ) = p−1/q . The seminorms involved would correspond to Sobolev spaces, possibly weighted. Thus one would require extension operators whose Lq (∂T ) → Lq (T )-norm is of order p−1/q . The construction used to prove Proposition 3.3 in the preprint of Christiansen (2007) might be useful here. 5.3. Quasi-interpolators Let S be a domain in Rd . Let (Tn ) be a sequence of cellular complexes on S, each equipped with a compatible FE system A[n]. We define Xnk = A[n]k (Tn ). Definition 5.49.
Consider a sequence of maps Qkn : Lq (S) → Xnk .
• We say that they are stable if, for u ∈ Lq (S), Qkn uLq (S) # uLq (S) .
Topics in structure-preserving discretization
91
• We say that they are order-optimal if, for u ∈ W,q (S), u − Qkn uLq (S) # τn uW,q (S) , where τn is the order of best approximation on Xnk in the W,q (S) → Lq (S)-norm. • We say that they are quasi-projections if, for some α < 1, we have for all u ∈ Xnk u − Qkn uLq (S) ≤ αuLq (S) . • We say that they commute if they commute with the exterior derivative. We shall construct stable quasi-interpolators of the form Q = IRE, where I is an interpolator, R is a regularization (smoother) approximating the identity and E is an extension operator (usually R requires values outside S). The following technique will be referred to as scaling. Lemma 5.50. For a cell T of diameter hT and barycentre bT , consider the scaling map σT : x → hT x + bT and let Tˆ be the pre-image of T by σT , called the reference cell. Let m be the dimension of T (0 ≤ m ≤ d). Let u be a k-multilinear form on T and let u ˆ = σT u be the pullback of u to Tˆ. Then we have −k+m/q
uLq (T ) = hT
ˆ uLq (Tˆ) .
We adopt the h-setting, in that the differential elements A[n]k (T ), when pulled back to reference domains Tˆ, belong to compact families: see Arnold et al. (2006b, Remark p. 64). This hypothesis excludes, for instance, methods where the polynomial degree is unbounded as n → ∞, and normally requires the cells to be shape-regular. Proposition 5.51. Suppose the finite elements A[n]k (T ) contain polynomials of degree − 1. A sequence of commuting interpolators In can be constructed to satisfy +(dim T −dim T )/q hT ∇ uLq (T ) , (5.14) u − In uLq (T ) # T ⊆T
where we sum over subcells T of T in Tn . We shall express this bound as order optimality.
92
S. H. Christiansen, H. Z. Munthe-Kaas and B. Owren
Proof. Choose commuting interpolators In , which when pulled back to the reference cell satisfy ∇ uLq (Tˆ ) . u − Iˆn uLq (Tˆ) # T ⊆T
Estimate (5.14) follows by scaling. Such interpolators can be constructed from mirror systems (e.g., harmonic interpolation), or from extensions and projections as in Proposition 5.48. Regularizer. We consider regularizing operators constructed as follows. We require a function ψ supported in the unit ball Bd and a function Φ:
Bd × Rd → Rd , (y, x) → Φy (x).
For any given y we denote by Φy the pullback by Φy : Rd → Rd . That is, for any k-multilinear form u, (Φy u)[x](ξ1 , . . . , ξk ) = u[Φy (x)](Dx Φy (x)ξ1 , . . . , Dx Φy (x)ξk ). We define
Ru = Bd
ψ(y)Φy u dy.
(5.15)
For the function ψ we choose one which is smooth, rotationally invariant, non-negative, with support in the unit ball and with integral 1. Later on, we will require convolution by ψ to preserve polynomials up to a certain degree (see (5.24)), but until then this hypothesis will be irrelevant. In what follows, when we integrate with respect to the variable y it will always be on the unit ball Bd , so we omit this from expressions such as (5.15). Given such a ψ we are interested in how properties of Φ reflect upon R. For this purpose we call R defined by (5.15) the regularizer associated with Φ. To emphasize its dependence on Φ we sometimes denote the regularizer by R[Φ]. Formally, R[Φ] will commute with the exterior derivative, since pullbacks do. The minimal regularity we assume of Φ is to have continuous second derivatives. We also suppose that, for given x, y → Φy (x) is a diffeomorphism from Bd to its range. This is enough for the commutation to hold. In what follows we shall be a bit more careful about the regularizing effects of R[Φ] for given Φ. Let B(x, δ) denote the ball with centre x and radius δ. For any subset U of Rd , its δ-neighbourhood is defined by V δ (U ) = ∪{B(x, δ) : x ∈ U }. As a first result we state the following.
Topics in structure-preserving discretization
93
Proposition 5.52. For any δ > 0 and C > 0, there exists C > 0 such that, for all Φ satisfying, at a point x, for all y ∈ Bd , |Φy (x) − x| ≤ δ, and Dy Φy (x)−1 , Dx Φy (x) ≤ C, the associated regularizer satisfies (R[Φ]u)(x) ≤ C uL1 (V δ (x)) . Proof.
(5.16)
With x fixed, the Jacobian of the map Bd % y → Φy (x) ∈ V δ (x)
has an inverse bounded by C. We are interested in estimates on derivatives of R[Φ]u when u is a k-form. We have (5.17) (∇R[Φ]u)(x) = ψ(y)Dx (Φy u)[x] dy, where we can substitute the expression Dx Φy u[x](ξ0 , . . . , ξk )
(5.18)
= Du[Φy (x)](Dx Φy (x)ξ0 , . . . , Dx Φy (x)ξk ) + ki=1 u[Φy (x)](Dx Φy (x)ξ1 , . . . , D2xx Φy (x)(ξ0 , ξi ), . . . , Dx Φy (x)ξk ). The purpose of the following lemma is to get an integral expression for ∇R[Φ]u not involving any derivatives of u. Essentially, in (5.17), derivatives acting on u are transferred to other terms under the integral sign, using integration by parts. Without the integral sign, this corresponds to identifying the derivatives of u as a ‘total’ divergence, up to expressions involving no derivatives of u. Lemma 5.53.
We have
Dx Φy u[x](ξ0 , . . . , ξk ) = ki=1 u[Φy (x)](Dx Φy (x)ξ1 , . . . , D2xx Φy (x)(ξ0 , ξi ), . . . , Dx Φy (x)ξk ) − ki=1 u[Φy (x)](Dx Φy (x)ξ1 , . . . , D2yx Φy (x)(Ξy (x)ξ0 , ξi ), . . . , Dx Φy (x)ξk ) + Dy Φy u[x](Ξy (x)ξ0 , ξ1 , . . . , ξk ), with Ξy (x) defined by Ξy (x)ξ = Dy Φy (x)−1 Dx Φy (x)ξ.
94
S. H. Christiansen, H. Z. Munthe-Kaas and B. Owren
We also have ψ(y)Dy Φy u[x](Ξy (x)ξ0 , ξ1 , . . . , ξk ) = divy ψ(y)Ξy (x)ξ0 Φy u[x](ξ1 , . . . , ξk ) − divy ψ(y)Ξy (x) ξ0 Φy u[x](ξ1 , . . . , ξk ). The following proposition shows that the regularizer maps forms of L1 regularity to continuously differentiable forms, while being careful about the operator norm. Proposition 5.54. For any δ > 0 and C > 0, there exists C > 0 such that, for all Φ satisfying, at a point x, for all y ∈ Bd , |Φy (x) − x| ≤ δ, and
Dy Φy (x)−1 , Dx Φy (x), D2xx Φy (x)
!
D2yx Φy (x), Dy (Dy Φy (x)−1 )
≤ C,
the associated regularizer satisfies (∇R[Φ]u)(x) ≤ C uL1 (V δ (x)) .
(5.19)
Proof. The preceding lemma gives an expression for (∇R[Φ]u)(x), from which the claim follows. In the estimate (5.19) one has one order more of differentiation on the left-hand side. In the following proposition we consider an equal amount of differentiation on both sides. Proposition 5.55. Pick an integer ≥ 0, and δ > 0. For any C > 0, there exists C > 0 such that, for all Φ satisfying, at a point x, for all y ∈ Bd , |Φy (x) − x| ≤ δ, Dy Φy (x)
−1
≤ C,
(5.20) (5.21)
and Dx Φy (x), D2xx Φy (x), . . . , D+1 x...x Φy (x) ≤ C,
(5.22)
the associated regularizer satisfies (∇ R[Φ]u)(x) ≤ C uW,1 (V δ (x)) . Proof. For = 0 one uses the change of variable formula in the definition (5.15), the Jacobian being taken care of by estimate (5.21). The case = 1 follows from expression (5.18). Differentiating this expression several times gives the claimed result for general (an expression for the differential of order of a pullback will be given later).
Topics in structure-preserving discretization
95
From now on we suppose Φ has the form Φy (x) = x + φ(x)y,
(5.23)
for some function φ : S → R. Most of the discussion would work with matrix-valued maps φ : S → Rd×d , which could be important for anisotropic meshes. But for simplicity we do not consider anisotropic meshes here, and thus scalar φ are sufficient. We also assume that ψ satisfies ψ(y)f (y) dy = f (0), (5.24) for all polynomials f of degree at most p + d, for some integer p ≥ 0. The purpose of these hypotheses is to make the regularizer preserve polynomials of degree up to p. To see this, first note that property (5.24) guarantees that convolution by ψ preserves polynomials of degree p + d. We state the following. Proposition 5.56. Suppose |φ(x)| ≤ δ for some δ > 0. If u is also a polynomial of degree at most p on V δ (x), then ∇ Ru(x) = ∇ u(x) for all . Proof.
We have Dx Φy (x)ξ = ξ + (Dφ(x)ξ)y.
Suppose u is a k-form which is a polynomial of degree at most p. Recall that (Φy u)[x](ξ1 , . . . , ξk ) = u[Φy (x)](Dx Φy (x)ξ1 , . . . , Dx Φy (x)ξk ). As a function of y this is a polynomial of degree at most p + k ≤ p + d. Its value at y = 0 is u[x](ξ1 , . . . , ξk ). This gives the case = 0 of the proposition. For = 1 one uses expression (5.18). Greater are obtained by further differentiation of this expression. To see to what extent Propositions 5.52, 5.54 and 5.55 can be applied, we remark that Φy (x) − x = φ(x)y, Dy Φy (x)ξ = φ(x)ξ, Dy (Dy Φy (x)−1 ) = 0, Dx Φy (x)ξ = (Dφ(x)ξ)y, D2yx Φy (x)(ξ, ξ ) = (Dφ(x)ξ)ξ , Dx...x Φy (x)(ξ1 , . . . , ξ ) = D φ(x)(ξ1 , . . . , ξ ) y.
96
S. H. Christiansen, H. Z. Munthe-Kaas and B. Owren
Proposition 5.57. Pick ≤ p + 1. For any δ > 0 and any C > 0, there exists C > 0 such that, for all φ satisfying, at some point x, |φ(x)| ≤ δ, |φ(x)−1 | ≤ C, and Dx φ(x), D2xx φ(x), . . . , D+1 x...x φ(x) ≤ C, the associated regularizer satisfies (∇ Ru)(x) ≤ C ∇ uL1 (V δ (x)) . Proof. By the Deny–Lions lemma there exists C > 0 such that, for all u ∈ W,1 (V δ (x)), inf u − f W,1 (V δ (x)) # ∇ uL1 (V δ (x)) .
f ∈P−1
The regularizer R preserves the space P−1 of polynomials of degree up to − 1. Combining this with Proposition 5.55 gives the claimed result. The regularizer is adapted to the mesh Tn as follows. We choose φn such that, for all x ∈ T ∈ Tn , φn (x) hT , D
1+r
φn (x) #
h−r T ,
(5.25) for 0 ≤ r ≤ .
(5.26)
We introduce a parameter > 0 and consider the regularizations Rn = R[Φ] associated with the maps Φy (x) = x + φn (x)y. We define Vn (T ) = ∪{B(x, φn (x)) : x ∈ T }. We choose fixed but small. Proposition 5.58.
Fix > 0. For any T ∈ Tn we have an estimate
1+(d−dim T )/q ∇Rn uLq (T ) hT (d−dim T )/q ∇ Rn uLq (T ) hT
# uLq (Vn (T )) ,
(5.27)
# ∇ uLq (Vn (T )) .
(5.28)
For T of maximal dimension we also have u − Rn uLq (T ) # hT ∇ uLq (Vn (T )) .
(5.29)
Proof. Pick T ∈ Tn . Its diameter is hT and its barycentre bT . Consider the scaling map σT : x → hT x + bT and let Tˆ be the pre-image of T by σT , called the reference cell.
Topics in structure-preserving discretization
97
Note that, quite generally, the regularization R transforms as follows under pullback by a diffeomorphism σ: R[Φ] = (σ )−1 R[σ −1 ◦ Φ• ◦ σ]σ , where σ −1 ◦ Φ• ◦ σ : (y, x) → σ −1 (Φy (σ(x))). In our case the operator Rn [σT−1 ◦ Φ• ◦ σT ] is regularizing on the reference ˆ n . We have cell Tˆ and we denote it by R (σT−1 ◦ Φy ◦ σT )(x) = x + h−1 T φn (hT x + bT )y. The conditions (5.25), (5.26) put us in a position to conclude from Propositions 5.54 and 5.55 that ˆ n u ∞ ˆ # u 1 −1 ∇R L (σ V (T )) , L (T ) n
T
ˆ n u ∞ ˆ # ∇ u 1 −1 ∇ R L (σ V (T )) . L (T ) n
T
From this we deduce ˆ u q ˆ # u q −1 ∇R n L (σ V (T )) , L (T ) T
n
ˆ n u q ˆ # ∇ u q −1 ∇ R L (σ V (T )) . L (T )
T
n
Then the estimates (5.27) and (5.28) follow from scaling. Let T ∈ Tn have dimension d. From Proposition 5.52, we get ˆ Ru Lq (Tˆ) # uLq (σ −1 V (T )) . T
n
Preservation of polynomials and the Deny–Lions lemma then gives ˆ u − Ru Lq (Tˆ) # ∇ uLq (σ −1 V (T )) . T
n
Scaling then gives (5.29). For a cell T ∈ T we denote by Mn (T ) the macro-element surrounding T in Tn , that is, the union of the cells T ∈ Tn touching T : Mn (T ) = ∪{T ∈ Tn : T ∩ T = ∅}. Choose so small that, for all n and all T ∈ Tn , Vn (T ) ∩ S ⊆ Mn (T ). Proposition 5.59.
For u defined on Vn (S) we have estimates In Rn uLq (S) # uLq (Vn (S)
and, for ≤ p + 1, u − In Rn uLq (S) # hn uLq (Vn (S) .
98
S. H. Christiansen, H. Z. Munthe-Kaas and B. Owren
Extension. We shall define extension operators which extend differential forms on S to some neighbourhood of S, preserve polynomials up to a certain degree p, commute with the exterior derivative and are continuous in W,q -norms for ≤ p + 1. For this purpose we will use maps Φs depending on a parameter s, defined outside S with values in S, and pull back by these maps. By taking judiciously chosen linear combinations of such pullbacks we meet the requirements of continuity and polynomial preservation. First we derive some formulas for the derivative of order of the pullback of a differential form. Antisymmetry in the variables will not be important for these considerations, so we consider multilinear rather than differential forms. Consider then a smooth map Φ : Rd → Rd and u, a k-multilinear form on Rd , with k ≥ 1. We want to give an expression for (∇ Φ u)[x](ξ1 , . . . , ξk+ ), as a linear combination of terms of the form (∇r u)[Φ(x)] Dm1 Φ(x)(ζ1 , . . . , ζm1 ), Dm2 Φ(x)(ζm1 +1 , . . . , ζm1 +m2 ), . . . , (5.30) where m1 + · · · + mk+r = k + and (ζ1 , . . . , ζk+ ) = (ξσ(1) , . . . , ξσ(k+) ), for any permutation σ of the indexes {1, . . . , k + }. To handle the combinatorics behind this problem, we let D be the set of pairs (σ, m) where m = (m1 , . . . , mv(m) ) is a multi-index of valence v(m) ≥ 1 and weight w(m) = m1 +· · ·+mv(p) , such that mi ≥ 1 for each 1 ≤ i ≤ v(m), and σ is a permutation of the indexes (1, . . . , w(m)). We define the partial weights |m|0 = 0 and |m|i = m1 + · · · + mi for 1 ≤ i ≤ v(m). We define (σ, m)◦ [Φ, x](ξ1 , . . . , ξw(m) ) to be the v(m)-multivector: v(m)
⊗i=1 Dmi Φ(x)(ζ|m|i−1 +1 , . . . , ζ|m|i ), with (ζ1 , . . . , ζw(m) ) = (ξσ(1) , . . . , ξσ(w(m)) ). Thus (σ, m)◦ [Φ, x] ∈ L(⊗w(m) Rd , ⊗v(m) Rd ).
(5.31)
Let D be the free group generated by D. We define some operations in D, which correspond to differentiating (5.31) with respect to x. For a given (σ, m) we define, for j = 1, . . . , v(m), ∂j (σ, m) to consist of
99
Topics in structure-preserving discretization
the multi-index (m1 , . . . , mj + 1, . . . , mv(m) ) and the permutation σ(i) σ(i) + 1
1 ≤ i ≤ w(m) →
if σ(i) ≤ |m|j , if σ(i) > |m|j ,
w(m) + 1 → |m|j + 1. Defining
v(m)
D(σ, m) =
∂j (σ, m),
j=1
we have
D((σ, m)◦ [Φ, x]) = (D(σ, m))◦ [Φ, x].
On the left, D is ordinary differentiation with respect to x, and on the right, D is an operation in D. If u is a k-multilinear form and ζ = ζ1 ⊗ . . . ⊗ ζk ∈ ⊗k Rd , we define the contraction u : ζ = u(ζ1 , . . . , ζk ). Contraction is bilinear. Given a k-multilinear form u, we want to differentiate, with respect to x, expressions of the form (∇r u)[Φ(x)] : (σ, m)◦ [Φ, x], where v(m) = k+r. This corresponds to (5.30). Since contraction is bilinear and we know how to differentiate the right-hand side, it remains to differentiate the left-hand side. For this purpose we introduce one more operation in D. Define e such that e(σ, m) consists of the multi-index (m1 , . . . , mv(m) , 1) and the permutation 1 ≤ i ≤ w(m) → σ(i), w(m) + 1 → w(m) + 1. Then we have ∇ (∇r u)[Φ(x)] : (σ, m)◦ [Φ, x] = (∇
r+1
(5.32) ◦
r
◦
u)[Φ(x)] : (e(σ, m)) [Φ, x] + (∇ u)[Φ(x)] : (D(σ, m)) [Φ, x].
In the free group D we now define Γr [k] for ≥ 0 and 0 ≤ r ≤ recursively. We initialize by Γ00 [k] = (id, (1, . . . , 1)), with the identity permutation and k terms in the multi-index. Then we define for ≥ 0 Γ+1 0 [k] = eΓ0 [k], Γ+1 i [k] = eΓi [k] + DΓi−1 [k], for 1 ≤ i ≤ , Γ+1 +1 [k] = DΓ [k].
100
S. H. Christiansen, H. Z. Munthe-Kaas and B. Owren
We check that Γ0 [k] = Γ00 [k + ], Γ [k] = D Γ00 [k]. Proposition 5.60.
We have, for a given k-form u,
∇ (Φ u)[x] =
(∇−i u)[Φ(x)] : Γi [k]◦ [Φ, x].
i=0
The expression k + . Proof.
Γi [k]
∈ D is a sum of terms with valence k + − i and weight
We use induction on , using (5.32).
For x outside S, let δ(x) denote the distance from x to S. Given a polynomial degree p, we will construct an extension operator E as a linear combination of pullbacks: ψs Φs , with Φs : V (S) \ S → S, E= s∈I
subject to the following conditions. • The index set I is a finite subset of the interval [2, 3] and the coefficients (ψs )s∈I are chosen such that, for any polynomial f of degree at most p + d, ψs f (s) = f (0). s∈I
• There is a function φ : V (S) \ S → Rd such that, for all s and x, Φs (x) = x + sφ(x),
(5.33)
and, moreover, φ(x) δ(x), D1+r φ(x) # δ(x)−r ,
for 0 ≤ r ≤ p.
• Finally, for s ∈ [2, 3] we should have DΦs (x)−1 # 1, and the Φs should determine diffeomorphisms from V (S) \ S for some > 0, to an interior neighbourhood of ∂S. In order to show that the above list of conditions can be met, we need some results of a general nature that are given in the Appendix. Proposition 5.61.
The conditions listed above can be met.
Topics in structure-preserving discretization
101
Proof. Let I consist of p + d + 1 points in the interval [2, 3]. Numbers ψs are then determined by solving a linear system with a Vandermonde matrix. If ∂S had been smooth, the orthogonal projection ℘ onto ∂S would be well-defined and smooth on a neighbourhood. Then we could have taken φ(x) = ℘(x) − x. In the following we modify this construction to allow for Lipschitz boundaries. Choose a smooth vector field ν according to Proposition A.3, pointing outwards on ∂S, so that for some > 0 the following map is a Lipschitz isomorphism onto its open range: g:
∂S×] − , [ (z, t)
→ Rd , → z + tν(z).
Define f on V (S) \ S by f (g(z, t)) = z − g(z, t) = −tν(z). The problem with f , to serve as φ in (5.33), is its lack of regularity. From Theorem 2 in Stein (1970, p. 171) we get a regularized distance function δ˜ defined outside S, such that ˜ δ(x) δ(x), and for all r ≥ 1 ˜ # δ(x)1−r . Dr δ(x) We regularize f by a variant of (5.15), (5.23). We put ˜ φ(x) = ψ(y)f (x − δ(x)y) dy, ˜ where the parameter is chosen to satisfy δ(x) ≤ 1/2δ(x), so that f is evaluated far enough from S. For an illustration we refer to Figure 5.1. The conditions are then met. In the following we choose an integer ≤ p. Proposition 5.62.
We have
∇ Eu = ∇ u[Φ2 (x)]
+
ψs (∇ u[Φs (x)] − ∇ u[Φ2 (x)]) : ⊗k+ (id +sDφ(x))
s
+
(5.34a)
1
ψs 0
s i=1
∇ u[tΦs (x) + (1 − t)Φ2 (x)] :
⊗i (s − 2)φ(x) ⊗ Γi [k]◦ [Φs , x]
(1 − t)i−1 dt. (i − 1)!
(5.34b) (5.34c)
(5.34d)
102
S. H. Christiansen, H. Z. Munthe-Kaas and B. Owren
n ν Φ2 (x) Φ3 (x)
x s=0
s=1
n
s=2 s=3 S
Figure 5.1. Definition of Φs (x), without smoothing.
Proof.
We have ∇
(Φs u)[x]
= (∇−i u)[Φs (x)] : Γi [k]◦ [Φs , x].
(5.35)
i=0
Concerning Γi [k]◦ [Φs , x], note that DΦs (x) = id +sDφ(x), Dr Φs (x) = sDr φ(x) for r ≥ 2. Therefore Γi [k]◦ [Φs , x] is a polynomial in s of degree at most k + − i. For i = 0 the value in s = 0 is Γ0 [k]◦ [Φs , x]|s=0 = ⊗k+ (id +sDφ(x))|s=0 = ⊗k+ id. For i ≥ 1 we have a sum of terms that are products where at least one derivative of order at least two appears, so the value at s = 0 is 0. In (5.35) the i = 0 term gives rise to ψs ∇ u[Φs (x)] : Γ0 [k]◦ [Φs , x] = ∇ u[Φ2 (x)] s
+
ψs (∇ u[Φs (x)] − ∇ u[Φ2 (x)]) : ⊗k+ (id +sDφ(x)).
s
This corresponds to (5.34a,b).
103
Topics in structure-preserving discretization
For i ≥ 1, Taylor’s formula with integral remainder gives i−1
(∇−i u)[Φs (x)] =
∇−i+j u[Φ2 (x)] : ⊗j (s − 2)φ(x)
j=0
1
+ 0
1 j!
∇ u[tΦs (x) + (1 − t)Φ2 (x)] : ⊗i (s − 2)φ(x)
(5.36)
(1 − t)i−1 dt. (i − 1)!
When this expression is contracted with Γi [k]◦ [Φs , x], the sum (5.36) consists of polynomials in s with degree j + k + − i ≤ + d, with value 0 at s = 0. Therefore ψs (∇−i u)[Φs (x)] : Γi [k]◦ [Φs , x] s
=
1
ψs 0
s
∇ u[tΦs (x) + (1 − t)Φ2 (x)] :
⊗i (s − 2)φ(x) ⊗ Γi [k]◦ [Φs , x]
(1 − t)i−1 dt. (i − 1)!
Summing over 1 ≤ i ≤ , this corresponds to (5.34c,d). From this formula several conclusions can be drawn. Proposition 5.63. • If u is of class C (S), Eu is of class C (V (S)). • If u is a polynomial of degree at most p, Eu is too. More precisely, if T is a cell touching S, and u is a polynomial on its macro-element, of degree at most p, then Eu is a polynomial of degree at most p on V (T ). • E is bounded W,q (S) → W,q (V (S)). For cells T ∈ Tn touching ∂S, ∇ EuLq (Vn (T )) # ∇ uLq (Mn (T )) . Proof.
For (σ, m) ∈ D, (σ, m)◦ [Φs , x] # δ(x)v(m)−w(m) ,
from which it follows that Γi [k]◦ [Φs , x] # δ(x)−i . This gives ⊗i φ(x) ⊗ Γi [k]◦ [Φs , x] # 1.
(5.37)
We now check continuity properties on ∂S. Suppose x0 ∈ ∂S and x → x0 . Then we have ∇ u[Φs (x)] − ∇ u[Φ2 (x)] → 0,
104
S. H. Christiansen, H. Z. Munthe-Kaas and B. Owren
so that (5.34b) converges to 0. If the integrals (5.34c) had been evaluated at ∇ u[Φ2 (x)], their sum over s ∈ I would be 0. An argument similar to the above, combined with (5.37), then shows that (5.34c,d) also converges to 0. We are left with the term on (5.34a), which converges to ∇ u(x0 ). Boundedness properties of E follow from (5.37) and the assumption that the Φs determine diffeomorphisms with uniformly bounded Jacobian determinants. Quasi-interpolator. Putting together the pieces, we get the following. Theorem 5.64. For any > 0, the operators Q n = In Rn E satisfy local estimates, for T ∈ Tnd , Q n uLq (T ) # uLq (Mn (T )) , u − Q n uLq (T ) # hT ∇ uLq (Mn (T )) , as the corresponding global ones: Q n uLq (S) # uLq (S) , u − Q n uLq (S) # h ∇ uLq (S) . Moreover, for any , choosing small enough will yield, for u ∈ Xnk , u − Q n uLq (T ) ≤ uLq (Mn (T )) , u − Q n uLq (S) # uLq (S) . Finally, Q n commutes with the exterior derivative (when it is in Lq (S)). When is chosen so small that (id −Q n )|Xnk Lq (S)→Lq (S) ≤ 1/2, Q n |Xnk is invertible with norm less than 2. We define operators: Pn = (Q n |Xnk )−1 Q n . Proposition 5.65. The operators Pn are Lq (S)-stable projections onto Xnk which commute with the exterior derivative. The case q = 2 leads to eigenvalue convergence for the operator d d discretized by the Galerkin method on Xnk and therefore for the Hodge– Laplacian in mixed form. For a discussion of eigenvalue convergence we refer to Boffi (2010), Arnold et al. (2010) and Christiansen and Winther (2010). 5.4. Sobolev injection and translation estimate In this subsection we prove a Sobolev injection theorem generalizing the one we introduced in Christiansen and Scheid (2011). The proof technique is slightly different, and we generalize to differential forms in all dimensions. We also prove a translation estimate of the type introduced in Karlsen and
Topics in structure-preserving discretization
105
Karper (2010, Theorem A.1). Compared with that paper we get an optimal bound and a generalization to all known mixed finite elements in the hversion. Given a cellular complex T , we define the broken H1 -seminorm |·| by 2 |u|2 = ∇u2L2 (T ) + h−1 (5.38) T [u]T L2 (T ) . T ∈T d
T ∈T d−1
Given a simplex T ∈ T d−1 , [u]T denotes the jump of u across T . The scaling factor in front of the jump terms is chosen so that the two terms that are summed scale in the same way: see Lemma 5.50. We assume we have a sequence of cellular complexes (Tn ) and that each Tn is equipped with a compatible FE system A[n]. We also assume that they are of the type discussed in Section 5.3 so that those constructions apply. We define Xnk = A[n]k (Tn ). The broken seminorm (5.38) will be defined relative to one of the Tn and, since the particular Tn should be clear from the context, we omit dependence on Tn from our notation. In the L2 (S) case define X k = {u ∈ L2 (S) : du ∈ L2 (S)}, W k = {u ∈ X k : du = 0}, V k = {u ∈ X k : ∀w ∈ W k
u · w = 0}.
Define Wnk = {u ∈ Xnk : du = 0}, Vnk = {u ∈ Xnk : ∀w ∈ Wnk
u · w = 0}. k
Denote by H the L2 -orthogonal projection onto V , the completion of V k in L2 (S). This operator realizes a Hodge decomposition of u in the form u = (u − Hu) + Hu. The following well-known trick is also useful in the proof of eigenvalue convergence. Proposition 5.66.
We have, for u ∈ Vnk ,
u − HuL2 (S) ≤ Hu − Pn HuL2 (S) . Proof.
We have u − Pn Hu = Pn (u − Hu) ∈ Wnk .
Now write Hu − Pn Hu = (u − Pn Hu) − (u − Hu), and note that the two terms on the left-hand side are orthogonal.
106
S. H. Christiansen, H. Z. Munthe-Kaas and B. Owren
Proposition 5.67.
For u ∈ Xnk , |u| ∇Rn EuL2 (S) ,
u − Proof.
Rn EuL2 (S)
# h|u|.
(5.39) (5.40)
The parameter is chosen so small that, for all u ∈ Xnk , |u − Rn Eu| ≤ 1/2|u|.
Then we have |u| ≤ 2|Rn Eu|, |Rn Eu| ≤ 3/2|u|. Since Rn Eu is smooth, we have |Rn Eu| = ∇Rn EuL2 (S) . This gives (5.39). The other estimate is proved locally by scaling from a reference macroelement. Proposition 5.68.
For u ∈ H1 (S), |Pn u| # ∇uL2 (S) .
Proof.
By restriction to reference simplexes and scaling, |Qn u| # ∇uL2 (S) .
Choosing small enough, we also have, for u ∈ Xnk , |u − Qn u| ≤ 1/2|u|. Combining the two, we get the proposition. Proposition 5.69. Suppose S is convex and that the meshes are quasiuniform. Then, for all u ∈ Vnk , |u| # duL2 (S) . Proof.
We have, for u ∈ Vnk , |u| = |Pn u| ≤ |Pn (u − Hu)| + |Pn Hu| ≤ h−1 Pn (u − Hu)L2 + ∇HuL2 # h−1 u − HuL2 + ∇HuL2 # ∇HuL2 .
From this (5.41) follows.
(5.41)
107
Topics in structure-preserving discretization
Proposition 5.70. Let q be the relevant Sobolev exponent, so that H1 (S) is contained in Lq (S). For all u ∈ Xnk , uLq (S) # |u| + uL2 (S) . Proof.
We have uLq (S) # Rn EuLq (S) # ∇Rn EuL2 (S) + Rn EuL2 (S) # |u| + uL2 (S) ,
as claimed. Denote by τy the translation by the vector y, so that when u is defined in x − y we have (τy u)(x) = u(x − y). Proposition 5.71.
For all u ∈ Xnk ,
u − τy EuL2 (S) # (|y| + h1/2 |y|1/2 )|u|. On a reference simplex Tˆ we can write for u ∈ Xnk pulled back: ˆ u − τyˆu ˆ2L2 (Tˆ) # |ˆ y |2 ∇ˆ u2L2 (T ) + |ˆ y| [ˆ u]T 2L2 (T ) .
Proof.
T ∈Mn (Tˆ)d
Scaling back to T of size h, we get, with y = hˆ y, u − τy u2L2 (T ) # |y|2 ∇u2L2 (T ) + |y| T ∈Mn (T )d
T ∈Mn (Tˆ)d−1
[u]T 2L2 (T ) ,
T ∈Mn (T )d−1
so that u − τy u2L2 (T ) # (|y|2 + h|y|)|u|2Mn (T ) . This estimate comes with a restriction of the type |y| ≤ h/C, ensuring that one does not translate T out of its associated macro-element. For |y| ≥ h/C we can write u − τy Eu = (u − Rn Eu) + (Rn Eu − τy ERn Eu) + τy E(Rn Eu − u). From this we deduce u − τy EuL2 # u − Rn EuL2 + Rn Eu − τy ERn EuL2 # h|u| + |y|∇Rn EuL2 # |y| |u|. This concludes the proof.
108
S. H. Christiansen, H. Z. Munthe-Kaas and B. Owren
Acknowledgements First author. On finite elements, I have benefited from the insights of, in particular, Annalisa Buffa, Jean-Claude N´ed´elec and Ragnar Winther. On algebraic topology I am grateful for the help of John Rognes and Bjørn Jahren, particularly with Propositions 5.16 and 5.21. I am also grateful to Martin Costabel for a helpful introduction to Stein’s construction of universal extension operators. Example 5.30 is from a discussion with Thomas Dubos (shallow water on the sphere) in June 2009. Trygve Karper’s remarks on upwinding were also helpful. Second author. I would, in particular, like to thank Brett Ryland for his important contribution to the development of the theory of generalized Chebyshev polynomials and also for doing a major part of the computer implementations. Furthermore, I thank Morten Nome for his efforts in realizing the spectral element implementations. I am also grateful to Daan Huybrechs for important contributions to the understanding of generalized symmetries and Chebyshev polynomials of ‘other kinds’. Finally, thanks to Krister ˚ Ahlander for his contributions to developing both the theory and the computer codes for numerical treatment of equivariance. Third author. Morten Dahlby and Takaharu Yaguchi have contributed substantially to the section on integral-preserving methods. Elena Celledoni has proofread parts of this paper and made numerous suggestions for improvement. This work, conducted as part of the award ‘Numerical Analysis and Simulations of Geometric Wave Equations’, made under the European Heads of Research Councils and European Science Foundation EURYI (European Young Investigator) Awards scheme, was supported by funds from the Participating Organizations of EURYI and the EC Sixth Framework Program. The work is also supported by the Norwegian Research Council through the project ‘Structure Preserving Algorithms for Differential Equations: Applications, Computation and Education’ (SpadeACE).
Appendix Lemma A.1. In a Banach space E, let U be an open set and let f : U → E be a contraction mapping, i.e., for some δ < 1, f (x) − f (y) ≤ δx − y.
(A.1)
Then the map g : U → E, x → x+f (x) has an open range V and determines a Lipschitz bijection U → V , with a Lipschitz inverse. Proof. Suppose that g(x0 ) = y0 . For y − y0 ≤ find the solution x of g(x) = y as a fixed point of the map z → y − f (z). More precisely, construct
Topics in structure-preserving discretization
109
a sequence starting at x0 and defined by xn+1 = y − f (xn ). Then, as long as it is defined (in U ), we have xn+1 − xn ≤ δxn − xn−1 ≤ δ n−1 . If is chosen so small that the closed ball with centre x0 and radius (1−δ)−1 is included in U , the sequence is defined for all n, and converges to a limit x ∈ U solving g(x) = y. It follows that g is an open mapping. In particular, the range V is open. Moreover, g(x) − g(y) ≥ (1 − δ)x − y. This gives injectivity, so that g : U → V is bijective. The inverse is Lipschitz with constant no worse than (1 − δ)−1 . Lemma A.2. In some Euclidean space E, let S be a bounded domain whose boundary ∂S is locally the graph of a Lipschitz function. Let n be the outward-pointing normal on ∂S. Suppose m is a unit vector, that x0 ∈ ∂S, and that for x in a neighbourhood of x0 in ∂S we have n(x) · m ≥ , for some > 0. Then there is a neighbourhood of x0 in ∂S which is a Lipschitz graph above the plane orthogonal to m. Proof. We know that for a certain outward-pointing unit vector m0 , a neighbourhood U0 of x0 is a Lipschitz graph above an open ball B0 in m⊥ 0. Choose θ ∈ [0, π/2[ such that, for x ∈ U0 , n(x) · m0 ≥ cos θ, and moreover ≥ cos θ. Let f : B0 → R be the function such that U1 is the range of B0 y
→ E, → y + f (y)m0 .
Since, for y ∈ B0 , n(y + f (y)m0 ) = (m0 − grad f (y))/(1 + | grad f (y)|2 )1/2 , we get | grad f (x)| ≤ tan θ. Choose y, y ∈ B0 and put x = y + f (y)m0 and x = y + f (y )m0 . For s, s ∈ R we have |(x + sm0 ) − (x + s m0 )|2 = |y − y |2 + (f (y) − f (y ))2 + 2(f (y) − f (y ))(s − s ) + (s − s )2 .
110
S. H. Christiansen, H. Z. Munthe-Kaas and B. Owren
Then note that, for M > 0, 2(f (y) − f (y ))(s − s ) ≤ (1 + M −2 )(f (y) − f (y ))2 + (1 + M −2 )−1 (s − s )2 ≤ (f (y) − f (y ))2 + M −2 tan2 θ|y − y |2 + (1 + M −2 )−1 (s − s )2 . In particular, with M = tan θ we get |(x + sm0 ) − (x + s m0 )|2 ≥ (1 − (1 + tan−2 θ)−1 )(s − s )2 , which simplifies to |(x + sm0 ) − (x + s m0 )| ≥ cos θ|s − s |. Define the function g0 :
U0 × R → E, x → y + sm0 .
(A.2)
Its range is B0 + Rm0 , and it is bijective onto it. Consider now a unit vector m1 such that n(x) · m1 ≥ cos θ for x ∈ U0 . Define g1 as in (A.2), replacing m0 by m1 . We shall show that g1 is open and bi-Lipschitz, when |m1 − m0 | < cos θ. Define f1 on B0 + Rm0 , by f1 (x) = g1 ◦ g0−1 − x. With the preceding notation, we have f1 (x + sm0 ) − f1 (x + s m0 ) = (s − s )(m1 − m0 ), and hence |f1 (x + sm0 ) − f1 (x + s m0 )| ≤ |m1 − m0 |/ cos θ|(x + sm0 ) − (x + s m0 )|. We then apply Lemma A.1 and deduce that g1 is open and bi-Lipschitz. It follows that there is a ball B1 in m⊥ 1 above which a neighbourhood U1 ⊆ U0 of x0 is a graph. We may repeat the above considerations to construct a sequence of such vectors m1 , m2 , . . . , mk reaching m in a finite number of steps. Proposition A.3. In some Euclidean space E, let S be a bounded domain whose boundary ∂S is locally the graph of a Lipschitz function. Then there exists a smooth vector field ν on E, of unit length and outward-pointing on ∂S, such that, for some > 0, the map ∂S×] − , [ (x, s)
→ E, → x + sν(x)
has open range and determines a Lipschitz isomorphism onto it.
(A.3)
Topics in structure-preserving discretization
111
Proof. Cover ∂S with a finite number of orthogonal cylinders Ci directed along a unit vector ni pointing out of S, and with a base Ui , such that above Ui , ∂S is the graph of a Lipschitz function. Let n denote the outwardpointing normal on ∂S. For some θ ∈ [0, π/2[, we have for all i and all x ∈ ∂S ∩ Ci ni · n(x) ≥ cos(θ). (A.4) Choose smooth functions αi on E whose restrictions to ∂S form a partition of unity. Define αi (x)ni , ν˜(x) = i
and normalize by putting ν(x) = ν˜(x)/|ν(x)|. We have ν(x) · n(x) ≥ cos(θ), for all x ∈ ∂S. Denote by g the function g:
∂S × R → E, (x, s) → x + sν(x).
Pick x0 ∈ ∂S and put m0 = ν(x0 ). By Lemma A.2, ∂S is locally a Lipschitz graph above the plane orthogonal to m0 . Let U (x0 ) be the corresponding neighbourhood of x0 in ∂S. Denote by g0 the function g0 :
∂S ∩ U (x0 ) × R (x, s)
→ E, → x + sm0 .
It is a Lipschitz isomorphism onto its range, which is open in E. Define f by f (x) = g ◦ g0−1 (x) − x. We have f (x + sm0 ) = s(ν(x) − m0 ), so that f (x + sm0 ) − f (y + tm0 ) = (s − t)(ν(x) − m0 ) + t(ν(x) − ν(y)). It follows that, for a small enough and possibly reducing U (x0 ), f is short on g0 (U (x0 )×] − , [). By Lemma A.1 it follows that g ◦ g0−1 restricted to g0 (U (x0 )×] − , [), for some small enough , called (x0 ), has open range and determines a Lipschitz isomorphism onto it. Hence g restricted to U (x0 )×] − (x0 ), (x0 )[ has open range and determines a Lipschitz isomorphism onto it. In particular, g is an open mapping. The open subsets U (x0 ) associated with each x0 ∈ ∂S cover ∂S. Choose a finite subset F of ∂S such that the sets U (x) for x ∈ F cover ∂S. Pick µ > 0 such that if |x − x | ≤ µ they belong to a common U (x) for x ∈ F. In (A.3), choose smaller than each (x) for x ∈ F, and also smaller than
112
S. H. Christiansen, H. Z. Munthe-Kaas and B. Owren
µ/3. Now pick two points x, x ∈ ∂S, and s, s in ] − , [. If |x − x | ≤ µ, they belong to a common U (x), x ∈ F. If, on the other hand, |x − x | ≥ µ, we have |g(x, s) − g(x , s )| ≥ |x − x | − |s| − |s |, ≥ µ/3. Based on these two cases we may conclude that, for some global m, |g(x, s) − g(x , s )| ≥ m(|x − x |2 + |s − s |2 ). The lemma follows.
REFERENCES11 K. ˚ Ahlander and H. Munthe-Kaas (2005), ‘Applications of the generalized Fourier transform in numerical linear algebra’, BIT 45, 819–850. E. L. Allgower, K. B¨ohmer, K. Georg and R. Miranda (1992), ‘Exploiting symmetry in boundary element methods’, SIAM J. Numer. Anal. 29, 534–552. E. L. Allgower, K. Georg and R. Miranda (1993), Exploiting permutation symmetry with fixed points in linear equations. In Lectures in Applied Mathematics (E. L. Allgower, K. Georg and R. Miranda, eds), Vol. 29, AMS, pp. 23–36. E. L. Allgower, K. Georg, R. Miranda and J. Tausch (1998), ‘Numerical exploitation of equivariance’, Z. Angew. Math. Mech. 78, 185–201. B. Andreianov, M. Bendahmane and K. H. Karlsen (2010), ‘Discrete duality finite volume schemes for doubly nonlinear degenerate hyperbolic–parabolic equations’, J. Hyperbolic Diff. Equations 7, 1–67. D. N. Arnold, P. B. Bochev, R. B. Lehoucq, R. A. Nicolaides and M. Shashkov, eds (2006a), Compatible Spatial Discretizations, Vol. 142 of The IMA Volumes in Mathematics and its Applications, Springer. D. N. Arnold, R. S. Falk and R. Winther (2006b), Finite element exterior calculus, homological techniques, and applications. In Acta Numerica, Vol. 15, Cambridge University Press, pp. 1–155. D. N. Arnold, R. S. Falk and R. Winther (2010), ‘Finite element exterior calculus: From Hodge theory to numerical stability’, Bull. Amer. Math. Soc. (NS) 47, 281–354. H. F. Baker (1905), ‘Alternants and continuous groups’, Proc. London Math. Soc. 3, 24–47. R. J. Beerends (1991), ‘Chebyshev polynomials in several variables and the radial part of the Laplace–Beltrami operator’, Trans. Amer. Math. Soc. 328, 779– 814. T. B. Benjamin (1972), ‘The stability of solitary waves’, Proc. Roy. Soc. London Ser. A 328, 153–183. 11
The URLs cited in this work were correct at the time of going to press, but the publisher and the authors make no undertaking that the citations remain live or are accurate or appropriate.
Topics in structure-preserving discretization
113
T. B. Benjamin, J. L. Bona and J. J. Mahony (1972), ‘Model equations for long waves in nonlinear dispersive systems’, Philos. Trans. Roy. Soc. London Ser. A 272, 47–78. S. Blanes and P. Moan (2006), ‘Fourth- and sixth-order commutator-free Magnus integrators for linear and non-linear dynamical systems’, Appl. Numer. Math. 56, 1519–1537. S. Blanes, F. Casas, J. A. Oteo and J. Ros (2009), ‘The Magnus expansion and some of its applications’, Phys. Rep. 470, 151–238. P. B. Bochev and J. M. Hyman (2006), Principles of mimetic discretizations of differential operators. In Compatible Spatial Discretizations, Vol. 142 of The IMA Volumes in Mathematics and its Applications, Springer, pp. 89–119. D. Boffi (2010), Finite element approximation of eigenvalue problems. In Acta Numerica, Vol. 19, Cambridge University Press, pp. 1–120. A. Bossavit (1986), ‘Symmetry, groups, and boundary value problems: A progressive introduction to noncommutative harmonic analysis of partial differential equations in domains with geometrical symmetry’, Comput. Methods Appl. Mech. Engrg 56, 167–215. A. Bossavit (1988), Mixed finite elements and the complex of Whitney forms. In The Mathematics of Finite Elements and Applications VI (Uxbridge 1987), Academic Press, pp. 137–144. F. Brezzi (1974), ‘On the existence, uniqueness and approximation of saddle-point problems arising from Lagrangian multipliers’, Rev. Fran¸caise Automat. Informat. Recherche Op´erationnelle S´er. Rouge 8, 129–151. F. Brezzi and M. Fortin (1991), Mixed and Hybrid Finite Element Methods, Vol. 15 of Springer Series in Computational Mathematics, Springer. F. Brezzi, J. Douglas, Jr. and L. D. Marini (1985), ‘Two families of mixed finite elements for second order elliptic problems’, Numer. Math. 47, 217–235. F. Brezzi, K. Lipnikov and M. Shashkov (2005), ‘Convergence of the mimetic finite difference method for diffusion problems on polyhedral meshes’, SIAM J. Numer. Anal. 43, 1872–1896. R. L. Bryant (1995), An introduction to Lie groups and symplectic geometry. In Geometry and Quantum Field Theory (D. S. Freed and K. K. Uhlenbeck, eds), Vol. 1 of IAS/Park City Mathematics Series, AMS. A. Buffa and S. H. Christiansen (2007), ‘A dual finite element complex on the barycentric refinement’, Math. Comp. 76, 1743–1769. D. Bump (2004), Lie Groups, Springer. C. Canuto, M. Hussaini, A. Quarteroni and T. Zang (2006), Spectral Methods: Fundamentals in Single Domains, Scientific Computation series, Springer. E. Celledoni (2005), Eulerian and semi-Lagrangian schemes based on commutatorfree exponential integrators. In Group Theory and Numerical Analysis, Vol. 39 of CRM Proc. Lecture Notes, AMS, pp. 77–90. E. Celledoni and A. Iserles (2000), ‘Approximating the exponential from a Lie algebra to a Lie group’, Math. Comp. 69, 1457–1480. E. Celledoni and A. Iserles (2001), ‘Methods for the approximation of the matrix exponential in a Lie-algebraic setting’, IMA J. Numer. Anal. 21, 463–488. E. Celledoni and B. K. Kometa (2009), ‘Semi-Lagrangian Runge–Kutta exponential integrators for convection dominated problems’, J. Sci. Comput. 41, 139–164.
114
S. H. Christiansen, H. Z. Munthe-Kaas and B. Owren
E. Celledoni, D. Cohen and B. Owren (2008), ‘Symmetric exponential integrators with an application to the cubic Schr¨ odinger equation’, Found. Comput. Math. 8, 303–317. E. Celledoni, A. Marthinsen and B. Owren (2003), ‘Commutator-free Lie group methods’, Future Generation Computer Systems 19, 341–352. J. Certaine (1960), The solution of ordinary differential equations with large time constants. In Mathematical Methods for Digital Computers, Wiley, pp. 128– 132. S. H. Christiansen (2007), ‘Stability of Hodge decompositions in finite element spaces of differential forms in arbitrary dimension’, Numer. Math. 107, 87– 106. S. H. Christiansen (2008a), ‘A construction of spaces of compatible differential forms on cellular complexes’, Math. Models Methods Appl. Sci. 18, 739–757. S. H. Christiansen (2008b), On the linearization of Regge calculus. E-print, Department of Mathematics, University of Oslo. S. H. Christiansen (2009), Foundations of finite element methods for wave equations of Maxwell type. In Applied Wave Mathematics, Springer, pp. 335–393. ´ ements finis mixtes minimaux sur les poly`edres’, CR S. H. Christiansen (2010), ‘El´ Math. Acad. Sci. Paris 348, 217–221. S. H. Christiansen and C. Scheid (2011), ‘Convergence of a constrained finite element discretization of the Maxwell Klein Gordon equation’, ESAIM: Math. Model. Numer. Anal. 45, 739–760. S. H. Christiansen and R. Winther (2006), ‘On constraint preservation in numerical simulations of Yang–Mills equations’, SIAM J. Sci. Comput. 28, 75–101. S. H. Christiansen and R. Winther (2008), ‘Smoothed projections in finite element exterior calculus’, Math. Comp. 77, 813–829. S. H. Christiansen and R. Winther (2010), On variational eigenvalue approximation of semidefinite operators. Preprint: arXiv.org/abs/1005.2059. P. G. Ciarlet (1978), The Finite Element Method for Elliptic Problems, Vol. 4 of Studies in Mathematics and its Applications, North-Holland. P. Cl´ement (1975), ‘Approximation by finite element functions using local regularization’, RAIRO Analyse Num´erique 9, 77–84. ¨ R. Courant, K. Friedrichs and H. Lewy (1928), ‘Uber die partiellen Differenzengleichungen der mathematischen Physik’, Math. Ann. 100, 32–74. S. M. Cox and P. C. Matthews (2002), ‘Exponential time differencing for stiff systems’, J. Comput. Phys. 176, 430–455. P. E. Crouch and R. Grossman (1993), ‘Numerical integration of ordinary differential equations on manifolds’, J. Nonlinear Sci. 3, 1–33. M. Dahlby and B. Owren (2010), A general framework for deriving integral preserving numerical methods for PDEs. Technical report 8/2010, Norwegian University of Science and Technology. arXiv.org/abs/1009.3151. M. Dahlby, B. Owren and T. Yaguchi (2010), Preserving multiple first integrals by discrete gradients. Technical report 11/2010, Norwegian University of Science and Technology. arXiv.org/abs/1011.0478. L. Demkowicz and I. Babuˇska (2003), ‘p interpolation error estimates for edge finite elements of variable order in two dimensions’, SIAM J. Numer. Anal. 41, 1195–1208.
Topics in structure-preserving discretization
115
L. Demkowicz and A. Buffa (2005), ‘H 1 , H(curl) and H(div)-conforming projection-based interpolation in three dimensions: Quasi-optimal p-interpolation estimates’, Comput. Methods Appl. Mech. Engrg 194, 267–296. L. Demkowicz, J. Kurtz, D. Pardo, M. Paszy´ nski, W. Rachowicz and A. Zdunek (2008), Computing with hp-adaptive Finite Elements, Vol. 2, Frontiers: Three Dimensional Elliptic and Maxwell Problems with Applications, Applied Mathematics and Nonlinear Science Series, Chapman & Hall/CRC. F. Diele, L. Lopez and R. Peluso (1998), ‘The Cayley transform in the numerical solution of unitary differential systems’, Adv. Comput. Math. 8, 317–334. J. Dodziuk and V. K. Patodi (1976), ‘Riemannian structures and triangulations of manifolds’, J. Indian Math. Soc. (NS) 40, 1–52. C. C. Douglas and J. Mandel (1992), ‘Abstract theory for the domain reduction method’, Computing 48, 73–96. J. Droniou, R. Eymard, T. Gallou¨et and R. Herbin (2010), ‘A unified approach to mimetic finite difference, hybrid finite volume and mixed finite volume methods’, Math. Models Methods Appl. Sci. 20, 265–295. M. Dubiner (1991), ‘Spectral methods on triangles and other domains’, J. Sci. Comput. 6, 345–390. R. Eier and R. Lidl (1982), ‘A class of orthogonal polynomials in k variables’, Math. Ann. 260, 93–99. A. F. F¨ assler and E. Stiefel (1992), Group Theoretical Methods and their Applications, Birkh¨ auser. D. Furihata (1999), ‘Finite difference schemes for ∂u/∂t = (∂/∂x)α δG/δu that inherit energy conservation or dissipation property’, J. Comput. Phys. 156, 181–205. D. Furihata (2001a), ‘Finite-difference schemes for nonlinear wave equation that inherit energy conservation property’, J. Comput. Appl. Math. 134, 37–57. D. Furihata (2001b), ‘A stable and conservative finite difference scheme for the Cahn–Hilliard equation’, Numer. Math. 87, 675–699. D. Furihata and T. Matsuo (2003), ‘A stable, convergent, conservative and linear finite difference scheme for the Cahn–Hilliard equation’, Japan J. Indust. Appl. Math. 20, 65–85. K. Georg and R. Miranda (1992), Exploiting symmetry in solving linear equations. In Bifurcation and Symmetry (E. L. Allgower, K. B¨ ohmer and M. Golubisky, eds), Vol. 104 of International Series of Numerical Mathematics, Birkh¨ auser, pp. 157–168. F. X. Giraldo and T. Warburton (2005), ‘A nodal triangle-based spectral element method for the shallow water equations on the sphere’, J. Comput. Phys. 207, 129–150. O. Gonzalez (1996), ‘Time integration and discrete Hamiltonian systems’, J. Nonlinear Sci. 6, 449–467. P. A. Griffiths and J. W. Morgan (1981), Rational Homotopy Theory and Differential Forms, Vol. 16 of Progress in Mathematics, Birkh¨ auser. E. Hairer, C. Lubich and G. Wanner (2006), Geometric Numerical Integration: Structure-Preserving Algorithms for Ordinary Differential Equations, second edition, Vol. 31 of Springer Series in Computational Mathematics, Springer.
116
S. H. Christiansen, H. Z. Munthe-Kaas and B. Owren
F. Hausdorff (1906), ‘Die symbolische Exponential Formel in der Gruppentheorie’, Leipziger Ber. 58, 19–48. J. S. Hesthaven (1998), ‘From electrostatics to almost optimal nodal sets for polynomial interpolation in a simplex’, SIAM J. Numer. Anal. 35, 655–676. S. Hilbert (1973), ‘A mollifier useful for approximations in Sobolev spaces and some applications to approximating solutions of differential equations’, Math. Comp. 27, 81–89. R. Hiptmair (1999), ‘Canonical construction of finite elements’, Math. Comp. 68, 1325–1346. R. Hiptmair (2002), Finite elements in computational electromagnetism. In Acta Numerica, Vol. 11, Cambridge University Press, pp. 237–339. M. Hochbruck and A. Ostermann (2005), ‘Explicit exponential Runge–Kutta methods for semilinear parabolic problems’, SIAM J. Numer. Anal. 43, 1069–1090. M. Hochbruck and A. Ostermann (2010), Exponential integrators. In Acta Numerica, Vol. 19, Cambridge University Press, pp. 209–286. M. E. Hoffman and W. D. Withers (1988), ‘Generalized Chebyshev polynomials associated with affine Weyl groups’, Trans. Amer. Math. Soc. 308, 91–104. D. Huybrechs (2010), ‘On the Fourier extension of non-periodic functions’, SIAM J. Numer. Anal. 47, 4326–4355. D. Huybrechs, A. Iserles and S. Nørsett (2010), ‘From high oscillation to rapid approximation V: The equilateral triangle’, IMA J. Numer. Anal. doi:10.1093/imanum/drq010. A. Iserles and S. P. Nørsett (1999), ‘On the solution of linear differential equations in Lie groups’, Philos. Trans. Roy. Soc. London Ser. A 357, 983–1019. A. Iserles and A. Zanna (2005), ‘Efficient computation of the matrix exponential by generalized polar decompositions’, SIAM J. Numer. Anal. 42, 2218–2256. A. Iserles, H. Munthe-Kaas, S. P. Nørsett and A. Zanna (2000), Lie-group methods. In Acta Numerica, Vol. 9, Cambridge University Press, pp. 215–365. G. James and M. Liebeck (2001), Representations and Characters of Groups, second edition, Cambridge University Press. F. Kang and Z.-J. Shang (1995), ‘Volume-preserving algorithms for source-free dynamical systems’, Numer. Math. 71, 451–463. K. H. Karlsen and T. K. Karper (2010), ‘Convergence of a mixed method for a semi-stationary compressible Stokes system’, Math. Comp. doi:10.1090/S0025-5718-2010-02446-9. C. A. Kennedy and M. H. Carpenter (2003), ‘Additive Runge–Kutta schemes for convection–diffusion–reaction equations’, Appl. Numer. Math. 44, 139–181. T. Koornwinder (1974), ‘Orthogonal polynomials in two variables which are eigenfunctions of two algebraically independent partial differential operators I–IV’, Indag. Math. 36, 48–66 and 357–381. S. Krogstad (2005), ‘Generalized integrating factor methods for stiff PDEs’, J. Comput. Phys. 203, 72–88. S. Krogstad, H. Munthe-Kaas and A. Zanna (2009), ‘Generalized polar coordinates on Lie groups and numerical integrators’, Numer. Math. 114, 161–187. Y. Kuznetsov and S. Repin (2005), ‘Convergence analysis and error estimates for mixed finite element method on distorted meshes’, J. Numer. Math. 13, 33– 51.
Topics in structure-preserving discretization
117
R. A. LaBudde and D. Greenspan (1974), ‘Discrete mechanics: A general treatment’, J. Comput. Phys. 15, 134–167. J. D. Lawson (1967), ‘Generalized Runge–Kutta processes for stable systems with large Lipschitz constants’, SIAM J. Numer. Anal. 4, 372–380. B. Leimkuhler and S. Reich (2004), Simulating Hamiltonian Dynamics, Vol. 14 of Cambridge Monographs on Applied and Computational Mathematics, Cambridge University Press. D. Lewis and J. C. Simo (1994), ‘Conserving algorithms for the dynamics of Hamiltonian systems on Lie groups’, J. Nonlinear Sci. 4, 253–299. R. Lidl (1975), ‘Tchebyscheffpolynome in mehreren Variablen’, J. Reine Angew. Math. 273, 178–198. J. S. Lomont (1959), Applications of Finite Groups, Academic Press. L. Lopez and T. Politi (2001), ‘Applications of the Cayley approach in the numerical solution of matrix differential systems on quadratic groups’, Appl. Numer. Math. 36, 35–55. A. Marthinsen and B. Owren (2001), ‘Quadrature methods based on the Cayley transform’, Appl. Numer. Math. 39, 403–413. T. Matsuo (2007), ‘New conservative schemes with discrete variational derivatives for nonlinear wave equations’, J. Comput. Appl. Math. 203, 32–56. T. Matsuo (2008), ‘Dissipative/conservative Galerkin method using discrete partial derivatives for nonlinear evolution equations’, J. Comput. Appl. Math. 218, 506–521. T. Matsuo and D. Furihata (2001), ‘Dissipative or conservative finite-difference schemes for complex-valued nonlinear partial differential equations’, J. Comput. Phys. 171, 425–447. T. Matsuo, M. Sugihara, D. Furihata and M. Mori (2000), ‘Linearly implicit finite difference schemes derived by the discrete variational method’, S¯ urikaisekikenky¯ usho K¯ oky¯ uroku 1145, 121–129. T. Matsuo, M. Sugihara, D. Furihata and M. Mori (2002), ‘Spatially accurate dissipative or conservative finite difference schemes derived by the discrete variational method’, Japan J. Indust. Appl. Math. 19, 311–330. R. I. McLachlan (1995), ‘On the numerical integration of ordinary differential equations by symmetric composition methods’, SIAM J. Sci. Comput. 16, 151– 168. R. I. McLachlan, G. R. W. Quispel and N. Robidoux (1999), ‘Geometric integration using discrete gradients’, Philos. Trans. Roy. Soc. London Ser. A 357, 1021– 1045. R. I. McLachlan, G. R. W. Quispel and P. S. P. Tse (2009), ‘Linearization-preserving self-adjoint and symplectic integrators’, BIT 49, 177–197. B. V. Minchev (2004), Exponential Integrators for Semilinear Problems, University of Bergen. PhD thesis, University of Bergen, Norway. Y. Minesaki and Y. Nakamura (2006), ‘New numerical integrator for the St¨ackel system conserving the same number of constants of motion as the degree of freedom’, J. Phys. A 39, 9453–9476. C. Moler and C. Van Loan (1978), ‘Nineteen dubious ways to compute the exponential of a matrix’, SIAM Review 20, 801–836.
118
S. H. Christiansen, H. Z. Munthe-Kaas and B. Owren
C. B. Moler and C. F. van Loan (2003), ‘Nineteen dubious ways to compute the exponential of a matrix, twenty-five years later’, SIAM Review 45, 3–49. P. Monk (2003), Finite Element Methods for Maxwell’s Equations, Numerical Mathematics and Scientific Computation, Oxford University Press. K. W. Morton (2010), ‘The convection–diffusion Petrov–Galerkin story’, IMA J. Numer. Anal. 30, 231–240. H. Munthe-Kaas (1989), Symmetric FFTs: A general approach. In Topics in Linear Algebra for Vector and Parallel Computers, PhD thesis, NTNU, Trondheim, Norway. Available at: hans.munthe-kaas.no. H. Munthe-Kaas (1999), ‘High order Runge–Kutta methods on manifolds’, Appl. Numer. Math. 29, 115–127. H. Munthe-Kaas (2006), ‘On group Fourier analysis and symmetry preserving discretizations of PDEs’, J. Phys. A 39, 5563. H. Z. Munthe-Kaas (1995), ‘Lie–Butcher theory for Runge–Kutta methods’, BIT 35, 572–587. H. Z. Munthe-Kaas (1998), ‘Runge–Kutta methods on Lie groups’, BIT 38, 92–111. H. Z. Munthe-Kaas and B. Owren (1999), ‘Computations in a free Lie algebra’, Philos. Trans. Roy. Soc. London Ser. A 357, 957–981. H. Z. Munthe-Kaas and A. Zanna (1997), Numerical integration of differential equations on homogeneous manifolds. In Foundations of Computational Mathematics (F. Cucker and M. Shub, eds), Springer, pp. 305–315. J.-C. N´ed´elec (1980), ‘Mixed finite elements in R3 ’, Numer. Math. 35, 315–341. S. P. Nørsett (1969), An A-stable modification of the Adams–Bashforth methods. In Conf. Numerical Solution of Differential Equations (Dundee 1969), Springer, pp. 214–219. P. J. Olver (1993), Applications of Lie Groups to Differential Equations, second edition, Vol. 107 of Graduate Texts in Mathematics, Springer. A. Ostermann, M. Thalhammer and W. M. Wright (2006), ‘A class of explicit exponential general linear methods’, BIT 46, 409–431. B. Owren (2006), ‘Order conditions for commutator-free Lie group methods’, J. Phys. A 39, 5585–5599. B. Owren and A. Marthinsen (1999), ‘Runge–Kutta methods adapted to manifolds and based on rigid frames’, BIT 39, 116–142. B. Owren and A. Marthinsen (2001), ‘Integration methods based on canonical coordinates of the second kind’, Numer. Math. 87, 763–790. J. E. Pasciak and P. S. Vassilevski (2008), ‘Exact de Rham sequences of spaces defined on macro-elements in two and three spatial dimensions’, SIAM J. Sci. Comput. 30, 2427–2446. P.-A. Raviart and J. M. Thomas (1977), A mixed finite element method for second order elliptic problems. In Mathematical Aspects of Finite Element Methods, Vol. 606 of Lecture Notes in Mathematics, Springer, pp. 292–315. J. E. Roberts and J.-M. Thomas (1991), Mixed and hybrid methods. In Handbook of Numerical Analysis, Vol. II, North-Holland, pp. 523–639. B. N. Ryland and H. Munthe-Kaas (2011), On multivariate Chebyshev polynomials and spectral approximations on triangles. In Spectral and High Order Methods for Partial Differential Equations, Vol. 76 of Lecture Notes in Computational Science and Engineering, Springer, pp. 19–41.
Topics in structure-preserving discretization
119
J. M. Sanz-Serna and M. P. Calvo (1994), Numerical Hamiltonian Problems, Vol. 7 of Applied Mathematics and Mathematical Computation, Chapman & Hall. J. Sch¨ oberl (2008), ‘A posteriori error estimates for Maxwell equations’, Math. Comp. 77, 633–649. J. Sch¨oberl and A. Sinwel (2007), Tangential-displacement and normal-normalstress continuous mixed finite elements for elasticity. RICAM report. J. P. Serre (1977), Linear Representations of Finite Groups, Springer. E. M. Stein (1970), Singular Integrals and Differentiability Properties of Functions, Vol. 30 of Princeton Mathematical Series, Princeton University Press. G. Strang (1972), ‘Approximation in the finite element method’, Numer. Math. 19, 81–98. A. Trønnes (2005), Symmetries and generalized Fourier transforms applied to computing the matrix exponential. Master’s thesis, University of Bergen, Norway. V. S. Varadarajan (1984), Lie Groups, Lie Algebras, and Their Representations, Vol. 102 of Graduate Texts in Mathematics, Springer. T. Warburton (2006), ‘An explicit construction of interpolation nodes on the simplex’, J. Engng Math. 56, 247–262. F. W. Warner (1983), Foundations of Differentiable Manifolds and Lie Groups, Vol. 94 of Graduate Texts in Mathematics, Springer. A. Weil (1952), ‘Sur les th´eor`emes de de Rham’, Comment. Math. Helv. 26, 119– 145. J. Wensch, O. Knoth and A. Galant (2009), ‘Multirate infinitesimal step methods for atmospheric flow simulation’, BIT 49, 449–473. H. Whitney (1957), Geometric Integration Theory, Princeton University Press. T. Yaguchi, T. Matsuo and M. Sugihara (2010), ‘Conservative numerical schemes for the Ostrovsky equation’, J. Comput. Appl. Math. 234, 1036–1048. A. Zanna and H. Z. Munthe-Kaas (2001/02), ‘Generalized polar decompositions for the approximation of the matrix exponential’, SIAM J. Matrix Anal. Appl. 23, 840–862. A. Zanna, K. Engø and H. Z. Munthe-Kaas (2001), ‘Adjoint and selfadjoint Liegroup methods’, BIT 41, 395–421.
Acta Numerica (2011), pp. 121–209 doi:10.1017/S0962492911000031
c Cambridge University Press, 2011 Printed in the United Kingdom
Mathematical and computational methods for semiclassical Schr¨ odinger equations∗ Shi Jin† Department of Mathematics, University of Wisconsin, Madison, WI 53706, USA E-mail:
[email protected]
Peter Markowich‡ Department of Applied Mathematics and Theoretical Physics, University of Cambridge, Wilberforce Road, Cambridge CB3 0WA, UK E-mail:
[email protected]
Christof Sparber§ Department of Mathematics, Statistics, and Computer Science, University of Illinois at Chicago, 851 South Morgan Street, Chicago, Illinois 60607, USA E-mail:
[email protected] We consider time-dependent (linear and nonlinear) Schr¨ odinger equations in a semiclassical scaling. These equations form a canonical class of (nonlinear) dispersive models whose solutions exhibit high-frequency oscillations. The design of efficient numerical methods which produce an accurate approximation of the solutions, or at least of the associated physical observables, is a formidable mathematical challenge. In this article we shall review the basic analytical methods for dealing with such equations, including WKB asymptotics, Wigner measure techniques and Gaussian beams. Moreover, we shall give an overview of the current state of the art of numerical methods (most of which are based on the described analytical techniques) for the Schr¨ odinger equation in the semiclassical regime. ∗ †
‡ §
Colour online available at journals.cambridge.org/anu. Partially supported by NSF grant no. DMS-0608720, NSF FRG grant DMS-0757285, a Van Vleck Distinguished Research Prize and a Vilas Associate Award from the University of Wisconsin–Madison. Supported by a Royal Society Wolfson Research Merit Award and by KAUST through a Investigator Award KUK-I1-007-43. Partially supported by the Royal Society through a University Research Fellowship.
122
S. Jin and P. Markowich and C. Sparber
CONTENTS 1 Introduction 2 WKB analysis for semiclassical Schr¨ odinger equations 3 Wigner transforms and Wigner measures 4 Finite difference methods for semiclassical Schr¨odinger equations 5 Time-splitting spectral methods for semiclassical Schr¨odinger equations 6 Moment closure methods 7 Level set methods 8 Gaussian beam methods: Lagrangian approach 9 Gaussian beam methods: Eulerian approach 10 Asymptotic methods for discontinuous potentials 11 Schr¨odinger equations with matrix-valued potentials and surface hopping 12 Schr¨ odinger equations with periodic potentials 13 Numerical methods for Schr¨odinger equations with periodic potentials 14 Schr¨odinger equations with random potentials 15 Nonlinear Schr¨odinger equations in the semiclassical regime References
122 125 130 134 140 146 151 155 160 167 173 178 183 190 193 200
1. Introduction This goal of this article is to give an overview of the currently available numerical methods used in the study of highly oscillatory partial differential equations (PDEs) of Schr¨ odinger type. This type of equation forms a canonical class of (nonlinear) dispersive PDEs, i.e., equations in which waves of different frequency travel with different speed. The accurate and efficient numerical computation of such equations usually requires a lot of analytical insight, and this applies in particular to the regime of high frequencies. The following equation can be seen as a paradigm for the PDEs under consideration: iε∂t uε = −
ε2 ∆uε + V (x)uε , 2
uε (0, x) = uεin (x),
(1.1)
for (t, x) ∈ R × Rd , with d ∈ N denoting the space dimension. In addition, ε ∈ (0, 1] denotes the small semiclassical parameter (the scaled Planck’s constant), describing the microscopic/macroscopic scale ratio. Here, we have already rescaled all physical parameters, such that only one dimensionless
¨ dinger equations Methods for semiclassical Schro
123
parameter ε 1 remains. The unknown uε = uε (t, x) ∈ C is the quantum mechanical wave function whose dynamics is governed by a static potential function V = V (x) ∈ R (time-dependent potentials V (t, x) can usually also be taken into account without requiring too much extra work, but for the sake of simplicity we shall not do so here). In this article, several different classes of potentials, e.g., smooth, discontinuous, periodic, random, will be discussed, each of which requires a different numerical strategy. In addition, possible nonlinear effects can be taken into account (as we shall do in Section 15) by considering nonlinear potentials V = f (|uε |2 ). In the absence of V (x) a particular solution to the Schr¨odinger equation is given by a single plane wave, t 2 i ε , ξ · x − |ξ| u (t, x) = exp ε 2 for any given wave vector ξ ∈ Rd . We see that uε features oscillations with frequency 1/ε in space and time, which inhibit strong convergence of the wave function in the classical limit ε → 0+ . In addition, these oscillations pose a huge challenge for numerical computations of (2.1); in particular, they strain computational resources when run-of-the-mill numerical techniques are applied in order to numerically solve (1.1) in the semiclassical regime ε 1. For the linear Schr¨odinger equation, classical numerical analysis methods (such as the stability–consistency concept) are sufficient to derive meshing strategies for discretizations (say, of finite difference, finite element or even time-splitting spectral type) which guarantee (locally) strong convergence of the discrete wave functions when the semiclassical parameter ε is fixed: see Chan, Lee and Shen (1986), Chan and Shen (1987), Wu (1996) and D¨ orfler (1998); extensions to nonlinear Schr¨odinger equations can be found in, e.g., Delfour, Fortin and Payre (1981), Taha and Ablowitz (1984) and Pathria and Morris (1990). However, the classical numerical analysis strategies cannot be employed to investigate uniform in ε properties of discretization schemes in the semiclassical limit regime. As we shall detail in Section 4, even seemingly reasonable, i.e., stable and consistent, discretization schemes, which are heavily used in many practical application areas of Schr¨odinger-type equations, require huge computational resources in order to give accurate physical observables for ε 1. The situation gets even worse when an accurate resolution of uε itself is required. To this end, we remark that time-splitting spectral methods tend to behave better than finite difference/finite element methods, as we shall see in more detail in Section 5. In summary, there is clearly a big risk in using classical discretization techniques for Schr¨ odinger calculations in the semiclassical regime. Certain schemes produce completely incorrect observables under seemingly reasonable meshing strategies, i.e., an asymptotic resolution of the oscillation is
124
S. Jin and P. Markowich and C. Sparber
not always enough. Even worse, in these cases there is no warning from the scheme (such as destabilization) that something has gone wrong in the computation (since local error control is computationally not feasible in the semiclassical regime). The only safety anchor here lies in asymptotic mathematical analysis, such as WKB analysis, and/or a physical insight into the problem. They typically yield a (rigorous) asymptotic description of uε for small ε 1, which can consequently be implemented on a numerical level, providing an asymptotic numerical scheme for the problem at hand. In this work, we shall discuss several asymptotic schemes, depending on the particular type of potentials V considered. While one can not expect to be able to pass to the classical limit directly in the solution uε of (1.1), one should note that densities of physical observables, which are the quantities most interesting in practical applications, are typically better behaved as ε → 0, since they are quadratic in the wave function (see Section 2.1 below). However, weak convergence of uε as ε → 0 is not sufficient for passing to the limit in the observable densities (since weak convergence does not commute with nonlinear operations). This makes the analysis of the semiclassical limit a mathematically highly complex issue. Recently, much progress has been made in this area, particularly by using tools from micro-local analysis, such as H-measures (Tartar 1990) and Wigner measures (Lions and Paul 1993, Markowich and Mauser 1993, G´erard, Markowich, Mauser and Poupaud 1997). These techniques go far beyond classical WKB methods, since the latter suffers from the appearance of caustics: see, e.g., Sparber, Markowich and Mauser (2003) for a recent comparison of the two methods. In contrast, Wigner measure techniques reveal a kinetic equation in phase space, whose solution, the so-called Wigner measure associated to uε , does not exhibit caustics (see Section 3 for more details). A word of caution is in order. First, a reconstruction of the asymptotic description for uε itself (for ε 1) is in general not straightforward, since, typically, some phase information is lost when passing to the Wigner picture. Second, phase space techniques have proved to be very powerful in the linear case and in certain weakly nonlinear regimes, but they have not yet shown much strength when applied to nonlinear Schr¨odinger equations in the regime of supercritical geometric optics (see Section 15.2). There, classical WKB analysis (and in some special cases techniques for fully integrable systems) still prevails. The main mathematical reason for this is that the initial value problem for the linear Schr¨odinger equation propagates only one ε-scale of oscillations, provided the initial datum in itself is ε-oscillatory (as is always assumed in WKB analysis). New (spatial) frequencies ξ may be generated during the time evolution (typically at caustics) but no new scales of oscillations will arise in the linear case. For nonlinear Schr¨odinger problems this is different, as new oscillation scales may be generated through the
125
¨ dinger equations Methods for semiclassical Schro
nonlinear interaction of the solution with itself. Further, one should note that this important analytical distinction, i.e., no generation of new scales but possible generation of new frequencies (in the linear case), may not be relevant on the numerical level, since, say, 100ε is analytically just a new frequency, but numerically a new scale. Aside from semiclassical situations, modern research in the numerical solution of Schr¨odinger-type equations goes in a variety of directions, of which the most important are as follows. (i) Stationary problems stemming from, e.g., material sciences. We mention band diagram computations (to be touched upon below in Sections 12 and 13) and density functional theory for approximating the full microscopic Hamiltonian (not to be discussed in this paper). The main difference between stationary and time-dependent semiclassical problems is given by the fact that in the former situation the spatial frequency is fixed, whereas in the latter (as mentioned earlier) new frequencies may arise over the course of time. (ii) Large space dimensions d 1, arising, for example, when the number of particles N 1, since the quantum mechanical Hilbert space for N indistinguishable particles (without spin) is given by L2 (R3N ). This is extremely important in quantum chemistry simulations of atomistic/molecular applications. Totally different analytical and numerical techniques need to be used and we shall not elaborate on these issues in this paper. We only remark that if some of the particles are very heavy and can thus be treated classically (invoking the so-called Born–Oppenheimer approximation: see Section 11), a combination of numerical methods for both d 1 and ε 1 has to be used.
2. WKB analysis for semiclassical Schr¨ odinger equations 2.1. Basic existence results and physical observables We recall the basic existence theory for linear Schr¨ odinger equations of the form ε2 (2.1) iε∂t uε = − ∆uε + V (x)uε , uε (0, x) = uεin (x). 2 For the sake of simplicity we assume the (real-valued) potential V = V (x) to be continuous and bounded, i.e., V ∈ C(Rd ; R) :
|V (x)| ≤ K.
The Kato–Rellich theorem then ensures that the Hamiltonian operator H ε := −
ε2 ∆ + V (x) 2
(2.2)
126
S. Jin and P. Markowich and C. Sparber
is essentially self-adjoint on D(−∆) = C0∞ ⊂ L2 (Rd ; C) and bounded from below by −K: see, e.g., Reed and Simon (1975). Its unique self-adjoint extension (to be denoted by the same symbol) therefore generates a strongly ε continuous semi-group U ε (t) = e− itH /ε on L2 (Rd ), which ensures the global existence of a unique (mild) solution uε (t) = U ε (t)uin of the Schr¨odinger equation (2.1). Moreover, since U ε (t) is unitary, we have uε (t, ·)2L2 = uεin 2L2 ,
∀ t ∈ R.
In quantum mechanics this is interpreted as conservation of mass. In addition, we also have conservation of the total energy ε2 ε ε 2 |∇u (t, x)| dx + V (x)|uε (t, x)|2 dx, (2.3) E[u (t)] = 2 Rd d R which is the sum of the kinetic and the potential energies. In general, expectation values of physical observables are computed via quadratic functionals of uε . To this end, denote by aW (x, εDx ) the operator corresponding to a classical (phase space) observable a ∈ Cb∞ (Rd × Rd ), obtained via Weyl quantization, 1 x+y W , εξ f (y) e i(x−y)·ξ dξ dy, (2.4) a a (x, εDx )f (x) := (2π)m 2 Rd ×Rd where εDx := −iε∂x . Then the expectation value of a in the state uε at time t ∈ R is given by a[uε (t)] = uε (t), aW (x, εDx )uε (t) L2 ,
(2.5)
where ·, · L2 denotes the usual scalar product on L2 (Rd ; C). Remark 2.1. The convenience of the Weyl calculus lies in the fact that an (essentially) self-adjoint Weyl operator aW (x, εDx ) has a real-valued symbol a(x, ξ): see H¨ ormander (1985). The quantum mechanical wave function uε can therefore be considered only an auxiliary quantity, whereas (real-valued) quadratic quantities of uε yield probability densities for the respective physical observables. The most basic quadratic quantities are the particle density ρε (t, x) := |uε (t, x)|2 ,
(2.6)
and the current density
j ε (t, x) := ε Im uε (t, x)∇uε (t, x) .
(2.7)
It is easily seen that if uε solves (2.1), then the following conservation law holds: ∂t ρε + div j ε = 0.
(2.8)
¨ dinger equations Methods for semiclassical Schro
127
In view of (2.3) we can also define the energy density 1 (2.9) eε (t, x) := |ε∇uε (t, x)|2 + V (x)ρε (t, x). 2 As will be seen (see Section 5), computing these observable densities numerically is usually less cumbersome than computing the actual wave function uε accurately. From the analytical point of view, however, we face the problem that the classical limit ε → 0 can only be regarded as a weak limit (in a suitable topology), due to the oscillatory nature of uε . Quadratic operations defining densities of physical observables do not, in general, commute with weak limits, and hence it remains a challenging task to identify the (weak) limits of certain physical observables, or densities, respectively. 2.2. Asymptotic description of high frequencies In order to gain a better understanding of the oscillatory structure of uε we invoke the following WKB approximation (see Carles (2008) and the references given therein): ε→0
uε (t, x) ∼ aε (t, x) e iS(t,x)/ε ,
(2.10)
with real-valued phase S and (possibly) complex-valued amplitude aε , satisfying the asymptotic expansion ε→0
aε ∼ a + εa1 + ε2 a2 + · · · .
(2.11)
Plugging the ansatz (2.10) into (2.1), one can determine an approximate solution to (2.1) by subsequently solving the equations obtained in each order of ε. To leading order, i.e., terms of order O(1), one obtains a Hamilton–Jacobi equation for the phase function S: 1 (2.12) ∂t S + |∇S|2 + V (x) = 0, S(0, x) = Sin (x). 2 This equation can be solved by the method of characteristics, provided V (x) is sufficiently smooth, say V ∈ C 2 (Rd ). The characteristic flow is given by the following Hamiltonian system of ordinary differential equations: x(t, ˙ y) = ξ(t, y), ˙ y) = −∇x V (x(t, y)), ξ(t,
x(0, y) = y, ξ(0, y) = ∇Sin (y).
(2.13)
Remark 2.2. The characteristic trajectories y → x(t, y) obtained via (2.13) are usually interpreted as the rays of geometric optics. The WKB approximation considered here is therefore also regarded as the geometric optics limit of the wave field uε .
128
-1
S. Jin and P. Markowich and C. Sparber
-0.8
-0.6
-0.4
-0.2
0
0.2
0.4
0.6
0.8
1
1.4
1.4
1.2
1.2
1
1
0.8
0.8
0.6
0.6
0.4
0.4
0.2
0.2
0
-1
-0.8
-0.6
-0.4
-0.2
(a)
0
0.2
0.4
0.6
0.8
1
0
(b)
Figure 2.1. Caustics generated from initial data ∂x Sin (x) = − sin(πx)| sin(πx)|p−1 : (a) p = 1, and the solution becomes triple-valued; (b) p = 2, and we exhibit single-, triple- and quintuple-valued solutions.
By the Cauchy–Lipschitz theorem, this system of ordinary differential equations can be solved at least locally in time, and consequently yields the phase function t 1 |∇S(τ, y(t, x))|2 − V (τ, y(t, x)) dτ, S(t, x) = S(0, x) + 0 2 where y(τ, x) denotes the inversion of the characteristic flow Xt : y → x(t, y). This yields a smooth phase function S ∈ C ∞ ([−T, T ] × Rd ) up to some time T > 0 but possibly very small. The latter is due to the fact that, in general, characteristics will cross at some finite time |T | < ∞, in which case the flow map Xt : Rd → Rd is no longer one-to-one. The set of points at which Xt ceases to be a diffeomorphism is usually called a caustic set. See Figure 2.1 (taken from Gosse, Jin and Li (2003)) for examples of caustic formulation. Ignoring the problem of caustics for a moment, one can proceed with our asymptotic expansion and obtain at order O(ε) the following transport equation for the leading-order amplitude: a (2.14) ∂t a + ∇S · ∇a + ∆S = 0, a(0, x) = ain (x). 2 In terms of the leading-order particle density ρ := |a|2 , this reads ∂t ρ + div(ρ∇S) = 0,
(2.15)
which is reminiscent of the conservation law (2.8). The transport equation (2.14) is again solved by the methods of characteristics (as long as S is smooth, i.e., before caustics) and yields ain (y(t, x)) a(t, x) = , Jt (y(t, x))
|t| ≤ T,
(2.16)
¨ dinger equations Methods for semiclassical Schro
129
where Jt (y) := det ∇y x(t, u) denotes the Jacobi determinant of the Hamiltonian flow. All higher-order amplitudes an are then found to be solutions of inhomogeneous transport equations of the form an (2.17) ∂t an + ∇S · ∇an + ∆S = ∆an−1 . 2 These equations are consequently solved by the method of characteristics. At least locally in time (before caustics), this yields an approximate solution of WKB type, uεapp (t, x) = e iS(t,x)/ε a(t, x) + εa1 (t, x) + ε2 a2 (t, x) + · · · , including amplitudes (an )N n=1 up to some order N ∈ N. It is then straightforward to prove the following stability result. Theorem 2.3. form,
Assume that the initial data of (2.1) are given in WKB uεin (x) = ain (x) e iSin (x)/ε ,
C ∞ (Rd ),
(2.18)
S(Rd ),
with Sin ∈ and let ain ∈ i.e., smooth and rapidly decaying. Then, for any closed time interval I ⊂ T , before caustic onset, there exists a C > 0, independent of ε ∈ (0, 1], such that sup uε (t) − uεapp (t)L2 ∩L∞ ≤ CεN . t∈I
The first rigorous result of this type goes back to Lax (1957). Its main drawback is the fact that the WKB solution breaks down at caustics, where S develops singularities. In addition, the leading-order amplitude a blows up in L∞ (Rd ), in view of (2.16) and the fact that limt→T Jt (y) = 0. Of course, these problems are not present in the exact solution uε but are merely an artifact of the WKB ansatz (2.10). Caustics therefore indicate the appearance of new ε-oscillatory scales within uε , which are not captured by the simple oscillatory ansatz (2.10). 2.3. Beyond caustics At least locally away from caustics, though, the solution can always be described by a superposition of WKB waves. This can be seen rather easily in the case of free dynamics where V (x) = 0. The corresponding solution of the Schr¨odinger equation (2.1) with WKB initial data is then explicitly given by 1 ain (y) e iϕ(x,y,ξ,t)/ε dy dξ, (2.19) uε (t, x) = (2πε)d d d R ×R with phase function t ϕ(x, y, ξ, t) := (x − y) · ξ + |ξ|2 + Sin (y). 2
(2.20)
130
S. Jin and P. Markowich and C. Sparber
The representation formula (2.19) comprises an oscillatory integral, whose main contributions stem from stationary phase points at which ∂y,ξ ϕ(x, t) = 0. In view of (2.20) this yields ξ = ∇S,
y = x − tξ.
The corresponding map y → x(t, y) is the characteristic flow of the free Hamilton–Jacobi equation 1 ∂t S + |∇S|2 = 0, S(0, x) = Sin (x). 2 Inverting the relation y → x(t, y) yields the required stationary phase points {yj (t, x)}j∈N ∈ Rd for the integral (2.19). Assuming for simplicity that there are only finitely many such points, then 1 ε ain (y) eiϕ(x,y,ξ,t)/ε dy dξ u (t, x) = (2πε)d d d R ×R (2.21) J ain (yj (t, x)) iS(yj (t,x))/ε+ iπmj /4 ε→0 e ∼ , Jt (yj (t, x)) j=1 with constant phase shifts mj = sgn D2 S(yj (t, x))) ∈ N (usually referred to as the Keller–Maslov index). The right-hand side of this expression is usually referred to as multiphase WKB approximation. The latter can be interpreted as an asymptotic description of interfering wave trains in uε . Remark 2.4. The case of non-vanishing V (x), although similar in spirit, is much more involved in general. In order to determine asymptotic description of uε beyond caustics, one needs to invoke the theory of Fourier integral operators: see, e.g., Duistermaat (1996). In particular, it is in general very hard to determine the precise form and number of caustics appearing throughout the time evolution of S(t, x). Numerical schemes for capturing caustics have been developed in, e.g., Benamou and Solliec (2000), or Benamou, Lafitte, Sentis and Solliec (2003) and the references therein.
3. Wigner transforms and Wigner measures 3.1. The Wigner-transformed picture of quantum mechanics Whereas WKB-type methods aim for approximate solutions of uε , the goal of this section is to directly identify the weak limits of physical observable densities as ε → 0. To this end, one defines the so-called Wigner transform of uε , as given in Wigner (1932): ε ε 1 ε ε ε ε u x + η u x − η eiξ·η dη. (3.1) w [u ](x, ξ) := 2 2 (2π)d Rd
131
¨ dinger equations Methods for semiclassical Schro
Plancherel’s theorem together with a simple change of variables yields wε L2 (R2d ) = ε−d (2π)−d/2 uε 2L2 (Rd ) . The real-valued Wigner transform wε ∈ L2 (Rdx × Rdξ ) can be interpreted as a phase space description of the quantum state uε . In contrast to classical phase space distributions, wε in general also takes negative values (except for Gaussian wave functions). Applying this transformation to the Schr¨odinger equation (2.1), the timedependent Wigner function wε (t, x, ξ) ≡ wε [uε (t)](x, ξ) is easily seen to satisfy ∂t wε + ξ · ∇x wε − Θε [V ]wε = 0,
ε wε (0, x, ξ) = win (x, ξ),
(3.2)
where Θε [V ] is a pseudo-differential operator, taking into account the influence of V (x). Explicitly, it is given by i ε δV ε (x, y)f (x, ξ ) eiη(ξ−ξ ) dη dξ , (3.3) Θ [V ]f (x, ξ) := d (2π) Rd ×Rd where the symbol δV ε reads ε ε 1 V x− y −V x+ y . δV ε := ε 2 2 Note that in the free case where V (x) = 0, the Wigner equation becomes the free transport equation of classical kinetic theory. Moreover, if V ∈ C 1 (Rd ) we obviously have that ε→0
δV ε −→ y · ∇x V, in which case the ε → 0 limit of (3.2) formally becomes the classical Liouville equation in phase space: see (3.7) below. The most important feature of the Wigner transform is that it allows for a simple computation of quantum mechanical expectation values of physical observables. Namely, ε W ε a(x, ξ)wε (t, x, ξ) dx dξ, (3.4) u (t), a (x, εD)u (t) L2 = Rd ×Rd
where a(x, ξ) is the classical symbol of the operator aW (x, εDx ). In addition, at least formally (since wε ∈ L1 (Rd × Rd ) in general), the particle density (2.6) can be computed via wε (t, x, ξ) dξ, ρε (t, x) = Rd
and the current density (2.7) is given by ε ξwε (t, x, ξ) dξ. j (t, x) = Rd
132
S. Jin and P. Markowich and C. Sparber
Similarly, the energy density (2.9) is ε e (t, x) = H(x, ξ)wε (t, x, ξ) dξ, Rd
where the classical (phase space) Hamiltonian function is denoted by 1 H(x, ξ) = |ξ|2 + V (x). (3.5) 2 Remark 3.1. It can be proved that the Fourier transform of wε with respect to ξ satisfies w ε ∈ C0 (Rdy ; L1 (Rdx )) and likewise for the Fourier transformation of wε with respect to x ∈ Rd . This allows us to define the integrals of wε via a limiting process after convolving wε with Gaussians; see Lions and Paul (1993) for more details. 3.2. Classical limit of Wigner transforms The main point in the formulae given above is that the right-hand side of (3.4) involves only linear operations of wε , which is compatible with weak limits. To this end, we recall the main result proved in Lions and Paul (1993) and G´erard et al. (1997). Theorem 3.2. ε, that is,
Let uε (t) be uniformly bounded in L2 (Rd ) with respect to sup uε (t)L2 < +∞,
0<ε≤1
∀ t ∈ R.
Then, the set of Wigner functions {wε (t)}0<ε≤1 ⊂ S (Rdx × Rdξ ) is weak-∗ compact and thus, up to extraction of subsequences, ε→0
wε [uε ] −→ w0 ≡ w
in L∞ ([0, T ]; S (Rdx × Rdξ )) weak-∗,
where the limit w(t) ∈ M+ (Rdx × Rdξ ) is called the Wigner measure. If, in addition ∀ t : (ε∇u(t)) ∈ L2 (Rd ) uniformly with respect to ε, then we also have ε→0
ρε (t, x) −→ ρ(t, x) = ε→0
j ε (t, x) −→ j(t, x) =
w(t, x, dξ), R
d
ξw(t, x, dξ). Rd
Note that although wε (t) in general also takes negative values, its weak limit w(t) is indeed a non-negative measure in phase space. Remark 3.3. The limiting phase space measures w(t) ∈ M+ (Rdx × Rdp ) are also often referred to as semiclassical measures and are closely related to the so-called H-measures used in homogenization theory (Tartar 1990). The fact that their weak limits are non-negative can be seen by considering
¨ dinger equations Methods for semiclassical Schro
133
the corresponding Husimi transformation, i.e., ε ε wH [u ] := wε [uε ] ∗x Gε ∗ξ Gε ,
where we denote 2 /ε
Gε ( · ) := (πε)−d/4 e−| · |
.
ε is non-negative a.e. and has the same limit points The Husimi transform wH as the Wigner function wε ; see Markowich and Mauser (1993).
This result allows us to exchange limit and integration on the limit on the right-hand side of (3.4) to obtain ε→0 ε W ε u , a (x, εDx )u L2 −→ a(x, ξ)w(t, x, ξ) dx dξ. Rd ×Rd
The Wigner transformation and its associated Wigner measure are therefore highly useful tools for computing the classical limit of the expectation values of physical observables. In addition, it is proved in Lions and Paul (1993) and G´erard et al. (1997) that w(t, x, ξ) is the push-forward under the flow corresponding to the classical Hamiltonian H(x, ξ), i.e., w(t, x, ξ) = win (F−t (x, ξ)), where win is the initial Wigner measure and Ft : R2d → R2d is the phase space flow given by x˙ = ∇ξ H(x, ξ), ξ˙ = −∇x H(x, ξ),
x(0, y, ζ) = y, ξ(0, y, ζ) = ζ.
(3.6)
In other words w(t, x, ξ) is a distributional solution of the classical Liouville equation in phase space, i.e., ∂t w + {H, w} = 0,
(3.7)
where {a, b} := ∇ξ a · ∇x b − ∇x a · ∇ξ b denotes the Poisson bracket. Note that in the case where H(x, ξ) is given by (3.5), this yields ∂t w + ξ · ∇ξ w − ∇x V (x) · ∇ξ w = 0,
(3.8)
with characteristic equations given by the Newton trajectories: x˙ = ξ, ξ˙ = −∇x V (x). Strictly speaking we require V ∈ Cb1 (Rd ), in order to define w as a distributional solution of (3.8). Note, however, in contrast to WKB techniques, the equation for the limiting Wigner measure (3.8) is globally well-posed, i.e., one does not experience problems of caustics. This is due to the fact that the Wigner measure w(t, x, ξ) lives in phase space.
134
S. Jin and P. Markowich and C. Sparber
3.3. Connection between Wigner measures and WKB analysis A particularly interesting situation occurs for uεin given in WKB form (2.18). The corresponding Wigner measure is found to be ε→0
wε [uεin ] −→ win = |ain (x)|2 δ(ξ − ∇Sin (x)),
(3.9)
i.e., a mono-kinetic measure concentrated on the initial velocity v = ∇Sin . In this case the phase space flow Ft is projected onto physical space Rd , yielding Xt , the characteristic flow of the Hamilton–Jacobi equation (2.12). More precisely, the following result has been proved in Sparber et al. (2003). Theorem 3.4. Let w(t, x, ξ) be the Wigner measure of the exact solution uε to (2.1) with WKB initial data. Then w(t, x, ξ) = |a(t, x)|2 δ(ξ − ∇S(t, x)) if and only if ρ = |a|2 and v = ∇S are smooth solutions of the leading-order WKB system given by (2.12) and (2.15). This theorem links the theory of Wigner measures with the WKB approximation before caustics. After caustics, the Wigner measure is in general no longer mono-kinetic. However, it can be shown (Sparber et al. 2003, Jin and Li 2003) that for generic initial data uεin and locally away from caustics, the Wigner measure can be decomposed as w(t, x, ξ) =
J
|aj (t, x)|2 δ(ξ − vj (t, x)),
(3.10)
j=1
which is consistent with the multiphase WKB approximation given in (2.21).
4. Finite difference methods for semiclassical Schr¨ odinger equations 4.1. Basic setting A basic numerical scheme for solving linear partial differential equations is the well-known finite difference method (FD), to be discussed in this section; see, e.g., Strikwerda (1989) for a general introduction. In the following, we shall be mainly interested in its performance as ε → 0. To this end, we shall allow for more general Schr¨ odinger-type PDEs in the form (Markowich and Poupaud 1999) iε∂t uε = H W (x, εDx )uε ,
uε (0, x) = uεin (x),
(4.1)
where H W denotes the Weyl quantization of a classical real-valued phase space Hamiltonian H(x, ξ) ∈ C ∞ (Rd × Rd ), which is assumed to grow at
¨ dinger equations Methods for semiclassical Schro
135
most quadratically in x and ξ. For the following we assume that the symbol is a polynomial of order K ∈ N in ξ with C ∞ -coefficients Hk (x), i.e., H(x, ξ) = Hk (x)ξ k , |k|≤K
where k = (k1 , . . . , kd ) ∈ Nd denotes a multi-index with |k| := k1 + · · · + kd . The differential operator H(x, εDx )W can now be written as x+y ϕ(y) . H(x, εDx )W ϕ(x) = ε|k| Dyk Hk (4.2) 2 y=x |k|≤K
In addition, assume that H(x, εDx )W is essentially self-adjoint on L2 (Rd ),
(A1)
and, for simplicity, ∀ k, α ∈ Nd with |k| ≤ K ∃ Ck,α > 0 : |∂xα Hk (x)| ≤ Ck,α ∀x ∈ Rd .
(A2)
Under these conditions H(x, εDx )W can be shown (Kitada 1980) to generate W a unitary (strongly continuous) semi-group of operators U ε (t) = e−itH /ε , which provides a unique global-in-time solution uε = uε (t) ∈ L2 (Rd ). Next, let
Γ := γ = 1 r1 + · · · + m rm : j ∈ Z for 1 ≤ j ≤ d ⊆ Rd be the lattice generated by the linearly independent vectors r1 , . . . , rd ∈ Rd . For a multi-index k ∈ Nd we construct a discretization of order N of the operator ∂xk as follows: ∂xk ϕ(x) ≈
1 aγ,k ϕ(x + hγ). h|k| γ∈Γ
(4.3)
k
Here ∆x = h ∈ (0, h0 ] is the mesh size, Γk ⊆ Γ is the finite set of discretization points and aγ,k ∈ R are coefficients satisfying aγ,k γ = k!δ,k , 0 ≤ | | ≤ N + |k| − 1, (B1) γ∈Γk
where δ,k = 1 if = k, and zero otherwise. It is an easy exercise to show that the local discretization error of (4.3) is O(hN ) for all smooth functions if (B1) holds. For a detailed discussion of the linear problem (B1) (i.e., possible choices of the coefficients aγ,k ) we refer to Markowich and Poupaud (1999).
136
S. Jin and P. Markowich and C. Sparber
4.2. Spatial discretization We shall now define the corresponding finite difference discretization of H(x, εDx )W by applying (4.3) directly to (4.2). To this end, we let |k| (−i)|k| aγ,k Hk (x) e iγ·ξ/ , (4.4) Hh,ε (x, ξ) = |k|≤K
γ∈Γk
with = hε being the ratio between the small semiclassical parameter ε and the mesh size h. Then we obtain the finite difference discretization of (4.2) in the form H(x, εDx )W ϕ(x) ≈ Hh,ε (x, εDx )W ϕ(x) hγ |k| |k| ϕ(x + hγ). (−i) aγ,k Hk x + = 2 |k|≤K
γ∈Γk
In view of (4.4), the discretization Hh,ε (x, εDx )W is seen to be a bounded operator on L2 (Rd ) and self-adjoint if i|k| aγ,k e iγ·ξ is real-valued for 0 ≤ |k| ≤ K. (B2) γ∈Γk
We shall now collect several properties of such finite difference approximations, proved in Markowich, Pietra and Pohl (1999). We start with a spatial consistency result. Lemma 4.1. =
ε ε,h→0 h −→
Let (A1), (B1), (B2) hold and ϕ ∈ S(Rdx × Rdξ ). Then, for
∞, ε,h→0
Hh,ε ϕ −→ Hϕ
in S(Rdx × Rdξ ).
(4.5)
For a given ε > 0, choosing h such that = hε → ∞ corresponds to asymptotically resolving the oscillations of wavelength O(ε) in the solution odinger-type equation (4.1). In the case = const., i.e., uε (t, x) to the Schr¨ putting a fixed number of grid points per oscillation, the symbol Hh,ε (x, ξ) ≡ H (x, ξ) is independent of h and ε, i.e., |k| aγ,k (−i)|k| Hk (x) e iγ·ξ/ . (4.6) H (x, ξ) = |k|≤K
γ∈Γk
ε,h→0
In the case −→ 0, which corresponds to a scheme ignoring the εoscillations, we find γ·ξ h,ε→0 H0 (x), aγ,0 cos Hh,ε ∼ γ∈Γ0
¨ dinger equations Methods for semiclassical Schro
137
and hence Hh,ε (x, εDx )W does not approximate H(x, εDx )W . We thus cannot expect reasonable numerical results in this case (which will not be investigated further). 4.3. Temporal discretization and violation of gauge invariance For the temporal discretization one can employ the Crank–Nicolson scheme with time step ∆t > 0. This is a widely used time discretization scheme for the Schr¨odinger equation, featuring some desirable properties (see below). We shall comment on the temporal discretizations below. The scheme reads uσn+1 − uσn 1 σ W 1 σ = 0, n = 0, 1, 2, . . . , (4.7) + iHh,ε (x, εDx ) u + u ε ∆t 2 n+1 2 n subject to initial data uσin = uεin (x), where from now on, we shall denote the vector of small parameters by σ = (ε, h, ∆t). Note that the self-adjointness of Hh,ε (x, εDx )W implies that the operator 1 + isHh,ε (x, εDx )W is invertible on L2 (Rd ) for all s ∈ R. Therefore the scheme (4.7) gives welldefined approximations uσn for n = 1, 2, . . . if uεin ∈ L2 (Rd ). Moreover, we remark that it is sufficient to evaluate (4.7) at x ∈ hΓ in order to obtain discrete equations for uσn (hγ), γ ∈ Γ. Remark 4.2. For practical computations, one needs to impose artificial ‘far-field’ boundary conditions. Their impact, however, will not be taken into account in the subsequent analysis. By taking the L2 scalar product of (4.7) with 12 uσn+1 + 12 uσn , one can directly infer the following stability result. Lemma 4.3.
The solution of (4.7) satisfies uσn L2 = uεin L2 ,
n = 0, 1, 2, . . . .
In other words, the physically important property of mass-conservation also holds on the discrete level. On the other hand, the scheme can be seen to violate the gauge invariance of (4.1). More precisely, one should note that expectation values of physical observables, as defined in (2.5), are invariant under the substitution (gauge transformation) v ε (t, x) = uε (t, x) e iωt/ε ,
ω ∈ R.
In other words, the average value of the observable in the state uε is equal to its average value in the state v ε .
138
S. Jin and P. Markowich and C. Sparber
Remark 4.4. Note that in view of (3.1), the Wigner function is seen to also be invariant under this substitution, i.e., ∀ω ∈ R : wε [uε (t)] = wε [uε (t) e iωt/ε ] ≡ wε [v ε (t)]. On the other hand, using this gauge transformation the Schr¨ odinger equation (4.1) transforms to iε∂t v ε = H(x, εDx )W + ω v ε , v ε (0, x) = uεin (x), (4.8) which implies that the zeroth-order term H0 (x) in (4.2) is replaced by H0 (x) + ω, while the other coefficients Hk (x), k = 0, remain unchanged. In physical terms, H0 (x) corresponds to a scalar (static) potential V (x). The corresponding force field obtained via F (x) = ∇H0 (x) = ∇(H0 (x) + ω) is unchanged by the gauge transformation and thus (4.8) can be considered (physically) equivalent to (4.1). The described situation, however, is completely different for the difference scheme outlined above. Indeed, a simple calculation shows that the discrete gauge transformation vnσ = uσn e iωtn /ε does not commute with the discretization (4.7), up to adding a real constant to the potential. Thus, the discrete approximations of average values of observables depend on the gauging of the potential. In other words, the discretization method is not time-transverse-invariant. 4.4. Stability–consistency analysis for FD in the semiclassical limit The consistency–stability concept of classical numerical analysis provides a framework for the convergence analysis of finite difference discretizations of linear partial differential equations. Thus, for ε > 0 fixed it is easy to prove that the scheme (4.7) is convergent of order N in space and order 2 in time if the exact solution uε (t, x) is sufficiently smooth. Therefore, again for fixed ε > 0, we conclude convergence of the same order for average values of physical observables provided a(x, ξ) is smooth. However, due to the oscillatory nature solutions to (4.1) the local discretization error of the finite difference schemes and, consequently, also the global discretization error, in general tend to infinity as ε → 0. Thus, the classical consistency–stability theory does not provide uniform results in the classical limit. Indeed, under the reasonable assumption that, for all multi-indices j1 and j2 ∈ Nd , ∂ |j1 |+|j2 | ε ε→0 u (t, x) ∼ ε−|j1 |−j2 ∂tj1 ∂xj2
in L2 (Rd ),
locally uniformly in t ∈ R, the classical stability–consistency analysis gives
¨ dinger equations Methods for semiclassical Schro
139
the following bound for the global L2 -discretization error: N (∆t)2 h O + O . ε3 εN +1 The situation is further complicated by the fact that for any fixed t ∈ R, the solution uε (t, ·) of (4.1) and its discrete counterpart uσn in general converge only weakly in L2 (Rd ) as ε → 0, respectively, σ → 0. Thus, the limit processes ε → 0, σ → 0 do not commute with the quadratically nonlinear operation (2.5), needed to compute the expectation value of physical observables a[uε (t)]. In practice, one is therefore interested in finding conditions on the mesh size h and the time step ∆t, depending on ε in such a way that the expectation values of physical observables in discrete form approximate a[uε (t)] uniformly as ε → 0. To this end, let tn = n∆t, n ∈ N, and denote aσ (tn ) := a(·, εDx )W uσn , uσn . The function aσ (t), t ∈ R, is consequently defined by piecewise linear interpolation of the values aσ (tn ). We seek conditions on h, k such that, for all m a ∈ S(Rm x × Rξ ), lim (aσ (t) − a[uε (t)]) = 0 uniformly in ε ∈ (0, ε0 ],
h,∆t→0
(4.9)
and locally uniformly in t ∈ R. A rigorous study of this problem will be given by using the theory of Wigner measures applied in a discrete setting. Denoting the Wigner transformation (on the scale ε) of the finite difference solution uσn by wσ (tn ) := wε [uσn ], and defining, as before, wσ (t), for any t ∈ R, by the piecewise linear interpolation of wσ (tn ), we conclude that (4.9) is equivalent to proving, locally uniformly in t, lim (wσ (t) − wε (t)) = 0 in S (Rdx × Rdξ ), uniformly in ε ∈ (0, ε0 ], (4.10)
h,∆t→0
where wε (t) is the Wigner transform of the solution uε (t) of (4.1). We shall now compute the accumulation points of the sequence {wσ (t)}σ as σ → 0. We shall see that for any given subsequence {σn }n∈N , the set of Wigner measures of the difference schemes µ(t) := lim wσn (t) n→∞
depends decisively on the relative sizes of ε, h and ∆t. Clearly, in those cases in which µ = w, where w denotes the Wigner measure of the exact solution uε (t), the desired property (4.10) follows. On the other hand (4.10) does not hold if the measures µ and w are different. Such a Wigner-measure-based
140
S. Jin and P. Markowich and C. Sparber
study of finite difference schemes has been conducted in Markowich et al. (1999) and Markowich and Poupaud (1999). The main result given there is as follows. Theorem 4.5. Fix a scale ε > 0 and denote by µ the Wigner measure of the discretization (4.7) as σ → 0. Then we have the following results. Case 1. Let h/ε → 0 (or, equivalently, → ∞). (i) If ∆t/ε → 0, then µ satisfies ∂t µ + {H, µ} = 0,
µ(0, x, ξ) = win (x, ξ).
R+ ,
then µ solves (ii) If ∆t/ε → ω ∈ 2 ω ∂ µ+ arctan H , µ = 0, ∂t ω 2
µ(0, x, ξ) = win (x, ξ).
(iii) If ∆t/ε → ∞ and if in addition there exists C > 0 such that |H(x, ξ)| ≥ C, ∀x, ξ ∈ Rd , then µ is constant in time, i.e., µ(t, x, ξ) ≡ µin (x, ξ),
∀ t ∈ R.
Case 2. If h/ε → 1/ ∈ R+ , then the assertions (i)–(iii) hold true, with H replaced by H defined in (4.6). The proof of this result proceeds similarly to the derivation of the phase space Liouville equation (3.7), in the continuous setting. Note that Theorem 4.5 implies that, as ε → 0, expectation values for physical observables in the state uε (t), computed via the Crank–Nicolson finite difference scheme, are asymptotically correct only if both spatial and temporal oscillations of wavelength ε are accurately resolved. Remark 4.6. Time-irreversible finite difference schemes, such as the explicit (or implicit) Euler scheme, behave even less well, as they require ∆t = o(ε2 ) in order to guarantee asymptotically correct numerically computed observables; see Markowich et al. (1999).
5. Time-splitting spectral methods for semiclassical Schr¨ odinger equations 5.1. Basic setting, first- and second-order splittings As has been discussed before, finite difference methods do not perform well in computing the solution to semiclassical Schr¨odinger equations. An alternative is given by time-splitting trigonometric spectral methods, which will be discussed in this subsection; see also McLachlan and Quispel (2002) for a broad introduction to splitting methods. For the sake of notation, we shall introduce the method only in the case of one space dimension, d = 1.
¨ dinger equations Methods for semiclassical Schro
141
Generalizations to d > 1 are straightforward for tensor product grids and the results remain valid without modifications. In the following, we shall therefore study the one-dimensional version of equation (2.1), i.e., iε∂t uε = −
ε2 ∂xx uε + V (x)uε , 2
uε (0, x) = uεin (x),
(5.1)
for x ∈ [a, b], 0 < a < b < +∞, equipped with periodic boundary conditions uε (t, a) = uε (t, b),
∂x uε (t, a) = ∂x uε (t, b),
∀ t ∈ R.
We choose the spatial mesh size ∆x = h > 0 with h = (b − a)/M for some M ∈ 2N, and an ε-independent time step ∆t ≡ k > 0. The spatio-temporal grid points are then given by xj := a + jh, j = 1, . . . , M,
tn := nk, n ∈ N.
be the numerical approximation of uε (xj , tn ), for In the following, let uε,n j j = 1, . . . , M .
First-order time-splitting spectral method (SP1 ) The Schr¨ odinger equation (5.1) is solved by a splitting method, based on the following two steps. Step 1. From time t = tn to time t = tn+1 , first solve the free Schr¨odinger equation iε∂t uε +
ε2 ∂xx uε = 0. 2
(5.2)
Step 2. On the same time interval, i.e., t ∈ [tn , tn+1 ], solve the ordinary differential equation (ODE) iε∂t uε − V (x)uε = 0,
(5.3)
with the solution obtained from Step 1 as initial data for Step 2. Equation (5.3) can be solved exactly since |u(t, x)| is left invariant under (5.3), u(t, x) = |u(0, x)| e iV (x)t . In Step 1, the linear equation (5.2) will be discretized in space by a (pseudo-) spectral method (see, e.g., Fornberg (1996) for a general introduction) and consequently integrated in time exactly. More precisely, one obtains at time t = tn+1 u(tn+1 , x) ≈ uε,n+1 = e iV (xj )k/ε uε,∗ j j ,
j = 0, 1, 2, . . . , M,
142
S. Jin and P. Markowich and C. Sparber
ε with initial value uε,0 j = uin (xj ), and
1 M
uε,∗ j = where γ =
2πl b−a
and
u ε,n =
u ε,n M
M/2−1 2
iγ (xj −a) e iεkγ /2 u ε,n , e
=−M/2
denote the Fourier coefficients of uε,n , i.e., −iγ (xj −a) uε,n , j e
=−
j=1
M M ,..., − 1. 2 2
Note that the only time discretization error of this method is the splitting error, which is first-order in k = ∆t, for any fixed ε > 0. Strang splitting (SP2 ) In order to obtain a scheme which is second-order in time (for fixed ε > 0), one can use the Strang splitting method , i.e., on the time interval [tn , tn+1 ] we compute = e iV (xj )k/2ε uε,∗∗ uε,n+1 j j ,
j = 0, 1, 2, . . . , M − 1,
where uε,∗∗ = j with
u ε,∗
1 M
M/2−1 2
iγ (xj −a) e iεkγ /2 u ε,∗ , e
=−M/2
denoting the Fourier coefficients of uε,∗ given by iV (xj )k/2ε ε,n uj . uε,∗ j =e
Again, the overall time discretization error comes solely from the splitting, which is now (formally) second-order in ∆t = k for fixed ε > 0. Remark 5.1. Extensions to higher-order (in time) splitting schemes can be found in the literature: see, e.g., Bao and Shen (2005). For rigorous investigations of the long time error estimates of such splitting schemes we refer to Dujardin and Faou (2007a, 2007b) and the references given therein. In comparison to finite difference methods, the main advantage of such splitting schemes is that they are gauge-invariant: see the discussion in Section 4 above. Concerning the stability of the time-splitting spectral approximations with variable potential V = V (x), one can prove the following lemma (see Bao, Jin and Markowich (2002)), in which we denote U = (u1 , . . . , uM ) and · l2 the usual discrete l2 -norm on the interval [a, b], i.e., 1/2 M b−a 2 |uj | . U l2 = M j=1
¨ dinger equations Methods for semiclassical Schro
143
Lemma 5.2. The time-splitting spectral schemes SP1 and SP2 are unconditionally stable, i.e., for any mesh size h and any time step k, we have ε l2 , U ε,n l2 = U ε,0 l2 ≡ Uin
n ∈ N,
and consequently ε,0 uε,n int L2 (a,b) = uint L2 (a,b) ,
n ∈ N,
where uε,n int denotes the trigonometric polynomial interpolating ε,n ε,n {(x1 , uε,n 1 ), (x1 , u1 ), . . . , (xM , uM )}.
In other words, time-splitting spectral methods satisfy mass-conservation on a fully discrete level. 5.2. Error estimate of SP1 in the semiclassical limit To get a better understanding of the stability of spectral methods in the classical limit ε → 0, we shall establish the error estimates for SP1. Assume that the potential V (x) is (b − a)-periodic, smooth, and satisfies m d ≤ Cm , (A) dxm V ∞ L [a,b] for some constant Cm > 0. Under these assumptions it can be shown that the solution uε = uε (t, x) of (5.1) is (b−a)-periodic and smooth. In addition, we assume m +m ∂ 1 2 ε Cm +m ≤ m11+m22 , (B) ∂tm1 ∂xm2 u ε 2 C([0,T ];L [a,b])
for all m, m1 , m2 ∈ N ∪ {0}. Thus, we assume that the solution oscillates in space and time with wavelength ε, but no smaller. Remark 5.3. The latter is known to be satisfied if the initial data uεin only invoke oscillations of wavelength ε (but no smaller). Theorem 5.4. Let V (x) satisfy assumption (A) and let uε (t, x) be a solution of (5.1) satisfying (B). Denote by uε,n int the interpolation of the discrete approximation obtained via SP1. Then, if ∆x ∆t = O(1), = O(1), ε ε as ε → 0, we have that, for all m ∈ N and tn ∈ [0, T ], m ε CT ∆t T ∆x u (tn ) − uε,n 2 , + int L (a,b) ≤ Gm ∆t ε(b − a) ε
(5.4)
where C > 0 is independent of ε and m and Gm > 0 is independent of ε, ∆x, ∆t.
144
S. Jin and P. Markowich and C. Sparber
1.2
1
1 0.5
0.8 0.6
0
0.4 −0.5
0.2 0
−1
0
0.2
0.4
0.6
0.8
1
0
0.2
(a)
0.4
0.6
0.8
1
(b)
Figure 5.1. Numerical solution of (a) ρε and (b) j ε at t = 0.54, as given in Example 5.5. In the figure, the solution computed by using SP2 for 1 , is superimposed, with the limiting ρ and j obtained by ε = 0.0008, h = 512 taking moments of the Wigner measure solution of (3.8).
The proof of this theorem is given in Bao et al. (2002), where a similar result is also shown for SP2. Now let δ > 0 be a desired error bound such that uε (tn ) − uε,n int L2 [a,b] ≤ δ holds uniformly in ε. Then Theorem 5.4 suggests the following meshing strategy on O(1) time and space intervals: ∆x ∆t = O(δ), = O δ 1/m (∆t)1/m , (5.5) ε ε where m ≥ 1 is an arbitrary integer, assuming that Gm does not increase too fast as m → ∞. This meshing is already more efficient than what is needed for finite differences. In addition, as will be seen below, the conditions (5.5) can be strongly relaxed if, instead of resolving the solution uε (t, x), one is only interested in the accurate numerical computation of quadratic observable densities (and thus asymptotically correct expectation values). Example 5.5. This is an example from Bao et al. (2002). The Schr¨ odinger equation (2.1) is solved with V (x) = 10 and the initial data ρin (x) = exp(−50(x − 0.5)2 ), 1 Sin (x) = − ln(exp(5(x − 0.5)) + exp(−5(x − 0.5))), 5
x ∈ R.
¨ dinger equations Methods for semiclassical Schro
145
The computational domain is restricted to [0, 1] equipped with periodic boundary conditions. Figure 5.1 shows the solution of the limiting position density ρ and current density j obtained by taking moments of w, satisfying the Liouville equation (3.8). This has to be compared with the oscillatory ρε and j ε , obtained by solving the Schr¨odinger equation (2.1) using SP2. As one can see, these oscillations are averaged out in the weak limits ρ, j. 5.3. Accurate computation of quadratic observable densities using time-splitting We shall again invoke the theory of Wigner functions and Wigner measures. To this end, let uε (t, x) be the solution of (5.1) and let wε (t, x, ξ) be the corresponding Wigner transform. Keeping in mind the results of Section 3, we see that the first-order splitting scheme SP1 corresponds to the following time-splitting scheme for the Wigner equation (3.2). Step 1. For t ∈ [tn , tn+1 ], first solve the linear transport equation ∂t wε + ξ ∂x wε = 0.
(5.6)
Step 2. On the same time interval, solve the non-local (in space) ordinary differential equation ∂t wε − Θε [V ]wε = 0,
(5.7)
with initial data obtained from Step 1 above. In (5.6), the only possible ε-dependence stems from the initial data. In addition, in (5.7) the limit ε → 0 can be easily carried out (assuming sufficient regularity of the potential V (x)) with k = ∆t fixed. In doing so, one consequently obtains a time-splitting scheme of the limiting Liouville equation (3.8) as follows. Step 1. For t ∈ [tn , tn+1 ], solve ∂t w + ξ ∂x w0 = 0. Step 2. Using the outcome of Step 1 as initial data, solve, on the same time interval, ∂t w − ∂x V ∂ξ w0 = 0. Note that in this scheme no error is introduced other than the splitting error, since the time integrations are performed exactly. These considerations, which can easily be made rigorous (for smooth potentials), show that a uniform time-stepping (i.e., an ε-independent k = ∆t) of the form ∆t = O(δ)
146
S. Jin and P. Markowich and C. Sparber
combined with the spectral mesh size control given in (5.5) yields the following error: ε,n L2 (a,b) ≤ δ, wε (tn ) − wint
uniformly in ∆t as ε → 0. Essentially this implies that a fixed number of grid points in every spatial oscillation of wavelength ε combined with ε-independent time-stepping is sufficient to guarantee the accurate computation of (expectation values of) physical observables in the classical limit. This strategy is therefore clearly superior to finite difference schemes, which require k/ε → 0 and h/ε → 0, even if one only is interested in computing physical observables. Remark 5.6. Time-splitting methods have been proved particularly successful in nonlinear situations: see the references given in Section 15.4 below.
6. Moment closure methods We have seen before that a direct numerical calculation of uε is numerically very expensive, particularly in higher dimensions, due to the mesh and time step constraint (5.5). In order to circumvent this problem, the asymptotic analysis presented in Sections 2 and 3 can be invoked in order to design asymptotic numerical methods which allow for an efficient numerical simulation in the limit ε → 0. The initial value problem (3.8)–(3.9) is the starting point of the numerical methods to be described below. Most recent computational methods are derived from, or closely related to, this equation. The main advantage is that (3.8)–(3.9) correctly describes the limit of quadratic densities of uε (which in itself exhibits oscillations of wavelength O(ε)), and thus allows a numerical mesh size independent of ε. However, we face the following major difficulties in the numerical approximation. (1) High-dimensionality. The Liouville equation (3.8) is defined in phase space, and thus the memory requirement exceeds the current computational capability in d ≥ 3 space dimensions. (2) Measure-valued initial data. The initial data (3.9) form a delta measure and the solution at later time remains one (for a single-valued solution), or a summation of several delta functions (for a multivalued solution (3.10)). In the past few years, several new numerical methods have been introduced to overcome these difficulties. In the following, we shall briefly describe the basic ideas of these methods.
¨ dinger equations Methods for semiclassical Schro
147
6.1. The concept of multivalued solutions In order to overcome the problem of high-dimensionality one aims to approximate w(t, x, p) by using averaged quantities depending only on t, x. This is a well-known technique in classical kinetic theory, usually referred to as moment closure. A basic example is provided by the result of Theorem 3.4, which tells us that, as long as the WKB analysis of Section 2.2 is valid (i.e., before the appearance of the first caustic), the Wigner measure is given by a mono-kinetic distribution in phase space, i.e., w(t, x, ξ) = ρ(t, x)δ(ξ − v(t, x)), where one identifies ρ = |a|2 and v = ∇S. The latter solve the pressure-less Euler system ∂t ρ + div(ρv) = 0, ∂t v + (v · ∇)v + ∇V = 0,
ρ(0, x) = |ain |2 (x), v(0, x) = ∇Sin (x),
(6.1)
which, for smooth solutions, is equivalent to the system of transport equation (2.14) coupled with the Hamilton–Jacobi equation (2.12), obtained through the WKB approximation. Thus, instead of solving the Liouville equation in phase space, one can as well solve the system (6.1), which is posed on physical space Rt × Rdx . Of course, this can only be done until the appearance of the first caustic, or, equivalently, the emergence of shocks in (6.1). In order to go beyond that, one might be tempted to use numerical methods based on the unique viscosity solution (see Crandall and Lions (1983)) for (6.1). However, the latter does not provide the correct asymptotic description – the multivalued solution – of the wave function uε (t, x) beyond caustics. Instead, one has to pass to so-called multivalued solutions, based on higher-order moment closure methods. This fact is illustrated in Figure 6.1, which shows the difference between viscosity solutions and multivalued solutions. Figures 6.1(a) and 6.1(b) are the two different solutions for the following eikonal equation (in fact, the zero-level set of S): ∂t S + |∇x S| = 0,
x ∈ R2 .
(6.2)
This equation, corresponding to H(ξ) = |ξ|, arises in the geometric optics limit of the wave equation and models two circular fronts moving outward in the normal direction with speed 1; see Osher and Sethian (1988). As one can see, the main difference occurs when the two fronts merge. Similarly, Figures 6.1(c) and 6.1(d) show the difference between the viscosity and the multivalued solutions to the Burgers equation ∂t v +
1 ∂x v 2 = 0, 2
x ∈ R.
(6.3)
148
S. Jin and P. Markowich and C. Sparber
Eikonal equation (a)
(b)
Burgers equation (c)
(d)
Figure 6.1. Multivalued solution (left) versus viscosity solution (right). (a, b) Zero-level set curves (at different times) of solutions to the eikonal equation (6.2). (c, d) Two solutions to the Burgers equation (6.3) before and after the formation of a shock.
This is simply the second equation in the system (6.1) for V (x) = 0, written in divergence form. The solution begins as a sinusoidal function and then forms a shock. Clearly, the solutions are different after the shock formation. 6.2. Moment closure The moment closure idea was first introduced by Brenier and Corrias (1998) in order to define multivalued solutions to the Burgers equation, and seems to be the natural choice in view of the multiphase WKB expansion given in (2.21). The method was then used numerically in Engquist and Runborg (1996) (see also Engquist and Runborg (2003) for a broad review) and Gosse (2002) to study multivalued solutions in the geometrical optics regime of hyperbolic wave equations. A closely related method is given in Benamou (1999), where a direct computation of multivalued solutions to Hamilton– Jacobi equations is performed. For the semiclassical limit of the Schr¨odinger equation, this was done in Jin and Li (2003) and then Gosse et al. (2003).
¨ dinger equations Methods for semiclassical Schro
149
In order to describe the basic idea, let d = 1 and define m (t, x) = ξ w(t, x, ξ) dξ, = 1, 2, . . . , L ∈ N,
(6.4)
R
i.e., the th moment (in velocity) of the Wigner measure. By multiplying the Liouville equation (3.8) by ξ and integrating over Rξ , one obtains the following moment system: ∂t m0 + ∂x m1 = 0, ∂t m1 + ∂x m2 = −m0 ∂x V, .. . ∂t mL−1 + ∂x mL = −(L − 1)mL−2 ∂x V. Note that this system is not closed , since the equation determining the th moment involves the ( + 1)th moment. The δ-closure As already mentioned in (3.10), locally away from caustics the Wigner measure of uε as ε → 0 can be written as w(t, x, ξ) =
J
ρj (t, x)δ(ξ − vj (t, x)),
(6.5)
j=1
where the number of velocity branches J can in principle be determined a priori from ∇Sin (x). For example, in d = 1, it is the total number of inflection points of v(0, x): see Gosse et al. (2003). Using this particular form (6.5) of w with L = 2J provides a closure condition for the moment system above. More precisely, one can express the last moment m2J as a function of all of the lower-order moments (Jin and Li 2003), i.e., m2J = g(m0 , m1 , . . . , m2J−1 ).
(6.6)
This consequently yields a system of 2J × 2J equations (posed in physical space), which effectively provides a solution of the Liouville equation, before the generation of a new phase, yielding a new velocity vj , j > J. It was shown in Jin and Li (2003) that this system is only weakly hyperbolic, in the sense that the Jacobian matrix of the flux is a Jordan block, with only J distinct eigenvalues v1 , v2 , . . . , vJ . This system is equivalent to J pressureless gas equations (6.1) for (ρj , vj ) respectively. In Jin and Li (2003) the explicit flux function g in (6.6) was given for J ≤ 5. For larger J a numerical procedure was proposed for evaluating g. Since the moment system is only weakly hyperbolic, with phase jumps which are under-compressive shocks (Gosse et al. 2003), standard shock-capturing schemes such as the Lax–Friedrichs scheme and the Godunov scheme
150
S. Jin and P. Markowich and C. Sparber
face severe numerical difficulties as in the computation of the pressure-less gas dynamics: see Bouchut, Jin and Li (2003), Engquist and Runborg (1996) or Jiang and Tadmor (1998). Following the ideas of Bouchut et al. (2003) for the pressure-less gas system, a kinetic scheme derived from the Liouville equation (3.8) with the closure condition (6.6) was used in Jin and Li (2003) for this moment system. The Heaviside closure Another type of closure was introduced by Brenier and Corrias (1998) using the following ansatz, called H-closure, to obtain the J-branch velocities vj , with j = 1, . . . , J: w(t, x, ξ) =
J
(−1)j−1 H(vj (t, x) − ξ).
(6.7)
j=1
This type of closure condition for (3.8) arises from an entropy-maximization principle: see Levermore (1996). Using (6.7), one arrives at (6.6) with L = J. The explicit form of the corresponding function g(m0 , . . . , m2J−1 ) for J < 5 is available analytically in Runborg (2000). Note that this method decouples the computation of velocities vj from the densities ρj . In fact, to obtain the latter, Gosse (2002) has proposed solving the following linear conservation law (see also Gosse and James (2002) and Gosse et al. (2003)): ∂t ρj + ∂x (ρj vj ) = 0,
for j = 1, . . . , N.
The numerical approximation to this linear transport with variable or even discontinuous flux is not straightforward. Gosse et al. (2003) used a semiLagrangian method that uses the method of characteristics, requiring the time step to be sufficiently small for the case of non-zero potentials. The corresponding method is usually referred to as H-closure. Note that in d = 1 the H-closure system is a non-strictly rich hyperbolic system, whereas the δ-closure system described before is only weakly hyperbolic. Thus one expects a better numerical resolution from the H-closure approach, which, however, is much harder to implement in the higher dimension. In d = 1, the mathematical equivalence of the two moment systems was proved in Gosse et al. (2003). Remark 6.1. Multivalued solutions also arise in the high-frequency approximation of nonlinear waves, for example, in the modelling of electron transport in vacuum electronic devices: see, e.g., Granastein, Parker and Armstrong (1999). There the underlying equations are the Euler–Poisson equations, a nonlinearly coupled hyperbolic–elliptic system. The multivalued solution of the Euler–Poisson system also arises for electron sheet initial data, and can be characterized by a weak solution of the Vlasov–Poisson equation: see Majda, Majda and Zheng (1994). Similarly, the work of Li,
¨ dinger equations Methods for semiclassical Schro
151
W¨ohlbier, Jin and Booske (2004) uses the moment closure ansatz (6.6) for the Vlasov–Poisson system; see also W¨ohlbier, Jin and Sengele (2005). For multivalued (or multiphase) solution of the semiclassical limit of nonlinear dispersive waves using the closely related method of Whitham’s modulation theory, we refer to Whitham (1974) and Flaschka, Forest and McLaughlin (1980). Finally, we mention that multivalued solutions also arise in supply chain modelling: see, e.g., Armbruster, Marthaler and Ringhofer (2003). In summary, the moment closure approach yields an Eulerian method defined in the physical space which offers a greater efficiency compared to the computation in phase space. However, when the number of phases J ∈ N becomes very large and/or in dimensions d > 1, the moment systems become very complex and thus difficult to solve. In addition, in high space dimensions, it is very difficult to estimate a priori the total number of phases needed to construct the moment system. Thus it remains an interesting and challenging open problem to develop more efficient and general physicalspace-based numerical methods for the multivalued solutions.
7. Level set methods 7.1. Eulerian approach Level set methods have been recently introduced for computing multivalued solutions in the context of geometric optics and semiclassical analysis. These methods are rather general, and applicable to any (scalar) multi-dimensional quasilinear hyperbolic system or Hamilton–Jacobi equation (see below). We shall now review the basic ideas, following the lines of Jin and Osher (2003). The original mathematical formulation is classical; see for example Courant and Hilbert (1962). Computation of the multivalued phase Consider a general d-dimensional Hamilton–Jacobi equation of the form ∂t S + H(x, ∇S) = 0,
S(0, x) = Sin (x).
(7.1)
For example, in present context of semiclassical analysis for Schr¨ odinger equations, 1 H(x, ξ) = |ξ|2 + V (x), 2 while for applications in geometrical optics (i.e., the high-frequency limit of the wave equation), H(x, ξ) = c(x)|ξ|, with c(x) denoting the local sound (or wave) speed. Introducing, as before, a velocity v = ∇S and taking the gradient of (7.1), one gets an equivalent
152
S. Jin and P. Markowich and C. Sparber
equation (at least for smooth solutions) in the form (Jin and Xin 1998): ∂t v + (∇ξ H(x, v) · ∇)v + ∇x H(x, v) = 0,
v(0, x) = ∇x Sin (x).
(7.2)
Then, in d ≥ 1 space dimensions, define level set functions φj , for j = 1, . . . , d, via ∀(t, x) ∈ R × Rd :
φj (t, x, ξ) = 0 at ξ = vj (t, x).
In other words, the (intersection of the) zero-level sets of all {φj }dj=1 yield the graph of the multivalued solution vj (t, x) of (7.2). Using (7.2) it is easy to see that φj solves the following initial value problem: ∂t φj + {H(x, ξ), φj }φj = 0,
φj (x, ξ, 0) = ξj − vj (0, x),
(7.3)
which is simply the phase space Liouville equation. Note that in contrast to (7.2), this equation is linear and thus can be solved globally in time. In doing so, one obtains, for all t ∈ R, the multivalued solution to (7.2) needed in the asymptotic description of physical observables. See also Cheng, Liu and Osher (2003). Computation of the particle density It remains to compute the classical limit of the particle density ρ(t, x). To do so, a simple idea was introduced in Jin, Liu, Osher and Tsai (2005a). This method is equivalent to a decomposition of the measure-valued initial data (3.9) for the Liouville equation. More precisely, a simple argument based on the method of characteristics (see Jin, Liu, Osher and Tsai (2005b)) shows that the solution to (3.8)–(3.9) can be written as w(t, x, ξ) = ψ(t, x, ξ)
d
δ(φj (t, x, ξ)),
j=1
where φj (t, x, ξ) ∈ Rn , j = 1, . . . , d, solves (7.3) and the auxiliary function ψ(t, x, ξ) again satisfies the Liouville equation (3.8), subject to initial data: ψ(0, x, ξ) = ρin (x). The first two moments of w with respect to ξ (corresponding to the particle ρ and current density J = ρu) can then be recovered through d ψ(t, x, ξ) δ(φj (t, x, ξ)) dξ, ρ(t, x) = Rd
u(t, x) =
1 ρ(t, x)
j=1
ξψ(t, x, ξ) Rd
d
δ(φj (t, x, ξ)) dξ.
j=1
Thus the only time one has to deal with the delta measure is at the numerical output, while during the time evolution one simply solves for φj and ψ, both
¨ dinger equations Methods for semiclassical Schro
153
of which are smooth L∞ -functions. This avoids the singularity problem mentioned earlier, and gives numerical methods with much better resolution than solving (3.8)–(3.9) directly, e.g., by approximating the initial delta function numerically. An additional advantage of this level set approach is that one only needs to care about the zero-level sets of φj . Thus the technique of local level set methods developed in Adalsteinsson and Sethian (1995) and Peng, Merriman, Osher, Zhao and Kang (1999) can be used. One thereby restricts the computational domain to a narrow band around the zero-level set, in order to reduce the computational cost to O(N ln N ), for N computational points in the physical space. This is a nice alternative for dimension reduction of the Liouville equation. When solutions for many initial data need to be computed, fast algorithms can be used: see Fomel and Sethian (2002) or Ying and Cand`es (2006). Example 7.1. Consider (2.1) in d = 1 with periodic potential V (x) = cos(2x + 0.4)), and WKB initial data corresponding to Sin (x) = sin(x + 0.15), π 2 π 2 1 + exp − x − . ρin (x) = √ exp − x + 2 2 2 π Figure 7.1 shows the time evolution of the velocity and the corresponding density computed by the level set method described above. The velocity eventually develops some small oscillations with higher frequency, which require a finer grid to resolve. Remark 7.2. The outlined ideas have been extended to general linear symmetric hyperbolic systems in Jin et al. (2005a). So far, however, level set methods have not been formulated for nonlinear equations, except for the one-dimensional Euler–Poisson equations (Liu and Wang 2007), where a three-dimensional Liouville equation has to be used in order to calculate the corresponding one-dimensional multivalued solutions. 7.2. The Lagrangian phase flow method While the Eulerian level set method is based on solving the Liouville equation (3.8) on a fixed mesh, the Lagrangian (or particle) method , is based on solving the Hamiltonian system (3.6), which is simply the characteristic flow of the Liouville equation (3.7). In geometric optics this idea is referred to as ray tracing (Cerven´ y 2001), and the curves x(t, y, ζ), ξ(t, y, ζ) ∈ Rd , obtained by solving (3.6), are usually called bi-characteristics. Remark 7.3. Note that finding an efficient way to numerically solve Hamiltonian ODEs, such as (3.6), is a problem of great (numerical) interest in its own right: see, e.g., Leimkuhler and Reich (2004).
154
S. Jin and P. Markowich and C. Sparber
(a)
(b)
Figure 7.1. Example 7.1: (a) multivalued velocity v at time T = 0.0, 6.0, and 12.0, (b) corresponding density ρ.
¨ dinger equations Methods for semiclassical Schro
155
Here we shall briefly describe a fast algorithm, called the phase flow method in Ying and Cand`es (2006), which is very efficient if multiple initial data, as is often the case in practical applications, are to be propagated by the Hamiltonian flow (3.6). Let Ft : R2d → R2d be the phase flow defined by Ft (y, ζ) = (x(t, y, ζ), ξ(t, y, ζ)), t ∈ R. A manifold M ⊂ Rdx × Rdξ is said to be invariant if Ft (M) ⊂ M. For the autonomous ODEs, such as (3.6), a key property of the phase map is the one-parameter group structure, Ft ◦ Fs = Ft+s . Instead of integrating (3.6) for each individual initial condition (y, ζ), up to, say, time T , the phase flow method constructs the complete phase map FT . To this end, one first constructs the Ft for small times using standard ODE integrators and then builds up the phase map for larger times via a local interpolation scheme together with the group property of the phase flow. Specifically, fix a small time τ > 0 and suppose that T = 2n τ . Step 1. Begin with a uniform or quasi-uniform grid on M. Step 2. Compute an approximation of the phase map Fτ at time τ . The value of Fτ at each grid point is computed by applying a standard ODE or Hamiltonian integrator with a single time step of length τ . The value of Fτ at any other point is defined via a local interpolation. Step 3. For k = 1, . . . , n, construct F2k τ using the group relation F2k τ = F2k−1 τ ◦ F2k−1 τ . Thus, for each grid point (y, ζ), F2k τ (y, ζ) = F2k−1 τ (F2k−1 τ (y, ζ)), while F2k τ is defined via a local interpolation at any other point. When the algorithm terminates, one obtains an approximation of the whole phase map at time T = 2n τ . This method is clearly much faster than solving each for initial condition independently.
8. Gaussian beam methods: Lagrangian approach A common numerical problem with all numerical approaches based on the Liouville equation with mono-kinetic initial data (3.8)–(3.9) is that the particle density ρ(t, x) blows up at caustics. Another problem is the loss of phase information when passing through a caustic point, i.e., the loss of the Keller–Maslov index (Maslov 1981). To this end, we recall that the Wigner measure only sees the gradient of the phase: see (3.10). The latter can be fixed by incorporating this index into a level set method as was done in Jin and Yang (2008)). Nevertheless, one still faces the problem that any numerical method based on the Liouville equation is unable to handle wave
156
S. Jin and P. Markowich and C. Sparber
interference effects. The Gaussian beam method (or Gaussian wave packet approach, as it is called in quantum chemistry: see Heller (2006)), is an efficient approximate method that allows an accurate computation of the wave amplitude around caustics, and in addition captures the desired phase information. This now classical method was developed in Popov (1982), Ralston (1982) and Hill (1990), and has seen increasing activity in recent years. In the following, we shall describe the basic ideas, starting with its classical Lagrangian formulation.
8.1. Lagrangian dynamics of Gaussian beams Similar to the WKB method, the approximate Gaussian beam solution is given in the form ϕε (t, x, y) = A(t, y) e iT (t,x,y)/ε ,
(8.1)
where the variable y = y(t, y0 ) will be determined below and the phase T (t, x, y) is given by 1 T (t, x, y) = S(t, y) + p(t, y) · (x − y) + (x − y) M (t, y)(x − y) + O(x − y|3 ). 2 This is reminiscent of the Taylor expansion of the phase S around the point y, upon identifying p = ∇S ∈ Rd , M = ∇2 S, the Hessian matrix. The idea is now to allow the phase T to be complex-valued (in contrast to WKB analysis), and choose the imaginary part of M ∈ Cn×n positive definite so that (8.1) indeed has a Gaussian profile. Plugging the ansatz (8.1) into the Schr¨ odinger equation (2.1), and ignoring the higher-order terms in both ε and (y − x), one obtains the following system of ODEs: dy = p, dt dM = −M 2 − ∇2y V, dt 1 dS = |p|2 − V, dt 2
dp = −∇y V, dt
(8.2) (8.3)
1 dA = − Tr(M ) A, dt 2
(8.4)
where p, V, M, S and A have to be understood as functions of (t, y(t, y0 )). The latter defines the centre of a Gaussian beam. Equations (8.2)–(8.4) can be considered as the Lagrangian formulation of the Gaussian beam method, with (8.2) furnishing a classical ray-tracing algorithm. We further note that (8.3) is a Riccati equation for M . We state the main properties of (8.3), (8.4) in the following theorem, the proof of which can be found in Ralston (1982) (see also Jin, Wu and Yang (2008b)).
¨ dinger equations Methods for semiclassical Schro
157
Theorem 8.1. Let P (t, y(t, y0 )) and R(t, y(t, y0 )) be the (global) solutions of the equations dR dP = R, = −(∇2y V )P, (8.5) dt dt with initial conditions P (0, y0 ) = Id,
R(0, y0 ) = M (0, y0 ),
(8.6)
where Id is the identity matrix and Im(M (0, y0 )) is positive definite. Assume that M (0, y0 ) is symmetric. Then, for each initial position y0 , we have the following properties. (1) P (t, y(t, y0 )) is invertible for all t > 0. (2) The solution to equation (8.3) is given by M (t, y(t, y0 )) = R(t, y(t, y0 ))P −1 (t, y(t, y0 )).
(8.7)
(3) M (t, y(t, y0 )) is symmetric and Im(M (t, y(t, y0 ))) is positive definite for all t > 0. (4) The Hamiltonian H = 12 |p|2 + V is conserved along the y-trajectory, as is (A2 det P ), i.e., A(t, y(t, y0 )) can be computed via 1/2 , (8.8) A(t, y(t, y0 )) = (det P (t, y(t, y0 )))−1 A2 (0, y0 ) where the square root is taken as the principal value. In particular, since (A2 det P ) is a conserved quantity, we infer that A does not blow up along the time evolution (provided it is initially bounded). 8.2. Lagrangian Gaussian beam summation It should be noted that a single Gaussian beam given by (8.1) is not an asymptotic solution of (2.1), since its L2 (R2d )-norm goes to zero, in the classical limit ε → 0. Rather, one needs to sum over several Gaussian beams, the number of which is O(ε−1/2 ). This is referred to as the Gaussian beam summation; see for example Hill (1990). In other words, one first needs to approximate given initial data through Gaussian beam profiles. For WKB initial data (2.18), a possible way to do so is given by the next theorem, proved by Tanushev (2008). Theorem 8.2. Let the initial data be given by uεin (x) = ain (x) e iSin (x)/ε , with ain ∈ C 1 (Rd ) ∩ L2 (Rd ) and Sin ∈ C 3 (Rd ), and define ϕε (x, y0 ) = ain (y0 ) e iT (x,y0 )/ε ,
158
S. Jin and P. Markowich and C. Sparber
where 1 T (x, y0 ) = Tα (y0 ) + Tβ · (x − y0 ) + (x − y0 ) Tγ (x − y0 ), 2 Tα (y0 ) = Sin (y0 ), Tβ (y0 ) = ∇x Sin (y0 ), Tγ (y0 ) = ∇2x Sin (y0 ) + i Id. Then
ε uin − (2πε)−d/2
rθ (· − y0 )ϕ (·, y0 ) dy0 d
1
ε
R
L2
≤ Cε 2 ,
where rθ ∈ C0∞ (Rd ), rθ ≥ 0 is a truncation function with rθ ≡ 1 in a ball of radius θ > 0 around the origin, and C is a constant related to θ. In view of Theorem 8.2, one can specify the initial data for (8.2)–(8.4) as y(0, y0 ) = y0 ,
p(0, y0 ) = ∇x Sin (y0 ),
∇2x Sin (y0 )
M (0, y0 ) = S(0, y0 ) = Sin (y0 ),
+ i Id, A(0, y0 ) = ain (y0 ).
(8.9) (8.10) (8.11)
Then, the Gaussian beam solution approximating the exact solution of (2.1) is given by rθ (x − y(t, y0 ))ϕε (t, x, y(t, y0 )) dy0 . uεG (t, x) = (2πε)−d/2 Rd
In discretized form this reads uεG (t, x)
≈ (2πε)
−d/2
Ny0
rθ (x − y(t, y0j ))ϕε (t, x, y0j )∆y0 ,
j=1
where the y0j are equidistant mesh points, and Ny0 is the number of the beams initially centred at y0j . Remark 8.3. Note that the cut-off error introduced via rθ becomes large when the truncation parameter θ is taken too small. On the other hand, a big θ for wide beams makes the error in the Taylor expansion of T large. As far as we know, it is still an open mathematical problem to determine an optimal size of θ when beams spread. However, for narrow beams one can take a fairly large θ, which makes the cut-off error almost zero. For example, a one-dimensional constant solution can be approximated by ∆y0 −(x − y0 )2 −(x − y0j )2 1 √ √ exp exp dy0 ≈ , 1= 2ε 2ε 2πε 2πε R j in which rθ ≡ 1.
¨ dinger equations Methods for semiclassical Schro
159
8.3. Higher-order Gaussian beams The above Gaussian beam method can be extended to higher order in ε: see Tanushev (2008), Jin et al. (2008b) and Liu and Ralston (2010). For notational convenience we shall only consider the case d = 1. Consider the Schr¨odinger equation (2.1) with initial data uεin (x) = e iSin (x)/ε
N
εj aj (x),
x ∈ R.
j=0
Let a ray y(t, y0 ) start at a point y0 ∈ R. Expand Sin (x) in a Taylor series around y0 : Sin (x) =
k+1
Sβ (y0 )(x − y0 )β + O(|x − y0 |β+1 ).
β=0
Then, a single kth-order Gaussian beam takes the form
[k/2]−1
ϕεk (t, x, y)
=
εj Aj (t, y) e iT (t,x,y)/ε ,
j=1
where the phase is given by 1 1 Tβ (t, y)(x−y)β , T (t, x, y) = T0 (t, y)+p(t, y)(x−y)+ M (t, y)(x−y)2 + 2 β! k+1
β=3
and the amplitude reads Aj =
k−2j−1 β=0
1 Aj,β (t, y)(x − y)β . β!
Here the bi-characteristic curves (y(t, y0 ), p(t, y(t, y0 ))) satisfy the Hamiltonian system (8.2) with initial data y(0, y0 ) = y0 ,
p(0, y0 ) = ∂y S0 (y0 ).
In addition, the equations for the phase coefficients along the bi-characteristic curves are given by p2 dT0 = − V, dt 2 dM = −M 2 − ∂y2 V, dt β dTβ (β − 1)! =− Tγ Tβ−γ+2 − ∂yβ V, dt (γ − 1)!(β − γ)! γ=2
160
S. Jin and P. Markowich and C. Sparber
for β = 3, . . . , k + 1. These equations are equipped with initial data T0 (0, y0 ) = S0 (y0 ),
M (0, y0 ) = ∂y2 S0 (y0 ) + i Id,
Tβ (0, y0 ) = Sβ (y0 ).
Finally, the amplitude coefficients are obtained recursively by solving the transport equations for Aj,β with β ≤ k − 2j − 1, starting from dA0,0 1 = − Tr(M (t, z))A0,0 , dt 2
(8.12)
with initial data Aj,β (0, y0 ) = aβ (y0 ). In d = 1, the kth-order Gaussian beam superposition is thus formed by ε −1/2 rθ (x − y(t, y0 ))ϕεk (t, x, y(t, y0 )) dy0 , (8.13) uG,k (t, x) = (2πε) R ∞ C0 (R; R)
is some cut-off function. For this type where, as before, rθ ∈ of approximation, the following theorem was proved in Liu, Runborg and Tanushev (2011). odinger Theorem 8.4. If uε (t, x) denotes the exact solution to the Schr¨ equation (2.1) and uεG,k is the kth-order Gaussian beam superposition, then sup uε (t, ·) − uεG,k (t, ·) ≤ C(T )εk/2 ,
(8.14)
|t|
for any T > 0.
9. Gaussian beam methods: Eulerian approach 9.1. Eulerian dynamics of Gaussian beams The Gaussian beam method can be reformulated in an Eulerian framework. To this end, let us first define the linear Liouville operator as L = ∂ t + ξ · ∇y − ∇ y V · ∇ξ . In addition, we shall denote Φ := (φ1 , . . . , φd ), where φj is the level set function defined in (7.1) and (7.3). Using this, Jin et al. (2005b) and Jin and Osher (2003) showed that one can obtain from the original Lagrangian formulation (8.2)–(8.4) the following (inhomogeneous) Liouville equations for velocity, phase and amplitude, respectively: LΦ = 0, 1 LS = |ξ|2 − V, 2 1 LA = Tr (∇ξ Φ)−1 ∇y Φ A. 2
(9.1) (9.2) (9.3)
¨ dinger equations Methods for semiclassical Schro
161
In addition, if one introduces the quantity (Jin et al. 2005b) f (t, y, ξ) = A2 (t, y, ξ) det(∇ξ Φ), then f (t, y, ξ) again satisfies the Liouville equation, i.e., Lf = 0.
(9.4)
Two more inhomogeneous Liouville equations, which are the Eulerian version of (8.5) for P and R, were introduced in Leung, Qian and Burridge (2007) to construct the Hessian matrix. More precisely, one finds LR = −(∇2y V )P,
(9.5)
LP = R.
(9.6)
Note that the equations (9.1)–(9.4) are real , while (9.5) and (9.6) are complex and consist of 2n2 equations. Gaussian beam dynamics using complex level set functions In Jin et al. (2008b) the following observation was made. Taking the gradient of the equation (9.1) with respect to y and ξ separately, we have L(∇y Φ) = ∇2y V ∇ξ Φ,
(9.7)
L(∇ξ Φ) = −∇y Φ.
(9.8)
Comparing (9.5)–(9.6) with (9.7)–(9.8), one observes that −∇y Φ and ∇ξ Φ satisfy the same equations as R and P , respectively. Since the Liouville operator is linear, one can allow Φ to be complex-valued and impose for −∇y Φ, ∇ξ Φ the same initial conditions as for R and P , respectively. By doing so, R = −∇x Φ, P = ∇ξ Φ hold true for any time t ∈ R. In view of (8.6) and (8.10), this suggests the following initial condition for Φ: Φ0 (y, ξ) = −iy + (ξ − ∇y S0 ).
(9.9)
With this observation, one can now solve (9.1) for complex Φ, subject to initial data (9.9). Then the matrix M can be constructed by M = −∇y Φ(∇ξ Φ)−1 ,
(9.10)
where the velocity v = ∇y S is given by the intersection of the zero-level contours of the real part of Φ, i.e., for each component φj , Re(φj (t, y, ξ)) = 0,
at ξ = v(t, y) = ∇y S.
(9.11)
Note that in order to compute v, S and M , one only needs to solve d complex-valued homogeneous Liouville equations (9.1). The Eulerian level
162
S. Jin and P. Markowich and C. Sparber
set method of Jin et al. (2008b) (in complex phase space) can then be summarized as follows. Step 1. Solve (9.1) for Φ complex , with initial condition (9.9), and obtain the velocity v by the intersection of the zero-level sets of Re φj , j = 1, . . . , n. Step 2. Use −∇y Φ and ∇ξ Φ to construct M by (9.10) (note that these quantities are already available from the first step after discretizing the Liouville equation for Φ). Step 3. Integrate the velocity v along the zero-level sets (Gosse 2002, Jin and Yang 2008) to get the phase S. To do so, one performs a numerical integration following each branch of the velocity. The integration constants are obtained by the boundary condition and the fact that the multivalued phase is continuous when passing from one branch to the other. For example, if one considers a bounded domain [a, b] in space dimension d = 1, the phase function is given by x 1 t 2 v (τ, a) dτ + v(t, y) dy + S(0, a). (9.12) S(t, x) = −V (a)t − 2 0 a For more details on this and its extension to higher dimensions, see Jin and Yang (2008). Step 4. Solve (9.4) with the initial condition f0 (y, ξ) = A20 (y, ξ). Then amplitude A is given by A = (det(∇ξ Φ)−1 f )1/2 ,
(9.13)
where the square root has to be understood as the principal value. (We also refer to Jin, Wu and Yang (2011) for a more elaborate computation of A.) Note that all functions appearing in Steps 2–4 only need to be solved locally around the zero-level sets of Re φj , j = 1, . . . , n. Thus, the entire algorithm can be implemented using the local level set methods of Osher, Cheng, Kang, Shim and Tsai (2002) and Peng et al. (1999). For a given mesh size ∆y, the computational cost is therefore O((∆y)−d ln(∆y)−1 ), about the same as the local level set methods for geometrical optics computation: see Jin et al. (2005b). Remark 9.1. If one is only interested in computing the classical limit of (the expectation values of) physical observables, one observes that the only in (9.12) which affects a quadratic observable density for fixed time t is term x a v(t, y) dy. Thus, as long as one is only interested in physical observables, one can simply take x S(t, x) = v(t, y) dy (9.14) a
¨ dinger equations Methods for semiclassical Schro
163
in the numerical simulations. That M and A are indeed well-defined via (9.10) and (9.13) is justified by the following theorem (which can be seen as the Eulerian version of Theorem 8.1), proved in Jin et al. (2008b). Theorem 9.2. Let Φ = Φ(t, y, ξ) ∈ C be the solution of (9.1) with initial data (9.9). Then, the following properties hold: (1) ∇ξ Φ is non-degenerate for all t ∈ R, (2) Im −∇y Φ(∇ξ Φ)−1 is positive definite for all t ∈ R, y, ξ ∈ Rd . Although det Re(∇ξ Φ) = 0 at caustics, the complexified Φ makes ∇ξ Φ non-degenerate, and the amplitude A, defined in (9.13), does not blow up at caustics. 9.2. Eulerian Gaussian beam summation As before, we face the problem of Gaussian beam summation, i.e., in order to reconstruct the full solution uε a superposition of single Gaussian beams has to be considered. To this end, we define a single Gaussian beam, obtained through the Eulerian approach, by ϕ˜ε (t, x, y, ξ) = A(t, y, ξ) eiT (t,x,y,ξ)/ε ,
(9.15)
where A is solved via (9.13), and 1 T (t, x, y, ξ) = S(t, y, ξ) + ξ · (x − y) + (x − y) M (t, y, ξ)(x − y). 2 Then, the wave function is constructed via the following Eulerian Gaussian beam summation formula (Leung et al. 2007): u ˜εG (t, x)
= (2πε)
−d/2
Rd ×Rd
rθ (x − y)ϕ˜ε (t, x, y, ξ)
d
δ(Re(φj )) dξ dy,
j=1
which is consistent with the Lagrangian summation formula (8.2). Indeed, the above given double integral for uεG can be evaluated as a single integral in y as follows. We again denote by vj , j = 1, . . . , J the jth branch of the multivalued velocity and write J ϕ˜ε (t, x, y, vk ) ε −d/2 dy. (9.16) u ˜G (t, x) = (2πε) rθ (x − y) | det(Re(∇ξ Φ)ξ=vj )| Rd j=1
However, since det Re(∇ξ Φ) = 0 at caustics, a direct numerical integration of (9.16) loses accuracy around caustics. To get better accuracy, one can
164
S. Jin and P. Markowich and C. Sparber
split (9.16) into two parts, J (2πε)−d/2 rθ (x − y) I1 = j=1
I2 =
J j=1
where
Ω1
Ω2
(2πε)−d/2 rθ (x − y)
Ω1 := y
Ω2 := y
ϕ˜ε (t, x, y, vk ) dy, det(Re(∇ξ Φ)ξ=vj )
(9.17)
ϕ˜ε (t, x, y, vk ) dy, det(Re(∇ξ Φ)ξ=vj )
(9.18)
: det(Re(∇p φ)(t, y, pj )) ≥ τ , : det(Re(∇p φ)(t, y, pj )) < τ ,
with τ being a small parameter. The latter is chosen sufficiently small to minimize the cost of computing (9.18), yet large enough to make I1 a regular integral. The regular integral I1 can then be approximated by a standard quadrature rule, such as the trapezoid quadrature rule, while the singular integral I2 is evaluated by the semi-Lagrangian method introduced in Leung et al. (2007). Remark 9.3. When the velocity contours are complicated due to large numbers of caustics, implementation of the local semi-Lagrangian method is hard. In such situations one can use a discretized δ-function method for numerically computing (9.18), as was done in Wen (2010). In this method one needs to numerically solve (9.2) in order to obtain the phase function, since all values of φj near the support of δ(Re(φj )) are needed to evaluate (9.18). Example 9.4. This is an example from Jin et al. (2008b). It considers the free motion of particles in d = 1 with V (x) = 0. The initial conditions for the Schr¨ odinger equation (2.1) are induced by ρin (x) = exp(−50x2 ),
vin (x) = ∂x S0 (x) = − tanh(5x).
Figure 9.1 shows the l∞ -errors between the square modulus of uε , the exact solution of the Schr¨odinger equation (2.1), and the approximate solution constructed by: (i) the level set method described in Section 7, (ii) the level set method with Keller–Maslov index built in (Jin and Yang 2008), and (iii) the Eulerian Gaussian beam method described above. As one can see, method (ii) improves the geometric optics solution (i) away from caustics, while the Gaussian beam method offers a uniformly small error even near the caustics. Compared to the Lagrangian formulation based on solving the ODE system (8.2)–(8.4), the Eulerian Gaussian beam method has the advantage of maintaining good numerical accuracy since it is based on solving PDEs on
¨ dinger equations Methods for semiclassical Schro
(a)
(b)
(c)
Figure 9.1. Example 9.4: numerical errors between the solution of the Schr¨ odinger equation and (a) the geometrical optics solution, (b) the geometrical optics with phase shift built in, and (c) the Gaussian beam method. Caustics are around x = ±0.18.
165
166
S. Jin and P. Markowich and C. Sparber
fixed grids. Moreover, higher-order (in ε) Eulerian Gaussian beam methods have been constructed: see Liu and Ralston (2010) and Jin et al. (2011). Remark 9.5. Research on Gaussian beam methods is of great recent interest in the applied mathematics community: see, e.g., Leung et al. (2007), Jin et al. (2008b) and Leung and Qian (2009) for Eulerian formulations, Tanushev (2008), Motamed and Runborg (2010), Liu and Ralston (2010), Bougacha, Akian and Alexandre (2009) and Liu et al. (2011) for error estimates, and Tanushev, Engquist and Tsai (2009), Ariel, Engquist, Tanushev and Tsai (2011), Qian and Ying (2010) and Yin and Zheng (2011) for initial data decompositions. 9.3. Frozen Gaussian approximations The construction of the Gaussian beam approximation is based on the truncation of the Taylor expansion of the phase T (t, x, y) (8.1) around the beam centre y. Hence it loses accuracy when the width of the beam becomes large, i.e., when the imaginary part of M (t, y) in (8.1) becomes small so that the Gaussian function is no longer localized . This happens, for example, when the solution of the Schr¨odinger equation spreads (namely, the ray determined by (8.2) diverges), which can be seen as the time-reversed situation of caustic formation. The corresponding loss in the numerical computation can be overcome by re-initialization every once in a while: see Tanushev et al. (2009), Ariel et al. (2011), Qian and Ying (2010) and Yin and Zheng (2011). However, this approach increases the computational complexity in particular, when beams spread quickly. The frozen Gaussian approximation (as it is referred to in quantum chemistry), first proposed in Heller (1981), uses Gaussian functions with fixed widths to approximate the exact solution uε . More precisely, instead of using Gaussian beams only in the physical space, the frozen Gaussian approximation uses a superposition of Gaussian functions in phase space. That is why the method is also known by the name coherent state approximation. To this end, we first decompose the initial data into several Gaussian functions in phase space, 1 2 ε uεin (y) e−( ip0 ·(y−y0 )− 2 |y−y0 | )/ε dy, ψ (y0 , p0 ) = Rd
and then propagate the centre of each function (y(t), p(t)) along the Hamiltonian flow (8.2), subject to initial data at (y0 , p0 ). The frozen Gaussian beam solution takes the form uεFG (t, x) = (2πε)
−3d/2
1
Rd ×Rd
2 )/ε
a(t, y0 , p0 )ψ(y0 , p0 ) e( ip(t)·(x−y(t))− 2 |x−y(t)|
dp0 dy0 ,
¨ dinger equations Methods for semiclassical Schro
167
where the complex-valued amplitude a(t, y0 , p0 ), is the so-called Herman– Kluk pre-factor : see Herman and Kluk (1984). Since the width of the Gaussians is fixed, one does not encounter the problem of beam spreading here. However, since this method is based in phase space, the computational cost is considerably higher than the standard Gaussian beam methods. For subsequent developments in this direction, see Herman and Kluk (1984), Kay (1994, 2006), Robert (2010), Swart and Rousse (2009) and Lu and Yang (2011).
10. Asymptotic methods for discontinuous potentials Whenever a medium is heterogeneous, the potential V can be discontinuous, creating a sharp potential barrier or interface where waves can be partially reflected and transmitted (as in the Snell–Descartes Law of Refraction). This gives rise to new mathematical and numerical challenges not present in the smooth potential case. Clearly, the semiclassical limit (3.8)–(3.9) does not hold at the barrier. Whenever V is discontinuous, the Liouville equation (3.8) contains characteristics which are discontinuous or even measure-valued. To this end, we recall that the characteristic curves (x(t), ξ(t)) are determined by the Hamiltonian system (3.6). The latter is a nonlinear system of ODEs whose right-hand side is not Lipschitz due to the singularity in ∇x H(x, ξ), and thus the classical well-posedness theory for the Cauchy problem of the ODEs fails. Even worse, the coefficients in the Liouville equation are in general not even BV (i.e., of bounded variation), for which almost everywhere solutions were introduced by DiPerna and Lions (1989) and Ambrosio (2004). Analytical studies of semiclassical limits in situations with interface were carried out by, e.g., Bal, Keller, Papanicolaou and Ryzhik (1999b), Miller (2000), Nier (1995, 1996) and Benedetto, Esposito and Pulvirenti (2004) using more elaborate Wigner transformation techniques, such as two-scale Wigner measures. 10.1. The interface condition In order to allow for discontinuous potentials, one first needs to introduce a notion of solutions of the underlying singular Hamiltonian system (3.6). This can be done by providing interface conditions for reflection and transmission, based on Snell’s law. The solution so constructed will give the correct transmission and reflection of waves through the barrier, obeying the laws of geometrical optics. Figure 10.1 (taken from Jin, Liao and Yang (2008a)) shows typical cases of wave transmissions and reflections through an interface. When the interface is rough, or in higher dimensions, the scattering can be diffusive, in which the transmitted or reflected waves can move in all directions: see
168
S. Jin and P. Markowich and C. Sparber
Reflection
A
B
Reflection
A
B
Transmission
Transmission
Incident
Incident
(a)
(b)
Figure 10.1. Wave transmissions and reflections through an interface.
Figure 10.1(b). However, in this section we will not discuss the diffusive interface, which was treated analytically in Bal et al. (1999b) and numerically in Jin et al. (2008a). An Eulerian interface condition Jin and Wen (2006a) provide an interface condition connecting the Liouville equations at both sides of a given (sharp) interface. Let us focus here only on the case of space dimension d = 1 and consider a particle moving with velocity ξ > 0 towards the barrier. The interface condition at a given fixed time t is given by w(t, x+ , ξ + ) = αT w(t, x− , ξ − ) + αR w(t, x+ , −ξ + ).
(10.1)
Here the superscripts ‘±’ represent the right and left limits of the quantities, αT ∈ [0, 1] and αR ∈ [0, 1] are the transmission and reflection coefficients respectively, satisfying αR + αT = 1. For a sharp interface x+ = x− , however, ξ + and ξ − are connected by the Hamiltonian preservation condition H(x+ , ξ + ) = H(x− , ξ − ).
(10.2)
The latter is motivated as follows. In classical mechanics, the Hamiltonian H = 12 ξ 2 + V (x) is conserved along the particle trajectory, even across the barrier. In this case, αT , αR = 0 or 1, i.e., a particle can be either completely transmitted or completely reflected. In geometric optics (corresponding to H(x, ξ) = c(x)|ξ|), condition (10.2) is equivalent to Snell’s Law of Refraction for a flat interface (Jin and Wen 2006b), i.e., waves can be partially transmitted or reflected.
¨ dinger equations Methods for semiclassical Schro
169
Remark 10.1. In practical terms, the coefficients αT and αR are determined from the original Schr¨odinger equation (2.1) before the semiclassical limit is taken. Usually one invokes stationary scattering theory to do so. Thus (10.1) represents a multiscale coupling between the (macroscopic) Liouville equation and the (microscopic) Schr¨odinger (or wave) equation. Furthermore, by incorporating the diffraction coefficients, determined from the geometrical theory of diffraction developed in Keller and Lewis (1995), into the interface condition, one could even simulate diffraction phenomena near boundaries, interfaces or singular geometries (Jin and Yin 2008a, 2008b, 2011). The well-posedness of the initial value problem of the singular Liouville equation with the interface condition (10.1) was established in Jin and Wen (2006a), using the method of characteristics. To determine a solution at (x, p, t) one traces back along the characteristics determined by the Hamiltonian system (3.6) until hitting the interface. At the interface, the solution bifurcates according to the interface condition (10.1). One branch of the solution thereby corresponds to the transmission of waves and the other to the reflection. This process continues until one arrives at t = 0. The interface condition (10.1) thus provides a generalization of the method of characteristics. A Lagrangian Monte Carlo particle method for the interface A notion of the solution of the (discontinuous) Hamiltonian system (3.6) was introduced in Jin (2009) (see also Jin and Novak (2006)) using a probability interpretation. One thereby solves the system (3.6) using a standard ODE or Hamiltonian solver, but at the interface, the following Monte Carlo solution can be constructed (we shall only give a solution in the case of ξ − > 0; the other case is similar). (1) With probability αR , the particle (wave) is reflected with x → x,
ξ − → −ξ − .
(10.3)
(2) With probability αT , the particle (wave) is transmitted, with x → x,
ξ + obtained from ξ − using (10.2).
(10.4)
Although the original problem is deterministic, this probabilistic solution allows one to go beyond the interface with the new value of (x, ξ) defined in (10.3)–(10.4). This is the Lagrangian formulation of the solution determined by using the interface condition (10.1). This is the basis of a (Monte-Carlobased) particle method for thin quantum barriers introduced in Jin and Novak (2007).
170
S. Jin and P. Markowich and C. Sparber
10.2. Modification of the numerical flux at the interface A typical one-dimensional semi-discrete finite difference method for the Liouville equation (3.7) is ∂t wij + ξj
− + wi+ − wi− 1 1 ,j ,j 2
2
∆x
− DVi
wi,j+ 1 − wi,j− 1 2
2
∆ξ
= 0.
Here wij is the cell average or pointwise value of w(t, xi , ξj ) at fixed t. The numerical fluxes wi+ 1 ,j , wi,j+ 1 are typically defined by a (first-, or higher2 2 order) upwind scheme, and DVi is some numerical approximation of ∂x V at x = xi . When V is discontinuous, such schemes face difficulties when the Hamiltonian is discontinuous, since ignoring the discontinuity of V in the actual numerical computation will result in solutions which are inconsistent with the notion of the physically relevant solution, defined in the preceding subsection. Even with a smoothed Hamiltonian, it is usually impossible (at least in the case of partial transmission and reflection) to obtain transmission and reflection with the correct transmission and reflection coefficients. A smoothed V will also give a severe time step constraint like ∆t ∼ O(∆x∆ξ): see, e.g., Cheng, Kang, Osher, Shim and Tsai (2004). This is a parabolic-type CFL condition, despite the fact that we are solving a hyperbolic problem. A simple method to solve this problem was introduced by Jin and Wen (2005, 2006a). The basic idea is to build the interface condition (10.1) into the numerical flux , as follows. Assume V is discontinuous at xi+1/2 . First one should avoid discretizing V across the interface at xi+1/2 . One possible discretization is DVk =
− + Vk+1/2 − Vk−1/2
∆x
,
for k = i, i + 1,
where, for example, ± = Vk+1/2
lim
x→xk+1/1 ±0
V (x).
The numerical flux in the ξ direction, Wi,j±1/2 , can be the usual numerical flux (for example, the upwind scheme or its higher-order extension). To ± , without loss of generality, consider the define the numerical flux wi+1/2,j − case ξj > 0. Using the upwind scheme, wi+ = wij . However, 1 ,j 2
+ wi+1/2,j
=
+ w(x+ i+1/2 , ξj )
= =
− + + αT w(x− i+1/2 , ξj ) + αR w(xi+1/2 , −ξj ) αT wi (ξj− ) + αR wi+1,−j ,
while ξ − is obtained from (10.2) with ξj+ = ξj . Since ξ − may not be a
¨ dinger equations Methods for semiclassical Schro
171
grid point, one has to define it approximately. A simple approach is to locate the two cell centres that bound it, then use a linear interpolation to approximate the needed numerical flux at ξj− . The case of ξj < 0 is treated similarly. The detailed algorithm to generate the numerical flux is given in Jin and Wen (2005, 2006a). This numerical scheme overcomes the aforementioned analytic and numerical difficulties. In particular, it possesses the following properties. (1) It produces the correct physical solution crossing the interface (as defined in the previous subsection). In particular, in the case of geometric optics, this solution is consistent with the Snell–Descartes Law of Refraction at the interface. (2) It allows a hyperbolic CFL condition ∆t = O(∆x, ∆ξ). The idea outlined above has its origin in so-called well-balanced kinetic schemes for shallow water equations with bottom topography: see Perthame and Simeoni (2001). It has been applied to computation of the semiclassical limit of the linear Schr¨ odinger equation with potential barriers in Jin and Wen (2005), and the geometrical optics limit with complete transmission/reflection in Jin and Wen (2006b), for thick interfaces, and Jin and Wen (2006a), for sharp interfaces. Positivity and both l1 and l∞ stabilities were also established, under a hyperbolic CFL condition. For piecewise constant Hamiltonians, an l1 -error estimate of the first-order finite difference of this type was established in Wen (2009), following Wen and Jin (2009). Remark 10.2. Let us remark that this approach has also been extended to high-frequency elastic waves (Jin and Liao 2006), and high-frequency waves in random media with diffusive interfaces (Jin et al. 2008a). When the initial data are measure-valued, such as (3.9), the level set method introduced in Jin et al. (2005b) becomes difficult for interfaces where waves undergo partial transmissions and reflections, since one needs to increase the number of level set functions each time a wave hits the interface. A novel method to get around this problem has been introduced in Wei, Jin, Tsai and Yang (2010). It involves two main ingredients. (1) The solutions involving partial transmissions and partial reflections are decomposed into a finite sum of solutions, obtained by solving problems involving only complete transmissions or complete reflections. For the latter class of problems, the method of Jin et al. (2005b) applies. (2) A re-initialization technique is introduced such that waves coming from multiple transmissions and reflections can be combined seamlessly as new initial value problems. This is implemented by rewriting the sum of several delta functions as one delta measure with a suitable weight, which can easily be implemented numerically.
172
S. Jin and P. Markowich and C. Sparber
10.3. Semiclassical computation of quantum barriers Correct modelling of electron transport in nano-structures, such as resonant tunnelling diodes, superlattices or quantum dots, requires the treatment of quantum phenomena in highly localized regions within the devices (so-called quantum wells), while the rest of the device can be dealt with by classical mechanics. However, solving the Schr¨ odinger equation in the entire physical domain is usually too expensive, and thus it is attractive to use a multiscale approach as given in Ben Abdallah, Degond and Gamba (2002): that is, solve the quantum mechanics only in the quantum well, and couple the solution to classical mechanics outside the well. To this end, the following semiclassical approach for thin quantum barriers was proposed in Jin and Novak (2006). Step 1. Solve the time-independent Schr¨ odinger equation (either analytically or numerically) for the local barrier well to determine the scattering data, i.e., the transmission and reflection coefficients αT , αR . Step 2. Solve the classical Liouville equation elsewhere, using the scattering data generated in Step 1 and the interface condition (10.1) given above. The results for d = 1 and d = 2 given in Jin and Novak (2006, 2007) demonstrate the validity of this approach whenever the well is either very thin (i.e., of the order of only a few ε) or well separated. In higher dimensions, the interface condition (10.1) needs to be implemented in the direction normal to interface, and the interface condition may be non-local for diffusive transmissions or reflections (Jin and Novak 2007). This method correctly captures both the transmitted and the reflected quantum waves, and the results agree (in the sense of weak convergence) with the solution obtained by directly solving the Schr¨odinger equation with small ε. Since one obtains the quantum scattering information only in a preprocessing step (i.e., Step 1), the rest of the computation (Step 2) is classical, and thus the overall computational cost is the same as for computing classical mechanics. Nevertheless, purely quantum mechanical effects, such as tunnelling, can be captured. If the interference needs to be accounted for, then such Liouville-based approaches are not appropriate. One attempt was made in Jin and Novak (2010) for one-dimensional problems, where a complex Liouville equation is used together with an interface condition using (complex-valued ) quantum scattering data obtained by solving the stationary Schr¨ odinger equation. Its extension to multi-dimensional problems remains to be done. A more general approach could use Gaussian beam methods, which do capture the phase information. This is an interesting line of research yet to be pursued.
¨ dinger equations Methods for semiclassical Schro
173
11. Schr¨ odinger equations with matrix-valued potentials and surface hopping Problems closely related to those mentioned in Section 10 arise in the study of semiclassical Schr¨odinger equations with matrix-valued potentials. This type of potential can be seen as a highly simplified model of the full manybody quantum dynamics of molecular dynamics. Using the celebrated Born–Oppenheimer approximation to decouple the dynamics of the electrons from the one for the much heavier nuclei (see, e.g., Spohn and Teufel (2001)), one finds that the electrons are subject to external forces which can be modelled by a system of Schr¨odinger equations for the nuclei along the electronic energy surfaces. The nucleonic Schr¨ odinger system has matrixvalued potentials, which will be treated in this section. To this end, we consider the following typical situation, namely, a timedependent Schr¨odinger equation with R2×2 -matrix-valued potential (see, e.g., Spohn and Teufel (2001), or Teufel (2003)): 2 ε ε (11.1) iε∂t u = − ∆x + V (x) uε , uε (0, x) = uεin ∈ L2 (R2 , C2 ), 2 for (t, x) ∈ R+ × R2 and ∆x = diag(∆x1 + ∆x2 , ∆x1 + ∆x2 ). The unknown uε (t, x) ∈ C2 and V is a symmetric matrix of the form 1 v (x) v2 (x) , (11.2) V (x) = tr V (x) + 1 v2 (x) −v1 (x) 2 with v1 (x), v2 (x) ∈ R. The matrix V then has two eigenvalues, λ(±) (x) = tr V (x) ± v1 (x)2 + v2 (x)2 . Remark 11.1. In the Born–Oppenheimer approximation, m the dimensionless semiclassical parameter ε > 0 is given by ε = M , where m and M are the masses of an electron and a nucleus respectively (Spohn and Teufel 2001). Then, all oscillations are roughly characterized by the frequency 1/ε, which typically ranges between one hundred and one thousand. 11.1. Wigner matrices and the classical limit for matrix-valued potentials In this section, we shall discuss the influence of matrix-valued potentials on the semiclassical limit of the Schr¨ odinger equations (11.1). Introduce the Wigner matrix as defined in G´erard et al. (1997): ε ε ε ε −2 ε ε ¯ ψ x− η ⊗ψ x+ η e iη·ξ dy, (x, ξ) ∈ R2x ×R2ξ . W [u ](x, ξ) = (2π) 2 2 2 R We also let W denote the corresponding (weak) limit W ε [uε ] −→ W ∈ L∞ (R; M+ (R2x × R2ξ ; R2 )). ε→0
174
S. Jin and P. Markowich and C. Sparber
(a)
(b)
Figure 11.1. The conical crossings for potentials (a) Viso and (b) VJT defined in (11.3). The crossing point is (0, 0) for both potentials.
In order to describe the the dynamics of the limiting matrix-valued measure W (t, x, ξ), first note that the complex 2 × 2 matrix-valued symbol of (11.1) is given by i P (x, ξ) = |ξ|2 + iV (x). 2 The two eigenvalues of −iP (x, ξ) are |ξ|2 |ξ|2 + tr V (x) ± v1 (x)2 + v2 (x)2 = + λ± (x). 2 2 These eigenvalues λn , n = 1, 2 govern the time evolution of the limiting measure W (t), as proved in G´erard et al. (1997). They act as the correct classical Hamiltonian function in phase space, corresponding to the two energy levels, respectively. In the following, we shall say that two energy levels cross at a point x∗ ∈ R2 if λ+ (x∗ ) = λ− (x∗ ). Such a crossing is called conical if the vectors ∇x v1 (x∗ ) and ∇x v2 (x∗ ) are linearly independent. In Figure 11.1 we give two examples of conical crossings for potentials of the form x1 x2 x1 x2 Viso = , VJT = . (11.3) x2 −x1 x2 −x1 λ1,2 (x, ξ) =
If all the crossings are conical, the crossing set S = {x ∈ R2 : λ+ (x) = λ− (x)} is a sub-manifold of co-dimension two in R2 : see Hagedorn (1994). Assume that the Hamiltonian flows with Hamiltonians λn leave invariant the set Ω = (R2x × R2ξ )\S.
¨ dinger equations Methods for semiclassical Schro
175
For (x, ξ) ∈ Ω, denote by χn (x, ξ) the column eigenvector corresponding to the eigenvalue λn (x, ξ), and the matrix Πn (x, ξ) = χn (x, ξ)(χτ (x, ξ)) is the orthogonal projection onto the eigenspace associated to λn (x, ξ). By Theorem 6.1 of G´erard et al. (1997), the matrix-valued Wigner measure W (t) commutes with the projectors Πn , outside the crossing set S, and can thus be decomposed as W (t, ·) = Π1 W (t, ·)Π1 + Π2 W (t, ·)Π2 . Since the eigenspaces are both one-dimensional, the decomposition is simplified to be W (t, ·) = W1 (t, ·)Π1 + W2 (t, ·)Π2 . The scalar functions Wn (t, x, ξ) given by Wn (t, x, ξ) = tr(Πn W (t, x, ξ)) are then found to satisfy the Liouville equations ∂t Wn + ∇ξ λn · ∇x Wn − ∇x λn · ∇ξ Wn = 0,
(t, x, ξ) ∈ R+ × Ω,
(11.4)
subject to initial data Wn (0) = tr(Πn W ),
(x, ξ) ∈ Ω.
(11.5)
The scalar functions Wn , n = 1, 2, are the phase space probability densities corresponding to the upper and lower energy levels, respectively. One can recover from them the particle densities ρn via Wn (t, x, ξ) dξ, n = 1, 2. (11.6) ρn (t, x) = R2ξ
In other words, the Liouville equations (11.4) yield the propagation of the Wigner measures W1 (t, ·) and W2 (t, ·) on any given time interval, provided that their supports do not intersect the eigenvalue crossing set S. However, analytical and computational challenges arise when their supports intersect the set S. In S the dynamics of W1 , W2 are coupled due to the non-adiabatic transitions between the two energy levels, and an additional hopping condition is needed (analogous to the interface condition considered in Section 10 above). The Landau–Zener formula Lasser, Swart and Teufel (2007) give a heuristic derivation of the nonadiabatic transition probability. The derivation is based on the Hamiltonian
176
S. Jin and P. Markowich and C. Sparber
system corresponding to the Liouville equations (11.4), i.e., x˙ n (t) = ∇ξ λn (t) = ξn (t), ξ˙n (t) = −∇x λn (t), n = 1, 2.
(11.7)
The basic idea is to insert the trajectories (x(t), ξ(t)) of the Hamiltonian systems (11.7) into the trace-free part of the potential matrix (11.2) to obtain a system of ordinary differential equations, given by d ε v1 (x(t)) v2 (x(t)) uε (t). iε u (t) = v2 (x(t)) −v1 (x(t)) dt The non-adiabatic transitions occur in the region where the spectral gap between the eigenvalues becomes minimal. The function h(x(t)) = |λ+ (x(t)) − λ− (x(t))| = 2|ϑ(x(t))| measures the gap between the eigenvalues in phase space along the classical trajectory (x(t), ξ(t)), where ϑ(x) = (v1 (x), v2 (x)) and | · | denotes the Euclidean norm. The necessary condition for a trajectory to attain the minimal gap is given by d |ϑ(x(t))|2 = ϑ(x(t)) · ∇x ϑ(x(t))ξ(t) = 0, dt ˙ where ∇x ϑ(x(t) is the Jacobian matrix of the vector ϑ(x(t)), and ξ(t) = x(t). Hence, a crossing manifold in phase space containing these points is given by
S ∗ = (x, ξ) ∈ R2x × R2ξ : ϑ(x(t)) · ∇x ϑ(x(t))ξ(t) = 0 . The transition probability when one particle hits S ∗ is assumed to be given by π (ϑ(x0 ) ∧ ∇x ϑ(x0 )ξ0 )2 ε , (11.8) T (x0 , ξ0 ) = exp − ε |∇x ϑ(x0 )ξ0 |3 which is the famous Landau–Zener formula (Landau 1932, Zener 1932). Note that T decays exponentially in x and ξ and 1 (x, ξ) ∈ S ∗ }, lim T ε = T0 = ε→0 0 (x, ξ) ∈ / S∗. In other words, as ε → 0, the transition between the energy bands only occurs on the set S ∗ , which is consistent with the result in the previous subsections. 11.2. Numerical approaches Lagrangian surface hopping One widely used numerical approach to simulation of the non-adiabatic dynamics at energy crossings is the surface hopping method, first proposed by
¨ dinger equations Methods for semiclassical Schro
177
Tully and Preston (1971), and further developed in Tully (1990) and Sholla and Tully (1998). The basic idea is to combine the classical transports of the system on the individual potential energy surfaces λ± (x) that follow (11.7) with an instantaneous transitions at S ∗ from one energy surface to another. The rate of transition is determined by the Landau–Zener formula (11.8) whenever available, or computed by some quantum mechanical simulation locally around S ∗ . The hoppings were performed in a Monte Carlo procedure based on the transition rates. For a review of surface hopping methods see Drukker (1999). More recently, surface hopping methods have generated increasing interest among the mathematical community. For molecular dynamical simulations, Horenko, Salzmann, Schmidt and Sch¨ utte (2002) adopted the partial Wigner transform to reduce a full quantum dynamics into the quantum–classical Liouville equation, and then the surface hopping is realized by approximating the quantum Liouville equation using phase space Gaussian wave packets. From the analytical point of view, Lasser and Teufel (2005) and Fermanian Kammerer and Lasser (2003) analysed the propagation through conical surface crossings using matrix-valued Wigner measures and proposed a corresponding rigorous surface hopping method based on the semiclassical limit of the time-dependent Born–Oppenheimer approximation. In Lasser et al. (2007) and Kube, Lasser and Weber (2009) they used a particle method to solve the Liouville equation, in which each classical trajectory was subject to a deterministic branching (rather than Monte Carlo) process. Branching occurs whenever a trajectory attains one of its local minimal gaps between the eigenvalue surfaces. The new branches are consequently re-weighted according to the Landau–Zener formula for conical crossings These Lagrangian surface hopping methods are very simple to implement, and in particular, very efficient in high space dimensions. However, they require either many statistical samples in a Monte Carlo framework or the increase of particle numbers whenever hopping occurs. In addition, as is typical for Lagrangian methods, a complicated numerical re-interpolation procedure is needed whenever the particle trajectories diverge, in order to maintain uniform accuracy in time. Eulerian surface hopping The Eulerian framework introduced in Jin, Qi and Zhang (2011) consists of solving the two Liouville equations (11.4), with a hopping condition that numerically incorporates the Landau–Zener formula (11.8). Note that the Schr¨odinger equation (11.1) implies conservation of the total mass, which in the semiclassical limit ε → 0, locally away from S ∗ , yields d (11.9) (W1 + W2 )(t, x, ξ) dξ dx = 0. dt
178
S. Jin and P. Markowich and C. Sparber
For this condition to hold for all x, ξ, the total flux in the direction normal to S ∗ needs to be continuous across S ∗ . To ensure this, the Landau–Zener transition at S ∗ should be formulated as a continuity condition for the total flux in the normal direction en . Define the flux function jn (x, ξ) ∈ R2 for each eigenvalue surface via jn (x, ξ) = (∇ξ λn , −∇x λn ) Wn (x, ξ),
n = 1, 2.
Assume, before hopping, that the particle remains on one of the eigenvalue surfaces, i.e., − − − (1) j1 (x− 0 , ξ0 ) = 0 and j2 (x0 , ξ0 ) = 0, or − − − (2) j1 (x− 0 , ξ0 ) = 0 and j2 (x0 , ξ0 ) = 0.
Then the interface condition is given by + − j1 (x− T (x0 , ξ0 ) j1 (x+ 0 , ξ0 ) · en = 1 − T (x0 , ξ0 ) 0 , ξ0 ) · e n , + − 1 − T (x0 , ξ0 ) T (x0 , ξ0 ) j2 (x+ j2 (x− 0 , ξ0 ) · e n 0 , ξ0 ) · e n where (x± , ξ ± ) are the (pre- and post-hopping) limits to (x0 , ξ0 ) ∈ S ∗ along the direction en . Remark 11.2. There is a restriction of this approach based on the Liouville equation and the Landau–Zener transition probability. The interference effects generated when two particles from different energy levels arrive at S ∗ at the same time are thereby not accounted for, and thus important quantum phenomena, such as the Berry phase, are missing. One would expect that Gaussian beam methods could handle this problem, but this remains to be explored.
12. Schr¨ odinger equations with periodic potentials So far we have only considered ε-independent potential V (x). The situation changes drastically if one allows for potentials varying on the fast scale y = x/ε. An important example concerns the case of highly oscillatory potentials VΓ (x/ε), which are periodic with respect to a periodic lattice odinger equations Γ ⊂ Rd . In the following we shall therefore consider Schr¨ of the form x ε ε2 ε ε u + V (x)uε , uε (0, x) = uεin (x). (12.1) iε∂t u = − ∆u + VΓ 2 ε Here V ∈ C ∞ denotes some smooth, slowly varying potential and VΓ is a rapidly oscillating potential (not necessarily smooth). For definiteness we shall assume that for some orthonormal basis {ej }dj=1 , VΓ satisfies VΓ (y + 2πej ) = VΓ (y) i.e., Γ =
(2πZ)d .
∀ y ∈ Rd ,
(12.2)
¨ dinger equations Methods for semiclassical Schro
179
Remark 12.1. Equations of this form arise in solid state physics, where they are used to describe the motion of electrons under the action of an external field and a periodic potential generated by the ionic cores. This problem has been extensively studied from both physical and mathematical points of view: see, e.g., Ashcroft and Mermin (1976), Bensoussan, Lions and Papanicolaou (1978), Teufel (2003) and the references given therein. One of the most striking dynamical effects due to the inclusion of a periodic potential VΓ is the occurrence of so-called Bloch oscillations. These are oscillations exhibited by electrons moving in a crystal lattice under the influence of a constant electric field V (x) = F · x, F ∈ Rd (see Section 12.2 below). 12.1. Emergence of Bloch bands In order to better understand the influence of VΓ , we recall here the basic spectral theory for periodic Schr¨odinger operators of the form (Reed and Simon 1976): 1 Hper = − ∆y + VΓ (y). 2 With VΓ obeying (12.2), we have the following. (1) The fundamental domain of the lattice Γ = (2πZ)d is the interval Y = [0, 2π]d . (2) The dual lattice Γ∗ can then be defined as the set of all wave numbers k ∈ R for which plane waves of the form e ik·x have the same periodicity as the potential VΓ . This yields Γ∗ = Zd in our case. (3) The fundamental domain of the dual lattice, Y ∗ , i.e., the (first) Brillouin zone, is the set of all k ∈ R closer to zero than to any other d dual lattice point. In our case Y ∗ = − 12 , 12 , equipped with periodic boundary conditions, i.e., Y ∗ Td . By periodicity, it is sufficient to consider the operator Hper on the fundamental domain Y only, where we impose the following quasi-periodic boundary conditions: (12.3) f (y + 2πej ) = e2 ikj π f (y) ∀ y ∈ R, k ∈ Y ∗ . It is well known (Wilcox 1978) that under mild conditions on VΓ , the operator H admits a complete set of eigenfunction {ψm (y, k)}m∈N , parametrized by k ∈ Y ∗ . These eigenfunctions provide, for each fixed k ∈ Y ∗ , an orthonormal basis in L2 (Y ). Correspondingly there exists a countable family of real eigenvalues {E(k)}m∈N , which can be ordered as E1 (k) ≤ E2 (k) ≤ · · · ≤ Em (k) ≤ · · · , where the respective multiplicities are accounted for in the ordering. The set {Em (k) : k ∈ Y } ⊂ R is called the mth energy band of the operator Hper .
180
S. Jin and P. Markowich and C. Sparber 9 8 8 7 6 7 5 6
4 3
5
2
4
1
3 2
0
1
−1 −0.5
−0.4
−0.3
−0.2
−0.1
0
k
0.1
0.2
0.3
0.4
0.5
Figure 12.1. The eigenvalues Em (k), m = 1, . . . , 8 for Mathieu’s model: VΓ = cos y.
Concerning the dependence on k ∈ Y ∗ , it has been shown (Wilcox 1978) that for any m ∈ N there exists a closed subset X ⊂ Y ∗ such that Em (k) is analytic and ψm (·, k) can be chosen to be a real analytic function for all k ∈ Y ∗ \X. Moreover, Em−1 < Em (k) < Em+1 (k)
∀ k ∈ Y ∗ \X.
If this condition indeed holds for all k ∈ Y ∗ , then Em (k) is called an isolated Bloch band. Moreover, it is known that meas X = meas {k ∈ Y ∗ : En (k) = Em (k), n = m} = 0.
(12.4)
This set of Lebesgue measure zero consists of the so-called band crossings. See Figure 12.1 for an example of bands for Mathieu’s model with potential VΓ = cos y. Note that due to (12.3) one can rewrite ψm (y, k) as ψm (y, k) = e ik·y χm (y, k)
∀ m ∈ N,
(12.5)
for some 2π-periodic function χm (·, k), usually called Bloch functions. In terms of χm (y, k) the spectral problem for Hper becomes (Bloch 1928) H(k)χm (y, k) = Em (k)χm (y, k), χm (y + 2πej , k) = χm (y, k) ∀ k ∈ Y ∗ ,
(12.6)
where H(k) denotes the shifted Hamiltonian 1 H(k) := e− ik·y Hper e ik·y = (−i∇y + k)2 + VΓ (y). 2
(12.7)
¨ dinger equations Methods for semiclassical Schro
181
Most importantly, the spectral data obtained from (12.6) allow us to decompose the original space L2 (Rd ) into a direct sum of so-called band Hilbert ∞ 2 d spaces: L (R ) = m=1 Hm . This is the well-known Bloch decomposition method , which implies that fm , fm ∈ H m . (12.8) ∀ f ∈ L2 (Rd ) : f = m∈N
The corresponding projection of f ∈ L2 (Rd ) onto the mth band space Hm is thereby given via (Reed and Simon 1976) f (ζ)ψ m (ζ, k) dζ ψm (y, k) dk. (12.9) fm (y) = Y∗
Rd
In the following, we shall also denote Cm (k) := f (ζ)ψ m (ζ, k) dζ,
(12.10)
Rd
the coefficient of the Bloch decomposition. 12.2. Two-scale WKB approximation Equipped with the basic theory of Bloch bands, we recall here an extension of the WKB method presented in Section 2.2 to the case of highly oscillatory periodic potentials. Indeed, it has been shown in Bensoussan et al. (1978) and Guillot, Ralston and Trubowitz (1988) that solutions to (12.1) can be approximated (at least locally in time) by x ε→0 ε , ∇S e iS(t,x)/ε + O(ε), (12.11) u (t, x) ∼ a(t, x)χm ε where χm is parametrized via k = ∇S(t, x). The phase function S thereby solves the semiclassical Hamilton–Jacobi equation ∂t S + Em (∇S) + V (x) = 0,
S(0, x) = Sin (x).
(12.12)
The corresponding semiclassical flow Xtsc : y → x(t, y) is given by x(t, ˙ y) = ∇k Em (k(t, y)), ˙ y) = −∇x V (x(t, y)), k(t,
x(0, x) = y,
(12.13a)
k(0, y) = ∇Sin (y).
(12.13b)
The wave vector k ∈ Y ∗ is usually called crystal momentum. In the case of a constant electric field V = F · x, equation (12.13b) yields k(t, y) = k − tF,
k = ∇Sin (y).
Note that since k ∈ Y ∗ Td , this yields a periodic motion in time of x(t, y), the so-called Bloch oscillations.
182
S. Jin and P. Markowich and C. Sparber
In addition, the leading-order amplitude in (12.11) is found to be the solution of the semiclassical transport equation (Carles, Markowich and Sparber 2004), ∂t a + ∇k Em (∇S) · ∇a +
1 divx (∇k Em (∇x φm ))am = (βm · ∇x V (x)) am , 2 (12.14)
where βm (t, x) := χm (y, ∇S), ∇k χm (y, ∇S) L2 (Y )
(12.15)
denotes the so-called Berry phase term (Carles et al. 2004, Panati, Spohn and Teufel 2006), which is found to be purely imaginary βm (t, x) ∈ (iR)d . It is, importantly, related to the quantum Hall effect (Sundaram and Niu 1999). The amplitude a is therefore necessarily complex-valued and exhibits a non-trivial phase modulation induced by the geometry of VΓ ; see also Shapere and Wilczek (1989) for more details. Note that (12.14) yields the following conservation law for ρ = |a|2 : ∂t ρ + div(ρ∇k Em (∇S)) = 0. The outlined two-scale WKB approximation again faces the problem of caustics. Furthermore, there is an additional problem of possible bandcrossings at which ∇k Em is no longer defined. The right-hand side of (12.11) can therefore only be regarded as a valid approximation for (possibly very) short times only. Nevertheless, it shows the influence of the periodic potential, which can be seen to introduce additional high-frequency oscillations (Γ-periodic) within uε . Remark 12.2. These techniques have also been successfully applied in weakly nonlinear situations (Carles et al. 2004). 12.3. Wigner measures in the periodic case The theory of Wigner measures discussed in Section 3 can be extended to the case of highly oscillatory potentials. The theory of the so-called Wigner band series was developed in Markowich, Mauser and Poupaud (1994) and G´erard et al. (1997). The basic idea is to use Bloch’s decomposition and replace the continuous momentum variable ξ ∈ Rd by the crystal momentum k ∈ Y ∗. A more general approach, based on space adiabatic perturbation theory (Teufel 2003), yields in the limit ε → 0 a semiclassical Liouville equation of the form sc , w} = 0, ∂t w + {Hm
w(0, x, k) = win (x, k),
(12.16)
where w(t, x, k) is the mth band Wigner measure in the Γ-periodic phase
183
¨ dinger equations Methods for semiclassical Schro
space Rdx × Y ∗ , {·, ·} denotes the corresponding Poisson bracket, and sc Hm = Em (k) + V (x)
(12.17)
denotes the mth band semiclassical Hamiltonian.
13. Numerical methods for Schr¨ odinger equations with periodic potentials 13.1. Bloch-decomposition-based time-splitting method
The introduction of a highly oscillatory potential VΓ xε poses numerical challenges for the numerical computation of semiclassical Schr¨ odinger equations. It has been observed by Gosse (2006) and Gosse and Markowich (2004) that conventional split-step algorithms do not perform well. More precisely, to guarantee convergence of the scheme, time steps of order O(ε) are required. In order to overcome this problem, a new time-splitting algorithm based on Bloch’s decomposition method has been proposed in Huang, Jin, Markowich and Sparber (2007) and further developed in Huang, Jin, Markowich and Sparber (2008) and Huang, Jin, Markowich and Sparber (2009). The basic idea is as follows. Step 1. For t ∈ [tn , tn+1 ] one first solves iε∂t uε = −
x ε ε2 ∆uε + VΓ u . 2 ε
(13.1)
The main point is that by using the Bloch decomposition method, Step 1 can be solved exactly, i.e., only up to numerical errors. In fact, in each band space Hm , equation (13.1) is equivalent to iε∂t uεm = Em (−i∇)uεm ,
uεm ∈ Hm ,
(13.2)
where uεm ≡ Pεm uε is the (appropriately ε-scaled) projection of uε ∈ L2 (Rd ) onto Hm defined in (12.9) and Em (−i∇) is the Fourier multiplier corresponding to the symbol Em (k). Using standard Fourier transformation, equation (13.2) is easily solved by (13.3) uεm (t, x) = F −1 e iEm (k)t/ε (Fum )(0, k) , where F −1 is the inverse Fourier transform. In other words, one can solve (13.1) by decomposing uε into a sum of band-space functions uεm , each of which is propagated in time via (13.3). After resummation this yields uε (tn+1 , x). Once this is done, we proceed as usual to take into account V (x). Step 2. On the same time interval as before, we solve the ODE iε∂t uε = V (x)uε ,
(13.4)
184
S. Jin and P. Markowich and C. Sparber
where the solution obtained in Step 1 serves as initial condition for Step 2. In this algorithm, the dominant effects from the dispersion and the periodic lattice potential are computed in one step. It thereby maintains their strong interaction and treats the non-periodic potential as a perturbation. Because the split-step error between the periodic and non-periodic parts is relatively small, the time steps can be chosen considerably larger than a conventional time-splitting algorithm (see below). As in a conventional splitting method (see Section 5), the numerical scheme conserves the particle density ρε = |uε |2 on the fully discrete level. More importantly, if V (x) = 0, i.e., no external potential, the algorithm preserves the particle density (and hence the mass) in each individual band space Hm . Remark 13.1. Clearly, the algorithm given above is only first-order in time, but this can easily be improved by using the Strang splitting method (see Section 5). In this case, the method is unconditionally stable and comprises spectral convergence for the space discretization as well as secondorder convergence in time. Numerical calculation of Bloch bands In the numerical implementation of this algorithm a necessary prerequisite is the computation of Bloch bands Em (k) and Bloch eigenfunction χm (y, k). This requires us to numerically solve the eigenvalue problem (12.6). In one space dimension d = 1 we proceed as in Gosse and Markowich (2004), by expanding VΓ ∈ C 1 (R) in its Fourier series 2π 1 iλy VΓ (y) e− iλy dy. VΓ (y) = V (λ) e , V (λ) = 2π 0 λ∈Z
Clearly, if VΓ ∈ C ∞ (R) the corresponding Fourier coefficients V (λ) decay faster than any power, as λ → ±∞, in which case we only need to take into account a few coefficients to achieve sufficient accuracy. Likewise, expand the Bloch eigenfunction χm (·, k) in its respective Fourier series χ m (λ, k) e iλy . χm (y, k) = λ∈Z
For λ ∈ {−Λ, . . . , Λ − 1} ⊂ Z, one consequently approximates the spectral problem (12.6) by the algebraic eigenvalue problem χ m (−Λ) χ m (−Λ) χ χ m (1 − Λ) m (1 − Λ) (13.5) H(k) = Em (k) , .. .. . . χ m (Λ − 1)
χ m (Λ − 1)
¨ dinger equations Methods for semiclassical Schro
185
where the 2Λ × 2Λ matrix H(k) is given by H(k) = V (−1) ··· V (0) + 12 (k − Λ)2 1 2 V (1) V (0) + 2 (k − Λ + 1) · · · . .. .. .. . . V (2Λ − 1) V (2Λ − 2) ···
V (1 − 2Λ) V (2 − 2Λ) .. .
.
V (0) + 12 (k + Λ − 1)2
The matrix H(k) has 2Λ eigenvalues. Clearly, this number has to be large enough to have sufficiently many eigenvalues Em (k) for the simulation, i.e., we require m ≤ 2Λ. Note, however, that the number Λ is independent of the spatial grid (in particular, independent of ε), thus the numerical costs of this eigenvalue problem are often negligible compared to those of the evolutionary algorithms (see below for more details). In higher dimensions d > 1, computing the eigenvalue problem (12.6) along these lines becomes numerically too expensive to be feasible. In many physical applications, however, the periodic potential splits into a sum of one-dimensional potentials, i.e., VΓ (y) =
d
VΓ (yj ),
Vj (yj + 2π) = Vj (yj ),
j=1
where y = (y1 , y2 , . . . , yd ) ∈ Rd . In this case, Bloch’s spectral problem can be treated separately (using a fractional step-splitting approach) for each coordinate yj ∈ R, as outlined before. Remark 13.2. In practical applications, the accurate numerical computation of Bloch bands is a highly non-trivial task. Today, though, there exists a huge amount of numerical data detailing the energy band structure of the most important materials used in the design of semiconductor devices, for example. In the context of photonic crystals the situation is similar. Thus, relying on such data one can in principle completely avoid the above eigenvalue computations and their generalizations to more dimensions. To this end, one should also note that, given the energy bands Em (k), we do not need any knowledge about VΓ to solve (12.1) numerically. Also, we remark that it was shown in Huang et al. (2009) that the Bloch-decomposition-based time-splitting method is remarkably stable with respect to perturbations of the spectral data. Implementation of the Bloch-decomposition-based time-splitting method In the numerical implementation we shall assume that VΓ admits the decomposition (13.1). In this case we can solve (12.1) by using a fractional step method, treating each spatial direction separately, i.e., one only needs
186
S. Jin and P. Markowich and C. Sparber
to study the one-dimensional equation
x ε ε2 ε u iε∂t u = − ∂xx u + Vj 2 ε ε
(13.6)
on the time interval [tn , tn+1 ]. This equation will be considered on a one-dimensional computational domain (a, b) ⊂ R, equipped with periodic boundary conditions (necessary to invoke fast Fourier transforms). We suppose that there are L ∈ N lattice cells within (a, b) and numerically compute uε at L × R grid points, for some R ∈ N. In other words we assume that there are R grid points in each lattice cell, which yields the discretization 1 −1 , where = {1, . . . , L} ⊂ N, k = − + 2 L 2π(r − 1) , where r = {1, . . . , R} ⊂ N, yr = R and thus un ≡ u(tn ) are evaluated at the grid points x,r = ε(2π( − 1) + yr ).
(13.7)
(13.8)
Note that in numerical computations one can use R L whenever ε 1, i.e., only a few grid points are needed within each cell. Keeping in mind the basic idea of using Bloch’s decomposition, one has the problem that the solution uε of (13.6) does not in general have the same periodicity properties as ϕm . A direct decomposition of uε in terms of this new basis of eigenfunctions is therefore not possible. This problem can be overcome by invoking the following unitary transformation for f ∈ L2 (R): f (ε(y + 2πγ)) e− i2πkγ , y ∈ Y, k ∈ Y ∗ , f (y) → f(y, k) := γ∈Z
with the properties f(y + 2π, k) = e2 iπk f(y, k),
f(y, k + 1) = f(y, k).
In other words f(y, k) admits the same periodicity properties with respect to k and y as the eigenfunction ψm (y, k). In addition, the following inversion formula holds: (13.9) f(y, k) e i2πkγ dk. f (ε(y + 2πγ)) = Y∗
Moreover, one easily sees that the Bloch coefficient, defined in (12.10), can be equivalently written as (13.10) Cm (k) = f(y, k)ψ m (y, k) dy, Y
which, in view of (12.5), resembles a Fourier integral. In fact, all of these formulae can be easily implemented by using the fast Fourier transform.
¨ dinger equations Methods for semiclassical Schro
187
The numerical algorithm needed to perform Step 1 outlined above is then as follows. Step 1.1. First compute u ε at time tn by u ε (tn , x,r , k ) =
L
uε (tn , xj,r ) e− i2πk ·(j−1) ,
j=1
where x,r is as in (13.8). ε (t , k ) via (13.10): Step 1.2. Compute the coefficient Cm n ε Cm (tn , k ) ≈
R 2π ε u (tn , x,r , k )χm (yr , k ) e− ik yr . R r=1
ε (t , k) up to time tn+1 according to (13.2), Step 1.3. Evolve Cm n ε ε (tn+1 , k ) = Cm (tn , k ) e− iEm (k )∆t/ε . Cm
Step 1.4. u ε can be obtained at time tn+1 by summing over all band contributions, u (tn+1 , x,r , k ) = ε
M
ε Cm (tn+1 , k )χm (yr , k ) e ik yr .
m=1
Step 1.5. Perform the inverse transformation (13.9): 1 ε u (tn+1 , xj,r , kj ) e i2πkj (−1) . u (tn+1 , x,r , k ) ≈ L L
ε
j=1
This concludes the numerical procedure performed in Step 1. The Bloch-decomposition-based time-splitting method was found to be converging for ∆x = O(ε) and ∆t = O(1); see Huang et al. (2007) for more details. In other words, the time steps can be chosen independently of ε, a huge advantage in comparison to the standard time-splitting method used in Gosse (2006), for instance. Moreover, the numerical experiments done in Huang et al. (2007) show that, of only a few Bloch bands, Em (k) are sufficient to achieve very high accuracy, even in cases where V (x) is no longer smooth (typically m = 1, . . . , M , with M ≈ 8 is sufficient). Applications of this method are found in the simulation of lattice Bose–Einstein condensates (Huang et al. 2008) and of wave propagation in (disordered) crystals (Huang et al. 2009). Remark 13.3. For completeness, we recall the numerical complexities for the algorithm outlined above: see Huang et al. (2007). The complexities of Steps 1.1 and 1.5 are O(RL ln L), the complexities of Steps 1.2 and 1.4
188
S. Jin and P. Markowich and C. Sparber
are O(M LR ln R), and for Step 1.3 it is O(M L). The complexity of the eigenvalue problem (13.5) is O(Λ3 ). However, since Λ (or R) is independent of ε and since (13.5) needs to be solved only once (as a preparatory step), the computational costs for this step are negligible. In addition, since M and R are independent of ε, one can choose R L and M L, whenever ε 1. Finally, one should notice that the complexities in each time step are comparable to the usual time-splitting method. 13.2. Moment closure in Bloch bands It is straightforward to adapt the moment closure method presented in Section 6 to the case of periodic potentials. To this end, one considers the semiclassical Liouville equation (12.16), i.e., ∂t w + ∇k Em (k) · ∇x w − ∇x V (x) · ∇k w = 0, and close it with the following ansatz for the Wigner measure: w(t, x, k) =
J
|aj (t, x)|2 δ (k − vj (t, x)),
j=1
where we let δ denote the Γ∗ -periodic delta distribution, i.e., δ(· − γ ∗ ). δ = γ ∗ ∈Γ∗
By following this idea, Gosse and Markowich (2004) showed the applicability of the moment closure method in the case of periodic potentials in d = 1 (see also Gosse (2006)). In addition, self-consistent Schr¨odinger–Poisson systems were treated in Gosse and Mauser (2006). As mentioned earlier, extending this method to higher space dimensions d > 1 is numerically challenging. 13.3. Gaussian beams in Bloch bands The Gaussian beam approximation, discussed in Sections 8 and 9, can also be extended to the Schr¨odinger equation with periodic potentials. To this end, one adopts the Gaussian beam within each Bloch band of the Schr¨odinger equation (12.1). In the following, we shall restrict ourselves to the case d = 1, for simplicity. Lagrangian formulation As for the two-scale WKB ansatz (12.11), we define x i Tm (t,x,ym )/ε ε ∗ e , ϕm (t, x, ym ) = Am (t, ym )χm ∂x Tm , ε
(13.11)
¨ dinger equations Methods for semiclassical Schro
189
where ym = ym (t, y0 ), and 1 Tm (t, x, ym ) = Sm (t, ym ) + pm (t, ym )(x − ym ) + Mm (t, ym )(x − ym )2 . 2 Here Sm ∈ R, pm ∈ R, am ∈ C, Mm ∈ C. In addition, we denote by χ∗m the function obtained by evaluating the usual Bloch function χm (y, k) (with real-valued k ∈ Y ∗ ) at the point y = x/ε and k = ∂x Tm ∈ C. To this end, we impose the following condition: χ∗m (y, z) = χm (y, z)
for z ∈ R.
One can derive a similar derivation of the Lagrangian formulation as in Section 8.1 that corresponds to the semiclassical Hamiltonian (12.17). For more details we refer to Jin, Wu, Yang and Huang (2010b). Here we only mention that, in order to define the initial values for the Gaussian beams, one first decomposes the initial condition, which is assumed to be given in two-scale WKB form, i.e., x iSin (x)/ε ε e , uin (x) = bin x, ε in terms of Bloch waves with the help of the stationary phase method (Bensoussan et al. 1978): ∞ x ε→0 ε in , ∂x Sin e iSin (x)/ε + O(ε), am (x)χm uin (x) ∼ ε m=1
where the coefficient ain m (x)
= Y
bin (x, y)χm (y, ∂x Sin ) dy.
When one computes the Lagrangian beam summation integral, the complexvalued ∂x Tm = pm + (x − ym )Mm can be approximated by the real-valued pm√with a Taylor truncation error of order O(|x − ym |). Since |x − ym | is of O( ε) (see Tanushev (2008) and Jin et al. (2008b)), this approximation does not destroy the total accuracy of the Gaussian beam method, yet it provides the benefit that the eigenfunction χ∗m (k, z) is only evaluated for real-valued k (and thus consistent with the Bloch decomposition method). However, because of this, the extension of this method to higher order becomes a challenging task. Eulerian formulation Based on the ideas presented in Section 9, an Eulerian Gaussian beam method for Schr¨ odinger equations with periodic potentials has been introduced in Jin et al. (2010b). It involves solving the (multivalued) velocity
190
S. Jin and P. Markowich and C. Sparber
um = ∂x Sm from the zero-level set of the function Φm , which satisfies the homogeneous semiclassical Liouville equation (12.16) in the form Lm Φm = 0, where the mth band Liouville operator Lm is defined as L m = ∂ t + ∂ k Em ∂ x − ∂ x V ∂ ξ ,
(13.12)
and Φm is the complex-valued d-dimensional level set function for the velocity corresponding to the mth Bloch band. They also solve the following inhomogeneous Liouville equations for the phase Sm and amplitude am : Lm Sm = k∂k Em − V, 1 Lm am = − ∂k2 Em Mm am + βm am ∂y V, 2 where Lm is defined by (13.12) and βm denotes the Berry phase term as given by (12.15). Here, the Hessian Mm ∈ C is obtained from Mm = −
∂y Φm . ∂ξ Φm
14. Schr¨ odinger equations with random potentials Finally, we shall consider (small) random perturbations of the potential V (x). It is well known that in one space dimension, linear waves in a random medium get localized even when the random perturbations are small: see, e.g., Fouque, Garnier, Papanicolaou and Sølna (2007). Thus the analysis here is restricted to three dimensions. (The two-dimensional case is difficult because of criticality, i.e., the mean-field approximation outlined below is most likely incorrect.) 14.1. Scaling and asymptotic limit Consider the Schr¨ odinger equation with a random potential VR : √ ε2 x ε ε ε ε iε∂t u = − ∆u + V (x)u + ε VR u , x ∈ R3 . 2 ε
(14.1)
Here VR (y) is a mean zero, stationary random function with correlation length of order one. Its correlation length is assumed to be of the same √ order as the wavelength. The ε-scaling given above is critical in the sense that the influence of the random potential is of the same order as the one given by V (x) (see also the remark below). We shall also assume that the fluctuations are statistically homogeneous and isotropic so that VR (x)VR (y) = R(|x − y|),
(14.2)
¨ dinger equations Methods for semiclassical Schro
191
where · · denotes statistical average and R(|x|) is the covariance of random fluctuations. The power spectrum of the fluctuations is defined by −3 e iξ·x R(x) dx. (14.3) R(ξ) = (2π) R3
is a function of |ξ| When (14.2) holds, the fluctuations are isotropic and R only. Remark 14.1. Because of the statistical homogeneity, the Fourier transform of the random potential VR is a generalized random process with orthogonal increments + p). VR (ξ)VR (p) = R(ξ)δ(ξ
(14.4)
If the amplitude of these fluctuations is large, then purely random scattering will dominate and waves will be localized: see Fr¨ ohlich and Spencer (1983). On the other hand if the random fluctuations are too weak, they will not affect the transport of waves at all. Thus, in order to have scattering induced by the random potential and the influence of the slowly varying background V (x) affect the (energy transport of the) waves in comparable ways, the √ fluctuations in the random potential must be of order ε. Using the ε-scaled Wigner transformation, we can derive the analogue of (3.2) in the following form: ∂t wε + ξ · ∇x wε − Θε [V + VR ]wε = 0,
(14.5)
where the pseudo-differential operator Θε is given by (3.3). The behaviour of this operator as ε → 0 is very different from the case without VR , as can already be seen on the level of formal multiscale analysis: see Ryzhik, Papanicolaou and Keller (1996). Let y = x/ε be a fast spatial variable, and introduce an expansion of wε (t) in the following form: wε (t, x, ξ) = w(t, x, ξ) + ε1/2 w(1) (t, x, y, ξ) + εw(2) (t, x, y, ξ) + · · · . (14.6) Note that we hereby assume that the leading term w does not depend on the fast scale. We shall also assume that the initial Wigner distribution ε (x, ξ) tends to a smooth, non-negative function w (x, ξ), which decays win in sufficiently fast at infinity. Then, as ε → 0, one formally finds that wε (t) , i.e., the averaged solution to (14.5), is close to a limiting measure w(t), which satisfies the following linear Boltzmann-type transport equation: ∂t w + ξ · ∇x w − ∇x V · ∇ξ w = Qw. Here, the linear scattering operator Q is given by − p)δ(|ξ|2 − |p|2 )(w(x, p) − w(x, ξ)) dp, R(ξ Qw(x, ξ) = 4π R3
(14.7)
192
S. Jin and P. Markowich and C. Sparber
with differential scattering cross-section − p)δ(|ξ|2 − |p|2 ) σ(k, p) = 4π R(ξ and total scattering cross-section − p)δ(|ξ|2 − |p|2 ) dp. Σ(k) = 4π R(ξ R3
(14.8)
(14.9)
Note that the transport equation (14.7) has two important properties. First, the total mass (or energy, depending on the physical interpretation) is conserved, i.e., w(t, x, ξ) dξ dx = E(0). (14.10) E(t) = R3 ×R3
Second, the positivity of w(t, x, ξ) is preserved. Rigorous mathematical results concerning the passage from (14.1) to the transport equation (14.7) can be found in Spohn (1977), Dell’Antonio (1983) and Ho, Landau and Wilkins (1993) (which contains extensive references), and, more recently, in Erd¨os and Yau (2000). 14.2. Coupling with other media One can also study the problems when there are other media, including periodic media and interfaces (flat or random). In the case of periodic media coupled with random media, one can use the above multiscale analysis combined with the Bloch decomposition method to derive a system of radiative transport equations: see Bal, Fannjiang, Papanicolaou and Ryzhik (1999a). In the limit system ε → 0, the transport part is governed by the semiclassical Liouville equation (12.16) in each Bloch band, while the right-hand side is a non-local scattering operator (similar to the one above) coupling all bands. One can also consider random high-frequency waves propagating through a random interface. Away from the interface, one obtains the radiative transport equation (14.7). At the interface, due to the randomness of the interface, one needs to consider a diffusive transmission or reflection process, in which waves can be scattered in all directions (see Figure 10.1). To this end, a non-local interface condition has to be derived: see Bal et al. (1999b). So far there have been few numerical works on random Schr¨ odinger equations of the form (14.1). Bal and Pinaud (2006) studied the accuracy of the radiative transport equation (14.7) as an approximation to (14.1). Jin et al. (2008a) discretized a non-local interface condition for diffusive scattering, similar in spirit to the treatment described in Section 10.2. We also mention that the temporal resolution issue for time-splitting approximations of the Liouville equations with random potentials was rigorously studied in Bal
¨ dinger equations Methods for semiclassical Schro
193
and Ryzhik (2004). Finally, we refer to Fouque et al. (2007) and Bal, Komorowski and Ryzhik (2010) for a comprehensive reading on high-frequency waves in random media.
15. Nonlinear Schr¨ odinger equations in the semiclassical regime So far we have only considered linear Schr¨odinger equations. Nonlinear models, however, are almost as important, since they describe a large number of physical phenomena in nonlinear optics, quantum superfluids, plasma physics or water waves: see, e.g., Sulem and Sulem (1999) for a general overview. The inclusion of nonlinear effects poses new challenges for mathematical and numerical study. 15.1. Basic existence theory In the following we consider nonlinear Schr¨ odinger equations (NLS) in the form ε2 ∆uε + V (x)uε + εα f (x, |uε |2 )uε , uε (0, x) = uεin (x), (15.1) 2 with α ≥ 0 some scaling parameter, measuring (asymptotically) the strength of the nonlinearity. More precisely, we shall focus on two important classes of nonlinearities: iε∂t uε = −
(1) local gauge-invariant nonlinearities, where f = ±|uε |2σ , with σ > 0, (2) Hartree-type nonlinearities, where f = V0 ∗ |uε |, with V0 = V0 (x) ∈ R some given convolution kernel. The first case of nonlinearities has important applications in Bose–Einstein condensation and nonlinear optics, whereas the latter typically appears as a mean-field description for the dynamics of quantum particles, say electrons 1 in d = 3). (in which case one usually has V0 (x) = ± |x| Concerning the existence of solutions to (15.1), we shall in the following only sketch the basic ideas. For more details we refer to Cazenave (2003) and Carles (2008). As a first step we represent the solution to (15.1) using Duhamel’s formula: t ε ε α U ε (t − s) f ε (x, |uε |2 )(s)uε (s) ds, (15.2) u (t) = U (t)uin − iε 0
U ε (t)
is the unitary semi-group generated by the linear Hamiltonian where 1 H = − 2 ∆ + V (see the discussion in Section 2.1). The basic idea is to prove that the right-hand side of (15.2) defines a contraction mapping (in some suitable topology). To this end, one has to distinguish between the case of sub- and supercritical nonlinearities. The existence of a unique solution
194
S. Jin and P. Markowich and C. Sparber
uε ∈ C([0, ∞); L2 (Rd )) can be guaranteed, provided (sub-critical case) σ < 2 ∞ d q d d and/or V0 sufficiently smooth and decaying, say V0 ∈ L (R ) ∩ L (R ), with q > d4 . Remark 15.1. Unfortunately, this subcritical range of nonlinearities does not allow inclusion of several physically important examples, such as a cubic nonlinearity σ = 1 in three space dimensions (needed, for instance, in the description of Bose–Einstein condensates). In the case of supercritical nonlinearities σ > d2 , the space L2 (Rd ) is generally too large to guarantee existence of solutions. Typically, one restricts the initial data to uε ∈ H 1 (Rd ), i.e., initial data with finite kinetic energy, in order to control the nonlinear terms by means of Sobolev’s embedding. Assuming that uε ∈ H 1 , local-in-time existence can be guaranteed by using Strichartz estimates (see Cazenave (2003) for more details), and one obtains uε ∈ C([−T ε , T ε ]; H 1 (Rd )), for some (possibly small) existence time T ε > 0. 2 Remark 15.2. Strictly speaking, we require σ < d−2 in order to use Sobolev’s embedding to control the nonlinearity. Note, however, that the case of cubic NLS in d = 3 is allowed.
Even though local-in-time existence is relatively easy to achieve even in the supercritical case, the existence of a global-in-time solution to (15.1) generally does not hold. The reason is the possibility of finite-time blow-up, i.e., the existence of a time |T ∗ | < ∞ such that lim ∇uε = +∞.
t→T ∗
For T > T ∗ , a strong solution to (15.1) ceases to exist, and one can only hope for weak solutions, which, however, are usually not uniquely defined. In order to understand better which situations blow-up can occur in, consider, for simplicity, the case of a cubic NLS with V (x) = 0: ε2 ∆uε ± |uε |2 uε , uε (0, x) = uεin (x). (15.3) 2 Given a local-in-time solution to this equation, one can invoke the conservation of the (nonlinear) energy, i.e., ε2 1 ε ε 2 |∇u (t, x)| dx ± |uε (t, x)|4 dx = E[uεin ]. E[u (t)] = 2 Rd 2 Rd iε∂t uε = −
Since E[uεin ] < const., by assumption, we can see that in the case where the nonlinearity comes with ‘+’, the a priori bound on the energy rules out the possibility of finite-time blow-up. These nonlinearities are usually referred to as defocusing. On the other hand, in the case of a focusing nonlinearity, i.e., f = −|uε |2 , we can no longer guarantee the existence of global-in-time
¨ dinger equations Methods for semiclassical Schro
195
solutions (in the supercritical regime). Rather, we have to expect finitetime blow-up to occur in general. Clearly, this phenomenon will also have a significant impact on numerical simulations, in particular for ε 1. 15.2. WKB analysis of nonlinear Schr¨ odinger equations In order to understand the influence of nonlinear terms in the limit ε → 0, one can again invoke a WKB approximation of the form (2.10): ε→0
uε (t, x) ∼ aε (t, x) e iS(t,x)/ε . Let us assume for simplicity that α ∈ N. Then, plugging the ansatz given above into (15.1), and ordering equal powers in ε, we see that S solves 0 if α > 0, 1 2 (15.4) ∂t S + |∇S| + V (x) = 2 2 f (x, |a| ) if α = 0. We see that in the case α = 0 we can no longer solve the Hamilton–Jacobi equation for the phase S independently of the amplitude a. In other words, the amplitude influences the geometry of the rays or characteristics. This is usually referred to as supercritical geometric optics (Carles 2008), not to be confused with the supercritical regime concerning the existence of solutions, as outlined in Section 15.1 above. Weakly nonlinear geometric optics In contrast, the situation for α > 0 (subcritical geometric optics) is similar to the linear situation, in the sense that the rays of geometric optics are still given by (2.13) and thus independent of the nonlinearity. In this case, the method of characteristics guarantees the existence of a smooth S ∈ C ∞ ([−T, T ] × Rd ) up to caustics, and one can proceed with the asymptotic expansion to obtain the following transport equation for the leading-order amplitude: 0 if α > 1, a (15.5) ∂t a + ∇S · ∇a + ∆S = 2 2 −if (x, |a| ) if α = 1. One sees that if α > 1, nonlinear effects are asymptotically negligible for ε 1. The solution is therefore expected to be roughly the same as in the linear situation (at least before caustics). For α = 1, however, nonlinear effects show up in the leading-order amplitude. Note, however, that by multiplying (15.5) with a ¯ and taking the real part, one again finds ∂t ρ + div(ρ∇S) = 0, which is the same conservation law for ρ = |a|2 as in the linear case. The nonlinear effects for α = 1 are therefore given solely by nonlinear phase
196
S. Jin and P. Markowich and C. Sparber
modulations of the leading-order amplitude. In the case of a simple cubic nonlinearity, one explicitly finds (Carles 2000) a0 (y(t, x)) iG(t,x) e , a(t, x) = Jt (y(t, x))
|t| ≤ T,
(15.6)
where the slowly varying phase G is given by t |a0 (y(τ, x))|2 dτ. G(t, x) = − Jτ (y(τ, x)) 0 This regime is therefore often called weakly nonlinear geometric optics, and indeed it is possible to prove a rigorous approximation result analogous to Theorem 2.3 in this case too. Supercritical geometric optics On the other hand, the situation for α = 0 is much more involved. Indeed, it can be easily seen that a naive WKB approximation breaks down since the system of amplitude equation is never closed, i.e., the equation for an , obtained at O(εn ), involves an+1 , and so on (a problem which is reminiscent of the moment closure problem discussed in Section 6 above). This difficulty was overcome by Grenier (1998) and Carles (2007a, 2007b), who noticed that there exists an exact representation of uε in the form uε (t, x) = aε (t, x) e iS
ε (t,x)/ε
,
(15.7)
with real-valued phase S ε (possibly ε-dependent) and complex-valued amplitude aε . (Essentially, the right-hand side of (15.7) introduces an additional degree of freedom by invoking complex amplitudes.) Plugging (15.7) into (15.1) with α = 0, one has the freedom to split the resulting equations for aε and S ε as follows. On plugging the ansatz given above into (15.1), and ordering equal powers in ε, one sees that S solves 1 ∂t S ε + |∇S ε |2 + V (x) + f (x, |aε |2 ) = 0, 2 a ε ε ∂t a + ∇S ε · ∇aε + ∆S ε − i ∆aε = 0. 2 2 Formally, we expect the limit of this system as ε → 0 to give a semiclassical approximation of uε , at least locally in time. Indeed this can be done by first rewriting these equations into a new system for ρε = |aε |2 and v ε = ∇S ε . Under some assumptions on the nonlinearity f (satisfied, for instance, in the cubic case), the obtained equations form a strictly hyperbolic system in which one can rigorously pass to the limit as ε → 0 to obtain ∂t v + v · ∇v + V (x) + f (ρ) = 0, ∂t ρ + div(ρv) = 0.
(15.8)
¨ dinger equations Methods for semiclassical Schro
197
This is a system of (irrotational) Euler equations for a classical fluid with pressure law p(ρ) = f (ρ)/ρ. Following this approach, one can prove that as long as (15.8) admits (local-in-time) smooth solutions ρ, v, the quantum mechanical densities (2.6)–(2.7) indeed converge strongly in C([0, T ]; L1 (Rd )), with ε→0 ε→0 ρε −→ ρ, J ε −→ ρ. Reconstructing from these limits an approximate solution of the nonlinear Schr¨odinger equation in WKB form, i.e., uεapp (t, x) = ρ(t, x) e iS(t,x)/ε , v(t, x) := ∇S(t, x), generally requires some care (see Carles (2007b) for more details). Essentially one needs to take into account a higher-order corrector to ensure that the formal approximation is indeed correct up to errors of order O(ε), independent of t ∈ [0, T ]. The semiclassical limit for α = 0 for |t| > T , i.e., beyond the formation of shocks in (15.8), is a very challenging mathematical problem. In the one-dimensional case the only available result is given by Jin, Levermore and McLaughlin (1999), using the inverse scattering technique. The semiclassical limit of focusing NLS is more delicate, but can also be obtained by inverse scattering: see Kamvissis, McLaughlin and Miller (2003). Remark 15.3. Let us close this subsection by noticing that the analysis for Hartree-type nonlinearities is found to require slightly less sophistication than for local ones (Alazard and Carles 2007) and that the intermediate case 0 < α < 1 can be understood as a perturbation of the situation for α = 0 (Carles 2007b). In addition, a threshold condition for global smooth solutions to (15.8) has been determined in Liu and Tadmor (2002). 15.3. Wigner measure techniques for nonlinear potentials One might hope to extend the results for Wigner measures given in Section 3 to nonlinear problems. This would have the considerable advantage of avoiding problems due to caustics. Unfortunately, this idea has not been very successful so far, the reason being that Wigner measures are obtained as weak limits only, which in general is not sufficient to pass to the limit in nonlinear terms. Indeed, one can even prove an ill-posedness result for Wigner measures in the nonlinear case (Carles 2001). A notable exception is the case of Hartree nonlinearities f = V0 ∗ |uε | with smooth interaction kernels V0 ∈ Cb1 (Rd ) (Lions and Paul 1993). In this case the Wigner measure associated to uε is found to be a solution of the self-consistent Vlasov equation: w(t, x, dξ). ∂t w + ξ · ∇ξ w − ∇x (V0 ∗ ρ) · ∇ξ w = 0, ρ(t, x) = Rd
198
S. Jin and P. Markowich and C. Sparber
The physically more interesting case of non-smooth interaction kernels, such 1 , which describes the coupling to a Poisson equation, is not as V0 ∼ |x| covered by this result and can only be established in the particular case of the fully mixed quantum state; see Lions and Paul (1993) and Markowich and Mauser (1993) for more details, and also Zhang (2002) for a similar result valid for short times only.
15.4. Numerical challenges Due to the introduction of nonlinear effects, the numerical difficulties discussed in Sections 4 and 5 are enhanced. The main numerical obstacles are the formation of singularities in focusing nonlinear Schr¨ odinger equations and the creation of new scales at caustics for both focusing and defocusing nonlinearities. Basic numerical studies of semiclassical NLS were conducted in Bao et al. (2002) and Bao, Jin and Markowich (2003b), with the result that finite difference methods typically require prohibitively fine meshes to even approximate observables well in semiclassical defocusing and focusing NLS computations. In the case when these very restrictive meshing constraints are bypassed, the usual finite difference schemes for NLS can deliver incorrect approximations in the classical limit ε → 0, without any particular sign of instability (Carles and Gosse 2007). Time-splitting spectral schemes are therefore the preferred method. To this end, we refer to Jin, Markowich and Zheng (2004) for the application of the time-splitting spectral method to the Zakharov system, to Huang, Jin, Markowich, Sparber and Zheng (2005) for the numerical solution of the Dirac–Maxwell system, and to Bao et al. (2003b) for numerical studies of nonlinear Schr¨ odinger equations. In addition, let us mention Bao, Jaksch and Markowich (2003a, 2004), where numerical simulations of the cubically nonlinear Gross–Pitaevskii equation (appearing in the description of Bose–Einstein condensates) are given using time-splitting trigonometric spectral methods. A numerical study of ground state solutions of the Gross–Pitaevskii equation can be found in Bao, Wang and Markowich (2005). Remark 15.4. Note, however, that in the nonlinear case, even for ε > 0 fixed, a rigorous convergence analysis of splitting methods is considerably more difficult than for linear Schr¨ odinger equations: see, e.g., Lubich (2008), Gauckler and Lubich (2010) and Faou and Grebert (2010). Due to the nonlinear creation of new highly oscillatory scales in the limit ε → 0, time-splitting methods suffer from more severe meshing restrictions for NLS than for linear Schr¨odinger equations, particularly after the appearance of the first caustics in the corresponding WKB approximation; see Bao et al. (2003b) and Carles and Gosse (2007) for more details. In the weakly
¨ dinger equations Methods for semiclassical Schro
199
nonlinear regime the following meshing strategy is sufficient: ∆x = O(ε),
∆t = O(ε)
(to be compared with (5.5)). In the regime of supercritical geometric optics, however, one typically requires (even for quadratic observable densities) ∆x = O(ε),
∆t = o(ε),
i.e., a severe restriction on the time step. In addition, one may need to invoke the Krasny filter (Krasny 1986), i.e., high Fourier-mode cut-offs, to avoid artifacts (such as symmetry breaking) in focusing NLS computations (Bao et al. 2003b). The latter, however, violates the conservation of mass: a clear drawback from the physics point of view. In order to overcome this problem, higher-order methods (in time) have to be deployed, such as exponential time-differencing or the use of integrating factors, and we refer to Klein (2008) for a comparison of different fourth-order methods for cubic NLS in the semiclassical regime. Remark 15.5. In the closely related problem of the complex Ginzburg– Landau equation in the large space and time limit, the situation is known to be slightly better, due to the dissipative nature of the equation; see Degond, Jin and Tang (2008) for a numerical investigation. Finally, we note that the cubic NLS in d = 1 is known to be fully integrable by means of inverse scattering. This feature can be used in the design of numerical algorithms, as has been done in Zheng (2006), for instance. A generalization to higher dimensions or more general nonlinearities seems to be out of reach at present. The lack of a clear mathematical understanding of the asymptotic behaviour of solutions to the semiclassical NLS beyond the formation of caustics has so far hindered the design of reliable asymptotic schemes. One of the few exceptions is the case of the Schr¨odinger–Poisson equation in d = 1, which can be analysed using Wigner measures, and which has recently been studied numerically in Jin, Wu and Yang (2010a) using a Gaussian beam method. In addition, moment closure methods have been employed for this type of nonlinearity, since it is known that the underlying classical problem, i.e., the Euler–Poisson system, allows for a construction of multivalued solutions. Numerical simulations for the classical system have been conducted in W¨ohlbier et al. (2005). In addition, the case of the Schr¨ odinger–Poisson equation with periodic potential is treated in Gosse and Mauser (2006).
200
S. Jin and P. Markowich and C. Sparber
REFERENCES1 D. Adalsteinsson and J. A. Sethian (1995), ‘A fast level set method for propagating interfaces’, J. Comput. Phys. 118, 269–277. T. Alazard and R. Carles (2007), ‘Semi-classical limit of Schr¨odinger–Poisson equations in space dimension n ≥ 3’, J. Diff. Equations 233, 241–275. L. Ambrosio (2004), ‘Transport equation and Cauchy problem for BV vector fields’, Invent. Math. 158, 227–260. G. Ariel, B. Engquist, N. Tanushev and R. Tsai (2011), Gaussian beam decomposition of high frequency wave fields using expectation-maximization. Submitted. D. Armbruster, D. Marthaler and C. Ringhofer (2003), ‘Kinetic and fluid model hierarchies for supply chains’, Multiscale Model. Simul. 2, 43–61. N. W. Ashcroft and N. D. Mermin (1976), Solid State Physics, Rinehart and Winston, New York. G. Bal and O. Pinaud (2006), ‘Accuracy of transport models for waves in random media’, Wave Motion 43, 561–578. G. Bal and L. Ryzhik (2004), ‘Time splitting for the Liouville equation in a random medium’, Comm. Math. Sci. 2, 515–534. G. Bal, A. Fannjiang, G. Papanicolaou and L. Ryzhik (1999a), ‘Radiative transport in a periodic structure’, J. Statist. Phys. 95, 479–494. G. Bal, J. B. Keller, G. Papanicolaou and L. Ryzhik (1999b), ‘Transport theory for acoustic waves with reflection and transmission at interfaces’, Wave Motion 30, 303–327. G. Bal, T. Komorowski and L. Ryzhik (2010), ‘Kinetic limits for waves in a random medium’, Kinetic and Related Models 3, 529–644. W. Bao and J. Shen (2005), ‘A fourth-order time-splitting Laguerre–Hermite pseudospectral method for Bose–Einstein condensates’, SIAM J. Sci. Comput. 26, 2010–2028. W. Bao, D. Jaksch and P. A. Markowich (2003a), ‘Numerical solution of the Gross–Pitaevskii equation for Bose–Einstein condensation’, J. Comput. Phys. 187, 318–342. W. Bao, D. Jaksch and P. A. Markowich (2004), ‘Three dimensional simulation of jet formation in collapsing condensates’, J. Phys. B: At. Mol. Opt. Phys. 37, 329–343. W. Bao, S. Jin and P. A. Markowich (2002), ‘On time-splitting spectral approximations for the Schr¨ odinger equation in the semiclassical regime’, J. Comput. Phys. 175, 487–524. W. Bao, S. Jin and P. A. Markowich (2003b), ‘Numerical study of time-splitting spectral discretizations of nonlinear Schr¨ odinger equations in the semiclassical regimes’, SIAM J. Sci. Comput. 25, 27–64. W. Bao, H. Wang and P. A. Markowich (2005), ‘Ground, symmetric and central vortex states in rotating Bose–Einstein condensates’, Comm. Math. Sci. 3, 57–88. 1
The URLs cited in this work were correct at the time of going to press, but the publisher and the authors make no undertaking that the citations remain live or are accurate or appropriate.
¨ dinger equations Methods for semiclassical Schro
201
N. Ben Abdallah, P. Degond and I. M. Gamba (2002), ‘Coupling one-dimensional time-dependent classical and quantum transport models’, J. Math. Phys. 43, 1–24. J.-D. Benamou (1999), ‘Direct computation of multivalued phase space solutions for Hamilton–Jacobi equations’, Comm. Pure Appl. Math. 52, 1443–1475. J.-D. Benamou and I. Solliec (2000), ‘An Eulerian method for capturing caustics’, J. Comput. Phys. 162, 132–163. J.-D. Benamou, O. Lafitte, R. Sentis and I. Solliec (2003), ‘A geometrical opticsbased numerical method for high frequency electromagnetic fields computations near fold caustics I’, J. Comput. Appl. Math. 156, 93–125. D. Benedetto, R. Esposito and M. Pulvirenti (2004), ‘Asymptotic analysis of quantum scattering under mesoscopic scaling’, Asymptot. Anal. 40, 163–187. A. Bensoussan, J. L. Lions and G. Papanicolaou (1978), Asymptotic Analysis for Periodic Structures, Vol. 5, North-Holland. ¨ F. Bloch (1928), ‘Uber die Quantenmechanik der Elektronen in Kristallgittern’, Z. Phys. 52, 555–600. F. Bouchut, S. Jin and X. Li (2003), ‘Numerical approximations of pressureless and isothermal gas dynamics’, SIAM J. Numer. Anal. 41, 135–158. S. Bougacha, J.-L. Akian and R. Alexandre (2009), ‘Gaussian beams summation for the wave equation in a convex domain’, Comm. Math. Sci. 7, 973–1008. Y. Brenier and L. Corrias (1998), ‘A kinetic formulation for multi-branch entropy solutions of scalar conservation laws’, Ann. Inst. H. Poincar´e Anal. Non Lin´eaire 15, 169–190. R. Carles (2000), ‘Geometric optics with caustic crossing for some nonlinear Schr¨odinger equations’, Indiana Univ. Math. J. 49, 475–551. R. Carles (2001), ‘Remarques sur les mesures de Wigner’, CR Acad. Sci. Paris S´er. I: Math. 332, 981–984. R. Carles (2007a), ‘Geometric optics and instability for semi-classical Schr¨ odinger equations’, Arch. Ration. Mech. Anal. 183, 525–553. R. Carles (2007b), ‘WKB analysis for nonlinear Schr¨ odinger equations with potential’, Comm. Math. Phys. 269, 195–221. R. Carles (2008), Semi-Classical Analysis for Nonlinear Schr¨ odinger Equations, World Scientific. R. Carles and L. Gosse (2007), ‘Numerical aspects of nonlinear Schr¨ odinger equations in the presence of caustics’, Math. Models Methods Appl. Sci. 17, 1531– 1553. R. Carles, P. A. Markowich and C. Sparber (2004), ‘Semiclassical asymptotics for weakly nonlinear Bloch waves’, J. Statist. Phys. 117, 343–375. T. Cazenave (2003), Semilinear Schr¨ odinger Equations, Vol. 10 of Courant Lecture Notes in Mathematics, Courant Institute of Mathematical Sciences, New York University. V. Cerven´ y (2001), Seismic Ray Theory, Cambridge University Press. T. F. Chan and L. Shen (1987), ‘Stability analysis of difference scheme for variable coefficient Schr¨ odinger type equations’, SIAM J. Numer. Anal. 24, 336–349. T. Chan, D. Lee and L. Shen (1986), ‘Stable explicit schemes for equations of the Schr¨odinger type’, SIAM J. Numer. Anal. 23, 274–281.
202
S. Jin and P. Markowich and C. Sparber
L.-T. Cheng, M. Kang, S. Osher, H. Shim and Y.-H. Tsai (2004), ‘Reflection in a level set framework for geometric optics’, CMES Comput. Model. Eng. Sci. 5, 347–360. L.-T. Cheng, H. Liu and S. Osher (2003), ‘Computational high-frequency wave propagation using the level set method, with applications to the semi-classical limit of Schr¨odinger equations’, Comm. Math. Sci. 1, 593–621. R. Courant and D. Hilbert (1962), Methods of Mathematical Physics, Vol. 2, Interscience. M. G. Crandall and P.-L. Lions (1983), ‘Viscosity solutions of Hamilton–Jacobi equations’, Trans. Amer. Math. Soc. 277, 1–42. P. Degond, S. Jin and M. Tang (2008), ‘On the time splitting spectral method for the complex Ginzburg–Landau equation in the large time and space scale limit’, SIAM J. Sci. Comput. 30, 2466–2487. M. Delfour, M. Fortin and G. Payre (1981), ‘Finite-difference solutions of a nonlinear Schr¨ odinger equation’, J. Comput. Phys. 44, 277–288. G. F. Dell’Antonio (1983), ‘Large time, small coupling behaviour of a quantum particle in a random field’, Ann. Inst. H. Poincar´e Sect. A (NS) 39, 339–384. R. J. DiPerna and P.-L. Lions (1989), ‘Ordinary differential equations, transport theory and Sobolev spaces’, Invent. Math. 98, 511–547. W. D¨ orfler (1998), ‘A time- and space-adaptive algorithm for the linear time dependent Schr¨ odinger equation’, Numer. Math. 73, 419–448. K. Drukker (1999), ‘Basics of surface hopping in mixed quantum/classical simulations’, J. Comput. Phys. 153, 225–272. J. J. Duistermaat (1996), Fourier Integral Operators, Vol. 130 of Progress in Mathematics, Birkh¨ auser. G. Dujardin and E. Faou (2007a), ‘Long time behavior of splitting methods applied to the linear Schr¨ odinger equation’, CR Math. Acad. Sci. Paris 344, 89–92. G. Dujardin and E. Faou (2007b), ‘Normal form and long time analysis of splitting schemes for the linear Schr¨odinger equation with small potential’, Numer. Math. 108, 223–262. B. Engquist and O. Runborg (1996), ‘Multi-phase computations in geometrical optics’, J. Comput. Appl. Math. 74, 175–192. TICAM Symposium (Austin, TX, 1995). B. Engquist and O. Runborg (2003), Computational high frequency wave propagation. In Acta Numerica, Vol. 12, Cambridge University Press, pp. 181–266. L. Erd¨ os and H.-T. Yau (2000), ‘Linear Boltzmann equation as the weak coupling limit of a random Schr¨ odinger equation’, Comm. Pure Appl. Math. 53, 667– 735. E. Faou and B. Grebert (2010), Resonances in long time integration of semi linear Hamiltonian PDEs. Preprint available at: www.irisa.fr/ipso/perso/faou/. C. Fermanian Kammerer and C. Lasser (2003), ‘Wigner measures and codimension two crossings’, J. Math. Phys. 44, 507–527. H. Flaschka, M. G. Forest and D. W. McLaughlin (1980), ‘Multiphase averaging and the inverse spectral solution of the Korteweg–de Vries equation’, Comm. Pure Appl. Math. 33, 739–784. S. Fomel and J. A. Sethian (2002), ‘Fast-phase space computation of multiple arrivals’, Proc. Nat. Acad. Sci. USA 99, 7329–7334.
¨ dinger equations Methods for semiclassical Schro
203
B. Fornberg (1996), A Practical Guide to Pseudospectral Methods, Vol. 1 of Cambridge Monographs on Applied and Computational Mathematics, Cambridge University Press. J.-P. Fouque, J. Garnier, G. Papanicolaou and K. Sølna (2007), Wave Propagation and Time Reversal in Randomly Layered Media, Vol. 56 of Stochastic Modelling and Applied Probability, Springer. J. Fr¨ohlich and T. Spencer (1983), ‘Absence of diffusion in the Anderson tight binding model for large disorder or low energy’, Comm. Math. Phys. 88, 151– 184. L. Gauckler and C. Lubich (2010), ‘Splitting integrators for nonlinear Schr¨ odinger equations over long times’, Found. Comput. Math. 10, 275–302. P. G´erard, P. A. Markowich, N. J. Mauser and F. Poupaud (1997), ‘Homogenization limits and Wigner transforms’, Comm. Pure Appl. Math. 50, 323–379. L. Gosse (2002), ‘Using K-branch entropy solutions for multivalued geometric optics computations’, J. Comput. Phys. 180, 155–182. L. Gosse (2006), ‘Multiphase semiclassical approximation of the one-dimensional harmonic crystal I: The periodic case’, J. Phys. A 39, 10509–10521. L. Gosse and F. James (2002), ‘Convergence results for an inhomogeneous system arising in various high frequency approximations’, Numer. Math. 90, 721–753. L. Gosse and P. A. Markowich (2004), ‘Multiphase semiclassical approximation of an electron in a one-dimensional crystalline lattice I: Homogeneous problems’, J. Comput. Phys. 197, 387–417. L. Gosse and N. J. Mauser (2006), ‘Multiphase semiclassical approximation of an electron in a one-dimensional crystalline lattice III: From ab initio models to WKB for Schr¨odinger–Poisson’, J. Comput. Phys. 211, 326–346. L. Gosse, S. Jin and X. Li (2003), ‘Two moment systems for computing multiphase semiclassical limits of the Schr¨ odinger equation’, Math. Models Methods Appl. Sci. 13, 1689–1723. V. L. Granastein, R. K. Parker and C. Armstrong (1999), ‘Vacuum electronics at the dawn of the twenty-first century’, Proc. IEEE 87, 702–716. E. Grenier (1998), ‘Semiclassical limit of the nonlinear Schr¨ odinger equation in small time’, Proc. Amer. Math. Soc. 126, 523–530. J.-C. Guillot, J. Ralston and E. Trubowitz (1988), ‘Semiclassical asymptotics in solid-state physics’, Comm. Math. Phys. 116, 401–415. G. A. Hagedorn (1994), ‘Molecular propagation through electron energy level crossings’, Mem. Amer. Math. Soc. 111, #536. E. J. Heller (1981), ‘Frozen Gaussians: A very simple semiclassical approximation’, J. Chem. Phys. 75, 2923–2931. E. J. Heller (2006), ‘Guided Gaussian wave packets’, Acc. Chem. Res. 39, 127–134. M. Herman and E. Kluk (1984), ‘A semiclassical justification for the use of nonspreading wavepackets in dynamics calculations’, J. Chem. Phys. 91, 2923– 2931. N. Hill (1990), ‘Gaussian beam migration’, Geophysics 55, 1416–1428. T. G. Ho, L. J. Landau and A. J. Wilkins (1993), ‘On the weak coupling limit for a Fermi gas in a random potential’, Rev. Math. Phys. 5, 209–298. I. Horenko, C. Salzmann, B. Schmidt and C. Sch¨ utte (2002), ‘Quantum-classical Liouville approach to molecular dynamics: Surface hopping Gaussian phasespace packets’, J. Chem. Phys. 117, 11075.
204
S. Jin and P. Markowich and C. Sparber
L. H¨ormander (1985), The Analysis of Linear Partial Differential Operators III, Springer. Z. Huang, S. Jin, P. A. Markowich and C. Sparber (2007), ‘A Bloch decompositionbased split-step pseudospectral method for quantum dynamics with periodic potentials’, SIAM J. Sci. Comput. 29, 515–538. Z. Huang, S. Jin, P. A. Markowich and C. Sparber (2008), ‘Numerical simulation of the nonlinear Schr¨ odinger equation with multidimensional periodic potentials’, Multiscale Model. Simul. 7, 539–564. Z. Huang, S. Jin, P. A. Markowich and C. Sparber (2009), ‘On the Bloch decomposition based spectral method for wave propagation in periodic media’, Wave Motion 46, 15–28. Z. Huang, S. Jin, P. A. Markowich, C. Sparber and C. Zheng (2005), ‘A timesplitting spectral scheme for the Maxwell–Dirac system’, J. Comput. Phys. 208, 761–789. G. Jiang and E. Tadmor (1998), ‘Nonoscillatory central schemes for multidimensional hyperbolic conservation laws’, SIAM J. Sci. Comput. 19, 1892–1917. S. Jin (2009), Recent computational methods for high frequency waves in heterogeneous media. In Industrial and Applied Mathematics in China, Vol. 10 of Ser. Contemp. Appl. Math. CAM, Higher Education Press, Beijing, pp. 49–64. S. Jin and X. Li (2003), ‘Multi-phase computations of the semiclassical limit of the Schr¨odinger equation and related problems: Whitham vs. Wigner’, Phys. D 182, 46–85. S. Jin and X. Liao (2006), ‘A Hamiltonian-preserving scheme for high frequency elastic waves in heterogeneous media’, J. Hyperbolic Diff. Eqn. 3, 741–777. S. Jin and K. A. Novak (2006), ‘A semiclassical transport model for thin quantum barriers’, Multiscale Model. Simul. 5, 1063–1086. S. Jin and K. A. Novak (2007), ‘A semiclassical transport model for twodimensional thin quantum barriers’, J. Comput. Phys. 226, 1623–1644. S. Jin and K. A. Novak (2010), ‘A coherent semiclassical transport model for purestate quantum scattering’, Comm. Math. Sci. 8, 253–275. S. Jin and S. Osher (2003), ‘A level set method for the computation of multivalued solutions to quasi-linear hyperbolic PDEs and Hamilton–Jacobi equations’, Comm. Math. Sci. 1, 575–591. S. Jin and X. Wen (2005), ‘Hamiltonian-preserving schemes for the Liouville equation with discontinuous potentials’, Comm. Math. Sci. 3, 285–315. S. Jin and X. Wen (2006a), ‘A Hamiltonian-preserving scheme for the Liouville equation of geometrical optics with partial transmissions and reflections’, SIAM J. Numer. Anal. 44, 1801–1828. S. Jin and X. Wen (2006b), ‘Hamiltonian-preserving schemes for the Liouville equation of geometrical optics with discontinuous local wave speeds’, J. Comput. Phys. 214, 672–697. S. Jin and Z. Xin (1998), ‘Numerical passage from systems of conservation laws to Hamilton–Jacobi equations, relaxation schemes’, SIAM J. Numer. Anal. 35, 2385–2404. S. Jin and X. Yang (2008), ‘Computation of the semiclassical limit of the Schr¨odinger equation with phase shift by a level set method’, J. Sci. Comput. 35, 144–169.
¨ dinger equations Methods for semiclassical Schro
205
S. Jin and D. Yin (2008a), ‘Computation of high frequency wave diffraction by a half plane via the Liouville equation and geometric theory of diffraction’, Comm. Comput. Phys. 4, 1106–1128. S. Jin and D. Yin (2008b), ‘Computational high frequency waves through curved interfaces via the Liouville equation and geometric theory of diffraction’, J. Comput. Phys. 227, 6106–6139. S. Jin and D. Yin (2011), ‘Computational high frequency wave diffraction by a corner via the Liouville equation and geometric theory of diffraction’, Kinetic and Related Models 4, 295–316. S. Jin, C. D. Levermore and D. W. McLaughlin (1999), ‘The semiclassical limit of the defocusing NLS hierarchy’, Comm. Pure Appl. Math. 52, 613–654. S. Jin, X. Liao and X. Yang (2008a), ‘Computation of interface reflection and regular or diffuse transmission of the planar symmetric radiative transfer equation with isotropic scattering and its diffusion limit’, SIAM J. Sci. Comput. 30, 1992–2017. S. Jin, H. Liu, S. Osher and R. Tsai (2005a), ‘Computing multi-valued physical observables for the high frequency limit of symmetric hyperbolic systems’, J. Comput. Phys. 210, 497–518. S. Jin, H. Liu, S. Osher and Y.-H. R. Tsai (2005b), ‘Computing multivalued physical observables for the semiclassical limit of the Schr¨odinger equation’, J. Comput. Phys. 205, 222–241. S. Jin, P. A. Markowich and C. Zheng (2004), ‘Numerical simulation of a generalized Zakharov system’, J. Comput. Phys. 201, 376–395. S. Jin, P. Qi and Z. Zhang (2011), ‘An Eulerian surface hopping method for the Schr¨odinger equation with conical crossings’, Multiscale Model. Simul. 9, 258– 281. S. Jin, H. Wu and X. Yang (2008b), ‘Gaussian beam methods for the Schr¨odinger equation in the semi-classical regime: Lagrangian and Eulerian formulations’, Comm. Math. Sci. 6, 995–1020. S. Jin, H. Wu and X. Yang (2010a), ‘A numerical study of the Gaussian beam methods for Schr¨ odinger–Poisson equations’, J. Comput. Math. 28, 261–272. S. Jin, H. Wu and X. Yang (2011), ‘Semi-Eulerian and high order Gaussian beam methods for the Schr¨ odinger equation in the semiclassical regime’, Comm. Comput. Phys. 9, 668–687. S. Jin, H. Wu, X. Yang and Z. Huang (2010b), ‘Bloch decomposition-based Gaussian beam method for the Schr¨odinger equation with periodic potentials’, J. Comput. Phys. 229, 4869–4883. S. Kamvissis, K. D. T.-R. McLaughlin and P. D. Miller (2003), Semiclassical Soliton Ensembles for the Focusing Nonlinear Schr¨ odinger Equation, Vol. 154 of Annals of Mathematics Studies, Princeton University Press. K. Kay (1994), ‘Integral expressions for the semi-classical time-dependent propagator’, J. Chem. Phys. 100, 4437–4392. K. Kay (2006), ‘The Herman–Kluk approximation: Derivation and semiclassical corrections’, J. Chem. Phys. 322, 3–12. J. B. Keller and R. M. Lewis (1995), Asymptotic methods for partial differential equations: The reduced wave equation and Maxwell’s equations. In Surveys in Applied Mathematics, Vol. 1, Plenum, pp. 1–82.
206
S. Jin and P. Markowich and C. Sparber
H. Kitada (1980), ‘On a construction of the fundamental solution for Schr¨odinger equations’, J. Fac. Sci. Univ. Tokyo Sect. IA Math. 27, 193–226. C. Klein (2008), ‘Fourth order time-stepping for low dispersion Korteweg–de Vries and nonlinear Schr¨ odinger equations’, Electron. Trans. Numer. Anal. 29, 116– 135. R. Krasny (1986), ‘A study of singularity formation in a vortex sheet by the pointvortex approximation’, J. Fluid Mech. 167, 65–93. S. Kube, C. Lasser and M. Weber (2009), ‘Monte Carlo sampling of Wigner functions and surface hopping quantum dynamics’, J. Comput. Phys. 228, 1947– 1962. L. Landau (1932), ‘Zur Theorie der Energie¨ ubertragung II’, Physics of the Soviet Union 2, 46–51. C. Lasser and S. Teufel (2005), ‘Propagation through conical crossings: An asymptotic semigroup’, Comm. Pure Appl. Math. 58, 1188–1230. C. Lasser, T. Swart and S. Teufel (2007), ‘Construction and validation of a rigorous surface hopping algorithm for conical crossings’, Comm. Math. Sci. 5, 789– 814. P. D. Lax (1957), ‘Asymptotic solutions of oscillatory initial value problems’, Duke Math. J. 24, 627–646. B. Leimkuhler and S. Reich (2004), Simulating Hamiltonian Dynamics, Vol. 14 of Cambridge Monographs on Applied and Computational Mathematics, Cambridge University Press. S. Leung and J. Qian (2009), ‘Eulerian Gaussian beams for Schr¨odinger equations in the semi-classical regime’, J. Comput. Phys. 228, 2951–2977. S. Leung, J. Qian and R. Burridge (2007), ‘Eulerian Gaussian beams for high frequency wave propagation’, Geophysics 72, 61–76. C. Levermore (1996), ‘Moment closure hierarchies for kinetic theories’, J. Statist. Phys. 83, 1021–1065. X. Li, J. G. W¨ohlbier, S. Jin and J. Booske (2004), ‘An Eulerian method for computing multi-valued solutions to the Euler–Poisson equations and applications to wave breaking in klystrons’, Phys. Rev. E 70, 016502. P.-L. Lions and T. Paul (1993), ‘Sur les mesures de Wigner’, Rev. Mat. Iberoamericana 9, 553–618. H. Liu and J. Ralston (2010), ‘Recovery of high frequency wave fields from phase space-based measurements’, Multiscale Model. Simul. 8, 622–644. H. Liu and E. Tadmor (2002), ‘Semi-classical limit of the nonlinear Schr¨ odinger– Poisson equation with sub-critical initial data’, Methods Appl. Anal. 9, 517– 532. H. Liu and Z. Wang (2007), ‘A field-space-based level set method for computing multi-valued solutions to 1D Euler–Poisson equations’, J. Comput. Phys. 225, 591–614. H. Liu, O. Runborg and N. Tanushev (2011), Error estimates for Gaussian beam superpositions. Submitted. J. Lu and X. Yang (2011), ‘Frozen Gaussian approximation for high frequency wave propagation’, Commun. Math. Sci. 9, 663–683. C. Lubich (2008), ‘On splitting methods for Schr¨odinger–Poisson and cubic nonlinear Schr¨ odinger equations’, Math. Comp. 77, 2141–2153.
¨ dinger equations Methods for semiclassical Schro
207
A. J. Majda, G. Majda and Y. X. Zheng (1994), ‘Concentrations in the onedimensional Vlasov–Poisson equations I: Temporal development and nonunique weak solutions in the single component case’, Phys. D 74, 268–300. P. A. Markowich and N. J. Mauser (1993), ‘The classical limit of a self-consistent quantum-Vlasov equation in 3D’, Math. Models Methods Appl. Sci. 3, 109– 124. P. A. Markowich and F. Poupaud (1999), ‘The pseudo-differential approach to finite differences revisited’, Calcolo 36, 161–186. P. A. Markowich, N. J. Mauser and F. Poupaud (1994), ‘A Wigner-function approach to (semi)classical limits: Electrons in a periodic potential’, J. Math. Phys. 35, 1066–1094. P. A. Markowich, P. Pietra and C. Pohl (1999), ‘Numerical approximation of quadratic observables of Schr¨ odinger-type equations in the semi-classical limit’, Numer. Math. 81, 595–630. V. Maslov, ed. (1981), Semiclassical Approximations in Quantum Mechanics, Reidel, Dordrecht. R. I. McLachlan and G. R. W. Quispel (2002), Splitting methods. In Acta Numerica, Vol. 11, Cambridge University Press, pp. 341–434. L. Miller (2000), ‘Refraction of high-frequency waves density by sharp interfaces and semiclassical measures at the boundary’, J. Math. Pures Appl. (9) 79, 227–269. M. Motamed and O. Runborg (2010), ‘Taylor expansion and discretization errors in Gaussian beam superposition’, Wave Motion 47, 421–439. F. Nier (1995), ‘Asymptotic analysis of a scaled Wigner equation and quantum scattering’, Transport Theory Statist. Phys. 24, 591–628. ´ F. Nier (1996), ‘A semi-classical picture of quantum scattering’, Ann. Sci. Ecole Norm. Sup. (4) 29, 149–183. S. Osher and J. A. Sethian (1988), ‘Fronts propagating with curvature-dependent speed: Algorithms based on Hamilton–Jacobi formulations’, J. Comput. Phys. 79, 12–49. S. Osher, L.-T. Cheng, M. Kang, H. Shim and Y.-H. Tsai (2002), ‘Geometric optics in a phase-space-based level set and Eulerian framework’, J. Comput. Phys. 179, 622–648. G. Panati, H. Spohn and S. Teufel (2006), Motion of electrons in adiabatically perturbed periodic structures. In Analysis, Modeling and Simulation of Multiscale Problems, Springer, pp. 595–617. D. Pathria and J. Morris (1990), ‘Pseudo-spectral solution of nonlinear Schr¨ odinger equations’, J. Comput. Phys. 87, 108–125. D. Peng, B. Merriman, S. Osher, H. Zhao and M. Kang (1999), ‘A PDE-based fast local level set method’, J. Comput. Phys. 155, 410–438. B. Perthame and C. Simeoni (2001), ‘A kinetic scheme for the Saint-Venant system with a source term’, Calcolo 38, 201–231. M. M. Popov (1982), ‘A new method of computation of wave fields using Gaussian beams’, Wave Motion 4, 85–97. J. Qian and L. Ying (2010), ‘Fast Gaussian wavepacket transforms and Gaussian beams for the Schr¨ odinger equation’, J. Comput. Phys. 229, 7848–7873.
208
S. Jin and P. Markowich and C. Sparber
J. Ralston (1982), Gaussian beams and the propagation of singularities. In Studies in Partial Differential Equations, Vol. 23 of MAA Stud. Math., Mathematical Association of America, pp. 206–248. M. Reed and B. Simon (1975), Methods of Modern Mathematical Physics II: Fourier Analysis, Self-Adjointness, Academic Press. M. Reed and B. Simon (1976), Methods of Modern Mathematical Physics IV: Analysis of Operators, Academic Press. D. Robert (2010), ‘On the Herman–Kluk semiclassical approximation’, Rev. Math. Phys. 22, 1123–1145. O. Runborg (2000), ‘Some new results in multiphase geometrical optics’, M2AN Math. Model. Numer. Anal. 34, 1203–1231. L. Ryzhik, G. Papanicolaou and J. B. Keller (1996), ‘Transport equations for elastic and other waves in random media’, Wave Motion 24, 327–370. A. Shapere and F. Wilczek, eds (1989), Geometric Phases in Physics, Vol. 5 of Advanced Series in Mathematical Physics, World Scientific. D. Sholla and J. Tully (1998), ‘A generalized surface hopping method’, J. Chem. Phys. 109, 7702. C. Sparber, P. Markowich and N. Mauser (2003), ‘Wigner functions versus WKBmethods in multivalued geometrical optics’, Asymptot. Anal. 33, 153–187. H. Spohn (1977), ‘Derivation of the transport equation for electrons moving through random impurities’, J. Statist. Phys. 17, 385–412. H. Spohn and S. Teufel (2001), ‘Adiabatic decoupling and time-dependent Born– Oppenheimer theory’, Comm. Math. Phys. 224, 113–132. J. C. Strikwerda (1989), Finite Difference Schemes and Partial Differential Equations, The Wadsworth & Brooks/Cole Mathematics Series, Wadsworth & Brooks/Cole Advanced Books & Software. C. Sulem and P.-L. Sulem (1999), The Nonlinear Schr¨ odinger Equation: SelfFocusing and Wave Collapse, Vol. 139 of Applied Mathematical Sciences, Springer. G. Sundaram and Q. Niu (1999), ‘Wave-packet dynamics in slowly perturbed crystals: Gradient corrections and Berry-phase effects’, Phys. Rev. B 59, 14915– 14925. T. Swart and V. Rousse (2009), ‘A mathematical justification for the Herman–Kluk propagator’, Comm. Math. Phys. 286, 725–750. T. Taha and M. J. Ablowitz (1984), ‘Analytical and numerical aspects of certain nonlinear evolution equations II: Numerical, nonlinear Schr¨ odinger equations’, J. Comput. Phys. 55, 203–230. N. M. Tanushev (2008), ‘Superpositions and higher order Gaussian beams’, Comm. Math. Sci. 6, 449–475. N. M. Tanushev, B. Engquist and R. Tsai (2009), ‘Gaussian beam decomposition of high frequency wave fields’, J. Comput. Phys. 228, 8856–8871. L. Tartar (1990), ‘H-measures: A new approach for studying homogenisation, oscillations and concentration effects in partial differential equations’, Proc. Roy. Soc. Edinburgh Sect. A 115, 193–230. S. Teufel (2003), Adiabatic Perturbation Theory in Quantum Dynamics, Vol. 1821 of Lecture Notes in Mathematics, Springer.
¨ dinger equations Methods for semiclassical Schro
209
J. Tully (1990), ‘Molecular dynamics with electronic transitions’, J. Chem. Phys. 93, 1061–1071. J. Tully and R. Preston (1971), ‘Trajectory surface hopping approach to nonadiabatic molecular collisions: The reaction of h+ with d2 ’, J. Chem. Phys. 55, 562–572. D. Wei, S. Jin, R. Tsai and X. Yang (2010), ‘A level set method for the semiclassical limit of the Schr¨odinger equation with discontinuous potentials’, Comm. Comput. Phys. 229, 7440–7455. X. Wen (2009), ‘Convergence of an immersed interface upwind scheme for linear advection equations with piecewise constant coefficients II: Some related binomial coefficient inequalities’, J. Comput. Math. 27, 474–483. X. Wen (2010), ‘High order numerical methods to three dimensional delta function integrals in level set methods’, SIAM J. Sci. Comput. 32, 1288–1309. X. Wen and S. Jin (2009), ‘The l1 -stability of a Hamiltonian-preserving scheme for the Liouville equation with discontinuous potentials’, J. Comput. Math. 27, 45–67. G. Whitham (1974), Linear and Nonlinear Waves, Wiley-Interscience. E. P. Wigner (1932), ‘On the quantum correction for thermodynamic equilibrium’, Phys. Rev. 40, 749–759. C. H. Wilcox (1978), ‘Theory of Bloch waves’, J. Anal. Math. 33, 146–167. J. G. W¨ohlbier, S. Jin and S. Sengele (2005), ‘Eulerian calculations of wave breaking and multivalued solutions in a traveling wave tube’, Physics of Plasmas 12, 023106–023113. L. Wu (1996), ‘Dufort–Frankel-type methods for linear and nonlinear Schr¨ odinger equations’, SIAM J. Numer. Anal. 33, 1526–1533. D. Yin and C. Zheng (2011), Composite Gaussian beam approximation method for multi-phased wave functions. Submitted. L. Ying and E. J. Cand`es (2006), ‘The phase flow method’, J. Comput. Phys. 220, 184–215. C. Zener (1932), ‘Non-adiabatic crossing of energy levels’, Proc. Royal Soc. London, Ser. A 137, 692–702. P. Zhang (2002), ‘Wigner measure and the semiclassical limit of Schr¨ odinger– Poisson equations’, SIAM J. Math. Anal. 34, 700–718. C. Zheng (2006), ‘Exact nonreflecting boundary conditions for one-dimensional cubic nonlinear Schr¨odinger equations’, J. Comput. Phys. 215, 552–565.
Acta Numerica (2011), pp. 211–289 doi:10.1017/S0962492911000043
c Cambridge University Press, 2011 Printed in the United Kingdom
Tsunami modelling with adaptively refined finite volume methods∗ Randall J. LeVeque Department of Applied Mathematics, University of Washington, Seattle, WA 98195-2420, USA E-mail:
[email protected]
David L. George US Geological Survey, Cascades Volcano Observatory, Vancouver, WA 98683, USA E-mail:
[email protected]
Marsha J. Berger Courant Institute of Mathematical Sciences, New York University, NY 10012, USA E-mail:
[email protected] Numerical modelling of transoceanic tsunami propagation, together with the detailed modelling of inundation of small-scale coastal regions, poses a number of algorithmic challenges. The depth-averaged shallow water equations can be used to reduce this to a time-dependent problem in two space dimensions, but even so it is crucial to use adaptive mesh refinement in order to efficiently handle the vast differences in spatial scales. This must be done in a ‘wellbalanced’ manner that accurately captures very small perturbations to the steady state of the ocean at rest. Inundation can be modelled by allowing cells to dynamically change from dry to wet, but this must also be done carefully near refinement boundaries. We discuss these issues in the context of Riemann-solver-based finite volume methods for tsunami modelling. Several examples are presented using the GeoClaw software, and sample codes are available to accompany the paper. The techniques discussed also apply to a variety of other geophysical flows.
∗
Colour online for monochrome figures available at journals.cambridge.org/anu.
212
R. J. LeVeque, D. L. George and M. J. Berger
CONTENTS 1 Introduction 2 Tsunamis and tsunami modelling 3 The shallow water equations 4 Finite volume methods 5 The nonlinear Riemann problem 6 Algorithms in two space dimensions 7 Source terms for friction 8 Adaptive mesh refinement 9 Interpolation strategies for coarsening and refining 10 Verification, validation, and reproducibilty 11 The radial ocean 12 The 27 February 2010 Chile tsunami 13 Final remarks References
212 217 226 238 242 248 251 252 256 265 268 273 282 283
1. Introduction Many fluid flow or wave propagation problems in geophysics can be modelled with two-dimensional depth-averaged equations, of which the shallow water equations are the simplest example. In this paper we focus primarily on the problem of modelling tsunamis propagating across an ocean and inundating coastal regions, but a number of related applications have also been tackled with depth-averaged approaches, such as storm surges arising from hurricanes or typhoons; sediment transport and coastal morphology; river flows and flooding; failures of dams, levees or weirs; tidal motions and internal waves; glaciers and ice flows; pyroclastic or lava flows; landslides, debris flows, and avalanches. These problems often share the following features. • The governing equations are a nonlinear hyperbolic system of conservation laws, usually with source terms (sometimes called balance laws). • The flow takes place over complex topography or bathymetry (the term used for topography below sea level). • The flow is of bounded extent: the depth goes to zero at the margins or shoreline and the ‘wet–dry interface’ is a moving boundary that must be captured as part of the flow. • There exist non-trivial steady states (such as a body of water at rest) that should be maintained exactly. Often the wave propagation or flow to be modelled is a small perturbation of this steady state. • There are multiple scales in space and/or time, requiring adaptively refined grids in order to efficiently simulate the full problem, even when
Tsunami modelling
213
two-dimensional depth-averaged equations are used. For geophysical problems it may be necessary to refine each spatial dimension by five orders of magnitude or more in some regions compared to the grid used on the full domain. Transoceanic tsunami modelling provides an excellent case study to explore the computational difficulties inherent in these problems. The goal of this paper is to discuss these challenges and present a set of computational techniques to deal with them. Specifically, we will describe the methods that are implemented in GeoClaw, open source software for solving this class of problems that is distributed as part of Clawpack (www3). The main focus is not on this specific software, however, but on general algorithmic ideas that may also be useful in the context of other finite volume methods, and also to problems outside the domain of geophysical flows that exhibit similar computational difficulties. For the interested reader, the software itself is described in more detail in Berger, George, LeVeque and Mandli (2010) and in the GeoClaw documentation (www7). We will also survey some uses of tsunami modelling and a few of the challenges that remain in developing this field, and geophysical flow modelling more generally. This is a rich source of computational and modelling problems with applicability to better understanding a variety of hazards throughout the world. The two-dimensional shallow water equations generally provide a good model for tsunamis (as discussed further below), but even so it is essential to use adaptive mesh refinement (AMR) in order to efficiently compute accurate solutions. At specific locations along the coast it may be necessary to model small-scale features of the bathymetry as well as levees, sea walls, or buildings on the scale of metres. Modelling the entire ocean with this resolution is clearly both impossible and unnecessary for a tsunami that may have originated thousands of kilometres away. In fact, the wavelength of a tsunami in the ocean may be 100 km or more, so that even in the region around the wave a resolution on the scale of several km is appropriate. In undisturbed regions of the ocean even larger grid cells are optimal. In Section 12.1 we show an example where the coarsest cells are 2◦ of latitude and longitude on each side. Five levels of mesh refinement are used, with the finest grids used only near Hilo, Hawaii, where the total refinement factor of 214 = 16 384 in each spatial dimension, so that the finest grid has roughly 10 m resolution. With adaptive refinement we can simulate the propagation of a tsunami originating near Chile (see Figure 1.1 and Section 12) and the inundation of Hilo (see Section 12.1) in a few hours on a single processor. The shallow water equations are a nonlinear hyperbolic system of partial differential equations and solutions may contain shock waves (hydraulic jumps). In the open ocean a tsunami has an extremely small amplitude
214
R. J. LeVeque, D. L. George and M. J. Berger
Figure 1.1. The 27 February 2010 tsunami as computed using GeoClaw. In this computation a uniform 216 × 300 grid with ∆x = ∆y = 1/6 degree (10 arcminutes) is used. Compare to Figure 12.1, where adaptive mesh refinement is used. The surface elevation and bathymetry along the indicated transect is shown in Figure 1.2. The colour scale for the surface is in metres relative to mean sea level. The location of DART buoy 32412 discussed in the text is also indicated.
(relative to the depth of the ocean) and long wavelength. Hence the propagation is essentially linear, with variable coefficients due to varying bathymetry. As a tsunami approaches shore, however, the amplitude typically increases while the depth of the water decreases and nonlinear effects become important. It is thus desirable to use a method that handles the nonlinearity well (e.g., a high-resolution shock-capturing method), while also being efficient in the linear regime. In general we would like the method to conserve mass to the extent possible (the momentum equations contain source terms due to the varying bathymetry and possibly Coriolis and frictional drag terms). In this paper we focus on shock-capturing finite volume designed for nonlinear problems that are extensions of Godunov’s method. These methods are based on solving Riemann problems at the interfaces between grid cells, which consist of
Tsunami modelling
215
the given equations together with piecewise constant initial data determined by the cell averages on either side. Second-order correction terms are defined using limiters to avoid non-physical oscillations that might otherwise appear in regions of steep gradients (e.g., breaking waves or turbulent bores that arise as a tsunami approaches and inundates the shore). The methods exactly conserve mass on a fixed grid, but as we will see in Section 9.2 mass conservation is not generally possible or desirable near the shore when AMR is used. Even away from the shore, conserving mass when the grid is refined or de-refined requires some care when the bathymetry varies, as discussed in Section 9.1. Studying the effect of a tsunami requires accurate modelling of the motion of the shoreline; a major tsunami can inundate several kilometres inland in low-lying regions. This is a free boundary problem and the location of the wet–dry interface must be computed as part of the numerical solution; in fact this is one of the most important aspects of the computed solution for practical purposes. Most tsunami codes do not attempt to explicitly track the moving boundary, which would be very difficult for most realistic problems since the shoreline topology is constantly changing as islands and isolated lakes appear and disappear. Some tsunami models use a fixed shoreline location with solid wall boundary conditions and measure the depth of the solution at this boundary, perhaps converting this via empirical expression to estimates of the inundation distances and run-up (the elevation above sea level at the point of maximum inundation). Most recent codes, however, use some ‘wetting and drying’ algorithm. The computational grid covers dry land as well as the ocean, and each grid cell is allowed to be wet (h > 0) or dry (h = 0) in the shallow water equations. The state of each cell can change dynamically in each time step as the wave advances or retreats. Of course accurate modelling of the inundation also requires detailed models of the local topography and bathymetry on a scale of tens of metres or less, while the water depth must be resolved to a fraction of a metre. Again this generally requires the use of mesh refinement to achieve a suitable resolution at the coast. In the context of a Godunov-type method, it is necessary to develop a robust Riemann solver that can deal with Riemann problems in which one cell is initially dry, as well as the case where a cell dries out as the water recedes. This must be done in a manner that does not result in undershoots that might lead to negative fluid depth. For tsunami modelling it is essential to accurately capture small perturbations to undisturbed water at rest; the ocean is 4 km deep on average while even a major tsunami has an amplitude less than 1 m in the open ocean. Moreover, the wavelength may be 100 km or more, so that over 1 km, for example, the ocean surface elevation in a tsunami wave varies by less than 1 cm while the bathymetry (and hence the water depth) may vary
216
R. J. LeVeque, D. L. George and M. J. Berger
(a)
Metres
Surface elevation 0.2 0.0 0.2
95
90
2000
80
75
70
85 80 Degrees longitude
75
70
85 500 km
(b)
Metres depth
0 2000 4000 6000 95
90
Figure 1.2. Cross-section of the Pacific Ocean on a transect at constant latitude 25◦ S, as shown in Figure 1.1. (b) Full depth of the ocean. (a) Zoom of the surface elevation from −20 cm to 20 cm showing the small amplitude and long wavelength of the tsunami, 2.5 hours after the earthquake. Note the difference in vertical scales and that in both figures the vertical scale is greatly exaggerated relative to the horizontal scale. The bathymetry and surface elevation are shown as piecewise constant functions over the finite volume cells used, in order to illustrate the large jump in bathymetry between neighbouring grid cells.
by hundreds of metres. This is illustrated in Figure 1.2, which shows a crosssection of the Pacific Ocean along the transect indicated in Figure 1.1, along with a zoomed view of the top surface exhibiting the long wavelength of the tsunami. This extreme difference in scales makes it particularly important that a numerical method be employed that can maintain the steady state of the ocean at rest, and that accurately captures small perturbations to this steady state. Such methods are often called ‘well-balanced’, because the balance between the flux gradient and the source terms must be maintained numerically. This must also be done in a way that remains well-balanced in the context of AMR, with no spurious waves generated at mesh refinement boundaries. We discuss this difficulty and our approach to well-balancing further in Section 3.1. Two-dimensional finite volume methods can be applied either on regular (logically rectangular) quadrilateral grids or on unstructured grids such as triangulations. Unstructured grids have the advantage of being able to fit complicated geometries more easily, and for complex coastlines this may seem the obvious approach. For a fixed coastline this might be true, but
Tsunami modelling
217
when inundation is modelled using a wetting and drying approach the advantage is no longer clear. Logically rectangular grids (indexed by (i, j)) in fact have several advantages: high accuracy is often easier to obtain (at least for smoothly varying grids), and refinement on rectangular patches is natural and relatively easy to perform. The GeoClaw software uses patchbased logically rectangular grids following the approach of Berger, Colella and Oliger (Berger and Colella 1989, Berger and Oliger 1984, Berger and LeVeque 1998). This approach to AMR has been extensively used over the past three decades in many applications and software packages, including Clawpack as well as Chombo (www2), AMROC (www1), SAMRAI (www11), and FLASH (www6). We review this approach in Section 8 and discuss several difficulties that arise in applications to tsunamis. For many geophysical flow problems it is natural to use either purely Cartesian coordinates (over relatively small domains) or latitude–longitude coordinates on the sphere. The latter is generally used for tsunami propagation problems, for which the region of interest is usually far from the poles. For problems on the full sphere, other grids may be more appropriate, as discussed briefly in Section 6.2. For problems such as flooding of a serpentine river, it may be most appropriate to use a coarse grid that broadly follows the river valley, together with AMR to focus computational cells in the region where the river actually lies. In Section 6 we discuss a class of two-dimensional wave propagation algorithms that maintain stability and accuracy on general quadrilateral grids. When developing methods to simulate complex geophysical flows it is very important to perform validation and verification studies, as discussed in Section 10. This requires both tests on synthetic problems where the accuracy of the solvers can be judged as well as comparison to observations from real events. Sections 11 and 12 present computational results of each type in order to illustrate the application of these methods.
2. Tsunamis and tsunami modelling The term tsunami (which means ‘harbour wave’ in Japanese) generally refers to any impulse-generated gravity wave. Tsunamis can arise from many different sources. Most large tsunamis are generated by vertical displacement of the ocean floor during megathrust earthquakes on subduction zones. At a subduction zone, one plate (typically an oceanic plate) descends beneath another (typically continental) plate. The rate of this plate motion is on the order of centimetres per year. In the shallow part of the subduction zone, at depths less than 40 km, the plates are usually stuck together and the leading edge of the upper plate is dragged downwards. Slip during an earthquake releases this part of the plate, generally causing both upward and downward deformation of the ocean floor, and hence
218
R. J. LeVeque, D. L. George and M. J. Berger
the entire water column above it. The vertical displacement can be several metres, and it can extend across areas of tens of thousands of square kilometres. Displacing this quantity of water by several metres injects an enormous amount of potential energy into the ocean (as much as 1023 ergs for a large tsunami, equivalent to roughly 10 megatonnes of TNT). The potential energy is given by η(x,y) ρgz dz dx dy Potential energy = (2.1) 0 1 2 ρgη (x, y) dx dy, = 2 where ρ is the density of water, g is the gravitational constant, and η(x, y) is the displacement of the surface from sea level. Here x and y are horizontal Cartesian coordinates and z is the vertical direction. This energy is carried away by propagating waves that tend to wreak their greatest havoc nearby, but if the tsunami is large enough can also cause severe flooding and damage thousands of kilometres away. Long-range tsunamis are often termed teletsunamis or far-field tsunamis, to distinguish them from local tsunamis that affect only regions near the source. For example, the Aceh–Andaman earthquake on 26 December 2004 generated a tsunami along the zone where the Indian plate is subducting beneath the Burma platelet. The rupture extended for a length of roughly 1500 km and displaced water over a region approximately 150 km wide, with a vertical displacement of several metres. More recently, the Chilean earthquake of 27 February 2010 set off a tsunami along part of the South American subduction zone, where the Nazca plate descends beneath the South American plate. The fault-rupture length was shorter, perhaps 450 km, and fault displacement was also less, yielding a tsunami considerably smaller than the Indian Ocean tsunami of 2004. The fact that a megathrust earthquake displaces the entire water column over a large surface area is advantageous to modellers, since it means that use of the two-dimensional shallow water equations is well justified. These equations, introduced in Section 3, model gravity waves with long wavelength (relative to the depth of the fluid) in which the entire water column is moving. These conditions are well satisfied as the tsunami propagates across an ocean. A secondary source of tsunamis is submarine landslides, also called subaqueous landslides; see for example Bardet, Synolakis, Davies, Imamura and Okal (2003), Masson, Harbitz, Wynn, Pedersen and Løvholt (2006), Ostapenko (1999) and Watts, Grilli, Kirby, Fryer and Tappin (2003). These often occur on the continental slope, which can be several kilometres high and quite steep. The displacement of a large mass on the seafloor causes a corresponding perturbation of the water column above this region, which
Tsunami modelling
219
again results in gravity waves that can appear as tsunamis. The local displacements may be much larger than in a megathrust earthquake, but usually over much smaller areas and so the resulting tsunamis have far less energy and rapidly dissipate as they radiate outwards. However, they can still do severe damage to nearby coastal regions. For example, an earthquake in 1998 resulted in a tsunami that destroyed several villages and killed more than 2000 people along a 30 km stretch of the north shore of Papua New Guinea. In this case it is thought that the tsunami was caused by a coseismic submarine landslide rather than by the earthquake itself (Synolakis et al. 2002). In the case of large earthquakes, it is possible that in addition to the seismic event itself, thousands of coseismic landslides may also occur, leading to additional tsunamis. As an example, Plafker, Kachadoorian, Eckel and Mayo (1969) documented numerous tsunamis in Alaskan fjords in connection with the 1964 earthquake. There have also been submarine slumps of epic proportions that have caused large-scale destruction. An example is the Storegga slide roughly 8200 years ago on the Norwegian shelf, in which as much as 3000 km3 of mass was set in motion, creating a tsunami that inundated areas as far away as Scotland (Dawson, Long and Smith 1988, Haflidason, Sejrup, Nyg˚ ard, Mienert and Bryn 2004). Subaerial landslides occurring along the coast can also cause localized tsunamis when the landslide debris enters the water. For example, a largescale landslide on Lituya Bay in Alaska in 1958 caused a landslide within the bay that washed trees away to an elevation of 500 m on the far side of the bay, as documented by Miller (1960) and studied for example in Mader and Gittings (2002), Weiss, Fritz and W¨ unnemann (2009). Tsunamis and seiches can also arise in lakes as a result of earthquakes or landslides. As an example see McCulloch (1966). The example we use in this paper is the tsunami generated by the Chilean earthquake of 27 February 2010. The computational advantages of the AMR techniques discussed in this paper are particularly dramatic in modelling far-field effects of transoceanic tsunamis, but are also important in modelling localized tsunamis or the near-field region (which is hardest hit by any tsunami). Typically much higher resolution is needed along a small portion of the coast of primary interest than elsewhere, and over much of the computational domain there is dry land or quiescent water where a very coarse grid can be used. 2.1. Available data sets Modelling a tsunami requires not only a set of mathematical equations and computational techniques, it also requires data sets, often very large ones. We must specify the bathymetry of the ocean and coastal regions, the topo-
220
R. J. LeVeque, D. L. George and M. J. Berger
graphy onshore in regions that may be inundated, and the motion of the seafloor that initiates the tsunami. For validation studies we also need observed data from past events, which might include DART buoy (Deepocean Assessment and Reporting of Tsunamis) or tide gauge data as well as post-tsunami field surveys of run-up and inundation. Fortunately there are now ample sources of real data available online that are relatively easy to work with. One of the goals of our own work has been to provide tools to facilitate this, and to provide templates that may be useful in setting up and solving a new tsunami problem. This is still work in progress, but some pointers and documentation are provided in the GeoClaw documentation (www7). Large-scale bathymetry at the resolution of 1 minute (1/60 degree) for the entire Earth is available from the National Geophysical Data Center (NGDC). The National Geophysical Data Center (NGDC) GEODAS Grid Translator (www9) allows one to specify a rectangular latitude–longitude domain and download bathymetry at a choice of resolutions. Note that one degree of latitude is about 111 km and one degree longitude varies from 111 km at the equator to half that at 60◦ North, for example. For modelling transoceanic propagation we have found that 10-minute data, with a resolution of roughly 18 km, are often sufficient. In coastal regions greater resolution is required. In particular, in order to model inundation of a target region it may be necessary to have data sets with a resolution of tens of metres or less. The availability of such data varies greatly. In some countries coastal bathymetry is virtually impossible to obtain. In other locations it is easily available online. In particular, many coastal regions of the US are covered by data sets available from NOAA DEMs (www10). In addition to bathymetry, it is necessary to have matching onshore topography for regions where inundation is to be studied. Unfortunately bathymetry and topography are generally measured by different techniques and sometimes the data sets do not match up properly at the coastline, which of course is exactly the region of primary interest in modelling inundation. Often a great deal of work has already gone into creating the public data sets in order to reconcile these differences, but an awareness of potential difficulties is valuable. When studying landslide-induced tsunamis, an additional difficulty is that detailed bathymetry of the region around the slide is typically obtained only after the slide has occurred. Without pre-slide bathymetry at the same resolution it can be difficult to determine the correct initial bathymetry or the mass of the slide, which of course is crucial to know in order to generate the correct tsunami numerically. For subduction zone events it is also necessary to know the seafloor displacement in order to generate the tsunami. In this case the modeller is aided by the fact that the mechanics of some earthquakes have been well
Tsunami modelling
221
studied. For large events there are generally ample seismic data available from around the world that can be used to attempt to reconstruct the focal mechanism of the quake: the direction of slip and orientation of the fault, along with the depth at which the rupture occurred, the length of the rupture, the magnitude of the displacement, etc. An event can sometimes be modelled by a simplified representation consisting of a few such parameters, for example the USGS model of the Chile 2010 earthquake (www12) that we use in some of our examples later in this paper. To convert these parameters into seafloor deformation in each grid cell would require solving three-dimensional elasticity equations with a dislocation within the earth, and would require detailed knowledge of the elastic parameters and the geological substructure of the earth in the region of the quake. Instead, a simplified model is generally used to quickly convert parameters into approximate seafloor deformation, such as the well-known model introduced by Mansinha and Smylie (1971) and later modified by Okada (1985, 1992). We use a Python implementation of the Okada model that we based on the models in the COMCOT (www4) (Liu, Woo and Cho 1998). Larger events are often subdivided into a finite collection of such parametrizations, by breaking the fault into pieces with different sets of parameters. For each piece, the focal mechanism parameters can then be converted into the resulting motion of the seafloor, and these can be summed to obtain the approximate seafloor deformation resulting from the earthquake. It may also be necessary to use time-dependent deformations for large events, such as the 2004 Aceh–Andaman event, which lasted more than 10 minutes as the rupture propagated northwards. Although large earthquakes are well studied, determining the correct mechanism is non-trivial and there are often several different mechanisms proposed that may be substantially different, particularly in regard to the tsunamis that they generate. One use of tsunami modelling is to aid in the study of earthquakes, providing additional constraints on the mechanism beyond the seismic evidence; see for example Hirata, Geist, Satake, Tanioka and Yamaki (2003). However, the existence of competing descriptions of the earthquake can also make it more difficult to validate a numerical method for the tsunami itself. In addition to seismic data, real-time data during a tsunami are also measured by tide gauges at many coastal locations, from which the amplitude and waveform of the tsunami can be estimated. The tides and any coseismic deformation must be filtered out from these data in order to see the tsunami, particularly for large-scale tsunamis that can extend through several tidal periods. The observed waves (particularly in shallow water) are also highly dependent on the local bathymetry, and can vary greatly between nearby points. Tide gauges in bays or harbours often register much more wave action than would be seen farther from shore, due to reflections and
222
R. J. LeVeque, D. L. George and M. J. Berger
resonant sloshing. To have any hope of properly capturing this numerically it is generally necessary to provide the model with fine-scale local bathymetry. The wave amplitude in the deep ocean cannot be measured by traditional tide gauges, but in recent years a network of gauges have been installed on the ocean floor that measure the water pressure with sufficient sensitivity to estimate the depth. In Section 12 we use data from a DART buoy (Meinig, Stalin, Nakamura, Gonz´ alez and Milburn 2006), which transmits data from a pressure sensor at a depth of more than 4000 m. The DART system was developed by NOAA and originally deployed only along the western coast of the United States. Many other nations have also developed similar buoy systems, and after the 2004 Indian Ocean tsunami the world-wide network was greatly expanded. Real-time and historical data sets are available online via DART Data (www5). Also useful in tsunami modelling is the wealth of data collected by tsunami survey teams that respond after any tsunami event. Attempts are made to map the run-up and inundation along stretches of the affected coast, by examining water marks on buildings, wrack lines, debris lodged in trees, and other markers. This evidence often disappears relatively quickly after the event and the rapid response of scientists and volunteers is critical. The findings are generally published and are valuable sources of data for validation studies. Again it is often necessary to have high-resolution local bathymetry and topography in order to model the great variation in run-up and inundation that are often seen between nearby coastal locations. Survey teams sometimes collect these data as well. For some sample survey results, see for example Gelfenbaum and Jaffe (2003), Liu, Lynett, Fernando, Jaffe and Fritz (2005) and Yeh et al. (2006). Information about past tsunamis can also be gleaned from the study of tsunami deposits (Bourgeois 2009). As a tsunami approaches shore it generally becomes quite turbulent, even forming a bore, and picks up sediment such as sand and marine microorganisms that may be deposited inland as the tsunami decelerates. These deposits can often be identified, either near the surface from a recent tsunami or in the subsurface from prehistoric events, as illustrated in Figure 2.1. In some coastal regions, excavations and core samples reveal more than ten distinct layers of deposits from tsunamis in the past few thousand years. Much of what is known about the frequency of megathrust earthquakes along subduction zones has been learned from studying tsunami deposits, as these deposits are commonly the only remaining evidence of past earthquakes. For example, Figure 2.2 shows the record of 17 sand layers interpreted as tsunami deposits, from the coast of Oregon state, indicating that megathrust events along the Cascadia Subduction Zone (CSZ) occur roughly every 500 years. The CSZ runs from northern California to British Columbia, and the last great earthquake and triggered
Tsunami modelling
223
(a)
(b)
Figure 2.1. 2004 and older tsunami deposits in western Thailand (Jankaew et al. 2008). (a) Coastal profile of a part of western Thailand hit by the 2004 Indian Ocean tsunami (simplified from Figure 2 in Jankaew et al. (2008)). (b) Photo and sketch of a trench along this profile, showing the 2004 tsunami deposit and three older tsunami deposits, all younger than about 2500 years ago.
tsunami were on 26 January 1700, as determined from matching Japanese historical records of a tsunami with dated tsunami deposits in the Pacific Northwest of the US (Satake, Shimazaki, Tsuji and Ueda 1996, Satake, Wang and Atwater 2003). An interesting account of this scientific discovery can be found in Atwater et al. (2005). The next such event will have disastrous consequences for many communities in the Pacific Northwest, and the tsunami is expected to cause damage around the Pacific. 2.2. Uses of tsunami modelling There are many reasons to study tsunamis computationally, and ample motivation for developing faster and more accurate numerical methods. Applications include the development of more accurate real-time warning systems, the assessment of potential future hazards to assist in emergency planning, and the investigation of past tsunamis and their sources. In this section we give a brief introduction to some of the issues involved.
224
R. J. LeVeque, D. L. George and M. J. Berger
Figure 2.2. An example of long-term records of tsunami deposits interpreted to be from the Cascadia subduction zone: from Bradley Lake on the coast of southern Oregon. Seventeen different sediment deposits were identified and correlated at eight different locations. The far right column shows the approximate age of each set of deposits. From Bourgeois (2009), based on a figure of Kelsey, Nelson, Hemphill-Haley and Witter (2005).
Real-time warning systems rely on numerical models to predict whether an earthquake has produced a dangerous tsunami, and to identify which communities may need to be warned or evacuated. Mistakes in either direction are costly: failing to evacuate can lead to loss of life, but evacuating unnecessarily is not only very expensive but also leads to poor response to future warnings. Real-time prediction is difficult for many reasons: a code is required that will run faster than real time and still provide detailed results, usually for many different locations. Moreover, the source is usually poorly known initially since solving the inverse problem of determining the focal mechanism from seismic signals takes considerable time and consolidation of data from multiple sites. The DART buoys were developed in part to address this problem. By measuring the actual wave at one or more locations near the source, a better estimate of the tsunami can be quickly generated and used to select initial data for real-time prediction, as discussed by Percival et al. (2010).
Tsunami modelling
225
Most codes used for studying tsunamis are not designed for real-time warning; this is a specialized and demanding application (Titov et al. 2005). However, there are many other applications where research codes can play a role. For example, hazard assessment and mitigation requires the use of tsunami models to investigate the potential damage from a future tsunami, to locate safe havens and plan evacuation routes, and to assist government agencies in planning for emergency response. For this, information about past tsunamis in a region is valuable both in validating the code and in designing hypothetical tsunami sources for assessing the vulnerability to future tsunamis. A topic of growing interest is the development of probabilistic models that take into account the uncertainty of future earthquakes. Seismologists can often provide information about the likelihood of ruptures of various magnitudes along several fault planes, and tsunami modellers then seek to produce from this a probabilistic assessment of the risk of inundation to varying degrees. Although these simulations do not need to be set up and run in real time, the need to do large numbers of simulations for a probabilistic study is additional motivation for developing fast and accurate techniques that can handle the entire simulation from tsunami generation to detailed modelling of specific distant communities. For more on this topic, see for example Geist and Parsons (2006), Gonz´ alez, Geist, Jaffe, Kanoglu et al. (2009) and Geist, Parsons, ten Brink and Lee (2009). Another use of tsunami modelling is to better understand past tsunamis, and to identify the earthquakes that generated them. Much of what is known about earthquakes that happened before the age of seismic monitoring or historical records has been determined through the study of tsunami deposits, as illustrated in Figures 2.1 and 2.2 and discussed above. Tsunami modelling is often required to assist in solving the inverse problem of determining the most likely earthquake source and magnitude from a given set of deposits. For this it would be desirable to couple the tsunami model to sedimentation equations capable of modelling the suspension of sediments and their transport and deposition, ideally also taking into account the resulting changes in bathymetry and topography that may affect the fluid dynamics. Moreover, tsunami deposits often exhibit layers in which the grain size either increases or decreases with depth, and this grading contains information about how the flow was behaving at this location while the sediment was deposited; e.g., Higman, Gelfenbaum, Lynett, Moore and Jaffe (2007) and Martin et al. (2008). Ideally the model would include multiple grain sizes and accurately simulate the entrainment and sedimentation of each. The development of sufficiently accurate sedimentation models and computational tools adequate to do this type of analysis is an active area of research; see for example Huntington et al. (2007).
226
R. J. LeVeque, D. L. George and M. J. Berger
3. The shallow water equations The shallow water equations are the standard governing model used for transoceanic tsunami propagation as well as for local inundation: e.g., Yeh, Liu, Briggs and Synolakis (1994) and Titov and Synolakis (1995, 1998). Because we use shock-capturing methods that can converge to discontinuous weak solutions, we solve the most general form of the equations: a nonlinear system of hyperbolic conservation laws for depth and momentum. In one space dimension these take the form ht + (hu)x = 0, 2
(hu)t + (hu +
2 1 2 gh )x
= −ghBx ,
(3.1a) (3.1b)
where g is the gravitational constant, h(x, t) is the fluid depth, u(x, t) is the vertically averaged horizontal fluid velocity. A drag term −D(h, u)u can be added to the momentum equation and is often important in very shallow water near the shoreline. This is discussed in Section 7. The function B(x) is the bottom surface elevation relative to mean sea level. Where B < 0 this corresponds to submarine bathymetry and where B > 0 to topography. Although in tsunami studies the term bathymetry is commonly used, in much of this paper we will use the term topography to refer to both bathymetry and onshore topography, both for conciseness and because in many other geophysical flows (debris flows, lava flows, etc.) there is only topography. We will also use η(x, t) to denote the water surface elevation, η(x, t) = h(x, t) + B(x, t). We allow the topography to be time-dependent since most tsunamis are generated by motion of the ocean floor resulting from an earthquake or landslide. Figure 3.1 shows a simple sketch of the variables. Note that (3.1) is in fact a ‘balance law’, since variable bottom topography and drag introduce source terms in the momentum equation. The physically relevant form (3.1) introduces some difficulties for numerical solution, particularly with regard to steady state preservation. As mentioned above, this has led to the development of well-balanced schemes for such systems (see e.g. Bale, LeVeque, Mitran and Rossmanith (2002), Bouchut (2004), George (2008), Greenberg and LeRoux (1996), Botta, Klein, Langenberg and L¨ utzenkirchen (2004), Gallardo, Par´es and Castro (2007), Gosse (2000), LeVeque (2010) and Noelle, Pankrantz, Puppo and Natvig (2006)). This is sometimes circumvented by using alternative non-conservative forms of the shallow water equations for η(x, t) and u(x, t), but these forms are problematic if discontinuities appear in the inundation regime (bore formation), and conservation of mass is not easily guaranteed.
227
Tsunami modelling
(B
η
ηs
(B
h
− ηs ) > 0
−ηs ) < 0
Figure 3.1. Sketch of the variables of the shallow water equations. The shaded region is the water of depth h(x, t), and the water surface is η(x, t) = B(x, t) + h(x, t). The dashed line shows the mean sea level ηs .
For tsunami modelling we solve the two-dimensional shallow water equations ht + (hu)x + (hv)y = 0,
(3.2a)
+ (huv)y = −ghBx ,
(3.2b)
(hv)t + (huv)x + (hv + 12 gh2 )y = −ghBy ,
(3.2c)
2
(hu)t + (hu +
2 1 2 gh )x 2
where u(x, y, t) and v(x, y, t) are the depth-averaged velocities in the two horizontal directions, B(x, y, t) is the topography. Again a drag term might be added to the momentum equations. For simplicity, we will discuss many issues in the context of the onedimensional shallow water equations (3.1) whenever possible. We also first consider the equations in Cartesian coordinates, with x and y measured in metres, as might be appropriate when modelling local effects of waves on a small portion of the coast or in a wave tank. For transoceanic tsunami propagation it is necessary to propagate on the surface of the earth, as discussed further in Section 6.2. For this it is common to use latitude and longitude coordinates, assuming the earth is a perfect sphere. A more accurate geoid representation of the earth could be used instead. Latitude– longitude coordinates present difficulties for many problems posed on the sphere due to the fact that grid lines coalesce at the poles and cells are much smaller in the polar regions than elsewhere, which can lead to time step restrictions. For tsunamis on the earth we are generally only interested in the mid-latitudes and this is not a problem, but in Section 6.2 we mention an alternative grid that may be useful in other contexts. On a rotating sphere the equations should also include Coriolis terms in the momentum equations. For tsunami modelling these are generally neglected. During propagation across an ocean, the fluid velocities are small and are concentrated within the wave region and Coriolis effects have been shown to be very small (e.g., Kowalik, Knight, Logan and Whitmore
228
R. J. LeVeque, D. L. George and M. J. Berger
(2005)). Our own tests have also indicated that Coriolis terms can be safely ignored. On the other hand, they are simple to include numerically along with the drag terms via a fractional step approach, as discussed in Section 7. 3.1. Hyperbolicity and Riemann problems The shallow water equations (3.1) belong to the more general class of hyperbolic systems qt + f (q)x = ψ(q, x),
(3.3)
where q(x, t) is the vector of unknowns, f (q) is the vector of corresponding fluxes, and ψ(q, x) is a vector of source terms: hu 0 h , ψ= . (3.4) q= , f (q) = −ghBx hu hu2 + 12 gh2 We will also introduce the notation µ = hu for the momentum and φ = hu2 + 12 gh2 for the momentum flux, so that h µ q= , f (q) = . (3.5) µ φ The Jacobian matrix f (q) then has the form 0 1 ∂µ/∂h ∂µ/∂µ . = f (q) = ∂φ/∂h ∂φ/∂µ gh − u2 2u
(3.6)
Hyperbolicity requires that the Jacobian matrix be diagonalizable with real eigenvalues and linearly independent eigenvectors. For the shallow water equations the matrix in (3.6) has eigenvalues (3.7) λ1 = u − gh, λ2 = u + gh and corresponding eigenvectors 1√ 1 , r = u − gh
2
r =
u+
1√
gh
.
(3.8)
We will use superscripts to index these eigenvalues and eigenvectors since subscripts corresponding to grid cells will be added later. Note that the eigenvalues are always real for physically relevant depths h ≥ 0. For h > 0 they are distinct and the eigenvectors are linearly independent. Hence the equations are hyperbolic for h > 0, and the solution consists of propagating waves. The eigenvalues correspond to velocities of propagation and the eigenvectors give information about the relation between h and hu in a wave propagating at this √ speed. gh relative to the background Note that waves propagate at velocities ± √ fluid velocity u. The velocity c = gh is the gravity wave speed and is
Tsunami modelling
229
analogous to the sound speed for small-amplitude acoustic waves. For twodimensional shallow water equations the theory is somewhat more complicated, since waves can propagate √ in any direction, but the speed of propagation in any direction is again gh relative to the fluid velocity. 2 , but they could Note also that in general√the eigenvalues satisfy λ1 < λ√ both be negative (if u < − gh) or both positive (if u > gh). Such flows are called supercritical and correspond to supersonic flow in gas dynamics. 1 For tsunami modelling, the flow is nearly always subcritical, with √ λ <0< 2 λ , except in very shallow water near the shore. The ratio |u|/ gh is called the Froude number and is analogous to the Mach number of gas dynamics. For a tsunami propagating in the ocean, the fluid velocity is very small √ relative to gh and so the velocity of propagation depends primarily on the depth. For a typical ocean depth of 4000 m the propagation speed is nearly 200 m s−1 , roughly the speed of a commercial jet. In shallower water the wave speed decreases. On a continental shelf with a typical depth of 100 m, the speed is about 30 m s−1 , about 6 times smaller. This is worth bearing in mind when using explicit numerical methods, since the time step allowed by stability considerations is directly proportional to the wave speed. We will return to this in Section 8.1. 3.2. Eliminating the source term There is a technique that is often used to eliminate the source term in a hyperbolic system with the structure of the one we are considering, which we introduce now since we will use it in developing Riemann solvers below. Rewrite the original system of nonlinear equations (3.1) as a system of three equations, by viewing the topography B(x, t) as a function of x and t that does not vary with time: ht + µx = 0, µt + φx + ghBx = 0, (3.9) Bt = 0. This gives a homogeneous hyperbolic system, though at the expense of turning the system into a nonlinear system that is not in conservation form, due to the ‘non-conservative product’ hBx . This has potential difficulties associated with it (see for example Castro, LeFloch, Munoz and Par´es (2008)), but this form is useful in deriving Riemann solvers. The system (3.9) is hyperbolic since the eigenvalues of the Jacobian matrix 0 1 0 −u2 + gh 2u gh (3.10) 0 0 0 √ are easily seen to be λ1,2 = u ± gh, as in the original system, along with
230
R. J. LeVeque, D. L. George and M. J. Berger
λ0 = 0. The new wave we have introduced with speed 0 comes from the stationary discontinuity in B. Note that the eigenvector associated with this wave is gh/(u2 − gh) . 0 (3.11) r0 = 1 This indicates that the stationary wave with a small jump in bathymetry ∆B also has a jump in h, and if u = 0 then the first component of r0 is −1, so that ∆h = −∆B and hence ∆η = 0, corresponding to the ocean √ at rest. More generally, if the Froude number |u|/ gh is small then ∆η ≈ −(u2 /gh)∆B. The momentum µ is always constant across this wave. This makes sense physically since µ is also the mass flux, and a stationary jump in mass flux would lead to the creation of a delta function singularity in mass at this point. 3.3. Linearized equations The easiest case to analyse is the linearized equation governing small-amplitude waves relative to the fluid depth. Consider flat topography for the moment (so the source term disappears) and suppose we consider very smallˆ amplitude waves against a background steady state with constant depth h and velocity u ˆ. For tsunami modelling it is natural to take u ˆ = 0, but one could also study small waves on a steady flow with some non-zero velocity. Then, if we write q(x, t) = qˆ + q˜(x, t) and insert this into the shallow water equations, we find that the small perturbation q˜ satisfies ˆqx = O(˜ q 2 ), q˜t + A˜
(3.12)
q ) is the constant Jacobian matrix evaluated at the backwhere Aˆ = f (ˆ ˆ hˆ ˆ u)T . If we drop the higher-order terms and also drop ground state qˆ = (h, the tildes in (3.13), we obtain the linearized equations ˆ x = 0. qt + Aq
(3.13)
This is a linear hyperbolic partial differential equation (PDE) with constant eigenvalues 1 2 ˆ ˆ ˆ ˆ − cˆ, λ = u ˆ + cˆ, where cˆ = g h. (3.14) λ =u The eigenvectors rˆ1 and rˆ2 from (3.8) are also constant. If we form a ˆ = [ˆ matrix R r1 , rˆ2 ] with these columns, then this eigenvector matrix diagˆ onalizes A: ˆ =R ˆ −1 AˆR. ˆΛ ˆR ˆ −1 , or Λ ˆ Aˆ = R (3.15)
Tsunami modelling
231
Because this matrix is independent of x and t, we can multiply (3.13) by ˆR ˆ −1 , and hence obtain the diagonal system R−1 , replace A by AR ˆ x = 0, wt + Λw
(3.16)
ˆ −1 q. This decouples into two scalar advection equations for where w = R the characteristic variables w1 and w2 , with solutions that simply transˆ 2 respectively. The linear PDE with arbitrary iniˆ 1 and λ late at speeds λ tial conditions can thus be solved by computing initial characteristic data ˆ −1 q(x, 0), solving the scalar advection equations for each compow(x, 0) = R ˆ nent of w(x, t), and finally computing q(x, t) = Rw(x, t). Note that q(x, t) is always a linear combination of the two eigenvectors, and w1 (x, t) and w2 (x, t) are simply the weights. 3.4. The linear Riemann problem Since the ocean does not have constant depth, and is not one-dimensional, we cannot use the above exact solution procedure directly. However, understanding the eigenstructure displayed above is critical to the development of Godunov-type numerical methods that we concentrate on here. These methods, and also much of the theory of both linear and nonlinear hyperbolic PDEs, are based on solutions to the so-called Riemann problem. This consists of the original PDE under study together with very special initial data at some time t = t¯ consisting of piecewise constant data with a single jump discontinuity at some point x ¯,
¯, Q if x < x (3.17) q(x, t¯) = ¯. Qr if x > x For the linear hyperbolic problem (3.13), it is easy to see (using the construction of the exact solution described above), that the solution consists of ˆ 1 and two discontinuities propagating away from the point x ¯ at velocities λ 2 ˆ λ . Moreover the jump in q across each of these waves must be proportional to the corresponding eigenvector, and so the solution has the form ˆ 1 (t − t¯), if x < x ¯+λ Q ˆ 1 (t − t¯) < x < x ˆ 2 (t − t¯), (3.18) q(x, t) = ¯+λ ¯+λ Qm if x 2 ˆ if x > x ¯ + λ (t − t¯), Qr where the middle state Qm satisfies Qm = Q + α1 rˆ1 = Qr − α2 rˆ2
(3.19)
for some scalars α1 and α2 . We will denote the waves by W 1 = Qm − Q = α1 rˆ1 ,
W 2 = Qr − Qm = α2 rˆ2 .
(3.20)
232
R. J. LeVeque, D. L. George and M. J. Berger
The weights α1 and α2 can be found as the two components of the vector α by solving the linear system ˆ = Qr − Q . Rα
(3.21)
The solution is easily determined to be ˆ 2 ∆h − ∆µ ˆ 1 ∆h − ∆µ λ −λ , α2 = . (3.22) 2ˆ c 2ˆ c where ∆h = hr −h and ∆µ = µr −µ = hr ur −h u . Note in particular that ˆ then α1 = α2 = (hr −h )/2, and the initial jump in h resolves if u = ur = u into equal-amplitude waves propagating upstream and downstream. For the constant coefficient linear problem the characteristic structure determines the Riemann solution. For variable coefficient or nonlinear problems, the exact solution for general initial data can no longer be computed by characteristics in general, but the Riemann problem can still be solved and is a key tool in analysis and numerics. α1 =
3.5. Varying topography To linearize the shallow water equations in the case of variable topography, it is easiest to work in terms of the surface elevation η(x, t) = B(x) + h(x, t). We will linearize about a flat surface ηˆ and zero velocity u ˆ = 0. We will ˆ define h(x) = ηˆ − B(x), which is no longer constant and may have large variations if the topography B(x) varies. The momentum equation can be rewritten as (3.23) µt + (hu2 )x + gh(h + B)x = 0, and linearizing this gives the equation ˆ ηx = 0 µ ˜t + g h(x)˜
(3.24)
for the perturbation (˜ η, µ ˜) about (ˆ η , 0). Combining this with the already ˜x = 0 and dropping tildes gives the variable linear continuity equation η˜t + µ coefficient linear hyperbolic system 0 1 η 0 η + ˆ = . (3.25) 0 µ t g h(x) 0 µ x If we try to diagonalize these equations, we find that because the eigenvector matrix R now varies with x, the advection equations for the characteristic variables w1 and w2 are coupled together by source terms that only vanish where the bathymetry is flat. Over varying bathymetry a wave in one characteristic family is constantly losing energy into the other family, corresponding to wave reflection from the bathymetry. Nonetheless, we can define a Riemann problem for this variable coefficient ˆ r at x ˆ from h ˆ to h ¯, along with a jump in the system by allowing a jump in h
Tsunami modelling
233
data from (η , µ ) to (ηr , µr ). The solution to this Riemann problem conˆ )1/2 and a right-going wave sists of a left-going wave with speed cˆ = −(g h ˆ r )1/2 . Each wave propagates across a region of constant with speed cˆr = (g h topography (B or Br respectively) at the appropriate speed, and hence the jump in (η, µ) across each wave must be an eigenvector corresponding to the coefficient matrix on that side of x ¯: 1 1 1 1 1 2 2 2 2 1 , W = α rˆr = α , (3.26) W = α rˆ = α −ˆ c cˆr The weights α1 and α2 can be determined by solving the linear system 1 1 α1 ηr − η ∆η = ≡ , (3.27) 2 µr − µ −ˆ c cˆr α ∆µ yielding α1 =
cˆr ∆η − ∆µ , c + cr
α2 =
cˆl ∆η + ∆µ . c + cr
(3.28)
ˆ r = h, ˆ ˆ = h Note that in the case when there is no jump in topography, h 1/2 ˆ we find that −c = cr = (g h) , and ∆η = ∆h, so that (3.28) agrees with (3.22). Another way to derive this linearized solution is to linearize the system (3.9) that we obtained by introducing B(x, y) as a new component. Linˆ and u earizing about h ˆ = 0 gives the variable coefficient matrix
0 1 0 ˆ if x < x ¯, h ˆ ˆ ˆ ˆ , h(x) (3.29) A(x) = g h(x) = ˆ 0 g h(x) ¯. hr if x > x 0 0 0 The Riemann solution consists of three waves, found by decomposing ∆h 1 1 −1 c + α2 cˆr + α0 0 . ∆q = ∆µ = α1 −ˆ (3.30) ∆B 0 0 1 From the third equation we find α0 = ∆B, and then α1 and α2 can be found by solving 1 1 ∆h + ∆B ∆µ = α1 −ˆ c + α2 cˆ. (3.31) 0 0 0 Since ∆h + ∆B = ∆η, this gives the same system as (3.27), and the same propagating waves as before. We will make use of this Riemann solution for the linearized shallow water equations in developing an approach for the full nonlinear equations in Section 5.
234
R. J. LeVeque, D. L. George and M. J. Berger
3.6. Interaction with the continental shelf Often there is a broad and shallow continental shelf that is separated from the deep ocean by a very steep and narrow continental slope (narrow relative to the wavelength of the tsunami, that is). Figure 12.4 shows the continental shelf near Lima, Peru and the refraction of the 27 February 2010 tsunami wave hitting this shelf. In this section we consider an idealized model to help understand the amplification of a tsunami that takes place as it approaches the coast. Consider piecewise constant bathymetry with a jump from an undisturbed depth h to a shallower depth of hr . Figure 3.2 shows an example of a smallamplitude wave interacting with such bathymetry, in this case a step discontinuity 30 km offshore at the location indicated by the dashed line. The undisturbed depths are h = 4000 and hr = 200 m. At time t = 0 a hump of stationary water is introduced with amplitude 0.4 m. This hump splits into left-going and right-going waves of equal amplitude, sufficiently small that propagation is essentially linear on both sides of the discontinuity. A purely positive perturbation of the depth is used here to make the figures clearer, but any small-amplitude waveform would behave in the same manner. We observe in Figure 3.2 that the right-going wave is split into transmitted and reflected waves when it encounters the discontinuity in bathymetry. The transmitted wave has large amplitude, but shorter wavelength, while the reflected wave has smaller amplitude. At later times the right-going wave on the shelf reflects off the right boundary and becomes a left-going wave. In this model problem the shore is simply a solid vertical wall, but a similar reflection would be observed from a beach. This left-going wave reflected from shore later hits the discontinuity in bathymetry and is itself split into a transmitted wave (left-going in the ocean) and a reflected wave (right-going on the shelf). The reflected right-going wave is now a wave of depression, which later reflects off the shore, then off the discontinuity, etc. It is important to note that much of the wave energy is trapped on the continental shelf and reflects multiple times between the discontinuity in bathymetry and the shore. This has practical implications and is partly responsible for the fact that multiple destructive tsunami waves are often observed on the coast. Moreover, the trapped wave continues to radiate energy back into the ocean each time the wave reflects off the discontinuity. This leads to a more complex wave pattern elsewhere in the ocean than would be observed from the initial tsunami alone, or from including only the single reflection that would be seen from a shore with no shelf. This suggests that to accurately simulate tsunamis it may be important to adequately resolve continental shelves, even in regions away from the coastline of primary interest in the simulation. As an example of this, the simulation shown in Figures 12.1–12.4 shows that large-amplitude waves remain trapped on the shelf off Peru long after the main tsunami has passed by.
235
Tsunami modelling Surface at t = 0 seconds
Surface at t = 1400 seconds 0.4 Metres
Metres
0.4 0.2 0.0
0.2 0.0
−0.2
−0.2
−0.4
−0.4
300
200
100
30
Surface at t = 200 seconds
Metres
Metres
0.0
30
0.2 0.0
−0.2
−0.2
−0.4
−0.4
300
200
100
30
300
200
100
30
Surface at t = 2800 seconds 0.4 Metres
0.4 Metres
100
0.4
0.2
Surface at t = 400 seconds
0.2 0.0
0.2 0.0
−0.2
−0.2
−0.4
−0.4
300
200
100
30
Surface at t = 600 seconds
300
200
100
30
Surface at t = 3400 seconds 0.4 Metres
0.4 Metres
200
Surface at t = 2000 seconds
0.4
0.2 0.0
0.2 0.0
−0.2
−0.2
−0.4
−0.4
300
200
100
30
Surface at t = 1000 seconds
300
200
100
30
Surface at t = 4800 seconds 0.4 Metres
0.4 Metres
300
0.2 0.0
0.2 0.0
−0.2
−0.2
−0.4
−0.4
300
200
100
30
300
200
100
30
Figure 3.2. An idealized tsunami interacting with a step discontinuity representing a continental shelf. The dashed line indicates the location of the discontinuity, 30 km offshore. See Figure 3.3 for the same solution as a contour plot in the x–t plane.
236
R. J. LeVeque, D. L. George and M. J. Berger
Contours of surface
2 .0
1 .5
Hours
4800 seconds
1 .0
3400 seconds 2800 seconds 2000 seconds
0 .5
1400 seconds 1000 seconds
0 .0
600 seconds 400 seconds 200 seconds 300
200 Kilometres offshore
100
30
Figure 3.3. Contour plot in the x–t plane of an idealized tsunami interacting with a step discontinuity representing a continental shelf. Solid contour lines are at 0.025, 0.05, . . . , 0.35 m. Dashed contour lines are at −0.025, −0.05, −0.1, −0.15 m. This is a different view of the results shown in Figure 3.2, and the times shown there are indicated as horizontal lines.
Tsunami modelling
237
Consider the first interaction of the wave shown in Figure 3.2 with the discontinuity. Note that the lower wave speed on the shelf results in a shorter-amplitude wave. To understand this, suppose the initial wave√has wavelength W . The tail of the wave reaches the step at time ∆t = W / gh later than the front of the wave. At this time the front√of the transmitted wave on the shallow side has moved a distance ∆t ghr and so the wavelength observed on the shallow side is Wr = hr /h W < W . The wavelength decreases by the same factor as the decrease in wave speed. On the other hand, the amplitude of the transmitted wave is larger than the amplitude of the original wave by a factor CT > 1, the transmission coefficient, while the reflected wave is smaller by a factor CR < 1, the reflection coefficient. For the idealized step discontinuity, these coefficients are given by CT =
2c , c + cr
CR =
c − cr , c + cr
(3.32)
analogous to the transmission and reflection coefficients of linear acoustics, for example, at an interface between materials with different impedance. For the example shown in Figures 3.2 and 3.3, the coefficients are CT ≈ 1.63 and CR = CT − 1 ≈ 0.63. There are several ways to derive these coefficients. An approach that fits well here is to use the structure of the Riemann solution derived above, as is done for acoustics in LeVeque (2002). Consider a pure right-going wave consisting of a jump discontinuity of magnitude ∆η in depth, that hits the discontinuity in bathymetry at some time t¯. From this time forward we have a Riemann problem in which ∆µ = c ∆η by the jump conditions across a right-going wave in the deep water. The Riemann solution consists of a left-going wave (the reflected wave) and a right-going wave (the transmitted wave) of the form (3.26), and the formulas (3.28) when applied to this particular Riemann data yield directly the coefficients (3.32). A more general waveform can be viewed as a sequence of small step discontinuities approaching the shelf, each of which must have the same relation between ∆η and ∆µ, and so each is split in the same manner into transmitted and reflected waves. Note that if c = cr there is no discontinuity, and in this case CT = 1 while CR = 0. On the other hand, in the limiting case of very shallow water on the right, CT → 2 while CR → 1. This limiting case corresponds to a solid wall boundary condition, and this factor of 2 amplification is apparent at time t = 1000 s in Figure 3.2, when the wave is reflecting off the shore. In general the amplification factor for a wave transmitted into shallower water is between 1 and 2, while the reflection coefficient is between 0 and 1 if c > cr . When a wave is transmitted from shallow water into deeper water (e.g., if c < cr ) then the reflection coefficient in (3.32) is negative,
238
R. J. LeVeque, D. L. George and M. J. Berger
explaining the negation of amplitude seen in Figures 3.2 and 3.3 when the trapped wave reflects off the discontinuity, for example between times 1400 and 2000 seconds in those plots. We can also calculate the fraction of energy that is transmitted and reflected at the shelf. In a pure right-going wave (or a pure left-going wave) the energy is equally distributed between potential and kinetic energy by the equipartition principle. If η(x) is the displacement of the surface from sea level ηs = 0 and u(x) is the velocity of the fluid, then these are given by 1 ρgη 2 (x) dx, Potential energy = 2 (3.33) 1 2 ρu (x) dx, Kinetic energy = 2 where ρ is the density of the water. It is easy to check that these are equal for a wave in a single characteristic family (for the linearized equations about a constant depth h and zero velocity) √ by noting that the form of the eigenvectors (3.8) shows that hu(x) = ± gh η(x) for each x. Let E be the energy in the wave approaching the step. The reflected wave has the same shape but the amplitude of η(x) is reduced by CR everywhere, and 2 E . By conservation of energy, hence the energy in the reflected wave is CR 2 )E . This result can also be the amount of energy transmitted is (1 − CR found by calculating the potential energy of the transmitted wave directly from the integral in (3.33), taking into account both the amplitude of the wave by the factor CT and the reduction in wavelength by hr /h . For the example shown in Figures 3.2 and 3.3, approximately 60% of the energy is transmitted onto the shelf at the first reflection time. At the kth reflection of the wave trapped on the shelf, the energy radiated can be calculated to (k−1) E . The total of the initially reflected energy plus all the be (1 − CR )2 CR radiated energy is given by an infinite series that sums to E .
4. Finite volume methods Before continuing our discussion of Riemann problems for the shallow water equations, we pause to introduce the basic ideas of finite volume methods, both as motivation and in order to see what information will be required from Riemann solutions. Nonlinear hyperbolic systems (3.3) present some well-known difficulties for numerical solution, and a considerable amount of research has been dedicated to the development of suitable numerical methods for them; see LeVeque (2002) for an overview. A class of numerical methods that has been very successful for these problems are the shock-capturing Godunovtype methods: finite volume methods making use of Riemann problems to determine the numerical update.
Tsunami modelling
239
In a one-dimensional finite volume method, the numerical solution Qni is an approximation to the average value of the solution in the ith grid cell Ci = [xi−1/2 , xi+1/2 ]: 1 n Qi ≈ q(x, tn ) dx, (4.1) Vi Ci where Vi is the volume of the grid cell (simply the length in one dimension, Vi = xi+1/2 − xi−1/2 ). The wave propagation algorithm updates the numerby solving Riemann problems at xi−1/2 and ical solution from Qni to Qn+1 i xi+1/2 , the boundaries of Ci , and using the resulting wave structure of the Riemann problem to determine the numerical update. For a homogeneous system of conservation laws qt + f (q)x = 0, such methods are often written in conservation form, ∆t n n (F = Qni − − Fi−1/2 ) (4.2) Qn+1 i ∆x i+1/2 n where Fi−1/2 is a numerical flux approximating the time average of the true flux across the left edge of cell Ci over the time interval: tn+1 1 n f (q(xi−1/2 , t)) dt. (4.3) Fi−1/2 ≈ ∆t tn If the method is in conservation form, then no matter how the numerical over all fluxes are chosen the method will be conservative: summing Qn+1 i grid cells gives a cancellation of fluxes except for fluxes at the boundaries. The classical Godunov’s method is obtained by solving the Riemann problem at each cell edge (using x ¯ = xi−1/2 and t¯ = tn in our general description of the Riemann problem, for example) and then evaluating the resulting Riemann solution at xi−1/2 to define the numerical flux, setting n = f (Q(xi−1/2 )). Fi−1/2
This gives a first-order accurate method that can be viewed as a generalization of the upwind method for scalar advection. For equations (3.3) with a source term, one common approach is to use a fractional step method in which each time step is subdivided into a step on the homogeneous conservation law qt + f (q)x = 0, followed by a step on the source terms alone, solving qt = ψ(q, x). This approach generally works well for the friction or Coriolis terms in the shallow water equations, as discussed further in Section 7, but is not suitable for handling the bathymetry terms. For the steady state solution of the ocean at rest, the bathymetry source term must exactly cancel out the gradient of hydrostatic pressure that appears in the momentum flux. A fractional step method will not achieve this and will generate large spurious waves. Instead these source terms must be incorporated into the Riemann solution directly, as discussed further below.
240
R. J. LeVeque, D. L. George and M. J. Berger
To incorporate source terms, it is no longer possible to use the conservation form (4.2). Instead we will write the method in fluctuation form = Qni − Qn+1 i
∆t + (A ∆Qni−1/2 + A− ∆Qni+1/2 ), ∆x
(4.4)
where the vector A+ ∆Qni−1/2 represents the net effect of all waves propagating into the cell from the left boundary, while A− ∆Qni+1/2 is the net effect of all waves propagating into the cell from the right boundary. For a homogeneous conservation law, this will be conservative if we choose these fluctuations as a flux-difference splitting at each interface, so that for example A− ∆Qni−1/2 + A+ ∆Qni−1/2 = f (Qni ) − f (Qni−1 ).
(4.5)
When source terms are incorporated, the right-hand side of (4.5) must be suitably modified as discussed below. The notation A± ∆Q is motivated by the linear case. If f (q) = Aq, then Godunov’s method is the simple generalization of the scalar upwind method obtained by taking A± ∆Qni−1/2 = A± (Qni − Qni−1 ), where the matrices A± are defined by A± = RΛ± R−1 ,
Λ± =
(4.6)
0 (λ1 )± , 0 (λ2 )±
(4.7)
where λ+ = max(λ, 0) and λ− = min(λ, 0). For the linearized shallow water equations, note that in the subcritical case these fluctuations are simply ˆ1W 1 ˆ2W 2 , A+ ∆Qi−1/2 = λ . (4.8) A− ∆Qi−1/2 = λ i−1/2
i−1/2
In the supercritical case, one of the fluctuations would be the zero vector ˆpW p while the other is the sum of λ i−1/2 over p = 1, 2, which gives the full jump in the flux difference A(Qni − Qni−1 ). 4.1. Second-order corrections and limiters Godunov’s method is only first-order accurate and introduces a great deal of numerical diffusion into the solution. In particular, steep gradients are badly smeared out. To obtain a high-resolution method , we add additional terms to (4.4) that model the second derivative terms in a Taylor series expansion of q(x, t + ∆t) about q(x, t), and then apply limiters to avoid the nonphysical oscillations that often arise near discontinuities when a dispersive second-order method is used. To maintain conservation, these corrections
241
Tsunami modelling
can be expressed in a flux-differencing form, and so we replace (4.4) by = Qni − Qn+1 i
∆t + ∆t ˜ n n (A ∆Qni−1/2 + A− ∆Qni+1/2 ) − (F − F˜i−1/2 ). (4.9) ∆x ∆x i+1/2
For a constant coefficient linear system, second-order accuracy is achieved by taking ∆t 1 n ˜ I− |A| |A|(Qni − Qni−1 ), (4.10) Fi−1/2 = 2 ∆x where |A| = R(Λ+ − Λ− )R−1 . Inserting (4.10) and (4.6) into (4.9) and simplifying reveals that this is simply the Lax–Wendroff method, 1 ∆t 2 2 n n+1 n 1 ∆t n n A(Qi+1 −Qi−1 )+ = Qi − A (Qi+1 −Qni +Qni−1 ). (4.11) Qi 2 ∆x 2 ∆x Although this is second-order accurate on smooth solutions, the dominant term in the error is dispersive, and so non-physical oscillations appear near steep gradients. This can be disastrous, particularly if they lead to negative values of the depth. By viewing the Lax–Wendroff method in the form (4.9), as a modification to the upwind Godunov method, we can apply limiters to produce ‘high-resolution’ results. To do so, note that the correction flux (4.10) can be rewritten in terms of the waves W 1 and W 2 as 2 ∆t p 1 p ˜ Fi−1/2 = 1− |λ | |λp |Wi−1/2 , 2 ∆x
(4.12)
i=1
where we have dropped the time step index n and the superscript p refers p by a limited to the wave family. We introduce limiters by replacing Wi−1/2 p p p p = Φ(θ )W , where θ is a scalar measure of the version W i−1/2
i−1/2
i−1/2
i−1/2
p relative to the wave in the same family arising strength of the wave Wi−1/2 from a neighbouring Riemann problem, while Φ(θ) is a scalar-valued limiter function that takes values near 1 where the solution appears to be smooth and is typically closer to 0 near perceived discontinuities. See LeVeque (2002) for more details. There is a vast literature on limiter functions and methods with a similar flavour. Often the limiter is applied to the numerical flux function (giving flux-limiter methods) or to slopes in a reconstruction of a piecewise polynomial approximate solution from the cell averages (e.g., slope limiter methods). The above formulation in terms of ‘wave limiters’ has the advantage that it extends very naturally to arbitrary hyperbolic systems of equations, even those that are not in conservation form. This wave propagation approach is the basic method used throughout the Clawpack software. The generalization to two space dimensions is briefly discussed in Section 6.
242
R. J. LeVeque, D. L. George and M. J. Berger
4.2. The f-wave formulation Another formulation of the wave propagation algorithms known as the fwave form has been found to be very useful in many contexts, including the incorporation of source terms as discussed below. An approximate Riemann p (often as the solver generally produces a set of wave basis vectors ri−1/2 eigenvectors of some matrix) and then determines the waves by decomposing the vector Qi − Qi−1 as a linear combination of these basis vectors, p p p αi−1/2 ri−1/2 ≡ Wi−1/2 . (4.13) Qi − Qi−1 = p
p
The f-wave approach instead splits the flux difference as a linear combination of these vectors, p p p f (Qi ) − f (Qi−1 ) = βi−1/2 ri−1/2 ≡ Zi−1/2 . (4.14) p
p
From this splitting we can easily define fluctuations A± ∆Qi−1/2 satisfying p for which the corresponding eigenvalue (4.5) by assigning the f-waves Zi−1/2 or approximate wave speed is negative to A− ∆Qi−1/2 , and the remaining f-waves to A+ ∆Qi−1/2 . For the linearized shallow water equations in the subcritical case, this reduces to 1 2 , A+ ∆Qi−1/2 = Zi−1/2 , A− ∆Qi−1/2 = Zi−1/2 2 ∆t ˆ p 1 p 1− |λ | sgn(λp )Zi−1/2 , F˜i−1/2 = 2 ∆x
(4.15)
p=1
p p is a limited version of Zi−1/2 . The f-waves are limited in where Zi−1/2 p exactly the same manner as waves Wi−1/2 would be. One advantage of this formulation is that the requirement (4.5) is satisfied no matter how the eigenvectors r1 and r2 are chosen for the nonlinear case. Another advantage is that source terms are easily included into the Riemann solver in a well-balanced manner.
5. The nonlinear Riemann problem Although linearized equations may be suitable in deep water, as a tsunami approaches shore the nonlinearities cannot be ignored. In the nonlinear equations the characteristic speeds (eigenvalues of the Jacobian matrix) vary with the solution itself. Over flat bathymetry the fluid depth is greater at the peak of a wave than in the trough, so the peak travels faster and can even overtake the trough in water that is shallow relative to the wavelength. This wave breaking is clearly visible for ordinary wind-generated waves on
243
Tsunami modelling
(a)
Time 0
Time 0
Time 3.00
Time 0.08
Time 6.00
Time 0.16
(b)
Figure 5.1. Solution to the ‘dam-break’ Riemann problem for the shallow water equations with initial velocity 0. The shading shows a passively advected tracer to help visualize the fluid velocities, compression, and rarefaction. The bathymetry is (a) B = −1 and Br = −0.5, (b) B = −4000 and Br = −200. In both cases, η = 1 and ηr = 0.
the ocean as they move into sufficiently shallow water in the surf zone. In the shallow water equations the depth must remain single-valued and so overturning waves cannot be modelled directly. Instead a shock wave forms, also called a hydraulic jump in shallow water theory. This models a bore, a near-discontinuity in the surface elevation that is often seen at the leading edge of tsunamis as they approach shore or propagate up a river. The nonlinear Riemann problem over flat bathymetry can be solved and consists of two waves moving at constant velocities, though now each wave is generally either a shock wave (if characteristics are converging) or a spreading rarefaction wave (if characteristics are diverging, i.e., the eigenvalue is strictly increasing from left to right across the wave). For details on solving the nonlinear Riemann problem exactly, see for example LeVeque (2002) or Toro (2001). On varying topography we can consider a generalized Riemann problem in which the bathymetry is allowed to be discontinuous at the point x ¯ along with the state variables. The solution to this nonlinear Riemann problem
244
R. J. LeVeque, D. L. George and M. J. Berger
generally consists of three waves. In addition to the two propagating waves, which each propagate over flat bathymetry to one side or the other of x ¯ as in the linear case discussed above, there will also be a stationary wave (propagating with speed zero) at x ¯, where the jump in bathymetry leads to a jump in depth h, and also in the surface η if water is flowing across the step. This is illustrated in Figure 5.1. In the linearized model this stationary jump in η does not appear because the jump in the surface at a stationary discontinuity is of order u2 /gh for small perturbations. Figure 5.1(b) shows the solution to the nonlinear Riemann problem with the same jump in the surface η as in Figure 5.1(a), but over much deeper water. The spread of characteristics across the rarefaction wave is so small that it appears as a discontinuity and the fluid velocity is so small that the jump in surface at the stationary discontinuity can not be seen. 5.1. Approximate Riemann solvers For the linearized shallow water equations on flat topography, the exact eigenstructure is known and easily used to compute the exact Riemann solution for any states Q and Qr , as has been done in Section 3.4. For the nonlinear problem, the exact solution is more difficult to compute and generally not worth the effort, since the waves and speeds are used in a finite volume method that introduces errors when computing cell averages in each time step. Since a Riemann problem is solved at every cell interface in each time step, the cost of the Riemann solver often dominates the computational cost of the method and it is important to develop efficient approximate solvers. Moreover, rarefaction waves such as those shown in Figure 5.1(a) are not directly handled by the wave propagation algorithms, which assume each wave is a jump discontinuity. Instead of using the exact Riemann solution, most Godunov-type methods use approximate Riemann solvers. For GeoClaw we use approximate solvers that always return a set of waves (or f-waves) that are simple discontinuities propagating at constant speeds. These must be chosen in a manner that: • gives a good approximation to the nonlinear Riemann solution, • preserves steady states, in particular the ocean at rest, • handles dry states h = 0 or hr = 0, • works well in conjunction with AMR. The Riemann solver used in GeoClaw is rather complicated and will not be described in detail. We will just give a flavour of how it is constructed. Full details can be found in George (2006, 2008), and the dry state problem is discussed further in George (2010).
245
Tsunami modelling
The f-wave approach developed in Section 3.5 is expanded to an augmented Riemann solver in which the vector ∆h ∆µ (5.1) ∆φ ∆B is decomposed into 4 waves. Note that the first two components of this vector correspond to the jump in q = (h, µ) in the Riemann problem data, while the second and third components together correspond to the jump in flux f (q) = (µ, φ). The jump in h is explicitly included in order to apply techniques that ensure that no negative depths are generated in the Riemann solutions near the shoreline. The equations defining the Riemann problem consist of the equations (3.9) for h, µ, and B, together with an equation for the momentum flux φ derived by differentiating 1 (5.2) φ = µ/h + gh2 2 with respect to t and using the equations for the time derivatives of h and µ to obtain (5.3) φt + 2(u2 − gh)µx + 2uφx + 2ghuBx = 0. This results in the non-conservative system 0 1 0 0 h 0 h µ gh − u2 0 µ 2u 0 gh = . + 0 0 φ gh − u2 2u 2ghu φ B x 0 B t 0 0 0 0 The eigenvalues of this matrix are λ1 = u − gh, λ2 = u + gh,
λ3 = 2u,
and the corresponding eigenvectors are 1 1 0 1 2 λ λ 2 3 0 r1 = (λ1 )2 , r = (λ2 )2 , r = 1, 0 0 0
λ0 = 0,
(5.4)
(5.5)
gh/λ1 λ2 0 r0 = −gh . 1
(5.6)
Again the eigenvector r0 corresponds to the stationary wave induced by the jump in topography. Note that the first component of r0 can be written as −1/(1 − u2 /gh) and for zero velocity reduces to −1, corresponding to the jump ∆h = −∆B that gives the ocean at rest, ∆η = 0. It is shown in George (2006, 2008) that a well-balanced method for both the ocean at rest and also a flowing steady state is obtained by defining a discrete
246
R. J. LeVeque, D. L. George and M. J. Berger
approximation to the steady wave as
−ρ1 0 W 0 = ∆B ¯ 2 , −g hρ 1
(5.7)
¯ = (h + hr )/2 and the ratios ρ1 and ρ2 are nearly 1 for small where h velocities: ¯ ¯ gh max(u ur , 0) − g h , (5.8) , ρ = ρ1 = ¯ 2 ¯ gh − u ¯2 u ¯2 − g h where u ¯ = 12 (u + ur ). Subtracting this wave from the vector (5.1) reduces the problem to a system of three equations for the remaining waves. The eigenvalues λ1 and λ2 are replaced by wave speeds s1 and s2 estimated from the Riemann data, and these values are also used in the discrete eigenvectors r1 and r2 . The wave speeds are approximated using a variant of the approach suggested by Einfeldt (1988) in connection with the HLL solver of Harten, Lax and van Leer (1983) to avoid difficulties with the vacuum state in gas dynamics, which is analogous to the dry state problem in shallow water. This HLLE solver is further discussed in Einfeldt, Munz, Roe and Sjogreen (1991) and elsewhere. These HLLE speeds are given by s1 , u − c ), s1 = min(ˆ
s2 = max(ˆ s2 , ur + c r )
(5.9)
where sˆ1 and sˆ2 are the speeds used in the Roe solver for the shallow water equations, ¯ − cˆ, sˆ2 = u ¯ + cˆ, (5.10) sˆ1 = u where
cˆ =
¯ g h,
√ √ u h + ur hr √ u ˆ= √ . h + hr
(5.11)
The wave decomposition is then done by solving the linear system to determine the weights β 1 , β 2 , and β 3 in 1 1 0 ∆h ∆µ = β 1 s1 + β 2 s2 + β 3 0. (5.12) 1 ∆φ (s1 )2 (s2 )2 Further improvements can be made by replacing the third eigenvector by a different choice in certain situations, as discussed further in George (2008). Finally, the second and third components of these waves are used as fwaves in the algorithm described in Section 4.2 along with the wave speeds u. This results in a method that conserves mass (and s1 , s2 , and s3 = 2ˆ momentum when ∆B = 0), avoids dry states, and is well-balanced. A number of related Riemann solvers and Godunov-type methods have been
247
Tsunami modelling
(a)
Time 0
Time 0
Time 3.00
Time 3.00
Time 6.00
Time 6.00
(b)
Figure 5.2. Solution to the Riemann problem for the shallow water equations with a dry state on the right and positive velocity in the left state. The velocity is larger in the case shown in column (b). The shading shows a passively advected tracer to help visualize the fluid velocities, compression, and rarefaction.
proposed in the literature that can also achieve these goals. The approach outlined above that splits the jump in q and in f (q) is also related to the relaxation approaches discussed in Bouchut (2004) and LeVeque and Pelanti (2001). See also Bale et al. (2002), Gosse (2001, 2000) and In (1999). Riemann problems with an initial dry state on one side raise additional issues that we will not discuss in detail here. Figure 5.2 shows two examples to illustrate one aspect of this problem. In each case there is a step discontinuity in bathymetry with the left cell wet and the right cell dry, data of the sort that naturally arise along the shoreline. In the case illustrated in Figure 5.2(a), the velocity in the left state is positive but sufficiently small that the step discontinuity acts as a solid wall and the Riemann solution consists of a left-moving 1-shock, with stationary water to the right of the shock. The case illustrated in Figure 5.2(b) has a larger positive fluid velocity, in which case the flow overtops the step and there is a right-going 1-rarefaction invading the dry cell along with a left-going 1-shock. For more details about the handling of dry states in the Riemann solver used in GeoClaw, see George (2008, 2010).
248
R. J. LeVeque, D. L. George and M. J. Berger
6. Algorithms in two space dimensions In two space dimensions, hyperbolic systems such as (3.2) more generally take the form qt + f (q)x + g(q)y = ψ(q, x, y). (6.1) Godunov-type finite volume algorithms can be naturally extended to two dimensions by solving 1D Riemann problems normal to each edge of a finite volume cell, and using the Riemann solution to define an edge flux or a set of waves propagating into the neighbouring cells. High-resolution correction terms can then be added to achieve greater accuracy without spurious oscillations. The methods used in GeoClaw are the standard wave propagation algorithms of Clawpack, which are described in detail in LeVeque (2002). For a logically rectangular quadrilateral grid, the cells can be indexed by (i, j) and each cell has four neighbours. In this case the numerical solution Qnij is an approximation to the average value of the solution over the grid cell Cij , 1 n Qij ≈ q(x, y, tn ) dx dy, (6.2) Vij Cij where Vij is the area of the cell. For a regular Cartesian grid, the cell areas are simply Vij = ∆x∆y, but the methods can also be applied on any quadrilateral grid defined by a mapping of the uniform computational grid. The basic idea of the wave propagation algorithms in two dimensions is illustrated in Figure 6.1, where six quadrilateral grid cells are shown. Figure 6.1(a) shows the left-going and right-going waves that might be generated by solving the Riemann problem normal to the cell edge in the middle of this patch. The shallow water equations are rotationally invariant, and the Riemann problem normal to any edge can easily be solved by rotating the momentum components of the cell averages Q to normal and tangential components. The normal components are used in solving a 1D Riemann problem along with the depth h on either side. The jump in tangential velocity is simply advected by a third wave propagating at the intermediate velocity found from the 1D Riemann solution. Using these waves to update the cell averages in the two cells neighbouring this edge gives the natural generalization of Godunov’s method, which is first-order accurate and stable only for Courant numbers up to 0.5 (because of the waves that also enter the cell from above and below when solving Riemann problems in the orthogonal direction). To increase the accuracy we need to add second-order correction terms that model the next terms in a Taylor series expansion of the solution at the end of the time step about the starting values, requiring an estimate of qtt . In the Lax–Wendroff framework used in the wave propagation algorithms, this is replaced by spatial derivatives by differentiating the original
Tsunami modelling
249
system of equations in time. The result involves qxx and qyy and these terms can be incorporated by a direct extension of the one-dimensional correction terms, with limiters used as in one dimension to give high resolution (sharp gradients without overshoots or undershoots). The time derivative qtt also involves mixed derivatives qxy and it is important to include these terms as well, both to achieve full second-order accuracy and also to improve the stability properties of the method. The cross-derivative terms are included by taking the waves propagating normal to the interface shown in Figure 6.1(a) and splitting each wave into up-going and down-going pieces that modify the cell averages above or below. This is accomplished by decomposing the fluctuations A± ∆Q into eigenvectors of the Jacobian matrix in the transverse direction (tangent to the cell interface we started with). The resulting eigen-decomposition is used to split each of the fluctuations into an downgoing part (illustrated in Figure 6.1(b)) and a up-going part (illustrated in Figure 6.1(c)), and is done in the transverse Riemann solver of Clawpack. The triangular portions of these waves that lie in the adjacent row of grid cells can be used to define a flux from the cells in the middle row to the cells in the bottom or top row of cells respectively. The algorithms must of course be modified to take into account the areas swept out by the waves relative to the area of the grid cells in order to properly update cell averages. This approach is described in more detail in LeVeque (2002) and has been successfully used in solving a wide variety of hyperbolic systems in two space dimensions, and also in three dimensions after introducing an additional set of transverse terms (Langseth and LeVeque 2000). See also LeVeque (1996) for a simpler discussion in the context of advection equations. With the addition of these transverse terms, the resulting method is stable up to a Courant number of 1. The methods can be used on an arbitrary logically rectangular grid: the mapping from computational to physical space need not be smooth, an advantage for some applications such as the quadrilateral grid on the sphere used for AMR calculations in Berger, Calhoun, Helzel and LeVeque (2009). 6.1. Ghost cells and boundary conditions Boundary conditions are imposed by introducing an additional two rows of grid cells (called ghost cells) around the edge of the grid. In each time step values of Q are set in these cells in some manner, depending on the physical boundary condition, and then the finite volume method is applied over all cells in the original domain. Updating cells adjacent to the original boundaries will use ghost cell values in determining the update, and in this way the physical boundary conditions indirectly affect the solution. For tsunami modelling we typically take the full domain to be sufficiently large that any waves leaving the domain can be safely ignored; we assume
250
R. J. LeVeque, D. L. George and M. J. Berger
(a)
(b)
(c)
Figure 6.1. (a) Six quadrilateral grid cells and the waves moving normal to a cell interface after solving the normal Riemann problem. (b) Down-going portions of these waves resulting from transverse Riemann solve. (c) Up-going portions of these waves resulting from transverse Riemann solve.
they should not later reflect off a physical feature and re-enter the domain. So we require non-reflecting boundary conditions (also called absorbing boundary conditions) that allow outgoing waves to leave the domain without unphysical numerical reflections at the edge of the computational domain. For Godunov-type methods such as the wave propagation methods we employ, a very simple extrapolation method gives a reasonable nonreflecting boundary condition as discussed in LeVeque (2002): in each time step we simply copy the values of Q in the cells adjacent to each boundary into the adjacent ghost cells. Solving a Riemann problem between two identical states results in zero-strength waves and so the Riemann problems at the cell interfaces at the domain boundary give no spurious incoming waves. This is illustrated in Figure 12.1, for example, where the tsunami is seen to leave the computational grid with very little spurious reflection. When adaptive mesh refinement is used, many grid patches will have edges that are within the full computational domain. In this case ghost cell values are filled either from an adjacent grid at the same level of refinement, if such a grid exists, or by interpolating from coarser levels. This is described further in Section 9. It is important to ensure that spurious waves are not generated from internal interfaces between grids at different levels. Again Godunov-type methods seem to handle this quite well, as is also apparent from the results shown in Figure 12.1, for example.
Tsunami modelling
251
6.2. Solving on the sphere To properly model the propagation of tsunamis across the ocean, it is necessary to solve the shallow water equations on the surface of the sphere rather than in Cartesian coordinates. This can be done using the approach discussed above and illustrated in Figure 6.1, where now the cell area is calculated as an area on the sphere. The coordinate lines bounding the quadrilaterals are assumed to lie along great circles on the sphere between the corner vertices and so these areas are easily computed. The current implementation in GeoClaw assumes that latitude–longitude coordinates are used on the sphere. This gives some simplification of the Riemann solvers since the cell edges are then orthogonal to one another and the momenta that are stored in the Q vectors are the components of momentum in these two directions. Latitude–longitude grids are generally used for teletsunami modelling since interest is generally focused on the mid-latitudes. To obtain an accurate representation of flow on the sphere, it is necessary to compute the cell volumes Vij using surface area on the sphere. The grid cells are viewed as patches of the sphere obtained by joining the four corners by great circle arcs between the specified latitude and longitude values. The length of the cell edges also come into the finite volume methods and must be calculated using great circle distance. On the full sphere, latitude–longitude coordinates have the problem that grid lines coalesce at the poles. The cells are very small near the poles relative to those near the equator, requiring very small time steps in order to keep the global Courant number below 1. A variety of other grids have been proposed for solving problems on the full sphere, particularly in atmospheric sciences where flow at the poles is an important part of the solution. One approach that fits well with the AMR algorithms described in this paper is discussed in Berger et al. (2009).
7. Source terms for friction Topographic source terms are best incorporated into the Riemann solver, as described in Section 3.1. Additional source terms arise from bottom friction in shallow water, and are particularly important in modelling inundation. Run-up and inundation distance are affected by the roughness of the terrain, and would be much larger on a bare sandy beach than through a mangrove swamp, for example. To model friction, we replace the momentum equations of (3.2) by (hu)t + (hu2 + 12 gh2 )x + (huv)y + ghBx = −D(h, u, v)hu,
(7.1a)
+ ghBy = −D(h, u, v)hv,
(7.1b)
2
(hv)t + (huv)x + (hv +
2 1 2 gh )y
with some frictional drag coefficient D(h, u, v). Various models are available
252
R. J. LeVeque, D. L. George and M. J. Berger
in the literature. We generally use the form D(h, u, v) = n2 gh−7/3 u2 + v 2 .
(7.2)
The parameter n is the Manning coefficient and depends on the roughness. If detailed information about the surface is known then this could be a spatially varying parameter, but for generic tsunami modelling a constant value of n = 0.025 is often used. Note that in deep water the friction term in (7.1) is generally negligible, being of magnitude O(|u|2 h−4/3 ), and so we only apply these source terms in coastal regions, e.g., in depths of 100 m or less. In these regions the source term is applied as an update to momentum at the end of each time step. We loop over all grid cells and in shallow regions update the momenta (hu)ij and (hv)ij by −7/3 2, u2ij + vij Dij = n2 ghij (7.3) (hu) = (hu) /(1 + ∆tD ), ij
ij
ij
(hv)ij = (hv)ij /(1 + ∆tDij ), This corresponds to taking a step of a linearized backward Euler method on the ordinary differential equations for momentum obtained from the source alone. By using backward Euler, we ensure that the momentum is driven to zero when ∆tDij is large, rather than potentially changing sign as might happen with forward Euler, for example. A higher-order method could be used, but given the uncertainty in the Manning coefficient (and indeed in the friction model itself), this would be of questionable value. Including friction is particularly important at the shoreline where the depth h approaches zero, and the above procedure helps to stabilize the method and ensure that velocities remain bounded as the shoreline moves while a wave is advancing or retreating.
8. Adaptive mesh refinement In this section we will first describe the general block-structured adaptive mesh refinement (AMR) algorithms that are widely used on structured logically rectangular grids. This approach is discussed in numerous papers including Berger and Oliger (1984) and Berger and Colella (1989). The implementation specific to Clawpack and hence to GeoClaw is described in more detail in Berger and LeVeque (1998). We will summarize the basic approach and then concentrate on some of the challenges that arise when combining AMR with geophysical flow algorithms, in particular in dealing with dry states and with the need for well-balanced algorithms that maintain steady states.
Tsunami modelling
253
8.1. AMR overview Block-structured AMR algorithms are designed to solve hyperbolic systems on a hierarchy of logically rectangular grids. A single coarse (level 1) grid comprises the entire domain, while grids at a given level + 1 are finer than the coarser level grids by fixed integer refinement ratios rx and ry in the two spatial directions, ∆x+1 = ∆x /rx ,
∆y +1 = ∆y /ry .
(8.1)
In practice we normally take rx = ry at each level since in this application there is seldom any reason to refine differently in the two spatial directions. The nesting requirements of subgrids are not restrictive, in that a single level ( + 1) grid may overlap several level grids, and may be adjacent to level ( − 1) grids. Since subgrids at a given level can appear and disappear adaptively, the highest grid level present at a given point in the domain changes with time. The subgrid arrangement changes during the process of regridding, which occurs every few time steps. This allows subgrids to essentially ‘move’ with features in the solution. On the current set of grids, the solution on each grid is advanced using the same numerical method that would be used on a single rectangular grid, together with some special procedures at the boundaries of subgrids. The time steps on level + 1 grids are typically smaller than the time step on the level grids by a factor rt . Since Godunov-type explicit methods like the wave propagation method are stable only if the Courant number is bounded by 1, it is common practice to choose the same refinement factor in time as in space, rt = rx = ry , since this usually leads to the same Courant number on the finer grids as on the coarser grid. The Courant number can be thought of as a measure of the fraction of a grid cell that a wave can traverse in one time step, and is given by |smax ∆t/∆x|, where smax is the maximum wave speed over the grid. However, for tsunami applications of the type considered in this paper, it is often desirable to choose rt to be smaller than the spatial refinement factor for the levels corresponding to the finest grids, which are often introduced only near the shoreline in regions where run-up and inundation are to be studied. This √ is because the Courant number is based on the wave √ speed |u ± gh| ≈ gh, which depends on the water depth. For grids that are confined to coastal regions, h is much smaller than on the coarser grids that cover the ocean. If the coarsest grid covers regions where the ocean is 4000 m deep while a fine level is restricted to regions where the depth is at most 40 m, for example, then refining by the same factor in space and time would lead to a Courant number of 0.1 or less on the fine grid and potentially require 10 times as many time steps on the fine grids than
254
R. J. LeVeque, D. L. George and M. J. Berger
are necessary for stability. Since the vast majority of grid cells are often associated with fine grids near the shore, this can have a huge impact on the efficiency of the method (and also its accuracy, since solving a hyperbolic equation with very small Courant number introduces additional numerical viscosity and is typically less accurate than if a larger time step is used). We will first give a brief summary of the AMR integration algorithm and the regridding strategy. We then focus on the modifications that are required for tsunami modelling, which are also important in modelling other depth-averaged geophysical flows of the type mentioned in Section 1. 8.2. AMR procedure The basic AMR integrating algorithm applies the following steps recursively, starting with the coarsest grids at level = 1. AMR Integration Strategy. (1) Take a time step of length ∆t on all grids at level . (2) Using the solution at the beginning and end of this time step, perform space–time interpolation to determine ghost cell values for all level +1 grids at the initial time and all rt − 1 intermediate times, for any ghost cells that do not lie in adjacent level + 1 grids. (Where there is an adjacent grid at the same level, values are copied directly into the ghost cells at each intermediate time step.) (3) Take rt time steps on all level + 1 grids to bring these grids up to the same advanced time as the level grids. (4) For any grid cell at level that is covered by a level + 1 grid, replace the solution Q in this cell by an appropriate average (described in Section 9) of the values from the rx ry grid cells on the finer grid that cover this cell. (5) Adjust the coarse cell values adjacent to fine grids to maintain conservation of mass (and of momentum in regions where the source terms vanish). This step is described in more detail in Section 9.4, after discussing the interpolation issues. After each of the level + 1 time steps in step (3) above, the same algorithm is applied recursively to advance even finer grids (levels + 2, . . .). Every few time steps on each level a regridding step is applied (except on the finest allowed level). The frequency depends on how fast the waves are moving, and how wide a buffer region around the grid patches there is. The larger the buffer region, the less frequently regridding needs to be performed. On the other hand a wide buffer region results in more grid cells to integrate on the finer level. We typically use a buffer width of 2 or 3 cells and regrid every 2 or 3 time steps on each level.
Tsunami modelling
255
AMR Regridding Algorithm. (1) Flag cells at level that require refinement to level + 1. Our flagging strategy for tsunami modelling is summarized below. (2) Cluster the flagged cells into rectangular patches using the algorithm of Berger and Rigoutsos (1991). This heuristic tries to strike a balance between minimizing the number of grids (to reduce patch overhead), and minimizing the number of unnecessarily refined cells when clustering into rectangles. (3) Initialize the solution on each level + 1 grid. For each cell, either copy the data from an existing level + 1 grid or, if no such grid exists at this point, interpolate from level grids using procedures described in the next section.
8.3. AMR cell flagging criteria Depending on the application, a variety of different criteria might be used for flagging cells. In many applications an error estimation procedure or a feature detection algorithm is applied to all grid points on levels l < Lmax , where Lmax is the maximum number of levels allowed. Cells where a threshold is exceeded are flagged for inclusion in a finer grid patch. A common choice is to compute the spatial gradient of one or more components of the solution vector q. For the simulation of tsunamis, we generally use the elevation of the sea surface relative to sea level, |h + B − ηs |. This is non-zero only in the wave and is a much better flagging indicator than the gradient of h, for example, which can be very large even in regions where the ocean is at rest due to variations in topography. The sheer scale of tsunami modelling makes it necessary to allow much more refinement in some spatio-temporal regions than in others. In particular, the maximum refinement level and refinement ratios may be chosen to allow a very fine resolution of some regions of the coast that are of particular interest, for example a harbour or bay where a detailed inundation map is desired. Other regions of the coast may be of less interest and require less refinement. We may also wish to allow much less refinement away from the coast where the tsunami can be well represented on a much coarser grid. Conversely it is sometimes useful to require refinement up to a given level in certain regions. This is useful, for example, to force some refinement of a region before the wave arrives. These regions of required or allowed refinement may vary with time, since one part of the coast may be of interest at early times and another part of the coast (more distant from the source) of interest at later times. To address this, in the GeoClaw software the user
256
R. J. LeVeque, D. L. George and M. J. Berger
can specify a set of space–time regions of the form L1 , L2 , x1 , x2 , y1 , y2 , t1 , t2 to indicate that on the given space–time rectangle [x1 , x2 ] × [y1 , y2 ] × [t1 , t2 ], refinement to at least level L1 is required, and to at most level L2 is allowed.
9. Interpolation strategies for coarsening and refining If the refinement level increases in a region during regridding, the solution in the cells of the finer grid may need to be interpolated from coarser levels in order to initialize the new grids. In the other direction, averaging from fine grids to coarser underlying grids is done in step (4) of the AMR algorithm of Section 8.2. This produces the best possible solution on the coarse grid at each time. When a fine grid disappears in some region during regridding, the remaining coarser grid already contains the averaged solution based on the finer grid, and so no additional work is required to deal with coarsening during the regridding stage. We will first discuss refining and coarsening in the context of a onedimensional problem where it is easier to visualize. The formulas we develop all extend in a natural way to the full two-dimensional case, discussed in Section 9.3. When refining and coarsening it is important to maintain the steady states of an ocean at rest. This is particularly important since refinement often occurs just before the tsunami wave arrives in an undisturbed area of the ocean, and coarsening occurs as waves leave an area and the ocean returns to a steady state. Since the interpolation procedures are intimately tied to the representation of the bathymetry and its interpolation between grids at different levels, we start the discussion there. We consider a cell Ck at some level , and say that a cell Ci+1 at the finer level is a subcell of Ck if it covers a subset of the interval Ck (recall we are still working in one space dimension). The set of indices i for which Ci+1 is a subcell of Ck will be denoted by Γk . We will say that the topography is consistent between the different levels if the topography value Bk in a cell at level is equal to the average of the values Bi+1 in all subcells of Ck at level + 1: 1 +1 Bi . (9.1) Bk = rx i∈Γk
If the cells have non-uniform sizes, for example on a latitude–longitude grid in two dimensions, then this formula generalizes to the requirement that 1 +1 +1 V i Bi . (9.2) Bk = Vk i∈Γk
257
Tsunami modelling ηs
ηs
C1 +1 C2 +1 C3 +1 C4 +1 C5 +1 C6 +1
C1
(a)
C2
C3
(b)
Figure 9.1. (a) Level + 1 topography and water depth with a constant sea surface elevation ηs . The dashed lines are the level topography. (b) Level
topography and water depth on the coarse grid.
where the cell volumes (lengths in 1D, areas in 2D) satisfy Vi+1 . Vk =
(9.3)
i∈Γk
Since a discussion of this consistency is most relevant in 2D, we will defer discussion of how we accomplish (9.2) to Section 9.3, and assume that it holds for now. 9.1. Coarsening and refining away from shore We first consider a situation such as illustrated in Figure 9.1, where all the cells are wet on both levels. In this figure and the following figures, the darker region is the earth below the topography Bi and the lighter region is the water between Bi and ηi = Bi + hi . The coarse-grid topography of Figure 9.1(b) (which is also shown as a dashed line in Figures 9.1(a) and (b)) is consistent with the fine grid topography: each coarse-grid value of B is the average of the two fine grid values. The water depths illustrated in Figures 9.1(a) and 9.1(b) are consistent with each other (the total mass of water is the same) and both correspond to an undisturbed ocean with η ≡ ηs . for i = 1, 2, . . . , 6 on the fine Suppose we are given the solution Q+1 i (level + 1) grid shown in Figure 9.1(a) and we wish to coarsen it to obtain Figure 9.1(b). Assume the topography Bi+1 is consistent, so that 1 +1 +1 + B2k ), Bk = (B2k−1 2
k = 1, 2, 3.
(9.4)
To compute the water depth hk in the coarser cells we can simply set 1 hk = (h+1 + h+1 2k ), 2 2k−1
k = 1, 2, 3.
(9.5)
258
R. J. LeVeque, D. L. George and M. J. Berger
This preserves the steady state of water at rest Bi+1 + h+1 = ηs for all i i ∈ Γk , since then Bk + hk = ηs as well. More generally, with an arbitrary refinement factor rx and possibly varying cell volumes, we would set 1 +1 +1 hk = Vi hi . (9.6) Vk i∈Γk
The momentum µk can be averaged from level + 1 to level in the same manner, replacing h by µ in (9.6). To go in the other direction, now suppose we are given the coarse-grid solution of Figure 9.1(b) and wish to interpolate to the fine grid, for example after a new grid is created. We would like to obtain Figure 9.1(a) on the fine grid in this case, with the flat water surface preserved. Unfortunately, the standard approach using linear interpolation of the conserved variables in the coarse cell and evaluating them at the centre of each fine grid cell described in Berger and LeVeque (1998) works very well for most conservation laws but fails miserably here. For the data shown in Figure 9.1(b), the depth is decreasing linearly over the three coarse-grid cells. Using this linear function as the interpolant to compute the fluid depth h in the cells Ci+1 on the finer grid would conserve mass but would not preserve the sea surface, because the fine grid bathymetry is not varying linearly. Variation in the sea surface would generate gradients of h + B and hence spurious waves. In tsunami calculations on coarse ocean grids this interpolation strategy can easily generate discontinuities in the surface level on the order of tens or hundreds of metres, destroying all chances of modelling a tsunami. Instead, the interpolation must be based on surface elevation ηk = Bk + hk , which for Figure 9.1(b) would all be equal to ηs . We construct a linear interpolant to these data over each grid cell and evaluate this at the fine cell centres to obtain values = ηi+1 − Bi+1 . The interpolant in coarse cell k is ηi+1 , and then set h+1 i η(x) = ηk + σk (x − xk ),
(9.7)
where xk is the centre of this cell. The slope σk is chosen to be σk = minmod(ηk − ηk−1 , ηk+1 − ηk )/∆x .
(9.8)
We generally use the standard minmod function (e.g., LeVeque (2002)), which returns the argument of minimum modulus, or zero if the two arguments have opposite sign. This interpolation strategy prevents the introduction of new extrema in the water surface elevation, preserves a flat sea surface (provided that all depths are positive), and produces Figure 9.1(a) from the data in Figure 9.1(b). In a tsunami wave the sea surface is not flat but is nearly so, and the surface is a smoothly varying function of x even when the topography varies
Tsunami modelling
259
rapidly. The approach of interpolating the water surface elevation also works well in this case and produces a second-order accurate approximation to smooth waves. Note that although we switch to the variable η when doing the interpolation, the equations are still being solved in terms of the conserved quantities. To interpolate the momentum, we begin with the standard approach; we determine a linear interpolant to µk and then evaluate this at the fine cell centres. Again we use minmod slopes to prevent the introduction of new local extrema in momentum. However, because we might be interpolating to fine cells that are much shallower than the coarse cell, we ensure that the interpolation does not introduce new extrema in velocities as well. We +1 check the velocities in the fine cells, defined by µ+1 i /hi , for all i ∈ Γk , to see if there are new local extrema that exceed the coarse velocities Ck , Ck−1 and Ck+1 . If so, we redefine the fine cell momenta, for all i ∈ Γk , by = h+1 µk /hk . (9.9) µ+1 i i Note that this still conserves momentum, assuming that (9.6) is satisfied, since +1 +1 Vi+1 µ+1 = µk /hk Vi hi by (9.9). i i∈Γk i∈Γk (9.10) = Vk µk
by (9.6)
While this additional limiting may at first seem unnecessary or overly restrictive, without it the velocities created in shallow regions where fine cells have vanishingly small depths can become unbounded. This makes the interpolation procedures near the shore, at the interface of wet and dry cells, especially difficult. This is the subject of the next section. 9.2. Coarsening and refining near the shore The averaging and interpolation strategies just presented break down near the shoreline where one or more cells is dry. Figure 9.2 illustrates two possible situations. In both cases it is impossible to maintain conservation of mass and also preserve the flat sea surface. In this case we forgo conservation and maintain the flat surface, since otherwise the resulting gradient in sea surface will generate spurious waves near the coast that can easily have larger magnitude than the tsunami itself. In Figure 9.2(b) the middle coarse cell is wet, h2 > 0, while on the refined > 0 but h+1 = 0 in grid only one of the two refined cells is wet, h+1 3 4 Figure 9.2(a). Figures 9.2(c) and 9.2(d) show a case where the middle coarse cell is dry, but on the fine grid one of the underlying fine cells must be wet in order to maintain a constant sea surface. In both cases, the total
260
R. J. LeVeque, D. L. George and M. J. Berger
ηs
C1 +1 C2 +1 C3 +1 C4 +1 C5 +1 C6 +1
ηs
C1
(a)
C2
C3
(b)
ηs
C1 +1 C2 +1 C3 +1 C4 +1 C5 +1 C6 +1
(c)
ηs
C1
C2
C3
(d)
Figure 9.2. (a) Level + 1 topography and water depth on a beach where the three rightmost cells are dry. (b) Corresponding level representation with one dry cell. (c) Second example of level + 1 topography and water depth on a beach where the three rightmost cells are dry. (d) The corresponding level representation with two dry cells. Note that refining the middle dry cell leads to one wet cell and one dry cell.
mass of water is not preserved either when going from the coarse to fine or from the fine to coarse grid. The lack of conservation of mass near shorelines is perhaps troubling, but there is no way to avoid this when different resolutions of the topography are used. For ocean-scale tsunami modelling it may easily happen that the entire region of interest along the coast lies within a single grid cell on the coarsest level, and this cell will be dry if the average topography value in this coarse cell is above sea level. Obviously, when this cell is refined as the wave approaches land, water must be introduced on the finer grids in order to properly represent the fine-scale topography and shoreline. Stated more generally, in order to prevent the generation of new sea-surface extrema and hence hydraulic gradients near the shoreline, the coarsening and refining formulas presented in the previous section require additional modifications, which do not conserve mass in general. To mitigate this we try to ensure
261
Tsunami modelling
that the shoreline is appropriately refined, using fine topography and a flat sea, before the wave arrives. Then the change in mass does not affect the computed solution at all: exactly the same solution would be computed if the shoreline had been fully resolved from the start of the computation. When coarsening, the simple averaging (9.6) cannot be used near the = 0, in which case the coarse cell shoreline unless all fine cells are dry h+1 i hk = 0 is also dry and is the average. In general, to go from the fine grid values to a coarse-grid value we average over only those subcells that are wet, setting +1 +1 sgn(h+1 i∈Γ Vi i )ηi , (9.11) η˜k = k +1 sgn(h+1 i∈Γ Vi i ) k
and then set hk = max(0, η˜k − Bk ).
(9.12)
Note that sgn(H) is always 0 (if the cell is dry) or 1 (if it is wet) and by assumption at least one subcell is wet, so the denominator of (9.11) is nonzero. If all cells are wet then we will have η˜k > Bk and mass is conserved. In fact the formula (9.12) reduces to (9.6) in this case, and in practice we always use (9.12) for coarsening. Now consider refinement. To interpolate the depth from a coarse cell to the underlying fine cells in a situation such as those shown in Figure 9.2, we first construct a linear interpolant for the surface elevation η, a function of the form ¯k (x − xk ), (9.13) Nk (x) = η¯k + σ Here η¯k is not the usual surface variable η, but is modified to account for dry cells. This will be defined below. Once defined on all coarse cells, σ ¯k is computed again using minmod slopes based on the values of η¯ . We then compute the depth in the subcells using this linear function and the fine grid topography, +1 = max(0, Nk (x+1 ), h+1 i i ) − Bi
(9.14)
for each subcell Ci+1 of the coarse cell Ck . If the cell Ck is wet then the surface value η¯k in (9.13) is taken to be η¯k = ηk = Bk + hk
if hk > 0.
(9.15)
If the coarse cell is dry, we need to determine an appropriate surface elevation η¯k for use in the linear function (9.13). In this case ηk = Bk , and this topography value may be above sea level. Instead of using this value we set η¯k = ηs , the specified sea level, in this case. For interpolating and coarsening momentum near the shore, because mass is not conserved in general, we must treat momentum carefully by adopting
262
R. J. LeVeque, D. L. George and M. J. Berger
additional procedures to change the momentum in a way that is consistent with the change in mass. Upon coarsening the momentum, the procedure we use conserves momentum whenever mass is conserved. If mass is lost upon coarsening, such as would occur when coarsening the solutions shown in Figures 9.2(a) and 9.2(c), the momentum associated with the mass that no longer exists is removed. That is, for cells with non-zero mass, we define the coarse momentum by min(Vk hk , i∈Γ Vi+1 h+1 i ) 1 +1 +1 k Vi µi . (9.16) µk = +1 +1 Vk hi i∈Γ Vi i∈Γk
k
Note that (9.16) reduces to the standard coarsening formula when the mass is conserved, yet when mass is reduced upon coarsening the coarse momentum is multiplied by the ratio of the coarse mass to the mass in the fine subcells. Upon refinement, we begin with the standard procedure used away from the shore: a linear interpolation of momentum is performed, and then the momentum in each fine subcell is checked to see if new extrema in velocities are generated (in determining velocity bounds, we define the velocity to be zero in dry neighbouring coarse cells), in which case we resort to (9.9) for = 0) all subcells i ∈ γk . This certainly includes the case where a dry (h+1 i subcell has non-zero momentum and hence an infinite velocity. That is, when velocity bounds are violated, each fine-cell momentum becomes the product of the fine-cell depth and the coarse velocity (for coarse cells that are dry (hk = 0), the velocity is defined to be zero). Note that this procedure alone does not conserve momentum if mass is not conserved: rather, if mass is altered on the fine grid, the momentum would be altered by the ratio of fine subcells’ mass to the coarse cell’s mass. To prevent the addition of momentum to the system purely through refinement, we modify (9.9) to = h+1 µ+1 i i
max hk , V1 k
µ k i∈Γk
Vi+1 h+1 i
.
(9.17)
Note that (9.17) implies that momentum is conserved even when mass has been added, since in that case i∈Γk
Vi+1 µ+1 = i
max
hk , V1 k
µ k
+1 +1 hi i∈Γk Vi
Vi+1 h+1 = Vk µk . i
i∈Γk
(9.18) When mass is lost, (9.17) implies that the momentum is multiplied by the ratio of the remaining fine-cell mass and coarse mass, essentially removing momentum associated with the lost mass.
Tsunami modelling
263
All of the formulas in this section reduce to those of the previous section when mass is conserved. Therefore we can implement the coarsening and refining strategy in a uniform manner for all cases. While the formulas may seem overly complicated, they ensure the following properties upon regridding. • • • •
Mass is conserved except possibly near the shore. Mass conservation implies momentum conservation. If mass is gained, momentum is conserved. If mass with non-zero momentum is lost, the momentum associated with that mass is removed as well. • New extrema in surface elevation and hence hydraulic gradients are not created. • New extrema in water velocity are not created. In general, coarsening and refinement near the shoreline should ideally happen just prior to the arrival of waves, while the shoreline is still at a steady state. In this case, all of the specialized procedures described in this section produce the same solution on the fine grids as would exist if the fine grids had been initialized with a constant sea level long before the tsunami arrival. Therefore, although mass and momentum are not necessarily conserved upon refinement, the adaptive solution is ideally close to the solution that would exist if fixed (non-AMR) grids were used, yet at a much reduced computational expense. 9.3. Extension to two dimensions Interpolation and averaging All of the interpolation and averaging strategies described above extend naturally to two dimensions. In fact, if we continue to let a single index represent grid cells, e.g., i ∈ Γk represents the index of a level + 1 rectangular subcell Ci+1 within a level rectangular cell Ck , then most of the formulas described above need only minor modification. The length ratio rx becomes an area ratio rx ry in the case of a Cartesian grid. More generally we continue to use Vk to represent the area of cell k on level . For interpolation, we simply extend the linear interpolants (9.7) and (9.13) to two dimensions, f (x, y) = fk + (σ x )k (x − xk ) + (σ y )k (y − yk ).
(9.19)
Here, (xk , yk ) is the centre of this cell, and the slopes (σ x )k and (σ y )k are the minmod limited slopes in the x and y directions respectively. Lastly, when considering neighbouring cells to determine if new velocity extrema are generated in Ci+1 , we consider all nine coarse cells including and surrounding Ck .
264
R. J. LeVeque, D. L. George and M. J. Berger
Consistent computational topography The topographic data used in a computation are often specified by several different rectangular gridded digital elevation models (DEMs) that are at different resolutions. For example, over the entire ocean 10-minute data may be sufficient, while in the region near the earthquake source or along a coastal region of interest one or more finer-scale DEMs must be provided. The DEMs also do not necessarily align with the finite volume computational grids, and so the consistency property (9.2) for topography on different grid levels requires careful consideration. We accomplish (9.2) in the following manner. The topography data sets are ordered in terms of their spatial resolution (if two data sets have the same resolution they are arbitrarily ordered). We define the topographic surface B(x, y) as the piecewise bilinear function that interpolates the topography data set of the highest resolution DEM at any given point (x, y) in the domain. Away from boundaries of DEMs, this function is continuous and defined within each rectangle of the DEM grid using bilinear interpolation between the four corner points. Where a fine DEM grid is overlaid on top of a coarser one, there are potentially discontinuities in B(x, y) across the outer boundaries of the finer DEM. This procedure defines a unique piecewise bilinear function B(x, y) based only on the DEM grids, independent of the computational grid(s). When a new computational grid is created, either at the start of a computation or when regridding, the computational topography in each finite volume cell is defined by integrating B(x, y) over the cell: 1 B(x, y) dx dy. (9.20) Bk = Vi Ck Note that each integral may span several DEM cells if it overlaps a DEM boundary, but since it is a piecewise bilinear function the integral can be computed exactly. Since these topography values are based on exact integrals of the same surface, at all refinement levels, the consistency property (9.2) will always be satisfied. 9.4. Maintaining conservation at grid interfaces The discussion above focused on maintaining constant sea level and conserving mass and momentum when grid cells are coarsened and refined. We now turn to step (5) in the AMR Integration Strategy of Section 8.2. We wish to ensure that the method conserves mass away from the shoreline at least, and also momentum in the case without source terms. The final solution will not be strictly conservative due to the source terms of topography and friction, and due to the shoreline algorithms which favour maintaining a constant sea level over maintaining conservation of mass, but the underlying method should be conservative to reduce these effects.
Tsunami modelling
265
Recall that in step (4) of the algorithm in Section 8.2 the value of Q in any coarse-grid cell that is covered by fine grids is replaced by the appropriate weighted average of the more accurate fine-grid values. This potentially causes a conservation error since the fine grid cells at the boundary of the patch were updated using fluxes from ghost cells rather than from the neighbouring coarse cells directly. The standard fix for this, applied to finite volume methods written in flux-differencing form, is to adjust the adjacent coarse-grid values by the difference between the coarse grid flux at the patch boundary (originally used to compute the value in this cell) and the weighted average of fine grid fluxes that was instead used interior to the patch (Berger and Colella 1989). This restores global conservation and presumably also improves the value in these coarse-grid cells by using a more accurate approximation of the flux, as determined on the fine cells. We use the f-wave propagation algorithm instead of flux-differencing since this allows the development of a well-balanced method in the non-conservative form described above. This requires a modification of the flux-based fix-up procedure that is described in detail in Berger and LeVeque (1998) and implemented more generally in the AMR algorithms of Clawpack. This modification works in general for wave propagation algorithms based on fluctuations rather than fluxes. Note that since the fine grid typically takes many time steps between each coarse-grid step, performing this fix-up involves saving the fluctuations around the perimeter of each fine grid at each intermediate step, which is easily done. The harder computation is the modification of the coarse cell values based on these fluctuations, since the coarse cells affected are generally interior to a coarse grid and appear in an irregular manner. Each coarse grid keeps a linked list of cells needing this correction, and saves the fluctuations on the edge adjacent to a fine grid. For example, if the coarse cell is to the left of the fine grid, the left-going fluctuation is needed. One additional correction step is needed for conservation when using the wave propagation approach. A Riemann problem between a coarse-grid cell and the fine grid ghost cell needs to be accounted for to maintain conservation. This leads to an additional Riemann problem at the boundary of each fine grid cell at each intermediate time, as discussed by Berger and LeVeque (1998). In the absence of source terms and away from the shoreline, these two steps ensure that conservation is maintained in spite of the fact that the method does not explicitly calculate fluxes.
10. Verification, validation, and reproducibilty Verification and validation (V&V) is an important aspect of research in computational science, and often poses a large-scale challenge of its own for complex applications: see Roache (1998) for a general discussion. Our
266
R. J. LeVeque, D. L. George and M. J. Berger
goal in this paper is not to provide detailed V&V studies of the GeoClaw software, but only to give a flavour of some of the issues that arise and approaches one might take in relation to tsunami models. For some other discussions of this topic and possible test problems, see for example Synolakis and Bernard (2006) or Synolakis, Bernard, Titov, Kˆano˘ glu and Gonz´alez (2008). Verification in the present context consists of verifying that the computational algorithms and software can give a sufficiently accurate solution to the shallow water equations they purportedly solve, with the specified topography and initial conditions. In particular, this requires checking that the adaptive refinement algorithms provide accurate results in the regions of interest even when much coarser grids are used elsewhere, without generating spurious reflections at grid interfaces, for example. Exact solutions to the shallow water equations over topography are difficult to come by, but a few solutions are known that are useful, in particular as tests of the shoreline algorithms. The paper of Carrier, Wu and Yeh (2003) provides the exact solution for a one-dimensional wave on a beach that is suggested as a verification problem in Synolakis et al. (2008) and was one of the benchmark problems discussed by many authors in Liu, Yeh and Synolakis (2008). The paper of Thacker (1981) presents some other exact solutions, including water sloshing in a parabolic bowl, which has often been used as a test problem for numerical methods, for example by Gallardo et al. (2007) and in the GeoClaw test suite. In Section 11 we illustrate another technique for testing whether a tsunami code accurately solves the shallow water equations in the necessary regimes for modelling both transoceanic propagation and local inundation. No finite set of tests will prove that the program always gives correct solutions, and of course no numerical method will: the accuracy depends on the grid resolution used and other factors. However, by exercising the code on problems where an exact or highly accurate reference solution is available, it is possible to gain a useful appreciation for the accuracy and limitations of a code. Validation of a code is generally more difficult, since this concerns the question of whether the computational results provide a useful approximation to reality under a certain range of conditions. The depth-averaged shallow water equations provide only an approximation to the full threedimensional Navier–Stokes equations, so even the exact solution to these equations will only be an approximation to the real flow. Several assumptions are made in deriving the shallow water equations, in particular that the wavelength of the waves of interest is long relative to the fluid depth. This is often true for tsunamis generated by megathrust events, at least for the transoceanic propagation phase. It is less clear that this assumption holds as tsunamis move into shallower water and interact with small-scale local features. A great deal of effort has gone into validation studies for
Tsunami modelling
267
the shallow water equations and into the development and testing of other model equations that may give a better representation of reality. Validation studies of tsunami models take many forms. Comparison with actual tsunami events similar to ones the code is designed to model is the best form of validation in many ways. Due to the recent frequency of large tsunamis there is a wealth of data now available, far beyond what was available 10 years ago. These data have been used in numerous validation studies of tsunami models, for example Grilli et al. (2007) and Wang and Liu (2007). These studies are seldom clear-cut, however, due to the wide range of unknowns concerning the earthquake source structure, the resulting seafloor deformation, the proper drag coefficient to use in friction terms, and various other factors. To perform more controlled experiments, large-scale wave tanks are used to simulate tsunami inundation, with scaled-down versions of coastal features and precisely controlled sources from wave generators. The resulting flow and inundation can then be accurately measured with tools such as depth gauges, flow meters, and high-speed cameras. By running a tsunami code on the wave tank topography with the same source, careful comparisons between numerical results and the actual flow can be performed. Some standard test problems are described in Liu et al. (2008) and Synolakis et al. (2008). A problem with this, of course, is that this can only validate the code relative to the wave tank, which is itself a scaled-down model of real topography. There is still the question of how well this flow corresponds to reality. Reproducibility of computational experiments is an issue of growing concern in computational science; see for example Fomel and Claerbout (2009), Merali (2010) and Quirk (2003). By this we mean the performance of computational experiments in a controlled and documented manner that can potentially be reproduced by other scientists. While this is a standard part of the scientific method in laboratory sciences, in computational science the culture has put little emphasis on this. Many publications contain numerical experiments where neither the method used or the test problem itself are described in sufficient detail for others to verify the results or to perform meaningful comparisons against competing methods. Part of our goal with GeoClaw, and with the Clawpack project more generally, is to facilitate the specification, sharing, and archiving of computational experiments (LeVeque 2009). The codes for all the experiments in the next sections can be found on the webpage for this paper (www13), along with pointers to additional codes such as those used for the experiments presented in Berger et al. (2010).
268
R. J. LeVeque, D. L. George and M. J. Berger
11. The radial ocean As a verification test that the shallow water equations are solved correctly on the surface of the sphere, and that the wetting and drying algorithms give similar results regardless of the orientation of the shoreline relative to the grid, it is useful to test the code on synthetic problems where comparisons are easy to perform. We illustrate this with an example taken from Berger et al. (2010), which should be consulted for more details on the bathymetry and a related test problem. The domain consists of a radially symmetric ocean with a radius of 1645 km on the surface of a sphere of radius comparable to the earth’s radius, R = 6367.5 km, centred at 40◦ N. The extent of the ocean in latitude–longitude space is shown in Figure 11.1. The bathymetry is flat at −4000 m up to a 1500 km, and then is followed by a smooth continental slope and continental shelf with a depth of 100 m, and finally a linear beach. The initial conditions for the tsunami consist of a Gaussian hump of water at the centre, given by (11.1) η(r) = A0 exp −2r2 /109 , where r is the great-circle distance from the centre, measured in metres. The amplitude A0 is varied to illustrate the effect of different size tsunamis. At some location along the shelf we place a circular island with a radius of roughly 10 km, centred 45 km offshore. In theory the flow around the island should be identical regardless of where it is placed, though numerically this will not be true. We compare the results for two different locations as a test of consistency. Cross-section through island centre
Radial ocean
G1
0
55
Test 1
G3
G4
−50 Metres
45
Latitude
G2
Test 2
−100
35
−150 25 −20
−10
0 Longitude
(a)
10
20
−200 1500 1520 1540 1560 1580 1600 1620 1640 Kilometres from centre
(b)
Figure 11.1. (a) Geometry of the radially symmetric ocean, as described in the text. (b) A zoom view of the topography of the continental shelf along the ray going through the centre of the island. The location of the four gauges is also shown.
269
Tsunami modelling Bathymetry for Test 2
Bathymetry for Test 1
50.8
41.4
50.6 50.4 50.2
1
50.0
2
41.2
4
3
41.0 40.8 40.6
49.8 14.0
14.2
14.4
14.6
14.8
15.0
40.4
18.4
18.6
18.8
19.0
19.2
19.4
Figure 11.2. Bathymetry in regions near an island placed at different locations along the coast, indicated by the rectangles in Figure 11.1(a). The location of four gauges is also shown. The time history of the surface at these gauges is shown in Figure 11.4. Surface at t =
10000.0
Surface at t =
10000.0
50.8
41.4 50.6
41.2 50.4
41.0 50.2
40.8 50.0
40.6 49.8
40.4 14.0
14.2
14.4
14.6
14.8
15.0
18.4
18.6
18.8
19.0
19.2
19.4
Figure 11.3. Contours of tsunami height for flow around the island from Test 1 and Test 2, in the case A0 = 150 in (11.1). In each case solid contours are at η = 1, 3, 5, 7 m, and dashed contours are at η = −1, −3, −5, −7.
Figure 11.1(a) shows the ocean (which does not look circular in latitude– longitude coordinates). The outer solid curve is the position of the shoreline, with constant distance from the centre when measured on the surface of a sphere. The dashed line shows the extent of the continental shelf. The boxes labelled Test 1 and Test 2 are regions where the island is located in the tests presented in the following figures. The small circle near the centre shows roughly the extent of the hump of water used as initial data. Figure 11.1(b) shows a cross-section of the bathymetry through the island. Figure 11.2 shows zoomed views of the two boxes labelled Test 1 and Test 2 in Figure 11.1(a), with contours of the bathymetry. The solid contour lines are shoreline (B = 0) and the dashed contour lines are at elevations
270
R. J. LeVeque, D. L. George and M. J. Berger
B = −40, −80, −120, −160 m. Note that the continental shelf has a uniform depth of −100 m. In this figure we also indicate the locations of four gauges where the surface elevation as a function of time is recorded as the computation progresses. Specifying gauges is a standard feature in GeoClaw and at each time step the finest grid available near each gauge location is used to interpolate the surface elevation to the gauge location. Figure 11.4 shows results at these gauges for several different tests, described below. We solve using five levels of AMR with the same parameters as in Berger et al. (2010): a 40 × 40 level 1 grid over the full domain (1◦ on a side), and factor of 4 refinement in each subsequent level (a cumulative factor 256 refinement on the finest level). Levels 4 and 5 are used only near the island. We show results for three different values of the amplitude in (11.1): A0 = 0.005, 5.0 and 150.0. Figure 11.4 shows the surface elevation measured at the four gauges shown in Figure 11.2. For any fixed amplitude A0 , the gauge responses should be the same in Test 1 and Test 2, since the island and gauges are simply rotated together to a new position. This is illustrated in Figure 11.4, where the solid curve is from Test 1 and the dashed curve is from Test 2. The good agreement indicates that propagation is handled properly on the surface of the sphere and that the topography of the island and shore are well approximated on the grid, regardless of orientation. The tsunami propagation over the deep ocean is essentially linear for all of these amplitudes. For the two smaller-amplitude cases the propagation on the shelf and around the island also shows nearly linear dependence on the data, especially for gauges 1 and 4, where the undisturbed ocean depth is 100 m. Gauges 2 and 3 are at locations where the depth is about 11 m, and some nonlinear effects can be observed. Compare the gauge plots in Figure 11.4(a,b) (for A0 = 0.005) with those in Figure 11.4(c,d) (for A0 = 5), and note that the vertical axis has been rescaled by a factor of 100. Also note that for the A0 = 0.005 case, the maximum amplitude seen at any of the gauges is below 1 cm. Before hitting the continental shelf, this tsunami had even smaller amplitude. This test illustrates that it is possible to accurately capture even very small-amplitude tsunamis. Figure 11.4(e,f) shows a much larger-amplitude tsunami, using the same initial data (11.1) but with A0 = 150. Propagation across the ocean is still essentially linear and so the arrival time is nearly the same, but the wave amplitude is large enough that steepening occurs on the shelf. The nonlinear effects are evident in these gauge plots, which are no longer simply scaled up linearly from the first two cases. In Figure 11.5 we show surface plots of the run-up at different times, comparing the two computations with the island in different locations. Figure 11.3 shows contour plots for the first of these times, t = 10000 s. Four gauge locations are shown in Figure 11.2 and the surface elevation at these gauges is shown in Figure 11.4. The agreement is quite good.
271
Tsunami modelling 0.0010
Initial amplitude A0 =0.005 Gauge 2
0.0005 0.0000 −0.0005 −0.0010 8000
0.0010
Initial amplitude A0 =0.005 Gauge 4
0.0005 0.0000
Gauge 1
9000
Gauge 3
−0.0005
10000 11000 12000 13000 14000
−0.0010 8000
9000
(a) 0.10
Initial amplitude A0 =0.500 Gauge 2
0.05 0.00 −0.05 −0.10 8000
(b) 0.10
Initial amplitude A0 =0.500 Gauge 4
0.05 0.00
Gauge 1
9000
Gauge 3
−0.05
10000 11000 12000 13000 14000
−0.10 8000
9000
(c) 30
Initial amplitude A0 =150.000
20
Gauge 2
30
0
0
Gauge 4
−10
−20 −30 8000
Initial amplitude A0 =150.000
20 10
Gauge 1
10000 11000 12000 13000 14000
(d)
10
−10
10000 11000 12000 13000 14000
Gauge 3
−20 9000
10000 11000 12000 13000 14000
(e)
−30 8000
9000
10000 11000 12000 13000 14000
(f)
Figure 11.4. Comparison of gauge output from Test 1 and Test 2, showing the surface elevation as a function of time (in seconds) for the gauges shown in Figure 11.2. In each figure, the solid curve is from Test 1 and the dashed curve is from Test 2. (a,b) Very small-amplitude tsunami, with A0 = 0.005 in (11.1). (c,d) A0 = 0.5. (e,f) A0 = 150, giving the large-amplitude tsunami seen in Figure 11.5. Note the difference in vertical scale in each set of figures (metres in each case).
272
R. J. LeVeque, D. L. George and M. J. Berger Time = 10000
Time = 10000
Time = 11000
Time = 11000
Time = 13500
Time = 13500
Figure 11.5. Surface plots of the tsunami interacting with the island for Test 1 and Test 2, in the case A0 = 150 in (11.1). At time t = 10000 seconds the tsunami is just wrapping around the island, as shown also in Figure 11.3. At time 13500 the reflected wave from the mainland has run up the lee side of the island and is flowing back down. For an animation of these results, see the webpage for this paper (www13).
Tsunami modelling
273
12. The 27 February 2010 Chile tsunami As an illustration of the use of adaptive mesh refinement to explore realworld tsunamis, we will show some results obtained using GeoClaw for tsunamis similar to the one generated by the 27 February 2010 earthquake near Maule, Chile. Some computations of the 2004 Indian Ocean tsunami calculated with this software can be found in LeVeque and George (2004) and George and LeVeque (2006). We will use relatively coarse grids so that the computations can be easily repeated by the interested reader using the source code available on the webpage for this paper (www13). Several source mechanisms have been proposed for this event. Here we use a simple source computed by applying the Okada model to the fault parameters given by USGS earthquake data (www12). We use bathymetry at a resolution of 10 minutes (1/6 degree) in latitude and longitude, obtained from the ETOPO2 data set at the National Geophysical Data Center (NGDC) GEODAS Grid Translator (www9). Figures 12.1 and 12.2 show comparisons of results obtained with two simulations using different AMR strategies. In both cases, the level 1 grid has a 2◦ resolution in each direction (roughly 222 km in latitude), and grid cells of this grid can be seen on the South American continent. The finest grid level also has the same resolution in both cases, a factor of 20 smaller in each direction. For the calculation in Figures 12.1(a) and 12.2(a), only two AMR levels are used, with a refinement factor of rx1 = ry1 = 20 in each direction and flagging all cells where the water is disturbed from sea level. The level 2 grid grows as the tsunami propagates until it covers the full domain at 5 hours. (It is split into 4 level 2 grids at this point because of restrictions in the software on the size of any single grid to reduce the memory overhead.) Results of this calculation agree exactly with what would be obtained with a single grid with a uniform grid size of 0.1◦ . For the calculation in Figures 12.1(b) and 12.2(b), three AMR levels are used and cells are only flagged for refinement if the deviation from sea level is greater than 0.1 m. Moreover, after t = 3 hours, we flag points only if the latitude is greater than −25◦ S. The refinement factors are rx1 = ry1 = 4 from level 1 to level 2 and rx2 = ry2 = 5 from level 2 to level 3, so the finest grid has the same resolution as in (a). Ideally the results in the regions covered by the finest grid (the smallest rectangles in the figure) would be identical to those in (a). Visually they agree quite well. In particular, it should be noted that there is no apparent difficulty with spurious wave generation at the interfaces between patches at different refinement levels. Also note that in both calculations the wave leaves the computational domain cleanly with little spurious reflection at the open boundaries.
274
R. J. LeVeque, D. L. George and M. J. Berger
(a)
(b)
Figure 12.1. The 27 February 2010 tsunami as computed using GeoClaw. The rectangles show the edges of refinement patches. (a) Two levels of AMR, with refinement everywhere around and behind the wave. (b) Three levels of AMR, with the same finest grid resolution but refinement in limited regions. The colour scale is the same as in Figure 1.1, ranging from −0.2 to 0.2 m.
275
Tsunami modelling
(a)
(b)
Figure 12.2. Continuation of Figure 12.1. Note the reflection from the Galapagos on the equator at 6 hours, and that elsewhere the wave leaves the computational domain cleanly. For an animation of these results, see the webpage for this paper (www13).
276
R. J. LeVeque, D. L. George and M. J. Berger Depth at DART buoy 32412 4326.0 4325.8
(a)
4325.6 4325.4 4325.2 −20
−10
0 10 Hours after earthquake
20
Surface elevation at DART 32412
0.3
2 levels 3 levels DART
Metres
0.2
(b)
30
0.1 0.0
−0.1 −0.2
3
4
5 6 Hours after earthquake
7
8
Figure 12.3. (a) Data from DART buoy 32412 before removing the tides. The first blip about 15 minutes after the earthquake is the seismic wave. The tsunami arrives roughly 3 hours later. (b) Comparison of de-tided DART buoy data with two GeoClaw computations. The resolution of the finest grid was the same in both cases.
For a more quantitative comparison of these results, Figure 12.3(b) shows a comparison of the computed surface elevation as a function of time at the location of DART buoy 32412. The solid line is from the level 2 (uniform fine grid) computation, while the dashed line is from the level 3 computation in Figures 12.1(b) and 12.2(b). The agreement is very good up to about 5 hours, after which the DART buoy is in a region that is not refined. Note from Figure 12.2 that at 8 hours there is still wave action visible on the coast of Peru to the northeast of the DART buoy. This is a region where the continental shelf is very wide and shallow, and waves become trapped in this region due to the slow propagation speed and reflections for the steep shelf slope. In Figure 12.4 we show a zoomed view of these regions from another computation in which a fourth level of AMR has been added, refining by an additional factor of 4. (We have also used finer bathymetry
Tsunami modelling
277
Figure 12.4. Tsunami interaction with the broad continental shelf off the coast of Peru. A fourth level of refinement has been added beyond the levels shown on Figure 12.2. Grid patch edges are not shown and grid lines are shown only for levels 1–3 on land. For an animation of these results, see the webpage for this paper (www13).
in this region, 4-minute data from (www9).) In these figures one can clearly see the fast and broad tsunami sweeping northwards at times 4 and 4.5 hours, and the manner in which this wave is refracted at the continental slope to become a narrower wave of larger amplitude moving towards the coast. These waves continue to propagate up and down the coast in this region for more than 24 hours after the tsunami has passed. 12.1. Inundation of Hilo Some bays have the dubious distinction of being tsunami magnets due to local bathymetry that tends to focus and amplify tsunamis. Notable examples on the US coastline are Crescent City, CA and Hilo, HI. In this section
278
R. J. LeVeque, D. L. George and M. J. Berger
we use adaptive refinement to track the 27 February 2010 tsunami originating in Chile across the Pacific Ocean and then add several additional levels of refinement to resolve the region near Hilo Harbor. The two simulations described in this section had the same computational parameters such as refinement criteria, but with two different source mechanisms. The computational domain for these simulations spanned 120 degrees of latitude and 100 degrees of longitude, from the source region near Maule, Chile in the southeastern corner of the domain to the Hawaiian Islands in the northwestern corner. We used five levels of grids, using refinement ratios of 8, 4, 16 and 32. The coarsest level consisted of a 60 × 50 grid with 2◦ grid cells, yielding a very coarse grid over the ocean at rest. Transoceanic propagating waves were resolved in level 2 grids. Level 3 grids were allowed only near the Hawaiian island chain, with the refinement ratio chosen to roughly match the resolution of bathymetric data used (1 minute). Level 4 grids were allowed surrounding the Big Island of Hawaii, where Hilo is located. In this region we used 3-arcsecond bathymetry from (www8). Finally, level 5 grids were allowed only near Hilo Harbor, where 1/3-arcsecond data from the same source were used. Figure 12.5 shows the the domain of the simulation at four times, as the waves propagate across the Pacific. The outlines of level 3–5 grids can be seen in the final frame, and appear just as the waves reach Hawaii. Figure 12.6 shows a close-up of the grids surrounding Hilo. The finest fifth-level grids were sufficient to resolve the small-scale features necessary to model inundation, such as shoreline structures and a sea wall in Hilo Harbor. The computational grids on the fifth level had grid cells with roughly 10 m grid resolution. Note that the finest grids are refined by a factor 214 = 16 384 in each coordinate direction relative to level 1 grids. Each grid cell on the coarsest level would contain roughly 286 million grid cells if a uniform fine grid were used, far more than the total number of grid cells used at any one time with adaptive refinement. The two source mechanisms used were identical except for the magnitude of slip. We first modelled the actual 27 February 2010 event described in Section 12, by applying the Okada model to fault parameters given by (www12). USGS earthquake data (www12). For the second source mechanism we used the same fault parameters, but increased each subfault dislocation by a factor of 10. The motivation for this second source model is twofold. First, the actual 27 February 2010 tsunami produced little or no inundation in Hilo, so to demonstrate inundation modelling with GeoClaw we created a much larger hypothetical tsunami. Second, amplifying the dislocation while keeping all other parameters fixed allows us to examine linearity in the off-shore region versus nonlinearity for tsunami inundation. The waves produced in Hilo Harbor by the larger hypothetical source are comparable to those arising from more tsunamigenic events in the past (for
279
Tsunami modelling
Figure 12.5. The 27 February 2010 tsunami propagates toward the Hawaiian Islands on level 1 and 2 grids. Higher-level grids appear around Hawaii as the waves arrive.
(a)
(b)
Figure 12.6. Close-up of the higher-level grids appearing as the tsunami reaches the Hawaiian Islands. (a) All levels of grids, with grid lines omitted from levels 3–5. (b) Close-up of the Island of Hawaii, where an outline of level 5 grids surrounding the city of Hilo can be seen on the east coast of Hawaii. Grid lines are omitted from levels 4–5.
280
R. J. LeVeque, D. L. George and M. J. Berger
(a)
(b)
Figure 12.7. Computed inundation maps of Hilo, HI, based on two source mechanisms. (a) Inundation using an actual USGS fault model for the February 2010 event. (b) Hypothetical source mechanism, with the dislocations amplified by a factor of 10, in order to show inundation.
example, the 1960 Chile quake and the 1964 Alaska event). Figure 12.7 shows the two different inundation patterns from the original and amplified source. The location of simulated water level gauges are indicated in the figures. The output of the gauges is shown in Figure 12.8. Gauge 1 is in Hilo Harbor and shows the incoming waves. Note that the waves in the harbour are still close to linear with respect to the source dislocation, several thousand kilometres away. However, in the nearer-shore and onshore regions inundation becomes strongly nonlinear, and determining the patterns of inundation cannot be done by a linear scaling of solutions from different source models.
Tsunami modelling
281
(a)
(b)
(c)
Figure 12.8. Time series of the surface elevation at three different simulated gauge locations near Hilo, HI. The locations of the gauges are shown in Figure 12.7. The results for the ‘amplified fault model’ were obtained by increasing the slip displacement at the source by a factor of 10. The solid curve in (a) shows the solution for the amplified source mechanism multiplied by 0.10. This lies nearly on top of the curve from the original source model, indicating that the response is nearly linear in the harbour. The inland gauges in (b,c) exhibit nonlinear behaviour: they remain dry for the smaller tsunami but show large inundation waves for the amplified fault model.
282
R. J. LeVeque, D. L. George and M. J. Berger
13. Final remarks In this paper we have focused on tsunami modelling using Godunov-type finite volume methods, and the issues that arise when simulating the propagation of a very small-amplitude wave across the ocean, followed by modelling the nonlinear run-up and inundation of specific regions remote from the initial event. The scale of these problems makes the use of adaptive mesh refinement crucial. The same techniques are applicable to a variety of other geophysical flow problems such as those listed in Section 1. The GeoClaw software has recently been applied to other problems, such as modelling the failure of the Malpasset dam in 1959 (George 2010). This has often been used as a test problem for validation of codes modelling dam breaks. Storm surge associated with tropical storms is another application where shallow water equations are often used, and some preliminary results on this topic have been obtained by Mandli (2010) with the GeoClaw code. For many problems the shallow water equations are insufficient and other depth-averaged models must be developed. Even in the context of tsunami modelling, there are some situations where it may be important to include dispersive terms (Gonz´ alez and Kulikov 1993, Saito, Matsuzawa, Obara and Baba 2010), particularly for shorter-wavelength waves arising from submarine landslides, as discussed for example by Watts et al. (2003) or Lynett and Liu (2002). A variety of dispersive terms might be added; see Bona, Chen and Saut (2002) for a recent survey of Boussinesq models and other alternatives. Dispersive terms generally arise in the form of third-order derivatives in the equation, generally requiring implicit algorithms in order to obtain stable results with reasonable time steps. This adds significant complication in the context of AMR and this option is not yet available in GeoClaw. An alternative is to use a dispersive numerical method, tuned to mimic the true dispersion; see for example Burwell, Tolkova and Chawla (2007). This seems problematic in the context of AMR. Other flows require the use of more complex rheologies than water, for example landslides, debris flows, or lava flows. We are currently extending GeoClaw to handle debris flows using a variant of the models of Denlinger and Iverson (2004a, 2004b). For some related work with similar finite volume algorithms, see Pelanti, Bouchut and Mangeney (2008, 2011) and Costa and Macedonio (2005). A variety of numerical approaches have been used for modelling tsunamis and other depth-averaged flows in recent years. There is a large literature on topics such as well-balanced methods and wetting-and-drying algorithms, not only for finite volume methods but also for finite difference, finite element, discontinuous Galerkin, and other methodologies, on both structured and unstructured grids. We have not attempted a full literature survey in this paper, either on numerical methods or tsunami science, but hope that
Tsunami modelling
283
the references provided give the reader some entry into this field. There are a host of challenging problems remaining in the quest to better understand and protect against these hazards.
Acknowledgements The GeoClaw software is an extension and generalization of the TsunamiClaw software originally developed from Clawpack (www3) as part of the PhD thesis of one of the authors (George 2006). Our work on tsunami modelling has benefited greatly from the generous help of many researchers in this community, in particular Harry Yeh, who first encouraged us to work on this problem, members of the tsunami sedimentology group at the University of Washington, and members of the NOAA Center for Tsunami Research in Seattle. Several people provided valuable feedback on this paper, including B. Atwater, J. Bourgeois, G. Gelfenbaum, F. Gonz´ alez, B. MacInnes, K. Mandli, and M. Martin. Thanks to Jody Bourgeois for providing Figures 2.1 and 2.2. This work was supported in part by NSF grants CMS-0245206, DMS0106511, DMS-0609661 and DMS-0914942, ONR grant N00014-09-1-0649, DOE grant DE-FG02-88ER25053, AFOSR grant FA9550-06-1-0203, the Founders Term Professorship in Applied Mathematics at the University of Washington, and a USGS Mendenhall Postdoctoral Fellowship.
REFERENCES1 B. F. Atwater et al. (2005), The Orphan Tsunami of 1700, University of Washington Press, Seattle. D. S. Bale, R. J. LeVeque, S. Mitran and J. A. Rossmanith (2002), ‘A wave propagation method for conservation laws and balance laws with spatially varying flux functions’, SIAM J. Sci. Comput. 24, 955–978. J. P. Bardet, C. E. Synolakis, H. L. Davies, F. Imamura and E. A. Okal (2003), ‘Landslide tsunamis: Recent findings and research directions’, Pure Appl. Geophys. 160, 1793–1809. M. Berger and J. Oliger (1984), ‘Adaptive mesh refinement for hyperbolic partial differential equations’, J. Comput. Phys. 53, 484–512. M. J. Berger and P. Colella (1989), ‘Local adaptive mesh refinement for shock hydrodynamics’, J. Comput. Phys. 82, 64–84. M. J. Berger and R. J. LeVeque (1998), ‘Adaptive mesh refinement using wavepropagation algorithms for hyperbolic systems’, SIAM J. Numer. Anal. 35, 2298–2316. M. J. Berger and I. Rigoutsos (1991), ‘An algorithm for point clustering and grid generation’, IEEE Trans. Sys. Man & Cyber. 21, 1278–1286. 1
The URLs cited in this work were correct at the time of going to press, but the publisher and the authors make no undertaking that the citations remain live or are accurate or appropriate.
284
R. J. LeVeque, D. L. George and M. J. Berger
M. J. Berger, D. A. Calhoun, C. Helzel and R. J. LeVeque (2009), ‘Logically rectangular finite volume methods with adaptive refinement on the sphere’, Phil. Trans. R. Soc. A 367, 4483–4496. M. J. Berger, D. L. George, R. J. LeVeque and K. T. Mandli (2010), The GeoClaw software for depth-averaged flows with adaptive refinement. To appear in Advances in Water Resources. Available at: www.clawpack.org/links/awr11. J. L. Bona, M. Chen and J.-C. Saut (2002), ‘Boussinesq equations and other systems for small-amplitude long waves in nonlinear dispersive media I: Derivation and linear theory’, J. Nonlinear Sci. 12, 283–318. N. Botta, R. Klein, S. Langenberg and S. L¨ utzenkirchen (2004), ‘Well balanced finite volume methods for nearly hydrostatic flows’, J. Comput. Phys. 196, 539–565. F. Bouchut (2004), Nonlinear Stability of Finite Volume Methods for Hyperbolic Conservation Laws and Well-Balanced Schemes for Sources, Birkh¨ auser. J. Bourgeois (2009), Geologic effects and records of tsunamis. In The Sea, Vol. 15 (E. N. Bernard and A. R. Robinson, eds), Harvard University Press, pp. 55– 92. D. Burwell, E. Tolkova and A. Chawla (2007), ‘Diffusion and dispersion characterization of a numerical tsunami model’, Ocean Modelling 19, 10–30. G. F. Carrier and H. Yeh (2005), ‘Tsunami propagation from a finite source’, CMES 10, 113–121. G. F. Carrier, T. T. Wu and H. Yeh (2003), ‘Tsunami run-up and draw-down on a plane beach’, J. Fluid Mech. 475, 79–99. M. J. Castro, P. G. LeFloch, M. L. Munoz and C. Par´es (2008), ‘Why many theories of shock waves are necessary: Convergence error in formally path-consistent schemes’, J. Comput. Phys. 227, 8107–8129. A. Costa and G. Macedonio (2005), ‘Numerical simulation of lava flows based on depth-averaged equations’, Geophys. Res. Lett. 32, L05304. A. Dawson, D. Long and D. Smith (1988), ‘The Storegga Slides: Evidence from eastern Scotland for a possible tsunami’, Marine Geology, January 1988. R. P. Denlinger and R. M. Iverson (2004a), ‘Granular avalanches across irregular three-dimensional terrain 1: Theory and computation’, J. Geophys. Res. 109, F01014. R. P. Denlinger and R. M. Iverson (2004b), ‘Granular avalanches across irregular three-dimensional terrain 2: Experimental tests’, J. Geophys. Res. 109, F01015. B. Einfeldt (1988), ‘On Godunov-type methods for gas dynamics’, SIAM J. Numer. Anal. 25, 294–318. B. Einfeldt, C. D. Munz, P. L. Roe and B. Sjogreen (1991), ‘On Godunov type methods near low densities’, J. Comput. Phys. 92, 273–295. S. Fomel and J. F. Claerbout (2009), ‘Guest editors’ introduction: Reproducible research’, Comput. Sci. Engrg 11, 5–7. J. M. Gallardo, C. Par´es and M. Castro (2007), ‘On a well-balanced high-order finite volume scheme for shallow water equations with topography and dry areas’, J. Comput. Phys. 227, 574–601. E. L. Geist and T. Parsons (2006), ‘Probabilistic analysis of tsunami hazards’, Nat. Haz. 37, 277–314.
Tsunami modelling
285
E. L. Geist, T. Parsons, U. S. ten Brink and H. J. Lee (2009), ‘Tsunami probability’, 15, 201–235. G. Gelfenbaum and B. Jaffe (2003), ‘Erosion and sedimentation from the 17 July, 1998 Papua New Guinea tsunami’, Pure Appl. Geophys. 160, 1969–1999. D. George (2010), ‘Adaptive finite volume methods with well-balanced Riemann solvers for modeling floods in rugged terrain: Application to the Malpasset dam-break flood (France, 1959)’, Int. J. Numer. Meth. Fluids. D. L. George (2006), Finite volume methods and adaptive refinement for tsunami propagation and inundation. PhD thesis, University of Washington. D. L. George (2008), ‘Augmented Riemann solvers for the shallow water equations over variable topography with steady states and inundation’, J. Comput. Phys. 227, 3089–3113. D. L. George and R. J. LeVeque (2006), ‘Finite volume methods and adaptive refinement for global tsunami propagation and local inundation’, Science of Tsunami Hazards 24, 319–328. F. I. Gonz´ alez and Y. A. Kulikov (1993), Tsunami dispersion observed in the deep ocean. In Tsunamis in the World (S. Tinti, ed.), Vol. 1 of Advances in Natural and Technological Hazards Research, Kluwer, pp. 7–16. F. I. Gonz´ alez, E. L. Geist, B. Jaffe, U. Kanoglu et al. (2009), ‘Probabilistic tsunami hazard assessment at Seaside, Oregon, for near- and far-field seismic sources’, J. Geophys. Res. 114, C11023. L. Gosse (2000), ‘A well-balanced flux-vector splitting scheme designed for hyperbolic systems of conservation laws with source terms’, Comput. Math. Appl. 39, 135–159. L. Gosse (2001), ‘A well-balanced scheme using non-conservative products designed for hyperbolic systems of conservation laws with source terms’, Math. Mod. Meth. Appl. Sci. 11, 339–365. J. M. Greenberg and A. Y. LeRoux (1996), ‘A well-balanced scheme for numerical processing of source terms in hyperbolic equations’, SIAM J. Numer. Anal. 33, 1–16. S. T. Grilli, M. Ioualalen, J. Asavanant, F. Shi, J. T. Kirby and P. Watts (2007), ‘Source constraints and model simulation of the December 26, 2004, Indian Ocean Tsunami’, J. Waterway, Port, Coastal, and Ocean Engineering 133, 414. H. Haflidason, H. Sejrup, A. Nyg˚ ard, J. Mienert and P. Bryn (2004), ‘The Storegga Slide: Architecture, geometry and slide development’, Marine Geology, January 2004. J. Hammack and H. Segur (1978), ‘Modelling criteria for long water waves’, J. Fluid Mech. 84, 337–358. A. Harten, P. D. Lax and B. van Leer (1983), ‘On upstream differencing and Godunov-type schemes for hyperbolic conservation laws’, SIAM Review 25, 35–61. B. Higman, G. Gelfenbaum, P. Lynett, A. Moore and B. Jaffe (2007), Predicted sedimentary record of reflected bores. In Proc. Sixth International Symposium on Coastal Engineering and Science of Coastal Sediment Processes, ASCE, pp. 1–14.
286
R. J. LeVeque, D. L. George and M. J. Berger
K. Hirata, E. Geist, K. Satake, Y. Tanioka and S. Yamaki (2003), ‘Slip distribution of the 1952 Tokachi-Oki earthquake (M 8.1) along the Kuril Trench deduced from tsunami waveform inversion’, J. Geophys. Res. K. Huntington, J. Bourgeois, G. Gelfenbaum, P. Lynett, B. Jaffe, H. Yeh and R. Weiss (2007), ‘Sandy signs of a tsunami’s onshore depth and speed’, EOS 88, 577–578. www.agu.org/journals/eo/eo0752/2007EO52 tabloid.pdf. A. In (1999), ‘Numerical evaluation of an energy relaxation method for inviscid real fluids’, SIAM J. Sci. Comput. 21, 340–365. K. Jankaew, B. F. Atwater, Y. Sawai, M. Choowong, T. Charoentitirat, M. E. Martin and A. Prendergast (2008), ‘Medieval forewarning of the 2004 Indian Ocean tsunami in Thailand’, Nature 455, 1228–1231. H. M. Kelsey, A. R. Nelson, E. Hemphill-Haley and R. C. Witter (2005), ‘Tsunami history of an Oregon coastal lake reveals a 4600 yr record of great earthquakes on the Cascadia subduction zone’, GSA Bulletin 117, 1009–1032. Z. Kowalik, W. Knight, T. Logan and P. Whitmore (2005), ‘Modeling of the global tsunami: Indonesian Tsunami of 26 December 2004.’, Science of Tsunami Hazards 23, 40–56. J. O. Langseth and R. J. LeVeque (2000), ‘A wave-propagation method for threedimensional hyperbolic conservation laws’, J. Comput. Phys. 165, 126–166. R. J. LeVeque (1996), ‘High-resolution conservative algorithms for advection in incompressible flow’, SIAM J. Numer. Anal. 33, 627–665. R. J. LeVeque (2002), Finite Volume Methods for Hyperbolic Problems, Cambridge University Press. R. J. LeVeque (2009), ‘Python tools for reproducible research on hyperbolic problems’, Comput. Sci. Engrg 11, 19–27. R. J. LeVeque (2010), ‘A well-balanced path-integral f-wave method for hyperbolic problems with source terms’, J. Sci. Comput. doi:10.1007/s10915-010-9411-0. www.clawpack.org/links/wbfwave10. R. J. LeVeque and D. L. George (2004), High-resolution finite volume methods for the shallow water equations with bathymetry and dry states. In Proc. Long-Wave Workshop, Catalina (P. L.-F. Liu, H. Yeh and C. Synolakis, eds), Vol. 10, World Scientific, pp. 43–73. www.amath.washington.edu/˜rjl/pubs/catalina04/. R. J. LeVeque and M. Pelanti (2001), ‘A class of approximate Riemann solvers and their relation to relaxation schemes’, J. Comput. Phys. 172, 572–591. P. L. Liu, H. Yeh and C. Synolakis, eds (2008), Advanced Numerical Models for Simulating Tsunami Waves and Runup, Vol. 10 of Advances in Coastal and Ocean Engineering, World Scientific. P. Liu, P. Lynett, H. Fernando, B. Jaffe and H. Fritz (2005), ‘Observations by the International Tsunami Survey Team in Sri Lanka’, Science 308, 1595. P. Liu, S. Woo and Y. Cho (1998), ‘Computer programs for tsunami propagation and inundation’. ceeserver.cee.cornell.edu/pll-group/comcot.htm. P. Lynett and P. L. Liu (2002), ‘A numerical study of submarine-landslidegenerated waves and run-up’, Proc. Royal Soc. London Ser. A 458, 2885– 2910. C. L. Mader and M. L. Gittings (2002), ‘Modeling the 1958 Lituya Bay mega tsunami, II’, Science of Tsunami Hazards 20, 241.
Tsunami modelling
287
K. T. Mandli (2010), Personal communication. L. Mansinha and D. Smylie (1971), ‘The displacement fields of inclined faults’, Bull. Seism. Soc. Amer. 61, 1433–1438. M. E. Martin, R. Weiss, J. Bourgeois, T. K. Pinegina, H. Houston and V. V. Titov (2008), ‘Combining constraints from tsunami modeling and sedimentology to untangle the 1969 Ozernoi and 1971 Kamchatskii tsunamis’, Geophys. Res. Lett. 35, L01610. D. G. Masson, C. B. Harbitz, R. B. Wynn, G. Pedersen and F. Løvholt (2006), ‘Submarine landslides: processes, triggers and hazard prediction’, Philos. Trans. Royal Soc. A: Math. Phys. Engrg Sci. 364, 2009. D. S. McCulloch (1966), Slide-induced waves, seiching and ground fracturing caused by the earthquake of March 27, 1964, at Kenai Lake, Alaska. USGS Professional Paper 543-A. www.dggs.dnr.state.ak.us/pubs/pubs?reqtype=citation&ID=3884. C. Meinig, S. E. Stalin, A. I. Nakamura, F. Gonz´ alez and H. B. Milburn (2006), Technology developments in real-time tsunami measuring, monitoring and forecasting. In OCEANS, 2005: Proc. MTS/IEEE, pp. 1673–1679. Z. Merali (2010), ‘Why scientific computing does not compute’, Nature 467, 775– 777. D. J. Miller (1960), Giant waves in Lituya Bay, Alaska. USGS Professional Paper 354-C. www.dggs.dnr.state.ak.us/pubs/pubs?reqtype=citation&ID=3852. S. Noelle, N. Pankrantz, G. Puppo and J. R. Natvig (2006), ‘Well-balanced finite volume schemes of arbitrary order of accuracy for shallow water flows’, J. Comput. Phys. 213, 474–499. Y. Okada (1985), ‘Surface deformation due to shear and tensile faults in a halfspace’, Bull. Seism. Soc. Amer. 75, 1135–1154. Y. Okada (1992), ‘Internal deformation due to shear and tensile faults in a halfspace’, Bull. Seism. Soc. Amer. 82, 1018–1040. V. V. Ostapenko (1999), ‘Numerical simulation of wave flows caused by a shoreside landslide’, J. Applied Mech. Tech. Phys. 40, 647–654. M. Pelanti, F. Bouchut and A. Mangeney (2008), ‘A Roe-type scheme for two-phase shallow granular flows over variable topography’, M2AN 42, 851–885. M. Pelanti, F. Bouchut and A. Mangeney (2011), ‘A Riemann solver for singlephase and two-phase shallow flow models based on relaxation: Relations with Roe and VFRoe solvers’, J. Comput. Phys. 230, 515–550. D. B. Percival, D. W. Denbo, M. C. Ebl´e, E. Gica, H. O. Mofjeld, M. C. Spillane, L. Tang and V. V. Titov (2010), ‘Extraction of tsunami source coefficients via inversion of DART buoy data’, Natural Hazards doi:10.1007/s11069-010-9688-1. G. Plafker, R. Kachadoorian, E. B. Eckel and L. R. Mayo (1969), Effects of the earthquake of March 27, 1964 on various communities. USGS Professional Paper 542G. www.dggs.dnr.state.ak.us/pubs/pubs?reqtype=citation&ID=3883. J. J. Quirk (2003), Computational science: ‘Same old silence, same old mistakes’ ‘Something more is needed . . . ’. In Adaptive Mesh Refinement: Theory and Applications (T. Plewa, T. Linde and V. G. Weirs, eds), Vol. 41 of Lecture Notes in Computational Science and Engineering, Springer, pp. 3–28.
288
R. J. LeVeque, D. L. George and M. J. Berger
P. J. Roache (1998), Verification and Validation in Computational Science and Engineering, Hermosa Publishers, Albuquerque, NM. T. Saito, T. Matsuzawa, K. Obara and T. Baba (2010), ‘Dispersive tsunami of the 2010 Chile earthquake recorded by the high-sampling-rate ocean-bottom pressure gauges’, Geophys. Res. Lett. 37, L22303. K. Satake, K. Shimazaki, Y. Tsuji and K. Ueda (1996), ‘Time and size of a giant earthquake in Cascadia inferred from Japanese tsunami records of January 1700’, Nature 379, 246–249. K. Satake, K. Wang and B. Atwater (2003), ‘Fault slip and seismic moment of the 1700 Cascadia earthquake inferred from Japanese tsunami descriptions’, J. Geophys. Res. 108, 2535. C. Synolakis, J. Bardet, J. Borrero, H. Davies, E. Okal, E. Silver, S. Sweet and D. Tappin (2002), ‘The slump origin of the 1998 Papua New Guinea tsunami’, Proc. Royal Soc. London Ser. A: Math. Phys. Engrg Sci. 458, 763. C. E. Synolakis and E. N. Bernard (2006), ‘Tsunami science before and beyond Boxing Day 2004’, Philos. Trans. Royal Soc. A: Math. Phys. Engrg Sci. 364, 2231. C. E. Synolakis, E. N. Bernard, V. V. Titov, U. Kˆ ano˘glu and F. I. Gonz´ alez (2008), ‘Validation and verification of tsunami numerical models’, Pure Appl. Geophys. 165, 2197–2228. W. C. Thacker (1981), ‘Some exact solutions to the nonlinear shallow water wave equations’, J. Fluid Mech. 107, 499–508. V. V. Titov and C. E. Synolakis (1995), ‘Modeling of breaking and nonbreaking long wave evolution and runup using VTCS-2’, J. Waterways, Ports, Coastal and Ocean Engineering 121, 308–316. V. V. Titov and C. E. Synolakis (1998), ‘Numerical modeling of tidal wave runup’, J. Waterways, Ports, Coastal and Ocean Engineering 124, 157–171. V. V. Titov, F. I. Gonzalez, E. N. Bernard, M. C. Eble, H. O. Mofjeld, J. C. Newman and A. J. Venturato (2005), ‘Real-time tsunami forecasting: Challenges and solutions’, Nat. Hazards 35, 35–41. E. F. Toro (2001), Shock-Capturing Methods for Free-Surface Shallow Flows, Wiley. X. Wang and P. L. Liu (2007), ‘Numerical simulations of the 2004 Indian Ocean tsunamis: Coastal effects’, J. Earthquake Tsunami 1, 273–297. P. Watts, S. Grilli, J. Kirby, G. J. Fryer and D. R. Tappin (2003), ‘Landslide tsunami case studies using a Boussinesq model and a fully nonlinear tsunami generation model’, Nat. Haz. Earth Sys. Sci. 3, 391–402. R. Weiss, H. Fritz and K. W¨ unnemann (2009), ‘Hybrid modeling of the megatsunami runup in Lituya Bay after half a century’, Geophys. Res. Lett. 36, L09602. H. Yeh, R. K. Chadha, M. Francis, T. Katada, G. Latha, C. Peterson, G. Raghuramani and J. P. Singh (2006), ‘Tsunami runup survey along the southeast Indian coast’, Earthquake Spectra 22, S173–S186. H. Yeh, P. L. Liu and C. Synolakis, eds (1996), Long-Wave Runup Models, World Scientific. H. Yeh, P. Liu, M. Briggs and C. Synolakis (1994), ‘Propagation and amplification of tsunamis at coastal boundaries’, Nature 372, 353–355.
Tsunami modelling
Online references www1: AMROC software: amroc.sourceforge.net/. www2: Chombo software: seesar.lbl.gov/anag/chombo/. www3: Clawpack software: www.clawpack.org. www4: COMCOT software: ceeserver.cee.cornell.edu/pll-group/comcot.htm. www5: DART data: www.ndbc.noaa.gov/. www6: FLASH software: flash.uchicago.edu/website/home/. www7: GeoClaw software: www.clawpack.org/geoclaw. www8: Hilo, HI 1/3 arc-second MHW Tsunami Inundation DEM: www.ngdc.noaa.gov/mgg/inundation/. www9: National Geophysical Data Center (NGDC) GEODAS: www.ngdc.noaa.gov/mgg/gdas/gd designagrid.html. www10: NOAA Tsunami Inundation Digital Elevation Models (DEMs): www.ngdc.noaa.gov/mgg/inundation/tsunami/. www11: SAMRAI: computation.llnl.gov/casc/SAMRAI/. www12: USGS source for 27 February 2010 earthquake: earthquake.usgs.gov/earthquakes/eqinthenews/2010/us2010tfan/. www13: Webpage for this paper: www.clawpack.org/links/an11.
289
Acta Numerica (2011), pp. 291–467 doi:10.1017/S0962492911000055
c Cambridge University Press, 2011 Printed in the United Kingdom
Sparse tensor discretizations of high-dimensional parametric and stochastic PDEs∗ Christoph Schwab and Claude Jeffrey Gittelson Seminar for Applied Mathematics, ETH Z¨ urich, R¨ amistrasse 101, CH-8092 Z¨ urich, Switzerland E-mail:
[email protected],
[email protected]
Partial differential equations (PDEs) with random input data, such as random loadings and coefficients, are reformulated as parametric, deterministic PDEs on parameter spaces of high, possibly infinite dimension. Tensorized operator equations for spatial and temporal k-point correlation functions of their random solutions are derived. Parametric, deterministic PDEs for the laws of the random solutions are derived. Representations of the random solutions’ laws on infinite-dimensional parameter spaces in terms of ‘generalized polynomial chaos’ (GPC) series are established. Recent results on the regularity of solutions of these parametric PDEs are presented. Convergence rates of best N -term approximations, for adaptive stochastic Galerkin and collocation discretizations of the parametric, deterministic PDEs, are established. Sparse tensor products of hierarchical (multi-level) discretizations in physical space (and time), and GPC expansions in parameter space, are shown to converge at rates which are independent of the dimension of the parameter space. A convergence analysis of multi-level Monte Carlo (MLMC) discretizations of PDEs with random coefficients is presented. Sufficient conditions on the random inputs for superiority of sparse tensor discretizations over MLMC discretizations are established for linear elliptic, parabolic and hyperbolic PDEs with random coefficients.
∗
Work partially supported by the European Research Council under grant number ERC AdG 247277-STAHDPDE and by the Swiss National Science Foundation under grant number SNF 200021-120290/1.
292
C. Schwab and C. J. Gittelson
CONTENTS Introduction 1 Operator equations with stochastic data 2 Stochastic Galerkin discretization 3 Optimal convergence rates 4 Sparse tensor discretizations Appendix A Review of probability B Review of Hilbert spaces C Review of Gaussian measures on Hilbert spaces References
292 296 332 367 394 419 428 439 461
Introduction The numerical solution of partial differential equation models in science and engineering has today reached a certain maturity, after several decades of progress in numerical analysis, mathematical modelling and scientific computing. While there certainly remain numerous mathematical and algorithmic challenges, for many ‘routine’ problems of engineering interest, today numerical solution methods exist which are mathematically understood and ‘operational’ in the sense that a number of implementations exist, both academic and commercial, which realize, in the best case, algorithms of provably optimal complexity in a wide range of applications. As a rule, the numerical analysis and the numerical solution methods behind such algorithms suppose that a model of the system of interest is described by a well-posed (in the sense of Hadamard) partial differential equation (PDE), and that the PDE is to be solved numerically to prescribed accuracy for one given set of input data. With the availability of highly accurate numerical solution algorithms for a PDE of interest and one prescribed set of exact input data (such as source terms, constitutive laws and material parameters) there has been increasing awareness of the limited significance of such single, highly accurate ‘forward’ solves. Assuming, as we will throughout this article, that the PDE model of the physical system of interest is correct, this trend is due to two reasons: randomness and uncertainty of input data and the need for efficient prediction of system responses on high-dimensional parameter spaces. First, the assumption of availability of exact input data is not realistic: often, the simulation’s input parameters are obtained from measurements or from sampling a large, but finite number of specimens or system snapshots which are incomplete or stochastic. This is of increasing importance in classical engineering disciplines, but even more so in emerging models in
Sparse tensor discretizations for sPDEs
293
the life sciences and social sciences. Rather than producing efficiently accurate answers for single instances of exact input data, increasingly the goal of computation in numerical simulations is to efficiently process statistical information on uncertain input data for the PDE of interest. While mathematical formulations of PDEs with random inputs have been developed with an eye towards uncorrelated, or white noise inputs (see, e.g., Holden, Oksendal, Uboe and Zhang (1996), Da Prato and Zabczyk (1992), Da Prato (2006), Lototsky and Rozovskii (2006), Pr´evˆ ot and R¨ ockner (2007), Dalang, Khoshnevisan, Mueller, Nualart and Xiao (2009) and the references therein), PDEs with random inputs in numerical simulation in science and engineering are of interest in particular in the case of so-called correlated inputs (or ‘coloured noise’). Second, in the context of optimization, or of risk and sensitivity analysis for complex systems with random inputs, the interest is in computing the systems’ responses efficiently given dependence on several, possibly countably many parameters, thereby leading to the challenge of numerical simulation of deterministic PDEs on high-dimensional parameter spaces. Often, the only feasible approach in numerical simulation towards these two problems is to solve the forward problem for many instances, or samples, of the PDE’s input parameters; for random inputs, this amounts to Monte Carlo-type sampling of the noisy inputs, and for parametric PDEs, responses of the system are interpolated from forward solves at judiciously chosen combinations of input parameters. With the cost of one ‘sample’ being the numerical solution of a PDE, it is immediate that, in particular for transient problems in three spatial dimensions with solutions that exhibit multiple spatial and temporal length scales, the computational cost of uniformly sampling the PDE solution on the parameter space (resp. the probability space) is prohibitive. Responding to this by massive parallelism may alleviate this problem, but ultimately, the low convergence rate 1/2 of Monte Carlo (MC) sampling, respectively the so-called ‘curse of dimensionality’ of standard interpolation schemes in high-dimensional parameter spaces, requires advances at the mathematical core of the numerical PDE solution methods: the development of novel mathematical formulations of PDEs with random inputs, the study of the regularity of their solutions is of interest, both with respect to the physical variables and with respect to parameters, and the development of novel discretizations and solution methods of these formulations. Importantly, the parameters may take values in possibly infinite-dimensional parameter spaces: for example, in connection with Karhunen–Lo`eve expansions of spatially inhomogeneous and correlated inputs. The present article surveys recent contributions to the above questions. Our focus is on linear PDEs with random inputs; we present various formulations, new results on the regularity of their solutions and, based on these
294
C. Schwab and C. J. Gittelson
regularity results, we design, formulate and analyse discretization schemes which allow one to ‘sweep’ the entire, possibly infinite-dimensional input parameter space approximately in a single computation. We also establish, for the algorithms proposed here, bounds on their efficiency (understood as accuracy versus the number of degrees of freedom) that do not deteriorate with respect to increasing dimension of the computational parameter domain, i.e., that are free from the curse of dimensionality. The algorithms proposed here are variants and refinements of the recently proposed stochastic Galerkin and stochastic collocation discretizations (see, e.g., Xiu (2009) and Matthies and Keese (2005) and the references therein for an account of these developments). We exhibit assumptions on the inputs’ correlations which ensure an efficiency of these algorithms which is superior to that of MC sampling. One insight that emerges from the numerical analysis of recently proposed methods is that the numerical resolution in physical space need not be high uniformly on the entire parameter space. The use of ‘polynomial chaos’ type spectral representations (and their generalizations) of the laws of input and output random fields allows a theory of regularity of the random solutions and, based on this, the optimization of numerical methods for their resolution. Here, we have in mind discretizations in physical space and time as well as in stochastic or parameter space, aiming at achieving a prespecified accuracy with minimal computational work. From this broad view, the recently proposed multi-level Monte Carlo methods can also be interpreted as sparse tensor discretizations. Accordingly, we present in this article an error analysis of single- and multi-level MC methods for elliptic problems with random inputs. As this article’s title suggests, the notion of sparse tensor products of operators and hierarchical sequences of finite-dimensional subspaces pervades our view of numerical analysis of high-dimensional problems. Sparsity in connection with tensorization has become significant in several areas of scientific computing in recent years: in approximation theory as hyperbolic cross approximations (see, e.g., Temlyakov (1993)) and, in finite element and finite difference discretizations, the so-called sparse grids (see Bungartz and Griebel (2004) and the references therein) are particular instances of this concept. We note in passing that the range of applicability of sparse tensor discretizations extends well beyond stochastic and parametric problems (see, e.g., Schwab (2002), Hoang and Schwab (2004/05) and Schwab and Stevenson (2008) for applications to multiscale problems). On the level of numerical linear algebra, the currently emerging hierarchical low-rank matrix formats, which were inspired by developments in computational chemistry, are closely related to some of the techniques developed here. The present article extends these concepts in several directions. First, on the level of mathematical formulation of PDEs with random inputs: we present deterministic tensorized operator equations for two- and k-point
Sparse tensor discretizations for sPDEs
295
correlation functions of the the random system responses. Such equations also arise in the context of moment closures of kinetic models in atomisticto-continuum transitions. Discretizations for their efficient, deterministic numerical solution may therefore be of interest in their own right. For the spectral discretizations, we review the polynomial chaos representation of random fields and the Wiener–Itˆo chaos decomposition of probability spaces and of random fields into tensorized Hermite polynomials of a countable number of Gaussians. The spectral representation of random outputs of PDEs allows for a regularity theory of the laws of random fields which goes substantially beyond the mere existence of moments. According to the particular application, in this article sparsity in tensor discretizations appears in roughly three forms. First, we use sparse tensor products of multi-level finite element spaces in the physical domain D ⊂ Rd to build efficient schemes for the Galerkin approximation of tensorized equations for k-point correlation functions. Second, we consider heterogeneous sparse tensor product discretizations of multi-level finite element, finite volume and finite difference discretizations in the physical domain with hierarchical polynomial chaos bases in the probability space. As we will show, the use of multi-level discretizations in physical space actually leads to substantial efficiency gains in MC methods; nevertheless, the resulting multi-level MC methods are of comparable efficiency as sparse tensor discretizations for random outputs with finite second moments. However, as soon as the outputs have additional summability properties (and the examples presented here suggest that this is so in many cases), adaptive sparse tensor discretizations outperform MLMC methods. The outline of the article is as follows. We first derive tensorized operator equations for deterministic, linear equations with random data. We establish the well-posedness of these tensorized operator equations, and introduce sparse tensor Galerkin discretizations based on multi-level, wavelettype finite element spaces in the physical domain. We prove, in particular, stability of sparse tensor discretizations in the case of indefinite operators such as those arising in acoustic or electromagnetic scattering. We also give an error analysis of MC discretizations which indicates the dependence of its convergence rate on the degree of summability of the random solution. Section 2 is devoted to stochastic Galerkin formulations of PDEs with random coefficients. Using polynomial chaos representations of the random inputs, for example in a Karhunen–Lo`eve expansion, we give a reformulation of the random PDEs of interest as deterministic PDEs which are posed on infinite-dimensional parameter spaces. While the numerical solution of these PDEs with standard tools from numerical analysis is foiled by the curse of dimensionality (the raison d’ˆetre for the use of sampling methods on the stochastic formulation), we review recent regularity results for these problems which indicate that sparse, adaptive tensorization of discretizations
296
C. Schwab and C. J. Gittelson
in probability and physical space can indeed produce solutions whose accuracy, as a function of work, is independent of the dimension of the parameter space. We cover both affine dependence, as is typical in Karhunen–Lo`eve representations of the random inputs, as well as log-normal dependence in inputs. We focus on Gaussian and on uniform measures, where ‘polynomial chaos’ representations use Hermite and Legendre polynomials, respectively (other probability measures give rise to other polynomial systems: see, e.g., Schoutens (2000) and Xiu and Karniadakis (2002b)). Section 3 addresses the regularity of the random solutions in these polynomial chaos representations by an analysis of the associated parametric, deterministic PDE for their laws. The analysis allows us to deduce best N -term convergence rates of polynomial chaos semidiscretizations of the random solutions’ laws. Section 4 combines the results from the preceding sections with space and time discretizations in the physical domain. The error analysis of fully discrete algorithms reveals that it is crucial for efficiency that the level of spatial and temporal resolution be allowed to depend on the stochastic mode being discretized. Our analysis shows that, in fact, a highly non-uniform level of resolution in physical space should be adopted in order to achieve algorithms that scale favourably with respect to the dimension of the space of stochastic parameters. As this article and the subject matter draw on tools from numerical analysis, from functional analysis and from probability theory, we provide some background reference material on the latter two items in the Appendix. This is done in order to fix the notation used in the main body of the text, and to serve as a reference for readers with a numerical analysis background. Naturally, the selection of the background material is biased towards the subject matter of the main text. It does not claim to be a reference on these subjects. For a more thorough introduction to tools from probability and stochastic analysis we refer the reader to Bauer (1996), Da Prato (2006), Da Prato and Zabczyk (1992), Pr´evˆ ot and R¨ ockner (2007) and the references therein.
1. Sparse tensor FEM for operator equations with stochastic data For the variational setting of linear operator equations with deterministic, boundedly invertible operators, we assume that X, Y are separable Hilbert spaces over R with duals X and Y , respectively, and A ∈ L(X, Y ) a linear, boundedly invertible deterministic operator. We denote its associated bilinear form by a(u, v) := Y Au, vX : X × Y → R.
(1.1)
Sparse tensor discretizations for sPDEs
297
Here, and throughout, for w ∈ Y and v ∈ X the bilinear form Y w, vX denotes the Y ×X duality pairing. As is well known (see, e.g., Theorem C.20) the operator A from X onto Y is boundedly invertible if and only if a(·, ·) satisfies the following conditions. (i) a(·, ·) is continuous: there exists C1 < ∞ such that |a(w, v)| ≤ C1 w X v Y .
∀w ∈ X, v ∈ Y :
(1.2)
(ii) a(·, ·) is coercive: there exists C2 > 0 such that inf
sup
0=w∈X 0=v∈Y
a(w, v) ≥ C2 > 0.
w X v Y
(1.3)
sup a(w, v) > 0.
(1.4)
(iii) a(·, ·) is injective: ∀0 = v ∈ Y :
0=w∈X
If (1.2)–(1.4) hold, then for every f ∈ Y the linear operator equation u∈X:
a(u, v) = Y f, vX
∀v ∈ Y
(1.5)
admits a unique solution u ∈ X such that
u X ≤ C2−1 f Y .
(1.6)
We consider equation (1.5) with stochastic data: to this end, let (Ω, F, P) be a probability space and let f : Ω → Y be a random field, i.e., a measurable map from (Ω, F, P) into Y which is Gaussian (see Appendix C for the definition of Gaussian random fields). Analogous to the characterization of Gaussian random variables by their mean and their (co)variance, a Gaussian random field f ∈ L2 (Ω, F, P; Y ) is characterized by its mean af ∈ Y and its covariance operator Qf ∈ L+ 1 (Y ). We use the following linear operator equation with Gaussian data: given f ∈ L2 (Ω, F, P; Y ), find u ∈ L2 (Ω, F, P; X) such that Au = f
in L2 (Ω, F, P; Y )
(1.7)
admits a unique solution u ∈ L2 (Ω, F, P; X) if and only if A satisfies (1.2)– (1.4). By Theorem C.31, the unique random solution u ∈ L2 (Ω, F, P; X) of (1.7) is Gaussian with associated Gaussian measure Nau ,Qu on X which, in turn, is characterized by the solution’s mean, au = mean(u) = A−1 af ,
(1.8)
and the solution’s covariance operator Qu ∈ L+ 1 (X), which satisfies the (deterministic) equation AQu A∗ = Qf
in L(Y , Y ).
(1.9)
298
C. Schwab and C. J. Gittelson
In the Gaussian case, therefore, solving the stochastic problem (1.7) can be reduced to solving the two deterministic problems (1.8) and (1.9). Whereas the mean-field problem (1.8) is one instance of the operator equation (1.7), the covariance equation (1.8) is an equation for the operator Qu ∈ L+ 1 (X). As we show in Theorem C.31, this operator is characterized by the socalled covariance kernel Cu , which satisfies, in terms of the corresponding covariance kernel Cf of the data, the covariance equation (see (C.50)) (A ⊗ A)Cu = Cf ,
(1.10)
which is understood to hold in the sense of (Y ⊗ Y ) Y ⊗ Y . One approach to the numerical treatment of operator equations Au = f , where the data f are random fields, i.e., measurable maps from a probability space (Ω, F, P) into the set Y of admissible data for the operator A, is via tensorized equations such as (1.10) for their statistical moments. The simplest approach to the numerical solution of the linear operator equation Au = f with random input f is Monte Carlo (MC) simulation, i.e., generating a large number M of i.i.d. data samples fj and solving, possibly in parallel, for the corresponding solution ensemble {uj = A−1 fj ; j = 1, . . . , M }. Statistical moments and probabilities of the random solution u are then estimated from {uj }. As we will prove, convergence of the MC method as the number M of samples increases is ensured (for suitable sampling) by the central limit theorem. We shall see that the MC method allows in general only the convergence rate O(M −1/2 ). If statistical moments, i.e., mean-field and higher-order moments of the random solution u, are of interest, one can exploit the linearity of the equation Au = f to derive a deterministic equation for the kth moment of the random solution, similar to the second-moment equation (1.10); this derivation is done in Section 1.1. For the Laplace equation with stochastic data, this approach is due to I. Babuˇska (1961). We then address the numerical computation of the moments of the solution by either Monte Carlo or by direct, deterministic finite element computation. If the physical problem is posed in a domain D ⊂ Rd , the kth moment of the random solution is defined in the domain Dk ⊂ Rkd ; standard finite element (FE) approximations will therefore be inadequate for the efficient numerical approximation of the kth moments of the random solution. The efficient deterministic equation and its FE approximation were investigated in Schwab and Todor (2003a, 2003b) in the case where A is an elliptic partial differential operator. It was shown that the kth moment of the solution could be computed in a complexity comparable to that of an FE solution for the mean-field problem by the use of sparse tensor products of standard FE spaces for which a hierarchical basis is available. The use of sparse tensor product approximations is a well-known device in high-dimensional numerical integration going back to Smolyak (1963), in
Sparse tensor discretizations for sPDEs
299
multivariate approximation (Temlyakov 1993), and in complexity theory; see Wasilkowski and Wo´zniakowski (1995) and the references therein. In the present section, we address the case when A is a non-local operator, such as a strongly elliptic pseudodifferential operator, as arises in the boundary reduction of boundary value problems for strongly elliptic partial differential equations. In this case, efficient numerical solution methods require, in addition to Galerkin discretizations of the operator equation, some form of matrix compression (such as the fast multipole method or wavelet-based matrix compression) which introduces additional errors into the Galerkin solution that will also affect the accuracy of second and higher moments. We briefly present the numerical analysis of the impact of matrix compressions on the efficient computation of second and higher moments of the random solution. Therefore, the present section will also apply to strongly elliptic boundary integral equations obtained by reduction to the boundary manifold D = ∂D of elliptic boundary value problems in a bounded domain D ⊂ Rd+1 , as is frequently done in acoustic and electromagnetic scattering. For such problems with stochastic data, the boundary integral formulation leads to an operator equation Au = f , where A is an integral operator or, more generally, a pseudodifferential operator acting on function spaces on ∂D. The linearity of the operator equation allows, without any closure hypothesis, formulation of a deterministic tensor equation for the k-point correlation function of the random solution u = A−1 f . We show that, as in the case of differential operators, sparse tensor products of standard FE spaces allow deterministic approximation of the kth moment of the random solution u with relatively few degrees of freedom. To achieve computational complexity which scales log-linearly in the number of degrees of freedom in a Galerkin discretization of the mean-field problem, however, the Galerkin matrix for the operator A must be compressed. Accordingly, one purpose of this section is the design and numerical analysis of deterministic and stochastic solution algorithms to obtain the kth moment of the random solution of possibly non-local operator equations with random data in log-linear complexity in the number N of degrees of freedom for the mean-field problem. We illustrate the sparse tensor product Galerkin methods for the numerical solution of Dirichlet and Neumann problems for the Laplace or Helmholtz equation with stochastic data. Using a wavelet Galerkin finite element discretization allows straightforward construction of sparse tensor products of the trial spaces, and yields well-conditioned, sparse representations of stiffness matrices for the operator A as well as for its k-fold tensor product, which is the operator arising in the kth-moment problem. We analyse the impact of the operator compression on the accuracy of functionals of the Galerkin solution, such as far-field evaluations of the random potential in a point. For example, means and variances of the potential
300
C. Schwab and C. J. Gittelson
in a point can be computed with accuracy O(N −p ) for any fixed order p, for random boundary data with known second moments in O(N ) complexity, where N denotes the number of degrees of freedom on the boundary. The outline of this section is as follows. In Section 1.1, we describe the operator equations considered here and derive the deterministic problems for the higher moments, generalizing Schwab and Todor (2003b). We establish the Fredholm property for the tensor product operator and regularity estimates for the statistical moments in anisotropic Sobolev spaces with mixed highest derivative. Section 1.2 addresses the numerical solution of the moment equations, in particular the impact of various matrix compressions on the accuracy of the approximated moments, the preconditioning of the product operator and the solution algorithm. In Section 1.4, we discuss the implementation of the sparse Galerkin and sparse MC methods and estimate their asymptotic complexity. Section 1.5 contains some examples from finite and boundary element methods.
1.1. Operator equations with stochastic data Linear operator equations We specialize the general setting (1.1) to the case X = Y = V , and consider the operator equation Au = f,
(1.11)
where A is a bounded linear operator from the separable Hilbert space V into its dual V . The operator A is a differential or pseudodifferential operator of order on a bounded d-dimensional manifold D, which may be closed or have ˜ s (D) := H s (D) a boundary. Here, for a closed manifold and for s ≥ 0, H denotes the usual Sobolev space. For s < 0, we define the spaces H s (D) ˜ s (D) by duality. For a manifold D with boundary we assume that and H ˜ and define this manifold can be extended to a closed manifold D, ˜ u| ˜ = 0} ˜ s (D) := { u| ; u ∈ H s (D), H D D\D ˜ := Rd . with the induced norm. If D is a bounded domain in Rd we use D /2 (D). In the case when A is a second-order We now assume that V = H differential operator, this means that we have Dirichlet boundary conditions (other boundary conditions can be treated in an analogous way). The manifold D may be smooth, but we also consider the case when D is a polyhedron in Rd , or the boundary of a polyhedron in Rd+1 , or part of the boundary of a polyhedron. For the deterministic operator A in (1.11), we assume strong ellipticity in the sense that there exists α > 0 and a compact operator T : V → V such
Sparse tensor discretizations for sPDEs
that the G˚ arding inequality ∀v ∈ V :
(A + T ) v, v ≥ α v 2V
301
(1.12)
holds. For the deterministic algorithm in Section 1.4 we need the slightly stronger assumption that T is smoothing with respect to a scale of smoothness spaces (see (1.63) below). Here and in what follows, ·, · denotes the V × V duality pairing. We assume also that A is injective, i.e., that ker A = {0},
(1.13)
,
which implies that for every f ∈ V (1.11) admits a unique solution u ∈ V and, moreover, that A−1 : V → V is continuous, i.e., there exists CA > 0 such that, for all f ∈ V ,
u V = A−1 f V ≤ CA f V .
(1.14)
Here CA = C2−1 with the constant C2 as in (1.3). We shall consider (1.11) in particular for data f , which are Gaussian random fields on the data space V . By the linearity of the operator equation (1.11), then the solution v ∈ V is a Gaussian random field as well. Throughout, we assume that V and V are separable Hilbert spaces. Random data A Gaussian random field f with values in a separable Hilbert space X is a mapping f : Ω → X which maps events E ∈ Σ to Borel sets in X, and such that the image measure f# P on X is Gaussian. In the following, we allow more general random fields. Of particular interest will be their summability properties. We say that a random field u : Ω → X is in the Bochner space 1 L (Ω; X) if ω → u(ω) X is measurable and integrable so that u L1 (Ω;X) := Ω u(ω) X P(dω) is finite. In particular, then the ‘ensemble average’ u(ω)P(dω) ∈ X Eu := Ω
exists as a Bochner integral of X-valued functions, and it satisfies
Eu X ≤ u L1 (Ω;X) .
(1.15)
Let k ≥ 1. We say that a random field u : Ω → X is in the Bochner space Lk (Ω; X) if u kLk (Ω;X) = Ω u(ω) kX P(dω) is finite. Note that ω →
u(ω) kX is measurable due to the measurability of u and the continuity of the norm · X on X. Also, Lk (Ω; X) ⊃ Ll (Ω; X) for k < l. Let B ∈ L(X, Y ) denote a continuous linear mapping from X to another separable Hilbert space Y . For a random field u ∈ Lk (Ω; X), this mapping defines a random variable v(ω) = Bu(ω) taking values in Y . Moreover, v ∈ Lk (Ω; Y ) and we have
Bu Lk (Ω;Y ) ≤ C u Lk (Ω;X) ,
(1.16)
302
C. Schwab and C. J. Gittelson
where the constant C is given by C = B L(X,Y ) . In addition, we have u P(dω) = Bu P(dω). (1.17) B Ω
Ω
MC estimation of statistical moments We are interested in statistics of the random solution u of (1.11) and, in particular, in statistical moments. To define them, for a separable Hilbert space X and for any k ∈ N we define the k-fold tensor product space · · ⊗ X , X (k) = X ⊗ · k times
and equip it with the natural cross-norm · X (k) . The significance of a cross-norm was emphasized by Schatten. The cross-norm has the property that, for every u1 , . . . , uk ∈ X,
u1 ⊗ · · · ⊗ uk X (k) = u1 X · · · uk X
(1.18)
(see Light and Cheney (1985) and the references therein for more on crossnorms on tensor product spaces). The k-fold tensor products of, for example, X are denoted analogously by (X )(k) . For u ∈ Lk (Ω; X) we now consider the random field u(k) defined by u(ω) ⊗ · · · ⊗ u(ω). By Lemma C.9, u(k) = u ⊗ · · · ⊗ u ∈ L1 (Ω; X (k) ), and we have the isometry (k) (1.19)
u L1 (Ω;X (k) ) = u(ω) ⊗ · · · ⊗ u(ω) X (k) P(dω) Ω = u(ω) X · · · u(ω) X P(dω) = u kLk (Ω;X) . Ω
We define the moment Mk u as the expectation of u ⊗ · · · ⊗ u. Definition 1.1. For u ∈ Lk (Ω; X), for some integer k ≥ 1, the kth moment of u(ω) is defined by
k · · ⊗ u = u(ω) ⊗ · · · ⊗ u(ω) P(dω) ∈ X (k) . (1.20) M u=E u ⊗ · ω∈Ω k times
k times
Note that (1.15) and (1.18) give, with Jensen’s inequality and the convexity of the norm · V → R, the bound
Mk u X (k) = Eu(k) X (k) ≤ E u(k) X (k) = E u kX = u kLk (Ω;X) .
(1.21)
Deterministic equation for statistical moments We now consider the operator equation Au = f , where f ∈ Lk (Ω; V ) is given with k ≥ 1. Since A−1 : V → V is continuous, we obtain, using
Sparse tensor discretizations for sPDEs
303
(1.16), (1.14) and (1.21), that u ∈ Lk (Ω; V ), and that we have the a priori estimate k
f kLk (Ω;V ) .
Mk u V (k) ≤ u kLk (Ω;V ) ≤ CA
(1.22)
Remark 1.2. One example of a probability measure P on X is a Gaussian measure; we refer to, e.g., Vakhania, Tarieladze and Chobanyan (1987) and Ledoux and Talagrand (1991) for general probability measures over Banach spaces X and, in particular, to Bogachev (1998) and Janson (1997) for a general exposition of Gaussian measures on function spaces. Since A−1 : V → V in (1.11) is bijective, by (1.12) and (1.13), it induces := A−1 P on the space V of solutions to (1.11). If P is Gaussian a measure P # is Gaussian over V by Theorem C.18. over V and A in (1.11) is linear, then P We recall that a Gaussian measure is completely determined by its mean and covariance, and hence only Mk u for k = 1, 2 are of interest in this case. We now consider the tensor product operator A(k) = A⊗· · ·⊗A (k times). This operator maps V (k) to (V )(k) . For v ∈ V and g := Av, we obtain that A(k) v ⊗ · · · ⊗ v = g ⊗ · · · ⊗ g. Consider a random field u ∈ Lk (Ω; V ) and let f := Au ∈ Lk (Ω; V ). Then the tensor product u(k) = u ⊗ · · · ⊗ u (k times) belongs to the space L1 (Ω; V (k) ), and we obtain from (1.17) with B = A(k) that the k-point correlations u(k) satisfy P-a.s. the tensor equation A(k) u(k) = f (k) , where f (k) ∈ L1 (Ω; (V )(k) ). Now (1.17) implies for linear and deterministic operators A that the k-point correlation functions of the random solutions, i.e., the expectations Mk u = E[u(k) ], are solutions of the tensorized equations A(k) Mk u = Mk f.
(1.23)
In the case k = 1 this is just the equation AEu = Ef for the mean field. Note that this equation provides a way to compute the moments Mk u of the random solution in a deterministic fashion, for example by Galerkin discretization. As mentioned before, with the operator A acting on function spaces X, Y in the domain D ⊂ Rd , the tensor equation (1.23) will require discretization in Dk , the k-fold Cartesian product of D with itself. Using tensor products of, for instance, finite element spaces in D, we find for k > 1 a reduction of efficiency in terms of accuracy versus number of degrees of freedom due to the ‘curse of dimensionality’. This mandates sparse tensor product constructions. We will investigate the numerical approximation of the tensor equation (1.23) in Section 1.4. The direct approximation of (1.23) by, for example, Galerkin discretization is an alternative to the Monte Carlo approximation of the moments which will be considered in Section 1.3.
304
C. Schwab and C. J. Gittelson
In the deterministic approach, explicit knowledge of all joint probability densities of f (i.e., the law of f ) with respect to the probability measure P is not required to determine the order-k statistics of the random solution u from order-k statistics of f . Remark 1.3. For nonlinear operator equations, associated systems of moment equations require a closure hypothesis, which must be additionally imposed and verified. For the linear operator equation (1.11), however, a closure hypothesis is not necessary, as (1.23) holds. For solvability of (1.23), we consider the tensor product operator A1 ⊗ A2 ⊗ · · · ⊗ Ak for operators Ai ∈ L(Vi , Vi ), i = 1, . . . , k. Proposition 1.4. For integer k > 1, let Vi , i = 1, . . . , k be Hilbert spaces arding with duals Vi , and let Ai ∈ L(Vi , Vi ) be injective and satisfy a G˚ inequality, i.e., there are compact Ti ∈ L(Vi , Vi ) and αi > 0 such that (Ai + Ti ) v, v ≥ αi v 2Vi , (1.24) ∀v ∈ Vi : where ·, · denotes the Vi × Vi duality pairing. Then the product operator A = A1 ⊗ A2 ⊗ · · · ⊗ Ak ∈ L(V, V ), where V = V1 ⊗ V2 ⊗ · · · ⊗ Vk and V = (V1 ⊗ V2 ⊗ · · · ⊗ Vk ) ∼ = V1 ⊗ V2 ⊗ · · · ⊗ Vk , is injective, and for every f ∈ V , the problem Au = f admits a unique solution u with
u V ≤ C f V . Proof. The injectivity and the G˚ arding inequality (1.24) imply the bounded invertibility of Ai for each i. This implies the bounded invertibility of A on V → V since we can write A = (A1 ⊗ I k−1 ) ◦ (I ⊗ A2 ⊗ I (k−2) ) ◦ · · · ◦ (I (k−1) ⊗ Ak ), where I (j) denotes the j-fold tensor product of the identity operator on the appropriate Vi . Note that each factor in the composition is invertible. To apply this result to (1.23), we require the special case (k) (k) (k) (k) A(k) := A · · · ⊗ A ∈ L(V , (V ) ) = L(V , (V ) ). ⊗A⊗
(1.25)
k times
Theorem 1.5. If A in (1.11) satisfies (1.12) and (1.13), then for every k > 1 the operator A(k) ∈ L(V (k) , (V )(k) ) is injective on V (k) , and for every f ∈ Lk (Ω; V ), the equation A(k) Z = Mk f has a unique solution Z ∈ V (k) .
(1.26)
Sparse tensor discretizations for sPDEs
305
This solution coincides with the kth moment Mk u of the random field in (1.20): Z = Mk u. Proof. By (1.21), the assumption f ∈ Lk (Ω; V ) ensures that Mk f ∈ (V )(k) . The unique solvability of (1.26) follows immediately from Proposition 1.4 and the assumptions (1.12) and (1.13). The identity Z = Mk u follows from (1.23) and the uniqueness of the solution of (1.26). Regularity The numerical analysis of approximation schemes for (1.26) will require a regularity theory for (1.26). To this end we introduce a smoothness scale (Ys )s≥0 for the data f with Y0 = V and Ys ⊂ Yt for s > t. We assume that we have a corresponding scale (Xs )s≥0 of ‘smoothness spaces’ for the solutions with X0 = V and Xs ⊂ Xt for s > t, so that A−1 : Ys → Xs is continuous. When D is a smooth closed manifold of dimension d embedded into Euclidean space Rd+1 , we choose Ys = H −/2+s (D) and Xs = H /2+s (D). The case of differential operators with smooth coefficients in a manifold D with smooth boundary is also covered within this framework by the choices /2 ∩ H /2+s (D). Note that in other cases (a Ys = H −/2+s (D) and Xs = H pseudodifferential operator on a manifold with boundary, or a differential operator on a domain with non-smooth boundary), the spaces Xs can be chosen as weighted Sobolev spaces which contain functions that are singular at the boundary. Theorem 1.6. Assume (1.12) and (1.13), and that there is an s∗ > 0 such that A−1 : Ys → Xs is continuous for 0 ≤ s ≤ s∗ . Then we have for all k ≥ 1 and for 0 ≤ s ≤ s∗ some constant C(k, s) such that
Mk u X (k) ≤ C Mk f Y (k) = C f kLk (Ω;Ys ) . s
Proof.
s
(1.27)
If (1.12) and (1.13) hold, then the operator A(k) is invertible, and Mk u = (A(k) )−1 Mk f = (A−1 )(k) Mk f.
Since
A−1 f Xs ≤ Cs f Ys ,
0 ≤ s ≤ s∗ ,
it follows that
Mk u X (k) = (A−1 )(k) Mk f X (k) ≤ Csk Mk f Y (k) , s
s
s
0 ≤ s ≤ s∗ .
1.2. Finite element discretization In order to obtain a finite-dimensional problem, we need to discretize in both Ω and D. For D we will use a nested family of finite element spaces V ⊂ V , = 0, 1, . . . .
306
C. Schwab and C. J. Gittelson
Nested finite element spaces The Galerkin approximation of (1.11) is based on a sequence {V }∞ =0 of subspaces of V of dimension N = dim V < ∞ which are dense in V , i.e., V = ≥0 V , and nested, i.e., V0 ⊂ V1 ⊂ V2 ⊂ · · · ⊂ V ⊂ V+1 ⊂ · · · ⊂ V.
(1.28)
We assume that for functions u in the smoothness spaces Xs with s ≥ 0 we have the asymptotic approximation rate −s/d
inf u − v V ≤ CN
v∈V
u Xs .
(1.29)
Finite elements with uniform mesh refinement We will now describe examples for the subspaces V which satisfy the assumptions of Section 1.2. We briefly sketch the construction of finite element spaces which are only continuous across element boundaries; see Braess (2007), Brenner and Scott (2002) and Ciarlet (1978) for presentations of the mathematical foundations of finite element methods. These elements are suitable for operators of order < 3. Throughout, we denote by Pp (K) the linear space of polynomials of total degree ≤ p on a set K. Let us first consider the case of a bounded polyhedron D ⊂ Rd . Let T0 be a regular partition of D into simplices K. Let {T }∞ =0 be the sequence of regular partitions of D obtained from T0 by uniform subdivision: for example, if d = 2, we bisect all edges of the triangulation T and obtain a new, regular partition of the domain D into possibly curved triangles which belong to finitely many congruency classes. We set V = S p (D, T ) = {u ∈ C 0 (D) ; u|K ∈ Pp (K) ∀K ∈ T } and let h = max {diam(K) ; K ∈ T }. Then N = dim V = O(h−d ) as /2 /2+s ˜ → ∞. With V = H (D) and Xs = H (D), standard finite element approximation results imply that (1.29) holds for s ∈ [0, p + 1 − /2], i.e., −s/d
inf u − v V ≤ CN
v∈V
u Xs .
For the case when D is the boundary D = ∂D of a polyhedron D ⊂ Rd+1 we define finite element spaces on D in the same way as above, but now in local coordinates on D, and obtain the same convergence rates (see, e.g., Sauter and Schwab (2010)): for a d-dimensional domain D ⊂ Rd with a smooth boundary we can first divide D into pieces DJ , which can be mapped to a simplex S by smooth mappings ΦJ : DJ → S (which must be C 0 -compatible where two pieces DJ , DJ touch). Then we can define on D finite element functions which on DJ are of the form g ◦ ΦJ , where g is a polynomial.
Sparse tensor discretizations for sPDEs
307
For a d-dimensional smooth surface D ⊂ Rd+1 we can similarly divide D into pieces which can be mapped to simplices in Rd , and again define finite elements using these mappings. Finite element wavelet basis for V To facilitate the accurate numerical approximation of moments of order k ≥ 2 of the random solution and for the efficient numerical solution of the partial differential equations, we use a hierarchical basis for the nested finite element (FE) spaces V0 ⊂ · · · ⊂ VL . To this end, we start with a basis {ψj0 }j=1,...,N0 for the finite element space V0 on the coarsest triangulation. We represent on the finer meshes T the corresponding FE spaces V , with > 0 as a direct sum V = V−1 ⊕W . Since the subspaces are nested and finite-dimensional, this is possible with a suitable space W for any hierarchy of FE spaces. We assume, in addition, that we are explicitly given basis functions {ψj }j=1,...,M of W . Iterating with respect to , we have that VL = V0 ⊕ W1 ⊕ · · · ⊕ WL , and {ψj ; = 0, . . . , L, j = 1, . . . , M } is a hierarchical basis for VL , where M0 := N0 . (W1) Hierarchical basis. VL = span{ψj ; 1 ≤ j ≤ ML , 0 ≤ ≤ L}. Let us define N := dim V and N−1 := 0; then we have M := N − N−1 for = 0, 1, 2, . . . , L. The hierarchical basis property (W1) is in principle sufficient for the formulation and implementation of the sparse MC–Galerkin method and the deterministic sparse Galerkin method. In order to obtain algorithms of log-linear complexity for integrodifferential equations, impose on the hierarchical basis the additional properties (W2)–(W5) of a wavelet basis. This will allow us to perform matrix compression for non-local operators, and to obtain optimal preconditioning for the iterative linear system solver. (W2) Small support. diam supp(ψj ) = O(2− ). (W3) Energy norm stability. There is a constant CB > 0 independent of L ∈ N ∪ {∞}, such that, for all L ∈ N ∪ {∞} and all L
v =
M L
vj ψj (x) ∈ VL ,
=0 j=1
we have −1 CB
M L
=0 j=1
|vj |2 ≤ v L 2V ≤ CB
M L
|vj |2 .
=0 j=1
Here, in the case L = ∞ it is understood that VL = V .
(1.30)
308
C. Schwab and C. J. Gittelson
(W4) Wavelets ψj with ≥ 0 have vanishing moments up to order p0 ≥ p− (1.31) ψj (x) xα dx = 0, 0 ≤ |α| ≤ p0 , except possibly for wavelets where the closure of the support intersects the boundary ∂D or the boundaries of the coarsest mesh. In the case of mapped finite elements we require the vanishing moments for the polynomial function ψj ◦ Φ−1 J . (W4) Decay of coefficients for ‘smooth’ functions in Xs . There exists C > 0 independent of L such that, for every u ∈ Xs and every L, M L
0 for 0 ≤ s < p + 1 − /2, 2 2s ν 2 |uj | 2 ≤ CL u Xs , ν = 1 for s = p + 1 − /2. =0 j=1 (1.32) By property (W3), wavelets constitute Riesz bases: every function u ∈ V M has a unique wavelet expansion u = ∞ =0 j=1 uj ψj . We define the projection PL : V → VL by truncating this wavelet expansion of u at level L, i.e., PL u :=
M L
uj ψj .
(1.33)
=0 j=1
Because of the stability (W3) and the approximation property (1.29), we obtain immediately that the wavelet projection PL is quasi-optimal: with (1.29), for 0 ≤ s ≤ s∗ and u ∈ Xs , −s/d
u − PL u V NL
u Xs .
(1.34)
We remark in passing that the appearance of the factor 1/d in the convergence rate s/d in (1.34), when expressed in terms of NL , the total number of degrees of freedom, indicates a reduction of the convergence rate as the dimension d of the computational domain increases. This reduction of the convergence rate with increasing dimension is commonly referred to as the ‘curse of dimensionality’; as long as d = 1, 2, 3, this is not severe and, in fact, shared by almost all discretizations. If the dimension of the computational domain increases, however, this reduction becomes a severe obstacle to the construction of efficient discretizations. In the context of stochastic and parametric PDEs, the dimension of the computational domain can, in principle, become arbitrarily large, as we shall next explain.
Sparse tensor discretizations for sPDEs
309
Full and sparse tensor product spaces To compute an approximation for Mk u ∈ V (k) := V · · ⊗ V ⊗ · k times
we need a suitable finite-dimensional subspace of V (k) . The simplest choice (k) is the tensor product space VL ⊗ · · · ⊗ VL = VL . However, this full tensor product space has dimension (k)
dim(VL ) = NLk = (dim(VL ))k ,
(1.35)
which is not practical for k > 1. A reduction in cost is possible by sparse (k) tensor products of VL . The k-fold sparse tensor product space VL is defined by
(k) V ⊗ · · · ⊗ V , (1.36) V = 1
L
k
∈Nk0 ||≤L
where we denote by the vector (1 , . . . , k ) ∈ Nk0 and its length by || = 1 + · · · + k . The sum in (1.36) is not direct in general. However, since the (k) V are finite-dimensional, we can write VL as a direct sum in terms of the complement spaces Wl : (k) W1 ⊗ · · · ⊗ Wk . (1.37) VL = ∈Nk0 ||≤L
If a hierarchical basis of the subspaces V (i.e., satisfying hypothesis (W1)) is available, we can define a sparse tensor quasi-interpolation op(k) (k) erator PL : V (k) → VL by a suitable truncation of the tensor product wavelet expansion: for every x1 , . . . , xk ∈ D,
(k) ···k 1 vj11···j ψj1 (x1 ) · · · ψjkk (xk ). (1.38) (PL v)(x) := k 0≤1 +···+k ≤L 1≤jν ≤Mν ,ν=1,...,k
(k) If a hierarchical basis is not explicitly available, we can still express PL in terms of the projections Q := P − P−1 for = 0, 1, . . . , and with the convention P−1 := 0 as
(k) Q1 ⊗ · · · ⊗ Qk . (1.39) PL = 0≤1 +···+k ≤L (k) We also note that the dimension of VL is
L = dim(V (k) ) = O(NL (log2 NL )k−1 ), N L
(1.40)
310
C. Schwab and C. J. Gittelson
that is, it is a log-linear function of the number NL of the degrees of freedom used for approximation of the first moment. Given that the sparse (k) tensor product space VL is substantially coarser, one wonders whether its approximation properties are substantially worse than that of the full ten(k) sor product space VL . The basis for the use of the sparse tensor product (k) (k) spaces VL is the next result, which indicates that VL achieves, up to logarithmic terms, the same asymptotic rate of convergence, in terms of powers of the mesh width, as the full tensor product space. The approximation (k) property of sparse grid spaces VL was established, for example, in Schwab and Todor (2003b, Proposition 4.2), Griebel, Oswald and Schiekofer (1999), von Petersdorff and Schwab (2004) and Todor (2009). Proposition 1.7. inf U − v V (k) ≤ C(k)
−s/d
NL
U
(k)
Xs −s/d ν(k)
U X (k) NL L s
if 0 ≤ s < p + 1 − /2,
if s = p + 1 − /2. (1.41) Here, the exponent ν(k) = (k − 1)/2 is best possible on account of the V -orthogonality of the V best approximation. (k)
v∈VL
Remark 1.8. The exponent ν(k) of the logarithmic terms in the sparse tensor approximation rates stated in Proposition 1.7 is best possible for the approximation in the sparse tensor product spaces V (k) given the regularity (k) U ∈ Xs . In general, these logarithmic terms in the convergence estimate are unavoidable. Removal of all logarithmic terms in the convergence rate (k) estimate as well as in the dimension estimate of VL is possible only if either (a) the norm ◦ V (k) on the left-hand side of (1.41) is weakened, or if (b) the (k) norm Xs on the right-hand side of (1.41) is strengthened. For example, in the context of sparse tensor FEM for the Laplacian in (0, 1)d , it was shown by von Petersdorff and Schwab (2004) and Bungartz and Griebel (2004) that all logarithmic terms can be removed; this is due to the observation that the H 1 ((0, 1)d ) norm is strictly weaker than the corresponding tensorized norm H 1 (0, 1)(d) which appears in the error bound (1.41) in the case of d-point correlations of a random field taking values in H01 (0, 1). The same effect allows us to slightly coarsen the sparse tensor product (k) space VL . This was exploited, for example, by Bungartz and Griebel (2004) and Todor (2009). (k) The error bound (1.41) is for the best approximation of U ∈ Xs from (k) VL . To achieve the exponent ν(k) = (k − 1)/2 in (1.41) for a sparse tensor quasi-interpolant such as (1.38), the multi-level basis ψj of V must be V -orthogonal between successive levels . This V -orthogonality of the
311
Sparse tensor discretizations for sPDEs
multi-level basis can be achieved in V ⊂ H 1 (D), for example, by using so-called spline prewavelets. Let us also remark that it is even possible to construct L2 (D) orthonormal piecewise polynomial wavelet bases satisfying (W1)–(W5). We refer to Donovan, Geronimo and Hardin (1996) for details. The stability property (W3) implies the following result (see, e.g., von Petersdorff and Schwab (2004)). (k)
Lemma 1.9. (on the sparse tensor quasi-interpolant PL ) Assume (k) (W1)–(W5) and that the component spaces V of VL are V -orthogonal between scales and have the approximation property (1.29). Then the sparse (k) tensor projection PL is stable: there exists C > 0 (depending on k but independent of L) such that, for all for U ∈ V (k) ,
PL U V (k) ≤ C U V (k) . (k)
(1.42)
For U ∈ Xs and 0 ≤ s ≤ s∗ , if the basis functions ψj satisfy (W1)–(W5) and are V -orthogonal between different levels of mesh refinement, we obtain (k) quasi-optimal convergence of the sparse tensor quasi-interpolant PL U in (1.38): (k)
(k) −s/d
U − PL U V (k) ≤ C(k)NL (log NL )(k−1)/2 U X (k) . s
(1.43)
(k) Remark 1.10. The convergence rate (1.43) of the approximation PL U from the sparse tensor subspace is, up to logarithmic terms, equal to the rate obtained for the best approximation of the mean field, i.e., in the case k = 1. We observe, however, that the regularity of U required to achieve this convergence rate is quite high: the function U must belong (k) to an anisotropic smoothness class Xs which, in the context of ordinary Sobolev spaces, is a space of functions whose (weak ) mixed derivatives of order s belong to V . Evidently, this mixed smoothness regularity requirement becomes stronger as the number k of moments increases. By Theorem 1.6, the k-point correlations Mk u of the random solution u naturally satisfy such regularity.
Galerkin discretization We first consider the discretization of the problem Au(ω) = f (ω) for a single realization ω, bearing in mind that in the Monte Carlo method this problem will have to be approximately solved for many realizations of ω ∈ Ω. The Galerkin discretization of (1.11) reads: find uL (ω) ∈ VL such that vL , AuL (ω) = vL , f (ω)
∀vL ∈ VL ,
P-a.e. ω ∈ Ω,
(1.44)
where ‘P-a.e.’ stands for ‘P almost everywhere’. It is well known that the
312
C. Schwab and C. J. Gittelson
injectivity (1.13) of A, the G˚ arding inequality (1.12) and the density in V of the subspace sequence {V }∞ =0 imply that there exists L0 > 0 such that, for L ≥ L0 , problem (1.44) admits a unique solution uL (ω). Furthermore, we have the uniform inf-sup condition (see, e.g., Hildebrandt and Wienholtz (1964)): there exists a discretization level L0 and a stability constant γ > 0 such that, for all L ≥ L0 , inf
sup
0=u∈VL 0=v∈VL
1 Au, v ≥ > 0.
u V v V γ
(1.45)
The inf-sup condition (1.45) implies quasi-optimality of the approximations uL (ω) for L ≥ L0 (see, e.g., Babuˇska (1970/71)): there exist C > 0 and L0 > 0 such that ∀L ≥ L0 :
u(ω) − uL (ω) V ≤ C inf u(ω) − v V v∈VL
P-a.e. ω ∈ Ω. (1.46)
From (1.46) and (1.29), we obtain the asymptotic error estimate: define σ := min{s∗ , p + 1 − /2}. Then there exists C > 0 such that for 0 < s ≤ σ ∀L ≥ L0 :
−s/d
u(ω) − uL (ω) V ≤ CNL
u Xs
P-a.e. ω ∈ Ω.
(1.47)
1.3. Sparse tensor Monte Carlo Galerkin FEM We next review basic convergence results of the Monte Carlo method for the approximation of expectations of random variables taking values in a separable Hilbert space. As our exposition aims at the solution of operator equations with stochastic data, we shall first consider the MC method without discretization of the operator equation, and show convergence estimates of the statistical error incurred by the MC sampling. Subsequently, we turn to the Galerkin approximation of the operator equation and, in particular, the sparse tensor approximation of the two- and k-point correlation functions of the random solution. Monte Carlo error for continuous problems For a random variable Y , let Y1 (ω), . . . , YM (ω) denote M ∈ N copies of Y , i.e., the Yi are random variables which are mutually independent and identically distributed to Y (ω) on the same common probability space (Ω, Σ, P). M Then the arithmetic average Y (ω), 1 M Y1 (ω) + · · · + YM (ω) , Y (ω) := M is a random variable on (Ω, Σ, P) as well. The simplest approach to the numerical solution of (1.11) for f ∈ L1 (Ω; V ) is MC simulation. Let us first consider the situation without discretization of V . We generate M draws f (ωj ), j = 1, 2, . . . , M , of f (ω) and find the
Sparse tensor discretizations for sPDEs
313
solutions u(ωj ) ∈ V of the problems Au(ωj ) = f (ωj ),
j = 1, . . . , M.
(1.48)
¯ M [u(k) ] We then approximate the kth moment Mk u with the sample mean E of u(ωj ) ⊗ · · · ⊗ u(ωj ): M
¯ M [u(k) ] := u ⊗ · · · ⊗ uM = 1 u(ωj ) ⊗ · · · ⊗ u(ωj ). E M
(1.49)
j=1
It is well known that the Monte Carlo error decreases as M −1/2 in a probabilistic sense provided the variance of u(k) exists. By (1.18), this is the case for u ∈ L2k (Ω; V ). We have the following convergence estimate. Theorem 1.11. Let k ≥ 1 and assume that in the operator equation (1.11) f ∈ L2k (Ω; V ). Then, for any M ∈ N of samples for the MC estimator (1.49), we have the error bound k −1/2 ¯ M [u(k) ] 2 (1.50)
Mk u − E CA f L2k (Ω;V ) . L (Ω;V (k) ) ≤ M Proof. We observe that f ∈ L2k (Ω; V ) implies with (1.22) that u(k) ∈ i (ω) the M i.i.d. copies of the L2 (Ω; V (k) ). For i = 1, . . . , M we denote by u random variable u(ω) = A−1 f (ω), which corresponds to the M many MC samples u i = A−1 fi . Using that the u i are independent and identically distributed, we infer that, for each value of i, u i (ω) ∈ L2k (Ω; V ). Therefore (k) ¯ M [u(k) ] 2 2 ¯ M [u(k) ] 2 (k) = E
E[u ] − E
E[u(k) ] − E (k) L (Ω;V V ) M 2 1 (k) (k) =E u i (k) E[u ] − M V i=1 M M
(k)
1 1 (k) u i , E[u(k) ] − u j = E E[u(k) ] − M M i=1
=
1 M2
M
j=1
(k) (k) E E[u(k) ] − u i , E[u(k) ] − u j
i,j=1
M 1 (k) E E[u(k) ] − u i 2V (k) ( ui (ω) independent) = 2 M i=1 1 (k) ( ui (ω) identically distributed) E u − E[u(k) ] 2V (k) = M 1 (k) E u − E[u(k) ], u(k) − E[u(k) ] = M
314
C. Schwab and C. J. Gittelson
1 (k) E u − E[u(k) ], E[u(k) ] + E u(k) − E[u(k) ], u(k) M 1 (k) 2 1 E u V (k) −
E[u(k) ] 2V (k) = M M ≤ M −1 u(k) 2L2 (Ω;V (k) ) = M −1 u 2k L2k (Ω;V ) . =
Taking square roots on both sides completes the proof. The previous theorem required that u(k) ∈ L2 (Ω; V (k) ) or (equivalently by (1.18)) that u ∈ L2k (Ω; V ) (resp. f ∈ L2k (Ω; V )) in order to obtain the convergence rate M −1/2 of the MC estimates (1.49), in L2 (Ω; v). In the case of weaker summability of u, the next estimate shows that the MC method converges in L1 (Ω; V (k) ) and at a rate that is possibly lower than 1/2, as determined by the summability of u. We only state the result here and refer to von Petersdorff and Schwab (2006) for the proof. Theorem 1.12. Let k ≥ 1. Assume that f ∈ Lαk (Ω; V ) for some α ∈ ¯ M [u(k) ] as in (1.49). (1, 2]. For M ≥ 1 samples we define the sample mean E Then there exists C such that, for every M ≥ 1 and every 0 < < 1,
f kLαk (Ω;V ) k M (k) ¯ P M u − E [u ] V (k) ≤ C 1/α 1−1/α ≥ 1 − .
M
(1.51)
The previous results show that one can obtain a rate of up to M −1/2 in a probabilistic sense for the Monte Carlo method. Convergence rates beyond 1/2 are not possible, in general, by the MC method, as is shown by the central limit theorem; in this sense, the rate 1/2 is sharp. So far, we have obtained the convergence rate 1/2 of the MC method essentially in L1 (Ω, V (k) ) and in L2 (Ω, V (k) ). A P-a.s convergence estimate of the MC method can be obtained using the separability of the Hilbert space of realizations and the law of the iterated logarithm; see, e.g., Strassen (1964) and Ledoux and Talagrand (1991, Chapter 8) and the references therein for the vector-valued case. Lemma 1.13. Assume that H is a separable Hilbert space and that X ∈ L2 (Ω; H). Then, with probability 1, M
X − E(X) H lim sup ≤ X − E(X) L2 (Ω;H) . −1 log log M )1/2 M →∞ (2M
(1.52)
For the proof, we refer to von Petersdorff and Schwab (2006). Applying Lemma 1.13 to X = u(k) = u⊗· · ·⊗u and with V (k) in place of H gives (with 2k f k , CA as in (1.14)) u ⊗ · · · ⊗ u L2 (Ω;V (k) ) = u kL2k (Ω;V ) ≤ CA L2k (Ω;V ) whence the following result.
Sparse tensor discretizations for sPDEs
Theorem 1.14.
Let f ∈ L2k (Ω; V ). Then, with probability 1,
lim sup M →∞
315
¯ M [u(k) ] (k)
Mk u − E V ≤ C(k) f kL2k (Ω;V ) . (2M −1 log log M )1/2
(1.53)
Sparse Monte Carlo Galerkin moment estimation We now use Galerkin discretization with the subspaces VL ⊂ V to solve (1.48) approximately and to obtain, for each draw of the load function, Galerkin approximations uL (ωj ). The resulting sample mean approximation of the kth moment Mk u equals M 1 M (k) ¯ uL (ωj ) ⊗ · · · ⊗ uL (ωj ). E [uL ] := M
(1.54)
j=1
This yields a first MC estimation for the k-point correlation function of Mk u. The complexity of forming (1.54) is, however, prohibitive: to form in (1.54) the k-fold tensor product of the Galerkin approximations for the M data samples, one needs O(NLk ) memory and O(M NLk ) operations to compute this mean, which implies loss of linear complexity for k > 1. Therefore we propose using the sparse approximation ¯ M [P(k) u(k) ], ¯ M [u(k) ] = E M [u(k) ] := P(k) E E L L
(1.55)
which requires O(NL (log NL )k−1 ) memory and operations. ¯ M,L [P(k) Mk u] we proceed as follows. First, we generate M To compute E L data samples f (ωj ), j = 1, . . . , M and the corresponding Galerkin approximations uL (ωj ) ∈ VL as in (1.44). Choosing a wavelet basis of VL that satisfies (W1) ((W2)–(W5) are not required at this stage), by (1.33), uL (ωj ) can then be represented as uL (ωj ) =
M L
uk (ωj )ψk ,
(1.56)
=0 k=1
= where {ψk },k denotes the dual wavelet basis to with {ψk },k (Cohen 2003). Based on the representation (1.56), we can compute the sparse tensor product MC estimate of Mk u with the projection operators (k) PL in (1.38) as follows: uk (ωj )
uL (ωj ), ψk ,
M 1 (k) (k) M (k) PL uL (ωj ) ⊗ · · · ⊗ uL (ωj ) ∈ VL . E [uL ] = M
(1.57)
j=1
This quantity can be computed in O(M NL (log NL )k−1 ) operations since, for each data sample f (ωj ), j = 1, . . . , M , the projection PL onto the (k) sparse tensor product space VL of the Galerkin approximation uL (ωj ) is
316
C. Schwab and C. J. Gittelson
(k) given by PL [uL (ωj ) ⊗ · · · ⊗ uL (ωj )]. This projection can be computed in O(NL (log2 NL )k−1 ) operations as follows. For each j we first compute (k) uL (ωj ) in the wavelet basis and then form PL [uL (ωj ) ⊗ · · · ⊗ uL (ωj )] using the formula
(k) vjl11 · · · vjlkk ψjl11 · · · ψjlkk . (1.58) PL (v ⊗ · · · ⊗ v) = 0≤1 +···+k ≤L 1≤jν ≤Mν ,ν=1,...,k
The following result addresses the convergence of the sparse MC–Galerkin approximation of Mk u. Recall σ := min{s∗ , p + 1 − /2} with s∗ as in Theorem 1.6. Theorem 1.15. Assume that f ∈ Lk (Ω; Ys ) ∩ Lαk (Ω; V ) for some α ∈ (1, 2] and some s ∈ (0, σ]. Then there exists C(k) > 0 such that, for all M ≥ 1, L ≥ L0 and all 0 < < 1, M,L [Mk u] (k) < λ ≥ 1 −
P Mk u − E V with
−s/d −1 λ = C(k) NL (log NL )(k−1)/2 f kLk (Ω;Ys ) + −1/α M −(1−α ) f kLαk (Ω;V ) .
Proof.
We estimate
M,L [Mk u] − Mk u (k)
E V M 1 (k) PL [uL (ωj ) ⊗ · · · ⊗ uL (ωj )] − E(u ⊗ · · · ⊗ u) = M j=1
V (k)
(k) ≤ PL [uL (ωj ) ⊗ · · · ⊗ uL (ωj ) − u(ωj ) ⊗ · · · ⊗ u(ωj )] V (k) M 1 (k) (k) PL [u(ωj ) ⊗ · · · ⊗ u(ωj )] − E(PL [u ⊗ · · · ⊗ u]) + M j=1
+ (I −
V (k)
(k) PL )Mk u V (k) .
The last term is estimated with (1.43), Theorem 1.6, for 0 ≤ s ≤ s∗ by (k) −s/d
(I − PL )Mk u V (k) ≤ C(k)NL (log NL )(k−1)/2 Mk f Y (k) . s
For the first term, we use (1.42) and (1.47) with a tensor product argument. For the second term, the statistical error, by (1.42) it suffices to bound M
1 ¯ M [u(k) ] (k) , [u(ωj ) ⊗ · · · ⊗ u(ωj )] = Mk u − E E([u ⊗ · · · ⊗ u]) − V (k) M j=1
which was estimated in Theorem 1.12.
V
Sparse tensor discretizations for sPDEs
317
Remark 1.16. All results in this section also hold in the case of a stochastic operator A(ω). Specifically, let X now denote the space of bounded linear mappings V → V . Assume that A : Ω → X is measurable (with respect to Borel sets of X) and that there exists C, α > 0 and a compact T : V → V such that
A(ω) V ≤ C (A(ω) + T )u, u ≥
α u 2V
almost everywhere,
(1.59)
almost everywhere.
(1.60)
Let k ≥ 1. Then f ∈ Lk (Ω; V ) implies u = A−1 f ∈ Lk (Ω; V ) and Mk u ∈ (k) V (k) . Also f ∈ Lk (Ω; Ys ) implies u = A−1 f ∈ Lk (Ω; Xs ) and Mk u ∈ Xs . All proofs on the convergence of MC methods in this section still apply to that case. However, as we shall explain below, substantial computational efficiency for MCM can be gained by coupling the multi-level structure (1.28) of the Galerkin discretizations with a level-dependent sample size. 1.4. Deterministic Galerkin approximation of moments Sparse Galerkin approximation of Mk u We now describe and analyse the deterministic computation of the k-point correlation function Mk u of the random solution u by Galerkin discretization (1.26). If we use in the Galerkin discretization the full tensor product (k) (k) space VL , the inf-sup condition of the discrete operator on VL follows directly for L ≥ L0 from the discrete inf-sup condition (1.45) of the ‘meanfield’ operator A by a tensor product argument. The (anisotropic) regularity estimate for the kth moment Mk u,
Mk u X (k) ≤ Ck,s Mk f Y (k) , 0 ≤ s ≤ s∗ , s
s
k ≥ 1,
(1.61)
which was shown in Theorem 1.6, then allows us to obtain convergence rates. However, this ‘full tensor product Galerkin’ approach is prohibitively expensive: with NL degrees of freedom in the physical domain D, it requires the set-up and solution of a linear system with NLk unknowns. We reduce (k) this complexity by using in place of VL the sparse tensor product space (k) VL . The sparse Galerkin approximation ZL of Mk u is then obtained as follows: (k) find ZL ∈ VL
such that A(k) ZL , v = Mk f, v
(k) ∀v ∈ VL .
(1.62)
We first consider the case where the operator A is coercive, i.e., (1.12) holds with T = 0. Then A(k) : V (k) → (V )(k) is also coercive, and the (k) (k) stability of the Galerkin method with VL follows directly from VL ⊂ V (k) . In the case of T = 0 the stability of the Galerkin FEM on the sparse tensor (k) product space VL is not obvious: we know that (A + T ) ⊗ · · · ⊗ (A + T )
318
C. Schwab and C. J. Gittelson
is coercive for sufficiently fine meshes (i.e., for sufficiently large L), but (A + T ) ⊗ · · · ⊗ (A + T ) − A ⊗ · · · ⊗ A is not compact. Therefore we require some additional assumptions. We assume that (1.12) holds with the additional requirement that T : V → V is smoothing with respect to the scale of spaces Xs , Ys , and we also assume that the adjoint operator A : V → V satisfies a regularity property: we assume that there exists δ > 0 such that T : V = X0 → Yδ is continuous, −1
(A )
(1.63)
: Yδ → Xδ is continuous.
(1.64)
Due to the indefiniteness of A we have to modify the sparse grid space: Let (k) (k) (k) (k) L0 ≥ 0 and L ≥ L0 . We define a space VL,L0 with VL ⊂ VL,L0 ⊂ VL+(k−1)L0 as follows. 1 k Definition 1.17. Let SL,L := {0, . . . , L}. For k ≥ 2, let SL,L be the set 0 0 k of indices l ∈ N0 satisfying the following conditions:
(li1 , . . . , lik−1 ) ∈
l1 k−1 SL,L0
+ · · · + lk ≤ L + (k − 1)L0 ,
(1.65)
if i1 , . . . , ik−1 are different indices in {1, . . . , k}. (1.66)
Then we define (k) VL,L0 :=
W l1 ⊗ · · · ⊗ W lk .
(1.67)
k l∈SL,L
0
k Let JL0 := {0, 1, . . . , L0 }. Then the index set SL,L has the following 0 subsets:
JLk0 ,
1 JLk−1 × SL,L , 0 0
2 JLk−2 × SL,L , 0 0
...,
k−1 JL0 × SL,L . 0
(k) Therefore, VL,L0 contains the following subspaces: (k)
VL 0 ,
(k−1)
VL 0
(1) ⊗ VL,L0 ,
(k−2)
VL 0
(2) ⊗ VL,L0 ,
...,
(k−1) VL0 ⊗ VL,L0 .
(1.68)
To achieve stability of sparse tensor discretizations in the presence of possible indefiniteness of the operator A(ω) in (1.12), we introduce a certain (k) fixed L0 > 0 of mesh refinement and consider the sequence of spaces VL,L0 with L tending to infinity. Since (k) (k) (k) VL ⊂ VL,L0 ⊂ VL+(k−1)L0 , (k) (k) we see that dim VL,L0 grows with the same rate as dim VL as L → ∞. We then have the following discrete stability property.
Sparse tensor discretizations for sPDEs
319
Theorem 1.18. Assume that A and T satisfy (1.12), (1.63) and (1.64). Then there exists L0 ∈ N and γ > 0 such that, for all L ≥ L0 , inf
(k)
0=u∈VL,L
0
sup (k) 0=v∈VL,L
0
1 A(k) u, v ≥ > 0.
u V (k) v V (k) γ
(1.69)
In the positive definite case T = 0, this holds with L0 = 0, whereas in the indefinite case, L0 > 0 is necessary in general. For the proof, we refer to von Petersdorff and Schwab (2006). As is by now classical (e.g., Babuˇska (1970/71)), the discrete inf-sup condition (1.69) implies quasi-optimal convergence and therefore the convergence rate is given by the rate of best approximation. The following result from von Petersdorff and Schwab (2006) makes this precise. Theorem 1.19.
Assume (1.12) and (1.13).
Lk (Ω; V ).
Then with L0 ≥ 0 as in Theorem 1.18 (in particular, (a) Let f ∈ L0 = 0 is admissible when T = 0 in (1.12)) such that, for all L ≥ L0 , (k) the sparse Galerkin approximation ZL ∈ VL,L0 of Mk u is uniquely defined and converges quasi-optimally, i.e., there exists C > 0 such that, for all L ≥ L0 ,
Mk u − ZL (k) ≤ C inf Mk u − v (k) → 0 as L → ∞. V
(k)
v∈VL,L
V
0
(b) Assume that f ∈ Lk (Ω; Ys ) and the approximation property (1.29). Then, for 0 ≤ s ≤ σ := min{s∗ , p + 1 − /2}, −s/d
Mk u − ZL V (k) ≤ C(k)NL (log NL )(k−1)/2 f kYs .
(1.70)
Matrix compression When A is a differential operator, the number of non-zero entries in the stiffness matrix for the standard FEM basis is O(N ) due to the local support assumption (W2) on the basis ψj . This implies that we can compute a matrix– vector product arising typically in iterative solvers with O(N ) operations. In the case of an integral or pseudodifferential equation, the operator A is non-local and all entries of the stiffness matrix are non-vanishing, in general. Then the cost of a matrix–vector product is O(N 2 ), which implies a loss of linear complexity of the algorithm. For boundary integral operators, it is well known that one can improve the complexity to O(N (log N )c ) by using matrix compression techniques. Several approaches to this end are available: either fast multipole methods (e.g., Beatson and Greengard (1997) and the references therein), multiresolution methods (such as wavelets; see, e.g., Schneider (1998), Harbrecht (2001), Dahmen, Harbrecht and Schneider (2006), Dahmen (1997)), or low-rank matrix approximation techniques (e.g., Bebendorf and Hackbusch (2003)).
320
C. Schwab and C. J. Gittelson
These matrix compression methods have in common that they reduce complexity of the matrix–vector multiplication from O(N 2 ) to O(N (logN )b ) for some (small) non-negative number b. This complexity reduction comes, however, at the expense of being realized only approximately. We will elaborate on the effect of matrix compression on the accuracy of sparse tensor Galerkin approximations in this and in the following section. In the compression step, we replace most of the entries AJJ of the stiffness L . The matrix AL with zeros, yielding an approximate stiffness matrix A L induce mappings from stiffness matrix AL and its compressed variant A VL to (VL ) , which we denote by AL and AL , respectively. We will require AL and AL to be close in the following sense: for certain values s, s ∈ [0, σ] with σ = p + 1 − /2 and for u ∈ Xs , v ∈ Xs , we have (AL − AL ) PL u, PL v ≤ c(s, s )N −(s+s )/d (log NL )q(s,s ) u Xs v X L s (1.71) with c(s, s ) > 0 and q(s, s ) ≥ 0 independent of L. The following result collects some properties of the corresponding approximate solutions. Proposition 1.20.
Assume (1.12) and (1.13).
(a) If (1.71) holds for (s, s ) = (0, 0) with q(0, 0) = 0 and c(0, 0) sufficiently small, then there is an L0 > 0 such that, for every L ≥ L0 , (AL )−1 exists and is uniformly bounded, i.e. ∀L ≥ L0 :
(AL )−1 (VL ) →VL ≤ C
(1.72)
for some C independent of L. (b) If, in addition to the assumptions in (a), (1.71) holds with (s, s ) = (σ, 0), then −σ/d
(A−1 − (AL )−1 ) f V ≤ CNL (log NL )q(σ,0) f Yσ .
(1.73)
(c) Let g ∈ V be such that the solution ϕ ∈ V of A ϕ = g belongs to Xσ . If, in addition to the assumptions in (a) and (b), (1.71) also holds for (s, s ) = (0, σ) and for (s, s ) = (σ, σ), then g, (A−1 − (AL )−1 ) f ≤ CN −2σ/d · (log NL )max{q(0,σ)+q(σ,0),q(σ,σ)} L (1.74) where C = C(f, g). Proof. (a) The G˚ arding inequality (1.12), the injectivity (1.13) and the density in V of the subspace sequence {V L }L imply the discrete inf-sup condition (1.45). Using (1.71) with vL ∈ VL and (s, s ) = (0, 0), we obtain with (1.45)
AL vL (VL ) ≥ AvL (VL ) − (A−AL )vL (VL ) ≥ c−1 s vL V −Cc(0, 0) vL V .
321
Sparse tensor discretizations for sPDEs
This implies that for c(0, 0) < 1/(2Cγ) there is an L0 > 0 such that, for all L ≥ L0 , cs
vL V ≤
AL vL (VL ) ∀vL ∈ VL , (1.75) 2 whence we obtain (1.72). L = (AL )−1 f for L ≥ L0 . We have (b) Let f ∈ Yσ and u = A−1 f , u
u − u L V ≤ u − PL u V + PL u − u L V . Using (1.45) and AL uL , vL = Au, vL for all vL ∈ VL , we get
PL u − u L V ≤ C AL (PL u − u L ) (VL ) = C AL PL u − Au (VL ) , which yields the error estimate
u − u L V ≤ u − PL u V + C A(u − PL u) (VL ) + C (A − AL ) PL u (VL ) . (1.76) Here, the first two terms are estimated using the V -stability (W3) and (1.33) of the wavelet basis, which imply
u − PL u V ≤ C inf u − v V ≤ C(NL )−σ/d u Xσ , v∈VL
(1.77)
and the continuity A : V → V . The third term in (1.76) is estimated with (1.71) for (s, s ) = (σ, 0) and PL vL = vL for all vL ∈ VL : (A − AL ) PL u, vL c(σ, 0)N −σ/d (log NL )q(σ,0) u Xσ v V . (1.78) L (c) To show (1.74), we let ϕL := PL ϕ for ϕ = (A )−1 g ∈ Xσ and u = A−1 f , u L = (AL )−1 f for L ≥ L0 . Then g, u− u L ), ϕ−ϕL + A(u− u L = ϕ, A(u− u L ) ≤ A(u− u L ), ϕL . We estimate the first term by C u − u L V ϕ − P L ϕ V , which implies the bound (1.74) using (1.73) and (1.77). The second term is bounded as follows: L , ϕL A(u − u L ), ϕL = (AL − A) u uL − PL u), PL ϕ + (AL − A) PL u, PL ϕ . = (AL − A)( Here we estimate the second term by (1.71) with (s, s ) = (σ, σ). For the first term, we use (1.71) with (s, s ) = (0, σ) to obtain (AL − A) PL ( uL − PL u), PL ϕ −σ/d
(log NL )q(0,σ) uL − PL u V ϕ Xσ
−σ/d
(log NL )q(0,σ) ( uL − u V + u − PL u V ) ϕ Xσ .
NL NL
Using (1.73) and (1.77), we complete the proof.
322
C. Schwab and C. J. Gittelson
Wavelet compression L , which We next describe how to obtain an approximate stiffness matrix A on the one hand has O(NL (log NL )a ) non-zero entries (out of NL2 ), and on the other hand satisfies the consistency condition (1.71). Here we assume that the operator A is given in terms of its Schwartz kernel k(x, y) by k(x, y) ϕ(y) dS(y) (1.79) (Aϕ)(x) = y∈Γ
C0∞ (Γ),
for ϕ ∈ estimates
where Γ = ∂D and k(x, z) satisfies the Calder´on–Zygmund
|Dxα Dyβ k(x, y)| ≤ Cαβ |x − y|−(d++|α|+|β|) ,
x = y ∈ Γ.
(1.80)
In the following, we combine the indices (, j) into a multi-index J = (, j) to simplify notation, and write ψJ , ψJ , etc. Due to moment property (1.31) of the basis {ψJ }, the entries the vanishing = Aψ , ψ AL of the moment matrix AL with respect to the basis {ψJ } J J JJ show fast decay (Schneider 1998, Dahmen et al. 2006). Let SJ = supp(ψJ ), SJ = supp(ψJ ). Then we have the following decay estimate for the matrix entries AJJ (see Schneider (1998, Lemma 8.2.1) and Dahmen et al. (2006)). Proposition 1.21. If the wavelets ψJ , ψJ satisfy the moment condition (1.31) and A satisfies (1.79) and (1.80), then AψJ , ψJ ≤ C dist(SJ , SJ )−γ 2−γ(+ )/2 , (1.81) where γ := + d + 2 + 2(p∗ + 1) > 0. L with This can be exploited to truncate AL to obtain a sparse matrix A 2 at most O(NL (log NL ) ) non-zero entries and such that (1.71) is true with c(0, 0) as small as desired, independent of L, q(0, 0) = 0, and q(0, σ) = q(σ, 0) ≤ 32 , q(σ, σ) ≤ 3; see von Petersdorff and Schwab (1996), Schneider (1998), Harbrecht (2001) and Dahmen et al. (2006), for example. The L of the compressed L ), in the block A number of non-zero entries, nnz((A , , L Galerkin stiffness matrix A is bounded by L ) ≤ C(min(, ) + 1)d 2d max(, ) . nnz(A ,
(1.82)
Remark 1.22. For integral operators A an alternative approach for the efficient computation of matrix–vector products with the stiffness matrix AL is given by the cluster of fast multipole approximation. For these approximations, one additionally assumes for the operator (1.79) that the kernel k(x, z) is analytic for x = y, and the size of its domain of analyticity is proportional to |x − y|. Then one can replace k(x, y) in (1.79) for |x − y| sufficiently large by a cluster of fast multipole approximation with degenerate kernels which are obtained by either truncated multipole expansions
323
Sparse tensor discretizations for sPDEs
or polynomial interpolants of order log NL , allowing us to apply the block L to a vector in at most A ,
C(log NL )d 2d max(, ) ,
0 ≤ , ≤ L,
(1.83)
operations. See Schmidlin, Lage and Schwab (2003) for details on this work estimate. Error analysis for sparse Galerkin with matrix compression L and the corresponding operBased on the compressed stiffness matrix A ator AL : VL → (VL ) induced by it, we define the sparse tensor product approximation of Mk u with matrix compression analogous to (1.62) as fol(k) (k) lows: find ZLk ∈ VL,L0 such that, for all v ∈ VL,L0 , (k) AL ZLk , v = Mk f, v.
(1.84)
We prove bounds for the error ZLk − Mk u. Lemma 1.23. Assume (1.12) and (1.13), and that the spaces VL as in Example 1.2 admit a hierarchical basis {ψj }≥0 satisfying (W1)–(W5). Assume further that the operator AL in (1.84) satisfies the consistency estimate (1.71) for s = s = 0, q(0, 0) = 0, and with sufficiently small c(0, 0). Then there exists L0 > 0 such that, for all L ≥ L0 , the kth-moment problem with matrix compression, (1.84), admits a unique solution and we have the error estimate k M u − ZLk (k) (1.85) V (k) (k) |(AL − AL )v, w|
Mk u − v V (k) + sup . ≤ C inf (k)
w V (k) (k) v∈V 0=w∈V L
L
Proof. We show unique solvability of (1.84) for sufficiently large L. By Theorem 1.18 we have that (1.69) holds. To show unique solvability of (1.84), we write for k ≥ 3 (k) (k−1) A(k) − AL = (A − AL ) ⊗ A(k−1) + AL ⊗ A(k−1) − AL = (A − AL ) ⊗ A(k−1) + AL ⊗ (A − AL ) ⊗ A(k−2) (2) (k−2) , + AL ⊗ A(k−2) − AL and obtain, after iteration, (k)
A
(k) − AL = (A − AL ) ⊗ A(k−1) +
k−2
(ν) AL ⊗ (A − AL ) ⊗ A(k−ν−1)
ν=1
+
(k−1) AL
⊗ (A − AL )
(1.86)
324
C. Schwab and C. J. Gittelson
(where the sum is omitted if k = 2). We get from (1.69) that for any (k) (k) u ∈ VL there exists v ∈ VL such that
(k) (k) AL u, v = A(k) u, v + (AL − A(k) )u, v (1.87) (k) (AL − A(k) )w, w
u V (k) v V (k) . ≥ γ −1 − sup sup w V (k) w
V (k) (k) (k) w∈V w∈ V L
L
(k) (k) To obtain an upper bound for the supremum, we admit w, w ∈ VL,L0 ⊇ VL , use (1.86) and (1.71) with s = s = 0 and q(0, 0) = 0 to get
AL VL →(VL ) ≤ A V →V +c(0, 0), cA (k)
and therefore estimate for any w, w ∈ VL,L0 " !k−2
(k) ν k−ν−1 k−1 (k) A − A )w, w c(0, 0) cA + cA + c(0, 0) cA L ν=1
k−1
w V (k) w
V (k) + cA + c(0, 0) c(0, 0) w V (k) w
V (k) .
(1.88)
(k) If c(0, 0) is sufficiently small, this implies with (1.85) the stability of AL (k) on VL,L0 : there exists L0 > 0 such that
AL u, v 1 > 0, ≥
u V (k) v V (k) 2γ (k)
inf
(k)
0=u∈VL,L
0
sup (k) 0=v∈VL,L
0
(1.89)
for all L ≥ L0 , and hence the unique solvability of (1.84) for these L follows. To prove (1.85), we follow the proof of the first lemma of Strang (e.g., Ciarlet (1978)). We now use this lemma to obtain the following convergence result. Theorem 1.24. Assume (1.12) and (1.13), V = H /2 (Γ), and that the subspaces {V }∞ =0 are as in Example 1.2, and that in the smoothness spaces Xs = H /2+s (Γ), s ≥ 0, the operator A : Xs → Ys is bijective for 0 ≤ s ≤ s∗ with some s∗ > 0. Assume further that a compression strategy for the matrix AL in the hierarchical basis {ψj } satisfying (W1)–(W5) is available with (1.71) for s = 0, 0 ≤ s ≤ σ = p + 1 − /2, q(0, 0) = 0 and
325
Sparse tensor discretizations for sPDEs
with c(0, 0) sufficiently small, independent of L for L ≥ L0 . Then, with δ = min{p + 1 − /2, s}/d, 0 ≤ s ≤ s∗ , we have the error estimate
Mk u − ZLk V (k) ≤ C(log NL )min{(k−1)/2,q(s,0)} NL−δ Mk f Y (k) . s
(1.90)
(k) We use (1.85) with the choice v = PL,L0 and, for Mk u − v V (k) , (k) (k) apply the approximation result (1.6). We express the difference AL − A˜L using (1.86). Then we obtain a sum of terms, each of which can be bounded (k) (k) using (1.71) and the continuity of AL and A˜L . This yields the following error bound:
Mk u − ZLk V (k) ≤ C (log NL )(k−1)/2 NL−δ −s/d
Mk u X (k) . + c(s, 0)(log NL )q(s,0) NL
Proof.
s
Theorem 1.24 addressed only the convergence of ZLk in the ‘energy’ norm V (k) . In the applications which we have in mind, however, functionals of the solution Mk u are also of interest, which we assume are given in the k form G, M u for some G ∈ (V (k) ) . We approximate such functionals by G, ZLk . Theorem 1.25. With all assumptions as in Theorem 1.24, and in addition that the adjoint problem (A(k) ) Ψ = G
(1.91)
admits a solution Ψ ∈ Xs for some 0 < s ≤ σ, and that the compression L of the stiffness matrix AL satisfies (1.71) with s = s = σ, we have A G, Mk u − G, ZLk ≤ C(log NL )min{k−1,q(s,s )} N −(δ+δ ) Mk f (k) , L Y (k)
s
where δ = min{p + 1 − /2, s}/d,
δ
= min{p + 1 −
/2, s }/d.
The proof is analogous to that of Proposition 1.20(c), using the sparse approximation property (1.41) in place of (1.29). Iterative solution of the linear system We solve the linear system (1.84) using iterative solvers and denote the (k) . We will consider three different methods. matrix of this system by A L
(k) (M1) If A is self-adjoint and (1.12) holds with T = 0, then the matrix A L is Hermitian positive definite, and we use the conjugate gradient algorithm which requires one matrix–vector multiplication by the matrix (k) per iteration. A L
326
C. Schwab and C. J. Gittelson
(M2) If A is not necessarily self-adjoint, but satisfies (1.12) with T = 0, then we can use the GMRES algorithm with restarts every µ iterations. (k) )H is positive definite. This requires two (k) + (A In this case A L L (k) and one matrix–vector multiplications per iteration, one with A L (k) H with (A ) . L
(M3) In the general case where (1.12) is satisfied with some operator T , we (k) )H and can then apply multiply the linear system by the matrix (A L the conjugate gradient algorithm. This requires one matrix–vector (k) and one matrix–vector multiplication with multiplication with A L (k) H (AL ) per iteration. In order to achieve log-linear complexity, it is essential that we never ex (k) . Instead, we only store the matrix A L for plicitly form the matrix A L the mean-field problem. We can then compute a matrix–vector product (k) )H ) by an algorithm which multiplies parts of the coef (k) (or (A with A L L L : see Algorithm 5.10 in Schwab and ficient vector with submatrices of A Todor (2003b). This requires O (log NL )kd+2k−2 NL operations (Schwab and Todor 2003b, Theorem 5.12). Let us explain the algorithm in the case k = 2 and L0 = 0. In this case a coefficient vector u has components ulj lj , where l, l are the levels used for (2) V (i.e., l, l ∈ {0, . . . , L} such that l + l ≤ L + L0 ) and L
j ∈ {1, . . . , Ml },
j ∈ {1, . . . , Ml }.
L corresponding to levels l, l ≤ L1 . We L1 denote the submatrix of A Let A (k) u as follows, where we can then compute the coefficients of the vector A L overwrite at each step the current components with the result of a matrix– vector product. • For l = 0, . . . , L, j = 1, . . . , Ml : multiply the column vector with L−l . components (ulj lj )l =0···L−l by the matrix A •
j =0···Ml = 0, . . . , L, j = 1, . . . , Ml : multiply the For L−l . components (ulj lj )l=0···L−l by the matrix A j=0···Ml
l
column vector with
We now analyse the convergence of the iterative solvers. The stability assumptions for the wavelet basis, the continuous and discrete operators (k) . imply the following results about the approximate stiffness matrix A L
Proposition 1.26. pendent of L.
Assume the basis
{ψj }
satisfies (1.30) with cB inde-
327
Sparse tensor discretizations for sPDEs
(a) Assume that AL satisfies (1.71) for q(0, 0) = 0 with sufficiently small c(0, 0). Then there are constants C1 , C2 such that, for all L, the matrix (k) of the problem (1.84) satisfies A L
(k) ≤ C2 < ∞. A L 2
(1.92)
(b) Assume, in addition to the assumptions of (a), that (1.12) holds with T = 0. Then ## (k) H $ $ (k) + A /2 ≥ C1 > 0. (1.93) λmin A L L (c) Assume the discrete inf-sup condition (1.69) holds, and that we have for some constant C independent of L (k) )−1 2 ≤ Cγ.
(A L
(1.94)
Proof. Because of (1.30) the norm vL V (k) of vL ∈ VL,L0 is equivalent to the 2-vector norm v 2 of the coefficient vector v. For (a) we obtain an arbitrarily small upper bound for the bilinear form with the operator A− A˜L with respect to the norm vL V (k) . Since A is continuous we get an upper bound for the norm of A˜ and therefore for the corresponding 2-matrix-norm. In (b), the bilinear form Av, v corresponds to the symmetric part of the matrix, and the lower bound corresponds to the smallest eigenvalue of the matrix. Since the norm of A − A˜ is arbitrarily small we also get the lower bound for the compressed matrix. In (c), the inf-sup condition (1.69) states that for L ≥ L0 , the solution (k) (k) operator mapping (VL,L0 ) to VL,L0 is bounded by γ. Because of the norm equivalence (1.30), this implies (k)
(k) )−1 2 ≤ Cγ.
(A L For method (M1) with a self-adjoint positive definite operator A, we have that λmax /λmin ≤ C2 /C1 =: κ is bounded independently of L, and obtain for the conjugate gradient iterates error estimates m 2 .
u(m) − u 2 ≤ c 1 − 1/2 κ +1 For method (M2) we obtain
u
(m)
1 m − u 2 ≤ c 1 − κ
for the GMRES from Eisenstat, Elman and Schultz (1983) for the restarted GMRES method (e.g., with restart µ = 1).
328
C. Schwab and C. J. Gittelson
For method (M3) we use the conjugate gradient method with the matrix (k) )H A (k) B := (A L L and need the largest and smallest eigenvalue of this matrix. Now (1.94) := C22 (Cγ)2 states that λmin (B) ≥ (Cγ)−2 > 0. Therefore we have with κ that m 2 (m) − u 2 ≤ c 1 − 1/2 .
u κ +1 Note that the 2-vector norm u 2 of the coefficient vector is equivalent to the norm u V (k) of the corresponding function on D × · · · × D. If we start with initial guess zero we therefore need a number M of iterations proportional to L to have an iteration error which is less than the Galerkin error. However, if we start on the coarsest mesh with initial guess zero, perform M iterations, use this as the starting value on the next-finer mesh, use M iterations, etc., we can avoid this additional factor L. Therefore we have the following complexity result. Proposition 1.27. We can compute an approximation ZLk for Mk u using a fixed number m0 of iterations such that −s/d β
ZLk − Mk V (k) ≤ CNL
L
where β = (k − 1)/2 for a differential operator, β = min{(k − 1)/2, q(s, 0)} with q(s, 0) from (1.90). The total number of operations is O(N (log N )k−1 ) in the case of a differential operator. In the case of an integral operator we need at most O(N (log N )k+1 ) operations. 1.5. Examples: FEM and BEM for the Helmholtz equation To illustrate the above concepts for an indefinite elliptic operator equation, we now consider the Helmholtz equation in a domain G ⊂ Rn with n ≥ 2 and Lipschitz boundary Γ := ∂G. We discuss two ways to solve this equation with stochastic data. First we use the finite element approximation of the differential equation and apply our results for D = G, which is of dimension d = n. Secondly, we consider the boundary integral formulation, which is an integral equation on the boundary Γ. We discretize this equation and then apply our results for D = Γ, which is of dimension d = n − 1. In this case we can also allow exterior domains G as the computation is done on the bounded manifold Γ. To keep the presentation simple we will just consider smooth boundaries and one type of boundary condition (Dirichlet condition for finite elements, Neumann condition for boundary elements). Other boundary conditions and operators can be treated in a similar way.
329
Sparse tensor discretizations for sPDEs
Finite element methods Let G ⊂ Rn be a bounded domain with smooth boundary. We consider the boundary value problem (−∆ − κ2 )u(ω) = f (ω) in G,
u|Γ = 0.
Here we have V = H 1 (G), V = H −1 (G), and the operator A : V → V is defined by ∇u · ∇v − κ2 uv dx, Au, v = G
and obviously satisfies the G˚ arding inequality Au, u ≥ u 2V − (κ2 + 1) u 2L2 (G) . The operator −∆ : V → V has eigenvalues 0 < λ1 < λ2 < · · · which converge to ∞. We need to assume that κ2 is not one of the eigenvalues λj , so that condition (1.13) is satisfied. The spaces for smooth data for s > 0 are Ys = H −1+s (G); the corresponding solution spaces are Xs = H 1+s (G). We assume that the stochastic right-hand side function f (ω) satisfies f ∈ Lk (Ω; Ys ) = Lk (Ω; H −1+s (G)) for some s > 0. Ld The space VL has NL = O(h−d L ) = O(2 ) degrees of freedom and the (k) sparse tensor product space VL,L0 has O(NL (log NL )(k−1) ) degrees of free(k) for dom. For k ≥ 1 the sparse grid Galerkin approximation Z k ∈ V L
L,L0
Mk u using V -orthogonal wavelets, using a total of O(NL (log NL )(k−1) ) operations, satisfies the error estimate (see Remark 1.8 regarding the exponent of the logarithmic terms)
ZLk − Mk u V (k) ≤ chpL | log hL |(k−1)/2 f kLk (Ω;Yp ) provided that f ∈ Lk (Ω; Yp ). Boundary element methods We illustrate the preceding abstract results with the boundary reduction of the stochastic Neumann problem to a boundary integral equation of the first kind. In a bounded domain D ⊂ Rd with Lipschitz boundary Γ = ∂D, we consider (1.95a) (∆ + κ2 )U = 0 in D with wave number κ ∈ C subject to Neumann boundary conditions γ1 U = n · (∇U )|Γ = σ on Γ, where σ ∈ Lk (Ω; H
− 12
(1.95b)
(Γ)) with integer k ≥ 1 are given random boundary
330
C. Schwab and C. J. Gittelson
data, n is the exterior unit normal to Γ, and H s (Γ), |s| ≤ 1, denotes the usual Sobolev spaces on Γ: see, e.g., McLean (2000). We assume in (1.95b) that P-a.s. σ, 1 = 0 (1.96) and, if d = 2, in (1.95a) that diam(D) < 1.
(1.97)
Then problem (1.95) admits a unique solution U ∈ Lk (Ω; H 1 (D)) (Schwab and Todor 2003a, 2003b). For the boundary reduction, we define for v ∈ H 1/2 (Γ) the boundary integral operator ∂ ∂ (W v)(x) = − e(x, y) v(y) dsy (1.98) ∂nx Γ ∂ny with e(x, y) denoting the fundamental solution of −∆ − κ2 . The integral operator W is continuous (e.g., McLean (2000)): 1
1
W : H 2 (Γ) → H − 2 (Γ).
(1.99)
To reduce the stochastic Neumann problem (1.95) to a boundary integral 1 equation with σ ∈ Lk (Ω; H − 2 (Γ)) satisfying (1.96) a.s., we use a representation as double-layer potential R2 : ∂ e(x, y) ϑ(y, ω) dsy , (1.100) U (x, ω) = (R2 ϑ)(x, ω) := − ∂n y y∈Γ where Eϑ satisfies the BIE W 1 Eϑ = Eσ ,
(1.101)
with the hypersingular boundary integral operator W1 u := W u + u, 1. We see that the mean field M1 U can be obtained by solving the deterministic boundary integral equation (1.101). Based on the compression error analysis in Section 1.4, we obtain an approximate solution EϑL ∈ V L in O(NL (log NL )2 ) operations and memory with error bound −(p+1/2)
Eϑ − EϑL H 1/2 (Γ) NL
(log NL )3/2 σ L1 (Ω;H p+1 (Γ)) .
To determine the variance of the random solution U , second moments of ϑ are required. To derive boundary integral equations for them, we use that by Fubini’s theorem, the operator M2 and the layer potential R2 commute. 1 For (1.95) with σ ∈ L2 (Ω; H − 2 (Γ)), we obtain that Cϑ satisfies the BIE 1 1
(W1 ⊗ W1 ) Cϑ = Cσ in H 2 , 2 (Γ × Γ).
(1.102)
Here, the ‘energy’ space V equals H 1/2 (Γ) and A = W1 . The unique solvability of the BIE (1.102) is ensured by the following result.
331
Sparse tensor discretizations for sPDEs
Proposition 1.28. If k = 0, the integral operator W1 ⊗ W1 is coercive, i.e., there exists γ > 0 such that 1 1
∀Cϑ ∈ H 2 , 2 (Γ × Γ) :
(W1 ⊗ W1 )Cϑ , Cϑ ≥ γ Cϑ 2
1 1
H 2 , 2 (Γ×Γ)
.
(1.103)
Proof. We prove (1.103). The operator W1 is self-adjoint and coercive in H 1/2 (Γ) (e.g., N´ed´elec and Planchard (1973), Hsiao and Wendland (1977), 1/2 (Γ)-orthonormal base in McLean (2000)). Let {ui }∞ i=1 denote an H 1/2 H (Γ) consisting of eigenfunctions of W1 . Then, {ui ⊗ uj }∞ i,j=1 is an or1 1
1 1
, , 2 2 (Γ×Γ) and we may represent any Cϑ ∈ H 2 2 (Γ×Γ) thonormal base in H ∞ M in the form Cϑ = i,j=1 cij ui ⊗ uj . For any M < ∞, consider Cϑ = M i,j=1 cij ui ⊗ uj . Then we calculate % & M M
M M cij ui ⊗ uj , c i j u i ⊗ u j (W1 ⊗ W1 )Cϑ , Cϑ = (W1 ⊗ W1 ) i ,j =1
i,j=1
=
M
i,j=1
λi λj c2ij
≥
λ21
M
c2ij = λ21 CϑM 2H 1/2,1/2 (Γ×Γ) .
i,j=1
Passing to the limit M → ∞, we obtain (1.103) with γ = λ21 . We remark that the preceding proof shows that the continuity constant k in the a priori estimate (1.22) is sharp: in general the conditioning of CA the tensorized operator A(k) increases exponentially with k. In the case κ = 0, we use that the integral operator W satisfies a G˚ arding inequality in H 1/2 (Γ) and obtain the unique solvability of the BIE (1.102) for Cϑ from Theorem 1.4, provided that W is injective, i.e., that κ is not a resonance frequency of the interior Dirichlet problem. To compute the second moments of the random solution U (x, ω) at an interior point x ∈ D, we tensorize the representation formula (1.100) to yield (1.104) (M2 U )(x, x) = M2 (R2 ϑ) = (R2 ⊗ R2 )(M2 ϑ). Then we obtain from Theorem 1.25 and from the sparse tensor Galerkin approximation (with spline wavelets which are V -orthogonal between levels) ZL2 of M2 ϑ in O(NL (log NL )3 ) operations and memory an approximation of (M2 U )(x, x) which satisfies, for smooth boundary Γ and data σ ∈ L2 (Ω; Yp+1/2 ) = L2 (Ω; H p+1 (Γ)), at any interior point x ∈ D the error bound (M2 U )(x, x) − R2 ⊗ R2 , ZL2 ≤ c(x)(log NL )3 N −2(p+1/2) σ 2 2 . p+1 L
L (Ω;H
(Γ))
So far, we have considered the discretization of the boundary integral equation (1.102) by multi-level finite elements on the boundary surface Γ where convergence was achieved by mesh refinement.
332
C. Schwab and C. J. Gittelson
We conclude this section with remarks on further developments in the analysis of sparse tensor discretizations of operator equations with random inputs. The results presented in this section are all based on hierarchies of subspaces {V }∞ =0 of V consisting of piecewise polynomial functions of a fixed polynomial degree on a sequence {T }∞ =0 of triangulations of the physical domain. Alternatively, spectral Galerkin discretizations based on sequences of polynomial or trigonometric functions of increasing order can also be considered. For such spaces there are analogous sparse tensor constructions known as ‘hyperbolic cross’ spaces: see, e.g., Temlyakov (1993) for the approximation theory of such spaces and Chernov and Schwab (2009) for an application to Galerkin approximations of boundary integral equations. Also, in the above presentation, we did not consider adaptive refinements in the sparse tensor discretizations. There is, however, a theory of sparse, adaptive tensor discretizations for subspace families satisfying axioms (W1)–(W5) of the present section available in Schwab and Stevenson (2008). As indicated at the beginning of this section, efficient discretization schemes for the tensorized equations (1.23) are also of interest in their own right, as such equations also arise in other models such as turbulence and transport equations. There is, however, one essential difference from (1.23): the equations (1.23) are exact, whereas in the two mentioned applications such equations can only be derived from additional moment closure hypotheses. For example, for PDEs with random operators, a suitable closure hypothesis could be smallness of fluctuations about the inputs’ mean, and neglecting solution fluctuations beyond first order in the inputs’ perturbation amplitude. This so-called first-order second-moment approach was first proposed in Dettinger and Wilson (1981) and was developed, in the context of random domains, in Harbrecht, Schneider and Schwab (2008). The use of quasi-Monte Carlo (QMC) methods for the discretization of stochastic PDEs promises a rate of convergence higher than M −1/2 , which we proved here for MC methods. The numerical analysis of QMC for such problems is currently emerging. We refer to Graham, Kuo, Nuyens, Scheichl and Sloan (2010) and the references therein for algorithms and numerical experiments, as well as for references on QMC.
2. Stochastic Galerkin discretization In Section 1 we considered Galerkin discretizations of k-point correlations of random fields in finite-dimensional spaces which were constructed from sparse tensor products of hierarchies of subspaces used for the approximations of single draws of u. The significance of this approach is twofold. First, for linear operator equations with stochastic data, we showed that k-point correlation functions of the random solutions are in fact solutions of highdimensional deterministic equations for tensorized operators. We showed
Sparse tensor discretizations for sPDEs
333
that these tensorized operator equations naturally afford anistropic regularity results in scales of smoothness spaces of Sobolev or Besov–Triebel– Lizorkin type, so that the efficiency of sparse tensor approximations of kth moments will not incur the curse of dimensionality. In effect, with the formulation of deterministic equations for two- and k-point correlation functions of random solutions, we trade randomness for high-dimensionality. The observation that k-point correlations of random fields satisfy deterministic tensorized operator equations is not new: it has been used frequently, for example in the derivation of moment closures in turbulence modelling or in the transition from atomistic-to-continuum models. For such nonlinear problems, however, there are generally no exact deterministic equations for the k-point correlation functions of the random solution: in general, a ‘closure hypothesis’ in some form is required. Due to the linear dependence of the random solution u on the random input f in (1.11), no closure hypothesis was required in the previous section. While efficient computation of moments of order k ≥ 2 of random solutions may be useful (e.g., if the unknown random field is known a priori to be Gaussian), it is well known that even the knowledge of all k-point correlations will not characterize the law of the random solution if the moment problem is not solvable. In the present section, we therefore address a second approach to the deterministic computation of random fields. It is based on parametrizing the random solution of a PDE with random data in terms of polynomials in a suitable coordinate representation of the random input. After having been pioneered by N. Wiener (1938), who established the representation of functionals of Wiener processes in terms of Hermite polynomials of a countable number of standard normal random variables, this ‘spectral’ view of random fields was shown to be generally applicable to any random field with finite second moments by Cameron and Martin (1947). Its use as a computational tool was pioneered in engineering applications in the 1990s. We mention only the book by Ghanem and Spanos (2007) and the series of papers by Xiu and Karniadakis (2002a), Xiu and Hesthaven (2005), Oden, Babuˇska, Nobile, Feng and Tempone (2005), Babuˇska, Nobile and Tempone (2005, 2007a, 2007b), Nobile, Tempone and Webster (2008a, 2008b), Nobile and Tempone (2009) and the references therein. In these works, it was in particular observed that the expansion in Hermite polynomials of Gaussians originally proposed by Wiener (1938) and by Cameron and Martin (1947) is not always best suited for efficient computations. Often, other (bi)orthogonal function systems are better suited to the law of the random inputs, and are preferable in terms of computational efficiency. This has led to a formal generalization of Wiener’s original polynomial chaos representations for computational purposes by G. E. Karniadakis and collaborators. We refer to Xiu and Karniadakis (2002a) and
334
C. Schwab and C. J. Gittelson
to the survey by Xiu (2009) for further references on various applications of such ‘generalized polynomial chaos’ (GPC) methods. The GPC approaches have received substantial attention in the past few years, both among numerical analysts and among computational scientists and engineers. From a computational point of view, the spectral representation once more renders the stochastic problem deterministic: rather than focusing on computation of spatiotemporal two- and k-point correlation functions, the law of the unknown random solution is approximated and computed in a parametric form. As we shall see shortly, in this context questions of approximation and computation of deterministic quantities in infinite dimensions arise naturally. In this section, we present the mathematical formulation of generalized polynomial chaos representations of the laws of random solutions, starting with expansions into Hermite polynomials of Gaussians. Since the abovementioned pioneering works of Wiener and of Cameron and Martin, these expansions have found numerous applications in stochastic analysis. We then focus on elliptic problems with random diffusion coefficients, where expansions into polynomials of countably many non-Gaussian random variables are of interest. We present several particular instances of such generalized polynomials chaos expansions, in particular the Wiener–Itˆ o decomposition of random fields, and the Karhunen–Lo`eve expansions, and review recent work on the regularity of solutions of infinite-dimensional parametric, deterministic equations in Section 3. Despite the formally infinite-dimensional setting, we review recent results that indicate that solutions of the infinite-dimensional parametric, deterministic equations for the laws of solutions of sPDEs exhibit regularity properties that allow finite-dimensional approximations free from the curse of dimensionality. We then address several adaptive strategies for the concrete construction of numerical approximations of such finitedimensional approximations. We exhibit in particular sufficient conditions for convergence rates which are larger than the rate 1/2 proved in Theorem 1.11 above for MC methods. 2.1. Hermite chaos Let H be a separable Hilbert space over R and let µ = NQ be a nondegenerate centred Gaussian measure on H. For convenience, we assume that H is infinite-dimensional; all of the following also applies in the finitedimensional setting. Product structure of Gaussian measures Let (em )m∈N be an orthonormal basis of H such that Qem = λm em ,
m ∈ N,
(2.1)
335
Sparse tensor discretizations for sPDEs
for a positive decreasing sequence (λm )m∈N . Note that (2.1) implies em ∈ Q1/2 (H). We define a sequence of random variables on (H, µ) by Ym (x) := Wem (x) = x, Q−1/2 em H = λ−1/2 x, em H , m
m ∈ N.
(2.2)
Lemma 2.1. The random variables (Ym )m∈N on (H, µ) are independent and identically distributed. The distribution of each Ym is the standard Gaussian measure N1 on R. Proof. This is a consequence of Proposition C.36. We give, in addition, a direct proof. Let I be an arbitrary finite subset of N with n := #I, and YI : H → Rn ,
x → (Ym (x))m∈I .
By the change of variables formula for Gaussian measures, the distribution of YI is the centred Gaussian measure (YI )# µ = NYI QYI∗ on Rn , where YI∗ : Rn → H is the adjoint of YI given by
YI∗ (ξ) = ξm Q−1/2 em , ξ = (ξm )m∈I ∈ Rn . m∈I
Since (em )m∈N is an orthonormal basis of H, for all ξ = (ξm )m∈I ∈ Rn , ! " ! "
∗ −1/2 1/2 YI QYI (ξ) = YI Q ξm Q em = Y I ξm Q em ! =
m∈I
m∈I
"
ξm Q1/2 em , Q−1/2 em H
= ξ. m ∈I
m∈I
Therefore, (YI )# µ = NI n =
'
N1 ,
m∈I
where I n is the identity matrix on Rn . By Lemma 2.1, the distribution of the injective map Y : H → R∞ ,
x → (Ym (x))m∈N
is the countable product measure γ := Y# µ =
'
N1
(2.3)
(2.4)
m∈N
on the Borel σ-algebra B(R∞ ). Proposition 2.2.
The pullback
Y ∗ : L2 (R∞ , B(R∞ ), γ) → L2 (H, µ),
f → Y ∗ f = f ◦ Y
(2.5)
336
C. Schwab and C. J. Gittelson
is an isometric isomorphism of Hilbert spaces. Since γ = Y# µ, for all f ∈ L2 (R∞ , B(R∞ ), γ), ∗ 2 2 f (Y (x)) µ(dx) = f (y)γ(dy) = f 2L2 (R∞ ,B(R∞ ),γ) ,
Y f L2 (H,µ) =
Proof.
R∞
H
so Y ∗ is an isometry. To show surjectivity, note that the Borel σ-algebra B(H) is generated by Y since H is separable and the topology of H is generated by Y . Therefore, the Doob–Dynkin lemma implies that any g ∈ L2 (H, µ) is of the form g = f ◦ Y for a B(R∞ )-measurable function f on R∞ . The above computation implies f ∈ L2 (R∞ , B(R∞ ), γ). The Hermite polynomial basis Consider the analytic function 1 2 +tξ
F (t, ξ) := e− 2 t
t, ξ ∈ R.
,
(2.6)
We define the Hermite polynomials (Hn )n∈N0 through the power series representation of F (·, ξ) around t = 0, ∞
tn √ Hn (ξ), F (t, ξ) = n! n=0
t, ξ ∈ R.
(2.7)
Lemma 2.3. For all n ∈ N0 and ξ ∈ R, if H−1 (ξ) := 0, 1 2 (−1)n 1 2 Hn (ξ) = √ e 2 ξ Dξn e− 2 ξ , n! √ √ ξHn (ξ) = n + 1Hn+1 (ξ) + nHn−1 (ξ), √ Dξ Hn (ξ) = nHn−1 (ξ),
−Dξ2 Hn (ξ) + ξDξ Hn (ξ) = nHn (ξ). Proof.
1 2
1
2
1 2
∞ n
t n=0
1 2
= e2ξ
∞ n
t n=0
n!
(2.9) (2.10) (2.11)
Equation (2.8) follows by Taylor expansion, F (t, ξ) = e 2 ξ e− 2 (t−ξ) = e 2 ξ
(2.8)
n!
1
Dtn |t=0 e− 2 (t−ξ)
2
1 2
(−1)n Dξn e− 2 ξ ,
and comparison with (2.7). To show (2.9), we note that ∞ √ ∞
n tn−1 tn √ ( √ Hn (ξ) = n + 1Hn+1 (ξ). Dt F (t, ξ) = n! (n − 1)! n=1 n=0
337
Sparse tensor discretizations for sPDEs
Also, by (2.6), Dt F (t, ξ) = (ξ − t)F (t, ξ) =
∞ ∞
tn tn √ √ ξHn (ξ) − √ nHn−1 (ξ). n! n! n=0 n=0
Similarly, (2.10) follows by comparing two representations of Dξ F (t, ξ), ∞ ∞
tn tn √ √ Dξ Hn (ξ) = Dξ F (t, ξ) = tF (t, ξ) = √ nHn−1 (ξ). n! n! n=0 n=0
Finally, (2.11) is a consequence of (2.9) and (2.10), √ Dξ2 Hn (ξ) − ξDξ Hn (ξ) = n(Dξ Hn−1 (ξ) − ξHn−1 (ξ)) = −nHn (ξ). In particular, Hn is a polynomial of degree n. The first few Hermite polynomials are H0 (ξ) = 1, Proposition 2.4. Proof.
H1 (ξ) = ξ,
1 H2 (ξ) = √ (ξ 2 − 1). 2
(2.12)
(Hn )n∈N0 is an orthonormal basis of L2 (R, N1 ).
We first show orthonormality. Note that for ξ, s, t ∈ R, 1
e− 2 (t
2 +s2 )+ξ(t+s)
= F (t, ξ)F (s, ξ) =
∞
tn s m √ √ Hn (ξ)Hm (ξ). n! m! n,m=0
Integrating over R with respect to N1 , we have ∞
tn s m √ √ F (t, ξ)F (s, ξ)N1 (dξ) = Hn (ξ)Hm (ξ)N1 (dξ), n! m! R R n,m=0 and also ∞ ∞ n n
1 ets t s 2 . F (t, ξ)F (s, ξ)N1 (dξ) = √ e− 2 (ξ−t−s) dξ = ets = n! 2π −∞ R n=0 Therefore,
R
Hn (ξ)Hm (ξ)N1 (dξ) = δnm .
To show completeness, let f ∈ L2 (R, N1 ) be orthogonal to Hn for all 2 n ∈ N0 . Then g(ξ) := f (ξ)e−ξ /4 is in L2 (R), and for all t ∈ R, ∞ 1 2 1 2 1 f (ξ)F (t, ξ)N1 (dξ) = √ g(ξ)e− 2 t +tξ− 4 ξ dξ. 0= 2π −∞ R Since − 12 t2 + tξ − 14 ξ 2 = − 14 (2t − ξ)2 + 12 t2 , this implies that the convolution 2 g ∗ ϕ = 0 for ϕ(ξ) := e−ξ /4 . Taking the Fourier transform, we have gϕ = 0,
338
C. Schwab and C. J. Gittelson
and since ϕ is non-zero everywhere, g = 0 in L2 (R). This implies g = 0 almost everywhere, and therefore f = 0 almost everywhere. Using Theorem 2.12 below and Proposition 2.2, we construct an orthonormal basis of L2 (H, µ). Define the index set of finitely supported sequences in N, F := {ν ∈ NN 0 ; # supp ν < ∞},
(2.13)
where supp ν := {m ∈ N ; νm = 0},
ν ∈ NN 0.
For all ν ∈ F, we define the tensor product Hermite polynomial ' Hν := Hνm ,
(2.14)
(2.15)
m∈N
i.e., for all y ∈ R∞ , since H0 (ξ) = 1, ) Hν (y) = Hνm (ym ) =
)
Hνm (ym ).
(2.16)
m∈supp ν
m∈N
The degree of the polynomial Hν for ν ∈ F is given by
νm = νm . |ν| := m∈N
(2.17)
m∈supp ν
We use the pullback Y ∗ from (2.5) to define Hν on H. For all x ∈ H and ν ∈ F, ) Hνm (Wem (x)). (2.18) Hν (x) := (Y ∗ Hν )(x) = Hν (Y (x)) = m∈N
As in (2.16), the product in (2.18) is finite, since all but finitely many factors are one by definition of F and H0 (ξ) = 1. Theorem 2.5. (Hν )ν∈F is an orthonormal basis of L2 (H, µ). Proof. By Proposition 2.4 and Theorem 2.12 below, (Hν )ν∈F from (2.15) is an orthonormal basis of L2 (R∞ , B(R∞ ), γ). Since the pullback Y ∗ is an isometric isomorphism from L2 (R∞ , B(R∞ ), γ) to L2 (H, µ) by Proposition 2.2, (Hν )ν∈F from (2.18) is an orthonormal basis of L2 (H, µ). We call (Hν )ν∈F the Hermite chaos basis of L2 (H, µ). Wiener–Itˆ o decomposition For all n ∈ N0 , we define the Wiener chaos of order n as the closed subspace L2n (H, µ) := span {Hn (Wf (x)) ; f ∈ H, f H = 1} ⊂ L2 (H, µ),
(2.19)
339
Sparse tensor discretizations for sPDEs
where the white noise map Wf is defined by (C.52) and continuous extension to H. We recall the identity 1 2 eWf (x) µ(dx) = e 2 f H ∀f ∈ H (2.20) H
from Proposition C.36. Lemma 2.6.
For all f, g ∈ H with f H = g H = 1 and all n, m ∈ N0 , H
Hn (Wf (x))Hm (Wg (x))µ(dx) = δnm f, gnH .
(2.21)
As in the proof of Proposition 2.4, for t, s ∈ R, ∞
tn s m √ √ F (t, Wf )F (s, Wg ) dµ = Hn (Wf )Hm (Wg ) dµ, n! m! H H n,m=0
Proof.
1
2
2
and also, using (2.20) and F (t, Wf )F (s, Wg ) = e− 2 (t +s )+tWf +sWg , 1 2 1 2 1 2 2 2 F (t, Wf )F (s, Wg ) dµ = e− 2 (t +s ) eWtf +sg dµ = e− 2 (t +s ) e 2 tf +sg H H
H
= ets f,gH =
∞ n n
t s n=0
n!
f, gnH .
Theorem 2.7. (Wiener–Itˆ o decomposition) L2 (H, µ) = L2n (H, µ).
(2.22)
n∈N0
Proof. Orthogonality of the spaces L2n (H, µ) follows from Lemma 2.6. It remains to be shown that these spaces span L2 (H, µ). Let g ∈ L2 (H, µ) be orthogonal to Hn (Wf ) for all n ∈ N0 and all f ∈ H with f H = 1. Then, for all t ∈ R and any f ∈ H with f H = 1, − 21 t2 F (t, Wf )g dµ = e etWf g dµ. 0= H
H
Consequently, the entire function
etWf g dµ
ϕ(t) := H
vanishes on R, and thus is equal to 0 on C. Let ϑ be the signed measure dϑ = g dµ. An arbitrary element h ∈ H is of the form h = tQ−1/2 f for an f ∈ Q1/2 (H) with f H = 1 and some t ∈ R. The Fourier transform of ϑ evaluated at h is i x,tQ−1/2 f H e g(x)µ(dx) = eitWf g dµ = ϕ(it) = 0. ϑ(h) = H
H
340
C. Schwab and C. J. Gittelson
Therefore, ϑ = 0 and it follows that g = 0 almost everywhere. The following proposition describes the connection between the Wiener– Itˆo decomposition (2.22) and the Hermite chaos basis (Hν )ν∈F of L2 (H, µ) from Theorem 2.5. For all n ∈ N0 ,
Proposition 2.8.
Proof.
L2n (H, µ) = span {Hν (x) ; ν ∈ F, |ν| = n}.
(2.23)
It suffices to show that for n ∈ N0 and ν ∈ F with |ν| = n, Hν (x)Hn (Wf (x))µ(dx) = 0 ∀f ∈ H : f H = 1.
(2.24)
H
Then the inclusions ‘⊂’ and ‘⊃’ follow from Theorem 2.5 and Theorem 2.7, respectively. Let f ∈ H with f H = 1. Since supp ν is finite for ν ∈ F, there is an N ∈ N0 with νi = 0 for all i ≥ N + 1. In particular, Hν (x) = Hν1 (We1 (x))Hν2 (We2 (x)) · · · HνN (WeN (x)),
x ∈ H.
For t1 , . . . , tN +1 ∈ R, we compute F (t1 , We1 ) · · · F (tN , WeN )F (tN +1 , Wf ) dµ I := H
twice. Using (2.6), linearity of W and (2.20), we have − 12 (t21 +···+t2N +1 ) I=e eWt1 e1 +···+tN eN +tN +1 f dµ H
=e
− 12 (t21 +···+t2N +1 )
e
1 t e +···+tN eN +tN +1 f 2H 2 1 1
.
Abbreviating fi := f, ei H , i ∈ N, since f12 + f22 + · · · = f 2H = 1,
t1 e1 + · · · + tN eN + tN +1 f 2H 2 2 = (t1 + tN +1 f1 )2 + · · · + (tN + tN +1 fN )2 + t2N +1 (fN +1 + fN +2 + · · · )
= t21 + · · · + t2N + 2tN +1 (t1 f1 + · · · + tN fN ) + t2N +1 . Since the quadratic terms cancel, we are left with I=e
tN +1 (t1 f1 +···+tN fN )
=
∞ n
tN +1 (t1 f1 + · · · + tN fN )n n=0
n!
.
Also, (2.7) implies I=
∞
k1 ,...,kN +1
k
+1 tk1 · · · tNN+1 (1 k1 ! · · · kN +1 ! =0
H
Hk1 (We1 ) · · · HkN (WeN )HkN +1 (Wf ) dµ.
Comparing the last two equations leads to (2.24).
341
Sparse tensor discretizations for sPDEs
2.2. Generalized polynomial chaos The construction of an orthonormal basis in Section 2.1 is not specific to Gaussian measures or Hermite polynomials. The important ingredient is the countable product structure of the probability space (H, µ), which we illustrated by the measure-preserving map Y into the product measure space (R∞ , B(R∞ ), γ). We generalize the construction of the chaos basis to countable products of arbitrary probability spaces. Again, all of the following also holds for finite products with the obvious modifications; to simplify notation, we consider only the countable case. We refer to Gittelson (2011a) for further details and a more general construction. Countable products of probability spaces For all m ∈ N, let Γm be an arbitrary non-empty set, endowed with a σalgebra Σm . Let (Ym )m∈N be independent random variables on a probability space (Ω, Σ, P), such that Ym maps into (Γm , Σm ). This sequence constitutes a map ) Γm , ω → (Ym (ω))m∈N , (2.25) Y : Ω → Γ := m∈N
* which is measurable with respect to the product σ-algebra Σ := m∈N Σm on Γ. By the independence of (Ym )m∈N , the distribution of Y is the countable product probability measure ' µm (2.26) µ := m∈N
on (Γ, Σ), where µm = (Ym )# (P) is the distribution of Ym on (Γm , Σm ). Countable product bases For all m ∈ N, let (ϕm,i )i∈N0 be an orthonormal basis of L2 (Γm , Σm , µm ) such that ϕm,0 = 1; the constant 1 is normalized in L2 (Γm , Σm , µm ) since µm is a probability measure. As in Section 2.1, we define the index set F := {ν ∈ NN 0 ; # supp ν < ∞}.
(2.27)
If L2 (Γm , Σm , µm ) is finite-dimensional for some m, then of course its orthonormal basis (ϕm,i )N i=0 is finite, and we restrict νm to the values 0, 1, . . . , N in the definition of F. For all ν ∈ F, define the tensor product ' ϕm,νm , (2.28) ϕν := m∈N
i.e., for all y = (ym )m∈N ∈ Γ, since ϕm,0 = 1 for all m ∈ N, ) ) ϕν (y) = ϕm,νm (ym ) = ϕm,νm (ym ). m∈N
m∈supp ν
(2.29)
342
C. Schwab and C. J. Gittelson
Let F(N) denote the set of all finite subsets of N. For I ∈ F(N), define the finite product σ-algebra ' Σm = σ(ym ; m ∈ I) ⊂ Σ. (2.30) ΣI := m∈I
A function is ΣI -measurable if it is Σ-measurable and only depends on (ym )m∈I . Also, let FI := {ν ∈ F ; supp ν ⊂ I}. Lemma 2.9. For all I ∈ F(N), the set (ϕν )ν∈FI is an orthonormal basis of L2 (Γ, ΣI , µ). Proof.
Since ϕm,0 = 1 for all m ∈ N, if supp ν ⊂ I, then ) ) ϕm,νm (ym ) = ϕm,νm (ym ), y ∈ Γ. ϕν (y) = m∈I
m∈N
Due to the assumption that I is finite, ' L2 (Γm , Σm , µm ). L2 (Γ, ΣI , µ) ∼ = m∈I
As (ϕm,i )i∈N is an orthonormal basis of L2 (Γm , Σm , µm ) for each m ∈ I by assumption, the claim follows since finite tensor products of orthonormal bases form an orthonormal basis in the product space. The monotone class theorem implies that any function in L2 (Γ, Σ, µ) can be approximated by ΣI -measurable functions with I ∈ F(N). We recall that a set M of real-valued functions on Γ is multiplicative if vw ∈ M whenever v, w ∈ M. A monotone vector space over Γ is a real vector space H of bounded, real-valued functions on Γ such that all constants are in H, and if (vn )n∈N is a sequence in H with 0 ≤ vn ≤ vn+1 for all n ∈ N and v := supn vn is a bounded function on Γ, then v ∈ H. Theorem 2.10. (monotone class theorem) Let M be a multiplicative class of bounded, real-valued functions on Γ and let H be a monotone vector space containing M. Then H contains all bounded σ(M)-measurable functions. We refer to Protter (2005, Theorem I.8) for a proof of Theorem 2.10. 2 2 Proposition 2.11. I∈F (N) L (Γ, ΣI , µ) is dense in L (Γ, Σ, µ). Proof. Let V := I∈F (N) L2 (Γ, ΣI , µ) ⊂ L2 (Γ, Σ, µ) and define H := V ∩ L∞ (Γ, Σ, µ) as the vector space of bounded functions in V. Let M be the set of indicator functions in L2 (Γ, ΣI , µ) for any I ∈ F(N). Then M ⊂ H, 1 ∈ H, and M is closed under multiplication. Let 0 ≤ v1 ≤ v2 ≤ · · · be a pointwise monotonic sequence in H and v := supn vn its pointwise supremum. If v ∈ L∞ (Γ, Σ, µ) ⊂ L2 (Γ, Σ, µ), then (vn )n converges to v
343
Sparse tensor discretizations for sPDEs
in L2 (Γ, Σ, µ) by dominated convergence. Since V is closed in L2 (Γ, Σ, µ), it follows that v ∈ V and therefore v ∈ H. Thus H is a monotone vector space and, using that Σ = σ(M) is the σ-algebra generated by M, the monotone class theorem implies H = L∞ (Γ, Σ, µ). If v ∈ L2 (Γ, Σ, µ), then for any N ∈ N, v1{|v|≤N } ∈ L∞ (Γ, Σ, µ) = H ⊂ V and v ∈ V by dominated convergence. (ϕν )ν∈F is an orthonormal basis of L2 (Γ, Σ, µ).
Theorem 2.12. Proof.
Orthonormality follows from Lemma 2.9 since, for any ν, ν ∈ F, I := supp ν ∪ supp ν ∈ F(N).
Density follows from Proposition 2.11 since (ϕν )ν∈FI spans L2 (Γ, ΣI , µ) for all I ∈ F(N). Let (ϕm,i )i∈N0 be a graded basis of L2 (Γm , Σm , µm ) for each m ∈ N, i.e., there is a map m : N0 → N0 assigning to each index i ∈ N0 a level (i). This might be the degree of a polynomial, or the level of a wavelet, depending on (ϕm,i )i∈N0 . We assume that m (0) = 0 for all m ∈ N. This allows us to define a grading function for the orthonormal basis (ϕν )ν∈F of L2 (Γ, Σ, µ) by
m (νm ) = m (νm ), ν ∈ F. (2.31) (ν) := m∈suppν
m∈N
This function induces a decomposition of L2 (Γ, Σ, µ) into the closed subspaces L2n (Γ, Σ, µ) := span {ϕν ; ν ∈ F, (ν) = n} ⊂ L2 (Γ, Σ, µ), Corollary 2.13. L2 (Γ, Σ, µ) =
n ∈ N0 . (2.32)
L2n (Γ, Σ, µ).
(2.33)
n∈N0
Proof.
By Theorem 2.12 and (2.32), span ϕν = span ϕν = L2n (Γ, Σ, µ). L2 (Γ, Σ, µ) = ν∈F
n∈N0 (ν)=n
n∈N0
We note that other choices of are possible. For example, the dimensions m ∈ N can be weighted differently, leading to an anisotropic decomposition. Also, the 1 -norm in (2.32) can be generalized to an arbitrary p -quasi-norm for any p > 0. Rounding the final value ensures that maps into N0 . Orthogonal polynomials We assume that Γm is a Borel subset of R and that µm has finite moments Mn := ξ n µm (dξ), n ∈ N0 . (2.34) Γm
344
C. Schwab and C. J. Gittelson
Orthonormal polynomials with respect to µm can be constructed by the well-known three-term recursion βn+1 Pn+1 (ξ) = (ξ − αn )Pn (ξ) − βn Pn−1 (ξ),
n ∈ N0 ,
(2.35)
with the initialization P−1 (ξ) = 0 and P0 (ξ) = 1. The coefficients are cn−1 ξPn (ξ)2 µm (dξ) and βn := , (2.36) αn := cn Γm where cn is the leading coefficient of Pn , and β0 := 1. The values of (αn )n∈N0 and (βn )n∈N0 are tabulated for many common distributions µm (Gautschi 2004). Formula (2.35) can be derived by Gram–Schmidt orthogonalization of the monomials (ξ n )n∈N0 . Note that βn+1 depends on Pn+1 , and can be computed by normalizing the right-hand side of (2.35) in L2 (Γm , Σm , µm ). Lemma 2.14. For all n ∈ N0 , Pn is a polynomial of degree n if n < N := dim L2 (Γm , Σm , µm ) and zero otherwise. The sequence (Pn )n∈N0 (resp. N −1 if N is finite) is orthonormal in L2 (Γm , Σm , µm ). (Pn )n=0 Proof. By the Gram–Schmidt orthogonalization process applied to the monomials (ξ n )n∈N0 , µm -orthonormal polynomials (Pn )n∈N exist. If N is N −1 is a basis of L2 (Γm , Σm , µm ), and thus Pn = 0 for all finite, then (ξ n )n=0 n ≥ N . We show that the orthonormal polynomials constructed by Gram– Schmidt orthogonalization satisfy (2.35). Note that βn+1 Pn+1 (ξ) − ξPn (ξ) is a polynomial of degree at most n. Therefore, and since (Pk )n+1 k=0 are orthonormal, βn+1 Pn+1 (ξ) − ξPn (ξ) = γn Pn (ξ) + γn−1 Pn−1 (ξ) + · · · + γ0 with
(βn+1 Pn+1 (ξ) − ξPn (ξ))Pk (ξ)µm (dξ) = −
γk = Γm
ξPn (ξ)Pk (ξ)µm (dξ) Γm
for k = 0, 1, . . . , n. In particular, γn = −αn , and γk = 0 for k ≤ n − 2 since ξPk (ξ) is a polynomial of degree at most n − 1. We note that ξPn−1 (ξ) = βn Pn (ξ) + q(ξ) for a polynomial q of degree at most n − 1. This implies γn−1 = −βn . If N = dim L2 (Γm , Σm , µm ) is finite, then it follows from Lemma 2.14 N −1 is an orthonormal basis of L2 (Γm , Σm , µm ). In general, this that (Pn )n=0 requires an additional assumption. We consider the case N = ∞ in the following. The measure µm is called determinate if it is uniquely characterized by its moments (Mn )n∈N0 ⊂ R. We note that µm is always determinate if Γm ⊂ R is bounded (Gautschi 2004, Theorem 1.41). The following result was shown by F. Riesz in 1923 (see, e.g., Szeg˝ o (1975) for a proof).
345
Sparse tensor discretizations for sPDEs
Proposition 2.15. If µm is determinate, then (Pn )n∈N0 is an orthonormal basis of L2 (Γm , Σm , µm ). Examples of generalized polynomial chaos bases We combine Theorem 2.12 with Proposition 2.15 to construct a countable tensor product basis of L2 (Γ, Σ, µ). Again, we assume for simplicity that L2 (Γm , Σm , µm ) is infinite-dimensional for all m ∈ N. Analogous results hold in the general setting. For all m ∈ N, let (Pnm )n∈N0 be the orthonormal polynomial basis of 2 L (Γm , Σm , µm ) from Proposition 2.15. Then, by Theorem 2.12, the tensor product polynomials ' Pνmm , ν ∈ F, (2.37) Pν := m∈N
form an orthonormal basis of L2 (Γ, Σ, µ), which we call the generalized polynomial chaos basis. If µm = N1 for all m ∈ N, then (Pnm )n∈N0 are the Hermite polynomials (2.8) and (Pν )ν∈F is the Hermite chaos basis, interpreted as a basis of L2 (R∞ , B(R∞ ), γ) instead of L2 (H, µ). In this case, Corollary 2.13 reduces to the Wiener–Itˆ o decomposition, Theorem 2.7, due to Proposition 2.8. We consider as another example the case when µm is the uniform distribution on Γm := [−1, 1] for all m ∈ N, i.e., µm (dξ) = 12 dξ. The corresponding orthonormal polynomials are the Legendre polynomials, which are defined by the three-term recursion √
n n+1 √ √ Ln+1 (ξ) = ξLn (ξ) − √ Ln−1 (ξ), 2n + 3 2n + 1 2n + 1 2n − 1
n ∈ N0 ,
(2.38) with L−1 (ξ) = 0 and L0 (ξ) = 1. The Legendre polynomials satisfy Rodrigues’ formula √ 2n + 1 dn 2 (ξ − 1)n , n ∈ N0 . (2.39) Ln (ξ) = 2n n! dξ n The first few Legendre polynomials are √
√
5 2 (3ξ − 1). (2.40) 2 The tensor product Legendre polynomials Lν are defined as in (2.37) for ν ∈ F. In this case, the measure space (Γ, Σ, µ) is a countable product of identical factors ([−1, 1], B([−1, 1]), 12 dξ), ' Γ = [−1, 1]∞ , Σ = B([−1, 1])∞ = B([−1, 1]∞ ), µ = µm , (2.41) L0 (ξ) = 1,
L1 (ξ) =
3 ξ,
L2 (ξ) =
m∈N
346
C. Schwab and C. J. Gittelson
with µm (dξ) = 12 dξ for all m ∈ N. Note that even though each µm is absolutely continuous with respect to the Lebesgue measure, i.e., it has a density, the product of these densities is zero. Also, the countable product of the Lebesgue measure on [−1, 1] is not well-defined since the factors are not normalized. Thus µ cannot be defined via a density function. Corollary 2.16. The tensor product Legendre polynomials (Lν )ν∈F form an orthonormal basis of L2 ([−1, 1]∞ , B([−1, 1]∞ ), µ). Proof.
The claim follows from Theorem 2.12 and Proposition 2.15.
We shall refer to (Lν )ν∈F as the Legendre chaos basis. 2.3. PDEs with uniform stochastic parameters Parametric and stochastic operators Let V be a separable real Hilbert space with dual V , and let ·, · denote the (V , V )-duality pairing. We consider operator equations of the form Au = f,
(2.42)
with f ∈ V and A ∈ L(V, V ) a bounded linear operator from V to V . If A is boundedly invertible, then (2.42) has the unique solution u = A−1 f . Let Γ be a topological space. A parametric operator from V to V is given by a continuous map (2.43) A : Γ → L(V, V ). We assume that A(y) is boundedly invertible for all y ∈ Γ, and consider the parametric operator equation A(y)u(y) = f (y)
∀y ∈ Γ
(2.44)
for a map f : Γ → V . Proposition 2.17. Equation (2.44) has a unique solution u : Γ → V . It is continuous if and only if f : Γ → V is continuous. Proof. Since A(y) is boundedly invertible for all y ∈ Γ, (2.44) has the unique solution u(y) = A(y)−1 f (y). If u is continuous in y, then f (y) = A(y)u(y) is also continuous in y, since A is continuous by definition and application of an operator to a vector is continuous on L(V, V ) × V . Furthermore, the map y → A(y)−1 is continuous as a consequence of the abstract property (Kadison and Ringrose 1997, Proposition 3.1.6) of Banach algebras, so continuity of u follows from continuity of f by the same argument as above. We derive a weak formulation of (2.44) in the parameter y under the additional assumptions that A(y) is symmetric positive definite for all y ∈ Γ,
Sparse tensor discretizations for sPDEs
347
and there exist constants c and cˇ such that
A(y)−1 V →V ≤ cˇ ∀y ∈ Γ,
A(y) V →V ≤ c,
(2.45)
i.e., the bilinear form V A(y)·, ·V is a scalar product on V that induces a norm equivalent to · V . The estimates (2.45) always hold if Γ is compact. Let µ be a probability measure on the Borel-measurable space (Γ, B(Γ)). Then the operator A(y) becomes stochastic in the sense that it depends on a parameter y in a probability space (Γ, B(Γ), µ). Similarly, f is a random variable on Γ with values in V . We assume f ∈ L2 (Γ, µ; V ).
(2.46)
Multiplying (2.44) by a test function v : Γ → V and integrating over Γ, we formally derive the linear variational problem A(y)u(y), v(y)µ(dy) = f (y), v(y)µ(dy) (2.47) Γ
Γ
as the weak formulation of (2.44). By (2.45) and (2.46), both integrals are well-defined if v ∈ L2 (Γ, µ; V ). Theorem 2.18. Under the conditions (2.45) and (2.46), the solution u of (2.44) is the unique element of L2 (Γ, µ; V ) satisfying (2.47) for all v ∈ L2 (Γ, µ; V ). Furthermore,
u L2 (Γ,µ;V ) ≤ cˇ f L2 (Γ,µ;V ) .
(2.48)
Proof. We first show that there is a unique u ∈ L2 (Γ, µ; V ) such that A(y) u(y), v(y)µ(dy) = f (y), v(y)µ(dy) ∀v ∈ L2 (Γ, µ; V ). (∗) Γ
Γ
By Cauchy–Schwarz and (2.45), for all v, w ∈ L2 (Γ, µ; V ), A(y)w(y), v(y)µ(dy) ≤ c w(y) V v(y) V µ(dy) Γ
Γ
≤ c v L2 (Γ,µ;V ) w L2 (Γ,µ;V ) . Let R : V → V denote the Riesz isomorphism. By positivity of A(y), there is a unique positive √ S(y) ∈ L(V ) such that A(y) = RS(y)S(y) for all c. Furthermore, S(y) is invertible for all y ∈ Γ and y ∈ Γ, and S(y)
≤ √
S(y)−1 ≤ cˇ. Consequently, for all v ∈ L2 (Γ, µ; V ), A(y)v(y), v(y)µ(dy) = S(y)v(y) 2V µ(dy) ≥ cˇ−1 v 2L2 (Γ,µ;V ) . Γ
Γ
Similarly, by Cauchy–Schwarz, f (y), v(y)µ(dy) ≤ f L2 (Γ,µ;V ) v L2 (Γ,µ;V ) Γ
348
C. Schwab and C. J. Gittelson
for all v ∈ L2 (Γ, µ; V ). The Lax–Milgram lemma implies existence and uniqueness of the solution u of (∗), and (2.48) for u . By (∗) with v(y) = v0 1E (y) for v0 ∈ V and E ∈ B(Γ), A(y) u(y) − f (y), v0 µ(dy) = 0. E
Since this holds for all measurable sets E, the integrand is 0 a.e. in Γ for satisfies (2.44) for µ-a.e. y ∈ Γ. This implies any v0 ∈ V , and therefore u u = u in L2 (Γ, µ; V ). Remark 2.19. (tensor product structure) For any separable Hilbert space X, the Lebesgue–Bochner space L2 (Γ, µ; X) is isometrically isomorphic to the Hilbert tensor product L2 (Γ, µ) ⊗ X. In particular, the solution u of (2.45) can be interpreted as an element of L2 (Γ, µ) ⊗ V , and f can be seen as an element of L2 (Γ, µ) ⊗ V . Theorem 2.18 implies that the stochastic operator A induces an isomorphism between L2 (Γ, µ) ⊗ V and L2 (Γ, µ) ⊗ V , whose inverse maps f onto u. The diffusion equation with a stochastic diffusion coefficient Let D be a bounded Lipschitz domain in Rd , and (Ω, Σ, P) a probability space. We consider as a model problem the isotropic diffusion equation on D with a stochastic diffusion coefficient and, for simplicity, homogeneous Dirichlet boundary conditions, −∇ · a(ω, x)∇U (ω, x) = f (x), x ∈ D, ω ∈ Ω, (2.49) U (ω, x) = 0, x ∈ ∂D, ω ∈ Ω. The differential operators in (2.49) are understood with respect to the physical variable x ∈ D. We assume there are constants a− and a+ such that 0 < a− ≤ a(ω, x) ≤ a+ < ∞ ∀x ∈ D, ∀ω ∈ Ω.
(2.50)
Furthermore, we select some deterministic approximation a ¯ ∈ L∞ (D) to the stochastic diffusion coefficient a(·, ·). For example, a ¯ could be the mean field, a(ω, x) P(dω),
a ¯(x) :=
x ∈ D,
(2.51)
Ω
√ ¯ := a+ a− or a ¯ := 1. or simply a constant such as a ¯ := (a+ + a− )/2, a We consider a series expansion of the difference a(ω, x) − a ¯(x). Let ∞ 2 (ϕm )m∈N ⊂ L (D) be a biorthogonal basis of L (D) with associated dual basis (ϕ m )m∈N ⊂ L2 (D), i.e., n L2 (D) = δmn ϕm , ϕ
∀m, n ∈ N,
(2.52)
349
Sparse tensor discretizations for sPDEs
and v=
∞
v, ϕ m L2 (D) ϕm
∀v ∈ L2 (D),
(2.53)
m=1
with unconditional convergence in L2 (D). For a positive sequence (αm )m∈N , to be determined below, we define the random variables 1 (a(ω, x) − a ¯(x))ϕ m (x) dx, m ∈ N. (2.54) Ym (ω) := αm D By (2.53), for all ω ∈ Ω, a(ω, x) = a ¯(x) +
∞
Ym (ω)αm ϕm (x),
(2.55)
m=1
with unconditional convergence in L2 (D). Lemma 2.20. There is a positive sequence (αm )m∈N such that Ym (ω) ∈ [−1, 1] for all ω ∈ Ω and all m ∈ N. Proof.
By H¨older’s inequality, (a(ω, x) − a ¯(x))ϕ m (x) dx ≤ a(ω, ·) − a m L1 (D) . ¯ L∞ (D) ϕ D
Due to (2.50), the first term is bounded independently of ω, and we can choose ¯ L∞ (D) ϕ m L1 (D) . αm := sup a(ω, ·) − a ω∈Ω
Motivated by Lemma 2.20, we define as a parameter domain the compact topological space ∞ ) [−1, 1]. (2.56) Γ := [−1, 1]∞ = m=1
Let (αm )m∈N be a sequence as in Lemma 2.20. We assume that the series ∞
αm |ϕm (x)|
(2.57)
m=1
converges in L∞ (D), i.e., lim ess sup
M →∞
x∈D
∞
αm |ϕm (x)| = 0.
(2.58)
m=M
Then ¯(x) + aϕ (y, x) := a
∞
m=1
ym αm ϕm (x),
y = (ym )m∈N ∈ Γ,
x ∈ D, (2.59)
350
C. Schwab and C. J. Gittelson
converges uniformly in L∞ (D), and the stochastic diffusion coefficient satisfies a(ω, x) = aϕ (Y (ω), x)
∀x ∈ D, ∀ω ∈ Ω,
where Y (ω) := (Ym (ω))m∈N ∈ Γ. ¯ Am : H 1 (D) → H −1 (D) by We define the operators A(y), A, 0 aϕ (y, x)∇v(x) · ∇w(x) dx, y ∈ Γ, H −1 A(y)v, wH01 := D ¯ a ¯(x)∇v(x) · ∇w(x) dx, H −1 Av, wH01 := D αm ϕm (x)∇v(x) · ∇w(x) dx, m ∈ N, H −1 Am v, wH01 :=
(2.60)
(2.61) (2.62) (2.63)
D
for all v, w ∈ H01 (D). By (2.60), A(y) is the operator associated to (2.49) for all ω ∈ Ω. Therefore, U (ω) = u(Y (ω))
∀ω ∈ Ω,
(2.64)
for the solution u of (2.44) for (2.61), provided it exists. Lemma 2.21.
Under condition (2.58), A(y) = A¯ +
∞
ym Am ,
y ∈ Γ,
(2.65)
m=1
with convergence in L(H01 (D), H −1 (D)) uniformly in y. Furthermore, A(y) depends continuously on y ∈ Γ. Proof. Let y ∈ Γ and v, w ∈ H01 (D). By (2.59) and Fubini’s theorem, using (2.58), ¯ w + A(y)v, w = Av,
∞
ym Am v, w.
m=1
Similarly, for all M ∈ N, using |ym | ≤ 1 for all m ∈ N, ! ∞ ∞ "
y A v, w y α ϕ (x) ∇v(x) · ∇w(x) dx = m m m m m D m=M m=M ! ∞ "
αm |ϕm (x)| v H01 w H01 . ≤ ess sup x∈D
m=M
Convergence of the series in L(H01 (D), H −1 (D)) follows with (2.58).
351
Sparse tensor discretizations for sPDEs
n → y A sequence (y n )n∈N ⊂ Γ converges to y ∈ Γ if ym m for all m ∈ N. n 1 −1 In this case, A(y ) → A(y) in L(H0 (D), H (D)) since, as above, using n − y | ≤ 2, |ym m ∞ ! ∞ "
n (ym − ym )Am ≤ 2 ess sup αm |ϕm (x)| . 1 x∈D −1 m=M
H0 (D)→H
m=M
(D)
The right-hand side is independent of n, and can be made smaller than
for sufficiently large M ∈ N. Then
A(y ) − A(y) H01 (D)→H −1 (D) ≤ + n
M −1
n |ym − ym | Am H01 (D)→H −1 (D) ,
m=1
which is less than 2 for sufficiently large n ∈ N. We assume that the bilinear form associated to the operator A¯ is coercive on H01 (D), or equivalently, that ∃¯ a− : Proposition 2.22.
ess inf a ¯(x) ≥ a ¯− > 0. x∈D
(2.66)
If ∞
γ :=
1 ess sup αm |ϕm (x)| < 1, a ¯− x∈D
(2.67)
m=1
then A(y) :
H01 (D)
→
H −1 (D)
is boundedly invertible for all y ∈ Γ, and
sup A(y)−1 H −1 (D)→H01 (D) ≤ y∈Γ
a ¯−1 − . 1−γ
(2.68)
Furthermore, A(y) is bounded with a L∞ (D) (1 + γ). sup A(y) H01 (D)→H −1 (D) ≤ ¯
(2.69)
y∈Γ
Proof. The operator A¯ : H01 (D) → H −1 (D) is invertible due to (2.66) and the Lax–Milgram lemma. The norm of its inverse is bounded by 1/¯ a− . By (2.67), as in the proof of Lemma 2.21, ∞
1 ess sup αm |ϕm (x)| = γ < 1.
A¯−1 (A¯ − A(y)) H01 (D)→H01 (D) ≤ a ¯− x∈D m=1
Therefore, I − A¯−1 (A¯ − A(y)) = A¯−1 A(y) is invertible by a Neumann series and has norm less than (1 − γ)−1 . The ¯ claim follows by multiplying from the left by A.
352
C. Schwab and C. J. Gittelson
Discretization by the Legendre chaos basis For a separable Hilbert space V , we consider a parametric operator in L(V, V ) of the form A(y) = A¯ +
∞
ym Am ,
y ∈ Γ = [−1, 1]∞ ,
(2.70)
m=1
¯ Am ∈ L(V, V ) and convergence in L(V, V ) uniformly in y ∈ Γ. As with A, in Section 2.3, we assume that A(y) is positive and boundedly invertible for all y, depends continuously on y ∈ Γ, and satisfies (2.45). By Proposition 2.22, this holds for (2.61) under the assumptions of Section 2.3. We make the additional assumption ∞
Am V →V < ∞,
(2.71)
m=1
which is stronger than (2.58) in the setting of Section 2.3. Let the measure µ on (Γ, B(Γ)) be the countable product of uniform measures on [−1, 1] as in (2.41). Then, by Corollary 2.16, the tensor product Legendre polynomials (Lν )ν∈F form an orthonormal basis of L2 (Γ, µ), called the Legendre chaos basis. We use it to discretize the parameter domain Γ, i.e., to reformulate (2.44) and (2.47) as an equation on a space of sequences in V . By Remark 2.19, the parametric operator A(y) induces a boundedly invertible operator between the Hilbert tensor product spaces L2 (Γ, µ) ⊗ V and L2 (Γ, µ) ⊗ V . The structure of (2.70) carries over to this operator. For all m ∈ N, we define the multiplication operator Mym : L2 (Γ, µ) → L2 (Γ, µ),
g(y) → ym g(y).
(2.72)
It follows from ym ∈ [−1, 1] that Mym is self-adjoint and
Mym L2 (Γ,µ)→L2 (Γ,µ) = 1,
m ∈ N.
(2.73)
Proposition 2.23. The operator in L(L2 (Γ, µ)⊗V, L2 (Γ, µ)⊗V ) induced by A(y) via (2.47), as in Remark 2.19, is A = I ⊗ A¯ +
∞
Mym ⊗ Am ,
(2.74)
m=1
L2 (Γ, µ).
The sum in (2.74) converges uncondiwhere I is the identity on tionally in L(L2 (Γ, µ) ⊗ V, L2 (Γ, µ) ⊗ V ). Proof.
The operator A is well-defined by (2.74) since, by (2.73), N N N
Mym ⊗ Am ≤
Mym
Am =
Am , m=M
m=M
m=M
353
Sparse tensor discretizations for sPDEs
which can be made arbitrarily small for sufficiently large M by (2.71). The convergence is unconditional since the convergence of (2.71) is unconditional. Let g ∈ L2 (Γ, µ) and v ∈ V . Then using (2.72), ¯ + A(g ⊗ v)(y) = g(y)Av
∞
ym g(y)Am v = A(y)(g(y)v),
y ∈ Γ.
m=1
Therefore, A is the operator induced by A(y). Since the tensor product Legendre polynomials (Lν )ν∈F form an orthonormal basis of L2 (Γ, µ), the map
c ν Lν , (2.75) TL : 2 (F) → L2 (Γ, µ), (cν )ν∈F → ν∈F
is a unitary isomorphism by Parseval’s identity. Tensorizing with the identity IV on V , we get the isometric isomorphism TL ⊗ IV : 2 (F) ⊗ V → L2 (Γ, µ) ⊗ V
(2.76)
with adjoint (TL ⊗ IV ) = TL ⊗ IV : L2 (Γ, µ) ⊗ V → 2 (F) ⊗ V .
(2.77)
We define the semidiscrete operator A := (TL ⊗ IV ) A(TL ⊗ IV ) : 2 (F) ⊗ V → 2 (F) ⊗ V .
(2.78)
Similarly, interpreting f ∈ L2 (Γ, µ; V ) as an element of L2 (Γ, µ) ⊗ V , we define f (y)Lν (y)µ(dy) , (2.79) f := (TL ⊗ IV ) f = Γ
ν∈F
which is simply the sequence of Legendre coefficients of f . This leads to the semidiscrete operator equation Au = f. Theorem 2.24.
(2.80)
The operator A from (2.78) has the form A = I ⊗ A¯ +
∞
K m ⊗ Am ,
(2.81)
m=1
with convergence in L(2 (F) ⊗ V, 2 (F) ⊗ V ), where I is the identity on 2 (F) and K m := TL Mym TL . Furthermore, A is boundedly invertible, and the solutions of (2.44) and (2.80) are related by u = (TL ⊗ IV )u.
(2.82)
354
C. Schwab and C. J. Gittelson
Proof. Equation (2.81) follows from (2.74) since TL = TL−1 . The operator A is boundedly invertible since A is boundedly invertible by Remark 2.19 and (TL ⊗ IV ) and (TL ⊗ IV ) are isomorphisms by definition. Applying the inverse of (TL ⊗ IV ) to (2.80) and inserting (2.78) and (2.79), it follows that A(TL ⊗ IV )u = f, which characterizes u by Theorem 2.18. Lemma 2.25.
For all m ∈ N, the operator K m := TL Mym TL : 2 (F) → 2 (F)
(2.83)
K m (cν )ν∈F = (βνm +1 cν+ m + βνm cν− m )ν∈F ,
(2.84)
has the form
where β0 := 0, and βn := √
1 n √ =√ ∈ 2n + 1 2n − 1 4 − n−2
+ 1 1 ,√ , 2 3
n ∈ N.
(2.85)
Here, m is the Kronecker sequence ( m )n := δmn , and if νm = 0, the term cν− m is irrelevant in (2.84) since it is multiplied by β0 = 0. Furthermore, K m is self-adjoint and
K m 2 (F)→2 (F) = 1, Proof.
m ∈ N.
By definition, since TL−1 = TL , TL K m (cν )ν∈F = Mym TL (cν )ν∈F =
(2.86)
cν ym Lν (y).
ν∈F
Therefore, (2.84) is equivalent to ym Lν (y) = βνm +1 Lν+ m (y) + βνm Lν− m (y). By (2.38), ξLn (ξ) = βn+1 Ln+1 (ξ) + βn Ln−1 (ξ),
ξ ∈ [−1, 1],
n ∈ N0 .
Then the √ claim follows from (2.29). Note that (βn )n∈N is decreasing in n, β1 = 1/ 3, and βn → 1/2. Corollary 2.26.
The solution u of (2.44) is
uν Lν (y) ∈ V, y ∈ Γ, u(y) =
(2.87)
ν∈F
with convergence in L2 (Γ, µ; V ), where the coefficients (uν )ν∈F ∈ V are determined uniquely by the equations ¯ ν+ Au
∞
m=1
Am (βνm +1 uν+ m + βνm uν− m ) = fν ,
ν ∈ F,
(2.88)
Sparse tensor discretizations for sPDEs
for (βn )n∈N0 and ( m )m∈N as in Lemma 2.25, and f (y)Lν (y) µ(dy) ∈ V , ν ∈ F. fν :=
355
(2.89)
Γ
Proof. The claim follows from Theorem 2.24 using the definitions (2.75), (2.76), (2.78), (2.79), Lemma 2.25, and the identification of Lebesgue– Bochner spaces with Hilbert tensor product spaces as in Remark 2.19. Finite element approximation The discretization from Section 2.3 does not include any approximations. The infinite system of equations in Corollary 2.26 determines the Legendre coefficients (uν )ν∈F ∈ V of the exact solution u of (2.44). However, this system of equations lends itself to discretization by standard finite elements. For all ν ∈ F, let VN,ν ⊂ V be a finite-dimensional space. We assume that VN,ν = {0} for all but finitely many ν ∈ F and define the finite-dimensional space (2.90) VN := {v ∈ L2 (Γ; V ) ; vν ∈ VN,ν ∀ν ∈ F}, where vν ∈ V is the νth coefficient in the expansion of v ∈ L2 (Γ; V ) with respect to the tensor product Legendre polynomials (Lν )ν∈F . This space can be interpreted as a subspace of L2 (Γ; V ), as in (2.90), or as the space of sequences (vν )ν∈F in V with vν ∈ VN,ν for all ν ∈ F, which is a subspace of 2 (F; V ). By Parseval’s identity, the norms induced by these two spaces coincide. Accordingly, the Galerkin projection of u onto VN can be characterized in two equivalent ways. We define the Galerkin approximation uN of u on VN as the unique element of VN satisfying A(y)uN (y), vN (y)µ(dy) = f (y), vN (y)µ(dy) ∀vN ∈ VN . (2.91) Γ
Γ
As in Corollary 2.26, the Legendre coefficients of uN satisfy a system of equations ¯ N,ν , vN + Au
∞
Am (βνm +1 uN,ν+ m +βνm uN,ν− m ), vN = fν , vN (2.92)
m=1
for all vN ∈ VN,ν and all ν ∈ F. Since VN,ν = {0} for all but finitely many ν ∈ F, there are only finitely many non-trivial equations (2.92). Also, for the same reason, the sum in each equation is finite. Therefore, without any explicit truncation, the infinite system of equations (2.88) becomes a finite system when considered on a finite-dimensional space. Proposition 2.27. The Galerkin projection uN of u onto VN is welldefined by (2.91), and satisfies
uN L2 (Γ,µ;V ) ≤ cˇ f L2 (Γ,µ;V ) .
(2.93)
356
C. Schwab and C. J. Gittelson
Its Legendre coefficients (uN,µ )µ∈F are uniquely characterized by (2.92) for ν ∈ F. Furthermore, √ ccˇ inf u − vN L2 (Γ,µ;V ) . (2.94)
u − uN L2 (Γ,µ;V ) ≤ vN ∈VN
Proof. As shown in the proof of Theorem 2.18, the bilinear form in (2.91) is continuous with constant c and coercive with constant cˇ−1 . Existence and uniqueness of uN as well as (2.93) follow from the Lax–Milgram lemma applied to the space VN . The equivalence of (2.91) and (2.92) is a consequence of Theorem 2.24, using Lemma 2.25. The quasi-optimality property (2.94) holds since the bilinear form in (2.91) is a scalar product, and the 2 norm induced √ by it√on L (Γ, µ; V ) is equivalent to the standard norm with constants c and cˇ. Given a space VN , the Galerkin projection uN of u onto VN can be computed iteratively, for example by a conjugate gradient iteration; see Gittelson (2011b). The inverse of the deterministic operator A¯ can be used as a preconditioner. The sparse tensor product construction of VN , which amounts to a problem-adapted selection of finite element spaces VN,ν , is discussed in Section 4.1. Approximation results are presented in Section 3.1. 2.4. PDEs with Gaussian parameters The log-normal diffusion equation We consider again the diffusion equation (2.49) with a stochastic diffusion coefficient a(·, ·) on a bounded Lipschitz domain D ⊂ Rd . However, instead of expanding a(·, ·) in a series, we expand its logarithm. More precisely, we take a series expansion of log(a − a∗ ), where a∗ is a bounded function on D with a∗ (x) ≥ 0 for all x ∈ D. Then, instead of (2.59), we have a diffusion coefficient of the form ! ∞ "
ym am (x) , x ∈ D, (2.95) a(y, x) = a∗ (x) + a0 (x) exp m=1
R∞ .
We assume that the coefficients (ym )m∈N are for y = (ym )m∈N ∈ independent standard Gaussian random variables. This is the case, for instance, if log(a − a∗ ) is Gaussian and we expand it in its Karhunen–Lo`eve series, or more generally if (am )m∈N are orthonormal in the Cameron–Martin space of the distribution of log(a−a∗ ): see Section 2.1 and Gittelson (2010b). The diffusion equation with the stochastic coefficient (2.95) and, for simplicity, homogeneous Dirichlet boundary conditions, is −∇ · a(y, x)∇u(y, x) = f (y, x), x ∈ D, (2.96) u(y, x) = 0, x ∈ ∂D.
357
Sparse tensor discretizations for sPDEs
By the above assumptions, the parameter y is in the probability space (R∞ , B(R∞ ), γ), where γ=
∞ '
N1 ,
(2.97)
m=1
as in (2.4). For the sake of generality, we allow the forcing term f in (2.96) to depend on y ∈ R∞ . The series in (2.95) may not converge for all y ∈ R∞ . We assume that ˇ0 > 0 for all x ∈ D, and am ∈ L∞ (D) for all m ∈ N0 , a0 (x) ≥ a ∞
am L∞ (D) < ∞,
(2.98)
m=1
i.e., the sequence αm := am L∞ (D) , m ∈ N, is in 1 (N). Then the series in (2.95) converges in L∞ (D), at least for all y in the set , ∞
∞ Γ := y ∈ R ; αm |ym | < ∞ . (2.99) m=1
Lemma 2.28. Proof.
Γ ∈ B(R∞ ) and γ(Γ) = 1.
Borel-measurability of Γ follows from ∞ / M ∞ , .
∞ y∈R ; αm |ym | ≤ N . Γ= m=1
N =1 M =1
By the monotone convergence theorem, using 0 2 ∞ 2 ξ 2 dξ = , |ym |γ(dy) = √ ξ exp − 2 π 2π 0 R∞ it follows that ∞ ∞
αm |ym |γ(dy) = αm R∞ m=1
m=1
0 R∞
|ym |γ(dy) =
∞ 2 αm < ∞, π m=1
which implies that the sum converges γ-a.e. on R∞ , and thus γ(Γ) = 1 by (2.99). Lemma 2.29. and satisfies
For all y ∈ Γ, the diffusion coefficient (2.95) is well-defined
a(y) < ∞ 0
x∈D
(2.100)
358
C. Schwab and C. J. Gittelson
with
! a(y) ≤ a∗ L∞ (D) + a0 L∞ (D) exp ! ˇ0 exp − a ˇ(y) ≥ ess inf a∗ (x) + a x∈D
Proof.
∞
m=1
∞
" αm |ym | , "
αm |ym | .
m=1
Let y ∈ Γ and x ∈ D with |a(x)| ≤ αm for all m ∈ N. Then ∞ ∞
|am (x)||ym | ≤ αm |ym | < ∞. m=1
m=1
By continuity and positivity of exp(·), " ! ∞ )
am (x)ym = exp(am (x)ym ) ∈ (0, ∞). exp
(2.101)
m=1∞
m=1
Then the claim follows from (2.95). Due to Lemmas 2.28 and 2.29, we consider Γ as the parameter space of (2.96) instead of R∞ . Even though Γ is not a product domain, we can define product measures such as γ on Γ by restriction. For each y ∈ Γ, we consider the weak formulation of (2.96) on V := H01 (D) with norm 1/2 2 |∇v(x)| dx . (2.102)
v V := D
We define the bilinear form a(y, x)∇w(x) · ∇v(x) dx, b(y; w, v) :=
w, v ∈ V,
(2.103)
D
and reinterpret the forcing term f as a map into the dual space V by f (y, x)v(x) dx, v ∈ V, (2.104) f (y; v) := D
for all y ∈ Γ. Then the weak formulation on V of the diffusion equation (2.96) is given by the linear variational problem of determining u(y) ∈ V such that b(y; u(y), v) = f (y; v) ∀v ∈ V. (2.105) Theorem 2.30. satisfies
For all y ∈ Γ, (2.105) has a unique solution u(y) ∈ V . It
u(y) V ≤
1
f (y; ·) V a ˇ(y)
∀y ∈ Γ.
(2.106)
Proof. By Lemma 2.29 and (2.102), the bilinear form b(y; ·, ·) is continuous and coercive on V with coercivity constant a ˇ(y) for all y ∈ Γ. Therefore, the claim follows by the Lax–Milgram lemma.
359
Sparse tensor discretizations for sPDEs
Auxiliary Gaussian measures For any sequence σ = (σm )m∈N ∈ exp(1 (N)), i.e., σm = exp(sm ) with (sm )m ∈ 1 (N), we define the product measure γσ :=
∞ '
N σm 2
(2.107)
m=1
(R∞ , B(R∞ )),
where Nσm on 2 is the centred Gaussian measure on R with standard deviation σm . In particular, the standard Gaussian measure on R∞ is γ = γ1 . Proposition 2.31. For all σ = (σm )m∈N ∈ exp(1 (N)), the measure γσ is equivalent to γ. The density of γσ with respect to γ is " ! " ! ∞ ∞ ) 1 1 −2 2 exp − . (2.108) (σm − 1)ym ζσ (y) = σm 2 m=1
Proof.
m=1
Note that dNσm 2 = ζσ,m dN1 for 1 1 −2 2 exp − (σm − 1)ym . ζσ,m (ym ) = σm 2
We compute 1 ∞ 1 1 −2 2 ζσ,m (ym )N1 (dym ) = √ exp − (σm + 1)ym dym 4 2πσm −∞ R 0 1 2 βm = = exp σm + σ −1 2 for some βm with |βm | ≤ log σm . Therefore, " ! ∞ ∞ 1 ) 1 ζσ,m (ym )N1 (dym ) = exp βm , 2 R m=1
m=1
which converges since (log σm )m ∈ rem C.44.
1 (N).
Then the claim follows by Theo-
In particular, Proposition 2.31 implies that γσ (Γ) = 1 for any σ ∈ exp(1 (N)). Therefore, the restriction of γσ to Γ is a probability measure. We consider sequences σ that depend exponentially on α = (αm )m∈N , σm (χ) := exp(χαm ),
m ∈ N,
χ ∈ R.
(2.109)
We abbreviate γχ := γσ(χ) and ζχ := ζσ(χ) . In particular, γ = γ1 = γ0 . Lemma 2.32. Let η < χ and k ≥ 0. Then for all y ∈ Γ, ! ∞ " 2 2χ α ∞
ζη (y) k e exp k + χ − η α 1 . (2.110) αm |ym | ≤ exp ζχ (y) 4(χ − η) m=1
360
C. Schwab and C. J. Gittelson
Proof.
Let y ∈ Γ and abbreviate σm := eαm . By (2.108), ! ∞ " ! ∞ " )
ζη (y) 1 χ−η −2(χ−η) −2η 2 = σm (σm − 1)σm ym . exp ζχ (y) 2 m=1
m=1
Using the estimate −2(χ−η) −2η − 1)σm = (e−2(χ−η)αm − 1)e−2ηαm (σm
= e−2χαm (1 − e2(χ−η)αm ) ≤ e−2χαm (−(χ − η)αm ), we have ! ! ∞ ""
ζη (y) log exp k αm |ym | ζχ (y) m=1
∞
=k ≤k
m=1 ∞
m=1 ∞
=−
αm |ym | +
∞ ∞
1 −2(χ−η) −2η 2 (σm − 1)σm ym + (χ − η) log σm 2 m=1
αm |ym | − (χ − η)
αm m=1 ∞
√
m=1
∞
2 αm e−2χαm ym + (χ − η)
m=1
χ−ηe
−χαm
k eχαm |ym | − √ 2 χ−η
2
∞
αm
m=1
∞
αm k 2 e2χαm + (χ − η) αm 4(χ − η) m=1 m=1 ∞ 2 2χαm
k e + (χ − η) αm . ≤ 4(χ − η) +
m=1
In particular, if k = 0, then (2.110) reads ζη (y) ≤ exp (χ − η) α 1 . ζχ (y) Proposition 2.33.
Let 0 < p < ∞ and η < χ. Then Lp (Γ, γχ ) ⊂ Lp (Γ, γη )
and
v Lp (Γ,γη ) ≤ exp
(2.111)
χ−η
α 1 v Lp (Γ,γχ ) p
(2.112)
∀v ∈ Lp (Γ, γχ ).
(2.113)
Sparse tensor discretizations for sPDEs
Proof.
361
Let v ∈ Lp (Γ, γχ ). Then ζη ζη (y)
v pLp (Γ,γη ) =
v pLp (Γ,γχ ) . v p dγη = v p dγχ ≤ sup ζ ζ (y) χ y∈Γ χ Γ Γ
The claim follows from Lemma 2.32 with k = 0: see (2.111). Of course, Proposition 2.33 also applies to Lebesgue–Bochner spaces of functions mapping, for example, into V or V . We will use it with η = 0, such that γη = γ. Integrability of the solution We consider integrability properties of the solution u of (2.105). Borelmeasurability of the map R∞ y → u(y) ∈ V is shown in Gittelson (2010a, Lemma 3.4) under the assumption that f is Borel-measurable as a map from R∞ to V . Under stronger assumptions, measurability of u also follows from Theorem 2.44 below. Proposition 2.34. Let 0 < p < ∞ and > 0. If f ∈ Lp (Γ, γ ; V ), then the solution u of (2.105) is in Lp (Γ, γ; V ) and satisfies
u Lp (Γ,γ;V ) ≤ c¯,p f Lp (Γ,γ ;V ) with
,
c¯,p = min
exp
p α 1
1 , exp ess inf y∈Γ a∗ (y) a ˇ0
p e2 α ∞ . +
α 1 4 p
Proof. By (2.106), p
u(y) V γ(dy) ≤ ζ (y)−1 a ˇ(y)−p f (y; ·) pV γ(dy) Γ Γ # $ −1 −p ˇ(y)
f (y; ·) pV γ(dy). ≤ ess inf ζ (y) a y∈Γ
Γ
The claim follows from Lemmas 2.29 and 2.32 with η = 0, χ = and k = p. However, we also need integrability of u with respect to the measure γ . Lemma 2.35.
For all ≥ 0 and all 0 < r < ∞, " ! ∞
αm |ym | ∈ Lr (Γ, γ ) exp m=1
with " ! ∞
αm |ym | exp m=1
Lr (Γ,γ )
0 r 2 α ∞ 2 α ∞ 2 e ≤ exp e
α 2 +
α 1 . 2 π
362
C. Schwab and C. J. Gittelson
Proof. The claim follows from Gittelson (2010a, Lemma 3.10) with the change of variables zm := e−αm ym . Theorem 2.36. Let 0 < q < p < ∞ and ≥ 0. If f ∈ Lp (Γ, γ ; V ), then the solution u of (2.105) is in Lq (Γ, γ ; V ) and satisfies c,q,p f Lp (Γ,γ ;V )
u Lq (Γ,γ ;V ) ≤ with
0 1 qp e2 α ∞ 2 α ∞ 2
α 2 + e = exp
α 1 , a ˇ0 2(p − q) π
c,q,p
or, if ess inf y∈Γ a∗ (y) > 0 and q ≤ p, also with c,q,p = Proof.
1 ess inf y∈Γ a∗ (y)
.
qp . By (2.106) and H¨ older’s inequality, Let r = p−q
u(y) qV γ (dy) ≤ a ˇ(y)−q f (y; ·) qV γ (dy) Γ
Γ
≤ ˇ a(·)−1 qLr (Γ,γ ) f qLp (Γ,γ ;V ) .
Then the claim follows from Lemmas 2.29 and 2.35. In particular, if f ∈ Lp (Γ, γ ; V ) with p > 2, then u ∈ L2 (Γ, γ ; V ) and c,p f Lp (Γ,γ ;V )
u L2 (Γ,γ ;V ) ≤ with c,p
0 2 α ∞ 1 pe 2 α ∞ 2
α 2 + e = exp
α 1 . a ˇ0 p−2 π
(2.114)
(2.115)
By Proposition 2.4 and Theorem 2.12 for (2.15), the tensorized Hermite polynomials (Hν )ν∈F form an orthonormal basis of L2 (Γ, γ). We transform these to an orthonormal basis of L2 (Γ, γ ) using the map τ : R∞ → R∞ ,
(ym )m∈N → (e−αm ym )m∈N .
(2.116)
Note that τ maps Γ bijectively onto Γ. Lemma 2.37.
For all ∈ R, the map L2 (Γ, γ) → L2 (Γ, γ ),
v → v ◦ τ
is a unitary isomorphism of Hilbert spaces. Furthermore, v(y)γ(dy) = v(τ (y))γ (dy) ∀v ∈ L2 (Γ, γ). Γ
Γ
(2.117)
(2.118)
363
Sparse tensor discretizations for sPDEs
Proof. The standard Gaussian measure γ is the image of γ under the map τ , i.e., γ(E) = γ (τ−1 (E)) for all E ∈ B(Γ). This is easily checked for sets E = {y ∈ Γ ; ym ≤ x} with x ∈ R and m ∈ N. Then (2.118) is the transformation theorem, and the rest of the claim is a direct consequence. Proposition 2.38. L2 (Γ, γ ).
For all ∈ R, (Hν ◦ τ )ν∈F is an orthonormal basis of
Proof. The claim follows from Lemma 2.37 since (Hν )ν∈F from (2.15) is an orthonormal basis of L2 (Γ, γ): see Proposition 2.4 and Theorem 2.12. Corollary 2.39. Let ≥ 0 and f ∈ Lp (Γ, γ ; V ) with p > 2. Then the solution u of (2.105) is of the form
uν Hν (τ (y)), y ∈ Γ, (2.119) u(y) = ν∈F
with convergence in L2 (Γ, γ ; V ), for the coefficients uν = u(τ−1 (y))Hν (y)γ(dy) ∈ V, ν ∈ F.
(2.120)
Γ
Furthermore, u := (uν )ν∈F ∈ 2 (F; V ) and c,p f Lp (Γ,γ ;V )
u 2 (F;V ) ≤
(2.121)
with the constant c,p from (2.115). Proof. By Theorem 2.36 with q = 2, the solution u of (2.105) is an element of L2 (Γ, γ ; V ). Then (2.119) is the expansion of u in the orthonormal basis from Proposition 2.38, and (2.120) follows from (2.118) since u(y)Hν (τ (y))γ (dy) = u(τ−1 (y))Hν (y)γ(dy). uν = Γ
Γ
Equation (2.121) is a consequence of (2.114) and Parseval’s identity. Weak formulation on a problem-dependent space Since the diffusion coefficient a(y, x) is not uniformly bounded in y ∈ Γ, simply integrating (2.105) over Γ with respect to γ does not lead to a well-posed linear variational problem on L2 (Γ, γ; V ). As shown below, this difficulty can be overcome by assuming sufficient integrability of f with respect to γ for a parameter > 0. Furthermore, if a∗ (x) is not bounded away from zero, then neither is a(y, x). For this reason, we integrate (2.105) with respect to a measure that is stronger than γ in the sense of Proposition 2.33, but not by as much as γ .
364
C. Schwab and C. J. Gittelson
For parameters 0 ≤ ϑ < 1 and > 0, define b(y; w(y), v(y))γϑ (dy) Bϑ (w, v) := Γ a(y, x)∇w(y, x) · ∇v(y, x) dxγϑ (dy) = Γ
(2.122)
D
and, assuming that y → f (y; ·) ∈ V is B(Γ)-measurable and sufficiently integrable, f (y; v(y))γϑ (dy) = f (x)v(y, x) dxγϑ (dy) (2.123) Fϑ (v) := Γ
Γ
D
for suitable w and v. We define the space Vϑ := {v : Γ → V B(Γ)-measurable ; Bϑ (v, v) < ∞}.
(2.124)
More precisely, Vϑ contains equivalence classes of γ-a.e. identical functions. Proposition 2.40. The space Vϑ endowed with the inner product Bϑ (·, ·) is a Hilbert space. We refer to Gittelson (2010a, Proposition 3.6) for the proof of Proposition 2.40. The argument is analogous to a standard proof that L2 (R) is a Hilbert space. Lemma 2.41.
For all w, v ∈ L2 (Γ, γ ; V ), |Bϑ (w, v)| ≤ cϑ w L2 (Γ,γ ;V ) v L2 (Γ,γ ;V )
with cϑ = Proof.
e2 α ∞
α 1
a∗ L∞ (D) + a0 L∞ (D) exp 4(1 − ϑ)
exp (1−ϑ) α 1 .
By continuity of b(y; ·, ·) for y ∈ Γ, ζϑ (y) a(y) w(y) V v(y) V γ(dy) |Bϑ (w, v)| ≤ ζ (y) Γ ζϑ a
w L2 (Γ,γ ;V ) v L2 (Γ,γ ;V ) , ≤ ∞ ζ L (Γ,γ)
and the claim follows from Lemmas 2.29 and 2.32 with η = ϑ, χ = and k = 1. Lemma 2.42.
For all v ∈ L2 (Γ, γ; V ) with Bϑ (v, v) < ∞, Bϑ (v, v) ≥ cˇϑ v 2L2 (Γ,γ;V )
365
Sparse tensor discretizations for sPDEs
with
cˇϑ = Proof.
e2ϑ α ∞
α 1 ess inf a∗ (x) + a ˇ0 exp − x∈D 4ϑ
exp −ϑ α 1 .
Using coercivity of b(y; ·, ·) for y ∈ Γ, we obtain Bϑ (v, v) ≥ ζϑ (y)ˇ a(y) v(y) 2V γ(dy) Γ
≥ ess inf ζϑ (y)ˇ a(y)−1 v 2L2 (Γ,γ;V ) , y∈Γ
and the claim follows from Lemmas 2.29 and 2.32 with η = 0, χ = ϑ and k = 1. Proposition 2.43. If ϑ > 0, the Hilbert space Vϑ is related to Lebesgue– Bochner spaces by the continuous embeddings L2 (Γ, γ; V ) ⊃ Vϑ ⊃ L2 (Γ, γ ; V ). For ϑ = 0, this still holds if ess inf x∈D a∗ (x) > 0. Proof.
Lemmas 2.41 and 2.42 imply cˇϑ v 2L2 (Γ,γ;V ) ≤ Bϑ (v, v) ≤ cϑ v 2L2 (Γ,γ ;V )
for all v ∈ L2 (Γ, γ ; V ). Also, using (2.111) with η = ϑ and χ = , it follows that if f ∈ L2 (Γ, γ ; V ), then Fϑ is in the dual of Vϑ . , then the solution u of (2.105) is the unique Theorem 2.44. If Fϑ ∈ Vϑ solution in Vϑ of the linear variational problem
Bϑ (u, v) = Fϑ (v)
∀v ∈ Vϑ .
(2.125)
Proof. By the Riesz isomorphism on the Hilbert space Vϑ , (2.125) has a unique solution u ∈ Vϑ . Fix a w ∈ V . Setting v(y) = w1E (y) for all E ∈ B(Γ) on which a(y) is bounded, it follows that the solution of (2.125) satisfies b(y; u, w) − f (y; w)γϑ (dy) = 0, E
and since Γ is a countable union of such sets E, the integrand must vanish γϑ -a.e. on Γ. The claim follows since w ∈ V is arbitrary. Galerkin approximation Using the variational formulation (2.125) of (2.105), we can define Galerkin projections of u onto suitable spaces. Let VN ⊂ L2 (Γ, γ ; V ) ⊂ Vϑ be finite-dimensional. Then the Galerkin projection of u onto VN is the unique
366
C. Schwab and C. J. Gittelson
element uN ∈ VN satisfying ∀vN ∈ VN .
Bϑ (uN , vN ) = Fϑ (vN )
(2.126)
This uN is well-defined since, being finite-dimensional, VN is a closed subspace of Vϑ , and thus also a Hilbert space when endowed with the inner product Bϑ (·, ·). Theorem 2.45. uN satisfies
If f ∈ Lp (Γ, γ ; V ) for a p > 2, the Galerkin projection
u − uN L2 (Γ,γ;V ) ≤
2
cϑ cˇϑ
inf u − vN L2 (Γ,γ ;V ) .
vN ∈VN
(2.127)
Proof. Theorem 2.36 implies that u ∈ L2 (Γ, γ ; V ). By definition, uN is the orthogonal projection of u onto VN with respect to the inner product Bϑ (·, ·). Therefore, it minimizes the projection error in the norm induced by Bϑ (·, ·). Using Lemmas 2.41 and 2.42, we have cˇϑ u − uN 2L2 (Γ,γ;V ) ≤ Bϑ (u − uN , u − uN ) = inf Bϑ (u − vN , u − vN ) vN ∈VN
≤ cϑ inf u − vN 2L2 (Γ,γ ;V ) , vN ∈VN
and the claim follows. Remark 2.46. The errors on the two sides of the estimate (2.127) are measured in different norms. Therefore, Theorem 2.45 states that the Galerkin projection is almost quasi-optimal. Inserting the values of cϑ and cˇϑ from Lemmas 2.41 and 2.42, we see that the constant in (2.127) is 3 4 2 e2α∞ 4 cϑ 4 a∗ L∞ (D) + a0 L∞ (D) exp 4(1−ϑ) α 1
α 1 . =5 exp 2ϑα∞ cˇϑ 2 ess inf x∈D a∗ (x) + a ˇ0 exp − e
α 1 4ϑ
In particular, it tends to ∞ as approaches 0 or ∞, or if ϑ approaches 1. If a∗ is not bounded away from 0, then the constant also tends to ∞ as ϑ approaches 0. Motivated by Corollary 2.39, we consider in particular spaces VN of the form VN := {v ∈ L2 (Γ, γ ; V ) ; vν ∈ VN,ν ∀ν ∈∈ dx},
(2.128)
where VN,ν ⊂ V is a finite-dimensional subspace for all ν ∈ F, and VN,ν = {0} for all but finitely many ν ∈ F. In (2.128), (vν )ν∈F are the Hermite coefficients of v ∈ L2 (Γ, γ ; V ) with respect to the scaled Hermite polynomials
Sparse tensor discretizations for sPDEs
(Hν ◦ τ )ν∈F from Proposition 2.38, i.e., v(τ−1 (y))Hν (y)γ(dy), vν =
ν ∈ F.
367
(2.129)
Γ
Then VN is a finite-dimensional subspace of L2 (Γ, γ ; V ), and its dimension is the sum of the dimensions of VN,ν over ν ∈ F. Corollary 2.47. If f ∈ Lp (Γ, γ ; V ) for some p > 2, and VN is of the form (2.128), then the Galerkin projection uN satisfies 2 ! "1/2 cϑ 2 inf uν − vN V . (2.130)
u − uN L2 (Γ,γ;V ) ≤ vN ∈VN,ν cˇϑ ν∈F
Proof. The claim follows from Theorem 2.45 and Parseval’s identity since (Hν ◦ τ )ν∈F is an orthonormal basis of L2 (Γ, γ ; V ) by Proposition 2.38.
3. Optimal convergence rates of stochastic Galerkin approximations We have seen in the preceding sections, in Proposition 2.27 and in Corollary 2.47, that the Galerkin approximations of solutions for the parametric, deterministic formulations of the stochastic problems are well-defined and, in the mean square sense, quasi-optimal. The natural questions that arise from these results for computable numerical GPC approximations are: (a) What is the best possible rate achievable by polynomial chaos expansions that are truncated to at most N terms? and (b) How does one obtain in a constructive fashion index sets Λ ⊂ F of ‘active’ polynomial chaos coefficients whose cardinality does not exceed N , i.e., #Λ ≤ N ? Question (a) is addressed in the present section, whereas (b) will be discussed in the subsequent section. We deal with question (a) in the case of Legendre chaos. The general approach to establishing the convergence rate of N -term truncated GPC approximations consists in a careful analysis of the regularity of the unknown solution, in terms of summability of the GPC coefficient series. There are several ways to obtain a priori estimates on GPC coefficients. The most straightforward way is by a bootstrapping argument in the spirit of regularity theory for PDEs. This approach was taken in Todor and Schwab (2007) and Cohen, DeVore and Schwab (2010). We found, however, approaches based on the analytic continuation of the parametric, deterministic PDEs resulting from GPC expansions of the input random field in the parameter space of these expansions to yield, in general, sharper bounds. We therefore present a priori estimates of GPC coefficients obtained from the analytic continuation. This approach is rather general (we refer to
368
C. Schwab and C. J. Gittelson
Schwab and Stuart (2011) for an application of this approach to sparse approximation of posterior densities in Bayesian inverse problems). 3.1. Elliptic problems We consider the stochastic elliptic problem (2.49) with coefficient a(x, ω) depending in an affine fashion (2.55) on the coordinates Ym (ω). Then, by Lemma 2.20, the functions ϕm (x) that characterize the spatial heterogeneity of the random coefficient a(ω, x) in (2.49) can be rescaled via the scaling factors αm in Lemma 2.20 such that the random coefficients Ym (ω) satisfy Ym (ω) ∈ [−1, 1] for all ω ∈ Ω and m ∈ N. In what follows we shall assume that αm has been chosen in this way and denote the scaled coefficient functions by ψj (x), i.e., ψj (x) = αj ϕj (x),
j = 1, 2, . . . .
Then the abstract parametric deterministic operator equation (2.42), (2.44) reads, formally, as −∇ · (a(y, x)∇u) = f
in D,
u(y, ·)|∂D = 0,
y ∈ Γ.
(3.1)
Basic assumptions and preliminaries We impose in addition the following conditions on the coefficient functions ψj . (C1) For all j ∈ N, ψj ∈ L∞ (D), and ψj (x) is defined for all x ∈ D. (C2) The y = (y1 , y2 , . . .) to be considered are all in the set Γ = [−1, 1]N , i.e., the unit ball of the sequence space ∞ (N) (with N replaced by {1, . . . , K} when the number K of random parameters is finite). (C3) For each a(x, y) to be considered, we have for every x ∈ D and every y∈Γ
yj ψj (x). (3.2) a(x, y) = a ¯(x) + j≥1
Under these assumptions, we consider the map y → u(y) from Γ to V , where u(y) is the solution of (3.1) with coefficient given by (3.2). The variational formulation of (3.1) is set in the Sobolev space V := H01 (D), called the energy space, which is the set of all functions v whose trace vanishes on the boundary of D and whose energy norm v V := ∇v L2 (D) is finite. The dual of V is denoted by V = H −1 (D). The solution of the parametric problem (3.1) is defined for any f ∈ V as a measurable mapping u : Γ → V which satisfies the parametric elliptic PDE (3.1) for a.e. parameter vector y ∈ Γ, in variational form. If we let Am = −∇ · ψm (x)∇ ∈ L(V, V ), then, by Proposition 2.22, the parametric problem (3.1) admits a unique solution.
Sparse tensor discretizations for sPDEs
369
As indicated before, estimates of the Legendre expansion coefficients of the parametric, deterministic solution will be obtained by tools from the theory of complex variables. It will be crucial to verify that the results from Section 2.3 will also hold for complex extensions of the parameter vector. To this end, we now recapitulate results on well-posedness of variational elliptic problems. Consider the generic diffusion problem with coefficient α(x) in variational form α(x)∇u(x) · ∇v(x) dx = f (x)v(x) dx, for all v ∈ V, (3.3) D
D
where α(x) satisfies the ellipticity condition 0 < r ≤ α(x) ≤ R < ∞,
x ∈ D.
(3.4)
Then the Lax–Milgram lemma implies existence and uniqueness of the solution u of (3.3) in V and this solution satisfies the a priori estimate
f V . (3.5) r Now consider the case that the coefficient function α is complex-valued. In this case, the weak solution of (3.3) will be a complex-valued function. Therefore, we assume from now on that all function spaces V , their duals, etc., are spaces of complex-valued functions and duality is understood with respect to the antilinear dual pairing. We shall not distinguish this generalization notationally. In this case,
u V ≤
0 < r ≤ Re (α(x)) ≤ |α(x)| ≤ R < ∞,
x ∈ D.
(3.6)
For the parametric coefficient a(y, x), ellipticity is ensured by the uniform ellipticity assumption, as follows. Uniform ellipticity assumption. There exist 0 < r ≤ R < ∞ such that, for all x ∈ D and for all y ∈ Γ, 0 < r ≤ a(x, y) ≤ R < ∞.
(3.7)
We shall refer to assumption (3.7) in the following as UEA(r, R). We note that UEA(r, R) implies r ≤ a ¯(x) ≤ R for all x ∈ D, since we can choose yj = 0 for all j ∈ N. We note also that the uniform in Γ validity of the lower and upper inequality in (3.7) is equivalent to the conditions that
|ψj (x)| ≤ a ¯(x) − r, x ∈ D, (3.8) j≥1
and
j≥1
|ψj (x)| ≤ R − a ¯(x),
x ∈ D.
(3.9)
370
C. Schwab and C. J. Gittelson
To ensure well-posedness of the parametric deterministic PDE (3.1) to complex values of the parameters y, we impose a complex analogue of hypothesis UEA(r, R), as follows. Uniform ellipticity assumption in C. There exist 0 < r ≤ R < ∞ such that, for all x ∈ D and all z ∈ U , 0 < r ≤ Re (a(x, z)) ≤ |a(x, z)| ≤ R < ∞.
(3.10)
We refer to (3.10) as UEAC(r, R). We extend the definition of u(y) to u(z) for the complex variable z = (zj )j≥1 (by using the zj instead of yj in the definition of a by (3.2)) where |zj | ≤ 1 for all j. Therefore, the parameter vector z belongs to the polydisc ) {zj ∈ C ; |zj | ≤ 1} ⊃ Γ. (3.11) U := j≥1
Using (3.8) and (3.9), it is readily seen that when a ¯ and ψj are real-valued, then UEA(r, R) implies that for all x ∈ D and z ∈ U , 0 < r ≤ Re (a(x, z)) ≤ |a(x, z)| ≤ 2R,
(3.12)
and therefore the corresponding solution u(z) is well-defined in V for all z ∈ U according to the complex-valued version of the Lax–Milgram lemma. We leave to the reader the verification of Lemma 2.21 under UEAC(r, R) in the complex parameter case. For the derivation of the convergence rates of best N -term truncated GPC expansions, the following observation, due to Stechkin, will be used repeatedly. Let (γn )n≥1 denote a decreasing sequence of non-negative integers. Then, for any 0 < p ≤ q ≤ ∞ and any N ∈ N, "1 ! "1 ! q p
1 1 − q p q p γn ≤N γn . (3.13) n≥1
n≥N
For q < ∞ this is easily proved by combining the two estimates
q−p q−p p γnq ≤ γN γnp ≤ γN γnp and N γN ≤ γnp ≤ γnp . n≥N
n≥N
n≥1
n≤N
n≥1
Verification of the case q = ∞ is left to the reader. We shall use standard multivariate notation. As in (2.27), the countable set of finitely supported sequences of non-negative integers is denoted by F := {ν = (ν1 , ν2 , . . .) ; νj ∈ N, and νj = 0 for only a finite number of j}, (3.14) which implies that
|νj | (3.15) |ν| := j≥1
Sparse tensor discretizations for sPDEs
371
is finite if and only if ν ∈ F. For ν ∈ F supported in {1, . . . , J}, we define the partial derivative ∂ν u = and the multi-factorial ν! :=
)
∂ |ν| u , ∂ ν 1 y1 · · · ∂ ν J yJ
νj !
where 0! := 1.
j≥1
If α = (αj )j≥1 is a sequence of complex numbers, we define for all ν ∈ F ) νj αj , αν := j≥1
With this notation, the proof of summability of GPC coefficients of the solution will use the following result on sequence summability proved in Cohen et al. (2010). bν ν∈F ∈ p (F) if and only if Theorem 3.1. For 0 < p < 1, we have |ν|! ν! (i) j≥1 bj < 1, and (ii) (bj ) ∈ p (N). Main result on analyticity We can now state the main result from Cohen, DeVore and Schwab (2011) on analyticity of the parametric solution u(z) of (3.1) for parameter vectors z belonging to the polydisc U . The result also shows convergence rates for truncated Taylor expansions which include the N most significant terms, in a sense made precise in the statement of the following theorem. Such results could become significant in the context of sensitivity analysis of PDEs on high-dimensional parameter spaces. Theorem 3.2. If a(x, z) satisfies UEAC(r, R) for some 0 < r ≤ R < ∞, and if ( ψj L∞ (D) )j≥1 ∈ p (N) for some 0 < p < 1, then u(z) is analytic as a mapping from U into V . Moreover, for all z ∈ U , u(z) can be expanded in the Taylor series
tν z ν in V, (3.16) u(z) = ν∈F
where the Taylor coefficients tν ∈ V are defined as tν :=
1 ν ∂ u(0), ν!
ν∈F
and where tν ∈ V and ( tν V )ν∈F ∈ p (F) for the same value of p. The convergence of the series (3.16) is unconditional in the following sense. If (ΛN )N ≥1 is any increasing sequence of finite sets which exhausts F, the
372
C. Schwab and C. J. Gittelson
partial sums SΛN u(z) =
ν∈ΛN tν z
ν
satisfy
lim sup u(z) − SΛN u(z) V = 0.
(3.17)
N →+∞ z∈U
If in addition ΛN is a set of ν ∈ F corresponding to indices of N Taylor coefficients with largest norms tν V , we have the convergence estimate sup u(z) − SΛN u(z) V ≤ ( tν V ) p (F) N −s , z∈U
s :=
1 − 1. p
(3.18)
In the statement of the preceding theorem, a sequence (ΛN )N ≥1 ⊂ F is said to exhaust F if any finite subset Λ ⊂ F is contained in all sets ΛN , N ≥ N0 for some N0 . We next give the proof of this theorem, drawing upon Cohen et al. (2011). Proof of analyticity of u(z) There are several approaches to proving analyticity of u(z) as a V -valued function: a power series approach would require a bootstrapping argument for real parameter values as in Cohen et al. (2010). Here, we establish strong differentiability of u with respect to the complex coordinates zj by a difference quotient argument. The key to proving Theorem 3.2 is the observation that if UEAC(r, R) holds, then z → u(z) is a V -valued and bounded analytic function in certain domains which are larger than U : for 0 < δ ≤ 2R < ∞ we define the set Aδ = {z ∈ CN ; δ ≤ Re (a(x, z)) ≤ |a(x, z)| ≤ 2R for every x ∈ D}. (3.19) Clearly, if UEAC(r, R) holds, then for any 0 < δ < r the domain Aδ contains U . By the Lax–Milgram lemma, for any z ∈ Aδ there exists a unique solution u(z) ∈ V of the parametric problem (3.1) which satisfies the a priori estimate
f V for all z ∈ Aδ . (3.20)
u(z) V ≤ δ The difference quotient argument for establishing holomorphy of u(z) as a V -valued function on Aδ is based on the following perturbation lemma, whose proof is straightforward. We start from a stability result, which is also used further in this section. Lemma 3.3. If u and u are solutions of (3.3) with the same right-hand side f and with coefficients α and α , respectively, and if these coefficients both satisfy the assumption (3.6), then
f V
α − α L∞ (D) . (3.21) r2 Based on Lemma 3.3, we are now in a position to prove holomorphy of the mapping z → u(z).
u − u V ≤
373
Sparse tensor discretizations for sPDEs
Lemma 3.4. At any z ∈ Aδ , the function z → u(z) admits a complex derivative ∂zj u(z) ∈ V with respect to each variable zj . This derivative is the weak solution of the parametric problem: find ∂zj u(z) ∈ V such that, for all v ∈ V and for all z ∈ Aδ , a(x, z)∇∂zj u(x, z) · ∇v(x) dx = L0 (v) := − ψj (x)∇u(x, z) · ∇v(x) dx. D
D
(3.22)
To prove Lemma 3.4, we fix j ≥ 1 and z ∈ Aδ and denote by ej the Kronecker sequence with 1 at index j and 0 at other indices. For h ∈ C\{0}, consider the difference quotient wh (z) =
u(z + hej ) − u(z) ∈ V. h
(3.23)
We notice that wh (z) is well-defined if |h| ψj L∞ (D) ≤ 2δ , since then δ δ ≤ Re (a(x, z + hej )) ≤ |a(x, z + hej )| ≤ 2R + , 2 2
x ∈ D.
A short calculation shows that the difference quotient wh is the unique solution to the variational problem a(x, z)∇wh (x, z) · ∇v(x) dx = Lh (v), for all v ∈ V, D
where Lh : v → Lh (v) := − D ψj ∇u(z + hej ) · ∇v is a continuous, linear functional on V . The linear functional Lh (·) varies continuously in V with h as h tends to 0 since the stability estimate (3.21) implies
u(z + hej ) − u(z) V = ∇u(z + hej ) − ∇u(z) L2 (D) ≤ |h| ψj L∞ (D)
4 f V . δ2
Therefore Lh converges towards L0 in V as h → 0, which implies that wh converges in V towards a limit w0 ∈ V which is the solution to a(z, x)∇w0 (z) · ∇v = L0 (v), for all v ∈ V. D
Hence ∂zj u(z) = w0 exists in V and is the unique solution of the variational problem (3.22). For our further development, it is crucial to note that the analyticity domains Aδ contain polydiscs: we let := (j )j≥1 be a sequence of positive radii and define the polydiscs ) {zj ∈ C ; |zj | ≤ j } = {zj ∈ C ; z = (zj )j≥1 , |zj | ≤ j }. (3.24) U = j≥1
374
C. Schwab and C. J. Gittelson
We say that a sequence = (j )j≥1 is δ-admissible if and only if, for every x ∈ D,
j |ψj (x)| ≤ Re (¯ a(x)) − δ. (3.25) j≥1
If the sequence is δ-admissible, then the polydisc U is contained in Aδ . We also notice that the validity of the lower inequality in (3.10) for all z ∈ U is equivalent to the condition that
|ψj (x)| ≤ Re (¯ a(x)) − r, x ∈ D. (3.26) j≥1
Hence the sequence j = 1 is δ-admissible for all 0 < δ ≤ r, and that for δ < r there exist δ-admissible sequences such that j > 1 for all j ≥ 1, i.e., such that the polydisc U is strictly larger than U in every variable. These increasing δ-admissible sequences will next be exploited to obtain bounds on Taylor and Legendre coefficients by shifting paths of integration in the complex domain into the polydiscs U . Estimates of Taylor coefficients Estimates for the Taylor coefficients tν for ν ∈ F are given by the following result. Lemma 3.5. If UEAC(r, R) holds for some 0 < r ≤ R < ∞ and if = (j )j≥1 is a δ-admissible sequence for some 0 < δ < r, then for any ν ∈ F we have the estimate
f V ) −νj
f V −ν , j = (3.27)
tν V ≤ δ δ j≥1
where we use the convention that t−0 = 1 for any t ≥ 0. To prove Lemma 3.5, let ν = (νj )j≥1 ∈ F and J = max {j ∈ N ; νj = 0}. For J and for z ∈ U , we define the set EJ = {1, . . . , J} and the parameter vector zEJ obtained from z by setting to 0 all entries zj for j > J. We then have ∂ |ν| uJ (0, . . . , 0). ∂ ν u(0) = ν1 ∂z1 · · · ∂zJνJ From the assumption that is δ-admissible, we have that
f V , δ for all (z1 , . . . , zJ ) in the J-dimensional polydisc ) {zj ∈ C ; |zj | ≤ j }. U,J :=
uJ (z1 , . . . , zJ ) V ≤
1≤j≤J
(3.28)
(3.29)
375
Sparse tensor discretizations for sPDEs
Introducing the sequence defined by j = j + ε if j ≤ J,
j = j if j > J,
ε :=
2
δ , |ψ j | L∞ (D) j≤J
it is easily checked that is 2δ -admissible and therefore U ⊂ Aδ/2 . We infer from Lemma 3.4 that for each z ∈ U, u is holomorphic in each variable zj . function with Therefore uJ is strongly holomorphic as a V -valued function 6 respect to each of the variables z1 , . . . , zJ on the polydisc 1≤j≤J {|zj | < j }. This polydisc is an open neighbourhood of U,J . In this disc, we apply a suitable version of Cauchy’s integral formula (e.g., Theorem 2.1.2 of Herv´e (1989)) with respect to each zj , and write z1 , . . . , zJ ) uJ ( = (2πi)−J
|z1 |=1
···
|zJ |=J
uJ (z1 , . . . , zJ ) dz1 · · · dzJ . ( z1 − z1 ) · · · ( zJ − z J )
Differentiating this expression with respect to zj , we find ∂ |ν| uJ (0, . . . , 0) ∂z1ν1 · · · ∂zJνJ −J = ν!(2πi) ··· |z1 |=1
|zJ |=J
uJ (z1 , . . . , zJ ) dz1 · · · dzJ , z1ν1 · · · zJνJ
and therefore, using (3.28), we obtain the estimate |ν| ) −νj ν∂ uJ ν (0, . . . , 0) ≤ ν! f V j , ∂z 1 · · · ∂z J δ 1 V J j≤J
which is equivalent to (3.27).
Proof of Theorem 3.2 With the analyticity of the mapping z → u(z) on the domains Aδ in hand, the proof of Theorem 3.2 under the uniform ellipticity assumption UEAC(r, R) involves two steps: (a) a particular choice of r/2-admissible sequences , and (b) establishing p (F)-summability of the Taylor coefficient sequence. With δ = r/2, (3.27) of Lemma 3.5 reads
tν V ≤
2 f V ) −νj 2 f V −ν . j = r r
(3.30)
j≥1
There are many sequences that are δ-admissible. We now indicate one such choice from Cohen et al. (2011), which is ν-dependent, in order to
376
C. Schwab and C. J. Gittelson
yield possibly sharp coefficient bounds. We begin our choice by selecting J0 ∈ N so large that
r (3.31)
ψj L∞ (D) ≤ , 12 j>J0
Such a J0 exists under the assumptions of Theorem 3.2 because ( ψj L∞ (D) )j≥1 ∈ p (N) ⊂ 1 (N). Without loss of generality, the basis elements ψj of the sequence are assumed to be enumerated in such a way that ( ψj L∞ )j≥1 is non-increasing. To construct a δ = r/2 admissible vector of weights, we partition N into two sets E := {1 ≤ j ≤ J0 } and F := N\E. Next we choose κ > 1 such that
r (3.32)
ψj L∞ (D) ≤ . (κ − 1) 4 j≤J0
For each multi-index ν ∈ F we select = (ν) by , rνj , j := κ, j ∈ E; j := max 1, 4|νF | ψj L∞ (D)
j ∈ F.
(3.33)
Here, νE denotes the restriction of ν to a set E and |νF | := j>J0 νj . We ν also make the convention that |νFj | = 0 when |νF | = 0. It can be verified that the sequence defined in (3.33) is 2r -admissible (see Cohen et al. (2011) for details). The general bound (3.30) is in particular valid for this sequence , for which it takes the form (with the convention that a factor equals 1 if νj = 0) ! "! " ) |νF |dj νj 2 f V ) νj , (3.34) η
tν V ≤ r νj j∈E
where η :=
1 κ
j∈F
< 1 and dj :=
4 ψj L∞ . r
We note that from (3.31)
d 1 =
j>J0
1 dj ≤ . 3
(3.35)
To prove p (F) summability of the Taylor coefficients tν , we observe that the estimate (3.34) has the general form
tν V ≤ Cr α(νE ) β(νF ).
(3.36)
377
Sparse tensor discretizations for sPDEs
We let FE (respectively FF ) be the collection of ν ∈ F supported on E (respectively on F ). Then, for any 0 < p < ∞, we have
tν pV ≤ Crp α(νE )p β(νF )p = Crp AE AF , (3.37) ν∈F
ν∈F
where
!
AE :=
" α(ν)
p
! ,
AF :=
ν∈FE
" β(ν)
.
ν∈FF
The first factor AE is estimated as follows: ! "
) ) AE = α(ν)p = η pνj = η np = ν∈FE j∈E
ν∈FE
p
j∈E
n≥0
1 1 − ηp
J0
< ∞. (3.38)
To show that AF is finite, we observe ) |νF |dj νj |νF ||νF | νF β(ν) := ≤6 νj d , νj j∈F νj where dνF =
ν ∈ FF ,
(3.39)
j∈F
6
ν
j∈F
dj j and 00 := 1. By Stirling estimates, n!en n!en √ ≤ nn ≤ √ √ , e n 2π n
(3.40)
which hold for all n ≥ 1, we obtain |νF ||νF | ≤ |νF |!e|νF | . On the other hand, using the left inequality in (3.40), we obtain )
ν νj j ≥ 6 j∈F
j∈F
νF !e|νF | . √ max{1, e νj }
With these estimates we obtain from (3.39) that |νF |! ¯νF |νF |! νF ) √ d d , max{1, e νj } ≤ β(ν) ≤ νF ! νF !
(3.41)
j∈F
¯ 1 = e d 1 ≤ where d¯j := edj , j ∈ F . We conclude by noticing that d
e p ¯ 3 < 1. Since d is (N) summable, we may apply Theorem 3.1 to conclude the p (F) summability of tν . With the p (F) summability of tν , the best N -term convergence rate estimate (3.18) follows from (3.13). . Convergence rates of Legendre expansions The analyticity result Theorem 3.2 contains, as a special case, the rate of convergence of best N -term truncations of Taylor expansions in the
378
C. Schwab and C. J. Gittelson
stochastic coordinates yj . This result and the proof, however, also allow us to obtain corresponding results for Legendre expansions, as we shall show next. We shall obtain bounds in L2 and pointwise bounds in the parameter vector y. To this end, it will be convenient to introduce two types of Legendre expansions with different normalization of the Legendre basis: the Legendre basis (Pn )n≥0 with L∞ normalization (3.42)
Pn L∞ ([−1,1]) = Pn (1) = 1 √ and the L2 normalized sequence Ln (t) = 2n + 1Pn (t), which satisfies 1 dt |Ln (t)|2 = 1. 2 −1 We recall that L0 = P0 = 1 and, for ν ∈ F, ) ) Pνj (yj ) and Lν (y) := Lνj (yj ). Pν (y) := j≥1
(3.43)
j≥1
Note that (Lν )ν∈F is an orthonormal basis of L2 (Γ, µ) where dµ denotes the dy tensor product of the (probability) measures 2 j on [−1, 1] and is therefore a probability measure on Γ = [−1, 1]N . Since u ∈ L∞ (Γ, µ; V ) ⊂ L2 (Γ, µ; V ), it admits unique expansions
uν Pν (y) = vν Lν (y), (3.44) u(y) = ν∈F
ν∈F
that converge in L2 (Γ, µ; V ), where the coefficients uν , vν ∈ V are defined by ! "1/2 ) u(y)Lν (y)µ(dy) and uν := (1 + 2νj ) vν . (3.45) vν := Γ
j≥1
Once again, the key step in establishing sharp rates of convergence of best N -term Legendre GPC approximations of the solution of the parametric, deterministic problem are sharp a priori bounds on the Legendre coefficients. In order to prove their p (F) summability, we estimate the quantities uν V and vν V . By (3.45), ! "1 2 ) (1 + 2νj ) vν V , ν ∈ F. (3.46)
uν V = j≥1
Therefore vν V ≤ uν V and it will be sufficient to prove the p summability of ( uν V )ν∈F . We have the following analogue to Lemma 3.5 from Cohen et al. (2011).
379
Sparse tensor discretizations for sPDEs
Lemma 3.6. Assume that UEAC(r, R) holds for some 0 < r ≤ R < ∞. Let = (j )j≥1 be a δ-admissible sequence for some 0 < δ < r that satisfies j > 1 for all j such that νj = 0. Then, for any ν ∈ F we have the estimate
f V ) −ν ϕ(j )(2νj + 1)j j , (3.47)
uν V ≤ δ j≥1,νj =0
where ϕ(t) :=
πt 2(t−1)
for t > 1.
Based on Lemma 3.6 and a judicious choice of δ-admissible sequence, the following theorem was shown in Cohen et al. (2011). It is the analogue to Theorem 3.2 for Legendre GPC expansions. Theorem 3.7. If a(x, z) satisfies UEAC(r, R) for some 0 < r ≤ R < ∞ and if ( ψj L∞ )j≥1 ∈ p (N) for some p < 1, then the sequences ( uν V )ν∈F and ( vν V )ν∈F belong to p (F) for the same value of p. The Legendre expansions (3.44) converge in L∞ (Γ, µ; V ) in the following sense. If (ΛN )N ≥1 is any sequence of finite sets which exhausts F, then the partial sums SΛN u(y) := ν∈ΛN uν (x)Pν (y) = ν∈ΛN vν (x)Lν (y) satisfy lim sup u(y) − SΛN u(y) V = 0.
(3.48)
N →+∞ y∈Γ
If ΛN is a set of ν ∈ F corresponding to indices of N maximal uν V , sup u(y) − SΛN u(y) V ≤ ( uν V ) p (F) N −s ,
s :=
y∈Γ
1 − 1. p
(3.49)
If ΛN is a set of ν ∈ F corresponding to indices of N maximal vν V ,
u − SΛN u L2 (Γ,µ;V ) ≤ ( vν V ) p (F) N −s ,
s :=
1 1 − . p 2
(3.50)
Spatial regularity and finite element discretization So far, we have considered approximations of u(y) with respect to the parameter vector y ∈ Γ under the assumption that the coefficients tν , vν and uν could be obtained exactly. In practice, however, such coefficients must be approximated by a discretization scheme such as the finite element method. An additional discretization error arises in doing so which can be analysed using standard convergence results for finite element approximations. It is interesting to note that the regularity required of the solution u(y) must then involve both smoothness in the stochastic parameter vector y and in the spatial domain D. We will now present some convergence results of this type. We assume that D is a bounded Lipschitz polyhedron D and that in D we are given a one-parameter, affine family of continuous, piecewise linear finite element spaces (Vh )h>0 on a shape-regular family of simplicial triangulations of mesh width h > 0 in the sense of Ciarlet (1978).
380
C. Schwab and C. J. Gittelson
To obtain regularity of the parametric solution u(y) in D, additional regularity on f is required: we shall assume f ∈ L2 (D) ⊂ V . Then
f V ≤ CP f L2 (D) ,
(3.51) √ where CP is the Poincar´e constant of D (i.e., CP = 1/ λ1 with λ1 being the smallest eigenvalue of the Dirichlet Laplacian in D). Then the smoothness space W ⊂ V is the space of all solutions to the Dirichlet problem −∆u = f
u|∂D = 0,
(3.52)
W = {v ∈ V ; ∆v ∈ L2 (D)}.
(3.53)
in D,
with f ∈ L2 (D) We define the W -seminorm and the W -norm by |v|W = ∆v L2 (D) ,
v W := v V + |v|W .
(3.54)
It is well known that W = H 2 (D) ∩ V for convex D ⊂ Rd . Then any w ∈ W may be approximated in V with convergence rate O(h) by continuous, piecewise linear finite element approximations on regular quasi-uniform simplicial partitions of D of mesh width h (see, e.g., Ciarlet (1978), Braess (2007), Brenner and Scott (2002)). Therefore, denoting by M = dim(Vh ) ∼ h−d the dimension of the finite element space, we have for all w ∈ W the convergence rate, as M = dim(Vh ) → ∞, of inf w − vh V ≤ Ct M −t |w|W ,
vh ∈Vh
(3.55)
with some 0 < t ≤ 1/d (with t = 1/d if W ⊂ H 2 (D)). Spatial regularity of the parametric solution u(y) now takes the form of p-summability of W -norms of the tν , uν and vν . In addition to the requirement f ∈ L2 (D), we add a fourth assumption to conditions (C1)–(C3) on the coefficient a(z, x). (C4) The gradients of the functions a ¯ and ψj , for j ≥ 1, are defined for ∞ every x ∈ D and belong to L (D). Then the following regularity holds (see Cohen et al. (2011)). Theorem 3.8. Let f ∈ L2 (D) and let a(z, x) satisfy UEAC(r, R) for some 0 < r ≤ R < ∞. If ( ψj L∞ (D) )j≥1 ∈ p (N) and ( ∇ψj L∞ (D) )j≥1 ∈ p (N) for some 0 < p < 1, then ( tν W )ν∈F , ( uν W )ν∈F and ( vν W )ν∈F belong to p (F). We now obtain bounds on the convergence rates of the fully discrete approximation of u by linear combinations
u ν Pν (y), or vν Lν (y), tν y ν , ν∈Λ
ν∈Λ
ν∈Λ
Sparse tensor discretizations for sPDEs
381
where Λ ⊂ F is finite and when the coefficients tν , u ν and vν are finite element approximations of tν , uν and vν , respectively, from finite element spaces (Vν )ν∈Λ . For efficiency of approximation as well as in the specific sparse tensor approximation schemes, it will be crucial that for given ν ∈ Λ ⊂ F, the approximation space Vν may depend on ν. To this end, we introduce the vector M = (Mν )ν∈Λ of the dimensions Mν = dimVν , ν ∈ Λ, of the finite element approximation spaces Vν used for approximating the tν . Without loss of generality, we may assume that the error bound (3.55) holds for all such M up to increasing Ct , and express the approximation rate in terms of Ndof , i.e., the total number of degrees of freedom involved :
Ndof := Mν . (3.56) ν∈Λ
Then we may estimate
tν − tν V +
tν V . tν y ν ≤ supu(y) − y∈Γ ν∈Λ
V
(3.57)
ν ∈Λ /
ν∈Λ
The first term on the right-hand side of (3.57) corresponds to the error occurring from the finite element discretization of the tν ; the second term on the right-hand side corresponds to the error incurred by truncating the Taylor series. By taking Λ := ΛN , the set of indices corresponding to N maximal tν W , it is bounded by
tν W ≤ CV N −s ,
ν ∈Λ /
s :=
1 − 1. p
The global error can then be bounded by
ν Mν−t |tν |W + CV N −s . tν y ≤ Ct supu(y) − y∈Γ ν∈ΛN
W
(3.58)
(3.59)
ν∈ΛN
We now have an optimization problem: minimize the degrees of freedom Mν such that Ndof is minimized for a fixed contribution Ct ν∈ΛN Mν−t |tν |W to the error, i.e., we consider the minimization
Mν ; Mν−t |tν |W ≤ N −s . (3.60) min ν∈ΛN
ν∈ΛN
In Cohen et al. (2011), this minimization problem is solved and the following ν and vν denote the V -projection result is obtained. To state it, we let tν , u of tν , uν and vν , respectively, onto Vν .
382
C. Schwab and C. J. Gittelson
Theorem 3.9. Assume that the finite element spaces have the approximation property (3.55). Then, under the same assumptions as in Theorem 3.8, the following hold. (a) Let ΛN be a set of indices corresponding to N maximal tν W . Then there exists a choice of finite element spaces Vν of dimension Mν , ν ∈ ΛN , such that
1 − min{s,t} ν , s := − 1, tν y ≤ CNdof supu(y) − p y∈Γ ν∈ΛN V where Ndof = ν∈ΛN Mν , C = (C¯t + ( tν V ) p (F) ) ( tν W ) p (F) . (b) Let ΛN be a set of indices corresponding to N maximal uν W . Then there exists a choice of finite element spaces Vν of dimension Mν , ν ∈ ΛN , such that
1 − min{s,t} u ν Pν (y) ≤ CNdof , s := − 1, supu(y) − p y∈Γ ν∈ΛN V where Ndof = ν∈ΛN Mν , C = (C¯t + ( uν V ) p (F) ) ( uν W ) p (F) . (c) Let ΛN be a set of indices corresponding to N maximal vν W . Then there exists a choice of finite element spaces Vν of dimension Mν , ν ∈ ΛN , such that
1 1 − min{s,t} vν Lν ≤ CNdof , s := − , u − 2 p 2 ν∈ΛN
where Ndof =
L (Γ,µ;V )
ν∈ΛN Mν ,
1 C = (C¯t2 + ( vν V ) 2p (F) ) 2 ( vν W ) p (F) .
3.2. Parabolic problems A class of random parabolic problems For 0 < T < ∞, we consider in the bounded time interval I = (0, T ) linear, parabolic initial boundary value problems with random coefficients where, for ease of exposition, we assume that these coefficients are independent of t. We still denote by D ⊂ Rd a bounded Lipschitz domain and we denote the associated space–time cylinder by QT = I × D. In QT , we consider the random parabolic initial boundary value problem ∂u − ∇ · (a(x, ω)∇u) = g(t, x), u|∂D×I = 0, ∂t As before, we make the following assumption. Assumption 3.10.
u|t=0 = h(x).
(3.61)
There exist constants 0 < a− ≤ a+ < ∞ such that
∀x ∈ D, ∀ω ∈ Ω :
0 < a− ≤ a(x, ω) ≤ a+ .
Sparse tensor discretizations for sPDEs
383
It will be convenient to impose a stronger requirement. Assumption 3.11.
The functions a ¯ and ψj satisfy
κ a ¯− ,
ψj L∞ (D) ≤ 1+κ j≥1
¯(x) > 0 and κ > 0. with a ¯− = minx∈D a Assumption 3.10 is then satisfied by choosing ¯− − a− := a
κ 1 a ¯− = a ¯− . 1+κ 1+κ
(3.62)
We consider a space–time variational formulation of problem (3.61). To state it, we denote by V = H01 (D) and H = L2 (D) and identify H with its dual: H H . Then V ⊂ H H ⊂ V = H −1 (D) is a Gelfand evolution triple. For the variational formulation of (3.61), we introduce the Bochner spaces X = L2 (I; V ) ∩ H 1 (I; V )
and
Y = L2 (I; V ) × H.
(3.63)
We equip X and Y with norms · X and · Y , respectively, which are for u ∈ X and v = (v1 , v2 ) ∈ Y given by
u X = ( u 2L2 (I;V ) + u 2H 1 (I;V ) )1/2 and v Y = ( v1 2L2 (I;V ) + v2 2H )1/2 . Given a coefficient realization a(ω, ·) with ω ∈ Ω, a weak solution of problem (3.61) is a function u(·, ·, ω) ∈ X such that du , v1 dt + a(x, ω)∇u(t, x, ω) · ∇v1 (t, x) dx dt + u(0, ·, ω), v2 H I dt I D H = g(t, ·), v1 dt + h, v2 H , ∀v ∈ Y. (3.64) I
The following proposition from Schwab and Stevenson (2009) guarantees its well-posedness for all ω ∈ Ω, under Assumption 3.10. Proposition 3.12. Assume that g ∈ L2 (I; V ), h ∈ L2 (D) and that Assumption 3.10 holds. Then, for every ω ∈ Ω, the parabolic operator B ∈ L(X , Y ) induced by (3.61) in the weak form (3.64) is an isomorphism: for given (g, h) ∈ Y and every ω ∈ Ω, problem (3.64) has a unique solution u(·, ·, ω), which satisfies the a priori estimate
u X ≤ C g L2 (I;V ) + h L2 (D) , (3.65) where the constant C is bounded uniformly for all realizations.
384
C. Schwab and C. J. Gittelson
As before, we assume that the coefficient a in (3.61) is characterized by a sequence of random variables (yj )j≥1 , i.e., that
yj (ω)ψj (x). (3.66) a(x, ω) = a ¯(x) + j≥1
We again assume that the ψj are scaled in L∞ (D) such that yj : Ω → R, j = 1, 2, . . . are distributed identically and uniformly, and that the ψj are scaled in L∞ (D) such that the range of the Yj is [−1, 1] (see Lemma 2.20). Parametric deterministic parabolic problems As before, with (3.61) we associate the following parametric family of deterministic parabolic problems: given a source term g(t, x) and initial data h(x), for y ∈ Γ, find u(t, x, y) such that ∂u (t, x, y) − ∇x · [a(x, y)∇x u(t, x, y)] = g(t, x), ∂t u(t, x, y)|∂D×I = 0, u|t=0 = h(x),
in QT ,
(3.67)
where, for every y = (y1 , y2 , . . .) ∈ Γ, a(x, y) = a ¯(x) +
∞
yj ψj (x)
j=1
in L∞ (D). For the weak formulation of (3.67), we follow (3.64) and define for y ∈ Γ the parametric family of bilinear forms Γ y → b(y; w, (v1 , v2 )) : X × Y → R by dw , v1 (t, ·) dt (3.68) b(y; w, (v1 , v2 )) = dt I H a(x, y)∇w(t, x) · ∇v1 (t, x) dx dt + w(0), v2 H . + D
I
We also define the linear form f (v) = g(t), v1 (t)H dt + h, v2 H , v = (v1 , v2 ) ∈ Y.
(3.69)
I
The variational form for the parametric, deterministic parabolic problems (3.67) reads: given f ∈ Y , find u(y) : Γ y → X such that b(y; u, v) = f (v)
∀v = (v1 , v2 ) ∈ Y, y ∈ Γ.
(3.70)
Proposition 3.13. For each y ∈ Γ, the operator B(y) ∈ L(X , Y ) defined by (B(y)w)(v) = b(y, w, v) is boundedly invertible. The norms of B(y) and B(y)−1 can be bounded uniformly by constants which only depend on a− , a+ , T and the spaces X and Y. In particular, the solution u of problem (3.70) is uniformly bounded in X for all y ∈ Γ. Moreover, the map u(·, ·, y) : Γ → X is measurable as a Bochner function.
Sparse tensor discretizations for sPDEs
385
The proof of this theorem can be found in Appendix A of Schwab and Stevenson (2009), or in Hoang and Schwab (2010b). The variational formulation (3.70) is pointwise in the parameter and is the basis for sampling methods, such as the Monte Carlo method. For stochastic Galerkin approximation, (3.70) needs to be extended to the parameter space. To this end, we introduce Bochner spaces X = L2 (Γ, µ; X )
and
Y = L2 (Γ, µ; Y)
and note X L2 (Γ, µ) ⊗ X ,
Y L2 (Γ, µ) ⊗ Y.
With the bilinear form B(·, ·) : X ×Y → R and the linear form F (·) : Y → R defined by B(u, v) = b(y, u, v)µ(dy) and F (v) = f (v)µ(dy). (3.71) Γ
Γ
we consider the variational problem: find u∈X
such that B(u, v) = F (v)
for all v ∈ Y.
(3.72)
The Galerkin formulation is well-posed, as we see in the next result (see Hoang and Schwab (2010b)). Proposition 3.14. Under Assumption 3.10, for every f as in (3.69) with g ∈ L2 (I; V ) and h ∈ L2 (D), the parametric deterministic variational problem (3.72) admits a unique solution u ∈ X . Since the family {Lν }ν∈F of tensor product polynomials forms a complete orthonormal system of L2 (Γ, µ), each u ∈ X can be represented as
uν Lν , (3.73) u= ν∈F
where the coefficients uν ∈ X are defined by uν = u(·, ·, y)Lν (y)µ(dy) ∈ X , Γ
the integral being understood as a Bochner integral of X -valued functions over Γ. With this result, we recover from the parametric, deterministic solution the random solution u(t, x, ω) by inserting the random variables Ym (ω) for the coordinate vector y ∈ Γ. Theorem 3.15. Under Assumptions 3.10, 3.11, for given g ∈ L2 (I; V ) and h ∈ H, the following variational problem admits a unique solution.
386
C. Schwab and C. J. Gittelson
Find u ∈ L2 (Ω; X ) such that, for every v(t, x, ω) = (v1 (t, x, ω), v2 (x, ω)) ∈ L2 (Ω; Y), , du (t, ·, ·), v1 (t, ·, ·) dt E I dt H , a(x, ω)∇u(t, x, ω) · ∇v1 (t, x, ω) dx dt +E ,I D +E u(0, x, ω)v2 (x, ω) dx D , , g(t, x)v1 (t, x, ω) dx dt + E h(x)v2 (x, ω) dx . (3.74) =E I
D
D
This unique solution satisfies the a priori estimate
u L2 (Ω;X ) ≤ C(a) g L2 (I;V ) + h H .
(3.75)
Galerkin approximation As in the elliptic case, we obtain GPC approximations by Galerkin projections onto suitable spaces of polynomials in y ∈ Γ. For every finite subset Λ ⊂ F of cardinality not exceeding N , we define spaces of X - and Y-valued polynomial expansions ,
uν (t, x)Lν (y) ; uν ∈ X ⊂ X , X Λ = uΛ (t, x, y) = ν∈Λ
and YΛ =
,
vΛ (t, x, y) = vν (t, x)Lν (y) ; vν ∈ X ⊂ Y. ν∈Λ
In the Legendre basis (Lν )ν∈F , we write
v1ν (t, x)Lν (y) and v1Λ (t, x, y) =
v2Λ (x, y) =
ν∈Λ
v2ν (x)Lν (y),
ν∈Λ
respectively, where vν = (v1ν , v2ν ) ∈ Y for all ν ∈ F. We consider the (semidiscrete) Galerkin approximation: find uΛ ∈ X Λ
such that B(uΛ , vΛ ) = F (vΛ )
∀ vΛ ∈ Y Λ .
(3.76)
Theorem 3.16. For any finite subset Λ ⊂ F of cardinality exactly equal to N , the problem (3.76) corresponds to a coupled system of N = #Λ linear parabolic equations. Under Assumptions 3.10, 3.11, this coupled system of parabolic equations is stable uniformly with respect to Λ ⊂ F: for any Λ ⊂ F, problem (3.76) admits a unique solution uΛ ∈ X Λ which satisfies
387
Sparse tensor discretizations for sPDEs
the a priori error bound !
u − uΛ X ≤ c
"1/2
uν 2X
.
ν ∈Λ /
Here, uν ∈ X are the Legendre coefficients of the solution of the parametric problem in (3.73) and the constant c is independent of Λ. Proof. To prove the uniform well-posedness of the coupled parabolic system resulting from the Galerkin discretization in Γ, we prove that the following inf-sup condition holds: there exist α, β > 0 such that for any Λ ⊂ F, sup
uΛ ∈X Λ ,vΛ ∈Y Λ
sup
inf
0=uΛ ∈X Λ 0=vΛ ∈Y Λ
∀0 = vΛ ∈ Y Λ :
|B(uΛ , vΛ )| ≤ α < ∞,
uΛ X vΛ Y
(3.77)
|B(uΛ , vΛ )| ≥ β > 0,
uΛ X vΛ Y
(3.78)
|B(uΛ , vΛ ))| > 0,
(3.79)
sup
0=uΛ ∈X Λ
where the constants α, β are in particular independent of the choice of Λ ⊂ F (a proof can be found in the Appendix of Hoang and Schwab (2010b)). The projected parametric deterministic parabolic problem (3.76) has a unique solution, and, in virtue of the independence of α, β from Λ, is wellposed and stable with stability bounds which are independent of the choice of Λ ⊂ F. Hence, the error incurred by this projection is quasi-optimal:
u − uΛ X ≤ (1 + β −1 ( g L2 (I;V ) + h L2 (D) )) inf u − vΛ X v ∈X Λ
≤ c u − uν Lν = c uν Lν . ν∈Λ
X
ν ∈Λ /
X
By the normalization of the tensorized Legendre polynomials Lν and by Parseval’s equality, 2
uν Lν =
uν 2X . ν ∈Λ /
X
ν ∈Λ /
The conclusion then follows with c = 1 + β −1 ( g L2 (I;V ) + h L2 (D) ). Best N -term GPC approximations As in the elliptic case, Theorem 3.16 again suggests choosing Λ ⊂ F to be the set of the largest N coefficients uν X . Once (sharp and computable) a priori bounds for uν in X are known, one algorithmic strategy could be to optimize the sets Λ ⊂ F according to these a priori bounds (one such strategy is outlined in Section 4.1 for the elliptic case). Alternatively,
388
C. Schwab and C. J. Gittelson
an optimal, adaptive Galerkin method will yield iteratively quasi-optimal sequences ΛN of active indices. We now determine such a priori bounds. A best N -term convergence rate estimate in terms of N will result from these bounds once more using (3.13). Therefore, the convergence rate of spectral approximations such as (3.76) of the parabolic problem on the infinite-dimensional parameter space Γ is determined by the summability of the Legendre coefficient sequence ( uν X )ν∈F . We shall now prove that summability of this sequence is determined by that of the sequence (ψj (x))j∈N in the input’s fluctuation expansion (3.66). Throughout, Assumptions 3.10 and 3.11 will be required to hold. In addition, we shall make the following requirement. Assumption 3.17.
There exists 0 < p < 1 such that ∞
ψj pL∞ (D) < ∞.
(3.80)
j=1
Based on this assumption, in Hoang and Schwab (2010b) the following result was proved, with a proof along similar lines to that of the elliptic result Theorem 3.7. Theorem 3.18. If Assumptions 3.10, 3.11 and 3.17 hold for some 0 < p < 1, ν∈F uν pX is finite. Moreover, there is a sequence (ΛN )N ∈N ⊂ F of index sets with cardinality not exceeding N such that the solutions uΛN of the Galerkin semidiscretized problems (3.76) satisfy
u − uΛN X ≤ CN −σ ,
σ=
1 1 − . p 2
This establishes a rate of convergence for best N -term GPC approximations in the stochastic Galerkin semidiscretization (3.76), which is analogous to the estimate (3.50) for the parametric elliptic problem. Note that Theorem 3.18 holds in the semidiscrete setting, i.e., under the assumption that the Galerkin projections (3.76) can be computed exactly. To obtain actually computable realizations of such approximations, however, the coefficients need to be approximated in a hierarchical family of finite element spaces in the domain D. In order to obtain convergence rates analogous to Theorem 3.9 in the elliptic setting, regularity results for the parametric, parabolic problems (3.67) are required. Such results on best N -term approximation of expansions whose coefficients are measured in scales of spaces with additional smoothness in x and t are obtained in Hoang and Schwab (2010b).
389
Sparse tensor discretizations for sPDEs
3.3. Second-order hyperbolic problems Analogous results may also be proved for linear, second-order hyperbolic problems with random coefficients. Such equations arise, for example, in the mathematical description of wave propagation in media with uncertain material properties. Below we recapitulate recent results from Hoang and Schwab (2010a) which are analogous to those for the elliptic and parabolic cases. One important distinction to the parabolic case, however, is that a space–time variational principle is not available so that some of the proofs in Hoang and Schwab (2010a) are significantly different from the elliptic case. A class of wave equations with random coefficients For 0 < T < ∞, we consider in I = (0, T ) the following class of linear, second-order hyperbolic equations with random coefficients: let D be a bounded Lipschitz domain in Rd . We define the space–time cylinder QT = I × D. In QT , we consider the stochastic wave equation ∂2u − ∇ · (a(x, ω)∇u) = g(t, x), ∂t2
u|∂D×I = 0,
u|t=0 = g1 ,
ut |t=0 = g2 .
(3.81) As before, we assume the coefficient a(ω, x) to be a random field on a probability space (Ω, Σ, P) over L∞ (D). The forcing g and initial data g1 and g2 are assumed to be deterministic. To ensure well-posedness of (3.81), we once more require Assumptions 3.10 and 3.11. To state the weak form of the initial boundary value problem (3.81), we let V = H01 (D) and H = L2 (D), and require g ∈ L2 (I; H),
g1 ∈ V,
g2 ∈ H.
(3.82)
For the variational formulation of (3.81), we introduce the Bochner spaces X = L2 (I; V ) ∩ H 1 (I; H) ∩ H 2 (I; V ),
Y = L2 (I; V ) × V × H.
(3.83)
A weak solution of the hyperbolic initial boundary value problem (3.81) is any function u ∈ X such that, for every v = (v0 , v1 , v2 ) ∈ Y, 2 d u (t, ·), v0 (t, ·) dt + u(0), v1 V + ut (0), v2 H 2 I dt H + a(x, ω)∇u(t, x, ω) · ∇v0 (t, x) dx dt I D g(t, x)v0 (t, x) dx dt + g1 , v1 V + g2 , v2 H . (3.84) = I
D
We have the following result, from Hoang and Schwab (2010a). Proposition 3.19. Under Assumption 3.10 and under condition (3.82), for every ω ∈ Ω, the initial boundary value problem (3.84) admits a unique
390
C. Schwab and C. J. Gittelson
weak solution u ∈ X . The following estimate holds:
u X ≤ C( g L2 (I;H) + g1 V + g2 H ),
(3.85)
where the constant C depends only on T and on a− and a+ in Assumption 3.10. We next present results on the stochastic Galerkin approximation of the initial boundary value problem (3.84). Parametric deterministic wave equations Given a forcing function g(t, x) and initial data g1 (x) and g2 (x) satisfying (3.82), for each y ∈ Γ we consider the parametric, deterministic initial boundary value problem ∂ 2 u(t, x, y) − ∇x · (a(x, y)∇x u(t, x, y)) = g(t, x) in QT , ∂t2 u(t, x, y)|∂D×I = 0, u|t=0 = g1 , ut |t=0 = g2 ,
(3.86)
where the parametric coefficient a(x, y) is defined as in the elliptic and parabolic cases in (3.66). Again, for each y ∈ Γ, we define the bilinear map b : X × Y → R by 2 d w b(y; w, (v0 , v1 , v2 )) = (t, ·), v0 (t, ·) dt (3.87) dt2 I H a(x, y)∇w(t, x) · ∇v0 (t, x) dx dt + I
D
+ u(0), v1 V + ut (0), v2 H . We also define the linear form on Y, g(t, x)v0 (t, x) dx dt + g1 , v1 V + g2 , v2 H . f (v) = I
D
The pointwise parametric (with respect to y ∈ U ) variational formulation of the parametric, deterministic problem (3.86) then reads: find u(y) ∈ X :
b(y; u, v) = f (v)
∀v = (v0 , v1 , v2 ) ∈ Y.
(3.88)
Note that here y-dependent data g, g1 and g2 would be equally admissible. This pointwise in y parametric variational formulation is well-posed uniformly with respect to the parameter vector y. More precisely, we have the following result (see Hoang and Schwab (2010a)). Proposition 3.20. Under Assumption 3.10 and under conditions (3.82), for every y ∈ Γ, the problem (3.88) admits a unique weak solution u(y) ∈ X . The parametric weak solutions {u(y) ; y ∈ Γ} ⊂ X satisfy the a priori estimates ∀y ∈ Γ :
u(·, ·, y) X ≤ C( g L2 (I;H) + g1 V + g2 H ),
(3.89)
Sparse tensor discretizations for sPDEs
391
where the constant C is independent of y. The map u : Γ → X is strongly measurable as an X -valued function. An analogous result also holds for the Galerkin formulation of the parametric deterministic problem. To state this, we introduce the Bochner spaces X = L2 (Γ, µ; X ) and Y = L2 (Γ, µ; Y) and define on these spaces the bilinear form B(·, ·) : X × Y → R and the linear form F (·) : Y → R as b(y; u, v)µ(dy), F (v) = f (v)µ(dy). B(u, v) = Γ
Γ
We may then consider the variational problem: find u∈X
such that B(u, v) = F (v)
∀v ∈ Y.
(3.90)
Proposition 3.21. Under Assumptions 3.10 and 3.11, problem (3.90) admits a unique solution u ∈ X , i.e., the parametric solution map belongs to to the Bochner space L2 (Γ, µ; X ). Moreover, in terms of the orthonormal basis of L2 (Γ, µ) given by the tensorized Legendre polynomials (Lν )ν∈F , each function u ∈ X can be written as an (unconditionally convergent in X ) expansion in tensorized Legendre polynomials:
uν Lν , uν ∈ X . (3.91) u= ν∈F
Semidiscrete Galerkin approximation Spectral approximations of the parametric, deterministic wave equation (3.86) are once again obtained by projection onto finite linear combinations of tensorized Legendre polynomials. We briefly present the corresponding results from Hoang and Schwab (2010a). For any set Λ ⊂ F of finite cardinality, we define polynomial subspaces of X and Y: ,
uν (t, x)Lν (y) ; uν ∈ X ⊂ X , X Λ = uΛ (t, x, y) = ν∈Λ
and
,
vν (t, x)Lν (y) ; vν ∈ Y ⊂ Y. Y Λ = vΛ (t, x, y) = ν∈Λ
Denoting vν = (v0ν , v1ν , v2ν ), we may write the test functions v ∈ Y Λ componentwise as Legendre GPC expansions:
v0ν (t, x)Lν (y), viΛ (x, y) = viν (x)Lν (y) i = 1, 2. v0Λ (t, x, y) = ν∈Λ
ν∈Λ
We consider the following semidiscrete Galerkin projection of u onto X Λ .
392
C. Schwab and C. J. Gittelson
Find uΛ ∈ X Λ
such that B(uΛ , vΛ ) = F (vΛ )
∀vΛ ∈ Y Λ .
(3.92)
Theorem 3.22. Under Assumptions 3.10 and 3.11, for every subset Λ ⊂ F of finite cardinality, there exists a unique solution uΛ ∈ X Λ to the Galerkin equations (3.92). It is to be expected that the semidiscrete Galerkin approximations are quasi-optimal, i.e., their error is controlled by the best approximation error. This is indeed once more the case. However, due to the lack of a space– time variational formulation, additional regularity of solutions, in particular point values with respect to t, is required. To this end, we introduce the space Z := H 1 (I; V ) ∩ H 2 (I; H) ⊂ C 0 (I; V ) ∩ C 1 (I; H).
(3.93)
Note that Z ⊂ X . The following error estimate for semidiscrete approximations of parametric solutions in Z holds. Proposition 3.23. Assume that u ∈ L2 (Γ, µ; Z). Then, for all ν ∈ F the coefficient uν in (3.91) belongs to Z. Assume further that for a subset Λ ⊂ F, uΛ ∈ L2 (Γ, µ; Z). Then we have the error bound "1/2 !
u − uΛ L2 (Γ,µ;X ) ≤ c uν Lν =c
uν 2Z . (3.94) 2 ν∈F\Λ
L (Γ,µ;Z)
ν∈F\Λ
Here, the constant c > 0 depends only on the coefficient bounds a− and a+ in Assumption 3.10. For a proof, we refer to Hoang and Schwab (2010a). Proposition 3.23 once more implies quasi-optimality of the L2 (Γ, µ; X ) projection uΛ ∈ X Λ defined in (3.92). We note, however, that in its proof, the extra regularity u ∈ L2 (Γ, µ; Z) was required. It is therefore of interest to establish a regularity result for uΛ which ensures u ∈ L2 (Γ, µ; Z) and, hence, implies the semidiscrete error bound (3.94). To this end, we recall the smoothness space W ⊂ V defined in (3.52) and (3.53). On W , we define the W -seminorm and the W -norm as in (3.54). The role of the space W for the regularity of the solution of the parametric wave equation becomes clear from the following result. Proposition 3.24.
If Assumption 3.11 holds and if, moreover, g ∈ H 1 (I; H),
g1 ∈ W,
g2 ∈ V,
(3.95)
then for every y ∈ Γ we have u(·, ·, y) ∈ Z, and its Z-norm is bounded uniformly for all y ∈ Γ.
Sparse tensor discretizations for sPDEs
393
The Galerkin projections require the corresponding space–time solution space W = L2 (I; W ) ∩ H 1 (I; V ) ∩ H 2 (I; H),
(3.96)
where W is defined in (3.53). Note that W ⊂ Z for Z defined in (3.93). We have the following regularity result for the Galerkin-projected GPC approximations of the parametric, deterministic wave equation (3.86). Proposition 3.25. Under Assumptions 3.10 and 3.11, and if, in addition, a(·, ·) ∈ L∞ (Γ; W 1,∞ (D)), g ∈ H 1 (I; H), g1 ∈ W and g2 ∈ V , then, for every subset Λ ⊂ F of finite cardinality, uΛ ∈ L2 (Γ, µ; W) ⊂ L2 (Γ, µ; Z). For the parametric wave equations, the extra regularity uΛ ∈ L2 (Γ, µ; W) is therefore already required to ensure quasi-optimality of the Galerkin projections. It is also necessary in order to prove best N -term convergence rates analogous to those for the parametric elliptic and the parabolic problems. To state these results, we therefore require the following. Assumption 3.26. We assume in (3.66) that a ¯ ∈ W 1,∞ (D) and ψj ∈ W 1,∞ (D) are such that ∞
ψj W 1,∞ (D) < ∞.
j=1
Moreover, we assume that, for some 0 < p < 1, ∞
( ψj pL∞ (D) + ∇ψj pL∞ (D) ) < ∞.
j=1
Note that Assumption 3.26 implies Assumption 3.11. Under these assumptions we then have the following regularity and best N -term convergence result (see Hoang and Schwab (2010a) for a proof). Proposition 3.27. Under Assumptions 3.10, 3.11 and 3.26, ν∈F uν pZ is finite for the same value of 0 < p < 1 as in these assumptions. If, moreover, the compatibility condition (3.95) holds, there exists a sequence (ΛN ) ⊂ F of index sets with cardinality not exceeding N such that the solutions uΛN of the Galerkin semidiscretized problem (3.92) satisfy, as N → ∞, the error bound
u − uΛN X ≤ CN −σ , Here, the constant C depends only on
σ=
ν∈F
1 1 − . p 2
uν pZ .
394
C. Schwab and C. J. Gittelson
4. Sparse tensor discretizations 4.1. Sparse tensor stochastic Galerkin discretizations We consider the diffusion equation with a stochastic diffusion coefficient, as in Section 2.3, discretized by the Legendre chaos basis; see Section 2.3. Foundations for subsequent Galerkin approximation were laid in Section 2.3. In Section 3.1, we proved convergence rates of optimal approximations by non-constructive methods. In this section, we consider Galerkin approximations in problem-adapted subspaces of L2 (Γ, µ; V ) with a sparse tensor product structure. As in Bieri, Andreev and Schwab (2009), we show that these computable approximations achieve the optimal convergence rates up to logarithmic factors. We refer to Gittelson (2011c, 2011d) for an analysis of adaptive solvers with similar convergence properties. For a bounded Lipschitz domain D ⊂ Rd , we set V = H01 (D). The dual space of V is V = H −1 (D). We denote the parameter domain by Γ := [−1, 1]∞ ; µ is the product of uniform measures on Γ, as in Section 2.2. Wavelet finite element discretization on the physical domain D Finite element wavelets provide a stable, hierarchical multi-level basis of V = H01 (D). We give a brief overview of the construction of such bases and refer to Cohen (2003) and Nguyen and Stevenson (2009) for details. Let D ⊂ Rd be a bounded Lipschitz polyhedron with plane faces, and let T0 be a regular simplicial mesh of D. For all ∈ N, let T be the mesh of D constructed by regular refinements of the initial triangulation T0 . We denote by I the interior nodes of T and by N := I \ I−1 the new nodes on discretization level ∈ N. On the coarsest level, we have N0 = I0 . Also, denote by E the set of edges of T . Let VD be the space of continuous piecewise linear functions on the T . We recall the standard approximation result
v − PD v H01 (D) ≤ CτD 2−τ v H 1+τ (D)
∀v ∈ H 1+τ (D),
0 ≤ τ ≤ 1, (4.1)
where PD is the orthogonal projection in H01 (D) onto VD and CτD > 0 is independent of . The dimension of VD satisfies dim VD 2d
(4.2)
as → ∞. The standard, so-called ‘one-scale’ basis of VD consists of the piecewise linear, nodal basis functions (λn )n∈I determined by λn (m) = δnm
∀m ∈ I .
(4.3)
Following Nguyen and Stevenson (2009), we construct an alternative, hierarchical basis of VD .
Sparse tensor discretizations for sPDEs
395
We define auxiliary functions (ηn )n∈I−1 in VD satisfying −1 −1 L2 (D) δnm ηn L2 (D) λm
L2 (D) ηn , λm
for all n, m ∈ I−1 and all ∈ N. 3 ηn (m) := − 1/2 0
(4.4)
For d = 1, m = n, [m, n] ∈ E , all other m ∈ I ,
n ∈ I−1 ,
(4.5)
and for d = 2,
m = n, 14 ηn (m) := − 1 [m, n] ∈ E , 0 all other m ∈ I ,
n ∈ I−1 .
(4.6)
0 := λ0 for m ∈ I and Wavelets are given by ψm 0 m := λm − ψm
λm , λn−1 L2 (D) n∈I−1
ηn , λn−1 L2 (D)
ηn ,
m ∈ N .
(4.7)
We define the detail spaces WD := span {ψm ; m ∈ N },
∈ N0 .
(4.8)
Then W0D = V0D , and VD is the direct sum of WiD over all i ≤ . The wavelets whose construction was outlined above satisfy properties (W1)– (W5). Hierarchical polynomial spaces By Corollary 2.26, the solution u of (2.44) can be expanded in the Legendre chaos basis as
uν Lν (y) ∈ V, y ∈ Γ. (4.9) u(y) = ν∈F
For any subset Λ ⊂ F, we consider the truncated series
uν Lν (y) ∈ V, y ∈ Γ. SΛ u(y) :=
(4.10)
ν∈Λ
Since (Lν )ν∈F is an orthonormal basis of L2 (Γ, µ; V ) (see Corollary 2.16), SΛ u is the orthogonal projection of u onto the span of (Lν )ν∈Λ in L2 (Γ, µ; V ). We denote this space by ,
2 vν Lν (y) ; (vν )ν∈Λ ∈ (Λ; V ) . (4.11) Λ; V := v(y) = ν∈Λ
396
C. Schwab and C. J. Gittelson
For any Λ ⊂ F, Λ; V is a closed subspace of L2 (Γ, µ; V ) since it is the kernel of SF\Λ , and thus it is a Hilbert space with the same norm. We abbreviate Λ for the subspace Λ; R of L2 (Γ, µ). Let 0 ≤ τ ≤ 1 and γ > 0. For all k ∈ N0 , we define Λγk as the set of the first 2γk indices ν ∈ F in a decreasing rearrangement of ( uν H 1+τ (D) )ν∈F , i.e., Λγk consists of the 2γk indices ν for which uν H 1+τ (D) is largest. We assume that the same decreasing rearrangement is used for all k ∈ N0 , such that Λγk ⊂ Λγk+1 . The approximation spaces in L2 (Γ, µ) induced by the sets Λγk are VkΓ := Λγk ,
k ∈ N0 ,
(4.12)
and the detail spaces are given by W0Γ := V0Γ and Γ WkΓ := VkΓ Vk−1 = Λγk \ Λγk−1 ,
k ∈ N.
(4.13)
Then VkΓ ⊗ V and WkΓ ⊗ V serve as approximation and detail spaces in L2 (Γ, µ; V ). Remark 4.1. The sets Λγk are not computationally accessible. We present a problem-adapted construction for an alternative sequence of index sets in Section 4.2. Sparse tensor product spaces The approximation spaces VkΓ ⊂ L2 (Γ, µ) and VD ⊂ V = H01 (D) can be combined to define finite-dimensional subspaces of L2 (Γ, µ; V ). We recall that the Lebesgue–Bochner space L2 (Γ, µ; V ) is isometrically isomorphic to the Hilbert tensor product L2 (Γ, µ) ⊗ V . For any L ∈ N0 , the tensor product of VLΓ and VLD can be expanded as VLΓ ⊗ VLD =
L
WkΓ ⊗ VLD =
k=0
WkΓ ⊗ WD .
(4.14)
0≤,k≤L
The sparse tensor product space of level L ∈ N0 is defined by restricting the last sum in (4.14) to only the most important component spaces, LD := VLΓ ⊗V
WkΓ ⊗ WD =
0≤+k≤L
L
D WkΓ ⊗ VL−k .
(4.15)
k=0
D LD is equal to VN from (2.90), with VN,ν equal to VL−k if ν ∈ Thus VLΓ ⊗V γ γ γ Γ D L is of the form Λk \ Λk−1 , where Λ−1 := ∅. Any element v of VL ⊗V
v(y, x) =
L
k=0
ν∈Λγk \Λγk−1
L−k
=0 n∈N
cν,n ψn (x)Lν (y),
x ∈ D,
y ∈ Γ. (4.16)
397
Sparse tensor discretizations for sPDEs
LD by u We denote the Galerkin projection of u onto VLΓ ⊗V L . It is determined Γ D L . By Proposition 2.27, u L is a quasi-optimal by (2.91) for VN = VL ⊗V LD . approximation of u in VLΓ ⊗V Convergence estimate LD , the Due to the quasi-optimality of the Galerkin solution u L in VLΓ ⊗V convergence of u L to u is equivalent to that of the best approximation. Let LD . By (4.15), PL denote the orthogonal projection in L2 (Γ, µ; V ) onto VLΓ ⊗V it has the form PL v =
L
k=0
ν∈Λγk \Λγk−1
D (PL−k vν )Lν ,
v=
vν Lν ∈ L2 (Γ, µ; V ),
(4.17)
ν∈F
where Λγ−1 := ∅. Theorem 4.2. Let 0 < τ ≤ 1, γ > 0, 0 < p ≤ 2 and s := 1/p − 1/2. Furthermore, let a+ and a− be the bounds from (2.50). Then "1/p 0 ! a + p
uν H 1+τ (D) 2− min(sγ,τ )L
u − u L L2 (Γ,µ;V ) ≤ CtD λsγ,τ (L) a− ν∈F
(4.18) with
( 2 + 22 min(sγ,τ ) L λsγ,τ (L) = ( 2 + |2−2sγ − 2−2τ |−1
Proof.
(4.19)
By (4.17) and Parseval’s identity in L2 (Γ, µ), using (4.1),
u − PL u 2L2 (Γ,µ;V ) = ! ≤
always, if sγ = τ .
(CτD )2
L
k=0
L
k=0
ν∈Λγk \Λγk−1
−2(L−k)τ
2
D
uν − PL−k uν 2V +
uν 2V
ν∈F\ΛγL
uν 2H 1+τ (D)
ν∈Λγk \Λγk−1
+
uν 2H 1+τ (D)
" .
ν∈F\ΛγL
Applying Stechkin’s lemma (3.13), we have for any 0 < p ≤ 2 and s := 1/p − 1/2, "1/2 ! "1/p !
γ p 2 −s
uν H 1+τ (D) ≤ (#Λk−1 + 1)
uν H 1+τ (D) ν∈F\Λγk−1
ν∈F
for k = 1, . . . , L + 1. Since also "1/2 ! "1/p !
p 2
uν H 1+τ (D) ≤
uν H 1+τ (D) , ν∈F
ν∈F
398
C. Schwab and C. J. Gittelson
using #Λγk−1 + 1 ≥ 2γ(k−1) , it follows that !
1/2 D
uν p
u − PL u L2 (Γ,µ;V ) ≤ Cτ Σ
"1/p
H 1+τ (D)
L
ν∈F
with ΣL = 2−2Lτ + 2−2sγL +
L
2−2(L−k)τ 2−2sγ(k−1) .
k=1
If sγ = τ , then ΣL simplifies to ΣL = (22sγ L + 2)2−2sγL = (22τ L + 2)2−2τ L . More generally, if sγ = τ , estimating the sum by L times the maximal summand, ΣL ≤ 2−2Lτ + 2−2sγL + 2−2 min(sγ,τ )(L−1) L. Alternatively, if sγ = τ , summing the geometric series leads to ΣL = 2−2Lτ + 2−2sγL + If sγ < τ , we have
2+
1 , 2−2sγ − 2−2τ
2+
1 . − 2−2sγ
−2sγL
ΣL ≤ 2 and similarly, if sγ > τ ,
−2τ L
ΣL ≤ 2
2−2sγL − 2−2τ L . 2−2sγ − 2−2τ
2−2τ
Then the claim follows using the quasi-optimality property from Proposition 2.27 with c = a+ and cˇ = a−1 − . We express the convergence estimates in Theorem 4.2 with respect to the total number of degrees of freedom used to approximate u. Lemma 4.3. as L := N Proof.
LD scales The dimension of the sparse tensor product VLΓ ⊗V
LD dim VLΓ ⊗V
(L + 1)2dL 2max(γ,d)L
if γ = d, if γ = d,
∀L ∈ N0 .
Using the last expression in (4.15), L = dim V Γ ⊗V LD = N L
L
k=0
D #(Λγk \ Λγk−1 ) dim VL−k .
(4.20)
399
Sparse tensor discretizations for sPDEs
D 2d(L−k) . By definition, #(Λγk \Λγk−1 ) ≤ #Λγk ≤ 2γk , and by (4.2), dim VL−k Therefore, L L
γk d(L−k) dL 2 2 =2 2(γ−d)k . NL k=0
k=0
If γ = d, then all the summands are one, and we arrive at L (L + 1)2dL . N Otherwise, we sum the geometric series to find −1 2max(γ,d)L 2γ−d − 1
(γ−d)L
L 2dL 2 N
with constants independent of L. Corollary 4.4.
In the setting of Theorem 4.2, if γ = d,
u − u L L2 (Γ,µ;V ) 0 ≤
CτD λsγ,τ (L)
!
a+
uν pH 1+τ (D) a−
"1/p
(4.21)
− min(s,sγ/d,τ /γ,τ /d) . N L
ν∈F
If γ = d, then
u − u L L2 (Γ,µ;V ) 0 ≤ CτD λsd,τ (L)
!
a+
uν pH 1+τ (D) a−
"1/p
(4.22)
− min(s,τ /d) . (L + 1)min(s,τ /d) N L
ν∈F
Proof. The claim follows from Theorem 4.2 using Lemma 4.3 to estimate L . 2L from below by a power of N Remark 4.5. Up to logarithmic factors, the convergence rates in CorolL reaches lary 4.2 with respect to the total number of degrees of freedom N the optimum min(s, τ /d) from Theorem 3.9 for two choices of γ. Therefore, assuming a sparse tensor product structure of the Galerkin subspace of L2 (Γ, µ; V ) does not significantly deteriorate the convergence behaviour. If γ = τ /s = d, then sγ/d = τ /d and τ /γ = s, so (4.21) becomes "1/p 0 ! ( a + − min(s,τ /d) .
uν pH 1+τ (D)
u − u L L2 (Γ,µ;V ) ≤ CτD 2 + 22τ L N L a− ν∈F
(4.23) As already stated in the corollary, γ = d also leads to this convergence rate, L . Nevertheless, this albeit with an additional factor that is logarithmic in N choice has the advantage of being independent of the regularity parameters s and τ .
400
C. Schwab and C. J. Gittelson
Remark 4.6. The above derivation of Theorem 4.2 and Corollary 4.4 corrects some mathematical inaccuracies in the proof of Proposition 3.5 of Bieri et al. (2009). In particular, it is apparent from the above result that the sets Λγk for k = 0, . . . , L − 1 should be defined to contain the indices ν ∈ F for which uν H 1+τ (D) is maximal, and not uν V as claimed in Bieri et al. (2009). For ΛγL , it is also reasonable to use uν V ; doing so sacrifices the sparse tensor product structure, but may reduce the total number of degrees of freedom. Remark 4.7. Corollary 4.4 should be compared with the convergence of full tensor product discretizations. In this case, the dimension of the Galerkin subspace of L2 (Γ, µ; V ) scales as 2(γ+d)L , and the error satisfies Theorem 4.2 without the logarithmic terms. Therefore, the convergence rate of the error with respect to the dimension is min(sγ, τ )/(γ + d). For example, if γ = d, this is min(s, τ /d)/2, which is just half of the rate from (4.22). If γ = τ /s, then the convergence rate (1/s + d/τ )−1 is half of the harmonic mean of s and τ /d, which is only a minor improvement. Remark 4.8. The convergence rates in Corollary 4.4 and Remark 4.5 are limited by the order of convergence τ /d ≤ 1/d of linear finite elements on D. This can be overcome by using higher-order finite elements. For example, if u ∈ p (F; H 1+τ (D)) with s = 1/p − 1/2 and τ = sd, using piecewise polynomial finite elements of degree τ leads to a convergence rate of s L of degrees of freedom. with respect to the total number N 4.2. Algorithmic aspects of polynomial chaos Hierarchical index sets The index sets Λγk from Section 4.1 are not computationally accessible. We consider a different family of index sets that can be constructed explicitly. ∞ 0 For any sequence η = (ηm )∞ m=1 ∈ R , since ηm = 1 for all m ∈ N, η ν :=
∞ )
νm ηm =
)
νm ηm ,
ν ∈ F.
(4.24)
m∈supp ν
m=1
R∞
with ηm ∈ (0, 1), ηm → 0, up to a constant We assume that for some η ∈ factor, (4.24) is an estimate for uν H 1+t (D) for all ν ∈ F; see Section 4.2. Then, for any > 0, Λ (η) := {ν ∈ F ; η ν ≥ }.
(4.25)
Due to the assumptions 0 < ηm < 1 and ηm → 0, Λ (η) is a finite subset of F for all > 0. The construction of the sets (4.25) does not require exact knowledge of uν H 1+t (D) , only estimates with a certain structure. Also, the sets Λ (η) differ from Λγk in that they are defined by a thresholding tolerance instead of a prescribed cardinality.
401
Sparse tensor discretizations for sPDEs
It is clear from the definition that the sets Λ (η) are monotonic in both parameters and η. If ≤ ¯, then Λ (η) ⊇ Λ ¯(η). Similarly, if η ∈ R∞ with η ). ηm ≤ η¯m < 1 for all m ∈ N, then Λ (η) ⊆ Λ (¯ σ ∞ σ For a σ > 0, let η ∈ R be defined by ηm := (m + 1)−σ , m ∈ N. For η σ , sharp asymptotics on the cardinality of the index sets Λ (η σ ) follow from results on integer factorization (Bieri et al. 2009, Proposition 4.5). Proposition 4.9.
For any σ > 1/2, as → 0, √ −1 −1 e2 σ log σ −1/σ . #Λ (η )
√ 2 π(σ −1 log −1 )3/4
(4.26)
In particular, {(η σ )ν }ν∈F ∈ p (F) for any p > 1/σ. Proof. We observe that for all > 0 and σ > 0, Λ (η σ ) = Λ 1/σ (η 1 ). Let f (n) denote the number of multiplicative partitions of n ∈ N, disregarding the order of the factors. For example, f (12) = 4 since 12, 2 · 6, 2 · 2 · 3 and 3 · 4 are the only factorizations of 12. Sharp asymptotics for FΣ (x) :=
x
f (n)
n=1
as x → ∞ were obtained in Canfield, Erd˝ os and Pomerance (1983), based on earlier work (Oppenheim 1927, Szekeres and Tur´ an 1933). The result required here is √
FΣ (x) = F (x)(1 + O(1/ log n))
x e2 log x with F (x) = √ . 2 π(log x)3/4
Let > 0 and ν ∈ Λ (η 1 ). By definition, n :=
∞ ) m=1
1 (m + 1)νm ≤ .
Since n is an integer, the index ν represents a multiplicative partition of an integer n ≤ 1/ . Conversely, for 6any integer n ≤ 1/ , any multiplicative partition of n is of the form n = m (m + 1)νm for a ν ∈ F, and therefore ν ∈ Λ (η 1 ). Consequently, #Λ (η σ ) = #Λ 1/σ (η 1 ) = FΣ ( −1/σ ) F ( −1/σ ) as → 0, which implies (4.26). ( Note that −1/σ is the dominating term in (4.26). Let z = σ −1 log −1 . Then (4.26) is bounded by a constant times 2
2
ez e2z e = e(z+1) .
402
C. Schwab and C. J. Gittelson
√ κ z for all z ≥ ( κ − 1)−1 , and thus √ = −κ/σ ∀z ≥ ( κ − 1)−1 .
For any κ > 1, we have z + 1 ≤ 2
e(z−1) ≤ eκz
2
√
Consequently, by (4.26), for all κ > 1, #Λ (η σ ) = #{ν ∈ F ; (η σ )ν ≥ } −κ/σ . This is a characterizing property of the weak Lebesgue sequence space qw (F) with q = κ/σ (DeVore 1998). Since qw (F) ⊂ p (F) for all p > q, and since κ > 1 is arbitrary, it follows that {(η σ )ν }ν∈F ∈ p (F) for all p > 1/σ. As demonstrated in Bieri et al. (2009, Figure 4.1), (4.26) provides a good approximation for thresholds as large as 10−2 . Proposition 4.9 gives bounds on the size of index sets Λ (η). In order to control the complexity of the numerical construction of these index sets, it is also important to bound the length # supp ν of indices ν ∈ Λ (η). To this end, we define the maximal dimension reached by Λ (η), M (η) := max {m ∈ N ; ηm ≥ } = max {m ∈ N ; m ∈ Λ (η)},
(4.27)
where m ∈ F denotes the Kronecker sequence ( m )n = δmn . Proposition 4.10. and
Let η = (ηm )∞ m=1 satisfy 0 < ηm+1 ≤ ηm < 1, ηm → 0, c1 m−σ1 ≤ ηm ≤ c2 m−σ2
∀m ∈ N,
(4.28)
with c1 , c2 > 0 and σ1 ≥ σ2 > 0. Then there is a constant C > 0 such that # supp ν ≤ C log+ M (η) ≤ C log #Λ (η)
∀ν ∈ Λ (η)
(4.29)
for all 0 < ≤ 1, i.e., whenever Λ (η) = ∅. Proof.
By (4.28) and (4.27), due to the definition of Λ (η),
> ηM (η)+1 ≥ c1 (M (η) + 1)−σ1 ,
and therefore M (η) + 1 ≤ ( /c1 )−1/σ1 . Since ηm ≤ η1 < 1 for all m ∈ N, we can assume without loss of generality that c2 = 1, possibly at the cost of decreasing σ2 . Then, for all ν ∈ F, ) ) νm ην = ηm ≤ m−νm σ2 ≤ [(# supp ν)!]−σ2 . m∈supp ν
m∈supp ν
We note that, by Stirling’s approximation, (x + 1)τ = o(τ log x√ !) for any τ > 0 as x → ∞. Indeed, abbreviating n := τ log x , since n! ≥ 2πnn e−n , 1 (x + 1)τ ≤ √ eτ log x+n−n log n → 0, τ log x ! 2π Consequently, also (τ log x !)−1 = o((x + 1)−τ ).
x → ∞.
Sparse tensor discretizations for sPDEs
403
Suppose that ν ∈ F with # supp ν ≥ (1 + σ1 /σ2 ) log M (η). Then, by the above estimates with x = M (η) and τ = 1 + σ1 /σ2 , ; < −σ2 σ1 ν η ≤ log M (η) ! 1+ σ2 = o (M (µ) + 1)−σ1 −σ2 = o( (σ1 +σ2 )/σ1 ) = o( ). The o(·) is with respect to M (η) → ∞, which by (4.27) is equivalent to
→ 0. Therefore, there is an 0 > 0 such that, for all 0 < ≤ 0 , # supp ν ≥ (1 + σ1 /σ2 ) log M (η) implies η ν < . Equivalently, σ1 log M (η) ∀ν ∈ Λ (η). # supp ν ≤ 1 + σ2 As there are only finitely many distinct sets Λ (η) with > 0 , this estimate holds for all > 0, with a larger constant and log+ (n) := max(log(n), 0) in place of log(n) to accommodate M (η) = 0. The second part of (4.29) follows using the observation that M (η) ≤ #Λ (η) since the Kronecker sequences ( m )n = δmn are in Λ (η) for m = 1, . . . , M (η). Numerical construction By Proposition 4.10, any ν ∈ Λ (η) for η = (ηm )∞ m=1 satisfying (4.28) can be stored in O(log #Λ (η)) memory in the form {(m, νm ) ; m ∈ supp ν},
(4.30)
assuming that an arbitrary integer can be stored in a single storage location. Therefore, the total memory required to store the full set Λ (η) is of the order #Λ (η) log #Λ (η). We show how Λ (η) can be constructed in O(#Λ (η) log #Λ (η)) time. For any sequence c = (cm )∞ m=1 , we define the translation τ1 c := (cm+1 )∞ m=1 .
(4.31)
Furthermore, we define the concatenation of integers with subsets of F. For any n ∈ N0 and Λ ⊂ F, [n, Λ] := {ν ∈ F ; ν1 = n, τ1 ν ∈ Λ} = {[n, ν] ; ν ∈ Λ},
(4.32)
where [n, ν] := (n, ν1 , ν2 , . . .). We observe that =
N (η)
Λ (η) =
[n, Λ η−n (τ1 η)] 1
n=0
with
? log
. ≥ } = log η1
(4.33)
>
N (η) := max {m ∈ N0 ;
η1n
(4.34)
404
C. Schwab and C. J. Gittelson
This suggests a recursive construction of Λ (η). The precise algorithm is given in Construct(η, ). We store indices ν ∈ F in the sparse form (4.30). We append to each ν ∈ Λ (η) the value η ν , which we compute during the construction of Λ (η). In the concatenation [n, Λδ (τ1 η)], these values are updated by η [n,ν] = η1n (τ1 η)ν , where (τ1
η)ν
ν ∈ Λδ (τ1 η),
(4.35)
is known from the construction of Λδ (τ1 η) for all ν ∈ Λδ (τ1 η).
Construct(η, ) → Λ (η) if η1 < then if > 1 then return ∅ else return {0} end end > ? log
N ←− log η1 for n = 0, 1, . . . , N do Λn ←− Construct(τ1 η, η1−n ) Λn ←− [n, Λn ] end N = Λ ←− Λn n=0
return Λ Lemma 4.11. For any > 0 and any η satisfying the assumptions of Proposition 4.10, Construct(η, ) constructs Λ (η) at a computational cost of O(#Λ (η) log #Λ (η)). Proof. It is clear from (4.33) that Construct(η, ) does construct Λ (η). Due to the sparse storage format (4.30), concatenation [0, ν] of ν ∈ F with zero does not involve any work. Therefore, each index ν ∈ Λ (η) is constructed in # supp ν identical steps. The union operations can be performed in constant time, for example, with a linked list data structure. The claim follows since # supp ν = O(log #Λ (η)) by Proposition 4.10. Remark 4.12. For the construction of a sparse tensor product similar to (4.15), we need not only one index set Λ (η), but a hierarchical sequence of such sets. For a sequence of thresholds
0 ≥ 1 ≥ · · · ≥ L = > 0,
(4.36)
Sparse tensor discretizations for sPDEs
405
we use the index sets Λk := Λ k (η), which satisfy ∅ =: Λ−1 ⊆ Λ0 ⊆ Λ1 ⊆ · · · ⊆ ΛL = Λ (η).
(4.37)
The detail spaces (4.13) induced by (4.37) are WkΓ = Λk \ Λk−1 . Their construction requires the partitioning of Λ (η) into Λ (η) =
L =
Λk \ Λk−1 .
(4.38)
k=0
This can be done after constructing Λ (η) by sorting the indices ν ∈ Λ (η) with respect to the values η ν , which are computed during the construction of the index set using the recursion (4.35). Once sorted, the indices ν are easily assigned to the partitions Λk \ Λk−1 by comparing η ν to k . Alternatively, for a parameter γ > 0 as in Section 4.1, the thresholds 0 , . . . , L−1 can be chosen such that #Λk = 2γk for k = 0, . . . , L − 1. The total work is of order O(#Λ (η) log #Λ (η) + L) as → 0 or L → ∞. Remark 4.13. The stochastic Galerkin matrix has the form (2.81), i.e., the Legendre coefficients of the Galerkin projection u L satisfy a discretized version of the system of equations (2.88), which has direct dependencies between indices ν, ν¯ ∈ Λ (ν) that are identical in all dimensions but one, and differ by one in this dimension. We call ν and ν¯ neighbours if there is an m ¯ ∈ N such that |νm − ν¯m | = δmm ¯ . Fast access to the neighbours in Λ (η) of ν ∈ Λ (η) is crucial to solving the Galerkin system. The neighbourhood data are stored efficiently in a directed graph, in which there is an edge from ν to ν¯ if there is an m ¯ ∈ supp ν such that ν¯ = ν − m ¯ , where m ¯ is the Kronecker sequence ( m ¯ ) m = δ mm ¯ . Then there are exactly # supp ν edges starting at ¯ ∈ N. The ν ∈ Λ (η). It is useful to label each edge by the appropriate m routine Construct(η, ) can be extended to compute the neighbourhood relations during the construction of Λ (η) using the observation that ν and ν¯ are neighbours as above if and only if, at a call of Construct at recursion depth m, ¯ ν and ν¯ are constructed by appending n and n − 1, respectively, to the same index ν ∈ F, for some n ∈ N, and all subsequent additions are the same. Choice of parameters The preceding sections leave open the choice of η = (ηm )∞ m=1 . Due to Theorem 4.2, η ν should approximate uν H 1+τ (D) for the unknown u and some 0 ≤ τ ≤ 1; see Remark 4.6. A reasonable choice is αm
ϕm W τ,∞ (D) , m ∈ N, (4.39) ηm = a ¯− using the notation from Section 2.3. We refer to Bieri et al. (2009) for numerical experiments with this and other choices of ηm and τ = 0. Better
406
C. Schwab and C. J. Gittelson
a priori choices of ηm may be obtainable from sharper a priori bounds on
uν H 1+τ (D) . As mentioned in Remark 4.12, the thresholds 0 , . . . , L−1 can be chosen such that #Λk = 2γk for k = 0, . . . , L − 1 with a parameter γ > 0 as in Section 4.1. 4.3. Sparse tensor stochastic collocation Stochastic collocation is an alternative to the stochastic Galerkin method. It is also based on a polynomial approximation in the parameter domain. However, the Galerkin projection is replaced by a suitable interpolation operator. A sparse tensor product construction similar to that presented in Section 4.1 is possible in this setting. We consider the diffusion equation with a stochastic diffusion coefficient, as in Section 2.3. The following discussion is based primarily on Bieri (2009a, 2009b). Stochastic collocation We recall the spaces of polynomials on Γ = [−1, 1]∞ from Section 4.1, ,
2 vν Lν (y) ; (vν )ν∈Λ ∈ (Λ) (4.40) Λ = v(y) = ν∈Λ
for Λ ⊂ F, where Lν is the tensor product Legendre polynomial from Section 2.2. If Λ is finite and monotonic in the sense that if µ ∈ Λ, then Λ also contains all ν ∈ F with νm ≤ µm for all m ∈ N, then ,
(4.41) vν y ν ; (vν )ν∈Λ ∈ RΛ . Λ = v(y) = ν∈Λ
Let sets
VkΓ
:= Λk , k ∈ N0 , for a nested sequence of finite monotonic index Λ0 ⊂ Λ1 ⊂ · · · ⊂ Λk ⊂ Λk+1 ⊂ · · · ⊂ F.
(4.42)
We assume that for each k ∈ N0 , there is a finite set Yk = {yik ; i = 1, . . . , NkΓ } ⊂ Γ and an interpolation operator Γ
Ik : RNk → VkΓ ,
NΓ
NΓ
Γ
k ∀i = 1, . . . , NkΓ , ∀(ai )i=1 ∈ RNk . (4.43) These interpolation operators extend to maps k (Ik (ai )i=1 )(yik ) = ai
Ik : C(Γ) → VkΓ ,
(Ik f )(yik ) = f (yik )
∀i = 1, . . . , NkΓ , ∀f ∈ C(Γ), (4.44)
Sparse tensor discretizations for sPDEs
407
which we assume to be the identity on VkΓ , i.e., Ik is a projection of C(Γ) onto VkΓ . Let p ∈ F and
Example 4.14.
Λp := {ν ∈ F ; νm ≤ pm ∀m ∈ N}.
(4.45)
(m)
m For each m ∈ N, let (yi )pi=0 ⊂ [−1, 1] be an arbitrary set of nodes. The corresponding Lagrange polynomials are 6 j=i (z − yj ) (m) , z ∈ [−1, 1], i = 1, . . . , pm + 1. (4.46) i (z) = 6 j=i (yi − yj )
= 1 if pm = 0. Nodes on Γ = [−1, 1]∞ are given by (m) (4.47) Yp := (yim )∞ m=1 ; 0 ≤ im ≤ pm ∀m ∈ N ⊂ Γ. (m)
In particular, 1
The tensor product Lagrange polynomials are ∞ '
y =
(m)
im ∈ Λp ,
y = (yim )∞ m=1 ∈ Yp .
(4.48)
∀y, z ∈ Yp .
(4.49)
(m)
m=1
By construction, they satisfy y (z) = δyz
Consequently, the Lagrange polynomials are linearly independent, and since #Yp = #Λp =
∞ )
(pm + 1) =
m=1
)
(pm + 1),
(4.50)
m∈supp p
(y )y∈Yp spans Λp . Therefore, the interpolation operator (4.44) has the form
f (y)y (z), f ∈ C(Γ), (4.51) (Ip f )(z) = y∈Yp
and it is a projection of C(Γ) onto Λp . The product grids from Example 4.14 are prohibitive for high-dimensional parameter domains since by (4.50), #Yp grows exponentially in # supp p. For each dimension m ∈ N, we consider a non-decreasing sequence of (m) (m) (m) polynomial degrees (qk )∞ k=0 ⊂ N0 , qk+1 ≥ qk . For every m ∈ N and (m) q
(m)
k k ∈ N0 , let (yk,j )j=0 be a set of nodes in [−1, 1], and define the interpolation operator
6
(m)
qk (m) (Ik f )(ξ)
=
j=0
(m) f (yk,j )
(m) i=j (ξ − yk,i ) , 6 (m) (m) (y − y ) i=j k,j k,i
f ∈ C([−1, 1]).
(4.52)
408
C. Schwab and C. J. Gittelson
Furthermore, we define the univariate differences (m)
∆0
(m)
:= I0
(m)
,
∆k
(m)
:= Ik
(m)
− Ik−1 ,
k ∈ N.
(4.53)
Then the interpolation operator Ip from (4.51) in Example 4.14 with pm = (m) qkm can be expanded as Ip =
∞ '
(m)
I km =
m=1
∞ '
∆(m) nm .
(4.54)
0≤nm ≤km m=1
We approximate Ip by truncating the sum in the last term of (4.54). (m) We illustrate this construction for pm = qk if m ≤ M and pm = 0 if m ≥ M + 1. The parameter M truncates the dimensions of the parameter domain Γ, and k determines the order of interpolation in the dimensions (m) m ≤ M . Note that qk may still depend on m, even though k is fixed. For this p, (4.54) can be written as
(M +1) (M +2) (M ) ∆(1) ⊗I0 ⊗· · · . (4.55) IM,k := Ip = n1 ⊗· · ·⊗∆nM ⊗I0 0≤n1 ,...,nm ≤k
The corresponding Smolyak interpolation operator is
(M +1) (M +2) (M ) ∆(1) ⊗ I0 ⊗ · · · . (4.56) IM,k := n 1 ⊗ · · · ⊗ ∆n M ⊗ I 0 0≤n1 +···+nM ≤k
Inserting (4.53), we arrive at the representation
M − 1 (M +1) (M +2) k−|n| ) I (1) ⊗ · · · ⊗ In(M (−1) ⊗ I0 ⊗ I0 ⊗· · · , IM,k = M k − |n| n1 0≤|n|≤k
(4.57) where |n| = n1 + · · · + nM . Remark 4.15. By definition, the Smolyak interpolation operator maps M,k for into Λ . M,k := {ν ∈ F ; νm ≤ qn(m) , 1 ≤ m ≤ M, νm = 0, m ≥ M }. Λ m 0≤|n|≤k
(4.58) Let ν ∈ ΛM,k . For any n = (n1 , . . . , nM ) with |n| ≥ k + 1, there is an (1) (m) (M ) m ≤ M for which νm ≤ qnm −1 , and consequently ∆n1 ⊗ · · · ⊗ ∆nM y ν = 0 (m)
(m)
νm = I νm νm for all y ∈ [−1, 1]M since Inm ym nm −1 ym = ym . As the difference of IM,k and IM,k is merely a sum of such operators, IM,k coincides with IM,k M,k , and the latter acts as the identity on this space. Therefore, the on Λ M,k , Smolyak interpolation operator IM,k is a projection of C(Γ) onto Λ
Sparse tensor discretizations for sPDEs
409
though it is generally not actually an interpolation operator in the sense of (4.51). As in (2.26), we consider product distributions µ :=
∞ '
µm
(4.59)
m=1
on Γ = [−1, 1]∞ , where each µm is a probability measure on [−1, 1]. For every m ∈ N and any q ∈ N0 , the (q + 1)-point Gaussian quadrature rule for the distribution µm consists of abscissae (ξj )qj=0 in [−1, 1] and weights (wj )qj=0 such that 1 q
f (ξ)µm (dξ) ≈ wj f (ξj ), (4.60) −1
j=0
and (4.60) is exact if f is a polynomial of degree at most 2q + 1. The points (ξj )qj=0 are the roots of the orthonormal polynomial of degree q + 1 with respect to the measure µm . (m) γk For a parameter γ to be specified below, we define (yk,j )j=0 as the abscissae of the (γk + 1)-point Gaussian quadrature rule for the measure (m) µm . In this case, we have qk = γk in the construction of Smolyak interpolation operators Ik,M from (4.56). By Bieri (2009b, Lemma 6.2.2), the operator Ik,M based on these nodes uses γk + 2M Γ (4.61) Nk = 2M collocation points in Γ. Sparse tensorization Let VD ⊂ V = H01 (D) denote the finite element spaces from Section 4.1, and let PD be the orthogonal projection in H01 (D) onto VD . We recall that ND := dim VD 2d , and these spaces satisfy the approximation property (4.1). For parameters M and L, the stochastic collocation solution for the Smolyak interpolation operator IM,L and the finite element space VLD is uM,L := (IM,L ⊗ PLD )u. It can be expanded as uM,L =
D (IM,k − IM,k−1 ) ⊗ (PD − P−1 )u.
(4.62)
(4.63)
0≤k,≤L
This approximation can be computed by solving a linear system in VLD for
410
C. Schwab and C. J. Gittelson
each collocation point of IM,L . Therefore, a measure for the computational cost of computing uM,L is the product NL := NLΓ NLD of the number of collocation points and the dimension of the finite element space. The sparse tensor approximation can be derived by truncating the sum in (4.63), analogously to the sparse tensor product construction in Section 4.1, as
(IM,k − IM,k−1 ) ⊗ (P D − P D )u. (4.64) u M,L :=
−1
0≤k+≤L
A (rough) measure for the computational cost of obtaining u M,L is the total number of degrees of freedom, i.e.,
L := NkΓ ND , (4.65) N 0≤k+≤L
which is significantly smaller than NL due to the geometric growth of NkΓ and ND . We turn next to the error analysis of this sparse collocation (m) approximation. We assume that y0 = 0 for all m ≥ M +1. This is satisfied by Gaussian abscissae if the distributions µm are symmetric. All collocation (M +1) (M +2) , y0 , . . .) with points in (4.62) and (4.65) are of the form y = (y , y0 y = (ym )m ∈ [−1, 1]M , and thus the diffusion coefficient a((y , y0
(M +1)
(M +2)
, y0
, . . .), x) = a ¯(x) +
M
ym am (x) +
m=1
=a ¯(x) +
M
∞
(m)
y0 am (x)
m=M +1
ym am (x),
(4.66)
m=1
am (x) = αm ϕm (x), depends only on y ∈ [−1, 1]M . Now let uM ∈ C(Γ; V ) denote the solution of aM (y, x)∇uM (y, x) · ∇v(x) dx = f (x)v(x) dx D
∀v ∈ V, ∀y ∈ Γ,
D
(4.67)
for the truncated series ¯(x) + aM (y, x) = a
M
ym am (x),
am (x) = αm ϕm (x).
(4.68)
m=1
Since the collocation approximations (4.62) and (4.64) depend only on the first M dimensions of Γ, we can only expect convergence to uM , not to the solution u of (4.67) with the exact diffusion coefficient a(y, x). The following statement is Proposition 6.3.1 from Bieri (2009b).
411
Sparse tensor discretizations for sPDEs
Theorem 4.16.
For any 0 ≤ τ ≤ 1, if γ =
M,L L2 (Γ,µ;V ) ≤
uM − u
τ log 2 rmin −1 ,
then
− min C uM C(Σ(Γ,);H 1+τ (D)) N L
where rmin := min {rm ; m = 1, . . . , M }, ( rm := log m + 1 + 2m , 1 < m <
rmin −1 τ log 2 , d 1+log 2M
, (4.69)
a− , 2 am L∞ (D)
and Σ(Γ, ) :=
M )
{c ∈ C ; dist(z, [−1, 1]) ≤ m } ⊂ CM .
m=1
Remark 4.17.
For comparison, by Bieri (2009b, Remark 6.3.2), 1+log 2M −1 −
uM − uM,L L2 (Γ,µ;V ) ≤ C uM C(Σ(Γ,);H 1+τ (D)) NL
d + r τ min −1
. (4.70)
Therefore, the sparse tensor approximation u M,L converges to uM significantly faster than the full tensor approximation uM,L as L → ∞. 4.4. The multi-level Monte Carlo finite element method We regard the multi-level Monte Carlo finite element method as a sparse tensorization of a Monte Carlo method and a standard finite element method. It is the third example of a class of sparse tensor product discretizations after stochastic Galerkin in Section 4.1 and stochastic collocation in Section 4.3. Preliminaries For a bounded Lipschitz domain D ⊂ Rd and a probability space (Ω, Σ, P), we consider the stochastic isotropic diffusion equation −∇ · a(ω, x)∇u(ω, x) = f (ω, x), x ∈ D, ω ∈ Ω, (4.71) u(ω, x) = 0, x ∈ ∂D, ω ∈ Ω as in Section 2.3. The differential operators in (4.71) are meant with respect to the physical variable x ∈ D. Here, f is a stochastic source term, and a is a stochastic diffusion coefficient. We assume there are constants a− and a+ such that 0 < a− ≤ a(ω, x) ≤ a+ < ∞ ∀x ∈ D, ∀ω ∈ Ω,
(4.72)
and a is a strongly measurable map from Ω into L∞ (D). We assume homogeneous Dirichlet boundary conditions in (4.71) only for simplicity. All of the following can be generalized, for instance to inhomogeneous boundary conditions, or to mixed Dirichlet and Neumann boundary conditions (Barth, Schwab and Zollinger 2010).
412
C. Schwab and C. J. Gittelson
For any fixed ω ∈ Ω, the weak formulation in space of (4.71) is to find u(ω) ∈ H01 (D) such that a(ω, x)∇u(ω, x) · ∇v(x) dx = f (ω, x)v(x) dx ∀v ∈ H01 (D). (4.73) D
D
The solution u(ω) is well-defined by (4.73) if f (ω) ∈ L2 (D). We abbreviate 1/2 1 2 |∇v(x)| dx . (4.74) V := H0 (D), v V := D
Then the Lax–Milgram lemma implies existence and uniqueness of u(ω) ∈ V , and # $−1 1
f (ω) V ≤
f (ω) V . (4.75)
u(ω) V ≤ ess inf a(ω, x) x∈D a− Consequently, if f ∈ Lr (Ω; V ) for any 1 ≤ r ≤ ∞, then u ∈ Lr (Ω; V ) and
u Lr (Ω,V ) ≤
1
f Lr (Ω,V ) . a−
(4.76)
We next turn to finite element discretizations of (4.71). Let T0 be a regular partition of D into simplices K, and let {T }∞ =0 be the sequence of partitions obtained by uniform mesh refinement. We set ¯ ; u|K ∈ Pp (K) V = S p (D, T ) = {u ∈ C 0 (D)
∀K ∈ T },
(4.77)
where Pp (K) denote the space of polynomials of degree at most p on K. We denote the mesh width by h := max {diam K ; K ∈ T } = 2− h0 .
(4.78)
The dimension of V is d N := dim V = O(h−d ) = O(2 ).
(4.79)
For any ω ∈ Ω and any ∈ N0 , let u (ω) be the Galerkin projection of u(ω) onto V . By (4.73), u (ω) is the unique element of V such that a(ω, x)∇u (ω, x) · ∇v (x) dx = f (ω, x)v (x) dx ∀v ∈ V . (4.80) D
D
The Lax–Milgram lemma implies existence and uniqueness of u (ω), and as in (4.75), 1
f (ω) L2 (D) ∀ω ∈ Ω. (4.81)
u (ω) V ≤ a− Furthermore, u (ω) is a quasi-optimal approximation of u(ω) in V ,
u(ω) − u (ω) V ≤ Ca inf u(ω) − v V v ∈V
∀ω ∈ Ω,
(4.82)
413
Sparse tensor discretizations for sPDEs
where Ca =
1
a+ a− .
We define the scales of Hilbert spaces Xs := V ∩ H 1+s (D),
Ys := V ∩ H −1+s (D),
s ≥ 0.
(4.83)
Then Xs ⊃ Xt and Ys ⊃ Yt whenever s < t. Let s∗ ≥ 0 such that f (ω) ∈ Ys and assume that a(ω) ∈ W s,∞ (D) for P-a.e. ω ∈ Ω. We also assume
u(ω) Xs ≤ Cs (a) f (ω) Ys
∀s ∈ [0, s∗ ]
(4.84)
for a constant Cs (a) depending continuously on a− , a+ and a(ω) W s,∞ (D) . If 0 < s ≤ p, we have the approximation property inf w − v V ≤ CI 2−s h0 w Xs
v ∈V
∀w ∈ Xs ,
(4.85)
with a constant CI independent of . Consequently, if in addition s ≤ s∗ ,
u(ω) − u (ω) V ≤ Ca CI h0 2−s u(ω) Xs .
(4.86)
Computation of the mean field Let (ui )∞ i=1 be independent copies of the solution u of (4.71). The sample mean with M samples is the V -valued random variable EM [u] :=
M 1 i u. M
(4.87)
i=1
As in Theorem 1.12, the sample mean EM [u] converges to the mean E[u] in probability, with a rate of M −1/2 . Proposition 4.18. If f ∈ L2 (Ω; V ), then for all η > 0 and all M ∈ N, 1 (4.88) P E[u] − EM [u] V ≥ η ≤ 2 u 2L2 (Ω;V ) . η M Proof.
By Chebyshev’s inequality, using that (ui )M i=1 are uncorrelated, 1 1 P E[u] − EM [u] V ≥ η ≤ 2 Var(EM [u]) = 2 Var(u). η η M
The claim follows since Var(u) ≤ u 2L2 (Ω;V ) . Equation (4.88) is equivalent to
u L2 (Ω;V ) √ ≥1−
P E[u] − EM [u] V ≤
M
∀ > 0.
(4.89)
In this sense, EM [u] converges to E[u] in V at rate M −1/2 , with probability 1 − , which can be chosen arbitrarily close to one. For all i ∈ N and any ∈ N0 , let ui denote the Galerkin projection of i u onto V . The Monte Carlo finite element (MC–FE) method consists of
414
C. Schwab and C. J. Gittelson
approximating E[u] by EM [u ] =
M 1 i u M
(4.90)
i=1
for a single discretization level . Theorem 4.19. If f ∈ L2 (Ω; Ys ) and a ∈ L∞ (Ω; W s,∞ (D)) with 0 < s ≤ min(p, s∗ ), then for any > 0, @ + 1 + Cs (a)Ca CI h0 2−s f L2 (Ω;Ys ) ≥ 1 − . P E[u] − EM [u ] V ≤ √
M (4.91) Proof. The statement follows from Proposition 4.18, (4.86) and (4.84) by splitting the error as
E[u] − EM [u ] V ≤ E[u] − EM [u] V + EM [u] − EM [u ] V and using linearity of EM . By the assumption a ∈ L∞ (Ω; W s,∞ (D)), the constant Cs (a) in (4.84) is independent of ω. Remark 4.20. The optimal choice of sample size M versus discretization level is reached when the statistical and discretization errors are equilibrated. This is the case when −1/2 M −1/2 = 2−s , or equivalently, M = 22s −1 , with some rounding strategy. Since N = O(2d ), if the computational cost of computing a sample of ui is estimated as N , then the total cost of reaching a tolerance C2−s with probability 1− by the MC–FE method is O(M N ), which is equal to O(2(2s+d) −1 ). In the multi-level Monte Carlo finite element (MLMC–FE) method, the multi-level splitting of the finite element space VL is used to obtain a hierarchy of discretizations which are sampled with level-dependent MC sample sizes M . Specifically, for any L ∈ N0 , setting u−1 := 0, we write, using the linearity of the expectation operator E[·], L L
(u − u−1 ) = E[u − u−1 ]. (4.92) E[uL ] = E =0
=0
Each of the remaining expectations can be approximated by a different number of samples. This leads to the approximation E L [u] :=
L
EM [u − u−1 ]
=0
of E[u], with EM defined as in (4.87).
(4.93)
Sparse tensor discretizations for sPDEs
415
Theorem 4.21. If f ∈ L2 (Ω; Ys ) and a ∈ L∞ (Ω; W s,∞ (D)) with 0 < s ≤ min(p, s∗ ), then there is a constant C depending only on a, D and s such that, for any > 0 and any L ∈ N0 , " ! 0 L
L + 1 −1/2 P E[u] − E L [u] V ≤ C hsL + M hs f L2 (Ω;Ys ) ≥ 1 − .
=0
Proof.
Adding and subtracting E[uL ], we have
E[u] − E [u] V ≤ E[u] − E[uL ] V + L
L
E[u − u−1 ] − E L [u − u−1 ] V .
=0
Using (4.86), the first term is bounded by
E[u] − E[uL ] V ≤ E[ u − uL V ] ≤ Ca CI hsL E[ u Xs ] ≤ Ca CI hsL u L2 (Ω;Xs ) . We apply (4.89) with > 0 to each of the remaining terms. Thus, with probability 1 − 0 − · · · − L , L
E[u − u−1 ] − E L [u − u−1 ] V ≤
=0
L
=0
√
1
u − u−1 L2 (Ω;V ) .
M
Furthermore, due to (4.86),
u − u−1 L2 (Ω;V ) ≤ 3Ca CI hs u L2 (Ω;Xs ) . The claim follows with the choice := (L + 1)−1 , using (4.84). Remark 4.22. Theorem 4.21 holds for arbitrary choices of M in (4.93). For any > 0, we consider B A (4.94) M := 22s(L−) (L + 1)3 −1 , = 0, 1, . . . , L. Then Theorem 4.21 states that, with probability 1 − ,
E[u] − E L [u] V ≤ 2ChsL f L2 (Ω;Ys ) .
(4.95)
Assuming the availability of an optimal finite element solver such as a full multigrid method or, for d = 1, a direct solver, the total work required to compute E L [u] is L
M N ∼ 22sL (L + 1)3 −1
=0
In terms of NL =
O(2Ld ),
L
2(d−2s) .
(4.96)
=0
the computational cost 3 −1 L NL (log NL )
NL (log NL )4 −1 M N 2s/d =0 NL (log NL )3 −1
is if 2s < d, if 2s = d, if 2s > d.
(4.97)
416
C. Schwab and C. J. Gittelson
Remark 4.23. If 2s ≤ d, the cost (4.97) of the MLMC–FE method is equivalent to that of the finite element method for solving a single deterministic problem to the same tolerance, up to a logarithmic factor. For example, if d = 2, the MLMC–FE method exhibits this optimal behaviour for p = 1 and s = 1. If d = 3, linear complexity is retained up to order s = 3/2. In the case d = 1, this is only true up to s = 1/2. Already for p = 1 and s = 1, the cost of MLMC–FE in d = 1 is O(NL2 (log NL )3 −1 ). This still compares favourably to the MC–FE method, which requires O(NL3 −1 ) work to achieve the same accuracy. Generally, if 2s > d, the cost of the MLMC– FE method is equivalent to the total number M of Monte Carlo samples, independently of the dimension of the finite element spaces. Thus the efficiency of the MLMC–FE method is dominated by the weaker of its two constituent methods. The above error analysis of the MLMC–FE method is with respect to convergence in probability. Analogous results also hold when the convergence in L2 (Ω; V ) of the MLMC–FE method is analysed, as in Theorem 1.11. We refer to Barth et al. (2010) for proofs and numerical experiments. Approximation of higher moments We recall some notation from Section 1. For any k ∈ N, we denote the k-fold Hilbert tensor product of the Hilbert space V by · · ⊗ V . V (k) := V ⊗ ·
(4.98)
k times
Let u(k) (ω) denote the k-fold tensor product u(ω)⊗· · ·⊗u(ω) ∈ V (k) . Then, if u ∈ Lk (Ω; V ), (k)
u L1 (Ω;V (k) ) = u(ω) ⊗ · · · ⊗ u(ω) V (k) P(dω) Ω (4.99) k k = u(ω) V P(dω) = u Lk (Ω;V ) . Ω
The kth moment of u is Mk u := E[u(k) ] =
u(ω) ⊗ · · · ⊗ u(ω) P(dω) ∈ V (k) . Ω
(4.100)
k times
We use analogous notation for other Hilbert spaces V . ∗ We assume that f ∈ Lr (Ω; Ys∗ ) for some r∗ ≥ 2 and s∗ > 0 such that (4.84) holds. Also, we assume a ∈ L∞ (Ω; W s,∞ (D)) for all s ∈ [0, s∗ ]. The following regularity property generalizes Theorem 1.6 and is shown in Barth et al. (2010, Theorem 5.3).
417
Sparse tensor discretizations for sPDEs
Theorem 4.24. Under the above assumptions, for all 2 ≤ k ≤ r∗ , all 1 ≤ r ≤ r∗ /k and every 0 ≤ s ≤ s∗ ,
u(k) Lr (Ω;X (k) ) ≤ C f (k) Lr (Ω;Y (k) ) ≤ C f kLrk (Ω;Ys ) . s
s
(4.101)
We recall the sparse tensor product construction from Section 1.2. Let (ψj )(,j)∈∇ be a wavelet basis of V such that VL is the span of all ψj with ≤ L. Then the operator PL on V defined as the restriction to the coordinates with ≤ L is a projection onto VL . Let Q := P − P−1 for ∈ N0 , with P−1 := 0, and let W denote the range of Q . Then W is the span of ψj for all indices j. It complements V−1 to V in that V = V−1 ⊕ W , with a direct, but generally not orthogonal sum. We recall from (1.36) that the k-fold sparse tensor product with level L ∈ N0 is given by
(k) V1 ⊗ · · · ⊗ Vk = W1 ⊗ · · · ⊗ Wk ⊂ V (k) . VL := 0≤1 +···+k ≤L
0≤1 +···+k ≤L
(4.102) (k) k−1 k The dimension of VL is only O(NL (log NL ) ), compared to NL for the (k) full tensor product VL . If a hierarchical basis of the subspaces {V }∞ =0 ⊂ V satisfying (W1)– (W5) is explicitly given, the mappings P can be realized by truncating the corresponding expansions: see (1.38) and (1.39). These truncations provide numerically computable, stable and quasi-optimally accurate projections (k) onto VL . They are defined by
(k) Q1 ⊗ · · · ⊗ Qk . (4.103) PL := 0≤1 +···+k ≤L
This is simply the restriction of an element of V (k) , expanded in the ten···k ) (assumed to be V -orthogonal sor product hierarchical basis (ψj11···j k (i ,ji )∈∇ between different levels), to the indices with 1 + · · · + k ≤ L. (k) By Lemma 1.9, the projection PL is stable on V (k) in the sense that (k) (1.42) holds. Furthermore, the quasi-interpolant PL is quasi-optimal (pro vided that the basis (ψj ) is V -orthogonal between different levels ). Using Remark 1.8, for all 0 ≤ s ≤ min(p, s∗ ), there is a constant C(k, s) > 0 such (k) that, for all L ∈ N0 and every U ∈ Xs , (k) −s/d
U − PL U V (k) ≤ C(k, s)NL (log NL )(k−1)/2 U X (k) . s
(4.104)
By Proposition 1.7, the approximation rate in (4.104) is optimal. In terms
418
C. Schwab and C. J. Gittelson
of the projection PL , the sparse tensor multi-level Monte Carlo approximation of the kth moment Mk u = E[u(k) ] reads (k)
L [u(k) ] := E
L
(k) (k) (k) (k) EM P u − P−1 u−1 ,
(4.105)
=0
where EM is defined as in (4.87), and u−1 := 0. In the case k = 1, (4.105) reduces to (4.93). The proof of the following statement is analogous to the proof of Theorem 4.21. Theorem 4.25. If f ∈ L2k (Ω; Ys ) with 0 < s ≤ min(p, s∗ ), then there exists a constant C depending only on a, D, s and k such that, for any
> 0 and any L ∈ N0 , with probability 1 − , L [u(k) ] (k)
Mk u − E V ! ≤ C hsL |log hL |(k−1)/2 +
0
"
(4.106)
L + 1 −1/2 s M h |log h |(k−1)/2 f kL2k (Ω;Ys ) .
L
=0
Remark 4.26.
We consider the same choice of M as in Remark 4.22, B A (4.107) M := 22s(L−) (L + 1)3 −1 , = 0, 1, . . . , L.
Then the error bound (4.106) in Theorem 4.25 becomes L [u(k) ] (k) ≤ 2ChsL |log hL |(k−1)/2 f k 2k
Mk u − E V L (Ω;Ys )
(4.108)
with probability 1− . Assuming the availability of an optimal finite element solver, such as a full multigrid method or, for d = 1, a direct solver, since the (k) dimension of V is on the order of N (log N )k−1 , the total work required L [u(k) ] is to compute E L
=0
M N (log N )k−1 22sL (L + 1)k+2 −1
L
2(d−2s) .
(4.109)
=0
In terms of NL = O(2Ld ), the computational cost is k+2 −1 if 2s < d, L NL (log NL )
k−1 k+3 −1 if 2s = d, NL (log NL )
M N (log N ) 2s/d k+2 −1 =0 NL (log NL )
if 2s > d.
(4.110)
We refer to Barth et al. (2010) for a proof and further details. They also provide an error analysis of MLMC methods in the L2 (Ω, V (k) )-norm.
Sparse tensor discretizations for sPDEs
419
APPENDIX A. Review of probability A.1. Basic notation Definition A.1. (probability space) A triple (Ω, Σ, P) is called a probability space if Ω is a set, Σ is a σ-algebra on Ω, and P is a positive measure on Σ with P(Ω) = 1. Measurable sets E ∈ Σ are events; P(E) is the probability of the event E. P is called the probability measure. Remark A.2. (i) We shall always have {ω} ∈ Σ for all ω ∈ Ω. This is not implied by Definition A.1. (ii) For all E ∈ Σ, P(E) ∈ [0, 1]. (iii) Instead of ‘P-a.e.’, we write ‘P-a.s.’, which stands for ‘P almost surely’. Consider a finite number n of experiments Ei with random outcomes Ei , i = 1, . . . , n. To describe them, we assume we are given probability spaces (Ωi , Σi , Pi ), i = 1, . . . , n. Imagine next a new experiment E consisting of ‘mutually independent parallel’ experiments E1 , . . . , En . What is a suitable probability space (Ω, Σ, P) for the mathematical description of E? Any realization is of the form E (ω1 , . . . , ωn ) ∈ Ω1 × · · · × Ωn . If Ai ∈ Σi , i = 1, . . . , n is the outcome of Ei , then we consider the outcomes A1 , . . . , An of E1 , . . . , En (in this order). Hence, A := A1 × · · · × An ⊂ Ω1 × · · · × Ωn is the outcome of E. ‘Independence’ suggests that we choose × · · · × An ; Ai ∈ Σi } P(A) := P1 (A1 ) · · · Pn (An ). The set of all events {A1 * n is a generator of the product sigma* algebra Σ := i=1 Σi . On Σ, the n product measure P = P1 ⊗ · · · ⊗ Pn = i=1 Pi is the only measure satisfying the consistency condition P(A1 × · · · × An ) =
n )
Pi (Ai )
∀Ai ∈ Σi .
i=1
Obviously, P is a probability measure on Σ. Hence (Ω, Σ, P) =
n ' (Ωi , Σi , Pi ) i=1
is a probability space for E. A.2. Random variables, distributions, moments Definition A.3. (random variable) Let (Ω, Σ, P) be a probability space, and let (Ω , Σ ) be any measurable space. A (Ω , Σ )-valued random variable is any (Σ, Σ )-measurable map X : Ω → Ω .
420
C. Schwab and C. J. Gittelson
Remark A.4. (i) If the measurable space (Ω , Σ ) is clear from the context, we omit it. (ii) Images of elementary events ω ∈ Ω, i.e., ω → X(ω) ∈ Ω, are referred to as samples (of X), draws (of X), or realizations (of X). (iii) Images X(A) of ‘complex’ events A ∈ Σ are called ensembles. Example A.5. (1) If (Ω , Σ ) = (R, B 1 , R1 ), we call X a random number resp. a random variable (RV). (2) If (Ω , Σ ) = (Rn , B n ), n > 1, we call X a random vector. We always assume for Ω = Rd that Σ = B n . (3) If I = [0, T ] is an interval in R and Ω = C 0 (I), we call Ω ω → Xt (ω) ∈ C 0 (I) a stochastic process; for given fixed ω ∈ Ω, the realization Xt (ω) : I t → Xt (ω) is called a (continuous) sample path (of X). (4) We shall be interested in random variables mapping into a function space Ω over a domain D ⊂ Rd , for example the Sobolev space Ω = H01 (D). Then a ‘sample’ Ω ω → u(ω) ∈ H01 (D) is a random function or random field. The construction of a σ-algebra Σ on such an Ω will be explained below. Notation A.6. Σ ,
Let X be a (Ω , Σ )-valued random variable. For any A ∈ {X ∈ A } := X −1 (A ) ∈ Σ,
(A.1)
P{X ∈ A } := P(X −1 (A )). A }
The set {X ∈ is called the ‘event that X lies in the probability of this event. Note that A → P{X ∈ A },
(A.2) A ’,
and P{X ∈ A } is
A ∈ Σ ,
is the image measure of P under X on (Ω , Σ ). Since P{X ∈ Ω } = P(Ω) = 1, it is a probability measure on (Ω , Σ ). Random variables are measurable maps between measurable spaces. Proposition A.7.
Let (Ω, Σ), (Ω , Σ ) be measurable spaces.
(a) A map T : Ω → Ω is measurable if and only if ∀A ∈ E :
T −1 (A ) ∈ Σ
(A.3)
for some generator E of Σ . (b) If T1 : (Ω1 , Σ1 ) → (Ω2 , Σ2 ) and T2 : (Ω2 , Σ2 ) → (Ω3 , Σ3 ) are measurable, then T2 ◦ T1 : (Ω1 , Σ1 ) → (Ω3 , Σ3 ) is measurable.
Sparse tensor discretizations for sPDEs
421
(c) If T : (Ω, Σ) → (Ω , Σ ) is measurable. Then, for every measure µ on Σ the map A −→ µ(T −1 (A )) =: µ (A )
(A.4)
is a measure µ on (Ω , Σ ). Definition A.8. (image measure) The measure µ in (A.4) is the image measure of µ under T , denoted by µ = T# (µ), i.e., T# (µ)(A ) := µ(T −1 (A ))
∀A ∈ Σ .
(A.5)
Note that (T2 ◦ T1 )# (µ) = T2# (T1# (µ)).
(A.6)
Consider now a family ((Ωi , Σi ))i∈I of measurable spaces and a family of maps Ti : Ω → Ωi into Ωi . Then the σ-algebra Σ generated by (T i )i∈I −1 T i∈I i (Σi ) in Ω is the smallest σ-algebra such that each Ti is (Σi , Σ)measurable. We write ! " . −1 Ti (Σi ) . (A.7) σ(Ti ; i ∈ I) := σ i∈I
Definition A.9. (distribution, law) Let X be a (Ω , Σ )-valued random variable on a probability space (Ω, Σ, P). Then PX := X# (P) = P ◦ X −1
(A.8)
is called the distribution of X (with respect to P) or the law of X. Hence PX (A ) = P{X ∈ A },
A ∈ Σ .
(A.9)
Definition A.10. (expectation, mean field) Let X ∈ Rn be a random variable on a probability space (Ω, Σ, P). Then X P(dω) ∈ Rn (A.10) E(X) = EP (X) := Ω
is called the expected value or expectation of X. If X ∈ Ω is a random field in a separable Banach space Ω , then E(X) = EP (X) = X P(dω) ∈ Ω (A.10 ) Ω
is called the mean field or ensemble average of X and is sometimes denoted by X when P is clear from the context. Remark A.11. The Bochner integral in (A.10 ) is well-defined if E( X ) < ∞, where · denotes the norm on Ω .
422
C. Schwab and C. J. Gittelson
Remark A.12. Let (Ω , Σ ) = (Rn , B n ). Then, for any Borel-measurable function f on Rn which is PX -integrable, we have E(f ◦ X) = f dPX (A.11) Rn
or EP (f ◦ X) = EPX (f ).
(A.11 )
In particular, if X is integrable, f (x) := x gives E(X) = xPX (dx).
(A.12)
Rn
Definition A.13. (covariance) Let X be an integrable (Rn , B n )-valued random variable on a probability space (Ω, Σ, P). Then (A.13) Cov(X) := E (X − E[X])(X − E[X]) ∈ Rn ⊗ Rn = Rn×n is called the covariance of X. Note that
Cov(X) := Rn
(x − E[X])(x − E[X]) dx
(A.14)
is finite if and only if X is square-integrable. Proposition A.14. A real-valued random variable X on a probability space (Ω, Σ, P) is square-integrable if and only if X is integrable and Cov(X) = Var(X) < ∞. Then
Var(X) = E (X − E(X))2 = E(X 2 ) − E(X)2 2 2 = x PX (dx) − xPX (dx) . R
(A.15)
R
A.3. Independence Let (Ω, Σ, P) be a probability space and let I be a set of indices. Definition A.15. (independent events) A family (Ai )i∈I of events in Σ is called independent (with respect to P) if, for every non-empty, finite index set {i1 , . . . , in } ⊂ I, P(Ai1 ∩ · · · ∩ Ain ) = P(Ai1 ) · · · P(Ain ).
(A.16)
Example A.16. Let (Ωi , Σi , Pi ), i = 1, . . . , n, be probability spaces, and * (Ω, Σ, P) = ni=1 (Ωi , Σi , Pi ). For each i, let Ai ∈ Σi . Then the events Ai := Ω1 × · · · × Ωi−1 × Ai × Ωi+1 × · · · × Ωn , in Ω are independent.
i = 1, . . . , n,
Sparse tensor discretizations for sPDEs
423
Definition A.17. (independent families of events) Let (Ei )i∈I be a family of sets in Σ. It is called independent if (A.16) holds for every nonempty, finite index set {i1 , . . . , in } ⊂ I and every possible choice of Aiν ∈ Eiν , ν = 1, . . . , n. It is clear from the definition that independence is preserved if each Ei is reduced. Remark A.18. (i) Independence is preserved if each Ei is increased to its Dynkin system δ(Ei ) ⊂ Σ. (ii) If (Ei )i∈I ⊂ Σ is any independent family of ∩-stable subsets Ei of Σ, then the family (σ(Ei ))i∈I is independent. (iii) If (Ei )i∈I ⊂ Σ is as in (ii), and (Ij )j∈J is a partition of I into mutually disjoint Ij ⊂ I, then the system ! " . Ei , j ∈ J , Σj := σ i∈Ij
is independent. A.4. Independent random variables Let (Ω, Σ, P) be a probability space. By Remark A.18(ii), the family (Ai )i∈I is independent if and only if the family (Σi )i∈I of σ-algebras is independent, where Σi = {∅, Ai , Aci , Ω}. Definition A.19. (independent random variables) A family (Xi )i∈I of random variables (with i-dependent ranges) is independent if (σ(Xi ))i∈I is independent. Theorem A.20. Let (Xi )i=1,...,n be (Ωi , Σi )-valued random variables, and let Gi be a ∩-stable generator of Σi , Ωi ∈ Gi , i = 1, . . . , n. Then (Xi )i=1,...,n is independent if and only if, for all Qi ∈ Gi , i = 1, . . . , n, " !n n / ) −1 Xi (Qi ) = P(Xi−1 (Qi )). (A.17) P i=1
Proof.
i=1
Put Ei := {Xi−1 (Qi ) ; Qi ∈ Gi }.
Then Ei is a generator of σ(Xi ), and, by ∩-stability of Gi , Ei is ∩-stable and Ω ∈ Ei . By Remark A.18(ii), we must show that independence of (Ei )i∈I is equivalent to ∀Ei ∈ Ei :
P(E1 ∩ · · · ∩ En ) = P(E1 ) ∩ · · · ∩ P(En ).
424
C. Schwab and C. J. Gittelson
This is evident. Let Xi be (Ωi , Σi )-valued random variables, i = 1, . . . , n, on a single probability space (Ω, Σ, P), and define the product map Y := X1 ⊗ · · · ⊗ Xn : Ω → Ω1 × · · · × Ωn by Y (ω) := (X1 (ω), . . . , Xn (ω)),
ω ∈ Ω.
(A.18)
Then, for each A1 × · · · × An , Ai ∈ Σi , i = 1, . . . , n, (A.19) Y −1 (A1 × · · · × An ) = X1−1 (A1 ) ∩ · · · ∩ Xn−1 (An ). *n 6n Hence Y is a ( i=1 Ωi , i=1 Σi )-valued random variable on (Ω, Σ, P), and the distributions PXi , i = 1, . . . , n, and PY are well-defined. We call P Y = P X 1 ⊗ · · · ⊗ PX n the joint distribution of X1 , . . . , Xn . It is a probability measure on the product-measurable space " ! n n n ) ' ) Ωi , Σi = (Ωi , Σi ). i=1
i=1
i=1
Theorem A.21. Finitely many random variables Xi , i = 1, . . . , n, are independent if and only if their joint distribution is the product of their marginal distributions, i.e., if PX1 ⊗···⊗Xn = PX1 ⊗ · · · ⊗ PXn . Proof.
For each i = 1, . . . , n, let Ai ∈ Σi be an event. By (A.19), ! n " ! n " !n " ) ) / −1 −1 =P Ai = P Y Ai Xi (Ai ) , PY i=1
i=1
i=1
and PXi (Ai ) = P(Xi−1 (Ai )),
i = 1, . . . , n.
Hence, PY is the measure of the PXi if and only if, for any Ai ∈ Σi , PY (A1 × · · · × An ) = PX1 (A1 ) · · · PXn (An ). This is equivalent to " !n n / ) −1 Xi (Ai ) = P(Xi−1 (Ai )) P i=1
∀Ai ∈ Σi , i = 1, . . . , n.
i=1
By Theorem A.20, (A.17), X1 , . . . , Xn are independent.
(A.20)
Sparse tensor discretizations for sPDEs
425
A.5. Infinite products of probability spaces We saw that the proper model for the description of n < ∞ independent experiments with random outcome is the product probability space * (Ω, Σ, P) = ni=1 (Ωi , Σi , Pi ). We now consider the case where we have an infinite family E = (En )∞ n=1 of ‘independent’, ‘random’ experiments. Each experiment is described by a probability space (Ωn , Σn , Pn ), n = 1, 2, . . . . We build a probability space to describe E. It should satisfy the following conditions. (1) Each elementary event ω ∈ Ω is a sequence (ωn )∞ n=1 of elementary events ωn ∈ Ωn , i.e., Ω=
∞ )
Ωn = Ω1 × Ω2 × · · · .
n=1
(2) If A1 ∈ Σ1 , . . . , An ∈ Σn are possible outcomes at the first n experiments, we view the set A = A1 × · · · × An × Ωn+1 × Ωn+2 × · · · ,
n = 1, 2, . . .
(A.21)
as that outcome of E which gives A1 , . . . , An in the first n experiments of the (infinite) sequence (Ei )∞ i=1 of experiments. Therefore, we require that A defined in (A.21) satisfies A ∈ Σ and that P(A) = P1 (A1 ) · · · Pn (An ).
(A.22)
The requirements (A.21) and (A.22) and a certain minimum property define the measure P uniquely. Given an index set I = ∅ and a family ((Ωi , Σi , Pi ))i∈I of probability spaces, for each K ⊆ I we define ) Ωi , (A.23) ΩK := i∈K
and we set Ω := ΩI =
)
Ωi .
(A.24)
i∈I
Note that ΩK is the set of all maps . Ωi such that ωK (i) ∈ Ωi ωK : K →
∀i ∈ K.
i∈K
Restricting ωK to J ⊂ K, we get the projection map pK J := ΩK → ΩJ .
(A.25)
K If K = I, we write pJ := pIJ ; if j = {i}, pK i := p{i} . Then K L pL J = pJ ◦ pK ,
J ⊂ K ⊂ I.
(A.26)
426
C. Schwab and C. J. Gittelson
By F = F(I) we denote the set of all finite subsets of I. For each J ∈ F, we have ' ' Σi , PJ := Pi . (A.27) ΣJ := i∈J
i∈J
Definition A.22. (infinite product of σ-algebras) We call the prod* Σ of the family {Σi ; i ∈ I} of σ-algebras the smallest σ-algebra uct i i∈I Σ0 in Ω for which each projection pi is (Σ0 , Σi )-measurable, i.e., ' Σi := σ(pi ; i ∈ I). (A.28) Σ0 = i∈I
For all J ∈ F, pJ is (Σ0 , ΣJ )-measurable, since, by (A.26), we have pi = pJi ◦ pJ for all i ∈ J. This allows us to extend (A.28) to ' Σi = σ(pi ; i ∈ I) = σ(pJ ; J ∈ F(I)). (A.28 ) i∈I
We now wish to find a probability measure P on Σ0 such that ! "" ! ) ) −1 Ai Pk (Ai ) ∀J ∈ F, ∀Ai ∈ Σi , ∀i ∈ J. = P pJ i∈J
i∈J
By 6 definition of the image of a measure under a mapping, each pJ (P) of a set i∈J Ai has the value " ! ) ) Ai = Pi (Ai ). (A.29) (pJ )# (P) i∈J
i∈J
For all J ∈ F, the finite product measure PJ in (A.27) is the unique measure such that (A.29) holds. Does there exist a probability measure P on Σ0 such that its image under any projection pJ , J ∈ F, equals PJ ? * Theorem A.23. There exists a unique measure P on Σ0 = i∈I Σi such that (A.30) (pJ )# (P) = PJ ∀J ∈ F(I). P is a probability measure on (Ω, Σ0 ). We refer to Bauer (1996) for the proof. If |I| < ∞, P = PI by (A.30). Definition A.24. (infinite product measure) The unique probability A.23 is called the product of the measures measure P on Σ0 from Theorem * (Pi )i∈I and is denoted by i∈I Pi . The probability space ! " ) ' ' Ωi , Σi , Pi (Ω, Σ0 , P) = i∈I
i∈I
i∈I
Sparse tensor discretizations for sPDEs
427
is called the product of the probability spaces ((Ωi , Σi , Pi )i∈I ) and is denoted by ' (Ωi , Σi , Pi ). (Ω, Σ0 , P) =: i∈I
Now we can extend Theorem A.21 on independence of random variables X1 , . . . , Xn . Theorem A.25. A family (Xi )i∈I of random variables is independent if and only if their joint distribution is the product of the distributions PXi , i.e., ' PX i . (A.31) P Xi = i∈I
Proof.
i∈I
For every ∅ = J ⊂ I, J ∈ F, let ) ) Ωi → Ωj pJ : i∈I
j∈J
denote the projection, let Y denote the mapping * 6 Ω denote j j∈J j∈J Xj . Then YJ = pJ ◦ Y , whence it follows that
* i∈I
Xi , and let YJ : Ω →
PYJ = (pJ )# (PY ), by transitivity (A.6) of image measures. Independence of (Xi )i∈I is equivalent to independence of (Xj )j∈J for all J ∈ F, i.e., by Theorem A.21, ' PYJ = PXj ∀J ∈ F. j∈J
By Theorem A.23, (A.31) is equivalent to ' PX j (pJ )# (PY ) =
∀J ∈ F.
j∈J
The assertion follows. Corollary A.26. For any family ((Ωi , Σi , Pi ))i∈I of probability spaces, there exists an independent family (Xi )i∈I of (Ωi , Σi )-valued random variables Xi on a suitable probability space (Ω, Σ, P) such that ∀i ∈ I :
Pi = PX i
is the distribution of Xi . Proof.
We choose (Ω, Σ, P) =
' (Ωi , Σi , Pi ) i∈I
(A.32)
428
C. Schwab and C. J. Gittelson
and Xj = pj :
)
Ωi → Ωj .
i∈I
* Then, by the definition of product measure P = i∈I Pi , Pj is the distribution of Xj , for all j ∈ I. * The independence of (Xi )i∈I6follows from Theorem A.25, since i∈I Xi is the identity map from Ω = i∈I Ωi onto itself, whence ' ' Pi∈I Xi = P = Pi = PX i . i∈I
i∈I
B. Review of Hilbert spaces We review several standard notions and definitions of bases in separable Hilbert spaces to the extent necessary in the present work; among the many references for this material, we mention in particular Christensen (2008, 2010). B.1. Basic properties By H, we denote a real , separable Hilbert space, with norm · H and inner product ·, ·. Definition B.1. (Schauder basis) A sequence (ek )∞ k=1 ⊂ H is called a (Schauder ) basis of H if for any x ∈ H there exists a unique sequence (ck )∞ k=1 such that n
ck ek → 0, n → ∞, (B.1) x − k=1
H
or equivalently, x=
∞
c k ek
(B.1 )
in H.
k=1
Proposition B.2. Every separable Hilbert space over R admits a basis ∞ (ek )∞ k=1 . Given any basis (ek )k=1 of H, there exists a unique sequence ∞ (gk )k=1 ⊂ H such that ∀f ∈ H :
f=
∞
f, gk ek
in H.
(B.2)
k=1
Then (gk )∞ k=1 is also a basis of H, called the dual basis. The sequences and (gk )∞ (ek )∞ k=1 k=1 are biorthogonal , ek , gj = δkj .
(B.3)
429
Sparse tensor discretizations for sPDEs ∞ We also say (gk )∞ k=1 is the biorthogonal system for (ek )k=1 .
(fk )∞ k=1 ⊂ H is a Bessel sequence if
Definition B.3. (Bessel sequence) ∃B > 0
∞
|f, fk |2 ≤ B f 2H .
∀f ∈ H :
k=1
B is called a Bessel bound. Lemma B.4. and only if
(fk )∞ k=1 ⊂ H is a Bessel sequence with Bessel bound B if T : (ck )∞ k=1 →
∞
c k fk
k=1
is a well-defined, bounded operator from 2 (N) into H and T ≤
√
B.
2 Proof. Assume (fk )k ⊂ H is Bessel ∞ and (ck )k ∈ (N). To show that T (ck )k is well-defined, we show that k=1 ck fk converges in H. Let m, n ∈ N, n > m. Then n % n n & m
c f − c f c f c f , g = = sup k k k k k k k k g =1 k=1
k=1
k=m+1
k=m+1
n
≤ sup
|ck fk , g|
g =1 k=m+1
!
n
≤
"1/2
|ck |2
k=m+1
≤ n
√
!
n
B
! sup g =1
"1/2 |ck |2
n
"1/2 |fk , g|2
k=m+1
.
k=m+1
n ∞ ( 1 |ck |2 )∞ n=1 is Cauchy, and thus ( 1 ck fk )n=1 Therefore T : 2 (N) → H is well-defined and bounded
Since (ck ) ∈ is convergent. √
T ≤ B. Obviously, T is also linear. Since 2 (N),
∞
|f, fk |2 = T ∗ f 22 ≤ T 2 f 2H
⊂H with
∀f ∈ H,
k=1
the claim follows. ∞ Lemma B.5. Let (ek )∞ k=1 be a basis of H and (gk )k=1 the associated ∞ biorthogonal system. If (ek )k=1 is a Bessel sequence with bound B, then ∞
1
f 2H ≤ |f, gk |2 B k=1
∀f ∈ H,
(B.4)
430
C. Schwab and C. J. Gittelson
and for all finitely supported sequences (ck )∞ k=1 , 2 ∞ ∞ 1 2 |ck | ≤ c k gk . B k=1 k=1 H ∞ Proof. Let f ∈ H. Since f = k=1 f, gk ek , 2 ∞
f 4H = f, gk ek , f
(B.5)
k=1
≤
∞
|f, gk |2
k=1
∞
|ek , f |2 ≤ B f 2H
k=1
∞
|f, gk |2 .
k=1
This shows (B.4). Let (ck )∞ k=1 be a finitely supported sequence. Then (B.5) follows from ∞ 2 % ∞ 2 ∞ &2 ∞ ∞ ∞
|ck |2 = cj gj , ek = c j g j , ek ≤ B c j gj . k=1
k=1 j=1
k=1
δjk
j=1
j=1
H
B.2. Bases of Hilbert spaces As before, we let H denote a separable Hilbert space. Definition B.6. (orthonormal basis) A sequence (ek )∞ k=1 ⊂ H is an orthonormal system in H if ek , ej = δkj . It is an orthonormal basis of H if, in addition, it is a basis of H, i.e. n
x, ei ei → 0, n → ∞, (B.6) ∀x ∈ H : x − i=1
H
or equivalently, ∀x ∈ H :
x=
∞
x, ei ei
in H.
(B.6 )
i=1
Remark B.7. Any orthonormal system (ek )k ⊂ H is a Bessel sequence with Bessel constant B = 1. Proof. Let (ck )k ⊂ 2 (N), m, n ∈ N, n > m. Then ( nk=1 ck ek )n converges in H since 2 m m
c e = |ck |2 → 0, m → ∞, k k k=n+1
H
n+1
Sparse tensor discretizations for sPDEs
and we find
431
∞ 2 ∞
c e = |ck |2 = c 22 (N) . k k k=1
H
k=1
Therefore, for f ∈ H, (ck )k = (f, ek )k ∈ 2 (N) and thus B = 1. Theorem B.8. For an orthonormal system (ek )k ⊂ H, the following conditions are equivalent: (a) (ek )k is an orthonormal basis of H, (b) for all f ∈ H, f = ∞ k=1 f, ek ek , (c) for all f, g ∈ H, f, g = ∞ k=1 f, ek ek , g, ∞ (d) for all f ∈ H, k=1 |f, ek |2 = f 2H (Parseval), (e) span(ek )∞ k=1 is dense in H, (f) f, ek = 0 for all k ∈ N implies f = 0. Corollary B.9. If (ek )k is an orthonormal basis of H, it coincides with its biorthogonal basis, and ∀f ∈ H :
∞
f, ek ek . f= k=1
Theorem B.10. basis (ek )k .
Every separable Hilbert space H has an orthonormal
Proof. Since H is separable, there exists a sequence (fk )∞ k=1 for which is dense in H. We assume, without loss of generality, that for span(fk )∞ k=1 n / span(fk )k=1 . Applying Gram–Schmidt orthogonalizaall n ∈ N, fn+1 ∈ , we obtain an orthonormal system (ek )∞ tion to (fk )∞ k=1 k=1 ⊂ H such that n span(ek )k=1 = span(fk )nk=1 for all n ∈ N. By Theorem B.8, (ek )k is an orthonormal basis of H. Example B.11. thonormal basis.
If H = 2 (N), then (δk ) = (0, 0, . . . , 0, 1, 0, . . .) is an or-
Theorem B.12. Every separable infinite-dimensional Hilbert space H is isometrically isomorphic to 2 (N). Proof. Let (ek )∞ k=1 be an orthonormal basis of H. Then, for all (ck ) ∈ c e 2 (N), ∞ k=1 k k is convergent. Also, ∀f ∈ H :
∞
f= f, ek ek . k=1
432
C. Schwab and C. J. Gittelson
2 If (δk )∞ k=1 is the orthonormal basis of (N) from Example B.11, we define " !∞ ∞
ck ek := ck δk , (ck )k ∈ 2 (N). U : H → 2 (N) : U k=1
k=1
ThenU : H → 2 (N) is well-defined and bijective. Also, for all f ∈ H, f = k f, ek ek and 2 ∞ ∞
2 = |f, ek |2 = f 2H .
U f 2 (N) = f, ek δk 2 k=1
(N)
k=1
Theorem B.13. Let (ek )k be an orthonormal basis of a separable Hilbert space H. Then all orthonormal bases of H are of the form (U ek )∞ k=1 for a unitary map U : H → H. Proof.
Let (fk )k be an orthonormal basis of H. Define " !
c k ek = ck fk , (ck )k ∈ 2 (N). U : H → H, U k
(B.7)
k
Then U : H → H is bounded and bijective. f, e For f, g ∈ H, f = k ek , g = k k g, ek ek . Then using (B.7), Theorem B.8 implies U ∗ U f, g = U f, U g & %
f, ek fk , g, e f = f, ek g, ek = f, g. = k
k
U ∗U
= I, and since U is surjective by (B.7), U is unitary. Therefore Conversely, if a unitary map U is given, then U ek , U ej = U ∗ U ek , ej = ek , ej = δkj , so (U ek )k is an orthonormal system. Since U is surjective, (U ek )k is an orthonormal basis of H. B.3. Tensor products of separable Hilbert spaces Tensor products are useful in the design of sparse approximation schemes. We consider tensor products of separable Hilbert spaces and refer to Light and Cheney (1985), Ryan (2002), Schatten (1943), Grothendieck (1955) and Kalton (2003) for a general theory of tensor products of Banach spaces. We follow the construction in Reed and Simon (1980) for separable Hilbert spaces. Let H1 , H2 be two separable Hilbert spaces. For ϕ1 ∈ H1 , ϕ2 ∈ H2 , we denote by ϕ1 ⊗ ϕ2 the conjugate bilinear form on H1 × H2 defined by (ϕ1 ⊗ ϕ2 )(ϕ1 , ψ2 ) := ψ1 , ϕ1 H1 ψ2 , ϕ2 H2
∀ψi ∈ Hi , i = 1, 2.
Sparse tensor discretizations for sPDEs
433
Let E denote the space of all finite linear combinations of such bilinear forms; on E, we define an inner product by ϕ ⊗ ψ, η ⊗ µ := ϕ, ηH1 ψ, µH2 ,
ϕ, η ∈ H1 ,
ψ, µ ∈ H2 .
(B.8)
·, · from (B.8) is well-defined and positive definite.
Proposition B.14.
Proof. To show that ·, · is well-defined, we check that λ, λ is independent of the linear combination of simple tensors used to represent λ and λ in E. By linearity and symmetry, it suffices to show that if µ is a finite sum in E equal to the zero form, then η, µ = 0 ∀η ∈ E. Let η=
N
ci (ϕi ⊗ ψi ).
i=1
%
Then η, µ =
N
& ci (ϕi ⊗ ψi ), µ
i=1
=
N
ci µ(ϕi , ψi ) = 0,
i=1
since µ is the zero form. Hence ·, · is well-defined. Next, we show that ·, · is positive definite. Let λ=
M
dk (ηk ⊗ µk ).
k=1
Then M1 := span {ηk }N k=1 ⊂ H1 ,
M2 := span {µk }M k=1 ⊂ H2
N2 1 are subspaces. Let {ϕj }N j=1 , {ψ }=1 be orthonormal bases of M1 and M2 . Then we can write each ηk uniquely in terms of the ϕj , and each µk uniquely via the ψ to get N2 N1
λ= cj (ϕj ⊗ ψ ). j=1 =1
We compute
%
λ, λ =
j,
=
j,,i,m
cj (ϕj ⊗ ψ ),
& cim (ϕi ⊗ ψm )
i,m
cj cim ϕj , ϕi H1 ψ , ψm H2 =
|cj |2 ≥ 0.
j,
Furthermore, if λ, λ = 0, then cj = 0 for all j, , hence λ = 0. Thus ·, · is positive definite. Therefore, E is a pre-Hilbert space with inner product ·, ·.
434
C. Schwab and C. J. Gittelson
Definition B.15. (tensor product of separable Hilbert spaces) The tensor product H1 ⊗ H2 of H1 and H2 is the completion of E under ·, ·. Proposition B.16. If (ϕk )k and (ψ ) are orthonormal bases of H1 and H2 , respectively, then the set of all dyadic products (ϕk ⊗ ψ )k, is an orthonormal basis of H1 ⊗ H2 . Proof. We assume that H1 , H2 are infinite-dimensional and separable. Then (ϕk ⊗ ψ )k is an orthonormal set in H1 ⊗ H2 , and hence we must show E ⊂ S := spanH1 ⊗H2 (ϕk ⊗ ψ ). Let ϕ ⊗ ψ ∈ E. Since (ϕk )k , (ψ ) are bases, we have
c k ϕk , |ck |2 < ∞, ψ = d ψ , |d |2 < ∞. ϕ= k
k
Therefore, there exists a vector
ck d ϕk ⊗ ψ ∈ S, µ= k,
and
N2 N1
ck d ϕk ⊗ ψ → 0, ϕ ⊗ ψ −
N1 , N2 → ∞.
k=1 =1
Let (M1 , µ1 ), (M2 , µ2 ) denote two measure spaces. We assume that L2 (M2 , µ1 ) and L2 (M2 , µ2 ) are separable. Further, let (ϕk (x))k , (ϕ (y)) denote orthonormal bases of L2 (M1 , µ1 ) and of L2 (M2 , µ2 ), respectively. We show that (ϕk (x) ψ (y))k is then an orthonormal basis of L2 (M1 × M2 , µ1 ⊗ µ2 ). To see this, we assume f (x, y) ∈ L2 (M1 × M2 , µ1 ⊗ µ2 ) and f (x, y)ϕk (x)ψ (y) (µ1 ⊗ µ2 ) d(x, y) = 0 ∀k, . M1 ×M2
By Fubini’s theorem,
f (x, y)ϕk (x) µ1 (dx) ψ (y)µ2 (dy) = 0.
M2
M1
Since (ψ ) is an orthonormal basis of L2 (M2 , µ2 ), we have f (x, y)ϕk (x) µ1 (dx) = 0, for µ2 -a.e. y.
(B.9)
M1
Let Sk = {y ∈ M2 ; (B.9) = 0}. Then µ2 (Sk ) = 0, and . ∀y ∈ / Sk : f (x, y)ϕk (x) µ1 (dx) = 0 ∀k. k
M1
Therefore, f (x, y) = 0 for all y ∈ / k Sk , µ1 -a.e. x ∈ M1 , and consequently f (x, y) = 0 for µ1 ⊗ µ2 -a.e. (x, y) ∈ M1 × M2 . This implies that (ϕk (x) ψ (y))k is a basis of L2 (M1 × M2 , µ1 ⊗ µ2 ).
Sparse tensor discretizations for sPDEs
435
Let U : ϕk ⊗ ψ → ϕk (x)ψ (y). Then U maps the orthonormal bases (ϕk )k of L2 (M1 , µ1 ) and (ϕ ) of L2 (M2 , µ2 ) onto the orthonormal basis (ϕk ⊗ ψ ) of L2 (M1 × M2 , µ1 ⊗ µ2 ). Thus U extends uniquely to a unitary isomorphism U : L2 (M1 , µ1 ) ⊗ L2 (M2 , µ2 ) → L2 (M1 × M2 , µ1 ⊗ µ2 ). Note that for f ∈ L2 (M1 , µ1 ) and g ∈ L2 (M2 , µ2 ), " ! " !
c k ϕk ⊗ d ψ = U c k d ϕk ⊗ ψ U (f ⊗ g) = U =
k
k,
ck d ϕk (x)ψ (y) = f (x)g(y).
k,
Thus U
L2 (M1 × M2 , µ2 ⊗ µ2 ) ∼ = L2 (M1 , µ1 ) ⊗ L2 (M2 , µ2 ). Also, if (M, µ) is a measure space, and H is a separable Hilbert space with orthonormal basis (ϕk )k , then we have in H: ∀g ∈ L2 (M, µ; H) : Define U:
N
k=1
g(x) = lim
N
N →∞
fk (x) ⊗ ϕk →
k=1
N
(ϕk , g(x))H ϕk .
=:fk (x)∈L2 (M,dµ)
fk (x)ϕk .
k=1
Then U is well-defined on a dense subset of L2 (M, µ) ⊗ H onto a dense set in L2 (M, µ; H), preserving norms. Thus U extends uniquely to a unitary operator U : L2 (M, µ) ⊗ H → L2 (M, µ; H). Theorem B.17. Let (M1 , µ1 ) and (M2 , µ2 ) be measure spaces such that L2 (M1 , dµ1 ) and L2 (M2 , dµ2 ) are separable. (a) There is a unique unitary isomorphism from L2 (M1 , µ1 ) ⊗ L2 (M2 , µ2 ) to L2 (M1 × M2 , µ1 ⊗ µ2 ) such that f ⊗ g → f g. (b) For any separable Hilbert space H, there exists a unique unitary isomorphism from L2 (M1 , µ1 )⊗H to L2 (M1 , µ1 ; H) such that f (x)⊗ϕ → f (x)ϕ. (c) There exists a unique unitary isomorphism from L2 (M1 × M2 , µ1 ⊗ µ2 ) to L2 (M1 , µ1 ; L2 (M2 , µ2 )) satisfying f (x, y) → f (x, ·).
436
C. Schwab and C. J. Gittelson
B.4. Linear operators on Hilbert spaces Again we denote by H and U real , separable Hilbert spaces, with norms
· H , · U , inner products ·, ·H , ·, ·U and associated Borel sets B(H) and B(U ), respectively. Let L(U, H) denote the Banach space of all bounded linear maps from U into H. For U = H, we write L(H) = L(H, H). For T ∈ L(H), T ≥ 0 denotes a non-negative, self-adjoint operator, for which h, T hH ≥ 0 for all h ∈ H. Let L+ (H) be the set of all such operators, L+ (H) := {T ∈ L(H) ; T x, x ≥ 0 ∧ T x, y = x, T y
∀x, y ∈ H}.
By K(U, H) ⊂ L(U, H) we denote the set of compact linear operators from U to H. In building Gaussian measures on Hilbert spaces, we shall be using two important subsets of L(U, H): the nuclear operators, which are also called trace-class operators, and the Hilbert–Schmidt operators. We recapitulate basic properties as needed here and refer to the Appendix of Peszat and Zabczyk (2007) for a more detailed overview. Definition B.18. By L1 (U, H) ⊂ L(U, H) we denote the subset of nuclear operators from U to H: T ∈ L(U, H) is nuclear if there exist sequences {aj }j∈N ⊂ H, {bj }j∈N ⊂ U such that ∞ j=1 aj H bj U < ∞ and such that ∀f ∈ U :
Tf =
∞
f, bj U aj .
(B.10)
j=1
The set L1 (U, H) is a Banach space with norm ∞ ∞
aj H bj U ; T f = f, bj U aj , ∀f ∈ U .
T L1 (U,H) := inf j=1
j=1
(B.11) Note that L1 (U, H) ⊂ K(U, H) since each T ∈ L1 (U, H) can be approximated in operator norm by a sequence of operators of finite rank. Lemma B.19. Let T ∈ L1 (H) and let {ek }∞ k=1 be an orthonormal basis of H. Then ∞
T ek , ek H (B.12) Tr T = k=1
exists and is independent of the particular choice of orthonormal basis. Definition B.20. We call T ∈ L(U, H) a Hilbert–Schmidt operator (HS operator) if ∞
T ek 2H < ∞ (B.13) k=1
Sparse tensor discretizations for sPDEs
437
for some orthonormal basis (ek )∞ k=1 of U . We denote the subset of L(U, H) of HS operators by L2 (U, H). The linear space L2 (U, H) of HS operators from U into H is a separable Hilbert space: its scalar product is defined in terms of the orthonormal basis (ek )k ⊂ U of U , ∞
Sek , T ek H . (B.14) S, T HS := k=1
We denote by · HS the corresponding Hilbert–Schmidt norm. For S ∈ L2 (U, H) and orthonormal bases (ek )k ⊂ U , (fk )k ⊂ H of U and of H, respectively, we have
Sek 2H = Sek , fj 2H = ek , S ∗ fj 2U =
S ∗ fj 2U . k
kj
j
kj
Therefore we have the following. Proposition B.21. The HS operator norm · HS does not depend on the choice of orthonormal basis for U . Also, S ∈ L2 (U, H) if and only if S ∗ ∈ L2 (H, U ) and S L2 (U,H) = S ∗ L2 (H,U ) . Moreover, if (fk )k ⊂ H and (ek )k ⊂ U are orthonormal bases, then the rank-one operators (fj ⊗ ek )j,k∈N defined by (fj ⊗ ek )(u) := fj ek , uU ,
u∈U
are an orthonormal basis of L2 (U, H). We collect further properties of operators in L1 and L2 . Proposition B.22. (a) For S ∈ L1 (U, H) and T ∈ L(H, V ), T S ∈ L1 (U, V ) and
T S L1 (U,V ) ≤ S L1 (U,H) T L(H,V ) . (b) If S ∈ L(U, H), T ∈ L1 (H, V ) then T S ∈ L1 (U, V ) and
T S L1 (U,V ) ≤ S L(U,H) T L1 (H,V ) . (c) If S ∈ L(U, H) and T ∈ L(H, U ), and if either S or T is of trace class, then T S ∈ L1 (U ) and Tr(T S) = Tr(ST ). (d) if S ∈ L(U ) and if T ∈ L2 (U, H) then T S ∈ L2 (U, H) and
T S L2 (U,H) ≤ T L2 (U,H) S L(U ) . (e) If K(U, H) ⊂ L(U, H) denotes the subset of compact linear operators from U to H, L1 (U, H) ⊂ L2 (U, H) ⊂ K(U, H) ⊂ L(U, H).
438
C. Schwab and C. J. Gittelson
Proof. We show (e): we can write R ∈ L1 (U, H) as R = k bk ⊗ ak , where (ak )k ⊂ U and (bk )k ⊂ H are bases such that k ak U bk H < ∞ and we recall that b ⊗ a(u) = ba, uU . Let (en )n ⊂ U denote an orthonormal basis of U . Then 2
2
Ren H = bk ak , en U H n n k
≤ |bk , bl | |ak , en U | |al , en U | n
≤
kl
bk H bl H
≤
1/2
n
kl
ak , en 2U
n
2
bk H ak U
1/2 al , en 2U
.
k
Taking the infimum over all bases (ak )k ⊂ U and (bk )k ⊂ H such that k ak U bk H < ∞, we obtain the estimate
R L2 (U,H) ≤ R L1 (U,H) , which proves L1 (U, H) ⊂ L2 (U, H). The next inclusion follows from the fact that the HS norm is a stronger norm than the operator norm, and that K(U, H) is closed in L(U, H) and that each HS operator R ∈ L2 (U, H) is the limit, in the HS norm, of the sequence of operators of finite rank,
fk ⊗ T ∗ fk , n ∈ N. Tn = k≤n
We recall the spectral theorem for compact, self-adjoint operators. Proposition B.23. For Q ∈ K(H) and Q = Q∗ , there exists an orthonormal basis (ek )∞ k=1 of eigenfunctions of H such that Qek = λk ek , and a decreasing sequence (λk )k ⊂ R, λ1 ≥ λ2 ≥ · · · ≥ 0 of real, non-negative eigenvalues which accumulate only at zero. Moreover, ∀x ∈ H :
Qx =
∞
λk x, ek ek ,
k=1
and if Q ∈ L+ 1 (H), ∞ > Tr(Q) =
∞
λk .
k=1
We finally add a result which is useful in the context of Karhunen–Lo`eve expansion of random fields. It should be compared to Theorem B.17.
439
Sparse tensor discretizations for sPDEs
Proposition B.24. Let (Ei , Ei ), i = 1, 2 be two measurable spaces and let µi be σ-finite measures on (Ei , Ei ), i = 1, 2. Further, let E = E1 ×E2 and E := E1 ⊗ E2 denote the product space. Then product measure µ = µ1 ⊗ µ2 is σ-finite on (E, E). Further, let U = L2 (E1 , E1 , µ1 ) and H = L2 (E2 , E2 , µ2 ) be separable. Then an operator R ∈ L(U, H) belongs to L2 (U, H) if and only if there is a kernel K ∈ L2 (E, E, µ) such that ∀ψ ∈ U, ξ ∈ E2 : Rψ(ξ) := K(η, ξ)ψ(η)µ1 (dη). (B.15) E1
Then
R 2L2 (U,H)
|K(η, ξ)|2 µ1 (dη)µ2 (dξ).
= E1
(B.16)
E2
2 ∞ Proof. Let (ek )∞ k=1 be an orthonormal basis of L (E1 , E1 , µ1 ) and let (fk )k=1 2 be an orthonormal basis of = L (E2 , E2 , µ2 ). Further, let the operator R be given by (B.15). Then the Parseval equality (Theorem B.8(d)) implies 2 ∞
Ren 2H = K(η, ξ)en (η)µ1 (dη) µ2 (dξ) n=1
E2
E1
|K(η, ξ)|2 µ(dη)µ2 (dξ).
= E2
E1
Conversely, assume that R ∈ L2 (U, H) and let (en )∞ n=1 be an orthonor2 ∞ mal basis of L (E1 , E1 , µ1 ) and let (fk )k=1 be an orthonormal basis of L2 (E2 , E2 , µ2 ). Define the kernel K(η, ξ) : U × H → R by K(η, ξ) :=
∞ ∞
Ren , fk N en (η)fk (ξ).
n=1 k=1
C. Review of Gaussian measures on Hilbert spaces C.1. Measures on metric spaces For any complete metric space E, denote by B(E) the Borel σ-algebra generated by all closed or, equivalently, open sets of E. A random variable in (Ω, Σ, P) with values in E is a mapping X : Ω → E such that ∀I ∈ B(E) : X −1 (I) ∈ Σ. The law of X is the probability measure X# P on (E, B(E)) defined by X# P(I) := P(X −1 (I)) = P(X ∈ I)
∀I ∈ B(E).
440
C. Schwab and C. J. Gittelson
Proposition C.1. (change of variables) Let X be a random variable on (Ω, Σ, P) with values in E. Let ϕ : E → R be bounded and B(R)measurable. Then ϕ(X(ω))P(dω) = ϕ(x) X# P(dx). (C.1) Ω
E
We show (C.1) for ϕ = 1I , I ∈ B(E). In this case,
Proof.
ω ∈ Ω.
ϕ(X(ω)) = 1 −1 (ω), X (I) ∈Σ
Hence,
ϕ(X(ω)) P(dω) = P(X −1 (I)) = X# P(I) =
Ω
ϕ(x) X# P(dx). E
The general case follows by approximating ϕ(x) by simple functions. C.2. Gaussian measures on separable Hilbert spaces We present a concrete construction of Gaussian measures on separable Hilbert spaces as countable products of Gaussian measures on R, generalizing naturally the construction of Gaussian measures in Rd for finite dimensions d < ∞, following Da Prato (2006). Gaussian measure on R For a pair (a, λ) of real numbers with a ∈ R, λ ≥ 0, define a measure Na,λ on (R, B(R)) as follows. If λ = 0, Na,0 := δa , where
δa (B) :=
1 if a ∈ B, 0 else,
and if λ > 0, 1 Na,λ (B) := √ 2πλ
e−
B ∈ B(R),
(x−a)2 2λ
dx,
B ∈ B(R).
B
Note that 1 Na,λ (R) = √ 2πλ
∞
e−
(x−a)2 2λ
dx = 1,
−∞
hence Na,λ is a probability measure. As is well known, Na,λ is absolutely continuous with respect to the Lebesgue measure dx, with explicit density Na,λ (dx) = √
(x−a)2 1 e− 2λ dx. 2πλ
Sparse tensor discretizations for sPDEs
Proposition C.2.
441
For any a ∈ R, λ ≥ 0, the mean of Na,λ is xNa,λ (dx) = a, R
and its variance is
R
(x − a)2 Na,λ (dx) = λ.
For all m ∈ N, the mth moment of the Gaussian measure Na,λ is finite, i.e., xm Na,λ (dx) < ∞, R
and its Fourier transform is given by 1 2 eihx Na,λ (dx) = eiah− 2 λh , Na,λ (h) := R
h ∈ R.
Gaussian measures on finite-dimensional Hilbert spaces We consider a finite-dimensional Hilbert space H, d := dim H < ∞ with scalar product ·, · and norm · H . To this end, we recall that for probability space (Ωi , Σi , Pi ), i = 1, . . . , d, the product probability space is given by d ' (Ωi , Σi , Pi ) (Ω, Σ, P) := i=1
(see Appendix A). Let a ∈ H, Q ∈ L+ (H) (see Appendix B). Then Q can be represented in any orthonormal basis (ei )di=1 of H as a d × d symmetric, positive semidefinite matrix (ej , Qej )di,j=1 . We now choose a particular orthonormal basis (ei )di=1 such that Q becomes diagonal, i.e., such that Qek = λk ek ,
k = 1, . . . , d,
λk ≥ 0.
Let ∀x ∈ H :
xk := x, ek ,
k = 1, . . . , d.
Then a = (a1 , . . . , ad ), ak = a, ek , and H is isomorphic to Rd via the unitary map γ(x) := (x1 , . . . , xd ). γ : H → Rd , x → Define a product measure Na,Q on (Rd , B(Rd )) by Na,Q :=
d ' k=1
If a = 0, we write NQ for Na,Q .
Nak ,λk .
442
C. Schwab and C. J. Gittelson
Proposition C.3. Let H be a Hilbert space with d := dim H < ∞, and let Q ∈ L+ (H). Then xNa,Q (dx) = a ∈ H, H
for all y, z ∈ H,
y, x − az, x − aNa,Q (dx) = Qy, z, H
and for all h ∈ H, a,Q (h) := N
1
ei h,x Na,Q (dx) = ei a,h− 2 Qh,h . H
If, moreover, det Q > 0, then Na,Q (dx) is absolutely continuous with respect to the Lebesgue measure on Rd , and 1 1 −1 Na,Q (dx) = ( e− 2 Q (x−a),(x−a) dx. d (2π) det Q The vector a ∈ H is the mean and Q ∈ H ⊗ H is called the covariance operator of Na,Q . Proposition C.4. Let H be a finite-dimensional Hilbert space, a ∈ H, Q ∈ L+ (H), and let µ be a finite measure on (H, B(H)) such that 1 ∀h ∈ H : ei h,x µ(dx) = ei a,h− 2 Qh,h . H
Then µ = Na,Q . Measures on separable Hilbert spaces Let H be a separable Hilbert space with dim H = ∞, scalar product ·, · and norm · H . For any n ∈ N and any orthonormal basis (ek )∞ k=1 of H, we define the projection Pn : H → Pn (H) = span{e1 , . . . , en } ⊂ H by Pn x :=
n
x, ek ek ,
x ∈ H.
(C.2)
k=1
Then, for any x ∈ H, x − Pn x H → 0 as n → ∞. Denote by M(H) the set of all bounded measures on (H, B(H)). Proposition C.5. (uniqueness of measures on H) For µ, ν ∈ M(H), if, for all continuous, bounded ϕ : H → R, ϕ(x) µ(dx) = ϕ(x) ν(dx), (C.3) H
then µ = ν.
H
Sparse tensor discretizations for sPDEs
443
Proof. Let C ⊂ H be closed, and let (ϕn )n be a sequence of continuous, bounded functions on H such that ∀x ∈ H : ϕn (x) −→ 1C (x), n→∞
e.g.,
1 1 − n d(x, C) ϕn (x) := 0
sup |ϕn (x)| ≤ 1,
(C.4)
x∈H
if x ∈ C, 1 if x ∈ / C ∧ d(x, C ) < , n 1 if d(x, C) ≥ . n
By dominated convergence, ϕn dµ = ϕn dν −→ µ(C) = ν(C). H
n→∞
H
Since the closed subsets of H are ∩-stable and generate B(H), µ = ν. Proposition C.6. Let µ, ν be finite measures on (H, B(H)) such that for all n ∈ N, (Pn )# µ = (Pn )# ν. Then in M(H).
µ=ν
Proof. Let ϕ : H → R be continuous and bounded. By dominated convergence, ϕ(x) µ(dx) = lim ϕ(Pn x) µ(dx). n→∞ H
H
The change of variables formula (C.1) implies ϕ(x) µ(dx) = lim ϕ(Pn x) µ(dx) = lim ϕ(ξ)(Pn )# µ(dξ) n→∞ H n→∞ P (H) H n = lim ϕ(ξ)(Pn )# ν(dξ) = lim ϕ(Pn x) ν(dξ) n→∞ P (H) n→∞ H n = ϕ(x) ν(dx). H
Proposition C.5 implies the assertion µ = ν. Define the Fourier transform µ of µ ∈ M(H) as ei x,h µ(dx). ∀h ∈ H : µ (h) :=
(C.5)
H
Proposition C.7. (Fourier characterization) Let µ, ν be finite measures on (H, B(H)). Then ∀h ∈ H :
µ (h) = ν(h)
=⇒
µ=ν
in M(H).
444
C. Schwab and C. J. Gittelson
By (C.1), for all n ∈ N, i x,Pn h µ (Pn h) = e µ(dx) =
Proof.
H
and similarly
ei ξ,h (Pn )# µ(dξ) = (P n )# µ(h), Pn (H)
ν(Pn h) =
e
i x,Pn h
ei ξ,h (Pn )# ν(dξ) = (P n )# ν(h).
ν(dx) =
H
Pn (H)
By assumption, µ (Pn h) = ν(Pn h) for all n ∈ N, hence (P n )# µ = (Pn )# ν, and thus (Pn )# µ = (Pn )# ν by a generalization of Proposition C.4. Then Proposition C.6 implies µ = ν in M(H). Let P(H) ⊂ M(H) be the set of probability measures on (H, B(H)). Let µ ∈ P(H) satisfy
x H µ(dx) < ∞,
x 2H µ(dx) < ∞. H
H
Define
F : H → R,
x, h µ(dx),
F (h) :=
h ∈ H.
H
Then F ∈ H since F (·) is linear and by the Cauchy–Schwarz inequality,
x H µ(dx) h H ∀h ∈ H, |F (h)| ≤ H
so
|F (h)| = sup ≤ 0=h∈H h H
F H
x H µ(dx). H
By the Riesz representation theorem, there is a unique m ∈ H such that x, h µ(dx), ∀h ∈ H; m, h = H
m is called the mean of µ ∈ P(H); we write mean(µ) := m. Consider next the bilinear form G(·, ·) : H × H → R defined by h, x − mk, x − m µ(dx), h, k ∈ H. G(h, k) := H
Then by the Cauchy–Schwarz inequality,
x − m 2H µ(dx) h H k H |G(h, k)| ≤
∀h, k ∈ H.
H
By the Riesz representation theorem, there exists a unique Q ∈ L(H) such that h, x − mk, x − m µ(dx), ∀h, k ∈ H. Qh, k = H
Sparse tensor discretizations for sPDEs
445
The operator Q ∈ L(H) is called the covariance (operator ) of µ ∈ P(H); we write Cov(µ) := Q ∈ L(H). Proposition C.8. Let µ ∈ P(H) such that m = mean(µ) ∈ H and Q = Cov(µ) ∈ L(H) exist. Then Q ∈ L+ 1 (H), i.e., Q is symmetric, positive and of trace class. Proof. Qh, k = h, Qk for all h, k ∈ H by definition. For any orthonormal basis (ek )k of H, |x − m, ek |2 µ(dx). ∀k ∈ N : Qek , ek = H
By monotone convergence and Parseval’s identity, Q ∈ L(H) implies ∞
2 |x − m, ek | µ(dx) =
x − m 2H µ(dx). ∞ > Tr Q = k=1
H
H
We close with a lemma on kth moments of a measure µ on H. Lemma C.9. Let µ ∈ M(H) be a probability measure on (H, B(H)) and let k ∈ N be such that |h, x|k µ(dx) < ∞. ∀h ∈ H : H
Then there exists a constant C(k, µ) such that, for all h1 , . . . , hk ∈ H, |h1 , x · · · hk , x|µ(dx) ≤ C(k, µ) h1 H · · · hk H . H
In particular, the symmetric k-form
H · · ⊗ H (h1 , . . . , hk ) → ⊗ · k times
h1 , x · · · hk , xµ(dx) H
is continuous. Observing that for H (k) = H · · ⊗ H ⊗ ·
we have (H (k) ) H ⊗ · · · ⊗ H ,
k times
k times
by the Riesz representation theorem there exists a unique Mk µ ∈ (H (k) ) , the kth moment of the measure µ, such that, for all h1 ⊗ · · · ⊗ hk ∈ H (k) , k M µ, h ⊗ · · · ⊗ h = h1 , x · · · hk , xµ(dx). 1 k H (k) (H )(k) H
Gaussian measures on separable Hilbert spaces Definition C.10. (Gaussian measure) Let a ∈ H and Q ∈ L+ 1 (H). The Gaussian measure µ := Na,Q
on (H, B(H))
446
C. Schwab and C. J. Gittelson
with mean mean(µ) = a and covariance Cov(µ) = Q is the µ ∈ P(H) with Fourier transform 1 µ (h) = Na,Q (h) = exp ia, h − Qh, h , h ∈ H. 2 Theorem C.11. On any separable Hilbert space H, for any a ∈ H and Q ∈ L+ 1 (H), there is a unique Gaussian measure Na,Q . Proof. Since H is separable and Q ∈ L+ 1 (H), the spectral theorem implies that there is an orthonormal basis (ek )k of H and a sequence (λk )k ⊂ R≥0 such that Qek = λk ek
∀k ∈ N.
For x ∈ H, set xk := x, ek , k ∈ N. Then (xk )k ∈ 2 (N). Note that H∼ = 2 (N) via γ : H → 2 defined by x → γ(x) := (xk )k ∈ 2 (N). Define, on H = 2 (N), the measure µ :=
∞ ' k=1
Nak ,λk ,
x = (x1 , x2 , . . .).
(C.6)
µk
Note that formally, µ is defined on R∞ rather than 2 (N). Proposition C.12.
2 (N) ∈ B(R∞ ), and for µ as in (C.6), µ(2 (N)) = 1.
Proof. We leave the first statement as an exercise. By monotone convergence, "2 ! ∞ ∞
2 2
x 2 (N) µ(dx) = |xk | µ(dx) = |xk |2 Nak ,λk (dxk ) R∞
∞
= =
R k=1 ∞
k=1 ∞
R
k=1
R
(xk − ak ) Nak ,λk (dxk ) + 2
a2k
(λk + a2k ) = Tr Q + a 2 (N) < ∞.
k=1
Therefore, µ({x ∈ R∞ ; x 2 = ∞}) = 0, which implies the second assertion. We next characterize the Fourier transform of Gaussian measures on infinite-dimensional, separable Hilbert spaces.
447
Sparse tensor discretizations for sPDEs
Theorem C.13. For any a ∈ H and Q ∈ L+ 1 (H), there exists a unique µ ∈ P(H) such that 1 ∀h ∈ H. (C.7) µ (h) = exp ia, h − Qh, h 2 Moreover, if H is identified with 2 (N) via the eigenbasis of Q, then µ is the restriction to H of the product measure ∞ '
µk =
k=1
∞ '
Nak ,λk .
k=1
Proof. Since the characteristic function µ of µ uniquely determines µ by Proposition C.7, we must only show existence. The sequence µk := Nak ,λk of Gaussian measure on R, k = 1, 2, . . . admits a unique product measure µ=
∞ '
µk
k=1
on R∞ , and µ ∈ P(R∞ ). By Proposition C.12, µ is concentrated on 2 (N), i.e., µ(2 (N)) = 1. We denote the restriction µ|2 (N) again by µ. Define ∀n ∈ N :
νn :=
n '
µk .
k=1
Then using Proposition C.3, i x,h e µ(dx) = lim 2 (N)
n→∞ 2 (N)
e
i Pn h,Pn x
µ(dx) = lim
n→∞ Rn
1
ei Pn h,ξ νn (dξ)
1
= lim ei Pn h,Pn a− 2 QPn h,Pn h = ei h,a− 2 Qh,h . n→∞
Corollary C.14.
H
x 2H Na,Q (dx) = Tr Q + a 2H .
(C.8)
Gaussian random fields For the mathematical formulation of results on existence and regularity of solutions to stochastic PDEs, we require Bochner spaces of random variables taking values in separable Hilbert and Banach spaces. Definition C.15. (Lebesgue–Bochner spaces) Let (Ω, Σ, P) be a probability space, K a separable Hilbert space, and X : Ω → K a random variable. (i) We say that X is a K-valued Gaussian random variable if the distribution of X is a Gaussian measure on K.
448
C. Schwab and C. J. Gittelson
(ii) For any 0 < p < ∞, denote by Lp (Ω, Σ, P; K) the linear space of all random variables X : Ω → K for which
X(ω) pK P(dω) < ∞, Ω
and by
L∞ (Ω, Σ, P; K)
the space of all X with ess supω X(ω) K < ∞.
(iii) The space Lp (Ω, Σ, P; K) endowed with 1/p p
X(ω) K P(dω)
X Lp (Ω,Σ,P;K) :=
(C.9)
Ω
if p < ∞, and X L∞ (Ω,Σ,P;K) := ess supω X(ω) K , is a quasi-Banach space for 0 < p < 1 and a Banach space if p ≥ 1. (iv) For p = 2, L2 (Ω, Σ, P; K) equipped with the inner product X, Y L2 (Ω,Σ,P;K) := X(ω), Y (ω)K P(dω)
(C.10)
Ω
is a Hilbert space. Example C.16. Let X ∈ L2 (Ω, Σ, P; K). Then X has mean mX ∈ K, mX , hK = y, hK X# P(dy) = X(ω), hK P(dω) ∀h ∈ K, (C.11) K
Ω
and covariance QX ∈ L(K), y − mX , hK y − mX , kK X# P(dy) QX h, kK = K = X(ω) − mX , hK X(ω) − mX , kK P(dω)
(C.12)
Ω
for all h, k ∈ K. We abbreviate mean(X) := mX = mean(X# P) and Cov(X) := Q = Cov(X# P). Proposition C.17. (convergence of Gaussian RV) Let (Xn )n be a sequence of Gaussian random variables in (Ω, Σ, P), taking values in a separable Hilbert space K. Let an := mean Xn ∈ K and Qn := Cov Xn ∈ L+ 1 (K) for all n ∈ N, and assume that Xn → X in L2 (Ω, Σ, P; K) as n → ∞. Then X is a Gaussian random variable with law Na,Q where, for every h, k ∈ K, a, hK = lim an , hK , n→∞
Qh, kK = lim Qn h, kK . n→∞
Proof.
Let a := mean(X) and Q := Cov(X). By dominated convergence, Xn (ω), h P(dω) = Xn (ω), h P(dω) = a, h lim an , h = lim
n→∞
n→∞ Ω
Ω
449
Sparse tensor discretizations for sPDEs
for all h ∈ K, and
lim Qn h, k = lim Xn (ω) − an , hXn (ω) − an , k P(dω) n→∞ Ω = X(ω) − a, hX(ω) − a, k P(ω) = Qh, k
n→∞
Ω
for all h, k ∈ K. To show that X is Gaussian, by Theorem C.13 it suffices to show that the Fourier transform of X# P is the Fourier transform of a Gaussian measure, i.e., 1 ei y,k X# P(dy) = ei a,k− 2 Qk,k ∀k ∈ K. K
This follows from i y,k i X(ω),k e X# P(dy) = e P(dω) = lim ei Xn (ω),k P(dω) K
Ω
= lim e
i an ,k− 12 Qn k,k
n→∞
n→∞ Ω i a,k− 12 Qk,k
=e
.
Hence X is Gaussian, and X# P = Na,Q . It is well known that linear transformations of Gaussian random variables are once again Gaussian. For random fields taking values in function spaces, this covariance takes the following form. Theorem C.18. (affine transformations of Gaussians) Let µ = Na,Q be a Gaussian measure on a separable Hilbert space (H, B(H)). Then (a) For all b ∈ H, T : H → H, T (x) := x + b is Gaussian on (H, B(H)), and (C.13) T# µ = Na+b,Q . (b) If T ∈ L(H, K) for a separable Hilbert space K, T is Gaussian and T# µ = NT a,T QT ∗ . Proof.
By (C.1), for all k ∈ K, ei k,y T# µ(dy) = ei k,T x µ(dx) K H 1 ∗ ∗ ∗ ei T k,x µ(dx) = ei T k,a− 2 T QT k,k . = H
Then Theorem C.13 implies (C.14), and (C.13) follows similarly. Computation of some Gaussian integrals Let H be a separable Hilbert space. We abbreviate L2 (H, Na,Q ) := L2 (H, B(H), Na,Q )
(C.14)
450
C. Schwab and C. J. Gittelson
for any Gaussian measure Na,Q on (H, B(H)). Proposition C.19.
x Na,Q (dx) = a,
(C.15)
H
x − a, yx − a, z Na,Q (dx) = Qy, z H
x − H
a 2H
Na,Q (dx) = Tr Q =
∀y, z ∈ H, ∞
(C.16)
λk .
(C.17)
k=1
Proof. Let (ek )k be an orthonormal basis of H, and Pn x := nk=1 ek , xek . Then x Na,Q (dx) = lim Pn x Na,Q (dx) n→∞ H H ! " n ∞ n (x −a )
)
−1/2 − 2λ x k λ e dx ek = ak ek = a. = lim n→∞
k=1
=1 R
k=1
Equations (C.16) and (C.17) are proved analogously. C.3. Elliptic operator equations with Gaussian data Elliptic operator equations Let X, Y be separable Hilbert spaces and A ∈ L(X, Y ), with associated bilinear form (C.18) a(u, v) = Y Au, vY , u ∈ X, v ∈ Y. Theorem C.20. continuous: coercive: injective:
Assume that the bilinear form a(·, ·) in (C.18) is ∀u ∈ X, v ∈ Y : |a(u, v)| ≤ C1 u X v Y , a(u, v) ≥ C2 > 0, inf sup 0=u∈X 0=v∈Y u X v Y ∀v ∈ Y \ {0} :
sup |a(u, v)| > 0.
(C.19a) (C.19b) (C.19c)
u∈X
Then, for every f ∈ Y , the problem Au = f,
(C.20a)
i.e., u∈X:
a(u, v) = f (v) = Y f, vY
∀v ∈ Y m,
(C.20b)
admits a unique solution u ∈ X, and
u X ≤
f Y . C2
(C.21)
Conversely, A ∈ L(X, Y ) is boundedly invertible if and only if (C.19) holds.
Sparse tensor discretizations for sPDEs
Example C.21. the equation
451
Let D ⊂ Rd be a bounded Lipschitz domain. Consider
Ak2 u := −∇ · A(x)∇u − k 2 u = f in D,
u|∂D = 0,
(C.22)
where A ∈ L∞ (D, Rd×d sym ) is symmetric positive definite, i.e., there is an α > 0 such that, for all ξ ∈ Rd , ess inf ξ A(x)ξ ≥ α ξ 22 .
(C.23)
x∈D
Let 0 < µ1 ≤ µ2 < µ3 < · · · , µn → ∞, denote the eigenvalues of the Dirichlet problem, σ = {µ1 , µ2 , . . .} = (µn )∞ n=1 , and denote by (wn )n the corresponding sequence of eigenfunctions, −∇ · A∇wn = µn wn in D,
wn |∂D = 0.
(C.24)
We assume that (wn )n are normalized in L2 (D); then wm , wn L2 (D) = δmn , Claim C.22.
m, n = 1, 2, . . . .
(C.25)
For every value of k in (C.22) such that
/ σ = {µ1 , µ2 , . . .} (no resonance condition), k2 ∈
(C.26)
the bilinear form ak (u, v) := ∇v, A(x)∇uL2 (D) − k 2 u, vL2 (D) of (C.22) satisfies (C.19) with X = Y = H01 (D) and C2 = min
|k 2 − µ | . µ
Then, for every f ∈ V = H −1 (D), (C.22) has a unique solution u ∈ H01 (D) and 1
f H −1 (D) . (C.27)
u H01 (D) ≤ −1 2 min µ |k − µ | Elliptic operator equations with Gaussian data We consider now the special case X = Y =: V , A ∈ L(V, V ) coercive, i.e., there is a C2 > 0 such that a(v, v) ≥ C2 v 2V
∀v ∈ V.
(C.28)
Then we obtain (C.19c), and the following problem admits a unique solution: given f ∈ V , find u ∈ V such that a(u, v) := V Au, vV = V f, vV
∀v ∈ V.
(C.29)
Theorem C.23. Assume that f ∈ L2 (Ω, Σ, P; V ) is a Gaussian random field such that af = mean(f ) ∈ V and Qf = Cov(f ) ∈ L+ 1 (V ) exist. Then
452
C. Schwab and C. J. Gittelson
the following problem admits a unique solution: find u ∈ L2 (Ω, Σ, P; V ) such that (C.30) Au = f in L2 (Ω, Σ, P; V ). Moreover, au = mean(u) = A−1 af , Qu ∈ Proof.
L+ 1 (V
)
satisfies
and
(C.31)
∗
AQu A = Qf in L(V ).
(C.32)
The weak form of (C.30) is
where
∀v ∈ L2 (Ω, Σ, P; V ),
˜ a ˜(u, v) = (v)
u ∈ L2 (Ω, Σ, P; V ) :
(C.33)
a ˜(u, v) := Ω
V v(ω), Au(ω)V P(dω),
˜ := (v) Ω
V
v(ω), f (ω)V P(dω).
Letting V = L2 (Ω, Σ, P; V ), we infer from (C.28) that ∀v ∈ V :
a ˜(v, v) ≥ C2 u 2V ,
hence (C.33) has a unique solution. Since A−1 ∈ L(V , V) is 1 to 1 and onto, we get that u(ω) = A−1 f (ω)
P-a.s.
By Theorem C.18 with T = A−1 , u is Gaussian on V since u = A−1 f , and its distribution is the Gaussian measure NA−1 af ,A−1 Qf (A−1 )∗ , i.e., it is characterized completely by au = mean(u) = A−1 af Remark C.24.
and
Qu = Cov(u) = A−1 Qf (A−1 )∗ .
For any separable Hilbert space H, by Theorem B.17, L2 (Ω, Σ, P; H) ∼ = L2 (Ω, Σ, P) ⊗H. S
C.4. Covariance kernels and the Karhunen–Lo`eve expansion From Theorem C.23, (C.32), we infer that, given a covariance operator Qf ∈ L + 1 (V ) on the data space V of the boundedly invertible operator A ∈ L(V, V ), we have that if f is Gaussian, then u = A−1 f is Gaussian on V , with mean au satisfying (C.34) Aau = af , and covariance operator Qu given by AQu A∗ = Qf ∈ L(V, V )
resp. Qu = A−1 Qf (A−1 )∗ ∈ L+ 1 (V ).
(C.35)
Sparse tensor discretizations for sPDEs
453
For the computation of u in terms of f , it suffices, by Theorem C.18, to compute au and Qu in terms of af and Qf as in (C.35). As we shall see, this is done most easily by means of covariance kernel representations of Qf and Qu . Let (H1 , ·, ·H1 ) and (H2 , ·, ·H2 ) be separable Hilbert spaces, and let S denote a ‘stochastic’ space of random variables with finite second moments. For example, we have L2 (Ω, Σ, P; Hi ) ∼ = L2 (Ω, Σ, P) ⊗ Hi = S ⊗ Hi ,
i = 1, 2, . . . ,
(C.36)
for S = L2 (Ω, Σ, P). Let (sm )m∈Λ be an orthonormal basis in S, with a countable index set Λ. Then any f ∈ H1 ⊗ S can be uniquely represented as
fm ⊗ sm in S ⊗ H1 , (C.37) f= m∈Λ
with (fm )m ∈ 2 (Λ; H1 ). Proposition C.25.
The mapping
S ⊗ H1 × S ⊗ H2 (f, g) → Cf g :=
fm ⊗ g m ∈ H 1 ⊗ H 2
m∈Λ
is well-defined, bilinear, bounded with norm 1, and independent of the choice of basis (sm )m of the stochastic space S. Definition C.26. (correlation kernel) For f ∈ S ⊗ H1 , g ∈ S ⊗ H2 , we call Cf g ∈ H1 ⊗ H2 defined in Proposition C.25 the correlation kernel of the pair (f, g) in H1 × H2 . If H1 = H2 = H, the set {Cf := Cf g ; f ∈ S ⊗ H} of auto-correlation kernels is in one-to-one correspondence with the class L+ 1 (H) of positive definite trace-class operators. Theorem C.27. If (H, ·, ·H ) and (S, ·, ·S ) are separable Hilbert spaces of equal dimension, and (sm )m∈Λ is an orthonormal basis of S, then the autocorrelation kernels of elements f in S ⊗ H are in one-to-one correspondence with the positive definite trace-class operators on H, via the correspondence
fm ⊗ fm = Cf → Cf : H x → x, fm H fm , (C.38) m∈Λ
m∈Λ
where S⊗H f =
fm ⊗ s m ,
fm ∈ H,
m ∈ Λ.
(C.39)
m∈Λ + the Proof. The operator Cf defined in (C.38) is the L1 (H)-norm limit of ∞ n finite rank operators Cf := m∈Λn x, fm H fm , for some sequence (Λn )n=1
454
C. Schwab and C. J. Gittelson
of subsets Λn ⊂ Λ such that #Λn = n, since
Tr Cf = Cf em , em H = |fm , en H |2 =
fm 2H = f 2S⊗H < ∞, m
m
n
m
for any orthonormal basis (em )m of H. Non-negative definiteness of Cf is obvious. Since (C.40) ∀x, y ∈ H : Cf x, yH = Cf , x ⊗ yH⊗H , the definition (C.38) of Cf is independent of the choice of bases in S and H. Hence the map (C.38) is well-defined. The mapping (C.38) from covariance kernels to covariance operators, i.e., the correspondence Cf → Cf , is injective. To see that Cf → Cf is also surjective, we let C ∈ L+ 1 (H) be given. Then C is compact and has a countable eigensequence (λm , ϕm )m∈N , such that Cϕm = λm ϕm ,
m ∈ N,
ϕm , ϕn H = δmn .
(C.41)
The eigenvalues λm ∈ R have finite multiplicity, and we assume they are ordered decreasingly, i.e., λ1 ≥ λ2 ≥ · · · , and they accumulate only in 0. Then, since C is of trace class,
λm < ∞. (C.42) The series that
√ m
m
λm ϕm ⊗ sm converges, by (C.42), to some f ∈ S ⊗ H such Cf =
λm ϕm ⊗ ϕm in H ⊗ H.
(C.43)
m
(C.40), (C.41) and (C.43) imply that C has the same spectral decomposition as Cf , hence C = Cf . Corollary C.28. Let (H, ·, ·H ) be a separable Hilbert space and let C ∈ H ⊗H be a correlation kernel. Then, with the spectrum (C.8) of its operator C ∈ L+ 1 (H) defined as in (C.40), the corresponding covariance kernel C can be represented as
λm ϕm ⊗ ϕm in H ⊗ H. (C.44) C= m
Theorem C.29. Let (H, ·, ·H ) and (S, ·, ·S ) be separable Hilbert spaces, and let C ∈ H ⊗ H be a correlation kernel with representation (C.44). Then f ∈ S ⊗ H satisfies Cf = C in H ⊗ H if and only if there exists an S-orthonormal family (Xm )m ⊂ S such that
( λm Xm ⊗ ϕm in S ⊗ H. (C.45) f= m
Sparse tensor discretizations for sPDEs
455
Proof. The ‘if’ part follows as in the proof of Theorem C.27, upon completion of the family (Xm )m ⊂ S to an orthonormal basis of S. Conversely, if Cf = C, then we may write
f= Ym ⊗ ϕm in S ⊗ H, m
with (Ym )m ⊂ S, which implies with Proposition C.25 that
Cf = Ym , Ym S ϕm ⊗ ϕm . m,m
Comparing this with (C.44), we find (since (ϕm )m is an orthonormal basis of H) that Ym , Ym S = λm δmm , −1/2
This is (C.44) with Xm := λm
m, m ∈ N.
Ym .
Definition C.30. The expansion (C.45) of f ∈ S ⊗ H in terms of the spectral decomposition of its covariance operator Cf is called Karhunen– Lo`eve expansion of f . Theorem C.31. Let X, Y be separable Hilbert spaces. Let A ∈ L(X, Y ) be boundedly invertible (see Theorem C.20), and let f ∈ L2 (Ω, Σ, P; Y ) ∼ = L2 (Ω, Σ, P) ⊗ Y be a given Gaussian random field on Y , with mean(f ) = af ∈ Y ,
Qf = Cov(f ) ∈ L+ 1 (Y ).
(C.46)
Then u = A−1 f ∈ L2 (Ω, Σ, P; X) is also Gaussian on X, with mean(u) = au ∈ X,
Qu = Cov(u) ∈ L+ 1 (X),
(C.47)
satisfying Aau = af in Y ,
(C.48)
and AQu A∗ = Qf in L+ 1 (Y ),
Qu = A−1 Qf (A−1 )∗ ∈ L+ 1 (X).
(C.49)
The kernels Cu of Qu , resp. Cf of Qf , satisfy the equation (A ⊗ A)Cu = Cf in Y ⊗ Y ∼ = (Y ⊗ Y ) .
(C.50)
C.5. The white noise map Let H be a separable Hilbert space, dim H = ∞, and µ = NQ a nondegenerate centred Gaussian measure on H (i.e., ker Q = {0} ⊂ H); furthermore, let (ek )k be an orthonormal basis of H such that Qek = λk ek , k ∈ N. For x ∈ H, set xk := x, ek . Then, for all k, Q−1 ek = λ−1 k ek ,
456
C. Schwab and C. J. Gittelson
hence Qx0 ∈ H ⊥ , so Qx0 ∈ L(H) is not boundedly invertible (since λk → 0 as k → ∞ due to Tr Q < ∞). The range Q(H) of Q does not equal H, Q(H) = H. Lemma C.32. Proof.
Q(H) is a dense subspace of H.
Let x0 ∈ Q(H)⊥ ⊂ H. Then, since Q is self-adjoint, ∀x ∈ H :
0 = x0 , QxH = Qx0 , xH ,
hence Qx0 = 0. But ker Q = {0}, so x0 = 0. Define the operator Q1/2 by Q1/2 x :=
∞ (
λk x, ek H ,
x ∈ H.
(C.51)
k=1
Its range Q1/2 (H) is the reproducing kernel Hilbert space or the Cameron– Martin space of the measure µ = NQ in H. It is a dense subspace of H, and H = Q1/2 (H). We introduce an isometry W : H → L2 (H, NQ ), the white noise map. Let Q1/2 (H) f → Wf ∈ L2 (H, NQ ) be given by Wf (x) = Q−1/2 f, xH We have
∀x ∈ H.
(C.52)
Wf (x)Wg (x) NQ (dx) = f, gH
∀f, g ∈ H.
(C.53)
H
This map W : Q1/2 (H) → L2 (H, NQ ) is a densely defined isometry which can be extended to all of H. Lemma C.33. For any f ∈ H, Wf is a real Gaussian random variable with mean zero and variance f 2H . Proof.
Define νf := (Wf )# µ. We must show 1 2 2 iξη e νf (dξ) = eiηWf (x) µ(dx) = e− 2 η f H . ∀η ∈ R νf (η) = R
H
To this end, let (zn )n ⊂ Q1/2 (H) be a sequence such that zn → z ∈ H. By dominated convergence, −1/2 z ,x n eiηWz (x) µ(dx) = lim eiη Q µ(dx) H
= We pick z = f to conclude.
n→∞ H 1 2 2 lim e− 2 η zn H n→∞
1
= e− 2 η
2 z 2 H
.
457
Sparse tensor discretizations for sPDEs
Given z ∈ H \ Q1/2 (H), one could try to define Wz by
Remark C.34.
∀x ∈ Q1/2 (H) :
Wz (x) = Q−1/2 x, zH ,
rather than by (C.52). This is meaningless due to µ(Q1/2 (H)) = 0. Lemma C.35.
µ(Q1/2 (H)) = 0.
For all n, k ∈ N, set ∞
2 2 λ−1 , Un := y ∈ H ; Y < n
Proof.
Un,k :=
y∈H;
=1
2k
2 2 λ−1 , Y < n
=1
as n → ∞, and, for every fixed n ∈ N, Un,k ↓ Un as Then Un ↑ k → ∞. Hence we are done, if Q1/2 (H),
∀n :
µ(Un ) = lim µ(Un,k ) = 0.
(C.54)
k→∞
−1/2
To see (C.54), we use that for all n, k ∈ N, for z := λ
2k '
µ(Un,k ) =
Un,k =1
Y ,
Nλk (dyk ) =
{z∈R2k ; |z|
NIR2k (dx).
We compute n − r2 2k−1 n2 /2 − k−1 2 r e dr e d µ(Un,k ) . = 0 = 0 ∞ − k−1 µ(Un,k ) = r2 ∞ µ(H) d 0 e e− 2 r2k−1 dr 0
Hence, µ(Unk ) =
1 (k − 1)!
n2 /2
e− k−1 d ≤
0
1 (k − 1)!
n2 /2
k−1 d =
0
1 n2 k , k! 2
whence (C.54). Proposition C.36. (properties of the white noise map) (a) For any n ∈ N, z1 , . . . , zn ∈ H, the law of (Wz1 , . . . , Wzn ) ∈ Rn is given by N( zi ,zj H )ni,j=1 . (b) Wz1 , . . . Wzn are independent if and only if z1 , . . . zn are H-orthogonal. (c) For all f ∈ H,
1
2
eWf (x) µ(dx) = e 2 f H
(C.55)
H
and
1
eiλWf (x) µ(dx) = e− 2 λ H
2 f 2 H
.
(C.56)
458
C. Schwab and C. J. Gittelson
(d) The exponential map H → L2 (H, NQ ), f → eWf is continuous, and W (x) 2 2W e f − eWg (x) NQ (dx) = e f − 2eWf +g + e2Wg NQ (dx) H 2 f 2H
1 f +g 2H 2
H 2 g 2H
− 2e +e =e f 2 1 2 2 2 2 g = e H − e H + 2e f H + g H 1 − e− 2 f −g H . Proposition C.37. given Q ∈ L+ 1 (H),
Assume that M ∈ L(H) is symmetric such that, for
Q1/2 M Q1/2 ≤ 1 ( ⇐⇒ ∀x ∈ H : Q1/2 M Q1/2 x, xH ≤ X 2H ), and let b ∈ H be arbitrary. Then 1 exp M y, y + b, y NQ (dy) (C.57) 2 H 1 1/2 1/2 −1/2 1/2 1/2 −1/2 1/2 2 exp |(1 − Q M Q ) Q b| . = det(1 − Q M Q ) 2 C.6. Absolute continuity of Gaussian measures Let H be a separable Hilbert space, dim H = ∞, µ = NQ a non-degenerate centred Gaussian measure on H with covariance operator Q ∈ L+ 1 (H), ker Q = {0}, (ek )k orthonormal basis of H with Qek = λk ek , k = 1, 2, . . . (see Theorem B.23). Given a ∈ H, when are the two Gaussian measures NQ and Na,Q singular, resp. equivalent? Recall that two measures µ, ν on (Ω, Σ) are equivalent if µ ) ν and ν ) µ. Here, µ ) ν (‘µ is absolutely continuous with respect to ν’) if, for all A ∈ Σ with ν(A) = 0, also µ(A) = 0. If µ ) ν, the Radon–Nikodym theorem implies that there exists a unique ∈ L1 (Ω, Σ, ν) such that dν. ∀A ∈ Σ : µ(A) = A
Assume for the moment dim H < ∞. Then ker Q = {0} ⊂ H implies det Q > 0. Hence, for all a ∈ H, NQ ∼ Na,Q and for all x ∈ H, 1
−1
1 dNa,Q e− 2 Q (x−a),x−aH −1/2 a 2 + Q−1/2 a,Q−1/2 x H H (x) = = e− 2 Q . (C.58) 1 −1 x,x −
Q H dNQ e 2 We claim:
(1) if a ∈ Q1/2 (H), then Na,Q ∼ NQ , (2) if a ∈ H ∩ Q1/2 (H)⊥ , then Na,Q ⊥ NQ .
Sparse tensor discretizations for sPDEs
459
In the first case, (C.58) still holds if dim H = ∞, but Q−1/2 a, Q−1/2 xH is replaced by WQ−1/2 a (x). Hellinger integral Let µ and ν be probability measures on (Ω, Σ). Then both µ and ν are absolutely continuous with respect to the probability measure ζ = (µ + ν)/2 on (Ω, Σ). Definition C.38. (Hellinger integral) The Hellinger integral of µ, ν is defined by 2 dµ dν ζ(dω). (C.59) H(µ, ν) := dζ dζ Ω Obviously, 0 ≤ H(µ, ν) ≤ 1. By H¨ older’s inequality, we have 1/2 1/2 dµ dν dζ dζ = 1. 0 ≤ H(µ, ν) ≤ Ω dζ Ω dζ Remark C.39. If λ is a probability measure on (Ω, Σ) such that µ ) λ and ν ) λ, then also ζ ) λ and dµ dλ dµ = dζ dλ dζ and we find
dν dν dλ = , dζ dλ dζ
∧ 0
H(µ, ν) = Ω
Remark C.40.
dµ dν dλ. dλ dλ
Assume µ ∼ ν. Then dν dµ dν dµ dµ = = = dζ dζ dζ dµ dζ
and hence
2 H(µ, ν) = Ω
Example C.41.
dν dµ dζ = dµ dζ
dµ dζ
2
2 Ω
dν dµ
dν dµ. dµ
Let Ω = R, µ = Nλ , ν = Na,λ , a ∈ R, and λ > 0. Then a2 ax dν (x) = e− 2λ + λ , dµ
and hence 2
H(µ, ν) = e
− a2λ
Proposition C.42.
a2
e 2λ Nλ (dx) = e− 8λ . ax
R
x ∈ R,
If H(µ, ν) = 0, the µ and ν are singular.
460
Proof.
C. Schwab and C. J. Gittelson
Let f=
dµ , dζ
g=
dν , dζ
ζ=
1 (µ + ν). 2
Then f g = 0 ζ-a.e., since
( H(µ, ν) = f g dζ = 0. Ω
Define the sets A = {ω ∈ Ω ; f (ω) = 0}, B = {ω ∈ Ω ; g(ω) = 0}, C = {ω ∈ Ω ; (f g)(ω) = 0}. Then ζ(C) = 1, hence µ(C) = ν(C) = 1. Moreover, µ(A) = A f dζ = 0 and ν(B) = B g dζ = 0. Therefore, µ(B \ A) = 1 and ν(A \ B) = 1, i.e., µ and ν are mutually singular. Kakutani’s theorem If H(µ, ν) = 0, µ and ν are mutually singular. Conversely, if H(µ, ν) > 0, then µ and ν are not necessarily equivalent, in general, unless µ, ν are countable products of equivalent ‘factor measures’. This is Kakutani’s theorem. We prepare its exposition with products of two measures. Lemma C.43. Then
Let µi , νi , i = 1, 2, be probability measures on (Ω, Σ). H(µ1 ⊗ µ2 , ν1 ⊗ ν2 ) = H(µ1 , ν1 )H(µ2 , ν2 ).
Proof.
Let ζ1 , ζ2 be probability measures on (Ω, Σ) such that µ1 ) ζ1 ,
ν 1 ) ζ1 ,
µ2 ) ζ2 ,
ν 2 ) ζ2 .
Then, by Fubini’s theorem, µ1 ⊗ µ2 ) ζ1 ⊗ ζ2
∧
ν 1 ⊗ ν 2 ) ζ1 ⊗ ζ 2 .
Define fi (ωi ) :=
dµi (ωi ), dζi
gi (ωi ) :=
dνi (ωi ), dζi
i = 1, 2.
Then d(µ1 ⊗ µ2 ) = f1 (ω1 )f2 (ω2 ), d(ζ1 ⊗ ζ2 ) Hence
H(µ1 ⊗ µ2 , ν1 ⊗ ν2 ) =
d(ν1 ⊗ ν2 ) = g1 (ω1 )g2 (ω2 ). d(ζ1 ⊗ ζ2 )
(f1 , g1 )(ω1 )(f2 , g2 )(ω2 )
Ω×Ω
= H(µ1 , ν1 )H(µ2 , ν2 ).
1/2
ζ1 (dω1 )ζ2 (dω2 )
Sparse tensor discretizations for sPDEs
461
Kakutani’s theorem is an infinite-dimensional generalization of the previous result. Theorem C.44. (Kakutani) Let (µk )k , (νk )k be sequences of probability measures on (R, Σ), such that µk ∼ νk for all k ∈ N, and define µ :=
∞ '
µk ,
ν :=
k=1
∞ '
νk .
k=1
If H(µ, ν) > 0, then µ ∼ ν and ) dνk dν (x) = lim (xk ) n→∞ dµ dµk n
in L1 (R∞ , µ).
(C.60)
k=1
If H(µ, ν) = 0, then µ and ν are singular. We refer to Kakutani (1948) and Da Prato (2006) for a proof of Theorem C.44.
REFERENCES ˇ I. Babuˇska (1961), ‘On randomised solutions of Laplace’s equation’, Casopis Pˇest. Mat. 86, 269–276. I. Babuˇska (1970/71), ‘Error-bounds for finite element method’, Numer. Math. 16, 322–333. I. Babuˇska, F. Nobile and R. Tempone (2005), ‘Worst case scenario analysis for elliptic problems with uncertainty’, Numer. Math. 101, 185–219. I. Babuˇska, F. Nobile and R. Tempone (2007a), ‘Reliability of computational science’, Numer. Methods Partial Differential Equations 23, 753–784. I. Babuˇska, F. Nobile and R. Tempone (2007b), ‘A stochastic collocation method for elliptic partial differential equations with random input data’, SIAM J. Numer. Anal. 45, 1005–1034. A. Barth (2010), ‘A finite element method for martingale-driven stochastic partial differential equations’, Comm. Stoch. Anal. 4, 355–375. A. Barth and A. Lang (2009), Almost sure convergence of a Galerkin–Milstein approximation for stochastic partial differential equations. In review. A. Barth, C. Schwab and N. Zollinger (2010), Multi-level Monte Carlo finite element method for elliptic PDEs with stochastic coefficients. Technical Report 201018, Seminar for Applied Mathematics, ETH Z¨ urich. To appear in Numer. Math. H. Bauer (1996), Probability Theory, Vol. 23 of De Gruyter Studies in Mathematics, Walter de Gruyter. Translation by R. B. Burckel. H. Bauer (2001), Measure and Integration Theory, Vol. 26 of De Gruyter Studies in Mathematics, Walter de Gruyter. Translation by R. B. Burckel. R. Beatson and L. Greengard (1997), A short course on fast multipole methods, in Wavelets, Multilevel Methods and Elliptic PDEs (Leicester 1996), Numerical Mathematics and Scientific Computation, Oxford University Press, pp. 1–37.
462
C. Schwab and C. J. Gittelson
M. Bebendorf and W. Hackbusch (2003), ‘Existence of H-matrix approximants to the inverse FE-matrix of elliptic operators with L∞ -coefficients’, Numer. Math. 95, 1–28. M. Bieri (2009a), A sparse composite collocation finite element method for elliptic sPDEs. Technical Report 2009-8, Seminar for Applied Mathematics, ETH Z¨ urich. To appear in SIAM J. Numer. Anal. M. Bieri (2009b), Sparse tensor discretization of elliptic PDEs with random input data. PhD thesis, ETH Z¨ urich. ETH Dissertation no. 18598. M. Bieri, R. Andreev and C. Schwab (2009), ‘Sparse tensor discretization of elliptic SPDEs’, SIAM J. Sci. Comput. 31, 4281–4304. V. I. Bogachev (1998), Gaussian Measures, Vol. 62 of Mathematical Surveys and Monographs, AMS, Providence, RI. V. I. Bogachev (2007), Measure Theory, Vols I and II, Springer. D. Braess (2007), Finite Elements: Theory, Fast Solvers, and Applications in Elasticity Theory, third edition, Cambridge University Press. Translation by L. L. Schumaker. S. C. Brenner and L. R. Scott (2002), The Mathematical Theory of Finite Element Methods, Vol. 15 of Texts in Applied Mathematics, second edition, Springer. H.-J. Bungartz and M. Griebel (2004), Sparse grids. In Acta Numerica, Vol. 13, Cambridge University Press, pp. 147–269. R. H. Cameron and W. T. Martin (1947), ‘The orthogonal development of nonlinear functionals in series of Fourier–Hermite functionals’, Ann. of Math. (2) 48, 385–392. E. R. Canfield, P. Erd˝ os and C. Pomerance (1983), ‘On a problem of Oppenheim concerning “factorisatio numerorum”’, J. Number Theory 17, 1–28. J. Charrier (2010), Strong and weak error estimates for the solutions of elliptic partial differential equations with random coefficients. Technical Report 7300, INRIA. A. Chernov and C. Schwab (2009), ‘Sparse p-version BEM for first kind boundary integral equations with random loading’, Appl. Numer. Math. 59, 2698–2712. O. Christensen (2008), Frames and Bases: An Introductory Course, Applied and Numerical Harmonic Analysis, Birkh¨ auser. O. Christensen (2010), Functions, Spaces, and Expansions: Mathematical Tools in Physics and Engineering, Applied and Numerical Harmonic Analysis, Birkh¨ auser. P. G. Ciarlet (1978), The Finite Element Method for Elliptic Problems, Vol. 4 of Studies in Mathematics and its Applications, North-Holland. A. Cohen (2003), Numerical Analysis of Wavelet Methods, Vol. 32 of Studies in Mathematics and its Applications, North-Holland. A. Cohen, R. A. DeVore and C. Schwab (2010), Convergence rates of best N -term Galerkin approximations for a class of elliptic sPDEs. J. Found. Comput. Math. 10, 615–646. A. Cohen, R. A. DeVore and C. Schwab (2011), Analytic regularity and polynomial approximation of parametric stochastic elliptic PDEs. Anal. Appl. 9, 1–37. G. Da Prato (2006), An Introduction to Infinite-Dimensional Analysis, revised and extended edition, Universitext, Springer.
Sparse tensor discretizations for sPDEs
463
G. Da Prato and J. Zabczyk (1992), Stochastic Equations in Infinite Dimensions, Vol. 44 of Encyclopedia of Mathematics and its Applications, Cambridge University Press. W. Dahmen (1997), Wavelet and multiscale methods for operator equations. In Acta Numerica, Vol. 6, Cambridge University Press, pp. 55–228. W. Dahmen, H. Harbrecht and R. Schneider (2006), ‘Compression techniques for boundary integral equations: Asymptotically optimal complexity estimates’, SIAM J. Numer. Anal. 43, 2251–2271. R. Dalang, D. Khoshnevisan, C. Mueller, D. Nualart and Y. Xiao (2009), A Minicourse on Stochastic Partial Differential Equations (Salt Lake City 2006; D. Khoshnevisan and F. Rassoul-Agha, eds), Vol. 1962 of Lecture Notes in Mathematics, Springer. M. Dettinger and J. L. Wilson (1981), ‘First order analysis of uncertainty in numerical models of groundwater flow 1: Mathematical development’, Water Res. Res. 17, 149–161. R. A. DeVore (1998), Nonlinear approximation. In Acta Numerica, Vol. 7, Cambridge University Press, pp. 51–150. G. C. Donovan, J. S. Geronimo and D. P. Hardin (1996), ‘Intertwining multiresolution analyses and the construction of piecewise-polynomial wavelets’, SIAM J. Math. Anal. 27, 1791–1815. S. C. Eisenstat, H. C. Elman and M. H. Schultz (1983), ‘Variational iterative methods for nonsymmetric systems of linear equations’, SIAM J. Numer. Anal. 20, 345–357. O. G. Ernst, A. Mugler, H.-J. Starkloff and E. Ullmann (2010), On the convergence of generalized polynomial chaos expansions. Technical Report 60, DFG Schwerpunktprogramm 1324. G. S. Fishman (1996), Monte Carlo: Concepts, Algorithms, and Applications, Springer Series in Operations Research, Springer. J. Galvis and M. Sarkis (2009), ‘Approximating infinity-dimensional stochastic Darcy’s equations without uniform ellipticity’, SIAM J. Numer. Anal. 47, 3624–3651. W. Gautschi (2004), Orthogonal Polynomials: Computation and Approximation, Numerical Mathematics and Scientific Computation, Oxford Science Publications, Oxford University Press. M. Geissert, M. Kov´ acs and S. Larsson (2009), ‘Rate of weak convergence of the finite element method for the stochastic heat equation with additive noise’, BIT 49, 343–356. R. G. Ghanem and P. D. Spanos (2007), Stochastic Finite Elements: A Spectral Approach, second edition, Dover, C. J. Gittelson (2010a), ‘Stochastic Galerkin discretization of the log-normal isotropic diffusion problem’, Math. Models Methods Appl. Sci. 20, 237–263. C. J. Gittelson (2010b), Representation of Gaussian fields in series with independent coefficients. Technical Report 2010-15, Seminar for Applied Mathematics, ETH Z¨ urich. Submitted. C. J. Gittelson (2011a) Adaptive Galerkin methods for parametric and stochastic operator equations. ETH Dissertation No. 19533, ETH Z¨ urich.
464
C. Schwab and C. J. Gittelson
C. J. Gittelson (2011b) Stochastic Galerkin approximation of operator equations with infinite dimensional noise. Technical Report 2011-10, Seminar for Applied Mathematics, ETH Z¨ urich. C. J. Gittelson (2011c) An adaptive stochastic Galerkin method. Technical Report 2011-11, Seminar for Applied Mathematics, ETH Z¨ urich. C. J. Gittelson (2011d) Adaptive stochastic Galerkin methods: Beyond the elliptic case. Technical Report 2011-12, Seminar for Applied Mathematics, ETH Z¨ urich. I. G. Graham, F. Y. Kuo, D. Nuyens, R. Scheichl and I. H. Sloan (2010), QuasiMonte Carlo methods for computing flow in random porous media. Technical Report 4/10, Bath Institute for Complex Systems. M. Griebel, P. Oswald and T. Schiekofer (1999), ‘Sparse grids for boundary integral equations’, Numer. Math. 83, 279–312. A. Grothendieck (1955), ‘Produits tensoriels topologiques et espaces nucl´eaires’, Mem. Amer. Math. Soc. 16, 140. H. Harbrecht (2001), Wavelet Galerkin schemes for the boundary element method in three dimensions. PhD thesis, Technische Universit¨ at Chemnitz. H. Harbrecht, R. Schneider and C. Schwab (2008), ‘Sparse second moment analysis for elliptic problems in stochastic domains’, Numer. Math. 109, 385–414. M. Herv´e (1989), Analyticity in Infinite-Dimensional Spaces, Vol. 10 of De Gruyter Studies in Mathematics, Walter de Gruyter. S. Hildebrandt and E. Wienholtz (1964), ‘Constructive proofs of representation theorems in separable Hilbert space’, Comm. Pure Appl. Math. 17, 369–373. V. H. Hoang and C. Schwab (2004/05), ‘High-dimensional finite elements for elliptic problems with multiple scales’, Multiscale Model. Simul. 3, 168–194. V.-H. Hoang and C. Schwab (2010a), Analytic regularity and gpc approximation for parametric and random 2nd order hyperbolic PDEs. Technical Report 2010-19, Seminar for Applied Mathematics, ETH Z¨ urich. To appear in Anal. Appl. V.-H. Hoang and C. Schwab (2010b), Sparse tensor Galerkin discretization for parametric and random parabolic PDEs I: Analytic regularity and gpcapproximation. Technical Report 2010-11, Seminar for Applied Mathematics, ETH Z¨ urich. Submitted. H. Holden, B. Oksendal, J. Uboe and T. Zhang (1996), Stochastic Partial Differential Equations: A Modeling, White Noise Functional Approach, Probability and its Applications, Birkh¨ auser. G. C. Hsiao and W. L. Wendland (1977), ‘A finite element method for some integral equations of the first kind’, J. Math. Anal. Appl. 58, 449–481. S. Janson (1997), Gaussian Hilbert spaces, Vol. 129 of Cambridge Tracts in Mathematics, Cambridge University Press. R. V. Kadison and J. R. Ringrose (1997), Fundamentals of the Theory of Operator Algebras I: Elementary Theory, Vol. 15 of Graduate Studies in Mathematics, AMS, Providence, RI. S. Kakutani (1948), ‘On equivalence of infinite product measures’, Ann. of Math. (2) 49, 214–224. N. Kalton (2003), Quasi-Banach spaces. In Handbook of the Geometry of Banach Spaces, Vol. 2, North-Holland, pp. 1099–1130.
Sparse tensor discretizations for sPDEs
465
B. N. Khoromskij and C. Schwab (2011), ‘Tensor-structured Galerkin approximation of parametric and stochastic elliptic PDEs’, SIAM J. Sci. Comput. 33, 364–385. M. Kov´ acs, S. Larsson and F. Lindgren (2010a), ‘Strong convergence of the finite element method with truncated noise for semilinear parabolic stochastic equations with additive noise’, Numer. Algorithms 53, 309–320. M. Kov´ acs, S. Larsson and F. Saedpanah (2010b), ‘Finite element approximation of the linear stochastic wave equation with additive noise’, SIAM J. Numer. Anal. 48, 408–427. D. Kressner and C. Tobler (2010), Low-rank tensor Krylov subspace methods for parametrized linear systems. Technical Report 2010-16, Seminar for Applied Mathematics, ETH Z¨ urich. Submitted. M. Ledoux and M. Talagrand (1991), Probability in Banach Spaces: Isoperimetry and Processes, Vol. 23 of Ergebnisse der Mathematik und ihrer Grenzgebiete (3), Springer. W. A. Light and E. W. Cheney (1985), Approximation Theory in Tensor Product Spaces, Vol. 1169 of Lecture Notes in Mathematics, Springer. S. Lototsky and B. Rozovskii (2006), Stochastic differential equations: A Wiener chaos approach. In From Stochastic Calculus to Mathematical Finance, Springer, pp. 433–506. W. McLean (2000), Strongly Elliptic Systems and Boundary Integral Equations, Cambridge University Press. H. G. Matthies and A. Keese (2005), ‘Galerkin methods for linear and nonlinear elliptic stochastic partial differential equations’, Comput. Methods Appl. Mech. Engrg 194, 1295–1331. S. Mishra and C. Schwab (2010), Sparse tensor multi-level Monte Carlo finite volume methods for hyperbolic conservation laws with random intitial data. Technical Report 2010-24, Seminar for Applied Mathematics, ETH Z¨ urich. Submitted. J.-C. N´ed´elec and J. Planchard (1973), ‘Une m´ethode variationnelle d’´el´ements finis pour la r´esolution num´erique d’un probl`eme ext´erieur dans R3 ’, Rev. Fran¸caise Autom. Inform. Recherche Op´erationnelle S´er. Rouge 7, 105–129. H. Nguyen and R. Stevenson (2009), ‘Finite element wavelets with improved quantitative properties’, J. Comput. Appl. Math. 230, 706–727. F. Nobile and R. Tempone (2009), ‘Analysis and implementation issues for the numerical approximation of parabolic equations with random coefficients’, Internat. J. Numer. Methods Engrg 80, 979–1006. F. Nobile, R. Tempone and C. G. Webster (2008a), ‘An anisotropic sparse grid stochastic collocation method for partial differential equations with random input data’, SIAM J. Numer. Anal. 46, 2411–2442. F. Nobile, R. Tempone and C. G. Webster (2008b), ‘A sparse grid stochastic collocation method for partial differential equations with random input data’, SIAM J. Numer. Anal. 46, 2309–2345. J. T. Oden, I. Babuˇska, F. Nobile, Y. Feng and R. Tempone (2005), ‘Theory and methodology for estimation and control of errors due to modeling, approximation, and uncertainty’, Comput. Methods Appl. Mech. Engrg 194, 195–204.
466
C. Schwab and C. J. Gittelson
A. Oppenheim (1927), ‘On an arithmetic function’, J. London Math. Soc. s12, 123–130. S. Peszat and J. Zabczyk (2007), Stochastic Partial Differential Equations with L´evy Noise: An Evolution Equation Approach, Vol. 113 of Encyclopedia of Mathematics and its Applications, Cambridge University Press. T. von Petersdorff and C. Schwab (1996), ‘Wavelet approximations for first kind boundary integral equations on polygons’, Numer. Math. 74, 479–516. T. von Petersdorff and C. Schwab (2004), ‘Numerical solution of parabolic equations in high dimensions’, M2AN Math. Model. Numer. Anal. 38, 93–127. T. von Petersdorff and C. Schwab (2006), ‘Sparse finite element methods for operator equations with stochastic data’, Appl. Math. 51, 145–180. C. Pr´evˆ ot and M. R¨ockner (2007), A Concise Course on Stochastic Partial Differential Equations, Vol. 1905 of Lecture Notes in Mathematics, Springer. P. E. Protter (2005), Stochastic Integration and Differential Equations, Vol. 21 of Stochastic Modelling and Applied Probability, second edition, version 2.1, Springer. M. Reed and B. Simon (1980), Functional Analysis, Vol. 1 of Methods of Modern Mathematical Physics, second edition, Academic Press (Harcourt Brace Jovanovich). R. A. Ryan (2002), Introduction to Tensor Products of Banach Spaces, Springer Monographs in Mathematics, Springer. S. Sauter and C. Schwab (2010), Boundary Element Methods, Springer. R. Schatten (1943), ‘On the direct product of Banach spaces’, Trans. Amer. Math. Soc. 53, 195–217. G. Schmidlin, C. Lage and C. Schwab (2003), ‘Rapid solution of first kind boundary integral equations in R3 ’, Engrg Anal. Boundary Elem. (special issue on solving large scale problems using BEM) 27, 469–490. R. Schneider (1998), Multiskalen- und Wavelet-Matrixkompression, Advances in Numerical Mathematics, Teubner. Analysisbasierte Methoden zur effizienten L¨osung großer vollbesetzter Gleichungssysteme. [Analysis-based methods for the efficient solution of large nonsparse systems of equations]. W. Schoutens (2000), Stochastic Processes and Orthogonal Polynomials, Vol. 146 of Lecture Notes in Statistics, Springer. C. Schwab (2002), High dimensional finite elements for elliptic problems with multiple scales and stochastic data, in Proc. International Congress of Mathematicians, Vol. III (Beijing 2002), Higher Education Press, Beijing, pp. 727–734. C. Schwab and R. Stevenson (2008), ‘Adaptive wavelet algorithms for elliptic PDEs on product domains’, Math. Comp. 77, 71–92. C. Schwab and R. Stevenson (2009), ‘Space–time adaptive wavelet methods for parabolic evolution problems’, Math. Comp. 78, 1293–1318. C. Schwab and A. M. Stuart (2011), Sparse deterministic approximation of Bayesian inverse problems. Technical Report 2011-16, Seminar for Applied Mathematics, ETH Z¨ urich. C. Schwab and R. A. Todor (2003a), ‘Sparse finite elements for elliptic problems with stochastic loading’, Numer. Math. 95, 707–734. C. Schwab and R. A. Todor (2003b), ‘Sparse finite elements for stochastic elliptic problems: Higher order moments’, Computing 71, 43–63.
Sparse tensor discretizations for sPDEs
467
S. Smolyak (1963), ‘Quadrature and interpolation formulas for tensor products of certain classes of functions’, Sov. Math. Dokl. 4, 240–243. V. Strassen (1964), ‘An invariance principle for the law of the iterated logarithm’, Z. Wahrscheinlichkeitstheorie und Verw. Gebiete 3, 211–226 (1964). G. Szeg˝ o (1975), Orthogonal Polynomials, fourth edition, Colloquium Publications, Vol. XXIII, AMS, Providence, RI. ¨ G. Szekeres and P. Tur´ an (1933), ‘Uber das zweite Hauptproblem der “factorisatio numerorum”’, Acta Litt. Sci. Szeged 6, 143–154. V. N. Temlyakov (1993), Approximation of Periodic Functions, Computational Mathematics and Analysis Series, Nova Science Publishers, Commack, NY. R.-A. Todor (2009), ‘A new approach to energy-based sparse finite-element spaces’, IMA J. Numer. Anal. 29, 72–85. R. A. Todor and C. Schwab (2007), ‘Convergence rates for sparse chaos approximations of elliptic problems with stochastic coefficients’, IMA J. Numer. Anal. 27, 232–261. N. N. Vakhania, V. I. Tarieladze and S. A. Chobanyan (1987), Probability Distributions on Banach Spaces, Vol. 14 of Mathematics and its Applications (Soviet Series), Reidel. Translation by W. A. Woyczynski. G. W. Wasilkowski and H. Wo´zniakowski (1995), ‘Explicit cost bounds of algorithms for multivariate tensor product problems’, J. Complexity 11, 1–56. N. Wiener (1938), ‘The homogeneous chaos’, Amer. J. Math. 60, 897–936. D. Xiu (2009), ‘Fast numerical methods for stochastic computations: A review’, Commun. Comput. Phys. 5, 242–272. D. Xiu and J. S. Hesthaven (2005), ‘High-order collocation methods for differential equations with random inputs’, SIAM J. Sci. Comput. 27, 1118–1139. D. Xiu and G. E. Karniadakis (2002a), ‘Modeling uncertainty in steady state diffusion problems via generalized polynomial chaos’, Comput. Methods Appl. Mech. Engrg 191, 4927–4948. D. Xiu and G. E. Karniadakis (2002b), ‘The Wiener–Askey polynomial chaos for stochastic differential equations’, SIAM J. Sci. Comput. 24, 619–644.
Acta Numerica (2011), pp. 469–567 doi:10.1017/S0962492911000067
c Cambridge University Press, 2011 Printed in the United Kingdom
Numerical algebraic geometry and algebraic kinematics Charles W. Wampler∗ General Motors Research and Development, Mail Code 480-106-359, 30500 Mound Road, Warren, MI 48090-9055, USA E-mail: [email protected] URL: www.nd.edu/˜cwample1
Andrew J. Sommese† Department of Mathematics, University of Notre Dame, Notre Dame, IN 46556-4618, USA E-mail: [email protected] URL: www.nd.edu/˜sommese
In this article, the basic constructs of algebraic kinematics (links, joints, and mechanism spaces) are introduced. This provides a common schema for many kinds of problems that are of interest in kinematic studies. Once the problems are cast in this algebraic framework, they can be attacked by tools from algebraic geometry. In particular, we review the techniques of numerical algebraic geometry, which are primarily based on homotopy methods. We include a review of the main developments of recent years and outline some of the frontiers where further research is occurring. While numerical algebraic geometry applies broadly to any system of polynomial equations, algebraic kinematics provides a body of interesting examples for testing algorithms and for inspiring new avenues of work.
∗ †
This material is based upon work supported by the National Science Foundation under Grant DMS-0712910 and by General Motors Research and Development. This material is based upon work supported by the National Science Foundation under Grant DMS-0712910 and the Duncan Chair of the University of Notre Dame.
470
C. W. Wampler and A. J. Sommese
CONTENTS 1 Introduction 2 Notation
470 472
PART 1: Fundamentals of algebraic kinematics
473
3 Some motivating examples 4 Algebraic kinematics 5 History of numerical algebraic geometry and kinematics
473 492 511
PART 2: Numerical algebraic geometry
514
6 Finding isolated roots 7 Computing positive-dimensional sets 8 Software
520 530 541
PART 3: Advanced topics
542
9 Non-reduced components 10 Optimal solving
542 545
PART 4: Frontiers
553
11 Real sets 12 Exceptional sets
553 555
PART 5: Conclusions
558
Appendix: Study coordinates
559
References
560
1. Introduction While systems of polynomial equations arise in fields as diverse as mathematical finance, astrophysics, quantum mechanics, and biology, perhaps no other application field is as intensively focused on such equations as rigidbody kinematics. This article reviews recent progress in numerical algebraic geometry, a set of methods for finding the solutions of systems of polynomial equations that relies primarily on homotopy methods, also known as polynomial continuation. Topics from kinematics are used to illustrate the applicability of the methods. High among these topics are questions concerning robot motion.
Numerical algebraic geometry and algebraic kinematics
471
Kinematics can be defined as the study of the geometry of motion, which is the scaffolding on which dynamics builds differential equations relating forces, inertia, and acceleration. While not all problems of interest in kinematics are algebraic, a large majority are. For instance, problems concerning mappings between robot joints and their hand locations fall into the algebraic domain. As our interest here is in numerical algebraic geometry, we naturally restrict our attention to the subset of kinematics questions that can be modelled as polynomial systems, a subfield that we call algebraic kinematics. We give a high-level description of kinematics that encompasses problems arising in robotics and in traditional mechanism design and analysis. In fact, there is no clear line between these, as robots are simply mechanisms with higher-dimensional input and output spaces as compared to traditional mechanisms. We discuss which types of mechanisms fall within the domain of algebraic kinematics. While algebraic geometry and kinematics are venerable topics, numerical algebraic geometry is a modern invention. The term was coined in 1996 (Sommese and Wampler 1996), building on methods of numerical continuation developed in the late 1980s and early 1990s. We will review the basics of numerical algebraic geometry only briefly; the reader may consult Sommese and Wampler (2005) for details. After summarizing the developments up to 2005, the article will concentrate on the progress of the last five years. Before delving into numerical algebraic geometry, we will discuss several motivational examples from kinematics. These should make clear that kinematics can benefit by drawing on algebraic geometry, while a short historical section recalls that developments in algebraic geometry in general, and numerical algebraic geometry in particular, have benefited from the motivation provided by kinematics. Numerical algebraic geometry applied to algebraic kinematics could be called ‘numerical algebraic kinematics’, which term therefore captures much of the work described in this paper. With a foundational understanding of kinematics in place, we then move on to discuss numerical algebraic geometry in earnest, occasionally returning to kinematics for examples. Our presentation of numerical algebraic geometry is divided into several parts. The first part reviews the basics of solving a system of polynomial equations. This begins with a review of the basic techniques for finding all isolated solutions and then extends these techniques to find the numerical irreducible decomposition. This describes the entire solution set of a system, both isolated points and positive-dimensional components, factoring the components into their irreducible pieces. The second part describes more advanced methods for dealing effectively with sets that appear with higher multiplicity and techniques that reduce computational work compared to the basic methods. Finally, we turn our attention to the frontiers of the area, where current research is developing methods for treating the real
472
C. W. Wampler and A. J. Sommese
points in a complex algebraic set and for finding exceptional examples in a parametrized family of problems. Like any computational pursuit, the successful application of numerical algebraic geometry requires robust implementation in software. In Section 8, we review some of the packages that are available, including the Bertini package (Bates, Hauenstein, Sommese and Wampler 2008) in which much of our own efforts have been invested.
2. Notation This paper uses the following notation. √ • i = −1, the imaginary unit. • a∗ for a ∈ C is the complex conjugate of a. • A for set A ⊂ CN is the closure of A in the complex topology. • For polynomial system F = {f1 , . . . , fn }, F : CN → Cn , and y ∈ Cn , F −1 (y) = {x ∈ CN | F (x) = y}. We also write V(F ) = V(f1 , . . . , fn ) := F −1 (0). (Our use of V() ignores all multiplicity information.) • ‘DOF’ means ‘degree(s) of freedom’. • We use the following abbreviations for types of joints between two links in a mechanism: – R = 1DOF rotational joint (simple hinge), – P = 1DOF prismatic joint (a slider joint allowing linear motion), and – S = 3DOF spherical joint (a ball and socket). These are discussed in more detail in Section 4.2. • C∗ , pronounced ‘Cee-star’, is C \ 0. • Pn is n-dimensional projective space, the set of lines through the origin of Cn+1 . • Points in Pn may be written as homogeneous coordinates [x0 , . . . , xn ] with (x0 , . . . , xn ) = (0, . . . , 0). The coordinates are interpreted as ratios: [x0 , . . . , xn ] = [λx0 , . . . , λxn ] for any λ ∈ C∗ .
Numerical algebraic geometry and algebraic kinematics
473
• A quaternion u is written in terms of the elements 1, i, j, k as u = u0 1 + u1 i + u2 j + u3 k,
u0 , u1 , u2 , u3 ∈ C.
We call u0 the real part of u and u1 i + u2 j + u3 k the vector part. We may also write u = (u0 , u), where u is the vector part of u. • If u and v are quaternions, then u ∗ v is their quaternion product. This may be written in terms of the vector dot-product operator ‘·’ and vector cross-product operator ‘×’ as (u0 , u) ∗ (v0 , v) = (u0 v0 − u · v, u0 v + v0 u + u × v). Note that ∗ does not commute: in general, u ∗ v = v ∗ u. • When u = (u0 , u) is a quaternion, u = (u0 , −u) is its quaternion conjugate, and u ∗ u is its squared magnitude.
PART ONE Fundamentals of algebraic kinematics 3. Some motivating examples Before attempting to organize kinematic problems into a common framework, let us begin by examining some examples. 3.1. Serial-link robots To motivate the discussion, let us see how one of the simplest problems from robot kinematics leads to a system of polynomial equations. It will also serve to introduce some basic terminology for robot kinematics. The generalization of this problem from the planar to the spatial case is one of the landmark problems solved in the 1980s. 3.1.1. Planar 3R robot Consider the planar robot arm of Figure 3.1(a) consisting of three moving links and a base connected in series by rotational joints. (Hash marks indicate that the base is anchored immovably to the ground.) Kinematicians use the shorthand notation ‘R’ for rotational joints and hence this robot is known as a planar 3R robot. The rotation of each joint is driven by a motor, and a sensor on each joint measures the relative rotation angle between successive links. Given the values of the joint angles, the forward kinematics problem is to compute the position of the tip, point R, and the orientation of the last link. Often, we refer to the last link of the robot as its ‘hand’. The converse of the forward kinematics problem is the inverse
474
C. W. Wampler and A. J. Sommese R
R c
R θ3
c
Q b
b
O
(a)
θ1
Q φ2
θ2 a
φ3
P
P
a O
(b)
φ1
(c)
Figure 3.1. Three-link planar robot arm and its kinematic skeleton.
kinematics problem, which is to determine the joint angles that will place the hand in a desired position and orientation. The forward kinematics problem is easy. We assume that the position of point O is known: without loss of generality we may take its coordinates to be (0, 0). The relative rotation angles, (θ1 , θ2 , θ3 ) in Figure 3.1(b), are given, and we know the lengths a, b, c of the three links. We wish to compute the coordinates of the tip, R = (Rx , Ry ), and the orientation of the last link, absolute rotation angle φ3 in Figure 3.1(c). To compute these, one may first convert relative angles to absolute ones as (φ1 , φ2 , φ3 ) = (θ1 , θ1 + θ2 , θ1 + θ2 + θ3 ). Then, the tip is at
a cos φ1 + b cos φ2 + c cos φ3 Rx = . Ry a sin φ1 + b sin φ2 + c sin φ3
(3.1)
(3.2)
In this case, the forward kinematics problem has a unique answer. The inverse kinematic problem is slightly more interesting. It is clear that if we can find the absolute rotation angles, we can invert the relationship (3.1) to find the relative angles. Moreover, we can easily find the position of point Q = (Qx , Qy ) as Q = (Qx , Qy ) = (Rx − c cos φ3 , Ry − c sin φ3 ). However, to find the remaining angles, φ1 , φ2 , we need to solve the trigonometric equations a cos φ1 + b cos φ2 Qx = . (3.3) Qy a sin φ1 + b sin φ2 Of course, an alternative would be to use basic trigonometry to solve for θ2 as the external angle of triangle OP Q having side lengths a, b, and Q,
Numerical algebraic geometry and algebraic kinematics
475
which can be done with the law of cosines. But, it is more instructive for our purposes to consider converting equation (3.3) into a system of polynomials. One way to convert the trigonometric equations to polynomials is to introduce for i = 1, 2 variables xi = cos φi , yi = sin φi , i = 1, 2, and the trigonometric identities cos2 φi + sin2 φi = 1. With variable substitutions, the four trigonometric equations become the polynomial equations ax1 + bx2 − Qx ay1 + by1 − Qy 2 (3.4) x1 + y12 − 1 = 0. x22 + y22 − 1 This system of two linears and two quadratics has total degree 1 · 1 · 2 · 2 = 4, which is an upper bound on the number of isolated solutions. However, for general a, b, Qx , Qy it has only two isolated solutions. An alternative method often used by kinematicians for converting trigonometric equations to polynomials is to use the tangent half-angle relations for rationally parametrizing a circle. This involves the substitutions sin φ = 2t/(1 + t2 ) and cos φ = (1 − t2 )/(1 + t2 ), where t = tan φ/2. (Denominators must be cleared after the substitutions.) This approach avoids doubling the number of variables but the degrees of the resulting equations will be higher. Either way, the conversion to polynomials is a straightforward procedure. The pathway of first writing trigonometric equations and then converting them to polynomials is not really necessary. We have presented it here to illustrate the fact that for any robot or mechanism built by connecting rigid links with rotational joints there is a straightforward method of arriving at polynomial equations that describe the basic kinematic relations. A different way of arriving at polynomial equations for this simple example is to first concentrate on finding the location of the intermediate joint P . Clearly P is distance a from O and distance b from Q, both of which are known points. Thus, P can lie at either of the intersection points of two circles: one of radius a centred at O and one of radius b centred at Q. Letting P = (Px , Py ), we immediately have the polynomial equations Px2 + Py2 − a2 = 0. (3.5) (Px − Qx )2 + (Py − Qy )2 − b2 Here, only (Px , Py ) is unknown, and we have two quadratic polynomial equations. Subtracting the first of these from the second, one obtains the system Px2 + Py2 − a2 = 0, (3.6) −2Px Qx + Q2x − 2Py Qy + Q2y − b2 + a2 which consists of one quadratic and one linear polynomial in the unknowns (Px , Py ). Hence, we see that the 3R inverse kinematics problem has at most
476
C. W. Wampler and A. J. Sommese
two isolated solutions. In fact, by solving a generic example, one finds that there are exactly two solutions. Of course, this is what one would expect for the intersection of two circles. The situation can be summarized as follows. The robot has a joint space consisting of all possible joint angles θ = (θ1 , θ2 , θ3 ), which in the absence of joint limits is the three-torus, T 3 . The parameter space for the family of 3R planar robots is R3 , consisting of link-length triplets (a, b, c). The workspace of the robot is the set of all possible positions and orientations of a body in the plane. This is known as special Euclidean two-space SE (2) = R2 ×SO(2). Since SO(2) is isomorphic to a circle, one can also write SE (2) = R2 × T 1 . Above, we have represented points in SE (2) by the coordinates (Rx , Ry , φ3 ). Equations (3.1) and (3.2) give the forward kinematics map K3R (θ; q) : T 3 × R3 → SE (2). For any particular such robot, say one given by parameters q ∗ ∈ R3 , we have a forward kinematics map that is the restriction of K3R to that set of parameters. Let us denote that map as K3R,q∗ (θ) := K3R (θ; q ∗ ), so K3R,q∗ : T 3 → SE (2). The forward kinematics map K3R,q is generically two-to-one, that is, for each set of joint angles θ ∈ T 3 , the robot with general link parameters q has a unique hand location H = K3R,q (θ) while for the same robot there are two possible sets of joint angles to reach any general hand location, i.e., −1 (H) is two isolated points for general H ∈ SE (2). To be more precise, K3R,q we should distinguish between real and complex solutions. Let TR3 be the set of real joint angles while TC3 is the set of complex ones. Similarly, we write SE (2, R) and SE (2, C) for the real and complex workspaces. The reachable workspace of the robot having link parameters q is the set Wq = {H ∈ SE (2, R) | ∃θ ∈ TR3 , K3R (θ; q) = H)}.
(3.7)
One can confirm using the triangle inequality that the reachable workspace is limited to locations in which point Q lies in the annulus {Q ∈ R2 | |a − b| ≤ Q ≤ |a + b|}. In the interior of the reachable workspace, the inverse kinematics problem has two distinct real solutions, outside it has none, and on the boundary it has a single double-point solution. An exception is when a = b. In that case, the interior boundary of the annulus for Q shrinks to a point, the origin O. When Q is at the origin, the inverse kinematics problem has a positive-dimensional solution with θ2 = ±π and θ1 = T 1 . We will refer to cases where the inverse kinematics problem has a higher than ordinary dimension as exceptional sets. The forward kinematics equations extend naturally to the complexes, where the situation is somewhat simpler due to the completeness of the complex number field. Over the complexes, for generic a, b, the inverse kinematics problem has two isolated solutions everywhere except at singu-
Numerical algebraic geometry and algebraic kinematics
477
larities where it has a double root. The forward and inverse kinematics maps still make sense, but the reachable workspace is no longer relevant. Since a real robot can only produce real joint angles, the maps over the reals and the corresponding reachable workspace are ultimately of paramount interest, but to get to these, it can be convenient to first treat the problem over the complexes. The roots of the inverse kinematics problem over the complexes are real whenever the hand location is within the reachable workspace. The problem of analysing the reachable workspace for the robot with parameters q comes down to finding the singularity surface Sq = {θ ∈ TR3 | rank dθ K3R (θ; q) < 3},
(3.8)
where dθ K3R denotes the 3×3 Jacobian matrix of partial derivatives of K3R with respect to the joint angles. The boundaries of the reachable workspace are contained in the image of the singularities, K3R,q (Sq ). Again, it is often simplest to first treat this problem over the complexes and then to extract the real points in the complex solution set. We note that the forward and inverse kinematics problems are defined by the analyst according to the intended usage of the device; there may be more than one sensible definition for a given mechanism. These are all related to the same essential kinematics of the device, usually related by simple projection operations. As a case in point, consider the variant of the forward and inverse kinematics problems, and the associated reachable workspace problem, occurring when the robot is applied not to locating the hand in position and orientation but rather simply positioning its tip without regard to the orientation with which this position is attained. : In the position-only case, we have a new forward kinematics map K3R 3 3 2 T ×R → R which may be written in terms the projection π : SE (3) → R2 , = π ◦ K3R . Holding the parameters π : (Rx , Ry , φ3 ) → (Rx , Ry ), as K3R is still unique, of the robot fixed, the forward kinematics problem for K3R but the inverse kinematics problem (finding joint angles to reach a given position) now has a solution curve. The positional 3R planar robot is said to be kinematically redundant, and motion along the solution curve for a fixed position of the end-point is called the robot’s self-motion. The reachable workspace for the positional 3R robot is either a disc or an annulus in the plane, centred on the origin. The singularity condition, similar to equation (3.8), (θ; q) < 2}, Sq = {θ ∈ TR3 | rank dθ K3R
(3.9)
(S ) = π(K (S )) that is the union of four circles gives an image K3R 3R q q having radii |a ± b ± c|. These correspond to configurations where points O, P , Q, and R are collinear: as shown in Figure 3.2(a), this means the linkage is fully outstretched or folded into one of three jackknife configurations.
478
C. W. Wampler and A. J. Sommese
(a)
(b)
Figure 3.2. Singularities and positional workspace for 3R planar robot.
Rotation of the first joint does not affect the singularity, so the projection of each singularity curve gives a circle in the workspace. The outer circle is a workspace boundary, while the inner circle may or may not be a boundary depending on the particular link lengths. If any point in the interior of the smallest circle can be reached, then the entire inner disc can be reached. In particular, the origin can be reached if and only if the link lengths satisfy the triangle inequality: max(a, b, c) ≤ a + b + c − max(a, b, c). For the particular case we are illustrating, this is satisfied, as is shown in Figure 3.2(b). The two intermediate circles are never workspace boundaries, but they mark where changes occur in the topology of the solution curve for the inverse kinematics problem. This illustrates the general principle that potential boundaries of real reachable workspaces are algebraic sets given by equality conditions, and the determination of which patches between these is in or out of the workspace can be tested by solving the inverse kinematics problem at a test point inside the patch.
Numerical algebraic geometry and algebraic kinematics
479
In short, we see that the 3R planar robot has three associated kinematics problems, as follows. For all these problems, the robot design parameters q = (a, b, c) are taken as given. (1) The forward kinematics problem for a given robot q is to find the hand location from knowledge of the joint angles. This has the unique solution (Rx , Ry , φ3 ) := K3R (θ; q). (2) The inverse kinematics problem for a given robot q is to find the joint angle sets that put the hand in a desired location, H ∈ SE (2). The −1 (H), is the solution for θ of the equations H − answer, denoted K3R,q K3R (θ; q) = 0. For generic cases, the solution set is two isolated points. (3) The reachable workspace problem is to find the boundaries of the real working volume of a given robot q. This can be accomplished by computing the singularity surface Sq of equation (3.8). An additional problem of interest is to identify exceptional cases, especially cases where the dimensionality of the solutions to the inverse kinematic problem is larger than for the general case. More will be discussed about this in Section 12. For this problem, we let the robot parameters q = (a, b, c) vary and seek to solve the following. (4) The exceptional set problem for forward kinematics function K3R is to find D1 = {(θ, q, H) ∈ T 3 × R3 × SE (2) | dim{θ ∈ T 3 | K3R (θ; q) = H} ≥ 1}, (3.10) where dim X means the dimension of set X. As will be described later, it is preferable in general to use local dimension instead of dimension, but it makes no difference in the 3R case. We described one exceptional set in the discussion of the inverse kinematic problem above. The exceptional set problem is significantly more difficult than the other three; the difficulty is only hinted at by the fact that all the symbols (θ1 , θ2 , θ3 , a, b, c, Rx , Ry , φ3 ) ∈ T 3 × R3 × SE (2) are variables in the problem. All four problems exist as well for the positional 3R robot and its forward (θ; q). The generic inverse kinematics solutions become kinematics map K3R curves, and the exceptional set problem would find robots in configurations where the inverse solution has dimension greater than or equal to two. In the problem statements of items (1)–(4) above, we have reverted to writing functions of angles, implying a trigonometric formulation. However, it is clear from the earlier discussion that all of these problems are easily restated in terms of systems of polynomial equations.
480
C. W. Wampler and A. J. Sommese z3
x3 z4
x4
z2 z5 x2 z1
z7
z6
x5
x6 y7
x7
z0
x1
p
y0 x0 Figure 3.3. Schematic six-revolute serial-link robot.
3.1.2. Spatial 6R robot The spatial equivalent of the 3R planar robot is a 6R chain, illustrated in Figure 3.3. In the drawing, the six spool-like shapes indicate the rotational joints, which have axes labelled z1 , . . . , z6 . Vectors x1 , . . . , x6 point along the common normals between successive joint axes. Frame x0 , y0 , z0 is the world reference frame, and a final end-effector frame x7 , y7 , z7 marks where the hand of the robot arm would be mounted. The purpose of the robot is to turn its joints so as to locate the end-effector frame in useful spatial locations with respect to the world frame. For example, these destinations may be where the hand will pick up or drop off objects. The set of all possible positions and orientations of a rigid body in threespace is SE (3) = R3 × SO(3), a six-dimensional space. Accordingly, for a serial-link revolute-joint spatial robot to have a locally one-to-one mapping between joint space and the workspace SE (3), it must have six joints. With fewer joints, the robot’s workspace would be a lower-dimensional subspace of SE (3). With more, the robot is kinematically redundant and has a positive-dimensional set of joint angles to reach any point in the interior of its workspace. With exactly six joints, the robot generically has a finite number of isolated points in joint space that produce the same hand location in SE (3). For a general 6R robot and a general hand location, the 6R inverse kinematics problem has 16 isolated solutions over the complexes, while the number of real solutions may change with the hand location. The singularity
Numerical algebraic geometry and algebraic kinematics
481
surfaces divide the reachable workspace into regions within which the number of real isolated solutions is constant. This includes, of course, the boundaries between the reachable workspace and its exterior, where no solutions exist. Robots with special geometries, which are very common in practice, may have a lower number of isolated solutions, and for some hand locations and special robot geometries, positive-dimensional solution sets may arise. Thus, we see that the four types of problems discussed for the 3R robot extend naturally to the 6R robot, although one may expect the answers to be somewhat more complicated and harder to compute. The most common way to formulate the kinematics of a serial-link robot is to use 4 × 4 transformation matrices of the form: C d , C ∈ SO(3), d ∈ R3×1 , 03 = [0 0 0]. (3.11) A= 03 1 The set of all such matrices forms a representation of SE (3). Pre-multiplication by A is equivalent to a rotation C followed by a translation d. When put in this form, a rotation of angle θ around the z axis is written cos θ − sin θ 0 0 sin θ cos θ 0 0 . (3.12) Rz (θ) = 0 0 1 0 0 0 0 1 We may use the 4 × 4 representation to build up the chain of transformations from one end of the robot to the other. The displacement from the origin of link 1, marked by x1 , z1 , to the origin of link 2, marked by x2 , z2 , is Rz (θ1 )A1 , where A1 is a constant transform determined by the shape of link 1. In this manner, the final location of the hand with respect to the world reference system, which we will denote as H ∈ SE (3), can be written in terms of seven link transforms A0 , . . . , A6 ∈ SE (3) and six joint angles as H = K6R (θ; q) := A0
6
Rz (θj )Aj .
(3.13)
j=1
Here, the set of parameters q is the link transforms, so q ∈ SE (3)7 , while the joint space is the six-torus: θ ∈ T 6 . As in the planar case, to convert from this trigonometric formulation to an algebraic one, we simply adopt unit circle representations of the joint angles. It is clear that the four basic problem types discussed for the 3R robot (forward, inverse, workspace analysis, and exceptional sets) carry over to the 6R case with K6R playing the role of K3R . 3.2. Four-bar linkages The reachable workspaces of 3R and 6R robots have the same dimension as the ambient workspace, SE (2) and SE (3), respectively. This is not true
482
C. W. Wampler and A. J. Sommese P
B2 B1
Θ2
Φ A2 Θ1 A1 (a)
(b)
Figure 3.4. Four-bar linkage.
for many mechanisms used in practice. In fact, it is precisely the ability to restrict motion to a desired subspace that makes many mechanisms useful. Consider, for example, the four-bar linkage, illustrated in Figure 3.4. As is customary, we draw the three moving links, two of which are attached to the ground at points A1 and A2 . The ground link counts as the fourth bar; a convention that was not yet adopted in some of the older papers (e.g., Cayley (1876), Clifford (1878) and Roberts (1875)). The middle link, triangle B1 B2 P , is called the coupler triangle, as it couples the motion of the two links to ground, A1 B1 and A2 B2 . Four-bars can be used in various ways, such as • function generation, i.e., to produce a desired functional relationship between angles Θ1 and Θ2 ; • path generation, i.e., to produce a useful path of the coupler point P , as shown in Figure 3.4(b); or • body guidance, in which the coordinated motion in SE (2) of the coupler link is of interest. The path of the coupler point P is called the coupler curve. In the example shown in Figure 3.4(b) the coupler curve has two branches; the mechanism must be disassembled and reassembled again to move from one branch to the other. (Over the complexes, the curve is one irreducible set. Whether the real coupler curve has one or two branches depends on inequality relations between the link sizes.) To specify a configuration of a four-bar, one may list the locations of the three moving links with respect to the ground link. That is, a configuration is a triple from SE (3)3 . We may take these as (A1 , Θ1 ), (A2 , Θ2 ) and (P, Φ). For generic link lengths, the mechanism has a 1DOF motion, a curve in
483
Numerical algebraic geometry and algebraic kinematics
SE (3)3 . The whole family of all possible four-bars is parametrized by the shapes of the links and the placement of the ground pivots. These add up to 9 independent parameters, which we may enumerate as follows: • positions of ground pivots A1 and A2 in the plane (4 parameters); • lengths |A1 B1 |, |A2 B2 |, |B1 P |, and |B2 P | (4 parameters); and • angle ∠B1 P B2 (1 parameter). Clearly, the motion of a four-bar is equivalent to the self-motion of a kinematically redundant positional 3R robot whose end-point is at A2 . The workspace regions drawn in Figure 3.2 now become the regions within which we may place A2 without changing topology of the motion of the four-bar. The boundaries delineate where one or more of the angles Θ1 , Θ2 , and Φ change between being able to make full 360◦ turns or just partial turns. As in the case of the 3R robot, we may use several different ways to write down the kinematic relations. One particularly convenient formulation for planar mechanisms, especially those built with rotational joints, is called isotropic coordinates. The formulation takes advantage of the fact that a vector v = ax+by in the real Cartesian plane can be modelled as a complex number v = a + b i. Then, vector addition, u + v, is simple addition of complex numbers, u + v, and rotation of vector v by angle Θ is eiΘ v. Suppose that in Cartesian coordinates P = (x, y), so that the location of the coupler link is represented by the triple (x, y, Φ), which we may view as an element of SE (2). To make the Cartesian representation algebraic, we switch to the unit circle coordinates (x, y, cΦ , sΦ ) ∈ V(c2Φ + s2Φ − 1), which is an isomorphic representation of SE (3). In isotropic coordinates, ¯ ∈ V(φφ¯ − 1), where the representation of SE (3) is (p, p¯, φ, φ) p = x + iy,
p¯ = x − iy,
φ = eiΦ ,
φ¯ = e−iΦ .
(3.14)
When (x, y, Φ) is real, we have the complex conjugate relations p∗ = p¯ and
¯ φ∗ = φ,
(3.15)
where ‘∗ ’ is the conjugation operator. The isotropic coordinates are merely a linear transformation of the unit circle coordinates: p 1 i x φ 1 i cΦ . = and = p¯ 1 −i y φ¯ 1 −i sΦ To model the four-bar linkage using isotropic coordinates, we draw a vector diagram in the complex plane, shown in Figure 3.5. Point O marks the origin, from which vectors a1 and a2 mark the fixed ground pivots and vector p indicates the current position of the coupler point. As the coupler rotates by angle Φ, its sides rotate to φb1 and φb2 , where φ = eiΦ . The links
484
C. W. Wampler and A. J. Sommese φb2 φb1 2
p
Φ
Θ2
Θ1
a2
1
a1
O
Figure 3.5. Vector diagram of a four-bar linkage.
to ground have lengths 1 and 2 . Letting θj = eiΘj , j = 1, 2, we may write two vector loop equations: 1 θ1 = p + φb1 − a1 , 2 θ2 = p + φb2 − a2 .
(3.16a) (3.16b)
Since a1 , a2 , b1 , b2 are complex vectors, their isotropic representations in¯2 , ¯b1 , ¯b2 , with a ¯1 = a∗1 , etc., for a real clude the conjugate quantities a ¯1 , a linkage. Accordingly, the vector loop equations imply that the following conjugate vector equations must also hold: ¯1 , 1 θ¯1 = p¯ + φ¯¯b1 − a ¯2 . 2 θ¯2 = p¯ + φ¯¯b2 − a
(3.17a) (3.17b)
Finally, we have unit length conditions for the rotations: θ1 θ¯1 = 1,
θ2 θ¯2 = 1,
and
φφ¯ = 1.
(3.18)
¯ 1 , a2 , a ¯2 , b1 , ¯b1 , b2 , ¯b2 , Altogether, given a four-bar with the parameters a1 , a ¯ ¯ 1 , 2 , we have 7 equations for the 8 variables p, p¯, φ, φ, θ1 , θ1 , θ2 , θ¯2 , so we expect in the generic case that the mechanism has a 1DOF motion. While equations (3.16)–(3.18) describe the complete motion of the fourbar, we might only be interested in the path it generates. In general, in such cases we might just invoke a projection operation, ¯ θ1 , θ¯1 , θ2 , θ¯2 ) → (p, p¯), K : (p, p¯, φ, φ, and keep working with all the variables in the problem. However, in the case
Numerical algebraic geometry and algebraic kinematics
485
of the four-bar, we can easily perform the elimination operation implied by the projection. First, the rotations associated to Θ1 and Θ2 are eliminated as follows: 21 = (p + φb1 − a1 )(¯ p + φ¯¯b1 − a ¯1 ),
(3.19a)
p + φ¯¯b2 − a ¯2 ). 22 = (p + φb2 − a2 )(¯
(3.19b)
After expanding the right-hand sides of these and using φφ¯ = 1, one finds ¯ Consequently, one may solve these that the equations are linear in φ, φ. using Cramer’s rule to obtain a single coupler curve equation in just p, p¯. Using |α β| to denote the determinant of a 2 × 2 matrix having columns α and β, we may write the coupler curve equations succinctly as ¯||v u| + |u u ¯|2 = 0, fcc (p, p¯; q) = |v u where
(3.20)
p−a ¯1 ) + b1¯b1 − 21 (p − a1 )(¯ v= , (p − a2 )(¯ p−a ¯2 ) + b2¯b2 − 22 ¯ b1 (p − a1 ) p−a ¯1 ) b1 (¯ and u ¯= ¯ , u= p−a ¯2 ) b2 (¯ b2 (p − a2 )
(3.21)
and where q is the set of linkage parameters: ¯1 , a ¯2 , ¯b1 , ¯b2 , 1 , 2 ). q = (a1 , a2 , b1 , b2 , a Inspection of equations (3.20) and (3.21) shows that the coupler curve is degree six in p, p¯, and in fact, the highest exponent on p or p¯ is three. In other words, the coupler curve is a bi-cubic sextic. The number of monomials in a bi-cubic equation in two variables is 16, which is sparse compared to the possible 28 monomials for a general sextic. The bi-cubic property implies that a coupler curve can intersect a circle in at most 6 distinct points, one of the important properties of coupler curves. The coupler curve equation answers the workspace analysis question for four-bar path generation. For example, the question of where the coupler curve crosses a given line comes down to solving a sextic in one variable, a process that can be repeated for a set of parallel lines to sweep out a picture of the whole curve in the plane. (This is not the simplest procedure that can be applied for this mechanism, but it is a workable one.) A much tougher kind of question inverts the workspace analysis problem. These are synthesis problems of finding four-bars whose coupler curve meets certain specifications. For example, we might request that the coupler curve interpolate a set of points. The most extreme case is the nine-point synthesis problem of finding all four-bars whose coupler curve interpolates nine given
486
C. W. Wampler and A. J. Sommese
points.1 Essentially, this means solving for the parameters q that satisfy the system: (3.22) fcc (pj , p¯j ; q) = 0, j = 0, . . . , 8, for nine given points (pj , p¯j ) ∈ C2 , j = 0, . . . , 8. This problem, first posed by Alt (1923), finally succumbed to solution by polynomial continuation in 1992 (Wampler, Morgan and Sommese 1992, 1997), where it was demonstrated that 1442 coupler curves interpolate a generic set of nine points, each coupler curve generated by three cognate linkages (Roberts’ cognates (Roberts 1875)). The system of equation (3.22) consists of nine polynomials of degree eight. Roth and Freudenstein (1963) formulated the problem in a similar way, but ended up with eight polynomials of degree seven. Since this version has become one of our test problems, we give a quick re-derivation of it here. The key observation is that since we are given the nine points, we may choose the origin of coordinates to coincide with the first one: (p0 , p¯0 ) = (0, 0). Moreover, the initial rotations of the links can be absorbed into the link parameters, so we may assume that Θ1 , Θ2 , Φ = 0 at the initial precision point. Accordingly, at that point equation (3.19) becomes ¯1 ), (3.23a) 2 = (b1 − a1 )(¯b1 − a 1
22 = (b2 − a2 )(¯b2 − a ¯2 ).
(3.23b)
Substituting from these into the expression for v in equation (3.21), one may eliminate 21 and 22 . Accordingly, the Roth–Freudenstein formulation of the nine-point problem is fcc (pj , p¯j ; q) = 0,
j = 1, . . . , 8,
(3.24)
with the precision points (pj , p¯j ) given and with variables a1 , a2 , b1 , b2 , a ¯1 , a ¯2 , ¯b1 , ¯b2 . Although the equations appear to be degree eight, the highest-degree terms all cancel, so the equations are actually degree seven. Hence, the total degree of the system is 78 . The original Roth–Freudenstein formulation did not use isotropic coordinates, but their equations are essentially equivalent to the ones presented here. Various other synthesis problems can be posed to solve engineering design problems. The nature of the synthesis problem depends on the use to which the linkage is being applied. For example, if the four-bar is being used for function generation, one may seek those mechanisms whose motion interpolates angle pairs (Θ1,j , Θ2,j ) ∈ R2 (for up to five such pairs). For body 1
Nine is the maximum possible number of generic points that can be interpolated exactly, because that is the number of independent parameters. Although we have 10 parameters in q, there is a one-dimensional equivalence class. This could be modded out by requiring that b1 be real, i.e., ¯b1 = b1 . We enumerated a count of nine independent parameters earlier in this section.
Numerical algebraic geometry and algebraic kinematics
487
guidance, one may specify triples (pj , p¯j , Φj ) ∈ SE (2) for up to five poses. Instead of just interpolating points, synthesis problems can also include derivative specifications (points plus tangents). Kinematicians sometimes distinguish between these as ‘finitely separated’ versus ‘infinitesimally separated’ precision points. Every synthesis problem has a maximum number of precision points that can be exactly interpolated. If more points are specified, one may switch from exact synthesis to approximate synthesis, in which one seeks mechanisms that minimize a sum of squares or other measure of error between the generated motion and the specified points. While this subsection has focused on the four-bar planar linkage, it should be appreciated that similar questions will arise for other arrangements of links and joints, and like the 6R spatial generalization of the 3R planar robot, some of these move out of the plane into three-space. 3.3. Platform robots Suppose you are given the task of picking up a long bar and moving it accurately through space. While it may be possible to do so by holding the bar with one hand, for a more accurate motion, one naturally grasps it with two hands spread a comfortable distance apart. This reduces the moments that must be supported in one’s joints. On the down side, a two-hand grasp limits the range of motion of the bar relative to one’s body due to the finite length of one’s arms. Similar considerations have led engineers to develop robotic mechanisms where multiple chains of links operate in parallel to move a common endeffector. Generally, this enhances the robot’s ability to support large moments, but this comes at the cost of a smaller workspace than is attained by a serial-link robot of similar size. While many useful arrangements have been developed, we will concentrate on two ‘platform robots’: one planar and one spatial. In each case, a moving end-effector link is supported from a stationary base link by several ‘legs’ having telescoping leg lengths. As SE (2) and SE (3) are 3- and 6-dimensional, respectively, it turns out that the number of legs that make the most useful mechanisms is also 3 and 6, respectively. We begin with the planar 3-RPR platform robot and then address the related 6-SPS spatial platform robot. (These notations will be explained shortly.) 3.3.1. 3-RPR planar robot Recall that R indicates a rotational joint and P indicates a prismatic joint. An RPR chain is a set of four links in series where links 1 and 2 are connected by an R joint, 2 and 3 by a P joint, and 3 and 4 by another R joint. A 3RPR planar robot has three such chains wherein the first and last links are common to all three chains. This arrangement is illustrated in Figure 3.7(a).
488
C. W. Wampler and A. J. Sommese P C1 C2 B2
B1
C3
A3
A2
A1 (a)
(b)
Figure 3.6. Pentad (3-RR) linkage.
Before working further with the 3-RPR robot, we first consider what happens to a four-bar linkage if we add a fifth link between its coupler point and a new ground pivot, A3 , as shown in Figure 3.6(a). As it has five links, this new linkage is known as the pentad linkage. Due to the new constraint imposed on the motion of P by the link A3 P , the pentad becomes an immobile structure. The possible assembly configurations can be found by intersecting the four-bar coupler curve (branches C1 and C2 ) that we first met in Figure 3.4(b) with the circle C3 centred on A3 with radius |AP |. As shown in Figure 3.6(b), this particular example has six real points of intersection, one of which gives the illustrated configuration. We already noted in the previous section that due to the bi-cubic nature of the coupler curve, there are generically six such intersection points over the complexes. In this example all of them are real. The pentad could be called a 3-RR mechanism, as the three links (legs) between ground and the coupler triangle have R joints at each end. If we add ‘prismatic’ slider joints on each leg, it becomes the 3-RPR platform robot shown in Figure 3.7(a). The prismatic joints allow the leg lengths 1 , 2 , 3 to extend and retract, driven by screws or by hydraulic cylinders. Thus, the input to the robot are the three leg lengths (1 , 2 , 3 ) ∈ R3 , and the output is the location of the coupler triangle, a point in SE (2). We have already done most of the work for analysing the 3-RPR robot when we formulated equations for the four-bar linkage. The vector diagram in Figure 3.7(b) is identical to Figure 3.5 except for the addition of vector a3 to the new ground pivot and the new link length 3 . Using the same conventions for isotropic coordinates as before, we simply add the new equations 3 θ3 = p − a 3 ,
3 θ¯3 = p¯ − a ¯3
and
θ3 θ¯3 = 1.
(3.25)
489
Numerical algebraic geometry and algebraic kinematics
P
φb2 3
φb1
3 2
Θ3 2
Φ
Φ
1
p Θ2 a3
1 a2
Θ1 a1 (a)
(b)
O
Figure 3.7. 3-RPR planar platform robot.
If we wish to eliminate Θ3 , we replace these with the circle equation 23 = (p − a3 )(¯ p−a ¯3 ).
(3.26)
The inverse kinematics problem is to find the leg lengths (1 , 2 , 3 ) given ¯ ∈ SE (2). Since the leg a desired location of the coupler triangle (p, p¯, φ, φ) lengths must be positive, they can be evaluated uniquely from equations (3.19) and (3.26). In the opposite direction, the forward kinematics problem comes down to computing the simultaneous solution of equations (3.20) and (3.26). This is the same as solving the pentad problem illustrated in Figure 3.6(b), which has up to six distinct solutions. Notice that once we have found (p, p¯) from ¯ from equation (3.19), where they this intersection, we may recover (φ, φ) appear linearly. Using the notation of equation (3.21) for 2×2 determinants, this solution reads φ = |¯ u v|/|u u ¯|, φ¯ = |v u|/|u u ¯|. (3.27) 3.3.2. 6-SPS ‘Stewart–Gough’ platform A natural generalization of the 3-RPR planar platform robot is the 6-SPS spatial platform robot, where the rotational R joints are replaced by spherical S joints and the number of legs is increased to six. This arrangement, illustrated in Figure 3.8, is usually referred to as a ‘Stewart–Gough2 platform’. The device has a stationary base A and a moving platform B connected by six legs of variable length. The six legs acting in parallel can 2
For historical reasons, the arrangement first became widely known as a Stewart platform, although D. Stewart’s invention actually had a different design. As it appears that E. Gough was the true first inventor of the device, current usage (Bonev 2003) now credits both contributors.
490
C. W. Wampler and A. J. Sommese
B b1 B1 p L1
a1
A1
A
Figure 3.8. General Stewart–Gough platform robot.
support large forces and moments, which makes the platform robot ideal as the motion base for aircraft simulators, although it has many other uses as well. Most practical versions of the device resemble the arrangement shown in Figure 3.9, where the six joints on the base coincide in pairs, forming a triangle, and those on the moving platform are arranged similarly. The edges of these triangles along with the six connecting legs form the twelve edges of an octahedron. In more general arrangements, such as the one shown in Figure 3.8, the joints have no special geometric configuration. It is easy to see that if the legs of the platform are allowed to extend and retract freely without limit, the moving platform can be placed in any pose, say (p, C) ∈ SE (3), where p ∈ R3 is the position of a reference point on the platform and C ∈ SO(3) is a 3 × 3 orthogonal matrix representing the orientation of the platform. Let aj ∈ R3 , j = 1, . . . , 6 be vectors in reference frame A to the centres A1 , . . . , A6 of the spherical joints in the base, and let bj ∈ R3 , 1, . . . , 6 be the corresponding vectors in reference frame B for the joint centres B1 , . . . , B6 in the moving platform. Figure 3.8 labels the joints and joint vectors for leg 1. The length of the jth leg, denoted Lj is just the distance between its joint centres: L2j = |Aj Bj |2 = p + Cbj − aj 22 = (p + Cbj − aj )T (p + Cbj − aj ),
j = 1, . . . , 6.
(3.28)
This spatial analogue to equation (3.19) solves the inverse kinematic prob-
Numerical algebraic geometry and algebraic kinematics
491
Figure 3.9. Octahedral Stewart–Gough platform robot.
lem for the 6-SPS robot. There is only one inverse solution having all positive leg lengths. Another way to view equation (3.28) is that when leg length Lj is locked, it places one constraint on the moving platform: joint centre Bj must lie on a sphere of radius Lj centred on joint centre Aj . Since SE (3) is sixdimensional, it takes six such constraints to immobilize plate B, turning the robot into a 6-SS structure. The forward kinematics problem is to find the location of B given the six leg lengths, that is, to solve the system of equations (3.28) for (p, C) ∈ SE (3) given the leg lengths (L1 , . . . , L6 ) and the parameters of the platform (aj , bj ), j = 1, . . . , 6. Notice that for the platform robots, the inverse kinematics problem is easy, having a unique answer, while the forward kinematics problem is more challenging, having multiple solutions. This is the opposite of the situation for serial-link robots. It can happen that both directions are hard; for example, consider replacing the simple SPS-type legs of the Stewart–Gough platform with ones of type 5R. It is somewhat inconvenient to solve the forward kinematics problem as posed in equation (3.28), because we must additionally impose the conditions for C to be in SO(3), namely C T C = I and det C = 1. In the planar 3-RR case, isotropic coordinates simplified the treatment of displacements in SE (2). Although isotropic coordinates do not generalize directly to SE (3), there is an alternative applicable to the spatial case: Study coordinates. ¯ ∈ C4 are restricted to the bilinear Just as isotropic coordinates (p, p¯, φ, φ) ¯ quadric φφ = 1, Study coordinates [e, g] ∈ P7 are restricted to the bilinear quadric S62 = V(Q), where Q(e, g) = eT g = e0 g0 + e1 g1 + e2 g2 + e3 g3 = 0.
(3.29)
The isomorphic mapping between Study coordinates [e, g] ∈ S62 ⊂ P7 and (p, C) ∈ C3 × SO(3) is discussed in the Appendix. In Study coordinates,
492
C. W. Wampler and A. J. Sommese
translation p is rewritten in terms of [e, g] via quaternion multiplication and conjugation as p = g ∗ e /(e ∗ e ) while rotation of vector v by rotation matrix C is rewritten as Cv = e ∗ v ∗ e /(e ∗ e ). In Study coordinates, the leg length equations become: L2i = (g ∗ e + e ∗ bj ∗ e )/(e ∗ e ) − aj 22 ,
j = 1, . . . , 6.
(3.30)
Using the relations v2 = v ∗ v , and (a ∗ b) = b ∗ a , one may expand and simplify equation (3.30) to rewrite it as 0 = g ∗ g + (bj ∗ bj + aj ∗ aj − L2j )e ∗ e + (g ∗ bj ∗ e + e ∗ bj ∗ g ) − (g ∗ e ∗ aj + aj ∗ e ∗ g ) − (e ∗ bj ∗ e ∗ aj + aj ∗ e ∗ bj ∗ e ) = g T g + g T Bj e + eT Aj e,
j = 1, . . . , 6.
(3.31)
In the last expression, g and e are treated as 4 × 1 matrices and the 4 × 4 matrices Aj (symmetric) and Bj (antisymmetric) contain entries that are quadratic in aj , bj , Lj . Expressions for Aj and Bj can be found in Wampler (1996). In the forward kinematics problem, Aj and Bj are considered known, so these equations along with the Study quadric equation, equation (3.29), are a system of seven quadrics on P7 . The forward kinematics problem is to solve these for [e, g] ∈ P7 given the leg lengths (L1 , . . . , L6 ). The forward kinematics problem for general Stewart–Gough platforms received extensive academic attention leading up to its effective solution in the early 1990s. It can be shown that a generic instance of the problem has 40 isolated solutions in complex P7 . The first demonstration of this was numerical, based on polynomial continuation (Raghavan 1991, 1993), while around the same time others published demonstrations based on Gr¨obner bases over a finite field (Lazard 1993, Mourrain 1993) and a proof by abstract algebraic geometry (Ronga and Vust 1995). The formulation of the problem in Study coordinates was arrived at independently by Wampler (1996), who gave a simple proof of the root count of 40, and Husty (1996), who showed how to reduce the system to a single degree 40 equation in one variable. Using current tools in numerical algebraic geometry, the solution of seven quadrics is a simple exercise, requiring from a few seconds to a minute or so of computational time, depending on the computer applied to the task, to track 27 homotopy paths. As we shall discuss further below, once the first general example has been solved to find just 40 solutions, all subsequent examples can be solved by tracking only 40 homotopy paths.
4. Algebraic kinematics Now that we have discussed a variety of problems from kinematics, let us examine how we may fit them all into a common framework. This framework will help show why so many problems in kinematics are algebraic at their core.
Numerical algebraic geometry and algebraic kinematics
493
4.1. Rigid-body motion spaces In the examples, we have already dealt in some detail with SE (3), the sixdimensional set of rigid-body transformations in three-space. The most useful representations of SE (3) are as follows. • (p, C) ∈ R3 × SO(3), where SO(3) = {C ∈ R3×3 | C T C = I, det C = 1}. This acts on a vector v ∈ R3 to transform it to u = Cv + p. • The 4×4 homogeneous transform version of this, where (p, C) are placed in a matrix so that the transform operation becomes u C p v = . 1 0 1 1 • Study coordinates [e, g] ∈ S62 ⊂ P7 , where S62 = V(eT g) and the transform operation is u = (e ∗ v ∗ e + g ∗ e )/(e ∗ e ). In all three cases, the representations live on an algebraic set and the transform operation is also algebraic. There are several subgroups of SE (3) that are of interest. Most prominent is SE (2), the set of planar rigid-body transformations, with representations as follows. • (p, C) ∈ R2 × SO(2), where SO(2) = {C ∈ R2×2 | C T C = I, det C = 1}. The transform rule looks identical to the spatial case: u = Cv + p. • The unit circle form {(x, y, s, c) ∈ R4 | c2 + s2 = 1}. This is the same as the former with p = xi + yj and c −s C= . s c • The tangent half-angle form (x, y, t) ∈ R3 , in which rotations become 1 1 − t2 −2t . C= 2t 1 − t2 1 + t2 ¯ ∈ C4 | θθ¯ = 1}. Real transforms must • Isotropic coordinates {(p, p¯, θ, θ) ∗ ∗ ¯ The action of transform (p, p¯, θ, θ) ¯ on a vector satisfy p = p¯ and θ = θ. given by isotropic coordinates (v, v¯) is the vector (u, u ¯) given by ¯v ). (u, u ¯) = (p + θv, p¯ + θ¯ Again, each of these representations lives on an algebraic set and has an algebraic transform operation. Clearly, SE (2) is a three-dimensional space. Another subspace of interest is the set of spherical transforms, that is, just SO(3), another three-dimensional space. This is SE (3) with the translational portion set identically to zero. The terminology ‘spherical’ derives from the fact that this is the set of motions allowed by a spherical ball set in a spherical socket of the same diameter.
494
C. W. Wampler and A. J. Sommese
At root, all of these are algebraic because an essential property of a rigidbody transform is the preservation of distance between any two points. Squared distances are, of course, algebraic. The second property is that the transform must preserve handedness, as we do not wish to transmute a rigid body into its mirror image. It is this latter consideration that restricts the rotational portion to SO(3), which is the component of the set of all orthogonal matrices, O(3), that contains the identity matrix. 4.2. Algebraic joints A mechanism is a collection of rigid bodies connected by joints. Without the joints, each body could move with six degrees of freedom anywhere in SE (3). Typically, we declare one body to be ‘ground’ and measure the locations of all the other bodies relative to it, so a collection of n bodies lives in SE (3)n−1 . Joints are surfaces of contact between bodies that constrain the motion of the mechanism to a subset of SE (3)n−1 . Algebraic joints are those which constrain a mechanism to algebraic subsets of SE (3)n−1 . The most important joints for building mechanisms are the lower-order pairs. These are pairs of identical surfaces that can stay in full contact while still allowing relative motion. In other words, they are formed by a surface that is invariant under certain continuous sets of displacements. The lower-order pairs form six possible joint types, having the following standard symbols. R ‘Revolute’. A surface of revolution is invariant under rotation about its axis of symmetry. A general R pair allows a 1DOF rotational motion equivalent to SO(2). An example is a door hinge. P ‘Prismatic’. A surface swept out by translating a planar curve along a line out of its plane. A general P pair allows a 1DOF translational motion. An example is a square peg in a matching square hole. H ‘Helical’, also known as a ‘screw joint’. A surface swept out by a curve that simultaneously rotates and translates about a fixed axis, with the two rates in fixed proportion. This yields a 1DOF motion for a general H pair. The ratio of the linear rate to the rotational rate is called the ‘pitch’ of the screw. An example is a nut on a screw. C ‘Cylindrical’. A round peg in a matching round hole can both rotate around the axis of symmetry and translate along it independently, generating a 2DOF motion. E ‘Plane’, from the German ‘ebener’ since P is already taken. Plane-toplane contact allows a 3DOF motion, namely the set SE (2). S ‘Spherical’. A spherical ball in a matching spherical socket allows a 3DOF motion, the set SO(3).
Numerical algebraic geometry and algebraic kinematics
495
The importance of the lower-order pairs derives from the fact that surfaceto-surface contact spreads forces of contact over a larger area, reducing stresses that might wear out the machinery. Fortunately – from the viewpoint of an algebraic geometer – five of these six joint types are algebraic. The exception is the H joint. The relative motion of a helical joint of pitch ρ with axis through the origin along the z direction is given by 4 × 4 transforms of the form
cos θ − sin θ sin θ cos θ 0 0 0 0
0 0 0 0 . 1 ρθ 0 1
(4.1)
The mixture of θ with cos θ and sin θ makes the motion truly trigonometric, hence non-algebraic. An alternative line of reasoning is to observe that a helix and a plane containing its symmetry axis intersect in an infinite number of isolated points. Any algebraic curve in R3 intersects a plane in at most a finite number of isolated points. Even more fortuitously, helical joints are rarely used as a direct motion constraint in a manner that impacts kinematic analysis. Instead, screws are usually used to transmit power along a prismatic joint. Consequently, the geometric motion of a great many mechanisms is governed by algebraic joints. Not all joints in mechanism work are lower-order pairs. Line contact between two surfaces can be adequate to spread stresses, and it is typical of many rolling contacts (e.g., wheel on plane). With sufficient lubrication, even sliding line contacts can endure, such as happens in some cam contacts. To demonstrate that a joint type is algebraic, one may write down the constraint conditions it imposes between the transforms for the two bodies in contact. Suppose (p1 , C1 ), (p2 , C2 ) ∈ SE (3) are the rigid-body transforms for bodies 1 and 2. To impose constraints equivalent to the lower-order joints, we need to specify geometric features that are associated with the joints. To this end, let a be a point of body 1, given in body 1 coordinates. ˆ = p1 + C1 a. Similarly, let b The world coordinates of the point are then a ˆ = p2 + C2 b. Let be a point in body 2, so that its world coordinates are b (u1 , u2 , u3 ) be a dextral set of mutually orthogonal unit vectors in body 1, that is, the matrix formed with these as its column vectors is in SO(3). Let (v1 , v2 ) be orthogonal unit vectors in body 2. The unit vectors transform ˆ i = C2 vi , i = 1, 2. ˆ i = C1 ui , i = 1, 2, 3, and v into world coordinates as u With these features, the constraints imposed by lower-order pairs R, P, C, E, and S can be modelled with equations that are algebraic in the transforms (p1 , C1 ) and (p2 , C2 ) and the features a, b, u1 , u2 , u3 , v1 , v2 , as follows.
496
C. W. Wampler and A. J. Sommese
ˆ and u ˆ=b ˆ1 = v ˆ 1 , which after substituting from the expressions above R: a become p1 + C1 a = p2 + C2 b, and C1 u1 = C2 v1 . For brevity, in the remaining cases we only give the constraints on the world coordinates, which the reader may easily expand to get equations in the transforms and features. ˆ −a ˆ −a ˆ) = 0, u ˆ T3 (b ˆ) = 0, u ˆ1 = v ˆ1, u ˆ2 = v ˆ2. ˆ T2 (b P: u ˆ −a ˆ −a ˆ) = 0, u ˆ T3 (b ˆ) = 0, u ˆ1 = v ˆ1. ˆ T2 (b C: u ˆ −a ˆ T1 (b ˆ) = 0, u ˆ1 = v ˆ1. E: u ˆ ˆ = b. S: a Equating two points imposes three constraints, whereas equating two unit vectors imposes only two independent constraints. From this, we see that the R joint imposes 5 constraints, the C joint imposes 4, and the E and S joints each impose 3 constraints. For the P joint, we are equating a pair of orthogonal unit vectors to another such pair, which together imposes three constraints. With the other two scalar equations, this brings the total number of constraints imposed by a P joint to 5. These models are not minimal with respect to the number of parameters involved, so in practice we usually write down equations in other ways.3 Nevertheless, this suffices to show that the lower-order pairs R, P, C, E, and S are, indeed, algebraic. Joints can be described either extrinsically in terms of the constraints they impose or intrinsically in terms of the freedoms they allow. The foregoing description is extrinsic. We have already seen how to model R joints intrinsically in the discussion of spatial 6R serial-link robots (see Section 3.1.2). Note that this was written in terms of 4 × 4 transforms Rz (θ) from equation (3.12), which is equivalent to the transform for a helical joint in equation (4.1) with zero pitch, ρ = 0. The lower-order pairs can be modelled intrinsically using matrices of the form cos θ − sin θ 0 a sin θ cos θ 0 b . (4.2) 0 0 1 c 0
0
0 1
R: Use (4.2) with a = b = c = 0, leaving θ as the joint variable. P: Use (4.2) with θ = a = b = 0, leaving c as the joint variable. 3
The Denavit–Hartenberg formalism is a minimal parametrization. (2000) or any modern kinematics textbook for a definition.
See McCarthy
Numerical algebraic geometry and algebraic kinematics
497
Table 4.1. Algebraic lower-order pairs: constraints and freedoms.
Constraints Freedoms
R
P
C
E
S
5 1
5 1
4 2
3 3
3 3
C: Use (4.2) with a = b = 0, leaving θ and c both as joint variables. E: Use (4.2) with c = 0, leaving θ, a, and b all as joint variables. S: Use
C 0 0 1
with C ∈ SO(3) as the joint freedom. In an intrinsic formulation, the link geometry is encoded in link transforms that are interposed between the joints, such as the matrices Aj in the formulation of the 6R kinematics in Section 3.1.2. If c is the number of independent constraints imposed by a joint, then the number of freedoms of body 2 relative to body 1 allowed by the joint is 6 − c, as summarized in Table 4.1. When modelling the joints with a low number of freedoms (R, P, C) it is usually more convenient to use an intrinsic formulation, while S joints are best modelled extrinsically. 4.3. Mechanism types, families, and spaces To fit a wide variety of kinematics problems into a common format, we need the definitions of a mechanism type and a mechanism family. Definition 4.1. A mechanism type is defined by the number of links, nL , and a symmetric nL ×nL adjacency matrix T whose (i, j)th element denotes the type of joint between links i and j, one of R, P, H, C, E, S, or ∅, where ∅ indicates no connection. By convention, all diagonal elements are ∅. (Each joint appears twice in the matrix: Ti,j = Tj,i are the same joint.) We assume here that the joints are limited to the lower-order pairs, but the list of possibilities could be extended. The enumeration of all possible mechanism types for each value of nL without double-counting mechanisms that are isomorphic under renumbering of the links is a problem in discrete mathematics. Choosing a prospective mechanism type is the first step in a mechanism design effort, and methods for guiding the enumeration of promising alternatives fall into the category of type synthesis. In this paper,
498
C. W. Wampler and A. J. Sommese
we assume that this crucial step is already done so that we begin with a mechanism type. Each mechanism type has an associated parameter space. We have seen in Section 4.2 one way to model each of the algebraic lower-order pairs, R, P, C, E, and S, in terms of feature points and unit vectors. The crossproduct space of all these geometric features forms a universal parameter space for the mechanism type. One may choose to model the joints in a more parsimonious way, but we assume that in the alternative model there still exists a parametrization for each joint and an associated parameter space for all the joints taken together. Definition 4.2. A universal mechanism family (T, Q) is a mechanism type T with an associated parameter space Q describing the geometry of the joints. We assume that Q is irreducible. If one has a parameter space Q that is not irreducible, each irreducible component should be considered to define a separate universal mechanism family. Definition 4.3. A mechanism family (T, Q ) is a subset of a universal mechanism family (T, Q) restricted to an irreducible algebraic subset Q ⊂ Q. Examples of the common sorts of algebraic restrictions that define a mechanism family include the condition that the axes of two R joints in a certain link must be parallel, perpendicular, or intersecting, etc. As a particular example, consider that the universal family of spatial 3R serial-link chains includes the family of 3R planar robots of Section 3.1.1 wherein the R joints are all parallel. One should appreciate that there can be subfamilies within families, and so on. For certain mechanisms, all points of the links move in parallel planes, hence the links move in SE (2) and the mechanism is said to be planar. In particular, a mechanism family wherein all joints are either rotational R with axis parallel to the z-direction or prismatic P with axis perpendicular to the z-direction is planar. Definition 4.4. The link space Z for an n link mechanism is SE (3)n−1 , where one of the links is designated as ground (p, C) = (0, I). Any of the isomorphic representations of SE (3) from Section 4.1 can be used as models of SE (3). If the mechanism family is planar, then Z = SE (2)n−1 in any of its isomorphic representations from Section 4.1. Definition 4.5. The mechanism space M of a mechanism family (T, Q) is the subset of Z × Q that satisfies the joint constraints. Proposition 4.6. If a mechanism family is built with only the algebraic joints R, P, C, E, and S, then its mechanism space is algebraic.
Numerical algebraic geometry and algebraic kinematics
499
Proof. Section 4.1 with the Appendix shows that Z is algebraic and Q is algebraic by assumption. That is, Z and Q are sets defined by algebraic equations. Section 4.2 shows that the algebraic joints impose algebraic constraints on the coordinates of Z and Q, and hence all the defining equations for M are algebraic. Definition 4.7. A mechanism is a member of a mechanism family (T, Q) given by a set of parameters q ∈ Q. 4.4. Kinematic problems in a nutshell In this section, we present an abstract formulation that summarizes all the main types of geometric problems that arise in kinematics. In the next section, we will discuss more concretely how to map a mechanism into this formulation. The key to our formulation is the following diagram: X π1 6 X ×Q
J K M Y H ˆ ˆ Jπ HHK 6 π4 M H
π2
? - Q
j H
π3
(4.3)
Y ×Q
The main elements of the diagram are four sets X, M, Y, Q and three maps J, K, πM . The four sets are as follows. • X is the input space of the mechanism. In robotics, it is usually called the ‘joint space’. Its coordinates are typically quantities that we command by controlling motors or other actuators. • Y is the output space, often called the ‘operational space’ in robotics. Its coordinates are the final output(s) we wish to obtain from the mechanism, such as the location of a robot’s hand. • Q is the parameter space of a family of mechanisms. It is the set of parameters necessary to describe the geometry of the joints in each link. Each point in Q is therefore a specific mechanism with designated link lengths, etc. The whole set Q constitutes a family of mechanisms, such as the set of all 6R robot arms, with the coordinates of Q representing all possible link lengths, etc. We assume that Q is an irreducible algebraic subset of some Cm , that is, it is an irreducible component of V(G) for some system of analytic functions G : Cm → Cm . If V(G) has more than one irreducible component, then each such component is considered a different family of mechanisms. • M is the mechanism space, which describes all possible configurations of the mechanism for all possible parameters. Let Z be the space of all possible locations of the links when they are disconnected. That
500
C. W. Wampler and A. J. Sommese
is, for an N -link spatial mechanism with one link designated as ground, Z = SE (3)N −1 . Then, M is the subset of Z ×Q where the link locations satisfy the constraints imposed by the joints between them. Let F : Z × Q → Cc be a set of polynomials defining the joint constraints. Then, M = V(F ) ∩ V(G) is an extrinsic representation of M . Each point (z, q) ∈ M is a specific mechanism q ∈ Q in one of its assembly configurations z ∈ Z. In some cases, it is more natural to describe M intrinsically via an irreducible set, say Θ, that parametrizes the freedoms of the joints of the mechanism, so that Z becomes Θ × SE (3)N −1 . We will use this, for example, to describe M for 6R serial-link robots. In such a representation, F includes the equations that define Θ along with the equations relating link poses to joint freedoms and equations for the constraints imposed by closing kinematic loops. Formulating such equations is part of the art of kinematics, and we will not delve into it in this paper beyond what is necessary to present specific examples. After choosing a representation for SE (3), and if present, for the joint freedom space Θ, the space Z is a subspace of some Euclidean space, Z ⊂ Cν , and z ∈ Z has coordinates z = (z1 , . . . , zν ). Three maps are defined on M , as follows. • J : M → X is the input map, which extracts from M the input values. The symbol J acknowledges that the inputs are usually a set of joint displacements. • K : M → Y is the output map, which extracts from M the output values. • πM : M → Q is a projection that extracts the parameters from M . It is the natural projection operator on Z × Q restricted to M given by πM : (z, q) → q. For the moment, we assume only that F, G, J, K are analytic so that the spaces X, M, Y are analytic sets. Although later we will restrict further to algebraic maps and algebraic sets, the analytic setting allows a somewhat wider range of mechanisms into the framework. Specifically, H joints are analytic but not algebraic. The commutative diagram is completed by defining Jˆ := (J, πM ) and ˆ K := (K, πM ) and the associated natural projections π1 , π2 , π3 , π4 . It should be understood that M characterizes a family of mechanisms, such as the family of spatial 6R serial-link robots, the family of planar fourbar linkages, or the family of Stewart–Gough platforms. Maps J and K are tailored to an application of the mechanism. For a four-bar function generator, J gives the input angle and K gives the output angle, while for a four-bar path generator, K gives instead the position of the coupler point.
Numerical algebraic geometry and algebraic kinematics
501
Using the diagram of equation (4.3), we may succinctly recast all the problems mentioned in the motivating examples of Section 3. The problems broadly classified into three types of problems: • analysis (mobility analysis, forward and inverse kinematics, workspace analysis), • synthesis (precision point problems), and • exceptional mechanisms. We describe each of these in more detail next. 4.4.1. Analysis In analysis problems, one has a specific mechanism, say q ∗ ∈ Q, and one wishes to analyse some aspect of its motion. Definition 4.8. The motion of a mechanism given by parameters q ∗ ∈ Q −1 ∗ (q ) = M ∩V(q −q ∗ ) where (z, q) in a family with mechanism space M is πM are coordinates in Z × Q. This can also be called the motion fibre over q ∗ . In the following, it is also convenient to define the inverses of J and K: J −1 (x) = {(z, q) ∈ M | J(z, q) = x}, K −1 (y) = {(z, q) ∈ M | K(z, q) = y}. These are defined for x ∈ X and y ∈ Y , respectively. In the set J −1 (x) for a particular x ∈ X, q is not fixed, so this inverse applies across a whole mechanism family. When we wish to address just one particular mechanism, q ∗ , we want to consider the inverse of Jˆ instead: ˆ q) = (x, q ∗ )}. Jˆ−1 (x, q ∗ ) = {(z, q) ∈ M | J(z, Similarly, we have ˆ q) = (y, q ∗ )}. ˆ −1 (y, q ∗ ) = {(z, q) ∈ M | K(z, K The basic problems in analysis are as follows. −1 ∗ (q ) into its irre• Motion decomposition of a mechanism breaks πM ducible components, often called assembly modes by kinematicians. (See Section 7 for a description of irreducible components.) The numerical −1 ∗ (q ) (Section 7.5) finds the dimension irreducible decomposition of πM and degree of each assembly mode and provides a set of witness points on each.
• Motion decomposition of a mechanism family breaks M into its irreducible components. If A ⊂ M is one of these components, then πM (A) ⊂ Q is the subfamily of mechanisms that can be assembled in that mode, dim πM (A) is the dimension of the subfamily, and dim A − dim πM (A) is the mobility of that mode.
502
C. W. Wampler and A. J. Sommese
• Mobility analysis seeks to find the degrees of freedom (DOFs) of the mechanism, which is equivalent to −1 ∗ (q ). Mobility := dim πM
(4.4)
As the dimension of an algebraic set is always taken to be the largest dimension of any of its components, this definition of mobility picks out the assembly mode (or modes) having the largest number of DOFs. There are simple formulas, known as the Gruebler–Kutzbach formulas, that correctly estimate the mobility for a wide range of mechanisms, and even more mechanisms submit to refined analysis based on displacement group theory, but there exist so-called ‘paradoxical’ mechanisms that have higher mobility than these methods predict. To handle all cases, one needs to analyse the equations defining M in more detail, taking into account that q ∗ may be on a subset of Q having exceptional mobility. • Local mobility analysis finds the mobility of a mechanism in a given assembly configuration. That is, given (z ∗ , q ∗ ) ∈ Z × Q, one wishes to find −1 ∗ (q ). Local mobility := dim(z ∗ ,q∗ ) πM
(4.5)
A mechanism can have more than one assembly mode, corresponding −1 ∗ (q ). The local mobility is the to the irreducible components of πM dimension of the assembly mode that contains the given configuration, z ∗ , or if there is more than one such mode, the largest dimension among these. • Forward kinematics seeks to find the output that corresponds to a given input x∗ for a mechanism q ∗ . That is, for x∗ ∈ X and q ∗ ∈ Q, one wishes to find (4.6) F K(x∗ , q ∗ ) := K(Jˆ−1 (x∗ , q ∗ )). Example: given the joint angles of a particular 6R serial-link robot, find its hand pose. • Inverse kinematics is similar to forward kinematics but goes from output to input. For y ∗ ∈ Y and q ∗ ∈ Q find ˆ −1 (y ∗ , q ∗ )). IK(y ∗ , q ∗ ) := J(K
(4.7)
Example: given the hand pose of a particular 6R serial-link robot, find all sets of joint angles that reach that pose. • Singularity analysis finds configurations where the maps lose rank. If we have found a motion decomposition of the mechanism, then for −1 ∗ (q ) there is an associated input space each assembly mode A ⊂ πM J(A) and an output space K(A). The input and output maps have
Numerical algebraic geometry and algebraic kinematics
503
Jacobian matrices ∂J/∂z and ∂K/∂z. Assume for the moment that A is a reduced algebraic set. (For example, V(x − y) is a reduced line in the (x, y)-plane, while the double line V((x − y)2 ) is non-reduced.) For generic points (z, q ∗ ) ∈ A, the Jacobian matrices have a constant rank, say rank[∂J/∂z(z, q ∗ )] = rJ and rank[∂K/∂z(z, q ∗ )] = rK . Then, there may be input and output singularities, as follows. ∗ Input singularities: {(z, q ∗ ) ∈ A | rank ∂J ∂z (z, q ) < rJ }. In the common case that ∂J/∂z is square and generically full rank, these are the special configurations where, to first order, the mechanism can move without any change in its input. ∗ Output singularities: {(z, q ∗ ) ∈ A | rank ∂K ∂z (z, q ) < rK }. In the common case that ∂K/∂z is square and generically full rank, these are the special configurations where, to first order, the mechanism can move without any change in its output.
If A is a non-reduced assembly mode, a kinematician might consider the whole set to be singular, as the defining equations for A are degenerate in the sense that the column rank of the Jacobian for the system of −1 ∗ (q ) is less than the codimension of the set equations that define πM A. Alternatively, one might wish to consider the input and output singularities of the reduction of A, which can be analysed via a deflation of A. (See Section 6.3 for a discussion of deflation.) • Workspace analysis seeks to find all possible outputs of a robot or −1 ∗ (q )). mechanism. Ignoring limits on the inputs, this is just the set K(πM The main concern in practice is the set of outputs for real assembly configurations, so letting AR denote the real points in an assembly mode A, the corresponding workspace is K(AR ). As we discussed in Section 3.1.1, the boundaries of the real workspace K(AR ) are given by the real output singularities. When joint limits are included, these may also induce boundaries in the workspace. If B ⊂ X is a joint limit boundary, then −1 ∗ (q )) may form part of the workspace boundary. PosiK(J −1 (B) ∩ πM tional workspaces and orientational workspaces fit into the same picture by reformulating K to output just position or orientation. Example 1: for a 6R serial-link robot, find all possible poses that the hand can reach. Example 2: for a given four-bar linkage with output defined as the position of its coupler point, find the coupler curve. Example 3: for a 6-SPS (Stewart–Gough) platform robot with limits on the leg lengths, find all possible poses of the moving platform.
504
C. W. Wampler and A. J. Sommese
The motion of a mechanism over the complexes contains its real motion, but the extraction of the real motion from the complex one can be difficult, all the more so as the dimensionality of the motion grows. See Section 11 for a discussion. The real motion may break up into smaller pieces than the complex one: for example, the coupler curve illustrated in Figure 3.4(b) has two real branches but they both belong to the same irreducible curve in the complexes. Some branches of a real motion may even have a smaller dimension than the complex motion that contains them. See Wampler, Hauenstein and Sommese (2011) for further discussion. The problems presented above mainly concern the geometry of a mechanism’s motion, where principally angles, positions, and poses enter the picture. As indicated by the questions of singularity analysis, one may also be concerned with differential relations between these, so that joint rates, linear velocity, and angular velocity may become objects of study, as might