ESAIM: M2AN Modélisation Mathématique et Analyse Numérique M2AN, Vol. 37, N o 2, 2003, pp DOI: /m2an:
|
|
- Joella Sutton
- 5 years ago
- Views:
Transcription
1 Mathematical Modelling and Numerical Analysis SAIM: MAN Modélisation Mathématique et Analyse Numérique MAN, Vol. 37, N o, 3, pp. 9 5 DOI:.5/man:33 A FINIT LMNT MTHOD FOR DOMAIN DCOMPOSITION WITH NON-MATCHING GRIDS Roland Becker, Peter Hansbo and Rolf Stenberg 3 Abstract. In this note, we propose and analyse a method for handling interfaces between nonmatching grids based on an approach suggested by Nitsche (97) for the approximation of Dirichlet boundary conditions. The exposition is limited to self-adjoint elliptic problems, using Poisson s equation as a model. A priori and a posteriori error estimates are given. Some numerical results are included. Mathematics Subject Classification. 65N3, 65N55. Received: September 3,. Revised: October,.. Introduction In any domain decomposition method, one has to define how the continuity between the subdomains is to be enforced. Different approaches have been proposed: Iterative procedures, enforcing that the approximate solution or its normal derivative or combinations thereof should be continuous across interfaces. This forms the basis for the standard Schwarz alternating method as defined, e.g., by Lions [6]. Direct procedures, using Lagrange multiplier techniques to achieve continuity. Different variants have been proposed, e.g., by Le Tallec and Sassi [5], and Bernadi et al. [8]. The multiplier method has the advantage of directly yielding a solvable global system. However, in the latter method, new unknowns (the multipliers) must be introduced and solved for. The method must then either satisfy the inf-sup condition, which necessitates special choices of multiplier spaces (such as mortar elements, cf. [8]), or then stabilization techniques (cf. [3,4,9]) must be used. In this paper, we consider a third possibility, i.e. Nitsche s method [7], which was originally introduced for the purpose of solving Dirichlet problems without enforcing the boundary conditions in the definition of the finite element spaces. This method has later been used by Arnold [] for the discretization of second order elliptic equations by discontinuous finite elements. In earlier papers [8, 9] we have pointed out the close connection between Nitsche s method and stabilized methods and proposed it as a mortaring method. In this paper we will give a more detailed analysis of this domain decomposition technique where independent approximations Keywords and phrases. Nitsche s method, domain decomposition, non-matching grids. Institute of Applied Mathematics, University of Heidelberg, INF 94, 69 Heidelberg, Germany. Department of Applied Mechanics, Chalmers University of Technology, 4 96 Göteborg, Sweden. hansbo@am.chalmers.se 3 Institute of Mathematics, Box, 5 Helsinki University of Technology, Finland. c DP Sciences, SMAI 3
2 R. BCKR T AL. are used on the different subdomains. The continuity of the solution across interfaces is enforced weakly, but in such a way that the resulting discrete scheme is consistent with the original partial differential equation. Under some regularity assumptions we derive both aprioriand a posteriori error estimates. We also give numerical results obtained with the method. Although we discuss its application to domain decomposition, the same technique is also suited for other applications, e.g., to handle diffusion terms in the discontinuous Galerkin method [, 6]; to simplify mesh generation (different parts can be meshed independently from each other); finite element methods with different polynomial degree on adjacent elements; new finite element methods such as linear approximations on quadrilaterals.. The domain decomposition method In this section we will introduce the mortaring method based on the classical method of Nitsche. We will perform a classical stability and apriorierror analysis. For simplicity, we consider the model Poisson problem, i.e. of solving the partial differential equation u = f in Ω, u = on Ω, () where Ω is a bounded domain in two or three space dimensions and f L (Ω). Likewise for ease of presentation, we consider only the case where Ω is divided into two non-overlapping subdomains Ω and Ω,Ω Ω, with interface = Ω Ω. We further assume that the subdomains are polyhedral (or polygonal in R ) and that is polygonal (or a broken line). This equation can be written in weak form as: find u H (Ω) such that where a(u, v) = a(u, v) =(f,v), v H (Ω), () Ω u vdx, (f,v) = Ω fvdx, (3) and H (Ω) is the space of square-integrable functions, with square-integrable first derivatives, that vanish on the boundary Ω of Ω. Our discrete method for the approximate solution of () is a nonconforming finite element method which is continuous within each Ω i and discontinuous across. We start by rewriting the original problem () as two equations and the interface conditions: u i = f in Ω i, i =,, u i = on Ω Ω i, i =,, u u = on, (4) u + u = on. Here, n i is the outward unit normal to Ω i. We will perform our analysis under the following regularity assumption. Assumption.. The solution of () satisfies u H s (Ω), withs>3/.
3 A FINIT LMNT MTHOD FOR DOMAIN DCOMPOSITION WITH NON-MATCHING GRIDS With this assumption it holds u i / i L () and the two problems () and (4) are equivalent (see for example []) with: u Ωi = u i, i =,. (5) In the following we will therefore write u =(u,u ) V V with the continuous spaces V i = { v i H (Ω i ): v i / i L (), v i Ω Ωi = }, i =,. To formulate our method, we suppose that we have regular finite element partitionings Th i Ω i into shape regular simplexes. These two meshes induce trace meshes on the interface of the subdomains G i h = { : = K, K T i h} (6) By h K and h we denote the diameter of element K Th i and Gi h, respectively. For the purpose of the apriorianalysis, we also define In our analysis we will need the following assumption. h =max{h K,h : K T i h, G i h,, } Assumption.. There exists positive constants C,C such that C h h C h holds for all pairs (, ) Th T h,with. We seek the approximation u h =(u,h,u,h )inthespacev h = V h V h,where V h i = { v i V i : v i K is a polynomial of degree p for all K T i h}, choosing for simplicity p constant on all subdomains. On the interface we will use the notation for the jump, for the average and v, w S := S [v]] := v v (7) {v} := v + v (8) vwds, for S Gh i, or S =. (9) Finally, we denote n := n = n. () With this notation we have { } v = v v () and hence { } u = u = u = u () The methods of Nitsche [7] and Arnold [] now give the following domain decomposition method. Mortar method. Find u h V h such that a h (u h,v)=f h (v) v V h, (3)
4 R. BCKR T AL. with a h (w, v) := [( w i, v i ) Ωi + γ { w }, [v]] G i h { v [w]], [v ] ] }, [w]] (4) and f h (v) := where γ> is chosen sufficiently large, see Lemma.6 below. The first observation is that this formulation gives a consistent method. Lemma.3. The solution u =(u,u ) to (4) satisfies (f,v i ) Ωi, (5) a h (u, v) =f h (v) v V. (6) Proof. Multiplying the first equation in (4) with v i, integrating over Ω i, using Greens formula and the relations () yields f h (v) = = (f,v i ) Ωi = ( u i, v i ) Ωi [ ] ui ( u i, v i ) Ωi,v i i { } u, [v ] (7) Since [u] = on we have = { } v, [u] + γ Gh i [[u], [v]]. (8) Adding (7) and (8) the gives the claim. For the stability analysis below we need the following mesh-dependent dual norms. To emphasize that is to be considered as a part of Ω i we write i. v /,h, i = v L () (9) G i h and v /,h, i = h v L (), () which satisfy The analysis will be performed using the norms G i h v, w v /,h,i w /,h,i. () ( ) v,h = v i L(Ωi) + [v]] /,h,i ()
5 A FINIT LMNT MTHOD FOR DOMAIN DCOMPOSITION WITH NON-MATCHING GRIDS 3 and v,h = v,h + v i i /,h, i (3) The following estimate is readily proved by local scaling. Lemma.4. There is a positive constant C I such that v i i C I v i L (Ω i) /,h, i v i Vi h. (4) For linear elements v is constant on each element and then it is particularly easy to give a bound for the constant C I, see Remark. below. A immediate consequence of the above lemma is the equivalence of norms in the finite element subspace. Lemma.5. The norms,h and,h are equivalent on the subspace V h. The stability of the method can now be proved. Lemma.6. Suppose that γ>c I /4. Then it holds a h (v, v) C v,h v V h. Proof. From the definition (4), the relation (), and the preceding lemmas we get a h (v, v) = = [ ] { } v i L(Ωi) v + γ [v [v]], ] /,h,i [ ] v i L(Ωi) + γ [v [v ], v + [v]], v ] /,h,i [ v i L + γ [[v (Ω i) ] /,h, i [v]], v ] i i [ ] v i L + γ v i (Ω i) [v]] /,h, i [v ] /,h,i i /,h,i [( C ) ( I v i L(Ωi) ε + γ ε ) ] [v]] /,h,i C v,h C v,h, for γ>ε/and choosing ε>c I /. The following interpolation estimates holds, cf. []. Lemma.7. Suppose that u H s (Ω), with3/ <s p +. Then it holds inf v V h u v,h Ch s u Hs (Ω) (5) and inf v V h u v,h Ch s u H s (Ω). (6)
6 4 R. BCKR T AL. We are now able to prove the following apriorierror estimate. Theorem.8. Suppose γ>c I /4. Then it holds If u H s (Ω), for3/ <s p +,then u u h,h C inf v V h u v,h. u u h,h Ch s u Hs (Ω). Proof. Since the bilinear form a h is bounded with respect to the norm,h, the first inequality follows from the stability estimate of Lemma.6 and the triangle inequality. The second estimate then follows from Lemma.7. Remark.9. As [u] = on the error estimate gives [u h ]] /,h,i = O(h s ). For quasi-uniform meshes it then holds [u h ]] = L() O(hs / ). Remark.. The presented method resembles a mesh-dependent penalty method, but with added consistency terms involving normal derivatives across the interface. Note that the formulation allows us to deduce optimal order error estimates with preserved condition number of O(h ) for a quasiuniform mesh. Pure penalty methods, in contrast, are not consistent, and optimal error estimates require degrading the condition number for higher polynomial approximation (cf. [5]). Remark.. The form a h (, ) in (4) is symmetric and positive definite, which is natural as the problem to be approximated has the same properties. With this there exists fast solvers, such as preconditioned conjugate gradients, for the resulting matrix problem. If the bilinear form is changed to a h (w, v) := [( w i, v i ) Ωi + γ { w }, [v]] + G i h { v [w]], [v ] ] }, [w]], (7) then one obtains a method which is stable for all positive values of γ: a h (v, v) C v,h v V h, γ >. If the Laplace operator is a part of a problem which is not symmetric, then it might be practical to use this nonsymmetric bilinear form. See [, ] for applications to convection diffusion problems. Remark.. For linear elements v i (v i Vi h ) is constant on each element and hence for K Ti h base Gh i we have v i i =meas() v i, i and v i,k v i i =meas(k) v i i and hence it holds v i h i,,k h meas() meas(k) with the (8) (9) v i,k. (3)
7 A FINIT LMNT MTHOD FOR DOMAIN DCOMPOSITION WITH NON-MATCHING GRIDS 5 Hence, once the shape regularity of the mesh is specified, one has a bound for C I. In a practical implementation easier would be to replace the weight γ in (4) with a parameter α K = α meas() meas(k), (3) with α>/4 fixed. With this all results of the paper hold. Remark.3. We have performed our analysis assuming that the solution is sufficiently smooth, i.e. that u H s (Ω) with s>3/. The analysis can be extended for less regular solutions if the corner and transmission singularities are carefully taken into account, cf. the recent papers [,3]. 3. A POSTRIORI error estimates We will first consider control of the error e = u u h in the mesh dependent energy norm,h. We define the local and global estimators as [[ ]] K (u h ) = h K f + u h L + h uh (K) K K L ( K) + K [u h ] L ( K) (3) and [ ] / (u h )= K (u h ). (33) To be able to control the normal derivatives across the interface, we are forced to introduce a saturation assumption. This assumption is consistent with the Assumption. on the regularity of the solution and the interpolation estimates of Theorem.7. Assumption 3.. There is a constant C such that u u h,h C u u h,h. (34) We also remark that an analog assumption is used in the context of a posteriori error estimates for the mortar element method, see Wohlmuth []. The a posteriori estimate is now the following. Theorem 3.. Suppose that the Assumption 3. is valid. Then there is a positive constant C such that Proof. We denote e = u u h. By Lemma.3 we have { } e,h = a h(e, e)+ [e], +( γ) u u h,h C(u h ). (35) Gh i [[e], [e] := R + R, (36) with and R := a h (e, e), { } R := [e], +( γ) [e] /,h, i.
8 6 R. BCKR T AL. Since [e] =[u h ] Assumption 3. gives R = [u h ]], [u h ], +( γ) [e] /,h, i ( ) i C [[u h ] /,h,i i + [u h ] /,h,i [e] /,h,i /,h,i C e,h ( [u h ] /,h,i ) C e,h (u h ). (37) Next, let π h e be the Clément interpolant to e, which satisfies ( ( h K e π he L + (K) h K e π he L ( K) ) ) / C e,h (38) and e π h e,h C e,h. (39) From the consistency (.3) we have a h (e, π h e)=. Hence R = a h (e, e) =a h (e, e π h e) = ( e i, (e i π h e i )) Ωi + γ Integrating by parts on each K T h yields G i h [e], [e π h e] { } { } (e πh e), [e π h e], [e] := S + S + S 3 + S 4. (4) S = ( e i, (e i π h e i )) Ωi (4) = := T + T. ( ) ( e, e π h e) K +,e π h e K K Since on K T h it holds e = u + u h = f + u h, the first term above is estimated using (38) T = ( e, e π h e) K (4) ( ) / ( ) / h K u h + f L (K) h K e π he L (K) ( ) / h K u h + f L (K) e,h.
9 A FINIT LMNT MTHOD FOR DOMAIN DCOMPOSITION WITH NON-MATCHING GRIDS 7 Let I h be the collection of element sides in the interiors of the subdomains Ω i. The boundary integrals in (4) above we now split into those in I h and those lying on the interface : T =,e π h e (43) K = I h,e π h e K +,e π h e +,e π h e The integrals over the interior sides can now be grouped together two by two yielding the estimate [ [[ ]] ],e π h e I h C h K uh / [ / K e π he L K ( K)] (44) L ( K) [ [[ ]] ] C uh / e,h, K where (38) was used. Using the definition () we have { S 3 = = h K }, [e π h e] =,e π h e L ( K) +,e π h e (e π h e ) +, (e π h e ) (45) Combining these terms with two last terms in (43) gives { },e π h e +,e π h e, [[e π h e] ( = ) + (,e π h e + + ), (e π h e ) = +,e π h e + +,e π h e = (e e ),e π h e + (e e ),e π h e = [[ ]],e π h e + [[ ]],e π h e = [[ ]] uh,e π h e + [[ ]] uh,e π h e [ ] / (u h) K e π he L ( K) C(u h ) e,h. (46) From (4) to (46) we now get S + S 3 C e,h (u h ). (47)
10 8 R. BCKR T AL. From the Clément estimate (38) have S = γ Gh i [e], [e π h e] C e,h (u h ). To estimate the last term S 4 we use Lemma.4 and the Assumption 3. { } { } { } (e πh e) πh e S 4 =, [e] =, [[e] +, [e] C e,h (u h ). (48) Hence, collecting the estimates (4) to (48) yields which together with (37) proves the estimate R C e,h (u h ), (49) u u h,h = e,h C(u h ). (5) The claim then follows from (34). Next, we consider the error in the L -norm. This is measured with the estimator L(u h )= [ h K K (u h ) ] /. (5) For the a posteriori estimate we as usual, need the H -regularity but not Assumption 3.. Theorem 3.3. Let z be the solution to the problem z = g in Ω, z = on Ω, (5) and suppose that the shift theorem is valid. Then there is a positive constant C such that z H (Ω) C g L (Ω) (53) u u h L(Ω) CL(u h). (54) Proof. We again write z =(z,z ) and note that z + z = and { } z = z = z
11 A FINIT LMNT MTHOD FOR DOMAIN DCOMPOSITION WITH NON-MATCHING GRIDS 9 Choosing g = u u h in (5) we then get u u h L (Ω) = = = [ zi ( z i, (u i u i,h )) Ωi,u i u i,h i [ ] zi ( z i, (u i u i,h )) Ωi +,u i,h i ( z i, (u i u i,h )) Ωi + { z }, [[u h ] i i ] (55) We let π h z V h be the Clément interpolant to z satisfying ( ( h 4 K z π hz L (K) + h 3 K z π hz L ( K) + h K (z π h z) K L ( K) )) / C z H(Ω). (56) From the consistency condition we have a h (u u h,π h z) =, and since [z ] =, [u] =, on the interface, we get =a h (u u h,π h z) (57) = ( (u i u i,h ), π h z i ) Ωi + γ [u u h ]], [π h z ] G i h { } { (u uh ) πh z, [π h z ] = ( (u i u i,h ), π h z i ) Ωi + γ { (u uh ) + }, [z π h z ] + G i h }, [u u h ] { πh z [ u h ], [z π h z ] }, [u h ]] Substracting (57) from (55) gives u u h L = (Ω) ( (z i π h z, (u i u i,h )) Ωi γ G i h [[ u h ], [z π h z ] { } { } (u uh ) (z πh z), [z π h z ] +, [u h ]] := R + R + R 3 + R 4. (58)
12 R. BCKR T AL. Using Schwarz inequality and the Clément estimate (56) we get R + R 4 C ( ( h 3 K z π hz L ( K) + h K C z H (Ω) L(u h) C u u h L(Ω) L(u h). (z π h z) K L ( K) )) / h [[u h ] L() G i h / Integrating by parts yields R + R 3 = [ ( (z i π h z, (u i u i,h )) Ωi { } (u uh ), [z π h z ] = { (z π h z, (u h u)) K (u uh ) + K { (u uh ) =,z π h z K } }, [z π h z ] (z π h z, u h + f) K + (u uh ),z π h z I h (ui u i,h ) +,z i π h z i i { } (u uh ), [z π h z ] The boundary terms in the second term above are grouped together two by two yielding jump terms in the normal derivative. This gives the estimate (u uh ) (z π h z, u h + f) K + I h ( ( C h 4 K,z π h z z π hz L + (K) h 3 K z π hz L ( K) ( [[ ]] h 4 K f + u h L + (K) h3 uh K K C z H (Ω) L(u h) C u u h L(u L(Ω) h). L ( K) ) ) / ) / (59)
13 A FINIT LMNT MTHOD FOR DOMAIN DCOMPOSITION WITH NON-MATCHING GRIDS The remaining two terms are estimated as follows { } (ui u i,h ) (u uh ),z i π h z i, [z π h z ] i ui ui,h u =,z i π h z i,z i π h z i i i, [z π h z ] + { } ui,h uh =,z i π h z i +, [[z π h z ] i u,h u,h =,z π h z,z π h z + u,h,z π h z u,h,z π h z + u,h,z π h z = u,h,z π h z u,h,z π h z u,h,z π h z = u,h + u,h,z π h z u,h + u,h,z π h z = [[ ]] uh,z π h z [[ ]] uh,z π h z ( ) / CL(u h ) z π hz L ( K) h 3 K CL(u h ) z H (Ω) CL(u h) u u h L(Ω). Combining (59) and (6) gives { } uh, [z π h z ] u,h,z π h z u,h,z π h z (6) R + R 3 CL(u h ) u u h L(Ω) which together with (59) and (58) proves the claim. 4. Numerical examples 4.. Numerical verification of the aprioriestimates To verify the aprioriestimates, we choose the model problem of a unit square with exact solution u = xy( x)( y) corresponding to a right-hand side of f =(x x + y y ). The domain is divided by a vertical slit at x =.7. Two different triangulations were used: one matching and one non-matching (see Fig. ). In Figure (left-hand side) we give the convergence in the broken energy norm. The dashed line is the non-matching grid computation. Both meshes show the same convergence with slope.95. which is close to the theoretical value of. On the right-hand side we show the convergence of the L -norm of the jump term (dashed line for the non-matching grid). Here we obtain a better convergence (slope.5) for the matching grids than for the non-matching grids (slope.57, close to the theoretical value of 3/). 4.. Adaptive computations We present results of adaptive computations on the L-shaped domain Ω=(, ) (, ) \ (/, ) (, /).
14 R. BCKR T AL. Figure. Matching and non-matching grids. log(energy error) log(interface jump) log(h) log(h) Figure. Convergence in energy and convergence of the jump term. The problem is boundary driven (f = ), with boundary data corresponding to the exact solution u = r /3 sin (θ/3) in polar coordinates (with origin at (/, /)). We let Ω = (, /) (, ) and Ω = (/, ) (/, ), and use a non-matching triangulation. The purpose of this example is not to obtain exact error control, but rather to show how the adaptive algorithm behaves with respect to the elements adjacent to the interface. We consider adaptive control of the L -norm error, but we have not made any attempt to measure the constant in the inequality (53); instead we have simply tuned the interpolation constants to approximately match the exact error. In Figures 3 and 4 we show the first and last (adapted) meshes resulting from equilibrating the error distribution over the set of elements (for details, see [7,4]). In Figure 5 we show the exact and estimated L -errors on the sequence of meshes, which show a reasonable agreement. For more exact error control, more computational effort must be invested.
15 A FINIT LMNT MTHOD FOR DOMAIN DCOMPOSITION WITH NON-MATCHING GRIDS 3 Figure 3. First mesh and final adapted mesh Figure 4. levation of the solution Difference between matching and non-matching meshes In the previous example, the adaptive algorithm produced a slightly finer mesh on the interface. One natural question is then whether the effect of non-matching actually does lead to larger errors. In Figures 6 and 7 we show two different meshes for solving the problem described in Section 4., and the corresponding nodal interpolants of the errors. The interface is situated at x =/, and it is noted that the error on the interface is markedly larger than in the interior of the domains only in the case of non-matching meshes.
16 4 R. BCKR T AL.. xact L-error stimated L-error Figure 5. stimated and exact errors in the L (Ω)-norm..9.8 x Figure 6. Matching meshes and nodal errors. x Figure 7. Non-matching meshes and nodal errors.
17 A FINIT LMNT MTHOD FOR DOMAIN DCOMPOSITION WITH NON-MATCHING GRIDS 5 References [] J.-P. Aubin, Approximation of lliptic Boundary-Value Problem. Wiley (97). [] D. Arnold, An interior penalty finite element method with discontinuous elements. SIAM J. Numer. Anal. 9 (98) [3] C. Baiocchi, F. Brezzi and L.D. Marini, Stabilization of Galerkin methods and applications to domain decomposition, in Future Tendencies in Computer Science, Control and Applied Mathematics, A. Bensoussan and J.-P. Verjus ds., Springer (99) [4] J.C. Barbosa and T.J.R. Hughes, Boundary Lagrange multipliers in finite element methods: error analysis in natural norms. Numer. Math. 6 (99) 5. [5] J.W. Barrett and C.M. lliot, Finite element approximation of the Dirichlet problem using the boundary penalty method. Numer. Math. 49 (986) [6] R. Becker and P. Hansbo, Discontinuous Galerkin methods for convection-diffusion problems with arbitrary Péclet number, in Numerical Mathematics and Advanced Applications: Proceedings of the 3rd uropean Conference, P. Neittaanmäki, T. Tiihonen and P. Tarvainen ds., World Scientific () 9. [7] R. Becker and R. Rannacher, A feed-back approach to error control in finite element methods: basic analysis and examples. ast-west J. Numer. Math. 4 (996) [8] C. Bernadi, Y. Maday and A. Patera, A new nonconforming approach to domain decomposition: the mortar element method, in Nonlinear Partial Differential quations and Their Application, H. Brezis and J.L. Lions ds., Pitman (989). [9] F. Brezzi, L.P. Franca, D. Marini and A. Russo, Stabilization techniques for domain decomposition methods with non-matching grids, IAN-CNR Report N. 37, Istituto di Analisi Numerica Pavia. [] J. Freund and R. Stenberg, On weakly imposed boundary conditions for second order problems, in Proceedings of the Ninth Int. Conf. Finite lements in Fluids, M. Morandi Cecchi et al. ds., Venice (995) [] J. Freund, Space-time finite element methods for second order problems: an algorithmic approach. Acta Polytech. Scand. Math. Comput. Manage. ng. Ser. 79 (996). [] B. Heinrich and S. Nicaise, Nitsche mortar finite element method for transmission problems with singularities. SFB393-Preprint -, Technische Universität Chemnitz (). [3] B. Heinrich and K. Pietsch, Nitsche type mortaring for some elliptic problem with corner singularities. Computing 68 () [4] C. Johnson and P. Hansbo, Adaptive finite element methods in computational mechanics. Comput. Methods Appl. Mech. ngrg. (99) [5] P. Le Tallec and T. Sassi, Domain decomposition with nonmatching grids: augmented Lagrangian approach. Math. Comp. 64 (995) [6] P.L. Lions, On the Schwarz alternating method III: a variant for nonoverlapping subdomains, in Third International Symposium on Domain Decomposition Methods for Partial Differential quations, T.F. Chan, R. Glowinski, J. Periaux and O.B. Widlund ds., SIAM (989) 3. [7] J. Nitsche, Über ein Variationsprinzip zur Lösung von Dirichlet-Problemen bei Verwendung von Teilräumen, die keinen Randbedingungen unterworfen sind. Abh. Math. Sem. Univ. Hamburg 36 (97) 9 5. [8] R. Stenberg, On some techniques for approximating boundary conditions in the finite element method. J. Comput. Appl. Math. 63 (995) [9] R. Stenberg, Mortaring by a method of J.A. Nitsche, in Computational Mechanics: New Trends and Applications, S. Idelsohn,. Onate and. Dvorkin ds., CIMN, Barcelona (998). [] V. Thomée, Galerkin Finite lement Methods for Parabolic Problems. Springer (997). [] B.I. Wohlmuth, A residual based error estimator for mortar finite element discretizations. Numer. Math. 84 (999) 43 7.
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 informationPREPRINT 2010:25. Fictitious domain finite element methods using cut elements: II. A stabilized Nitsche method ERIK BURMAN PETER HANSBO
PREPRINT 2010:25 Fictitious domain finite element methods using cut elements: II. A stabilized Nitsche method ERIK BURMAN PETER HANSBO Department of Mathematical Sciences Division of Mathematics CHALMERS
More informationPARTITION 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 informationENERGY NORM A POSTERIORI ERROR ESTIMATES FOR MIXED FINITE ELEMENT METHODS
ENERGY NORM A POSTERIORI ERROR ESTIMATES FOR MIXED FINITE ELEMENT METHODS CARLO LOVADINA AND ROLF STENBERG Abstract The paper deals with the a-posteriori error analysis of mixed finite element methods
More informationarxiv: v1 [math.na] 13 Sep 2016
THE PENALTY FREE NITSCHE METHOD AND NONCONFORMING FINITE ELEMENTS FOR THE SIGNORINI PROBLEM ERIK BURMAN, PETER HANSBO, AND MATS G. LARSON arxiv:1609.03745v1 [math.na] 13 Sep 2016 Abstract. We design and
More informationA SIMPLE TUTORIAL ON DISCONTINUOUS GALERKIN METHODS. Jennifer Proft CERMICS, ENPC. J. Proft CERMICS, ENPC
A SIMPLE TUTORIAL ON DISCONTINUOUS GALERKIN METHODS Jennifer Proft Outline Definitions A simple example Issues Historical development elliptic equations hyperbolic equations Discontinuous vs. continuous
More informationA Balancing Algorithm for Mortar Methods
A Balancing Algorithm for Mortar Methods Dan Stefanica Baruch College, City University of New York, NY 11, USA Dan Stefanica@baruch.cuny.edu Summary. The balancing methods are hybrid nonoverlapping Schwarz
More informationA PENALTY FREE NON-SYMMETRIC NITSCHE TYPE METHOD FOR THE WEAK IMPOSITION OF BOUNDARY CONDITIONS
A PENALTY FREE NON-SYMMETRIC NITSCHE TYPE METHOD FOR THE WEAK IMPOSITION OF BOUNDARY CONDITIONS ERIK BURMAN Abstract. In this note we show that the non-symmetric version of the classical Nitsche s method
More informationLocal discontinuous Galerkin methods for elliptic problems
COMMUNICATIONS IN NUMERICAL METHODS IN ENGINEERING Commun. Numer. Meth. Engng 2002; 18:69 75 [Version: 2000/03/22 v1.0] Local discontinuous Galerkin methods for elliptic problems P. Castillo 1 B. Cockburn
More informationEnergy norm a-posteriori error estimation for divergence-free discontinuous Galerkin approximations of the Navier-Stokes equations
INTRNATIONAL JOURNAL FOR NUMRICAL MTHODS IN FLUIDS Int. J. Numer. Meth. Fluids 19007; 1:1 [Version: 00/09/18 v1.01] nergy norm a-posteriori error estimation for divergence-free discontinuous Galerkin approximations
More informationENERGY NORM A POSTERIORI ERROR ESTIMATES FOR MIXED FINITE ELEMENT METHODS
MATHEMATICS OF COMPUTATION Volume 75, Number 256, October 2006, Pages 1659 1674 S 0025-57180601872-2 Article electronically published on June 26, 2006 ENERGY NORM A POSTERIORI ERROR ESTIMATES FOR MIXED
More informationFINITE ELEMENT CENTER
FINITE ELEMENT CENTER PREPRINT 2004 09 A posteriori error analysis of the boundary penalty method Kenneth Eriksson, Mats G. Larson, and Axel Målqvist Chalmers Finite Element Center CHALMERS UNIVERSITY
More informationMIXED FINITE ELEMENT METHODS FOR PROBLEMS WITH ROBIN BOUNDARY CONDITIONS
MIXED FINITE ELEMENT METHODS FOR PROBLEMS WITH ROBIN BOUNDARY CONDITIONS JUHO KÖNNÖ, DOMINIK SCHÖTZAU, AND ROLF STENBERG Abstract. We derive new a-priori and a-posteriori error estimates for mixed nite
More informationAn 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 informationRemarks on the analysis of finite element methods on a Shishkin mesh: are Scott-Zhang interpolants applicable?
Remarks on the analysis of finite element methods on a Shishkin mesh: are Scott-Zhang interpolants applicable? Thomas Apel, Hans-G. Roos 22.7.2008 Abstract In the first part of the paper we discuss minimal
More informationNon-Conforming Finite Element Methods for Nonmatching Grids in Three Dimensions
Non-Conforming Finite Element Methods for Nonmatching Grids in Three Dimensions Wayne McGee and Padmanabhan Seshaiyer Texas Tech University, Mathematics and Statistics (padhu@math.ttu.edu) Summary. In
More informationPREPRINT 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 informationAn A Posteriori Error Estimate for Discontinuous Galerkin Methods
An A Posteriori Error Estimate for Discontinuous Galerkin Methods Mats G Larson mgl@math.chalmers.se Chalmers Finite Element Center Mats G Larson Chalmers Finite Element Center p.1 Outline We present an
More informationHybridized 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 informationThe Mortar Wavelet Method Silvia Bertoluzza Valerie Perrier y October 29, 1999 Abstract This paper deals with the construction of wavelet approximatio
The Mortar Wavelet Method Silvia Bertoluzza Valerie Perrier y October 9, 1999 Abstract This paper deals with the construction of wavelet approximation spaces, in the framework of the Mortar method. We
More informationA Balancing Algorithm for Mortar Methods
A Balancing Algorithm for Mortar Methods Dan Stefanica Baruch College, City University of New York, NY, USA. Dan_Stefanica@baruch.cuny.edu Summary. The balancing methods are hybrid nonoverlapping Schwarz
More informationOn 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 informationarxiv: v1 [math.na] 29 Feb 2016
EFFECTIVE IMPLEMENTATION OF THE WEAK GALERKIN FINITE ELEMENT METHODS FOR THE BIHARMONIC EQUATION LIN MU, JUNPING WANG, AND XIU YE Abstract. arxiv:1602.08817v1 [math.na] 29 Feb 2016 The weak Galerkin (WG)
More informationAn a posteriori error estimate and a Comparison Theorem for the nonconforming P 1 element
Calcolo manuscript No. (will be inserted by the editor) An a posteriori error estimate and a Comparison Theorem for the nonconforming P 1 element Dietrich Braess Faculty of Mathematics, Ruhr-University
More informationAn additive average Schwarz method for the plate bending problem
J. Numer. Math., Vol. 10, No. 2, pp. 109 125 (2002) c VSP 2002 Prepared using jnm.sty [Version: 02.02.2002 v1.2] An additive average Schwarz method for the plate bending problem X. Feng and T. Rahman Abstract
More informationThe mortar element method for quasilinear elliptic boundary value problems
The mortar element method for quasilinear elliptic boundary value problems Leszek Marcinkowski 1 Abstract We consider a discretization of quasilinear elliptic boundary value problems by the mortar version
More informationb 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 informationBasic Concepts of Adaptive Finite Element Methods for Elliptic Boundary Value Problems
Basic Concepts of Adaptive Finite lement Methods for lliptic Boundary Value Problems Ronald H.W. Hoppe 1,2 1 Department of Mathematics, University of Houston 2 Institute of Mathematics, University of Augsburg
More informationAcceleration of a Domain Decomposition Method for Advection-Diffusion Problems
Acceleration of a Domain Decomposition Method for Advection-Diffusion Problems Gert Lube 1, Tobias Knopp 2, and Gerd Rapin 2 1 University of Göttingen, Institute of Numerical and Applied Mathematics (http://www.num.math.uni-goettingen.de/lube/)
More information1. Introduction. We consider the model problem that seeks an unknown function u = u(x) satisfying
A SIMPLE FINITE ELEMENT METHOD FOR LINEAR HYPERBOLIC PROBLEMS LIN MU AND XIU YE Abstract. In this paper, we introduce a simple finite element method for solving first order hyperbolic equations with easy
More informationPhD dissertation defense
Isogeometric mortar methods with applications in contact mechanics PhD dissertation defense Brivadis Ericka Supervisor: Annalisa Buffa Doctor of Philosophy in Computational Mechanics and Advanced Materials,
More informationSome New Elements for the Reissner Mindlin Plate Model
Boundary Value Problems for Partial Differential Equations and Applications, J.-L. Lions and C. Baiocchi, eds., Masson, 1993, pp. 287 292. Some New Elements for the Reissner Mindlin Plate Model Douglas
More informationA Priori Error Analysis for Space-Time Finite Element Discretization of Parabolic Optimal Control Problems
A Priori Error Analysis for Space-Time Finite Element Discretization of Parabolic Optimal Control Problems D. Meidner and B. Vexler Abstract In this article we discuss a priori error estimates for Galerkin
More informationAdditive Average Schwarz Method for a Crouzeix-Raviart Finite Volume Element Discretization of Elliptic Problems
Additive Average Schwarz Method for a Crouzeix-Raviart Finite Volume Element Discretization of Elliptic Problems Atle Loneland 1, Leszek Marcinkowski 2, and Talal Rahman 3 1 Introduction In this paper
More information20. A Dual-Primal FETI Method for solving Stokes/Navier-Stokes Equations
Fourteenth International Conference on Domain Decomposition Methods Editors: Ismael Herrera, David E. Keyes, Olof B. Widlund, Robert Yates c 23 DDM.org 2. A Dual-Primal FEI Method for solving Stokes/Navier-Stokes
More informationA Finite Element Method Using Singular Functions for Poisson Equations: Mixed Boundary Conditions
A Finite Element Method Using Singular Functions for Poisson Equations: Mixed Boundary Conditions Zhiqiang Cai Seokchan Kim Sangdong Kim Sooryun Kong Abstract In [7], we proposed a new finite element method
More informationDiscontinuous 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 informationA posteriori error estimates applied to flow in a channel with corners
Mathematics and Computers in Simulation 61 (2003) 375 383 A posteriori error estimates applied to flow in a channel with corners Pavel Burda a,, Jaroslav Novotný b, Bedřich Sousedík a a Department of Mathematics,
More informationHamburger 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 informationSTABILIZED DISCONTINUOUS FINITE ELEMENT APPROXIMATIONS FOR STOKES EQUATIONS
STABILIZED DISCONTINUOUS FINITE ELEMENT APPROXIMATIONS FOR STOKES EQUATIONS RAYTCHO LAZAROV AND XIU YE Abstract. In this paper, we derive two stabilized discontinuous finite element formulations, symmetric
More informationYongdeok 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 informationAnalysis of discontinuous Galerkin methods using mesh-dependent norms and applications to problems with rough data
Calcolo 2017 54:1533 1551 https://doi.org/10.1007/s10092-017-0240-5 Analysis of discontinuous Galerkin methods using mesh-dependent norms and applications to problems with rough data Emmanuil H. Georgoulis
More informationFind (u,p;λ), with u 0 and λ R, such that u + p = λu in Ω, (2.1) div u = 0 in Ω, u = 0 on Γ.
A POSTERIORI ESTIMATES FOR THE STOKES EIGENVALUE PROBLEM CARLO LOVADINA, MIKKO LYLY, AND ROLF STENBERG Abstract. We consider the Stokes eigenvalue problem. For the eigenvalues we derive both upper and
More informationTwo-scale Dirichlet-Neumann preconditioners for boundary refinements
Two-scale Dirichlet-Neumann preconditioners for boundary refinements Patrice Hauret 1 and Patrick Le Tallec 2 1 Graduate Aeronautical Laboratories, MS 25-45, California Institute of Technology Pasadena,
More informationElectronic Transactions on Numerical Analysis Volume 32, 2008
Electronic Transactions on Numerical Analysis Volume 32, 2008 Contents 1 On the role of boundary conditions for CIP stabilization of higher order finite elements. Friedhelm Schieweck. We investigate the
More informationA Nonoverlapping Subdomain Algorithm with Lagrange Multipliers and its Object Oriented Implementation for Interface Problems
Contemporary Mathematics Volume 8, 998 B 0-88-0988--03030- A Nonoverlapping Subdomain Algorithm with Lagrange Multipliers and its Object Oriented Implementation for Interface Problems Daoqi Yang. Introduction
More informationMaximum norm estimates for energy-corrected finite element method
Maximum norm estimates for energy-corrected finite element method Piotr Swierczynski 1 and Barbara Wohlmuth 1 Technical University of Munich, Institute for Numerical Mathematics, piotr.swierczynski@ma.tum.de,
More informationConstruction 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 informationA 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 informationChapter 6 A posteriori error estimates for finite element approximations 6.1 Introduction
Chapter 6 A posteriori error estimates for finite element approximations 6.1 Introduction The a posteriori error estimation of finite element approximations of elliptic boundary value problems has reached
More informationA 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 informationSECOND 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 informationThomas Apel 1, Ariel L. Lombardi 2 and Max Winkler 1
Mathematical Modelling and Numerical Analysis Modélisation Mathématique et Analyse Numérique Will be set by the publisher ANISOTROPIC MESH REFINEMENT IN POLYHEDRAL DOMAINS: ERROR ESTIMATES WITH DATA IN
More informationMultigrid 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 informationSuperconvergence and H(div) Projection for Discontinuous Galerkin Methods
INTRNATIONAL JOURNAL FOR NUMRICAL MTHODS IN FLUIDS Int. J. Numer. Meth. Fluids 2000; 00:1 6 [Version: 2000/07/27 v1.0] Superconvergence and H(div) Projection for Discontinuous Galerkin Methods Peter Bastian
More informationA gradient recovery method based on an oblique projection and boundary modification
ANZIAM J. 58 (CTAC2016) pp.c34 C45, 2017 C34 A gradient recovery method based on an oblique projection and boundary modification M. Ilyas 1 B. P. Lamichhane 2 M. H. Meylan 3 (Received 24 January 2017;
More informationIMPROVED LEAST-SQUARES ERROR ESTIMATES FOR SCALAR HYPERBOLIC PROBLEMS, 1
Computational Methods in Applied Mathematics Vol. 1, No. 1(2001) 1 8 c Institute of Mathematics IMPROVED LEAST-SQUARES ERROR ESTIMATES FOR SCALAR HYPERBOLIC PROBLEMS, 1 P.B. BOCHEV E-mail: bochev@uta.edu
More informationScientific 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 informationETNA Kent State University
Electronic Transactions on Numerical Analysis. Volume 37, pp. 166-172, 2010. Copyright 2010,. ISSN 1068-9613. ETNA A GRADIENT RECOVERY OPERATOR BASED ON AN OBLIQUE PROJECTION BISHNU P. LAMICHHANE Abstract.
More informationOptimal Error Estimates for the hp Version Interior Penalty Discontinuous Galerkin Finite Element Method
Report no. 03/06 Optimal Error Estimates for the hp Version Interior Penalty Discontinuous Galerkin Finite Element Method Emmanuil H. Georgoulis and Endre Süli Oxford University Computing Laboratory Numerical
More informationFINITE ELEMENT APPROXIMATION OF ELLIPTIC DIRICHLET OPTIMAL CONTROL PROBLEMS
Numerical Functional Analysis and Optimization, 28(7 8):957 973, 2007 Copyright Taylor & Francis Group, LLC ISSN: 0163-0563 print/1532-2467 online DOI: 10.1080/01630560701493305 FINITE ELEMENT APPROXIMATION
More informationc 2008 Society for Industrial and Applied Mathematics
SIAM J. NUMER. ANAL. Vol. 46, No. 3, pp. 640 65 c 2008 Society for Industrial and Applied Mathematics A WEIGHTED H(div) LEAST-SQUARES METHOD FOR SECOND-ORDER ELLIPTIC PROBLEMS Z. CAI AND C. R. WESTPHAL
More informationBUBBLE STABILIZED DISCONTINUOUS GALERKIN METHOD FOR STOKES PROBLEM
BUBBLE STABILIZED DISCONTINUOUS GALERKIN METHOD FOR STOKES PROBLEM ERIK BURMAN AND BENJAMIN STAMM Abstract. We propose a low order discontinuous Galerkin method for incompressible flows. Stability of the
More informationA FETI-DP Method for Mortar Finite Element Discretization of a Fourth Order Problem
A FETI-DP Method for Mortar Finite Element Discretization of a Fourth Order Problem Leszek Marcinkowski 1 and Nina Dokeva 2 1 Department of Mathematics, Warsaw University, Banacha 2, 02 097 Warszawa, Poland,
More informationScientific 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 informationNONSTANDARD 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 informationNumerische Mathematik
Numer. Math. (1996) 75: 59 77 Numerische Mathematik c Springer-Verlag 1996 Electronic Edition A preconditioner for the h-p version of the finite element method in two dimensions Benqi Guo 1, and Weiming
More informationSpace-Time Nonconforming Optimized Schwarz Waveform Relaxation for Heterogeneous Problems and General Geometries
Space-Time Nonconforming Optimized Schwarz Waveform Relaxation for Heterogeneous Problems and General Geometries Laurence Halpern, Caroline Japhet, and Jérémie Szeftel 3 LAGA, Université Paris XIII, Villetaneuse
More informationTechnische Universität Graz
Technische Universität Graz Stability of the Laplace single layer boundary integral operator in Sobolev spaces O. Steinbach Berichte aus dem Institut für Numerische Mathematik Bericht 2016/2 Technische
More informationDifferent Approaches to a Posteriori Error Analysis of the Discontinuous Galerkin Method
WDS'10 Proceedings of Contributed Papers, Part I, 151 156, 2010. ISBN 978-80-7378-139-2 MATFYZPRESS Different Approaces to a Posteriori Error Analysis of te Discontinuous Galerkin Metod I. Šebestová Carles
More informationASM-BDDC Preconditioners with variable polynomial degree for CG- and DG-SEM
ASM-BDDC Preconditioners with variable polynomial degree for CG- and DG-SEM C. Canuto 1, L. F. Pavarino 2, and A. B. Pieri 3 1 Introduction Discontinuous Galerkin (DG) methods for partial differential
More informationA note on discontinuous Galerkin divergence-free solutions of the Navier-Stokes equations
A note on discontinuous Galerkin divergence-free solutions of the Navier-Stokes equations Bernardo Cockburn Guido anschat Dominik Schötzau June 1, 2007 Journal of Scientific Computing, Vol. 31, 2007, pp.
More informationSome remarks on the stability coefficients and bubble stabilization of FEM on anisotropic meshes
Some remarks on the stability coefficients and bubble stabilization of FEM on anisotropic meshes Stefano Micheletti Simona Perotto Marco Picasso Abstract In this paper we re-address the anisotropic recipe
More informationDomain Decomposition Methods for Mortar Finite Elements
Domain Decomposition Methods for Mortar Finite Elements Dan Stefanica Courant Institute of Mathematical Sciences New York University September 1999 A dissertation in the Department of Mathematics Submitted
More informationA u + b u + cu = f in Ω, (1.1)
A WEIGHTED H(div) LEAST-SQUARES METHOD FOR SECOND-ORDER ELLIPTIC PROBLEMS Z. CAI AND C. R. WESTPHAL Abstract. This paper presents analysis of a weighted-norm least squares finite element method for elliptic
More informationAMS 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 informationAn hp-adaptive Mixed Discontinuous Galerkin FEM for Nearly Incompressible Linear Elasticity
An hp-adaptive Mixed Discontinuous Galerkin FEM for Nearly Incompressible Linear Elasticity Paul Houston 1 Department of Mathematics, University of Leicester, Leicester LE1 7RH, UK (email: Paul.Houston@mcs.le.ac.uk)
More informationDomain 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 informationMultigrid Methods for Maxwell s Equations
Multigrid Methods for Maxwell s Equations Jintao Cui Institute for Mathematics and Its Applications University of Minnesota Outline Nonconforming Finite Element Methods for a Two Dimensional Curl-Curl
More informationA posteriori error estimates for non conforming approximation of eigenvalue problems
A posteriori error estimates for non conforming approximation of eigenvalue problems E. Dari a, R. G. Durán b and C. Padra c, a Centro Atómico Bariloche, Comisión Nacional de Energía Atómica and CONICE,
More informationA Discontinuous Galerkin method with weighted averages for advection-diffusion equations with locally vanishing and anisotropic diffusivity
MOX Report No. 7/7 A Discontinuous Galerkin method with weighted averages for advection-diffusion equations with locally vanishing and anisotropic diffusivity Alexandre Ern, Annette F. Stephansen, Paolo
More informationLecture 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 informationAn interpolation operator for H 1 functions on general quadrilateral and hexahedral meshes with hanging nodes
An interpolation operator for H 1 functions on general quadrilateral and hexahedral meshes with hanging nodes Vincent Heuveline Friedhelm Schieweck Abstract We propose a Scott-Zhang type interpolation
More informationOptimal Interface Conditions for an Arbitrary Decomposition into Subdomains
Optimal Interface Conditions for an Arbitrary Decomposition into Subdomains Martin J. Gander and Felix Kwok Section de mathématiques, Université de Genève, Geneva CH-1211, Switzerland, Martin.Gander@unige.ch;
More informationAn Equal-order DG Method for the Incompressible Navier-Stokes Equations
An Equal-order DG Method for the Incompressible Navier-Stokes Equations Bernardo Cockburn Guido anschat Dominik Schötzau Journal of Scientific Computing, vol. 40, pp. 188 10, 009 Abstract We introduce
More informationA 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 informationConvergence Behavior of a Two-Level Optimized Schwarz Preconditioner
Convergence Behavior of a Two-Level Optimized Schwarz Preconditioner Olivier Dubois 1 and Martin J. Gander 2 1 IMA, University of Minnesota, 207 Church St. SE, Minneapolis, MN 55455 dubois@ima.umn.edu
More informationWEAK GALERKIN FINITE ELEMENT METHODS ON POLYTOPAL MESHES
INERNAIONAL JOURNAL OF NUMERICAL ANALYSIS AND MODELING Volume 12, Number 1, Pages 31 53 c 2015 Institute for Scientific Computing and Information WEAK GALERKIN FINIE ELEMEN MEHODS ON POLYOPAL MESHES LIN
More informationA WEAK GALERKIN MIXED FINITE ELEMENT METHOD FOR BIHARMONIC EQUATIONS
A WEAK GALERKIN MIXED FINITE ELEMENT METHOD FOR BIHARMONIC EQUATIONS LIN MU, JUNPING WANG, YANQIU WANG, AND XIU YE Abstract. This article introduces and analyzes a weak Galerkin mixed finite element method
More informationOn angle conditions in the finite element method. Institute of Mathematics, Academy of Sciences Prague, Czech Republic
On angle conditions in the finite element method Michal Křížek Institute of Mathematics, Academy of Sciences Prague, Czech Republic Joint work with Jan Brandts (University of Amsterdam), Antti Hannukainen
More informationA 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 informationA Finite Element Method Using Singular Functions: Interface Problems
A Finite Element Method Using Singular Functions: Interface Problems Seokchan Kim Zhiqiang Cai Jae-Hong Pyo Sooryoun Kong Abstract The solution of the interface problem is only in H 1+α (Ω) with α > 0
More informationSupraconvergence 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 informationStabilization Techniques and a Posteriori Error Estimates for the Obstacle Problem
Applied Mathematical Sciences, Vol. 7, 2013, no. 127, 6329-6346 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2013.39504 Stabilization Techniques and a Posteriori Error Estimates for the
More informationASYMPTOTICALLY EXACT A POSTERIORI ESTIMATORS FOR THE POINTWISE GRADIENT ERROR ON EACH ELEMENT IN IRREGULAR MESHES. PART II: THE PIECEWISE LINEAR CASE
MATEMATICS OF COMPUTATION Volume 73, Number 246, Pages 517 523 S 0025-5718(0301570-9 Article electronically published on June 17, 2003 ASYMPTOTICALLY EXACT A POSTERIORI ESTIMATORS FOR TE POINTWISE GRADIENT
More informationThe Mortar Boundary Element Method
The Mortar Boundary Element Method A Thesis submitted for the degree of Doctor of Philosophy by Martin Healey School of Information Systems, Computing and Mathematics Brunel University March 2010 Abstract
More informationINTRODUCTION 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 informationALMOST OPTIMAL INTERIOR PENALTY DISCONTINUOUS APPROXIMATIONS OF SYMMETRIC ELLIPTIC PROBLEMS ON NON-MATCHING GRIDS
ALMOST OPTIMAL INTERIOR PENALTY DISCONTINUOUS APPROXIMATIONS OF SYMMETRIC ELLIPTIC PROBLEMS ON NON-MATCHING GRIDS R.D. LAZAROV, J.E. PASCIAK, J. SCHÖBERL, AND P.S. VASSILEVSKI Abstract. We consider an
More informationA 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 informationAN EQUILIBRATED A POSTERIORI ERROR ESTIMATOR FOR THE INTERIOR PENALTY DISCONTINUOUS GALERKIN METHOD
AN EQUILIBRATED A POSTERIORI ERROR ESTIMATOR FOR THE INTERIOR PENALTY DISCONTINUOUS GALERIN METHOD D. BRAESS, T. FRAUNHOLZ, AND R. H. W. HOPPE Abstract. Interior Penalty Discontinuous Galerkin (IPDG) methods
More information