Abstract

This paper is devoted to a long standing issue in the finite element analysis for elliptic problems. The standard approach to $$ L^2$$ bounds uses the $$H^1$$ bound in combination to a duality argument, known as Nitsche’s trick, to recover the optimal a priori order of the method. Although this approach makes perfect sense for quasi-uniform meshes, it does not provide the expected information for unstructured meshes since the final estimate involves the maximum mesh size. Babuska and Osborn (Numer Math 34:41–62, 1980), addressed this issue for a one dimensional problem by introducing a technique based on mesh-dependent norms. The key idea was to see the bilinear form posed on two different spaces; equipped with the mesh dependent analogs of $$L^2$$ and $$H^2$$ and to show that the finite element space is inf-sup stable with respect to these norms. Although this approach is readily extendable to multidimensional setting, the proof of the inf-sup stability with respect to mesh dependent norms is known only in very limited cases. We establish the validity of the inf-sup condition for standard conforming finite element spaces of any polynomial degree under certain restrictions on the mesh variation which however permit unstructured non quasiuniform meshes. As a consequence we derive $$L^2$$ estimates for the finite element approximation via quasioptimal bounds and examine related stability properties of the elliptic projection.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.