边界点上混合三角多项式函数的消去检验算法

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}
引用次数: 1

摘要

研究边界点上MTP不等式f(x) > / [0, π/2]的自动证明问题。它提出了一种不使用数值估计的符号检查f(0) = 0或$f\left( {\frac{\pi }{2}} \right) = 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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信