Picture of a sphere with binary code

Making Strathclyde research discoverable to the world...

The Strathprints institutional repository is a digital archive of University of Strathclyde research outputs. It exposes Strathclyde's world leading Open Access research to many of the world's leading resource discovery tools, and from there onto the screens of researchers around the world.

Explore Strathclyde Open Access research content

Bernstein–Bézier finite elements of arbitrary order and optimal assembly procedures

Ainsworth, Mark and Andriamaro, Miangaly Gaelle and Davydov, Oleg (2011) Bernstein–Bézier finite elements of arbitrary order and optimal assembly procedures. SIAM Journal on Scientific Computing, 33 (6). pp. 3087-3109. ISSN 1064-8275

Full text not available in this repository. (Request a copy from the Strathclyde author)

Abstract

Algorithms are presented that enable the element matrices for the standard finite element space, consisting of continuous piecewise polynomials of degree $n$ on simplicial elements in $\mathbb{R}^d$, to be computed in optimal complexity $\mathcal{O}(n^{2d})$. The algorithms (i) take into account numerical quadrature; (ii) are applicable to nonlinear problems; and (iii) do not rely on precomputed arrays containing values of one-dimensional basis functions at quadrature points (although these can be used if desired). The elements are based on Bernstein polynomials and are the first to achieve optimal complexity for the standard finite element spaces on simplicial elements.