The natural algorithmic approach of mixed trigonometric-polynomial problems

From MaRDI portal
Publication:2012330

DOI10.1186/S13660-017-1392-1zbMATH Open1373.42003arXiv1702.07911OpenAlexW2594365760WikidataQ33705457 ScholiaQ33705457MaRDI QIDQ2012330FDOQ2012330


Authors: Tatjana Lutovac, Cristinel Mortici, Branko Malešević Edit this on Wikidata


Publication date: 31 July 2017

Published in: Journal of Inequalities and Applications (Search for Journal in Brave)

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 cos2(x), 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.


Full work available at URL: https://arxiv.org/abs/1702.07911




Recommendations




Cites Work


Cited In (40)





This page was built for publication: The natural algorithmic approach of mixed trigonometric-polynomial problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2012330)