Convergence analysis of an adaptive nonconforming finite element method (Q2491146): Difference between revisions

An adaptive nonconforming finite element method is developed and analyzed. It provides an error reduction due to the refinement process, so that it guarantees convergence of the nonconforming finite element approximations. The analysis is carried out for the lowest order Crouzeix-Raviart (or Temam) element and leads to the linear convergence of an appropriate adaptive nonconforming finite element algorithm with respect to the number of refinement levels. Important tools in the convergence proof are a discrete local efficiency and a quasi-orthogonality property. The proof does neither require regularity of the solution nor uses duality arguments. As a consequence on the data control, no particular mesh design has to be monitored. Numerical results are also reported for a mixed Dirichlet-Neumann boundary value problem of the Poisson equation over an \(L\)-shaped 2D domain. As is expected, the optimal convergence rate is observable numerically by using the proposed adaptive algorithm.