Extreme Points of the Unit Ball B4 in the Space of Real Polynomials of Degree at most Four with the Supremum Norm

Jan-Michael Holzinger, Róbert Vajda
{"title":"Extreme Points of the Unit Ball B4 in the Space of Real Polynomials of Degree at most Four with the Supremum Norm","authors":"Jan-Michael Holzinger, Róbert Vajda","doi":"10.1109/SYNASC57785.2022.00013","DOIUrl":null,"url":null,"abstract":"Denote by P<inf>n</inf> the space of real polynomials p of degree at most n equipped with the sup norm on the interval I = [−1, 1]. The unit ball B<inf>n</inf> with respect to the sup norm is a compact convex set. Let EB<inf>n</inf> denote the set of the extreme points of B<inf>n</inf>.","PeriodicalId":446065,"journal":{"name":"2022 24th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 24th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SYNASC57785.2022.00013","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Denote by Pn the space of real polynomials p of degree at most n equipped with the sup norm on the interval I = [−1, 1]. The unit ball Bn with respect to the sup norm is a compact convex set. Let EBn denote the set of the extreme points of Bn.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
最大范数为4次的实多项式空间中单位球B4的极值点
用Pn表示在区间I =[- 1,1]上具有sup范数的至多n次的实多项式p的空间。关于sup范数的单位球Bn是紧凸集。设EBn表示Bn的极值点的集合。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
FERPModels: A Certification Framework for Expansion-Based QBF Solving Reducing Adversarial Vulnerability Using GANs Fully-adaptive Model for Broadcasting with Universal Lists An Ant Colony Optimisation Approach to the Densest k-Subgraph Problem* IPO-MAXSAT: The In-Parameter-Order Strategy combined with MaxSAT solving for Covering Array Generation
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1