An iterative substructuring algorithm for a C0 interior penalty method

Document Type

Article

Publication Date

1-1-2012

Abstract

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.

Publication Title

Electronic Transactions on Numerical Analysis

Volume

39

First Page

313

Last Page

332

E-ISSN

10689613

This document is currently not available here.

Share

COinS