Abstract

A recent study [D. N. Arnold, D. Boffi, and R. S. Falk, SIAM J. Numer. Anal., 42 (2005), pp. 2429–2451] reveals that convergence of finite element methods using $H(\mathrm{div}\,,\Omega)$-compatible finite element spaces deteriorates on nonaffine quadrilateral grids. This phenomena is particularly troublesome for the lowest-order Raviart–Thomas elements, because it implies loss of convergence in some norms for finite element solutions of mixed and least-squares methods. In this paper we propose reformulation of finite element methods, based on the natural mimetic divergence operator [M. Shashkov, Conservative Finite Difference Methods on General Grids, CRC Press, Boca Raton, FL, 1996], which restores the order of convergence. Reformulations of mixed Galerkin and least-squares methods for the Darcy equation illustrate our approach. We prove that reformulated methods converge optimally with respect to a norm involving the mimetic divergence operator. Furthermore, we prove that standard and reformulated versions of the mixed Galerkin method lead to identical linear systems, but the two versions of the least-squares method are veritably different. The surprising conclusion is that the degradation of convergence in the mixed method on nonaffine quadrilateral grids is superficial, and that the lowest-order Raviart–Thomas elements are safe to use in this method. However, the breakdown in the least-squares method is real, and there one should use our proposed reformulation.

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.