Numerische Mathematik

Size: px
Start display at page:

Download "Numerische Mathematik"

Transcription

1 Numer. Math. (006) 105: DOI /s Numerische Mathematik Uniform preconditioners for a parameter dependent saddle point problem with application to generalized Stokes interface equations Maxim A. Olshanskii Jörg Peters Arnold Reusken Received: 15 September 005 / Published online: 7 September 006 Springer-Verlag 006 Abstract We consider an abstract parameter dependent saddle-point problem and present a general framework for analyzing robust Schur complement preconditioners. The abstract analysis is applied to a generalized Stokes problem, which yields robustness of the Cahouet-Chabard preconditioner. Motivated by models for two-phase incompressible flows we consider a generalized Stokes interface problem. Application of the general theory results in a new Schur complement preconditioner for this class of problems. The robustness of this preconditioner with respect to several parameters is treated. Results of numerical experiments are given that illustrate robustness properties of the preconditioner. Keywords Generalized Stokes equations Interface problem Two-phase flow Preconditioning Schur complement AMS Subject Classifications 65N15 65N 65N30 65F10 1 Introduction Let H 1 H and M be Hilbert spaces such that the identity I : H 1 H is a dense embedding. Let there be given continuous symmetric elliptic bilinear M. A. Olshanskii Department of Mechanics and Mathematics, Moscow State University, Moscow , Russia Maxim.Olshanskii@mtu-net.ru J. Peters A. Reusken (B) Institut für Geometrie und Praktische Mathematik, RWTH-Aachen, D-5056 Aachen, Germany reusken@igpm.rwth-aachen.de

