Some notes on a method for proving inequalities by computer
Classical Analysis and ODEs
2015-07-15 v9 Mathematical Software
Numerical Analysis
Abstract
In this article we consider mathematical fundamentals of one method for proving inequalities by computer, based on the Remez algorithm. Using the well-known results of undecidability of the existence of zeros of real elementary functions, we demonstrate that the considered method generally in practice becomes one heuristic for the verification of inequalities. We give some improvements of the inequalities considered in the theorems for which the existing proofs have been based on the numerical verifications of Remez algorithm.
Cite
@article{arxiv.math/0701020,
title = {Some notes on a method for proving inequalities by computer},
author = {Bojan D. Banjac and Milica D. Makragic and Branko J. Malesevic},
journal= {arXiv preprint arXiv:math/0701020},
year = {2015}
}
Comments
in Results in Mathematics 07/2015