Approximation of the grad div operator in nonconvex domains

D. Boffi, C. Chinosi, L. Gastaldi

Research output: Contribution to journalArticlepeer-review

15 Scopus citations

Abstract

In this paper we are dealing with the approximation of the grad-div operator in nonconvex polygonal domains. A penalization strategy is considered in order to obtain a formulation of the original eigenproblem which is associated with an elliptic operator. However the presence of singular eigensolutions, in the case of nonconvex domains, is the origin of major troubles in the numerical approximation of the problem. A mixed-type approximation, based on a projection procedure, is introduced and analyzed from the theoretical and numerical point of view. Several numerical experiments confirm that in presence of singularities the projection is needed in order to reproduce the features of the continuous problem.
Original languageEnglish (US)
Pages (from-to)31-43
Number of pages13
JournalCMES - Computer Modeling in Engineering and Sciences
Volume1
Issue number2
StatePublished - Dec 1 2000

Fingerprint Dive into the research topics of 'Approximation of the grad div operator in nonconvex domains'. Together they form a unique fingerprint.

Cite this