Abstract
In this paper, we analyze the convergence and optimal complexity of the usual simple adaptive nonconforming finite element method by using Dörfler collective marking strategy. Based on several basic ingredients, such as the estimator reduction, quasi-orthogonality, local upper bound and so on, we eventually show the convergence of the adaptive algorithm by establishing the reduction of some total error and the quasi-optimal convergence rate. Our analysis does not need the relation between the nonconforming P 1 element and the mixed Raviart–Thomas element. The results of numerical experiments confirm that our adaptive algorithm is optimal.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
