BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//talks.cam.ac.uk//v3//EN
BEGIN:VTIMEZONE
TZID:Europe/London
BEGIN:DAYLIGHT
TZOFFSETFROM:+0000
TZOFFSETTO:+0100
TZNAME:BST
DTSTART:19700329T010000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0100
TZOFFSETTO:+0000
TZNAME:GMT
DTSTART:19701025T020000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
CATEGORIES:Applied and Computational Analysis
SUMMARY:Fast simplicial finite elements via Bernstein poly
nomials - Robert Kirby (Baylor University)
DTSTART;TZID=Europe/London:20160623T150000
DTEND;TZID=Europe/London:20160623T160000
UID:TALK64813AThttp://talks.cam.ac.uk
URL:http://talks.cam.ac.uk/talk/index/64813
DESCRIPTION:Powerful software projects such as FEniCS enable t
he efficient numerical solution of systems governe
d by partial differential equations via finite ele
ment methods. Historically\, one critical aspect
of enabling these simulations has been the specifi
cation of the local basis functions\, which can be
rather difficult when unstructured simplicial geo
metry is required. Thanks to the FIAT project\, F
EniCS supports a very general suite of possible ba
sis functions. However\, recent research on Berns
tein polynomials\, already widely used in approxim
ation theory and computational geometry\, presents
a new approach to finite element basis functions.
They have a remarkably simple and concise defini
tion\, generalize to any degree and spatial dimens
ion\, and possess remarkable structure that enable
s new optimal-complexity algorithms for a wide sui
te of finite element calculations
LOCATION:MR 14\, CMS
CONTACT:Garth N. Wells
END:VEVENT
END:VCALENDAR