The natural algorithmic approach of mixed trigonometric-polynomial problems
Classical Analysis and ODEs
2019-10-15 v1 Symbolic Computation
Abstract
The aim of this paper is to present a new algorithm for proving mixed trigonometric-polynomial inequalities by reducing to polynomial inequalities. Finally, we show the great applicability of this algorithm and as examples, we use it to analyze some new rational (Pade) approximations of the function , and to improve a class of inequalities by Z.-H. Yang. The results of our analysis could be implemented by means of an automated proof assistant, so our work is a contribution to the library of automatic support tools for proving various analytic inequalities.
Cite
@article{arxiv.1702.07911,
title = {The natural algorithmic approach of mixed trigonometric-polynomial problems},
author = {Tatjana Lutovac and Branko Malesevic and Cristinel Mortici},
journal= {arXiv preprint arXiv:1702.07911},
year = {2019}
}