Isogeometric B\'ezier dual mortaring: The biharmonic problem
Abstract
In this paper we develop an isogeometric B\'ezier dual mortar method for the biharmonic problem on multi-patch domains. The well-posedness of the discrete biharmonic problem requires a discretization with C1 continuous basis functions. Hence, two Lagrange multipliers are required to apply both C0 and C1 continuity constraints on each intersection. The dual mortar method utilizes dual basis functions to discretize the Lagrange multiplier spaces. In order to preserve the sparsity of the coupled problem, we develop a dual mortar suitable C1 constraint and utilize the B\'ezier dual basis to discretize the Lagrange multiplier spaces. The B\'ezier dual basis functions are constructed through B\'ezier projection and possess the same support size as the corresponding B-spline basis functions. We prove that this approach leads to a well-posed discrete problem and specify requirements to achieve optimal convergence. Although the B\'ezier dual basis is sub-optimal due to the lack of polynomial reproduction, our formulation successfully postpones the domination of the consistency error for practical problems. We verify the theoretical results and demonstrate the performance of the proposed formulation through several benchmark problems.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.