Rounding coefficients and artificially underflowing terms in non-numeric expressions

Authors:
Robert Corless;Erik Postma;David R. Stoutemyer
Affiliations:
University of Western Ontario in London, ON;Maplesoft, Waterloo, ON, Canada;University of Hawaii, Honolulu, Hawaii
Venue:
ACM Communications in Computer Algebra
Year:
2011

Citing 23
Cited 1

The computational complexity of simultaneous diophantine approximation problems

SIAM Journal on Computing
Average-case stability of Gaussian elimination

SIAM Journal on Matrix Analysis and Applications
Parallel least-squares solution of general and Toeplitz systems

SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
What every computer scientist should know about floating-point arithmetic

ACM Computing Surveys (CSUR)
Implicitization of rational parametric equations

Journal of Symbolic Computation
How to recognize zero

Journal of Symbolic Computation - Special issue: validated numerical methods and computer algebra
Modern computer algebra

Modern computer algebra
Analysis of PSLQ, an integer relation finding algorithm

Mathematics of Computation
Complex interval arithmetic

Communications of the ACM
The nearest polynomial with a given zero, and similar problems

ACM SIGSAM Bulletin
Computer Methods for Mathematical Computations

Computer Methods for Mathematical Computations
Accuracy and Stability of Numerical Algorithms

Accuracy and Stability of Numerical Algorithms
Introduction to Algorithms

Introduction to Algorithms
Numerical Implicitization of Parametric Hypersurfaces with Linear Algebra

AISC '00 Revised Papers from the International Conference on Artificial Intelligence and Symbolic Computation
Numerical Polynomial Algebra

Numerical Polynomial Algebra
The approximate GCD of inexact polynomials

ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
The nearest polynomial with a given zero, revisited

ACM SIGSAM Bulletin
The Mathematica GuideBook for Numerics

The Mathematica GuideBook for Numerics
A new Gröbner basis conversion method based on stabilization techniques

Theoretical Computer Science
Stable border bases for ideals of points

Journal of Symbolic Computation
Symbolic-numeric sparse interpolation of multivariate polynomials

Journal of Symbolic Computation
Approximate computation of zero-dimensional polynomial ideals

Journal of Symbolic Computation
An Arbitrary Starting Homotopy-Like Simplicial Algorithm for Computing an Integer Point in a Class of Polytopes

SIAM Journal on Discrete Mathematics

GCD of multivariate approximate polynomials using beautification with the subtractive algorithm

Proceedings of the 2011 International Workshop on Symbolic-Numeric Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

This article takes an analytical viewpoint to address the following questions: 1. How can we justifiably beautify an input or result sum of non-numeric terms that has some approximate coefficients by deleting some terms and/or rounding some coefficients to simpler floating-point or rational numbers? 2. When we add two expressions, how can we justifiably delete more non-zero result terms and/or round some result coefficients to even simpler floating-point, rational or irrational numbers? The methods considered in this paper provide a justifiable scale-invariant way to attack these problems for subexpressions that are multivariate sums of monomials with real exponents.