Log In Sign Up

Fully discrete polynomial de Rham sequences of arbitrary degree on polygons and polyhedra

by   Daniele A. Di Pietro, et al.

In this work, merging ideas from compatible discretisations and polyhedral methods, we construct novel fully discrete polynomial de Rham sequences of arbitrary degree on polygons and polyhedra. The spaces and operators that appear in these sequences are directly amenable to computer implementation. Besides proving exactness, we show that the usual sequence of Finite Element spaces forms, through appropriate interpolation operators, a commutative diagram with our sequence, which ensures suitable approximation properties. A discussion on reconstructions of potentials and discrete L^2-products completes the exposition.


page 1

page 2

page 3

page 4


Exact sequences on Worsey-Farin Splits

We construct several smooth finite element spaces defined on three–dimen...

Interpolation Operator on negative Sobolev Spaces

We introduce a Scott–Zhang type projection operator mapping to Lagrange ...

An arbitrary-order method for magnetostatics on polyhedral meshes based on a discrete de Rham sequence

In this work, we develop a discretisation method for the mixed formulati...

De Rham compatible Deep Neural Networks

We construct several classes of neural networks with ReLU and BiSU (Bina...

The Bubble Transform and the de Rham Complex

The purpose of this paper is to discuss a generalization of the bubble t...

High order geometric methods with splines: an analysis of discrete Hodge–star operators

A new kind of spline geometric method approach is presented. Its main in...

On the Annihilator Ideal of an Inverse Form

Let K be a field. We simplify and extend work of Althaler & Dür on finit...