Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1145/1358190.1358192 | ACM Comm. Computer Algebra |
Keywords | Field | DocType |
exact rational arithmetic,approximate result,approximate number,exact result,useful number,long time,computer algebra system,adjustable-precision floating-point arithmetic,useful computation,intelligible result,total computer memory,error bound,floating point arithmetic | Discrete mathematics,Ask price,Algebra,Symbolic computation,Computer memory,Mathematics,Computation | Journal |
Volume | Issue | Citations |
41 | 3 | 3 |
PageRank | References | Authors |
0.48 | 8 | 1 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| David R. Stoutemyer | 1 | 49 | 19.14 |