Iterative Galerkin discretizations for strongly monotone problems

Congreve, Scott Spencer; Wihler, Thomas (2017). Iterative Galerkin discretizations for strongly monotone problems. Journal of computational and applied mathematics, 311, pp. 457-472. Elsevier 10.1016/j.cam.2016.08.014

[img] Text
1-s2.0-S0377042716303740-main.pdf - Published Version
Restricted to registered users only
Available under License Publisher holds Copyright.

Download (725kB)

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.

Item Type:

Journal Article (Original Article)

Division/Institute:

08 Faculty of Science > Department of Mathematics and Statistics > Institute of Mathematics

UniBE Contributor:

Congreve, Scott Spencer, Wihler, Thomas

Subjects:

500 Science > 510 Mathematics

ISSN:

0377-0427

Publisher:

Elsevier

Language:

English

Submitter:

Olivier Bernard Mila

Date Deposited:

17 Apr 2018 10:34

Last Modified:

05 Dec 2022 15:09

Publisher DOI:

10.1016/j.cam.2016.08.014

BORIS DOI:

10.7892/boris.109183

URI:

https://boris.unibe.ch/id/eprint/109183

Actions (login required)

Edit item Edit item
Provide Feedback