Exact Real Computer Arithmetic with Continued Fractions
IEEE Transactions on Computers
Honest plotting, global extrema, and interval arithmetic
ISSAC '92 Papers from the international symposium on Symbolic and algebraic computation
From honest to intelligent plotting
ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
Reliable two-dimensional graphing methods for mathematical formulae with two free variables
Proceedings of the 28th annual conference on Computer graphics and interactive techniques
Comparison of interval methods for plotting algebraic curves
Computer Aided Geometric Design
Understanding expression simplification
ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
Not seeing the roots for the branches: multivalued functions in computer algebra
ACM SIGSAM Bulletin
Simplifying products of fractional powers of powers
ACM Communications in Computer Algebra
A computer algebra user interface manifesto
ACM Communications in Computer Algebra
| Hi-index | 0.00 |
Most of us have taken the exact rational and approximate numbers in our computer algebra systems for granted for a long time, not thinking to ask if they could be significantly better. With exact rational arithmetic and adjustable-precision floating-point arithmetic to precision limited only by the total computer memory or our patience, what more could we want for such numbers? It turns out that there is much more that can be done that permits us to obtain exact results more often, more intelligible results, approximate results guaranteed to have requested error bounds, and recovery of exact results from approximate ones.