BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Predicting minimal error bounds through an algorithm - David Bolan
 d ( Imperial College London)
DTSTART:20090219T120000Z
DTEND:20090219T130000Z
UID:TALK16095@talks.cam.ac.uk
CONTACT:Dr George A Constantinides
DESCRIPTION:The amount of precision used in an algorithm trades error for 
 silicon area usage and potential parallelism. This talk will explain the c
 ause of floating point error in computations and show how simple polynomia
 ls can be used to describe this error. It will then attempt to describe so
 me background theory which is intended to be used on these polynomials to 
 find tight bounds on the final error in any algorithm. Finally\, it will t
 hen display some simple examples to illustrate the use of this theory & hi
 ghlight some of the complexities in creating a general algorithm to use th
 is theory to find minimal error bounds.
LOCATION:Mahanakorn Laboratory\, EEE
END:VEVENT
END:VCALENDAR