Efficient block preconditioning for a C1 finite element discretisation of the Dirichlet biharmonic problem

Pestana, J. and Muddle, R. and Heil, M. and Tisseur, F. and Mihajlovic, M. (2016) Efficient block preconditioning for a C1 finite element discretisation of the Dirichlet biharmonic problem. SIAM Journal on Scientific Computing, 38 (1). A325-A345. ISSN 1064-8275 (https://doi.org/10.1137/15M1014887)

[thumbnail of Pestana-etal-SIAM-2015-Efficient-block-preconditioning-for-a-c1-finite-element-discretisation-of-the-dirichlet]
Preview
 Text. Filename: Pestana_etal_SIAM_2015_Efficient_block_preconditioning_for_a_c1_finite_element_discretisation_of_the_dirichlet.pdf
Final Published Version
License: Creative Commons Attribution 4.0 logo
Download (1MB)| Preview

Abstract

We present an efficient block preconditioner for the two-dimensional biharmonic Dirichlet problem discretised by C1 bicubic Hermite finite elements. In this formulation each node in the mesh has four different degrees of freedom (DOFs). Grouping DOFs of the same type together leads to a natural blocking of the Galerkin coefficient matrix. Based on this block structure, we develop two preconditioners: a 2×2 block diagonal preconditioner (BD) and a block bordered diagonal (BBD) preconditioner. We prove mesh-independent bounds for the spectra of the BD-preconditioned Galerkin matrix under certain conditions. The eigenvalue analysis is based on the fact that the proposed preconditioner, like the coefficient matrix itself, is symmetric positive definite and is assembled from element matrices. We demonstrate the effectiveness of an inexact version of the BBD preconditioner, which exhibits near-optimal scaling in terms of computational cost with respect to the discrete problem size. Finally, we study robustness of this preconditioner with respect to element stretching, domain distortion and non-convex domains.

CORE (COnnecting REpositories)