Branko J. Malesevic, Bojan Banjac, Vesna Šešum-Čavič, Nenad Korolija
{"title":"边界点上混合三角多项式函数的消去检验算法","authors":"Branko J. Malesevic, Bojan Banjac, Vesna Šešum-Čavič, Nenad Korolija","doi":"10.1109/TELFOR56187.2022.9983738","DOIUrl":null,"url":null,"abstract":"This paper considers one problem of automated proving of MTP inequalities f(x) > 0 over [0, π/2] on boundary points. It suggests one algorithm for symbolic checking for f(0) = 0 or $f\\left( {\\frac{\\pi }{2}} \\right) = 0$ without use of numerical estimations. With stated approach it gives one contribution to theory and practice in this part of the field of automated proving.","PeriodicalId":277553,"journal":{"name":"2022 30th Telecommunications Forum (TELFOR)","volume":"400 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"One algorithm for testing annulling of mixed trigonometric polynomial functions on boundary points\",\"authors\":\"Branko J. Malesevic, Bojan Banjac, Vesna Šešum-Čavič, Nenad Korolija\",\"doi\":\"10.1109/TELFOR56187.2022.9983738\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper considers one problem of automated proving of MTP inequalities f(x) > 0 over [0, π/2] on boundary points. It suggests one algorithm for symbolic checking for f(0) = 0 or $f\\\\left( {\\\\frac{\\\\pi }{2}} \\\\right) = 0$ without use of numerical estimations. With stated approach it gives one contribution to theory and practice in this part of the field of automated proving.\",\"PeriodicalId\":277553,\"journal\":{\"name\":\"2022 30th Telecommunications Forum (TELFOR)\",\"volume\":\"400 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-11-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 30th Telecommunications Forum (TELFOR)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/TELFOR56187.2022.9983738\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 30th Telecommunications Forum (TELFOR)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TELFOR56187.2022.9983738","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
One algorithm for testing annulling of mixed trigonometric polynomial functions on boundary points
This paper considers one problem of automated proving of MTP inequalities f(x) > 0 over [0, π/2] on boundary points. It suggests one algorithm for symbolic checking for f(0) = 0 or $f\left( {\frac{\pi }{2}} \right) = 0$ without use of numerical estimations. With stated approach it gives one contribution to theory and practice in this part of the field of automated proving.