AN ITERATIVE SUBSTRUCTURING ALGORITHM FOR A C-0 INTERIOR PENALTY METHOD

作者：Brenner Susanne C^*; Wang Kening

来源：Electronic Transactions on Numerical Analysis, 2012, 39: 313-332.

• biharmonic problem
• iterative substructuring
• domain decomposition
• C-0 interior penalty methods
• discontinuous Galerkin methods

We study an iterative substructuring algorithm for a C-0 interior penalty method for the biharmonic problem. This algorithm is based on a Bramble-Pasciak-Schatz preconditioner. The condition number of the pre-conditioned Schur complement operator is shown to be bounded by C(1 + In(H/h))(2), where h is the mesh size of the triangulation, H represents the typical diameter of the nonoverlapping subdomains, and the positive constant C is independent of h, H, and the number of subdomains. Corroborating numerical results are also presented.

• 出版日期2012