Iterative Galerkin discretizations for strongly monotone problems

详细信息    查看全文

• 作者：Scott Congreve^a ; ^{scott.congreve@univie.ac.at" class="auth_mail" title="E-mail the corresponding author} ; Thomas P. Wihler^b ; ^{wihler@math.unibe.ch" class="auth_mail" title="E-mail the corresponding author}
• 关键词：65N30
• 刊名：Journal of Computational and Applied Mathematics
• 出版年：2017
• 出版时间：February 2017
• 年：2017
• 卷：311
• 期：Complete
• 页码：457-472
• 全文大小：708 K

文摘

In this article we investigate the use of fixed point iterations to solve the Galerkin approximation of strictly monotone problems. As opposed to Newton’s method, which requires information from the previous iteration in order to linearize the iteration matrix (and thereby to recompute it) in each step, the alternative method used in this article exploits the monotonicity properties of the problem, and only needs the iteration matrix calculated once for all iterations of the fixed point method. We outline the abstract a priori and a posteriori analyses for the iteratively obtained solutions, and apply this to a finite element approximation of a second-order elliptic quasilinear boundary value problem. We show both theoretically, as well as numerically, how the number of iterations of the fixed point method can be restricted in dependence of the mesh size, or of the polynomial degree, to obtain optimal convergence. Using the a posteriori error analysis we also devise an adaptive algorithm for the generation of a sequence of Galerkin spaces (adaptively refined finite element meshes in the concrete example) to minimize the number of iterations on each space.