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.

 

Optimally accurate higher-order finite element methods for polytopial approximations of domains with smooth boundaries
HTML articles powered by AMS MathViewer

by James Cheung, Mauro Perego, Pavel Bochev and Max Gunzburger HTML | PDF
Math. Comp. 88 (2019), 2187-2219 Request permission

Abstract:

Meshing of geometric domains having curved boundaries by affine simplices produces a polytopial approximation of those domains. The resulting error in the representation of the domain limits the accuracy of finite element methods based on such meshes. On the other hand, the simplicity of affine meshes makes them a desirable modeling tool in many applications. In this paper, we develop and analyze higher-order accurate finite element methods that remain stable and optimally accurate on polytopial approximations of domains with smooth boundaries. This is achieved by constraining a judiciously chosen extension of the finite element solution on the polytopial domain to weakly match the prescribed boundary condition on the true geometric boundary. We provide numerical examples that highlight key properties of the new method and that illustrate the optimal $H^1$- and $L^2$-norm convergence rates.
References
Similar Articles
  • Retrieve articles in Mathematics of Computation with MSC (2010): 65N30
  • Retrieve articles in all journals with MSC (2010): 65N30
Additional Information
  • James Cheung
  • Affiliation: Interdisciplinary Center for Applied Mathematics, Virginia Tech, Blacksburg, Virginia 24061
  • MR Author ID: 1230885
  • Email: jamescheung@vt.edu
  • Mauro Perego
  • Affiliation: Center for Computing Research, Sandia National Laboratories, Albuquerque, New Mexico 87123
  • MR Author ID: 869976
  • Email: mperego@sandia.gov
  • Pavel Bochev
  • Affiliation: Center for Computing Research, Sandia National Laboratories, Albuquerque, New Mexico 87123
  • MR Author ID: 38390
  • Email: pbboche@sandia.gov
  • Max Gunzburger
  • Affiliation: Department of Scientific Computing, Florida State University, Tallahassee, Florida 32309
  • MR Author ID: 78360
  • Email: mgunzburger@fsu.edu
  • Received by editor(s): February 8, 2018
  • Received by editor(s) in revised form: October 28, 2018
  • Published electronically: February 21, 2019
  • Additional Notes: Sandia National Laboratories is a multimission laboratory managed and operated by National Technology and Engineering Solutions of Sandia, LLC., a wholly owned subsidiary of Honeywell International, Inc., for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-NA-0003525.
    This material is based upon work supported by the U.S. Department of Energy, Office of Science, Office of Advanced Scientific Computing Research. Additionally, the first and fourth authors were supported by US Department of Energy grant DE-SC0009324 and US Air Force Office of Scientific Research grant FA9550-15-1-0001.
  • Journal: Math. Comp. 88 (2019), 2187-2219
  • MSC (2010): Primary 65N30
  • DOI: https://doi.org/10.1090/mcom/3415
  • MathSciNet review: 3957891