University of Cambridge > > Applied and Computational Analysis > Fast simplicial finite elements via Bernstein polynomials

Fast simplicial finite elements via Bernstein polynomials

Add to your list(s) Download to your calendar using vCal

  • UserRobert Kirby (Baylor University) World_link
  • ClockThursday 23 June 2016, 15:00-16:00
  • HouseMR 14, CMS.

If you have a question about this talk, please contact Garth N. Wells.

Powerful software projects such as FEniCS enable the efficient numerical solution of systems governed by partial differential equations via finite element methods. Historically, one critical aspect of enabling these simulations has been the specification of the local basis functions, which can be rather difficult when unstructured simplicial geometry is required. Thanks to the FIAT project, FEniCS supports a very general suite of possible basis functions. However, recent research on Bernstein polynomials, already widely used in approximation theory and computational geometry, presents a new approach to finite element basis functions. They have a remarkably simple and concise definition, generalize to any degree and spatial dimension, and possess remarkable structure that enables new optimal-complexity algorithms for a wide suite of finite element calculations

This talk is part of the Applied and Computational Analysis series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2024, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity