2000 character limit reached
Stable finite element pair for Stokes problem and discrete Stokes complex on quadrilateral grids
Published 17 Oct 2013 in math.NA | (1310.4785v1)
Abstract: In this paper, we first construct a nonconforming finite element pair for the incompressible Stokes problem on quadrilateral grids, and then construct a discrete Stokes complex associated with that finite element pair. The finite element spaces involved consist of piecewise polynomials only, and the divergence-free condition is imposed in a primal formulation. Combined with some existing results, these constructions can be generated onto grids that consist of both triangular and quadrilateral cells.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.