Some Inequalities for the Maximum Modulus of Rational Functions

Robert Gardner, N. Govil, Prasanna Kumar
{"title":"Some Inequalities for the Maximum Modulus of Rational Functions","authors":"Robert Gardner, N. Govil, Prasanna Kumar","doi":"10.1155/2021/2263550","DOIUrl":null,"url":null,"abstract":"<jats:p>For a polynomial <jats:inline-formula>\n <math xmlns=\"http://www.w3.org/1998/Math/MathML\" id=\"M1\">\n <mi>p</mi>\n <mfenced open=\"(\" close=\")\" separators=\"|\">\n <mrow>\n <mi>z</mi>\n </mrow>\n </mfenced>\n </math>\n </jats:inline-formula> of degree <jats:inline-formula>\n <math xmlns=\"http://www.w3.org/1998/Math/MathML\" id=\"M2\">\n <mi>n</mi>\n </math>\n </jats:inline-formula>, it follows from the maximum modulus theorem that <jats:inline-formula>\n <math xmlns=\"http://www.w3.org/1998/Math/MathML\" id=\"M3\">\n <msub>\n <mrow>\n <mi mathvariant=\"normal\">max</mi>\n </mrow>\n <mrow>\n <mfenced open=\"|\" close=\"|\" separators=\"|\">\n <mrow>\n <mi>z</mi>\n </mrow>\n </mfenced>\n <mo>=</mo>\n <mi>R</mi>\n <mo>≥</mo>\n <mn>1</mn>\n </mrow>\n </msub>\n <mfenced open=\"|\" close=\"|\" separators=\"|\">\n <mrow>\n <mi>p</mi>\n <mfenced open=\"(\" close=\")\" separators=\"|\">\n <mrow>\n <mi>z</mi>\n </mrow>\n </mfenced>\n </mrow>\n </mfenced>\n <mo>≤</mo>\n <msup>\n <mrow>\n <mi>R</mi>\n </mrow>\n <mrow>\n <mi>n</mi>\n </mrow>\n </msup>\n <msub>\n <mrow>\n <mi mathvariant=\"normal\">max</mi>\n </mrow>\n <mrow>\n <mfenced open=\"|\" close=\"|\" separators=\"|\">\n <mrow>\n <mi>z</mi>\n </mrow>\n </mfenced>\n <mo>=</mo>\n <mn>1</mn>\n </mrow>\n </msub>\n <mfenced open=\"|\" close=\"|\" separators=\"|\">\n <mrow>\n <mi>p</mi>\n <mfenced open=\"(\" close=\")\" separators=\"|\">\n <mrow>\n <mi>z</mi>\n </mrow>\n </mfenced>\n </mrow>\n </mfenced>\n </math>\n </jats:inline-formula>. It was shown by Ankeny and Rivlin that if <jats:inline-formula>\n <math xmlns=\"http://www.w3.org/1998/Math/MathML\" id=\"M4\">\n <mi>p</mi>\n <mfenced open=\"(\" close=\")\" separators=\"|\">\n <mrow>\n <mi>z</mi>\n </mrow>\n </mfenced>\n <mo>≠</mo>\n <mn>0</mn>\n </math>\n </jats:inline-formula> for <jats:inline-formula>\n <math xmlns=\"http://www.w3.org/1998/Math/MathML\" id=\"M5\">\n <mfenced open=\"|\" close=\"|\" separators=\"|\">\n <mrow>\n <mi>z</mi>\n </mrow>\n </mfenced>\n <mo><</mo>\n <mn>1</mn>\n </math>\n </jats:inline-formula>, then <jats:inline-formula>\n <math xmlns=\"http://www.w3.org/1998/Math/MathML\" id=\"M6\">\n <msub>\n <mrow>\n <mi mathvariant=\"normal\">max</mi>\n </mrow>\n <mrow>\n <mfenced open=\"|\" close=\"|\" separators=\"|\">\n <mrow>\n <mi>z</mi>\n </mrow>\n </mfenced>\n <mo>=</mo>\n <mi>R</mi>\n <mo>≥</mo>\n <mn>1</mn>\n </mrow>\n </msub>\n <mfenced open=\"|\" close=\"|\" separators=\"|\">\n <mrow>\n <mi>p</mi>\n <mfenced open=\"(\" close=\")\" separators=\"|\">\n <mrow>\n <mi>z</mi>\n </mrow>\n </mfenced>\n </mrow>\n </mfenced>\n <mo>≤</mo>\n <mfenced open=\"(\" close=\")\" separators=\"|\">\n <mrow>\n <mrow>\n <mfenced open=\"(\" close=\")\" separators=\"|\">\n <mrow>\n <msup>\n <mrow>\n <mi>R</mi>\n </mrow>\n <mrow>\n <mi>n</mi>\n </mrow>\n </msup>\n <mo>+</mo>\n <mn>1</mn>\n </mrow>\n </mfenced>\n <mo>/</mo>\n <mn>2</mn>\n </mrow>\n </mrow>\n </mfenced>\n <msub>\n <mrow>\n <mi mathvariant=\"normal\">max</mi>\n </mrow>\n <mrow>\n <mfenced open=\"|\" close=\"|\" separators=\"|\">\n <mrow>\n <mi>z</mi>\n </mrow>\n </mfenced>\n <mo>=</mo>\n <mn>1</mn>\n </mrow>\n </msub>\n <mfenced open=\"|\" close=\"|\" separators=\"|\">\n <mrow>\n <mi>p</mi>\n <mfenced open=\"(\" close=\")\" separators=\"|\">\n <mrow>\n <mi>z</mi>\n </mrow>\n </mfenced>\n </mrow>\n </mfenced>\n </math>\n </jats:inline-formula>. In 1998, Govil and Mohapatra extended the above two inequalities to rational functions, and in this paper, we study the refinements of these results of Govil and Mohapatra.</jats:p>","PeriodicalId":301406,"journal":{"name":"Int. J. Math. Math. Sci.","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Math. Math. Sci.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1155/2021/2263550","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

For a polynomial p z of degree n , it follows from the maximum modulus theorem that max z = R 1 p z R n max z = 1 p z . It was shown by Ankeny and Rivlin that if p z 0 for z < 1 , then max z = R 1 p z R n + 1 / 2 max z = 1 p z . In 1998, Govil and Mohapatra extended the above two inequalities to rational functions, and in this paper, we study the refinements of these results of Govil and Mohapatra.
有理函数最大模的几个不等式
Ankeny和Rivlin证明了如果z≠01 ,则max z = R≥1pz≤rn + 1 /2 Max z = 1pz。1998年,Govil和Mohapatra将上述两个不等式推广到有理函数,本文研究了Govil和Mohapatra对这些结果的改进。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信