Abstract
We prove that the a standard adaptive algorithm for the Taylor--Hood discretization of the stationary Stokes problem converges with optimal rate. This is done by developing an abstract framework for quite general problems, which allows us to prove general quasi-orthogonality proposed in [C. Carstensen et al., Comput. Math. Appl., 67 (2014), pp. 1195--1253]. This property is the main obstacle towards the optimality proof and therefore is the main focus of this work. The key ingredient is a new connection between the mentioned quasi-orthogonality and $LU$-factorization of infinite matrices.
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.
