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 2024 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.

 

Best approximation property in the $W^1_{\infty }$ norm for finite element methods on graded meshes
HTML articles powered by AMS MathViewer

by A. Demlow, D. Leykekhman, A. H. Schatz and L. B. Wahlbin;
Math. Comp. 81 (2012), 743-764
DOI: https://doi.org/10.1090/S0025-5718-2011-02546-9
Published electronically: September 29, 2011

Abstract:

We consider finite element methods for a model second-order elliptic equation on a general bounded convex polygonal or polyhedral domain. Our first main goal is to extend the best approximation property of the error in the $W^1_{\infty }$ norm, which is known to hold on quasi-uniform meshes, to more general graded meshes. We accomplish it by a novel proof technique. This result holds under a condition on the grid which is mildly more restrictive than the shape regularity condition typically enforced in adaptive codes. The second main contribution of this work is a discussion of the properties of and relationships between similar mesh restrictions that have appeared in the literature.
References
Similar Articles
  • Retrieve articles in Mathematics of Computation with MSC (2010): 65N30, 65N15
  • Retrieve articles in all journals with MSC (2010): 65N30, 65N15
Bibliographic Information
  • A. Demlow
  • Affiliation: Department of Mathematics, University of Kentucky, Lexington, Kentucky 40506
  • MR Author ID: 693541
  • Email: alan.demlow@uky.edu.
  • D. Leykekhman
  • Affiliation: Department of Mathematics, University of Connecticut, Storrs, Connecticut 06269
  • MR Author ID: 680657
  • Email: leykekhman@math.uconn.edu
  • A. H. Schatz
  • Affiliation: Department of Mathematics, Cornell University, Ithaca, New York 14853.
  • Email: schatz@math.cornell.edu
  • L. B. Wahlbin
  • Affiliation: Department of Mathematics, Cornell University, Ithaca, New York 14853.
  • Email: wahlbin@math.cornell.edu
  • Received by editor(s): March 2, 2010
  • Received by editor(s) in revised form: October 27, 2010
  • Published electronically: September 29, 2011
  • Additional Notes: The first author was partially supported by NSF grant DMS-0713770.
    The second author was partially supported by NSF grant DMS-0811167.
    The third author was partially supported by NSF grant DMS-0612599.
  • © Copyright 2011 American Mathematical Society
    The copyright for this article reverts to public domain 28 years after publication.
  • Journal: Math. Comp. 81 (2012), 743-764
  • MSC (2010): Primary 65N30, 65N15
  • DOI: https://doi.org/10.1090/S0025-5718-2011-02546-9
  • MathSciNet review: 2869035