2 160 M. A. Olshanskii et al. forms a : H 1 H 1 R, c : H H R and a continuous bilinear form b : H 1 M R that satisfies a standard infsup condition. Operators corresponding to these bilinear forms are denoted by A : H 1 H 1, C : H H and B : M H 1, respectively. In this paper we consider the following saddlepoint system: Find (u, p) H 1 M such that { Au + τcu + Bp = f B u = 0 (1.1) with f H 1 and a parameter τ 0. Similar abstract saddle point problems are thoroughly analyzed in the literature, e.g. [6, 11]. Important examples that fit in this general setting are the stationary Stokes equation (then τ = 0) and the so-called generalized Stokes problem, which results from an implicit time integration applied to a nonstationary Stokes equation (then τ is proportional to the inverse of the time step). Another (less standard) example, which motivated the research that led to the results presented in this paper, is the following generalized Stokes interface problem. Assume bounded Lipschitz subdomains 1 and of R d such that = 1, 1 =. The boundary between the subdomains is denoted by Ɣ = 1. Consider a problem of the following form: Find u and p such that div (ν(x)du) + τρ(x)u + p = f in k, div u = 0 in k, k = 1,. [u] =0, [σ(u, p)n] =g on Ɣ, u = 0 on. (1.) In this formulation we use standard notations: σ(u, p) = pi + ν Du is the stress tensor, Du = 1 ( u + ( u)t ) the rate of deformation tensor, n is a unit normal vector to Ɣ, [a] Ɣ = (a 1 a ) Ɣ. We assume piecewise constant viscosity (ν k > 0in k ) and density (ρ k > 0in k ). An important motivation for considering this type of generalized Stokes interface equations comes from twophase incompressible flows. Often such two-phase problems can be modeled by time-dependent Navier Stokes equations with discontinuous density and viscosity coefficients, [4,9,1,1,]. A localized force g on Ɣ can be used to describe the effect of surface tension. If in such a setting one has highly viscous flows then the nonstationary Stokes equations are a reasonable model problem. After implicit time integration one obtains a problem of the form (1.). A variational formulation of this problem results in a saddle point problem of the form (1.1). A Galerkin discretization appoach applied to (1.1) results in a finite dimensional saddle point problem. In the examples mentioned above one applies iterative methods for solving the matrix vector representation of such discrete problems, cf. [1] for a recent overview. Most of these iterative solvers use block preconditioners [8, 10, 14, 19, 3]. For such methods a good preconditioner of the Schur complement is crucial for the efficiency of the iterative solver. There

3 Uniform preconditioners to generalized Stokes interface equations 161 is an extensive literature on this issue of preconditioning the Schur complement. We mention results that are related to those presented in this paper. For the generalized Stokes problem one is interested in a preconditioner that is robust with respect to variation in both h (mesh size parameter) and τ. Such a preconditioner was introduced by Cahouet and Chabard in [8]. A proof of robustness of this preconditioner (w.r.t. τ and h) in a finite element setting is given in [5]. An analysis of robustness (w.r.t. τ) of this method in a continuous setting can be found in [13]. In a recent paper [15] an analysis is presented which shows how the construction of this Cahouet Chabard preconditioner is related to certain mapping properties of the gradient operator. This results in a unifying framework in which robust preconditioning of both the continuous and the discrete Schur complement can be analyzed. In [16] it is noted that an important assumption about the regularity of the stationary Stokes problem is implicitly used in the proof of Lemma 1 in [15] and not stated explicitly. We do not know any literature in which Schur complement preconditioners for the generalized Stokes interface problem (1.) are treated. A preconditioner for the stationary Stokes interface problem, i.e., τ = 0 in (1.), that is robust with respect to the size of the jump in ν across the interface is introduced and analyzed in [17,18]. The two main topics of this paper are the following. Firstly, we extend the analysis that is presented in [15] for the generalized Stokes problem to the general abstract saddle point problem (1.1), resulting in an abstract framework for analyzing the Schur complement S = B (A + τc) 1 B : M M.Inthis framework we obtain a natural preconditioner S for this Schur complement. We show that a spectral inequality S S that is uniform with respect to τ is easy to derive. For a uniform spectral inequality S S, however, we need a certain boundedness property for the orthogonal projection P : H 1 B(M) H 1 (Assumption 1). We apply the abstract theory to the continuous and to the discrete generalized Stokes problem. The preconditioner S then coincides with the Cahouet Chabard preconditioner. To prove the robustness with respect to τ we have to verify the boundedness property, which turns out to be a regularity property for the stationary Stokes problem that is very closely related to the hidden assumption in Lemma 1 in [15] (cf. [16]). The preconditioner S = S h is of the form S 1 h = I h + τ(b h C 1 h B h) 1, where I h is the identity on the pressure finite element space M h, and B h, C h are discrete analogons of the operators B, C in (1.1). We show that if M h H 1 ( ) holds, the operator S 1 h is uniformly spectrally equivalent to the simpler operator Ŝ 1 h = I h + τn 1 h,withn 1 h a solution operator of a discrete Neumann problem in the space M h. Secondly, we introduce and analyze a Schur complement preconditioner for the generalized Stokes interface problem (1.). This preconditioner is new and is obtained by applying the general abstract analysis to the variational formulation of the generalized Stokes interface problem. In this interface problem it is interesting (for two-phase flows with large differences in viscosity and density of the two phases) to have a preconditioner that is robust not only with respect to variation in τ but also with respect to the jumps in ν and ρ across

4 16 M. A. Olshanskii et al. the interface. From our general analysis applied to the continuous generalized Stokes interface problem it follows that a spectral inequality S S holds uniformly with respect to τ and the jumps in ν, ρ. For the spectral inequality S S we can only show uniformity with respect to τ. An equality S S that is uniform w.r.t. the jumps in ν and ρ, too, would hold if we could verify the boundedness assumption formulated in the abstract theory. It turns out, however, that this requires certain regularity results for the stationary Stokes interface problem that are not known in the literature. This issue of the dependence of the constant in the spectral inequality S cs on the jumps in ν and ρ is an open problem. The preconditioner for the continuous generalized Stokes interface problem has an obvious discrete analogon. For a standard finite element discretization (P P 1 Hood Taylor) we present results of numerical experiments that illustrate robustness properties of this preconditioner for the discrete Schur complement. The remainder of the paper is organized as follows. In Sect. we present a general analysis for the abstract problem (1.1). We introduce a preconditioner S for the Schur complement S and derive spectral inequalities S S S. A crucial assumption to obtain the lower spectral inequality uniformly in τ is introduced in Sect..5. In Sect. 3 we apply the general theory to the continuous generalized Stokes problem and we show that this crucial assumption corresponds to a regularity assumption for the stationary Stokes equations. In Sect. 4 we consider a finite element discretization of the generalized Stokes problem with an LBB stable pair of spaces and show how the general theory can be used to prove robustness of the Cahouet Chabard preconditioner. In Sect. 5 we apply the abstract analysis to the continuous generalized Stokes interface problem (1.) and derive a robust preconditioner for the Schur complement. This preconditioner has an obvious discrete analogon. In Sect. 6 results of numerical experiments are presented that illustrate certain robustness properties of this discrete Schur complement preconditioner. General analysis Consider Hilbert spaces H 1 and M. In Sect..1 we describe a parameter dependent saddle point problem in the pair of spaces H 1 M. We are interested in a uniform (w.r.t. variation in the parameter) preconditioner for the selfadjoint and positive definite Schur complement operator S : M M. In Sect.. we collect some results that will be used in our analysis. In Sect..3 a Schur complement preconditioner S is introduced. In Sects..4 and.5 we prove uniform spectral inequalities S S and S S, respectively. Apart from H 1 we will also use a Hilbert space H such that H 1 H and the identity I : H 1 H is a continuous dense embedding. We use (, ) H to denote a scalar product in a Hilbert space H and, H H for the duality pairing. The subscripts are omitted when these are obvious from the context.

5 Uniform preconditioners to generalized Stokes interface equations A parameter dependent saddle point problem and its Schur complement In this section we introduce a parameter dependent saddle point problem. Assume bilinear forms a : H 1 H 1 R, c : H H R and b : H 1 M. Related to these bilinear forms we make the following assumptions. a(, ) and c(, ) are symmetric and the following ellipticity, continuity and infsup conditions hold with strictly positive constants γ a, γ b, γ c : γ a u H 1 a(u, u), a(u, v) Ɣ a u H1 v H1 for all u, v H 1, (.1) γ c u H c(u, u), c(u, v) Ɣ c u H v H for all u, v H, (.) b(v, p) γ b p M sup, v H 1 v H1 b(v, p) Ɣ b v H1 p M for all v H 1, p M. (.3) For the analysis given below it is convenient to introduce corresponding linear mappings A : H 1 H 1, Au, v =a(u, v) for all u, v H 1, C : H H, Cu, v =c(u, v) for all u, v H, B : M H 1, Bp, v =b(v, p) for all p M, v H 1. The assumptions on the bilinear forms imply that γ a u H1 Au H Ɣ 1 a u H1 for all u H 1, (.4) γ c u H Cu H Ɣ c u H for all u H, (.5) γ b p M Bp H Ɣ 1 b p M for all p M. (.6) Note that the operator A : H 1 H 1 is selfadjoint: Au, v H 1 H = Av, u 1 H 1 H. 1 The operator C : H H is selfadjoint, too. Consider the following general saddle point problem: Given τ 0 and f H 1, find (u, p) H 1 M such that a(u, v) + τc(u, v) + b(v, p) + b(u, q) = f, v for all v H 1, q M. (.7) The problem (.7) can be rewritten in operator formulation: Find (u, p) H 1 M such that { Au + τcu + Bp = f, B (.8) u = 0. Standard analyses of saddle point problems (e.g., [6]) yield that this problem has a unique solution. The Schur complement S := B (A + τc) 1 B

6 164 M. A. Olshanskii et al. of the system is a selfadjoint positive definite operator S : M M. It defines a scalar product (and corresponding norm) on M: p S := Sp, p 1 = sup v H 1 Bp, v (A + τc)v, v 1, p M. (.9) Example 1 For the (nonstationary) Stokes system on a bounded connected Lipschitz domain R d we take the spaces with scalar products H 1 := H 1 0 ( ), H := L ( ), M = L 0 ( ) (u, v) H1 := ( u, v) L, (u, v) H := (u, v) L, (p, q) M := (p, q) L. The bilinear forms are a(u, v) := ( u, v) L, c(u, v) := (u, v) L, b(v, p) := (p,divv) L and the problem is as follows: Find (u, p) H 1 M such that { a(u, v) + τc(u, v) + b(v, p) = f, v for all v H1, b(u, q) = 0 for all q M. (.10) Recall the infsup inequality (Nečas inequality): sup v H 1 (div v, p) L v L γ b p L for all p M with γ b > 0. Using this one easily verifies that the conditions in (.1) (.3) are satisfied with γ a = Ɣ a = γ c = Ɣ c = Ɣ b = 1, γ b > 0 the constant from the infsup inequality.. Preliminaries In this section we derive some properties of the saddle point problem (.8) that will be used in the analysis of the Schur complement preconditioner. We use the concept of sums and intersections of vector spaces (cf. [3]). The idea of applying this concept in the analysis of Schur complement preconditioners is introduced in [15]. Let X, Y be compatible normed spaces, i.e., both X and Y are subspaces of some larger topological vector space Z. Then we can form their sum X + Y and intersection X Y. ThesumX + Y consists of all z Z such that z = x + y

7 Uniform preconditioners to generalized Stokes interface equations 165 with x X, y Y. The spaces X Y and X + Y are normed vector spaces with norms x X Y = ( x 1 X Y) + x (x X Y), ( z X+Y = inf x z=x+y X + y ) 1 Y (x X, y Y). If X and Y are complete then both X Y and X +Y are complete (Lemma.3.1 in [3]). A few properties that we will need further on are given in the following lemma. The space of bounded linear mappings X Y is denoted by L(X, Y). Lemma.1 Let X 1, X and Y 1, Y be pairs of compatible normed vector spaces and let T be a linear mapping on X 1 + X such that T L(X 1, Y 1 ) L(X, Y ). Then T : X 1 + X Y 1 + Y is bounded and T X1 +X Y 1 +Y ( T X 1 Y 1 + T X Y ) 1 (.11) holds. If X 1 and X are Hilbert spaces such that X 1 X is dense in both X 1 and X, then (X 1 X ) = X 1 + X holds and g (X1 X ) = g X 1 +X for all g (X 1 X ). (.1) Proof Proofs are given in [3]. Since these results are fundamental for our further considerations, we present an elementary proof to make the paper selfcontained. Consider x X 1 + X and an arbitrary decomposition x = x 1 + x, x 1 X 1, x X.ForTx = Tx 1 + Tx we have Tx Y1 +Y = inf Tx=y 1 +y ( y1 Y 1 + y Y ) 1 ( Tx 1 Y 1 + Tx Y ) 1 ( T X 1 Y 1 + T X Y ) 1 ( x1 X 1 + x X ) 1. Since the decomposition x = x 1 + x is arbitrary we obtain Tx Y1 +Y ( T X 1 Y 1 + T X Y ) 1 x X1 +X. Thus (.11) is proved. To prove the second part of the lemma consider arbitrary g X 1 + X and take x X 1 X. For an arbitrary decomposition g = g 1 + g with g 1 X 1, g X we have g, x (X 1 X ) (X 1 X ) = g 1, x X 1 X 1 + g, x X X and thus g, x (X1 X ) (X 1 X ) ( g 1 X 1 + g X ) 1 ( x X1 + x X ) 1.

8 166 M. A. Olshanskii et al. This yields g, x (X1 X ) (X 1 X ) inf g=g 1 +g ( g 1 X 1 + g X ) 1 x X1 X = g X +X x X 1 X. Therefore (X 1 X ) X 1 + X and g (X 1 X ) g X +X. Now take g (X 1 X ). Since X 1 X with scalar product (, ) X1 + (, ) X is a Hilbert space, there exists an element G X 1 X such that g, x (X1 X ) (X 1 X ) = (G, x) X1 + (G, x) X and g (X1 X ) = G X 1 X = ( G X 1 + G X ) 1. For i = 1, define ĝ i : x (G, x) Xi for all x X i. Then ĝ i X i, ĝ i X i = G Xi and g, x (X1 X ) (X 1 X ) = ĝ 1, x X 1 X 1 + ĝ, x X X. Because X 1 X is dense in X 1 and in X, both ĝ 1 and ĝ are uniquely defined by their values at x X 1 X. Hence we get g = ĝ 1 + ĝ X 1 + X and g X 1 +X = inf ( g1 g=g 1 +g X 1 + g ) 1 X ( ĝ 1 X 1 + ĝ 1 X ) = ( G X 1 + G ) 1 X = g (X1 X ) which completes the proof. In the remainder we assume τ > 0, unless stated otherwise. By τh we denote the space H with the scaled scalar product τ(, ) H. Using the previous lemma we obtain the following equivalence result for the Schur complement norm in (.9). Theorem. For all p M we have min{γ a, γ c } p S Bp H 1 +τ 1 H max{ɣ a, Ɣ c } p S. (.13) Proof For p M we have Bp (H1 τh ) = sup Bp, v (. (.14) v H 1 v H1 + τ v H ) 1 Due to the properties of A and C and the definition of S we get min{γ a, γ c } p S Bp (H 1 τh ) max{ɣ a, Ɣ c } p S for all p M.

9 Uniform preconditioners to generalized Stokes interface equations 167 Now we apply the result in (.1) to the case X 1 = H 1, X = τh. Note that H 1 τh = H 1 (this should be understood as equality of sets) and that the intersection is dense in τh. Hence, we get Bp (H1 τh ) = Bp H 1 +τ 1 H and thus the result is proved. Remark 1 For the nonstationary Stokes problem described in example 1 we obtain (Sp, p) L = p H 1 +τ 1 L for all p L 0 ( ). We introduce a subspace W of M: { } W = p M sup Bp, v < v H 1 v H ={p M Bp H }. (.15) (Recall that H 1 is dense in H ). We define the following functional on W: Bp, v p W := sup. (.16) v H Cv, v 1 The lemma below summarizes several useful properties of W. Lemma.3 The following holds: The identity I : W M is a continuous embedding. (.17) B(W) is a closed subspace of H. (.18) W defines a norm and (W, W ) is a Hilbert space. (.19) If dim(h )< then W = M (as sets) holds. (.0) Proof Note that for all p W we have Ɣ 1 c Bp H p W γ 1 c Bp H, (.1) p M γ 1 b Bp H 1 c Bp H cɣ 1 c p W (.) with c independent of p. Hence, W indeed defines a norm on W and I : W M is a continuous embedding. Let (Bp n ) n 1 be a Cauchy-sequence in B(W) = B(M) H w.r.t. H. Since H is complete there exists a w H such that

10 168 M. A. Olshanskii et al. lim n Bp n w H = 0. We have assumed that H 1 is continuously embedded in H, therefore convergence in H implies convergence in H 1 and thus lim n Bp n w H = 0. Due to (.6) B(M) is a closed subspace of H 1 1 and thus w B(M) holds. We conclude that w B(M) H = B(W) and thus B(W) is a closed subspace of H. Let (p n ) n 1 be a Cauchy-sequence in (W, W ). From (.1) it follows that (Bp n ) n 1 is a Cauchy-sequence in (B(W), H ). This space is closed and thus there exists p W such that lim n B(p p n ) H = 0. Using (.1) we obtain lim n p p n W = 0 and thus (W, W ) is a Banach space. It remains to define a scalar product on W that induces W. For this we need the adjoint of B : W H. Recall that B : H 1 M is the adjoint of B : M H 1, i.e., B v, p M M = Bp, v H 1 H 1. To distinguish from this adjoint we use the notation B for the adjoint of B : W H. Hence, B v, p W W = Bp, v H H for all v H, p W. Using this we define S : W W by and we get S := B C 1 B (.3) p W = S p, p W W for all p W. (.4) Thus the scalar product on W that corresponds to W is given by (p, q) W = S p, q W W. From dim(h )< and the assumption that the embedding H 1 H is dense it follows that H 1 = H (with possibly different norms) and that g H 1 iff g H. Using that Bp H 1 for all p M we conclude that W = M holds. In our analysis we will need the orthogonal projection on B(M) in H 1.This projection, which is well-defined since B(M) is a closed subspace of H 1,is denoted by P. The following lemma gives another characterization of this projection P. Lemma.4 Let I 1 : H 1 H 1 be the Riesz isomorphism, i.e., I 1u, v =(u, v) H1 for all u, v H 1.Forf H 1 let (u, p) H 1 M be the unique solution of I 1 u + Bp = f, B u = 0. Define the solution operator S 1 : H 1 Mbyf p. Then P = BS 1 holds. Proof For arbitrary f H 1 we have BS 1f = Bp B(M) and for any q M: (f Bp, Bq) H 1 = I 1 1 (f Bp), Bq H 1 H 1 = u, Bq H 1 H 1 = B u, q M M = 0 and thus the result holds.

11 Uniform preconditioners to generalized Stokes interface equations Schur complement preconditioner We introduce the norm p M+τ 1 W = inf ( p q M + τ 1 q ) 1 W. (.5) q W From the analysis below (Sects..4 and.5) it follows that (under a certain assumption) this norm is uniformly (w.r.t. τ) equivalent to p S = Sp, p 1.It is not obvious how to use p M+τ 1 W to construct a feasible preconditioner for the Schur complement S. In this section we address this issue. Let I M : M M be the Riesz isomorphism. Because the identity I : W M is a continuous embedding we have I M (W) W. The mapping I M : W W is denoted by I W (note that in general this is not the Riesz-isomorphism in W). Theorem.5 Define S : M M by S = I M I M (I W + τ 1 S ) 1 I M with S defined in (.3). Then S is selfadjoint and positive definite and p M+τ 1 W = Sp, p for all p M. (.6) Proof By assumption the operator C 1 : H H is selfadjoint, therefore S is selfadjoint as well. With the help of elementary variational analysis we see that the infimum on the right handside in (.5) is attained for q W that satisfies ( q p, ξ) M + τ 1 ( q, ξ) W = 0 for all ξ W. This can be reformulated in operator notation, using the definition of the W- scalar product: I M ( q p) + τ 1 S q, ξ W W = 0 for all ξ W. (.7) Note that I M p M W holds. The solution q W of (.7) is given by (I W + τ 1 S ) q = I M p and thus q = (I W + τ 1 S ) 1 I M p. A straightforward computation yields p M+τ 1 W = p q M + τ 1 q W = (p q, p) M = I M (p q), p. Substituting q = (I W + τ 1 S ) 1 I M p, we obtain (.6). From (.6) it follows that S is positive definite. In the setting of preconditioning one is interested in the inverse of the preconditioner. By a straightforward computation one can check that the inverse

12 170 M. A. Olshanskii et al. S 1 : M M of S is given by S 1 := I 1 M + τs 1. (.8).4 Uniform spectral bound S S The proof of a spectral bound S c S with a constant c independent of τ is very simple. Theorem.6 Define Ɣ s = Proof From Theorem. we get Ɣ b +Ɣ c min{γ a,γ c }. For all p M we have Sp, p Ɣ s Sp, p. 1 Sp, p min{γ a, γ c } Bp H 1 +τ 1 H. From (.5), (.6) and the definition of W we have B M H 1 Ɣ b, B W H Ɣ 1 c and thus from (.11) we obtain Hence, using theorem.5, we obtain Bp H 1 +τ 1 H (Ɣ b + Ɣ c) 1 p M+τ 1 W. Bp H 1 +τ 1 H (Ɣb + Ɣ c) Sp, p..5 Uniform spectral bound S S The derivation of a spectral inequality S ĉs with a constant ĉ > 0 independent of τ turns out to be more delicate than the bound S c S that is shown in Theorem.6. We present an analysis which requires an assumption on the orthogonal projection P : H 1 B(M) (cf. Sect..). This crucial assumption is as follows. Assumption 1 Assume that P : H H and that there exist constants c P 1, d P 0 such that Pf H c P ( ) f H + d P (I P)f H 1 for all f H. (.9)

13 Uniform preconditioners to generalized Stokes interface equations 171 Lemma.7 If Assumption 1 holds, then we have B(W) = P(H ). (.30) Proof Take p W. Then Bp H H 1 and with the solution operator S as in Lemma.4 we get S 1 Bp = p. This yields PBp = BS 1 Bp = Bp and thus Bp P(H ), which proves B(W) P(H ). Take Pf P(H ). Then Pf H and Pf = BS 1 f = Bp with p := S 1 f M. Thus Pf B(W), i.e., P(H ) B(W). Hence, the result (.30) holds. Below we use the Hilbert spaces (B(M), H ) and (B(W), 1 H ). Lemma.8 Let Assumption 1 hold. Then for all p M we have Bp B(M)+τ 1 B(W) c P Bp H 1 +τ 1 H for all τ d P. Proof We use the notation f := Bp. Note that ( f H 1 +τ 1 H = inf f w w H H 1 + τ 1 w 1 H ). Take an arbitrary w H.Usingf B(M) we get f w H 1 = P(f w) + (P I)w H 1 = Pf Pw H 1 + (P I)w H 1 = f Pw H 1 + (I P)w H 1. From Pw H c P ( w H + d P (I P)w H 1 ) we get w H c P Pw H d P (I P)w H 1. Hence we obtain, using τ d P and c P 1, ( inf f w w H H 1 + τ 1 w 1 ( H ) inf f Pw w H H 1 + τ 1 c P Pw H + (1 τ 1 d P ) (I P)w H 1) 1 ( inf f Pw w H H 1 + τ 1 c ) 1 P Pw H c 1 P c 1 P inf w H ( f Pw H 1 + τ 1 Pw ) 1 H inf f = f 1 + f f 1 B(M), f B(W) = c 1 P f B(M)+τ 1 B(W) ( f1 H 1 + τ 1 f ) 1 H and thus the result is proved.

14 17 M. A. Olshanskii et al. Remark Consider the finite dimensional case dim(h )<. We then have H 1 = H, H 1 = H and W = M (where "=" allows different norms in the spaces). We can apply a symmetry argument involving an alternative to the assumption 1. Let ˆP : H B(W) be the orthogonal projection on B(W) in H. Assume that c P 1, ˆd P 0 are such that ˆPf H 1 c P ( f H 1 + ˆd P (I ˆP)f H ) for all f H. (.31) Lemma.8 then yields, for all p M: Bp B(W)+τ 1 B(M) c P Bp H +τ 1 H 1 for all τ ˆd P which is equivalent to Bp B(M)+τ 1 B(W) c P Bp H 1 +τ 1 H for all τ ˆd P. (.3) This will be used in the analysis of the finite element discretization in Sect. 4. γb Theorem.9 Let assumption 1 hold. Define γ s := γ c c P (γ b +γ. For all c) max{ɣ a,ɣ c } p M we have γ s Sp, p Sp, p for all τ d P. (.33) Proof From (.5), (.6) and the definition of W we also have and thus Hence, B 1 g M+τ 1 W B 1 B(M) M γ 1 b, B 1 B(W) W γ 1 c (γ b + γ 1 c ) 1 g B(M)+τ 1 B(W) for all g B(M). γ b γ c γ b + γ c p M+τ 1 W Bp B(M)+τ 1 B(W) for all p M Using Lemma.8 we obtain γ b γ c c P (γ b + γ c) p M+τ 1 W Bp H 1 +τ 1 H for all τ d P

15 Uniform preconditioners to generalized Stokes interface equations 173 and combining this with Theorem.5 and Theorem. proves the inequality in (.33). Remark 3 Consider the finite dimensional setting as in Remark and assume that besides Assumption 1 also (.31) holds. Then (.3) holds, and a slight modification of the last step in the proof of Theorem.9 then yields, for all p M: γ s Sp, p Sp, p τ (0, ˆd P ] [d P, ). (.34) The main result of the general analysis is the following. Corollary.10 Suppose Assumption 1 holds. The following inequalities hold for any p M: γ s Sp, p Sp, p Ɣ s Sp, p for all τ d P. (.35) Proof Direct consequence of Theorems.6 and.9. Remark 4 Consider the finite dimensional case dim(h )<. From remark 3 it follows that if the assumptions 1 and (.31) hold, then the equivalence result in (.35) holds for all τ (0, ˆd P ] [d P, ). As a final result in this section we give a simple criterion that will be used in the applications in the next sections to show that Assumption 1 holds. Lemma.11 Let S 1 : H 1 M be the solution operator from Lemma.4. Assume that there is a subspace W M with norm W such that both S 1 : H W and B : W H are bounded, i.e., S 1 f W c 1 f H f H, Bp H c p W p W, then Assumption 1 is fulfilled with c P = c 1 c,d P = 0. Proof The proof immediately follows from P = BS 1 and Pf H = BS 1 f H c S 1 f W c c 1 f H for all f H 3 Application to the continuous generalized Stokes problem In this section we apply the above abstract analysis to the generalized Stokes problem. The spaces and bilinear forms used in the variational problem are as in example 1. It was noted that we have the properties (.1) (.3), with γ a = Ɣ a = γ c = Ɣ c = Ɣ b = 1, γ b > 0 the constant from the infsup inequality. For the operators A, B, B, C corresponding to the bilinear forms we use the (usual) notation A =:, B :=, B =: div, C =: I.

16 174 M. A. Olshanskii et al. We now consider Assumption 1. We use the criterion given in Lemma.11. Note that is the Riesz isomorphism H 1 0 ( ) H1 0 ( ) =: H 1. Thus for f H 1 the solution p = S 1 f,withs 1 from lemma.4, satisfies the weak formulation of the stationary Stokes problem: u + p = f, div u = 0, u = 0. (3.1) In the following lemma it is shown that H -regularity of the Stokes problem implies that Assumption 1 holds. Lemma 3.1 Assume that the domain is such that the Stokes problem (3.1) is H -regular, i.e., there is a constant c R such that for any f L ( ) the solution (u, p) is an element of H ( ) d H 1 ( ) and satisfies u H ( ) + p L c R f L. (3.) Then Assumption 1 is satisfied with c P = c R and d P = 0. Furthermore, we have W = H 1 ( ) L 0 ( ) and p W = p L. Proof We apply Lemma.11 with W := H 1 ( ) L 0 ( ) and norm = p W ( p, p) L. Due to the regularity assumption we have S 1 f W = p L c R f L. Furthermore, for p W we have Bp H = p L = p W. Thus the assumptions in Lemma.11 hold with c 1 = c R, c = 1. It follows that Assumption 1 is fulfilled. Definition (.15) of W takes the form W := {p L 0 p L }. Thus W = H 1 ( ) L 0 ( ) = W. Finally by the definition of the W-norm we have for p W: p W := sup v H Bp, v Cv, v 1 ( p, v) = sup L v L v L = p L. Now consider the Schur complement of the generalized Stokes problem: S := div (τi ) 1 (3.3) We identify L 0 ( ) with its dual. Then S : L 0 ( ) L 0 ( ) and, M M = (, ) L. If the stationary Stokes problem is H -regular our abstract theory can be applied, with d P = 0 in assumption 1, and we have a uniform equivalence result given in Corollary.10. This yields the following main result of this section. Theorem 3. Assume that the domain R d is such that the Stokes problem (3.1) is H -regular. Denote by 1 N : L 0 ( ) H1 ( ) L 0 ( ) the solution

17 Uniform preconditioners to generalized Stokes interface equations 175 operator of the following Neumann pressure problem: Given f L 0 ( ) find p H 1 ( ) L 0 ( ) such that ( p, q) L = (f, q) L, q H 1 ( ) L 0 ( ). Define S 1 = I τ 1 N. Then S 1 : L 0 ( ) L 0 ( ) is selfadjoint and positive definite, and for all p L 0 ( ) and all τ 0 the following holds: with γ s = γ b c R (γ b +1), Ɣ s =. γ s ( Sp, p) L (Sp, p) L Ɣ s ( Sp, p) L. Proof We apply Corollary.10. In the setting here we have W = H0 1( ) L 0 ( ), M = L 0 ( ) = M. The mapping S : M M is defined by, cf. (.8), S 1 = I 1 + τs 1 L = I + τs 1 with S = B C 1 B.Forf M we have w = S 1 f W iff B C 1 Bw, q W W = (f, q) L q W Bq, C 1 Bw L L = (f, q) L q W q, I 1 w L L L = (f, q) L q W ( w, q) L = (f, q) L q W and thus S 1 is equal to the Neumann solution operator 1 N. Hence S 1 = I+ τs 1 = I τ 1 N. The values for the spectral bounds follow from Corollary.10 and from γ a = Ɣ a = γ c = Ɣ c = Ɣ b = 1, and c P = c R. 4 Application to finite element discretization of the generalized Stokes problem In this section we apply the abstract analysis of Sect. to a finite element discretization of the generalized Stokes problem (.10). Let V h M h H 1 0 ( ) L 0 ( ) be a pair of conforming finite element spaces. We assume the LBB stability condition: sup v h V h (div v h, p h ) L v h L γ b p h L for all p h M h with a constant γ b > 0 independent of h. We also assume a global inverse inequality and an approximation property: v h L c inv h 1 v h L v h V h inf (u v h ) L + inf p q h L Ch( u H + p H 1) v h V h q h M h

18 176 M. A. Olshanskii et al. for all u H ( ) d H 1 0 ( ), p H1 ( ). In the setting of the general analysis we take the spaces H 1 = (V h, (, ) L ), H = (V h, (, ) L ), M = (M h, (, ) L ). In this finite dimensional case we have W = M as sets (note, however, that in general W = M ). The bilinear forms are the same as in Sect. 3. The operators corresponding to these bilinear forms are denoted by A h, C h, B h. As in the continuous case we identify M h with its dual M h. Thus we have, M M =, W W = (, ) L and A h : V h V h, A hu h, v h =a(u h, v h ) for all u h, v h V h, C h : V h V h, C hu h, v h =c(u h, v h ) for all u h, v h V h, B h : M h V h, B h p h, v h =b(v h, p h ) for all p h M h, v h V h, B h : V h M h, (B h v h, p h ) L = b(v h, p h ) for all p h M h, v h V h. The discrete generalized Stokes problem is as follows: given f h (u h, p h ) V h M h such that A h u h + τc h u h + B h p h = f h, B h u h = 0. V h find (4.1) The corresponding Schur complement is given by S h = B h (A h + τc h ) 1 B h : M h M h. Application of the general analysis yields the following main result of this section. Theorem 4.1 Assume that R d is such that the continuous stationary Stokes problem (3.1) is H -regular. With I h the identity operator on M h define S 1 h = I h + τ(b h C 1 h B h) 1. Then the following inequalities hold for any p h M h with c d > 0 independent of τ and h: c d ( S h p h, p h ) L (S h p h, p h ) L ( S h p h, p h ) L. Proof The properties (.1) (.3) hold with γ a = Ɣ a = γ c = Ɣ c = Ɣ b = 1, and γ b > 0 the constant from the LBB condition. We now treat Assumption 1. Let P h : H 1 B h(m h ) be the orthogonal projection on B h (M h ) in H 1. From Lemma.4 we have P h = B h S 1,h, where (for f h H ) S 1,hf h = p h is the solution operator corresponding to the discrete stationary Stokes problem A h u h + B h p h = f h, B h u h = 0. (4.)

19 Uniform preconditioners to generalized Stokes interface equations 177 The functional f h can be extended to f L ( ) with f, v h = (f h, v h ) for all v h V h and f L ( ) = f h H (recall, H = (V h, L )). Consider the continuous stationary Stokes problem with right hand side f: Au + Bp = f, B u = 0. (4.3) Comparison of (4.) and (4.3) yields a(u u h, v h ) + b(v h, p p h ) = 0 for all v h V h. Using the H -regularity, the inverse inequality and the approximation property of the finite element spaces we obtain b(v h, p h ) P h f h H = B h S 1,h f h H = B h p h H = sup v h V h v h L b(v h, p) a(u u h, v h ) sup + sup v h V h v h L v h V h v h L p L + (u u h ) L f h H + c (u u h ) L h 1 f h H + c u H ( ) c f h H. v h sup L v h V h v h L Hence, Assumption 1 holds with d P = 0 and a constant c P independent of h. Application of Corollary.10 proves the result. Both in the analysis of the continuous generalized Stokes problem (Theorem 3.) and of its finite element discretization (Theorem 4.1) we need a H -regularity assumption. We now show, that for a certain range of τ values a regularity assumption can be avoided. Theorem 4. Let S 1 h = I h + τ(b h C 1 h B h) 1 be as in Theorem 4.1. There exist positive constants c 1, c, independent of h and τ, such for all p h M h the following holds: γ s ( S h p h, p h ) L (S h p h, p h ) L Ɣ s ( S h p h, p h ) L for all τ [0, c 1 ] [c h, ), with γ s = γ b (γ b +1), Ɣ s =. Proof We use the result given in Remark 4. The properties (.1) (.3) hold with γ a = Ɣ a = γ c = Ɣ c = Ɣ b = 1, and γ b the constant from the LBB condition.

20 178 M. A. Olshanskii et al. Let P h : H 1 B h(m h ) be the orthogonal projection on B h (M h ) in H 1.Using the inverse inequality we get, for f h H : P h f h H f h H + (I P h )f h H = f h ((I P h )f h, v h H + sup ) v h V h v h L f h H + c ((I P h )f h, v h inv h sup ) v h V h v h L = ( f h H + c inv h (I P h )f h H 1). L L Thus Assumption 1 holds with c P = and d P = c inv h 1. Let ˆP h : H B h(m h ) be the orthogonal projection on B h (M h ) in H.Using the Friedrichs inequality, v h L c F v h L, we obtain, for f h H 1 : ˆPf h H 1 f h H 1 + (I ˆP h )f h H 1 ( f h H 1 + c F (I ˆP h )f h H ). Thus (.31) holds with c P =, d P = c F. Using the result in Remark 4 we obtain the equivalence result with spectral constants γ s = γ b (γb +1), Ɣ s =. Remark 5 The equivalence result for the Schur complement operator S h : M h M h has an obvious analogon if we use matrix representations. Assume that we have chosen (nodal) bases in V h and M h. The coefficient vectors of u h and p h in these bases are denoted by ū h, p h, respectively. The Euclidean scalar product in R n is denoted by,.letq h be the mass matrix in M h. The matrix representations of A h, C h, B h are defined by A h ū h, v h = ( u h, v h ) L for all u h, v h V h, C h ū h, v h = (u h, v h ) L for all u h, v h V h, B h p h, v h = (div v h, p h ) L for all p h M h, v h V h. The discrete generalized Stokes problem has a matrix-vector formulation with matrix ( ) Ah + τc h B h B T h 0 and thus the Schur complement matrix is S h = B T h (A h + τc h ) 1 B h.using ( B h C 1 h B hp h, p h )L = sup b(v h, p h ) B h p h, v h v h V h v h = sup L v h R n C h v h, v h = B T h C 1 h B h p h, p h for all p h M h,

21 Uniform preconditioners to generalized Stokes interface equations 179 it follows that the Schur complement preconditioner S h given in Theorems 4.1 and 4. has the matrix representation S 1 = Q 1 h + τ(bt h C 1 h B h) 1. The operator B h C 1 h B h in the definition of S h corresponds to a mixed discretization of the saddle point formulation of a Neumann problem: Find u H 0 (div ), p L 0 ( ) such that u + p = 0, div u = g, u n = 0. This mixed discretization is convenient when the discrete pressure is not continuous, i.e. M h H 1 ( ). On the other hand, if M h H 1 ( ), then one may wish to use a conforming finite element discretization of the Neumann problem and thus obtain a discrete analogon of the preconditioner given for the continuous case in Theorem 3.. This is treated in Sect Schur complement preconditioner for the case M h H 1 ( ) Assume M h H 1 ( ). LetN 1 h : M h M h, N 1 h g h = p h be the solution operator of the discrete Neumann problem in M h : ( p h, q h ) L = (g h, q h ) L for all q h M h. Note that (N h p h, p h ) = p h L for all p h M h. We define S h,n : M h M h by S 1 h,n := I 1 h + τn 1 h. This preconditioner has been proposed in [8] and analyzed in [5]. The preconditioner S h,n is uniformly (w.r.t. h and τ) spectrally equivalent to S h from Theorem 4.1 iff N h is, uniformly in h, spectrally equivalent to B h C 1 h B h.note that, for all p h M h, (B h C 1 h B (p h,divv h h p h, p h ) L = sup ) L v h V h v h p h L = (N h p h, p h ) L L Hence, S h,n is uniformly spectrally equivalent to S h iff (p h,divv h ) sup L v h V h v h L γ w p h L for all p h M h (4.4) holds with γ w > 0, independent of h. This modified stability condition (also called weak inf sup condition) can be found at several places in the literature,

22 180 M. A. Olshanskii et al. e.g., [,7,4]. In [] a proof of this result for P 1 isop P 1 and for the Hood Taylor P P 1 pair is given for the two-dimensional case. The approach in [] can probably be extended to the three-dimensional case. Because the weak inf-sup condition in (4.4) is essential for the analysis in this paper we decided to include an elementary proof for P P 1 Hood Taylor finite elements in a d-dimensional domain, with d =, 3. We assume that the family of triangulations {T h } is regular but not necessarily quasi-uniform. Lemma 4.3 For R d,d=, 3, let{t h } be a regular family of triangulations consisting of d-simplices. Assume that every simplex has at least one vertex which is not on. Then the Hood Taylor P P 1 pair of finite element spaces satisfies (4.4). Proof The Hood Taylor P P 1 pair is denoted by (V h, M h ). Take q h M h, q h = 0. The constants used below are independent of T h {T h } and of q h. The set of edges in T h is denoted by E. This set is partitioned in edges which are in the interior of and edges which are part of : E = E int E bnd.for every E E, m E denotes the midpoint of the edge E. Every E E int with endpoints a 1, a R d is assigned a vector t E := a 1 a.fore E bnd we define t E := 0. Since q h is continuous piecewise linear the function x t E q h (x) is continuous across E, fore E int. We define A unique w h V h is defined by ˆt E := t E 1 t E (ˆt E := 0ifE E bnd ), w E := (ˆt E q h (m E ) )ˆt E for E E. w h (x i ) = { 0 if x i is a vertex of T T h, w E if x i = m E for E E. The set of edges of T T h is denoted by E T. By using quadrature we see that for any p P which is zero at the vertices of T we have T p(x) dx = T d 1 E E T p(m E ). We obtain q h div w h dx = q h w h dx = ( q h ) T T T h = T T h T d 1 ( q h) T = T T h T d 1 E E T T E E T w h (m E ) (ˆt E q h (m E ) ). w h dx (4.5)

23 Uniform preconditioners to generalized Stokes interface equations 181 Using the fact that ( q h ) T is constant and for each T at least two independent nonzero vectors ˆt E exist, one easily checks that c q h L (T) T (ˆt E q h (m E ) ) c qh L (T), c > 0. E E T Combining this with (4.5) we get q h div w h dx C q h L (T) = C q h L. (4.6) T T h Let E ˆT be the set of edges of the unit d-simplex. In the space { ˆv P ˆv is zero at the vertices of ˆT } the norms ˆv L ( ˆT) and ( E E ˆv(m E ) ) 1 are equivalent. ˆT Using this componentwise for the vector-function ŵ h := w h F, withf the affine mapping such that F( ˆT) = T, we get w h L (T) C T ŵ h L ( ˆT) C T ŵ h (m E ) = C T E E ˆT Summation over all simplices T yields E E T w E. w h L C T w E = C T T h E E T T T h T C T T h q h L (T) = C q h L. (ˆt E q h (m E ) ) E E T (4.7) From (4.6) and (4.7) we obtain (q h,div( w h )) L w h L C q h L with a constant C > 0 independent of q h and of T h {T h }. 5 A Stokes interface problem In this section we consider a generalized Stokes interface problem. Assume bounded Lipschitz subdomains 1 and of such that = 1, 1 =. The interface between the subdomains is denoted by Ɣ = 1. The problem we consider is as follows: Find u and p such that

24 18 M. A. Olshanskii et al. div (ν(x)du) + τρ(x)u + p = f in k, (5.1) div u = 0 in k, k = 1,. (5.) [u] =0, [σ(u, p)n] =g on Ɣ, (5.3) u = 0 on. (5.4) In this formulation we use standard notations: σ(u, p) = pi+ ν Du is the stress tensor, Du = 1 ( u + ( u)t ) the rate of deformation tensor, n is a unit normal vector to Ɣ, [a] Ɣ = (a 1 a ) Ɣ. We assume piecewise constant viscosity and density. A localized force term g occurs, for example, in models that take surface tension effects into account, cf. [1,]. Suitable scaling can be used to ensure that viscosity and density are equal to one in 1. Hence, we assume ν = { { 1 in 1 1 in 1, ρ =. (5.5) ν > 0 in ρ > 0 in The weak formulation leads to a saddle point problem as in (.7), (.8): find u, p H 1 0 ( ) L 0 ( ) such that a ν (u, v) + τc ρ (u, v) + b(v, p) + b(u, q) = f (v) for all v H 1 0 ( ), q L 0 ( ), (5.6) with a ν (u, v) := ν tr(dudv) dx, c ρ (u, v) := (ρu, v) L, b(v, p) := (p,divv) L, f, v := (f, v) L + g v ds. Ɣ In view of the general analysis it is natural to introduce the following Hilbert spaces: H 1 = H1 0 ( ), with v H 1 := ν tr ( (Dv) ) dx, H = { } L ( ), with v H := ρ 1 v L. Due to Korn s inequality H1 defines a norm on H 1 0 ( ). Related to this norm we need a uniform (w.r.t. ν) equivalence result that is proved in [17], Lemma 6.1.

25 Uniform preconditioners to generalized Stokes interface equations 183 This result is as follows. Assume that one of the following conditions is satisfied: meas( k ) > 0 for k = 1,, (5.7) meas( 1 ) > 0 and ν C. (5.8) Then there exists a constant c > 0 independent of ν such that c ν 1 v L v H1 ν 1 v L for all v H 1. (5.9) Before we introduce the (pressure) space M we recall a result from [18] that we need in the analysis below. Let p be the piecewise constant function p = { 1 1 on 1, 1 on. (5.10) Since ( p,1) L = 0, we have p L 0 ( ). Consider the one-dimensional subspace P 0 := span{ p} of L 0 ( ) and an L -orthogonal decomposition L 0 ( ) = P 0 P0. For p L 0 ( ) we use the notation p = p 0 + p 0, p 0 P 0, p 0 P 0. (5.11) One easily checks that P0 ={p L 0 ( ) (p,1) L ( 1 ) = (p,1) L ( ) = 0 }, (5.1) Using this splitting we can define an appropriate norm on L 0 ( ): M = {L 0 ( ), with p M := ( p 0 L + ν 1 p 0 L ) 1 }. The scalar product corresponding to M is denoted by (, ) M. In [18], Lemma 1 and Theorem 1, the following results are proved. There exist constants Ĉ and ĉ > 0 independent of ν such that sup v H 1 0 (div v, p) L Ĉ ν 1 v L p M for all v H 1, p M, (5.13) (div v, p) L ĉ p ν 1 M for all p M. (5.14) v L

26 184 M. A. Olshanskii et al. We identify L ( ) with its dual and then have H 1,with f H = sup 1 v H 1 0 H 1 = f, v v H1 } H {L = ( ),with v H := ρ 1 v L M = {L 0 ( ), with p M := ( p 0 L + ν 1 p 0 L ) 1 }. With these spaces H 1 and M the properties (.1) (.3) can be shown to hold. Lemma 5.1 Assume that (5.7) or (5.8) is satisfied. The properties (.1) (.3) hold with γ a = Ɣ a = γ c = Ɣ c = 1 and constants Ɣ b, γ b > 0 independent of ν and ρ. Proof From a ν (u, u) = u H 1 we get property (.1) with γ a = Ɣ a = 1. Due to c ρ (u, u) = u H property (.) holds. Using (5.9) and (5.13), we get (div v, p) L Ĉ ν 1 v L p M Ĉ c 1 v H1 p M and thus the upper bound in (.3) with Ɣ b = Ĉ c 1. Using (5.9) and (5.14), we obtain (div v, p) sup L v H 1 v H1 sup v H 1 (div v, p) L ν 1 v L ĉ p M and thus the lower bound in (.3). Because ρ is not used in the definitions of H 1 and M the constants Ɣ b and γ b are independent of ρ. The norm H is equivalent to the standard L -norm. Hence, the space W ={p M Bp H } is the same as the one for the generalized Stokes problem in Sect. 3: W = H 1 ( ) L 0 ( ), with norm p W = sup v H Bp, v v H = ρ 1 p L. (5.15) The Schur complement S ν,ρ : L 0 ( ) L 0 ( ) corresponding to this Stokes interface problem is characterized by (S ν,ρ p, p) 1 L = sup v H 1 0 ( ) We take the preconditioner from Theorem.5: (p,divv) L ( aν (v, v) + τc ρ (v, v) ). (5.16) 1 ( S ν,ρ p, p) 1 = p L M+τ 1 W = inf ( p q M + τ 1 ρ 1 ) 1 q q W L. (5.17)

27 Uniform preconditioners to generalized Stokes interface equations 185 This preconditioner can be characterized using a Neumann solution operator by applying a similar approach as in Theorem 3.. We can apply the general analysis of Sect..4 to derive a uniform spectral bound S S. This is summarized in the following theorem. Theorem 5. Assume that one of the conditions (5.7) or (5.8) is satisfied. Denote by 1 ρ : L 0 ( ) H1 ( ) L 0 ( ) the solution operator of the following Neumann interface problem: Given f L 0 ( ) find p H1 ( ) L 0 ( ) such that (ρ 1 p, q) L = (f, q) L q H 1 ( ) L 0 ( ). I ν : L 0 ( ) L 0 ( ) is defined by (I νp, q) L = (p, q) M for all p, q L 0 ( ). Then holds and or all p L 0 ( ) S 1 ν,ρ = I 1 ν τ 1 ρ (S ν,ρ p, p) L c( S ν,ρ p, p) L, with a constant c independent of τ, ν and ρ. Proof For W as in (5.15) define S as in (5.17). Using the same arguments as in the proof of Theorem 3. it can be shown that S 1 = Iν 1 τ 1 ρ holds. The spectral inequality S c S follows from Theorem.6. The constant c is uniform not only in τ but also w.r.t. ν and ρ, due to the fact that Ɣ a, Ɣ c, γ a and γ c are independent of ν and ρ. Remark 6 We comment on a discrete version of the preconditioner S ν,ρ in a pair of finite element spaces V h M h as considered in Sect In the operator I ν the scalar product (, ) M and thus the orthogonal projection on the onedimensional subspace P 0 = span( p) is used. This projection is avoided in the following operator Î ν : L 0 ( ) L 0 ( ) (Î ν p, q) L = (ν 1 p, q) L for all q L 0 ( ). Note that Î ν p = I ν p for all p L 0 ( ) P 0. In general a poor behaviour of a preconditioner on a one-dimensional subspace is harmless if the preconditioner is combined with a CG method. Therefore we base our discrete preconditioner on the simpler operator Î ν instead of on I ν.letî 1 ν,h : M h M h, Î 1 ν,h g h = p h be such that: (ν 1 p h, q h ) L = (g h, q h ) L for all q h M h. Let N 1 ρ,h : M h M h, N 1 ρ,h g h = p h be the solution operator of the following discrete Neumann problem: (ρ 1 p h, q h ) L = (g h, q h ) L for all q h M h.

28 186 M. A. Olshanskii et al. We define S ν,ρ,h : M h M h by S 1 ν,ρ,h := Î 1 ν,h + τn 1 ρ,h. This preconditioner is used in our numerical experiments. To evaluate S 1 ν,ρ,h g h one has to solve a system with a pressure mass matrix, w.r.t. the scalar product (ν 1, ) L, and a discrete Neumann interface problem. Note that in Theorem 5. we have a spectral inequality S ν,ρ S ν,ρ that is uniform with respect to both the parameter τ and the jumps in the coefficients ν, ρ without using any regularity assumptions. To derive a spectral inequality S ν,ρ S ν,ρ we need (at least in our analysis) regularity results for a stationary Stokes interface problem of the form div (ν(x)du) + p = f in k, (5.18) div u = 0 in k, k = 1,. (5.19) [u] =0, [σ(u, p) n] =g on Ɣ, (5.0) u = 0 on. (5.1) Similarly to the Stokes case in Sect. 3, verifying Assumption 1 is based on regularity properties of the solution of this problem. This important issue is largely unsolved. The following result is found in the literature (see, [0]): If the interface Ɣ = 1 is sufficiently smooth and has no common points with and f L then a solution u, p of (5.18) (5.1) belongs to H ( k ) d H 1 ( k ), k = 1,. However, in these results and in other analyses known in the literature the dependence of constants in a priori estimates on ν is not known. Due to this we are not able to prove a result S ν,ρ S ν,ρ that is uniform both with respect to τ and the jumps in ν, ρ. Below we present an analysis where the spectral inequality is uniform with respect to τ only. Theorem 5.3 Assume that one of the conditions (5.7) or (5.8) is satisfied and that the domain R d is such that the Stokes problem (3.1) is H -regular. Let S ν,ρ be the preconditioner from (5.17). There exists a constant c > 0 independent of τ such that for all p L 0 ( ) holds. c( S ν,ρ p, p) L (S ν,ρ p, p) L Proof Let S : L 0 ( ) L 0 ( ) as in (3.3) be the Schur complement for the generalized Stokes problem and Let S be the preconditioner from theorem 3.. For this preconditioner we have ( Sp, p) 1 ( = inf L p q q H 1 ( ) L 0 ( ) L + τ 1 q ) 1 L.

29 Uniform preconditioners to generalized Stokes interface equations 187 Using (5.17) and the norm equivalences M L (on L 0 ( )), ρ 1 L L (on H 1 ( ) L 0 ( )) it follows that there exists a constant c independent of τ such that From Theorem 3. it follows that ( S ν,ρ p, p) L c ( Sp, p) L for all p L 0 ( ). (5.) ( Sp, p) L c (Sp, p) L for all p L 0 ( ) (5.3) holds with a constant c independent of τ.from (Sp, p) L = sup v H 1 0 ( ) (p,divv) L ( v + τ v ), 1 L L the representation for S ν,ρ in (5.16) and the equivalences a ν (, ), L c ρ (, ) v (on H 1 L 0 ( ))itfollowsthat (Sp, p) L c (S ν,ρ p, p) L for all p L 0 ( ). (5.4) Combination of the results in (5.), (5.3) and (5.4) completes the proof. 6 Numerical experiments We present results for a model generalized Stokes interface problem. Numerical results for a stationary (τ = 0) Stokes interface problem can be found in [17]. We take = (0, 1) 3 with subdomains = (0, 1 )3, 1 = \. The model problem reads: Find (u, p) H 1 0 ( ) L 0 ( ) such that â ν (u, v) + τc ρ (u, v) + b(v, p) = 0 b(u, q) = 0 for all v H 1 0 ( ) for all q L 0 ( ). The bilinear forms b(, ) and c ρ (, ) are as in Sect. 5, â ν (u, v) := (ν u, v) L with ν and ρ piecewise constants as in (5.5). For the discretization we start with a uniform tetrahedral grid with h = 1 and apply regular (red) refinement to this triangulation. The resulting grids T h satisfy a conformity condition: T (i) h T h : {T T T (i) h }= i, i = 1,. We use the LBB-stable P P 1 Hood Taylor finite element pair, denoted by V h M h, and perform computations for h = 1 8, 1 16, 1 3 and various values of ν,

UNIFORM PRECONDITIONERS FOR A PARAMETER DEPENDENT SADDLE POINT PROBLEM WITH APPLICATION TO GENERALIZED STOKES INTERFACE EQUATIONS

UNIFORM PRECONDITIONERS FOR A PARAMETER DEPENDENT SADDLE POINT PROBLEM WITH APPLICATION TO GENERALIZED STOKES INTERFACE EQUATIONS UNIFORM PRECONDITIONERS FOR A PARAMETER DEPENDENT SADDLE POINT PROBLEM WITH APPLICATION TO GENERALIZED STOKES INTERFACE EQUATIONS MAXIM A. OLSHANSKII, JÖRG PETERS, AND ARNOLD REUSKEN Abstract. We consider

More information

A STOKES INTERFACE PROBLEM: STABILITY, FINITE ELEMENT ANALYSIS AND A ROBUST SOLVER

A STOKES INTERFACE PROBLEM: STABILITY, FINITE ELEMENT ANALYSIS AND A ROBUST SOLVER European Congress on Computational Methods in Applied Sciences and Engineering ECCOMAS 2004 P. Neittaanmäki, T. Rossi, K. Majava, and O. Pironneau (eds.) O. Nevanlinna and R. Rannacher (assoc. eds.) Jyväskylä,

More information

A Finite Element Method for the Surface Stokes Problem

A Finite Element Method for the Surface Stokes Problem J A N U A R Y 2 0 1 8 P R E P R I N T 4 7 5 A Finite Element Method for the Surface Stokes Problem Maxim A. Olshanskii *, Annalisa Quaini, Arnold Reusken and Vladimir Yushutin Institut für Geometrie und

More information

Numerical Methods for the Navier-Stokes equations

Numerical Methods for the Navier-Stokes equations Arnold Reusken Numerical Methods for the Navier-Stokes equations January 6, 212 Chair for Numerical Mathematics RWTH Aachen Contents 1 The Navier-Stokes equations.............................................

More information

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

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

More information

Robust preconditioning for XFEM applied to time-dependent Stokes problems

Robust preconditioning for XFEM applied to time-dependent Stokes problems Numerical Analysis and Scientific Computing Preprint Seria Robust preconditioning for XFEM applied to time-dependent Stokes problems S. Gross T. Ludescher M.A. Olshanskii A. Reusken Preprint #40 Department

More information

An Extended Finite Element Method for a Two-Phase Stokes problem

An Extended Finite Element Method for a Two-Phase Stokes problem XFEM project An Extended Finite Element Method for a Two-Phase Stokes problem P. Lederer, C. Pfeiler, C. Wintersteiger Advisor: Dr. C. Lehrenfeld August 5, 2015 Contents 1 Problem description 2 1.1 Physics.........................................

More information

Discontinuous Galerkin Time Discretization Methods for Parabolic Problems with Linear Constraints

Discontinuous Galerkin Time Discretization Methods for Parabolic Problems with Linear Constraints J A N U A R Y 0 1 8 P R E P R N T 4 7 4 Discontinuous Galerkin Time Discretization Methods for Parabolic Problems with Linear Constraints gor Voulis * and Arnold Reusken nstitut für Geometrie und Praktische

More information

SPECTRAL PROPERTIES OF THE LAPLACIAN ON BOUNDED DOMAINS

SPECTRAL PROPERTIES OF THE LAPLACIAN ON BOUNDED DOMAINS SPECTRAL PROPERTIES OF THE LAPLACIAN ON BOUNDED DOMAINS TSOGTGEREL GANTUMUR Abstract. After establishing discrete spectra for a large class of elliptic operators, we present some fundamental spectral properties

More information

Analysis of a DG XFEM Discretization for a Class of Two Phase Mass Transport Problems

Analysis of a DG XFEM Discretization for a Class of Two Phase Mass Transport Problems Analysis of a DG XFEM Discretization for a Class of Two Phase Mass Transport Problems Christoph Lehrenfeld and Arnold Reusken Bericht Nr. 340 April 2012 Key words: transport problem, Nitsche method, XFEM,

More information

Traces and Duality Lemma

Traces and Duality Lemma Traces and Duality Lemma Recall the duality lemma with H / ( ) := γ 0 (H ()) defined as the trace space of H () endowed with minimal extension norm; i.e., for w H / ( ) L ( ), w H / ( ) = min{ ŵ H () ŵ

More information

Downloaded 11/21/16 to Redistribution subject to SIAM license or copyright; see

Downloaded 11/21/16 to Redistribution subject to SIAM license or copyright; see SIAM J. SCI. COMPUT. Vol. 38, No. 6, pp. A349 A3514 c 016 Society for Industrial and Applied Mathematics ROBUST PRECONDITIONING FOR XFEM APPLIED TO TIME-DEPENDENT STOKES PROBLEMS SVEN GROSS, THOMAS LUDESCHER,

More information

FINITE ELEMENT APPROXIMATION OF STOKES-LIKE SYSTEMS WITH IMPLICIT CONSTITUTIVE RELATION

FINITE ELEMENT APPROXIMATION OF STOKES-LIKE SYSTEMS WITH IMPLICIT CONSTITUTIVE RELATION Proceedings of ALGORITMY pp. 9 3 FINITE ELEMENT APPROXIMATION OF STOKES-LIKE SYSTEMS WITH IMPLICIT CONSTITUTIVE RELATION JAN STEBEL Abstract. The paper deals with the numerical simulations of steady flows

More information

Yongdeok Kim and Seki Kim

Yongdeok Kim and Seki Kim J. Korean Math. Soc. 39 (00), No. 3, pp. 363 376 STABLE LOW ORDER NONCONFORMING QUADRILATERAL FINITE ELEMENTS FOR THE STOKES PROBLEM Yongdeok Kim and Seki Kim Abstract. Stability result is obtained for

More information

AMS subject classifications. Primary, 65N15, 65N30, 76D07; Secondary, 35B45, 35J50

AMS subject classifications. Primary, 65N15, 65N30, 76D07; Secondary, 35B45, 35J50 A SIMPLE FINITE ELEMENT METHOD FOR THE STOKES EQUATIONS LIN MU AND XIU YE Abstract. The goal of this paper is to introduce a simple finite element method to solve the Stokes equations. This method is in

More information

On Surface Meshes Induced by Level Set Functions

On Surface Meshes Induced by Level Set Functions On Surface Meshes Induced by Level Set Functions Maxim A. Olshanskii, Arnold Reusken, and Xianmin Xu Bericht Nr. 347 Oktober 01 Key words: surface finite elements, level set function, surface triangulation,

More information

MULTIGRID PRECONDITIONING IN H(div) ON NON-CONVEX POLYGONS* Dedicated to Professor Jim Douglas, Jr. on the occasion of his seventieth birthday.

MULTIGRID PRECONDITIONING IN H(div) ON NON-CONVEX POLYGONS* Dedicated to Professor Jim Douglas, Jr. on the occasion of his seventieth birthday. MULTIGRID PRECONDITIONING IN H(div) ON NON-CONVEX POLYGONS* DOUGLAS N ARNOLD, RICHARD S FALK, and RAGNAR WINTHER Dedicated to Professor Jim Douglas, Jr on the occasion of his seventieth birthday Abstract

More information

INF-SUP CONDITION FOR OPERATOR EQUATIONS

INF-SUP CONDITION FOR OPERATOR EQUATIONS INF-SUP CONDITION FOR OPERATOR EQUATIONS LONG CHEN We study the well-posedness of the operator equation (1) T u = f. where T is a linear and bounded operator between two linear vector spaces. We give equivalent

More information

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

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

More information

INTRODUCTION TO FINITE ELEMENT METHODS

INTRODUCTION TO FINITE ELEMENT METHODS INTRODUCTION TO FINITE ELEMENT METHODS LONG CHEN Finite element methods are based on the variational formulation of partial differential equations which only need to compute the gradient of a function.

More information

PREPRINT 2010:23. A nonconforming rotated Q 1 approximation on tetrahedra PETER HANSBO

PREPRINT 2010:23. A nonconforming rotated Q 1 approximation on tetrahedra PETER HANSBO PREPRINT 2010:23 A nonconforming rotated Q 1 approximation on tetrahedra PETER HANSBO Department of Mathematical Sciences Division of Mathematics CHALMERS UNIVERSITY OF TECHNOLOGY UNIVERSITY OF GOTHENBURG

More information

NONSTANDARD NONCONFORMING APPROXIMATION OF THE STOKES PROBLEM, I: PERIODIC BOUNDARY CONDITIONS

NONSTANDARD NONCONFORMING APPROXIMATION OF THE STOKES PROBLEM, I: PERIODIC BOUNDARY CONDITIONS NONSTANDARD NONCONFORMING APPROXIMATION OF THE STOKES PROBLEM, I: PERIODIC BOUNDARY CONDITIONS J.-L. GUERMOND 1, Abstract. This paper analyzes a nonstandard form of the Stokes problem where the mass conservation

More information

A NOTE ON THE LADYŽENSKAJA-BABUŠKA-BREZZI CONDITION

A NOTE ON THE LADYŽENSKAJA-BABUŠKA-BREZZI CONDITION A NOTE ON THE LADYŽENSKAJA-BABUŠKA-BREZZI CONDITION JOHNNY GUZMÁN, ABNER J. SALGADO, AND FRANCISCO-JAVIER SAYAS Abstract. The analysis of finite-element-like Galerkin discretization techniques for the

More information

Supraconvergence of a Non-Uniform Discretisation for an Elliptic Third-Kind Boundary-Value Problem with Mixed Derivatives

Supraconvergence of a Non-Uniform Discretisation for an Elliptic Third-Kind Boundary-Value Problem with Mixed Derivatives Supraconvergence of a Non-Uniform Discretisation for an Elliptic Third-Kind Boundary-Value Problem with Mixed Derivatives Etienne Emmrich Technische Universität Berlin, Institut für Mathematik, Straße

More information

Approximation of fluid-structure interaction problems with Lagrange multiplier

Approximation of fluid-structure interaction problems with Lagrange multiplier Approximation of fluid-structure interaction problems with Lagrange multiplier Daniele Boffi Dipartimento di Matematica F. Casorati, Università di Pavia http://www-dimat.unipv.it/boffi May 30, 2016 Outline

More information

A Mixed Nonconforming Finite Element for Linear Elasticity

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

More information

Analysis of a high order trace finite element method for PDEs on level set surfaces

Analysis of a high order trace finite element method for PDEs on level set surfaces N O V E M B E R 2 0 1 6 P R E P R I N T 4 5 7 Analysis of a high order trace finite element method for PDEs on level set surfaces Jörg Grande *, Christoph Lehrenfeld and Arnold Reusken * Institut für Geometrie

More information

Variational Formulations

Variational Formulations Chapter 2 Variational Formulations In this chapter we will derive a variational (or weak) formulation of the elliptic boundary value problem (1.4). We will discuss all fundamental theoretical results that

More information

Uniform inf-sup condition for the Brinkman problem in highly heterogeneous media

Uniform inf-sup condition for the Brinkman problem in highly heterogeneous media Uniform inf-sup condition for the Brinkman problem in highly heterogeneous media Raytcho Lazarov & Aziz Takhirov Texas A&M May 3-4, 2016 R. Lazarov & A.T. (Texas A&M) Brinkman May 3-4, 2016 1 / 30 Outline

More information

A Least-Squares Finite Element Approximation for the Compressible Stokes Equations

A Least-Squares Finite Element Approximation for the Compressible Stokes Equations A Least-Squares Finite Element Approximation for the Compressible Stokes Equations Zhiqiang Cai, 1 Xiu Ye 1 Department of Mathematics, Purdue University, 1395 Mathematical Science Building, West Lafayette,

More information

Newton-Multigrid Least-Squares FEM for S-V-P Formulation of the Navier-Stokes Equations

Newton-Multigrid Least-Squares FEM for S-V-P Formulation of the Navier-Stokes Equations Newton-Multigrid Least-Squares FEM for S-V-P Formulation of the Navier-Stokes Equations A. Ouazzi, M. Nickaeen, S. Turek, and M. Waseem Institut für Angewandte Mathematik, LSIII, TU Dortmund, Vogelpothsweg

More information

Hamburger Beiträge zur Angewandten Mathematik

Hamburger Beiträge zur Angewandten Mathematik Hamburger Beiträge zur Angewandten Mathematik Numerical analysis of a control and state constrained elliptic control problem with piecewise constant control approximations Klaus Deckelnick and Michael

More information

Lecture Note III: Least-Squares Method

Lecture Note III: Least-Squares Method Lecture Note III: Least-Squares Method Zhiqiang Cai October 4, 004 In this chapter, we shall present least-squares methods for second-order scalar partial differential equations, elastic equations of solids,

More information

Numerische Mathematik

Numerische Mathematik Numer. Math. (2003) 94: 195 202 Digital Object Identifier (DOI) 10.1007/s002110100308 Numerische Mathematik Some observations on Babuška and Brezzi theories Jinchao Xu, Ludmil Zikatanov Department of Mathematics,

More information

A FINITE ELEMENT METHOD FOR ELLIPTIC EQUATIONS ON SURFACES

A FINITE ELEMENT METHOD FOR ELLIPTIC EQUATIONS ON SURFACES A FINITE ELEMENT METHOD FOR ELLIPTIC EQUATIONS ON SURFACES MAXIM A. OLSHANSKII, ARNOLD REUSKEN, AND JÖRG GRANDE Abstract. In this paper a new finite element approach for the discretization of elliptic

More information

A spacetime DPG method for acoustic waves

A spacetime DPG method for acoustic waves A spacetime DPG method for acoustic waves Rainer Schneckenleitner JKU Linz January 30, 2018 ( JKU Linz ) Spacetime DPG method January 30, 2018 1 / 41 Overview 1 The transient wave problem 2 The broken

More information

Robust Monolithic - Multigrid FEM Solver for Three Fields Formulation Rising from non-newtonian Flow Problems

Robust Monolithic - Multigrid FEM Solver for Three Fields Formulation Rising from non-newtonian Flow Problems Robust Monolithic - Multigrid FEM Solver for Three Fields Formulation Rising from non-newtonian Flow Problems M. Aaqib Afaq Institute for Applied Mathematics and Numerics (LSIII) TU Dortmund 13 July 2017

More information

Efficient Augmented Lagrangian-type Preconditioning for the Oseen Problem using Grad-Div Stabilization

Efficient Augmented Lagrangian-type Preconditioning for the Oseen Problem using Grad-Div Stabilization Efficient Augmented Lagrangian-type Preconditioning for the Oseen Problem using Grad-Div Stabilization Timo Heister, Texas A&M University 2013-02-28 SIAM CSE 2 Setting Stationary, incompressible flow problems

More information

On Friedrichs inequality, Helmholtz decomposition, vector potentials, and the div-curl lemma. Ben Schweizer 1

On Friedrichs inequality, Helmholtz decomposition, vector potentials, and the div-curl lemma. Ben Schweizer 1 On Friedrichs inequality, Helmholtz decomposition, vector potentials, and the div-curl lemma Ben Schweizer 1 January 16, 2017 Abstract: We study connections between four different types of results that

More information

Finite Element Techniques for the Numerical Simulation of Two-Phase Flows with Mass Transport

Finite Element Techniques for the Numerical Simulation of Two-Phase Flows with Mass Transport Finite Element Techniques for the Numerical Simulation of Two-Phase Flows with Mass Transport Christoph Lehrenfeld and Arnold Reusken Preprint No. 413 December 2014 Key words: Two-phase flow, mass transport,

More information

Hybridized Discontinuous Galerkin Methods

Hybridized Discontinuous Galerkin Methods Hybridized Discontinuous Galerkin Methods Theory and Christian Waluga Joint work with Herbert Egger (Uni Graz) 1st DUNE User Meeting, Stuttgart Christian Waluga (AICES) HDG Methods October 6-8, 2010 1

More information

Multigrid Methods for Saddle Point Problems

Multigrid Methods for Saddle Point Problems Multigrid Methods for Saddle Point Problems Susanne C. Brenner Department of Mathematics and Center for Computation & Technology Louisiana State University Advances in Mathematics of Finite Elements (In

More information

Solutions of Selected Problems

Solutions of Selected Problems 1 Solutions of Selected Problems October 16, 2015 Chapter I 1.9 Consider the potential equation in the disk := {(x, y) R 2 ; x 2 +y 2 < 1}, with the boundary condition u(x) = g(x) r for x on the derivative

More information

Numerical Solutions to Partial Differential Equations

Numerical Solutions to Partial Differential Equations Numerical Solutions to Partial Differential Equations Zhiping Li LMAM and School of Mathematical Sciences Peking University Nonconformity and the Consistency Error First Strang Lemma Abstract Error Estimate

More information

Optimal preconditioners for Nitsche-XFEM discretizations of interface problems

Optimal preconditioners for Nitsche-XFEM discretizations of interface problems Optimal preconditioners for Nitsche-XFEM discretizations of interface problems Christoph Lehrenfeld Arnold Reusken August 13, 2014 In the past decade, a combination of unfitted finite elements (or XFEM)

More information

Error analysis of a space-time finite element method for solving PDEs on evolving surfaces

Error analysis of a space-time finite element method for solving PDEs on evolving surfaces Numerical Analysis and Scientific Computing Preprint Seria Error analysis of a space-time finite element method for solving PDEs on evolving surfaces M.A. Olshanskii A. Reusken Preprint #9 Department of

More information

Construction of a New Domain Decomposition Method for the Stokes Equations

Construction of a New Domain Decomposition Method for the Stokes Equations Construction of a New Domain Decomposition Method for the Stokes Equations Frédéric Nataf 1 and Gerd Rapin 2 1 CMAP, CNRS; UMR7641, Ecole Polytechnique, 91128 Palaiseau Cedex, France 2 Math. Dep., NAM,

More information

Discontinuous Galerkin Methods

Discontinuous Galerkin Methods Discontinuous Galerkin Methods Joachim Schöberl May 20, 206 Discontinuous Galerkin (DG) methods approximate the solution with piecewise functions (polynomials), which are discontinuous across element interfaces.

More information

Scientific Computing WS 2017/2018. Lecture 18. Jürgen Fuhrmann Lecture 18 Slide 1

Scientific Computing WS 2017/2018. Lecture 18. Jürgen Fuhrmann Lecture 18 Slide 1 Scientific Computing WS 2017/2018 Lecture 18 Jürgen Fuhrmann juergen.fuhrmann@wias-berlin.de Lecture 18 Slide 1 Lecture 18 Slide 2 Weak formulation of homogeneous Dirichlet problem Search u H0 1 (Ω) (here,

More information

Numerische Mathematik

Numerische Mathematik Numer. Math. (1999) 82: 179 191 Numerische Mathematik c Springer-Verlag 1999 Electronic Edition A cascadic multigrid algorithm for the Stokes equations Dietrich Braess 1, Wolfgang Dahmen 2 1 Fakultät für

More information

Hilbert spaces. 1. Cauchy-Schwarz-Bunyakowsky inequality

Hilbert spaces. 1. Cauchy-Schwarz-Bunyakowsky inequality (October 29, 2016) Hilbert spaces Paul Garrett garrett@math.umn.edu http://www.math.umn.edu/ garrett/ [This document is http://www.math.umn.edu/ garrett/m/fun/notes 2016-17/03 hsp.pdf] Hilbert spaces are

More information

LECTURE 1: SOURCES OF ERRORS MATHEMATICAL TOOLS A PRIORI ERROR ESTIMATES. Sergey Korotov,

LECTURE 1: SOURCES OF ERRORS MATHEMATICAL TOOLS A PRIORI ERROR ESTIMATES. Sergey Korotov, LECTURE 1: SOURCES OF ERRORS MATHEMATICAL TOOLS A PRIORI ERROR ESTIMATES Sergey Korotov, Institute of Mathematics Helsinki University of Technology, Finland Academy of Finland 1 Main Problem in Mathematical

More information

Fast Iterative Solution of Saddle Point Problems

Fast Iterative Solution of Saddle Point Problems Michele Benzi Department of Mathematics and Computer Science Emory University Atlanta, GA Acknowledgments NSF (Computational Mathematics) Maxim Olshanskii (Mech-Math, Moscow State U.) Zhen Wang (PhD student,

More information

Preconditioned space-time boundary element methods for the heat equation

Preconditioned space-time boundary element methods for the heat equation W I S S E N T E C H N I K L E I D E N S C H A F T Preconditioned space-time boundary element methods for the heat equation S. Dohr and O. Steinbach Institut für Numerische Mathematik Space-Time Methods

More information

b i (x) u + c(x)u = f in Ω,

b i (x) u + c(x)u = f in Ω, SIAM J. NUMER. ANAL. Vol. 39, No. 6, pp. 1938 1953 c 2002 Society for Industrial and Applied Mathematics SUBOPTIMAL AND OPTIMAL CONVERGENCE IN MIXED FINITE ELEMENT METHODS ALAN DEMLOW Abstract. An elliptic

More information

Konstantinos Chrysafinos 1 and L. Steven Hou Introduction

Konstantinos Chrysafinos 1 and L. Steven Hou Introduction Mathematical Modelling and Numerical Analysis Modélisation Mathématique et Analyse Numérique Will be set by the publisher ANALYSIS AND APPROXIMATIONS OF THE EVOLUTIONARY STOKES EQUATIONS WITH INHOMOGENEOUS

More information

Adaptive Finite Element Methods Lecture Notes Winter Term 2017/18. R. Verfürth. Fakultät für Mathematik, Ruhr-Universität Bochum

Adaptive Finite Element Methods Lecture Notes Winter Term 2017/18. R. Verfürth. Fakultät für Mathematik, Ruhr-Universität Bochum Adaptive Finite Element Methods Lecture Notes Winter Term 2017/18 R. Verfürth Fakultät für Mathematik, Ruhr-Universität Bochum Contents Chapter I. Introduction 7 I.1. Motivation 7 I.2. Sobolev and finite

More information

SECOND ORDER TIME DISCONTINUOUS GALERKIN METHOD FOR NONLINEAR CONVECTION-DIFFUSION PROBLEMS

SECOND ORDER TIME DISCONTINUOUS GALERKIN METHOD FOR NONLINEAR CONVECTION-DIFFUSION PROBLEMS Proceedings of ALGORITMY 2009 pp. 1 10 SECOND ORDER TIME DISCONTINUOUS GALERKIN METHOD FOR NONLINEAR CONVECTION-DIFFUSION PROBLEMS MILOSLAV VLASÁK Abstract. We deal with a numerical solution of a scalar

More information

LECTURE # 0 BASIC NOTATIONS AND CONCEPTS IN THE THEORY OF PARTIAL DIFFERENTIAL EQUATIONS (PDES)

LECTURE # 0 BASIC NOTATIONS AND CONCEPTS IN THE THEORY OF PARTIAL DIFFERENTIAL EQUATIONS (PDES) LECTURE # 0 BASIC NOTATIONS AND CONCEPTS IN THE THEORY OF PARTIAL DIFFERENTIAL EQUATIONS (PDES) RAYTCHO LAZAROV 1 Notations and Basic Functional Spaces Scalar function in R d, d 1 will be denoted by u,

More information

Introduction to Real Analysis Alternative Chapter 1

Introduction to Real Analysis Alternative Chapter 1 Christopher Heil Introduction to Real Analysis Alternative Chapter 1 A Primer on Norms and Banach Spaces Last Updated: March 10, 2018 c 2018 by Christopher Heil Chapter 1 A Primer on Norms and Banach Spaces

More information

Robust Domain Decomposition Preconditioners for Abstract Symmetric Positive Definite Bilinear Forms

Robust Domain Decomposition Preconditioners for Abstract Symmetric Positive Definite Bilinear Forms www.oeaw.ac.at Robust Domain Decomposition Preconditioners for Abstract Symmetric Positive Definite Bilinear Forms Y. Efendiev, J. Galvis, R. Lazarov, J. Willems RICAM-Report 2011-05 www.ricam.oeaw.ac.at

More information

THE FORM SUM AND THE FRIEDRICHS EXTENSION OF SCHRÖDINGER-TYPE OPERATORS ON RIEMANNIAN MANIFOLDS

THE FORM SUM AND THE FRIEDRICHS EXTENSION OF SCHRÖDINGER-TYPE OPERATORS ON RIEMANNIAN MANIFOLDS THE FORM SUM AND THE FRIEDRICHS EXTENSION OF SCHRÖDINGER-TYPE OPERATORS ON RIEMANNIAN MANIFOLDS OGNJEN MILATOVIC Abstract. We consider H V = M +V, where (M, g) is a Riemannian manifold (not necessarily

More information

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

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

More information

Numerische Mathematik

Numerische Mathematik Numer. Math. DOI.7/s2-9-26-4 Numerische Mathematik A finite element method for surface PDEs: matrix properties Maxim A. Olshanskii Arnold Reusken Received: 3 October 28 / Revised: 9 June 29 Springer-Verlag

More information

OUTLINE ffl CFD: elliptic pde's! Ax = b ffl Basic iterative methods ffl Krylov subspace methods ffl Preconditioning techniques: Iterative methods ILU

OUTLINE ffl CFD: elliptic pde's! Ax = b ffl Basic iterative methods ffl Krylov subspace methods ffl Preconditioning techniques: Iterative methods ILU Preconditioning Techniques for Solving Large Sparse Linear Systems Arnold Reusken Institut für Geometrie und Praktische Mathematik RWTH-Aachen OUTLINE ffl CFD: elliptic pde's! Ax = b ffl Basic iterative

More information

Universität des Saarlandes. Fachrichtung 6.1 Mathematik

Universität des Saarlandes. Fachrichtung 6.1 Mathematik Universität des Saarlandes U N I V E R S I T A S S A R A V I E N I S S Fachrichtung 6.1 Mathematik Preprint Nr. 155 A posteriori error estimates for stationary slow flows of power-law fluids Michael Bildhauer,

More information

A Two-Grid Stabilization Method for Solving the Steady-State Navier-Stokes Equations

A Two-Grid Stabilization Method for Solving the Steady-State Navier-Stokes Equations A Two-Grid Stabilization Method for Solving the Steady-State Navier-Stokes Equations Songul Kaya and Béatrice Rivière Abstract We formulate a subgrid eddy viscosity method for solving the steady-state

More information

Chapter 5 A priori error estimates for nonconforming finite element approximations 5.1 Strang s first lemma

Chapter 5 A priori error estimates for nonconforming finite element approximations 5.1 Strang s first lemma Chapter 5 A priori error estimates for nonconforming finite element approximations 51 Strang s first lemma We consider the variational equation (51 a(u, v = l(v, v V H 1 (Ω, and assume that the conditions

More information

Functional Analysis. Franck Sueur Metric spaces Definitions Completeness Compactness Separability...

Functional Analysis. Franck Sueur Metric spaces Definitions Completeness Compactness Separability... Functional Analysis Franck Sueur 2018-2019 Contents 1 Metric spaces 1 1.1 Definitions........................................ 1 1.2 Completeness...................................... 3 1.3 Compactness......................................

More information

Numerische Mathematik

Numerische Mathematik Numer. Math. (2012) 122:61 99 DOI 10.1007/s00211-012-0456-x Numerische Mathematik C 0 elements for generalized indefinite Maxwell equations Huoyuan Duan Ping Lin Roger C. E. Tan Received: 31 July 2010

More information

Inequalities of Babuška-Aziz and Friedrichs-Velte for differential forms

Inequalities of Babuška-Aziz and Friedrichs-Velte for differential forms Inequalities of Babuška-Aziz and Friedrichs-Velte for differential forms Martin Costabel Abstract. For sufficiently smooth bounded plane domains, the equivalence between the inequalities of Babuška Aziz

More information

Coupling Non-Linear Stokes and Darcy Flow using Mortar Finite Elements

Coupling Non-Linear Stokes and Darcy Flow using Mortar Finite Elements Coupling Non-Linear Stokes and Darcy Flow using Mortar Finite Elements V.J. Ervin E.W. Jenkins S. Sun Department of Mathematical Sciences Clemson University, Clemson, SC, 29634-0975, USA. Abstract We study

More information

Basic Principles of Weak Galerkin Finite Element Methods for PDEs

Basic Principles of Weak Galerkin Finite Element Methods for PDEs Basic Principles of Weak Galerkin Finite Element Methods for PDEs Junping Wang Computational Mathematics Division of Mathematical Sciences National Science Foundation Arlington, VA 22230 Polytopal Element

More information

Weierstraß-Institut. für Angewandte Analysis und Stochastik. Leibniz-Institut im Forschungsverbund Berlin e. V. Preprint ISSN

Weierstraß-Institut. für Angewandte Analysis und Stochastik. Leibniz-Institut im Forschungsverbund Berlin e. V. Preprint ISSN Weierstraß-Institut für Angewandte Analysis und Stochastik Leibniz-Institut im Forschungsverbund Berlin e. V. Preprint ISSN 2198-5855 On the divergence constraint in mixed finite element methods for incompressible

More information

A Concise Course on Stochastic Partial Differential Equations

A Concise Course on Stochastic Partial Differential Equations A Concise Course on Stochastic Partial Differential Equations Michael Röckner Reference: C. Prevot, M. Röckner: Springer LN in Math. 1905, Berlin (2007) And see the references therein for the original

More information

Chapter 2. General concepts. 2.1 The Navier-Stokes equations

Chapter 2. General concepts. 2.1 The Navier-Stokes equations Chapter 2 General concepts 2.1 The Navier-Stokes equations The Navier-Stokes equations model the fluid mechanics. This set of differential equations describes the motion of a fluid. In the present work

More information

PARTITION OF UNITY FOR THE STOKES PROBLEM ON NONMATCHING GRIDS

PARTITION OF UNITY FOR THE STOKES PROBLEM ON NONMATCHING GRIDS PARTITION OF UNITY FOR THE STOES PROBLEM ON NONMATCHING GRIDS CONSTANTIN BACUTA AND JINCHAO XU Abstract. We consider the Stokes Problem on a plane polygonal domain Ω R 2. We propose a finite element method

More information

Week 6 Notes, Math 865, Tanveer

Week 6 Notes, Math 865, Tanveer Week 6 Notes, Math 865, Tanveer. Energy Methods for Euler and Navier-Stokes Equation We will consider this week basic energy estimates. These are estimates on the L 2 spatial norms of the solution u(x,

More information

MEYERS TYPE ESTIMATES FOR APPROXIMATE SOLUTIONS OF NONLINEAR ELLIPTIC EQUATIONS AND THEIR APPLICATIONS. Yalchin Efendiev.

MEYERS TYPE ESTIMATES FOR APPROXIMATE SOLUTIONS OF NONLINEAR ELLIPTIC EQUATIONS AND THEIR APPLICATIONS. Yalchin Efendiev. Manuscript submitted to AIMS Journals Volume X, Number 0X, XX 200X Website: http://aimsciences.org pp. X XX MEYERS TYPE ESTIMATES FOR APPROXIMATE SOLUTIONS OF NONLINEAR ELLIPTIC EUATIONS AND THEIR APPLICATIONS

More information

Numerical methods for the Navier- Stokes equations

Numerical methods for the Navier- Stokes equations Numerical methods for the Navier- Stokes equations Hans Petter Langtangen 1,2 1 Center for Biomedical Computing, Simula Research Laboratory 2 Department of Informatics, University of Oslo Dec 6, 2012 Note:

More information

1.2 Fundamental Theorems of Functional Analysis

1.2 Fundamental Theorems of Functional Analysis 1.2 Fundamental Theorems of Functional Analysis 15 Indeed, h = ω ψ ωdx is continuous compactly supported with R hdx = 0 R and thus it has a unique compactly supported primitive. Hence fφ dx = f(ω ψ ωdy)dx

More information

1. Subspaces A subset M of Hilbert space H is a subspace of it is closed under the operation of forming linear combinations;i.e.,

1. Subspaces A subset M of Hilbert space H is a subspace of it is closed under the operation of forming linear combinations;i.e., Abstract Hilbert Space Results We have learned a little about the Hilbert spaces L U and and we have at least defined H 1 U and the scale of Hilbert spaces H p U. Now we are going to develop additional

More information

A Domain Decomposition Method for Quasilinear Elliptic PDEs Using Mortar Finite Elements

A Domain Decomposition Method for Quasilinear Elliptic PDEs Using Mortar Finite Elements W I S S E N T E C H N I K L E I D E N S C H A F T A Domain Decomposition Method for Quasilinear Elliptic PDEs Using Mortar Finite Elements Matthias Gsell and Olaf Steinbach Institute of Computational Mathematics

More information

ADJOINTS, ABSOLUTE VALUES AND POLAR DECOMPOSITIONS

ADJOINTS, ABSOLUTE VALUES AND POLAR DECOMPOSITIONS J. OPERATOR THEORY 44(2000), 243 254 c Copyright by Theta, 2000 ADJOINTS, ABSOLUTE VALUES AND POLAR DECOMPOSITIONS DOUGLAS BRIDGES, FRED RICHMAN and PETER SCHUSTER Communicated by William B. Arveson Abstract.

More information

2. Dual space is essential for the concept of gradient which, in turn, leads to the variational analysis of Lagrange multipliers.

2. Dual space is essential for the concept of gradient which, in turn, leads to the variational analysis of Lagrange multipliers. Chapter 3 Duality in Banach Space Modern optimization theory largely centers around the interplay of a normed vector space and its corresponding dual. The notion of duality is important for the following

More information

Second Order Elliptic PDE

Second Order Elliptic PDE Second Order Elliptic PDE T. Muthukumar tmk@iitk.ac.in December 16, 2014 Contents 1 A Quick Introduction to PDE 1 2 Classification of Second Order PDE 3 3 Linear Second Order Elliptic Operators 4 4 Periodic

More information

CSE386C METHODS OF APPLIED MATHEMATICS Fall 2014, Final Exam, 9:00-noon, Tue, Dec 16, ACES 6.304

CSE386C METHODS OF APPLIED MATHEMATICS Fall 2014, Final Exam, 9:00-noon, Tue, Dec 16, ACES 6.304 CSE386C METHODS OF APPLIED MATHEMATICS Fall 2014, Final Exam, 9:00-noon, Tue, Dec 16, ACES 6.304 1. Let A be a closed operator defined on a dense subspace D(A) of a Hilbert space U. (a) Define the adjoint

More information

Divergence-conforming multigrid methods for incompressible flow problems

Divergence-conforming multigrid methods for incompressible flow problems Divergence-conforming multigrid methods for incompressible flow problems Guido Kanschat IWR, Universität Heidelberg Prague-Heidelberg-Workshop April 28th, 2015 G. Kanschat (IWR, Uni HD) Hdiv-DG Práha,

More information

A Multigrid Method for Two Dimensional Maxwell Interface Problems

A Multigrid Method for Two Dimensional Maxwell Interface Problems A Multigrid Method for Two Dimensional Maxwell Interface Problems Susanne C. Brenner Department of Mathematics and Center for Computation & Technology Louisiana State University USA JSA 2013 Outline A

More information

Local pointwise a posteriori gradient error bounds for the Stokes equations. Stig Larsson. Heraklion, September 19, 2011 Joint work with A.

Local pointwise a posteriori gradient error bounds for the Stokes equations. Stig Larsson. Heraklion, September 19, 2011 Joint work with A. Local pointwise a posteriori gradient error bounds for the Stokes equations Stig Larsson Department of Mathematical Sciences Chalmers University of Technology and University of Gothenburg Heraklion, September

More information

Discrete Projection Methods for Incompressible Fluid Flow Problems and Application to a Fluid-Structure Interaction

Discrete Projection Methods for Incompressible Fluid Flow Problems and Application to a Fluid-Structure Interaction Discrete Projection Methods for Incompressible Fluid Flow Problems and Application to a Fluid-Structure Interaction Problem Jörg-M. Sautter Mathematisches Institut, Universität Düsseldorf, Germany, sautter@am.uni-duesseldorf.de

More information

Analysis of Hybrid Discontinuous Galerkin Methods for Incompressible Flow Problems

Analysis of Hybrid Discontinuous Galerkin Methods for Incompressible Flow Problems Analysis of Hybrid Discontinuous Galerkin Methods for Incompressible Flow Problems Christian Waluga 1 advised by Prof. Herbert Egger 2 Prof. Wolfgang Dahmen 3 1 Aachen Institute for Advanced Study in Computational

More information

Domain Decomposition Algorithms for an Indefinite Hypersingular Integral Equation in Three Dimensions

Domain Decomposition Algorithms for an Indefinite Hypersingular Integral Equation in Three Dimensions Domain Decomposition Algorithms for an Indefinite Hypersingular Integral Equation in Three Dimensions Ernst P. Stephan 1, Matthias Maischak 2, and Thanh Tran 3 1 Institut für Angewandte Mathematik, Leibniz

More information

Finite Elements. Colin Cotter. February 22, Colin Cotter FEM

Finite Elements. Colin Cotter. February 22, Colin Cotter FEM Finite Elements February 22, 2019 In the previous sections, we introduced the concept of finite element spaces, which contain certain functions defined on a domain. Finite element spaces are examples of

More information

A LAGRANGE MULTIPLIER METHOD FOR ELLIPTIC INTERFACE PROBLEMS USING NON-MATCHING MESHES

A LAGRANGE MULTIPLIER METHOD FOR ELLIPTIC INTERFACE PROBLEMS USING NON-MATCHING MESHES A LAGRANGE MULTIPLIER METHOD FOR ELLIPTIC INTERFACE PROBLEMS USING NON-MATCHING MESHES P. HANSBO Department of Applied Mechanics, Chalmers University of Technology, S-4 96 Göteborg, Sweden E-mail: hansbo@solid.chalmers.se

More information

An Iterative Substructuring Method for Mortar Nonconforming Discretization of a Fourth-Order Elliptic Problem in two dimensions

An Iterative Substructuring Method for Mortar Nonconforming Discretization of a Fourth-Order Elliptic Problem in two dimensions An Iterative Substructuring Method for Mortar Nonconforming Discretization of a Fourth-Order Elliptic Problem in two dimensions Leszek Marcinkowski Department of Mathematics, Warsaw University, Banacha

More information

A SADDLE POINT LEAST SQUARES METHOD FOR SYSTEMS OF LINEAR PDES. Klajdi Qirko

A SADDLE POINT LEAST SQUARES METHOD FOR SYSTEMS OF LINEAR PDES. Klajdi Qirko A SADDLE POINT LEAST SQUARES METHOD FOR SYSTEMS OF LINEAR PDES by Klajdi Qirko A dissertation submitted to the Faculty of the University of Delaware in partial fulfillment of the requirements for the degree

More information

A Posteriori Existence in Adaptive Computations

A Posteriori Existence in Adaptive Computations Report no. 06/11 A Posteriori Existence in Adaptive Computations Christoph Ortner This short note demonstrates that it is not necessary to assume the existence of exact solutions in an a posteriori error

More information

ON SINGULAR PERTURBATION OF THE STOKES PROBLEM

ON SINGULAR PERTURBATION OF THE STOKES PROBLEM NUMERICAL ANALYSIS AND MATHEMATICAL MODELLING BANACH CENTER PUBLICATIONS, VOLUME 9 INSTITUTE OF MATHEMATICS POLISH ACADEMY OF SCIENCES WARSZAWA 994 ON SINGULAR PERTURBATION OF THE STOKES PROBLEM G. M.

More information

A DELTA-REGULARIZATION FINITE ELEMENT METHOD FOR A DOUBLE CURL PROBLEM WITH DIVERGENCE-FREE CONSTRAINT

A DELTA-REGULARIZATION FINITE ELEMENT METHOD FOR A DOUBLE CURL PROBLEM WITH DIVERGENCE-FREE CONSTRAINT A DELTA-REGULARIZATION FINITE ELEMENT METHOD FOR A DOUBLE CURL PROBLEM WITH DIVERGENCE-FREE CONSTRAINT HUOYUAN DUAN, SHA LI, ROGER C. E. TAN, AND WEIYING ZHENG Abstract. To deal with the divergence-free

More information