Imperial College London > Talks@ee.imperial > CAS Talks > Predicting minimal error bounds through an algorithm

## Log inImperial users Other users No account?## Information onFinding a talk Adding a talk Syndicating talks Who we are Everything else |
## Predicting minimal error bounds through an algorithmAdd to your list(s) Download to your calendar using vCal - David Boland ( Imperial College London)
- Thursday 19 February 2009, 12:00-12:30
- Level 9 Mahanakorn Lab., EE Dept..
If you have a question about this talk, please contact George A Constantinides. The amount of precision used in an algorithm trades error for silicon area usage and potential parallelism. This talk will explain the cause of floating point error in computations and show how simple polynomials can be used to describe this error. It will then attempt to describe some 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 then display some simple examples to illustrate the use of this theory and highlight some of the complexities in creating a general algorithm to use this theory to find minimal error bounds. This talk is part of the CAS Talks series. ## This talk is included in these lists:- Andrea Picciau's list
- CAS Talks
- Circuits and Systems Group: Internal Seminars
- Level 9 Mahanakorn Lab., EE Dept.
Note that ex-directory lists are not shown. |
## Other listsCOMMSP Seminar isn_talks@ee.imperial Type the title of a new list here## Other talksEngineering Education at a Crossroads - How Changes in the Technology and in the Marketplace are Forcing a New Reform in Engineering Education Controlling Spatially Invariant Distributed Parameter Systems using Arrays of Actuators and Sensors |