An iterative substructuring algorithm for a C0 interior penalty method
We study an iterative substructuring algorithm for a C0 interior penalty method for the biharmonic problem. This algorithm is based on a Bramble-Pasciak-Schatz preconditioner. The condition number of the preconditioned Schur complement operator is shown to be bounded by C (1 + ln(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. Copyright © 2012, Kent State University.
Electronic Transactions on Numerical Analysis
Brenner, & Wang, K. (2012). An iterative substructuring algorithm for a [C.sup.0] interior penalty method. Electronic Transactions on Numerical Analysis. 39, 313–332.