The Bernstein polynomial basis: A centennial retrospective
Computer Aided Geometric Design
Hi-index | 0.00 |
We derive low-complexity matrix-free finite element algorithms for simplicial Bernstein polynomials on simplices. Our techniques, based on a sparse representation of differentiation and special block structure in the matrices evaluating B-form polynomials at warped Gauss points, apply to variable coefficient problems as well as constant coefficient ones, thus extending our results in Kirby (Numer Math, 2011, in press).