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.

 

An HDG method for linear elasticity with strong symmetric stresses
HTML articles powered by AMS MathViewer

by Weifeng Qiu, Jiguang Shen and Ke Shi PDF
Math. Comp. 87 (2018), 69-93 Request permission

Abstract:

This paper presents a new hybridizable discontinuous Galerkin (HDG) method for linear elasticity on general polyhedral meshes, based on a strong symmetric stress formulation. The key feature of this new HDG method is the use of a special form of the numerical trace of the stresses, which makes the error analysis different from the projection-based error analyzes used for most other HDG methods. For arbitrary polyhedral elements, we approximate the stress by using polynomials of degree $k\ge 1$ and the displacement by using polynomials of degree $k+1$. In contrast, to approximate the numerical trace of the displacement on the faces, we use polynomials of degree $k$ only. This allows for a very efficient implementation of the method, since the numerical trace of the displacement is the only globally-coupled unknown, but does not degrade the convergence properties of the method. Indeed, we prove optimal orders of convergence for both the stresses and displacements on the elements. In the almost incompressible case, we show the error of the stress is also optimal in the standard $L^2$-norm. These optimal results are possible thanks to a special superconvergence property of the numerical traces of the displacement, and thanks to the use of the crucial elementwise Korn’s inequality. Several numerical results are presented to support our theoretical findings in the end.
References
Similar Articles
  • Retrieve articles in Mathematics of Computation with MSC (2010): 65N30, 65L12
  • Retrieve articles in all journals with MSC (2010): 65N30, 65L12
Additional Information
  • Weifeng Qiu
  • Affiliation: Department of Mathematics, City University of Hong Kong, 83 Tat Chee Avenue, Hong Kong
  • MR Author ID: 845089
  • Email: weifeqiu@cityu.edu.hk
  • Jiguang Shen
  • Affiliation: Department of Mathematics, University of Minnesota, Minneapolis, Minnesota 55455
  • Email: shenx179@umn.edu
  • Ke Shi
  • Affiliation: Department of Mathematics & Statistics, Old Dominion University, Norfolk, Virginia 23529
  • MR Author ID: 904733
  • Email: kshi@odu.edu
  • Received by editor(s): August 14, 2014
  • Received by editor(s) in revised form: November 15, 2015, February 16, 2016, and August 23, 2016
  • Published electronically: May 1, 2017
  • © Copyright 2017 American Mathematical Society
  • Journal: Math. Comp. 87 (2018), 69-93
  • MSC (2010): Primary 65N30, 65L12
  • DOI: https://doi.org/10.1090/mcom/3249
  • MathSciNet review: 3716189