Imperial College London > Talks@ee.imperial > CAS Talks > Toward accurate polynomial evaluation in rounded arithmetic
Log inImperial users Other users No account?Information onFinding a talk Adding a talk Syndicating talks Who we are Everything else |
Toward accurate polynomial evaluation in rounded arithmeticAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Grigorios Mingas. This talk will present the work of Demmel et al, 2005, on the ‘accurate’ evaluation of polynomials. More precisely an algorithm is sought for a polynomial p and open real domain D such that for any desired relative accuracy < 1, there exists a machine precision such that executing the algorithm on hardware with that machine precision will return answers for all inputs in D which satisfy the accuracy requirement. Crucially, the existence of such algorithms depends on arithmetic components available. If only floating point addition and multiplication are available then no algorithm exists for accurate evaluation of: z6 + x2 y2 (x2 + y2 – 4z2) but there is for: z6 + x2 y2 (x2 + y2 – 3z2) The reason rests on considering the ‘algebraic variety’. Steps to making a ‘compiler’ which produces the algorithm or shows that none exists will be presented. Download pdf with Full Details This talk is part of the CAS Talks series. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsCAS Talks Type the title of a new list here Type the title of a new list hereOther talksEstimation with Incomplete State Information in the Smart Grid ePolicy - Policy Modelling with a Social Twist Telco Innovation in M2M and NFC |