Obtaining Exact Value by Approximate Computations

Abstract

Numerical approximate computation can solve large and complex problems fast. It has the advantage of high efficiency. However it only gives approximate results, whereas we need exact results in many fields. There is a gap between approximate computation and exact results. In this paper, we build a bridge by which exact results can be obtained by numerical approximate computations.

Cited by in corpus (9)

• Simultaneous Integer Relation Detection and Its an Application
• Computing the determinant of a matrix with polynomial entries by approximation
• NIL: Learning Nonlinear Interpolants
• Obtaining Exact Interpolation Multivariate Polynomial by Approximation
• Exact Bivariate Polynomial Factorization in Q by Approximation of Roots
• A Short Note on Zero-error Computation for Algebraic Numbers by IPSLQ
• Multivariate Polynomial Factorization by Interpolation Method
• An Improved Algorithm for Recovering Exact Value from its Approximation
• Finding Exact Minimal Polynomial by Approximations