Abstract
We prove convergence and optimal complexity of an adaptive mixed finite element algorithm, based on the lowest-order Raviart–Thomas finite element space. In each step of the algorithm, the local refinement is either performed using simple edge residuals or a data oscillation term, depending on an adaptive marking strategy. The inexact solution of the discrete system is controlled by an adaptive stopping criterion related to the estimator.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have