Superconvergence of least-squares mixed finite elements
Jan Brandts 1*, Yanping Chen 21 Korteweg-de Vries Institute for Mathematics, Faculty of Science, University of Amsterdam, Plantage Muidergracht 24, 1018 TV Amsterdam, Netherlands
2 Institute for Computational and Applied Mathematics, Xiangtan University, Xiangtan 411105, China
Received by the editors September 1, 2004 and, in revised form, November 10, 2004
In this paper we consider superconvergence and supercloseness in the least-squares mixed finite element method for elliptic problems. The supercloseness is with respect to the standard and mixed finite element approximations of the same elliptic problem, and does not depend on the properties of the mesh. As an application, we will derive more precise a priori bounds for the least squares mixed method. The superconvergence may be used to define a posteriori error estimators in the usual way. As a by-product of the analysis, a strengthened Cauchy-Buniakowskii-Schwarz inequality is used to prove the coercivity of the least-squares mixed bilinear form in a straight-forward manner. Using the same inequality, it can moreover be shown that the least-squares mixed finite element linear system of equations can basically be solved with one single iteration step of the Block Jacobi method.
AMS subject classifications: 35R35, 49J40, 60G40
Key words: least squares mixed elements; supercloseness; superconvergence