Skip to Main Content

Mathematics of Computation

Published by the American Mathematical Society since 1960 (published as Mathematical Tables and other Aids to Computation 1943-1959), Mathematics of Computation is devoted to research articles of the highest quality in computational mathematics.

ISSN 1088-6842 (online) ISSN 0025-5718 (print)

The 2020 MCQ for Mathematics of Computation is 1.78.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.

 

A cut finite element method with boundary value correction
HTML articles powered by AMS MathViewer

by Erik Burman, Peter Hansbo and Mats G. Larson PDF
Math. Comp. 87 (2018), 633-657 Request permission

Abstract:

In this contribution we develop a cut finite element method with boundary value correction of the type originally proposed by Bramble, Dupont, and Thomée in [Math. Comp. 26 (1972), 869–879]. The cut finite element method is a fictitious domain method with Nitsche-type enforcement of Dirichlet conditions together with stabilization of the elements at the boundary which is stable and enjoy optimal order approximation properties. A computational difficulty is, however, the geometric computations related to quadrature on the cut elements which must be accurate enough to achieve higher order approximation. With boundary value correction we may use only a piecewise linear approximation of the boundary, which is very convenient in a cut finite element method, and still obtain optimal order convergence. The boundary value correction is a modified Nitsche formulation involving a Taylor expansion in the normal direction compensating for the approximation of the boundary. Key to the analysis is a consistent stabilization term which enables us to prove stability of the method and a priori error estimates with explicit dependence on the meshsize and distance between the exact and approximate boundary.
References
Similar Articles
  • Retrieve articles in Mathematics of Computation with MSC (2010): 65M60, 65M85
  • Retrieve articles in all journals with MSC (2010): 65M60, 65M85
Additional Information
  • Erik Burman
  • Affiliation: Department of Mathematics, University College London, London, UK-WC1E 6BT, United Kingdom
  • MR Author ID: 602430
  • Peter Hansbo
  • Affiliation: Department of Mechanical Engineering, Jönköping University, S-551 11 Jönköping, Sweden
  • MR Author ID: 269716
  • Mats G. Larson
  • Affiliation: Department of Mathematics and Mathematical Statistics, Umeå University, SE-90187 Umeå, Sweden
  • MR Author ID: 648688
  • Email: mats.larson@math.umu.se
  • Received by editor(s): July 11, 2015
  • Received by editor(s) in revised form: July 8, 2016, and October 31, 2016
  • Published electronically: October 11, 2017
  • Additional Notes: This research was supported in part by EPSRC, UK, Grant No. EP/J002313/1, the Swedish Foundation for Strategic Research Grant No. AM13-0029, the Swedish Research Council Grants Nos. 2011-4992, 2013-4708, and Swedish strategic research programme eSSENCE
  • © Copyright 2017 American Mathematical Society
  • Journal: Math. Comp. 87 (2018), 633-657
  • MSC (2010): Primary 65M60; Secondary 65M85
  • DOI: https://doi.org/10.1090/mcom/3240
  • MathSciNet review: 3739212