Symbolic Computation Group

David R. Cheriton School of Computer Science
University of Waterloo, Waterloo, Ontario, Canada

On Beauty: Rounding Coefficients and Underflowing Terms in Generalized Polynomials
Erik Postma, Maplesoft
Friday, January 14, 2011 at 11am, at U. of Western Ontario

Abstract:

If a computation in a computer algebra system results in a polynomial with floating point coefficients, you will typically want to round coefficients to fewer digits before communicating the result to another human. In this talk, we will see some recent research into how you can do this in a justifiable and scale-invariant manner; the approach taken will sometimes also allow us to simply remove some of the terms. We will also discuss applications of the algorithms found.

 

Last modified on Sunday, 04 November 2012, at 20:42 hours.