An Approach for Certifying Homotopy Continuation Paths: Univariate Case

Juan Xu, M. Burr, C. Yap
{"title":"An Approach for Certifying Homotopy Continuation Paths: Univariate Case","authors":"Juan Xu, M. Burr, C. Yap","doi":"10.1145/3208976.3209010","DOIUrl":null,"url":null,"abstract":"Homotopy continuation is a well-known method in numerical root-finding. Recently, certified algorithms for homotopy continuation based on Smale's alpha-theory have been developed. This approach enforces very strong requirements at each step, leading to small step sizes. In this paper, we propose an approach that is independent of alpha-theory. It is based on the weaker notion of well-isolated approximations to the roots. We apply it to univariate polynomials and provide experimental evidence of its feasibility.","PeriodicalId":105762,"journal":{"name":"Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation","volume":"66 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3208976.3209010","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

Abstract

Homotopy continuation is a well-known method in numerical root-finding. Recently, certified algorithms for homotopy continuation based on Smale's alpha-theory have been developed. This approach enforces very strong requirements at each step, leading to small step sizes. In this paper, we propose an approach that is independent of alpha-theory. It is based on the weaker notion of well-isolated approximations to the roots. We apply it to univariate polynomials and provide experimental evidence of its feasibility.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
一种证明同伦连续路径的方法:单变量情况
同伦延拓是一种众所周知的数值求根方法。近年来,基于Smale理论的同伦延拓证明算法得到了发展。这种方法在每个步骤中强制执行非常强的需求,从而导致较小的步骤大小。在本文中,我们提出了一种独立于α理论的方法。它是基于对根的良好隔离近似的较弱的概念。我们将其应用于单变量多项式,并提供了其可行性的实验证据。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Constructive Arithmetics in Ore Localizations with Enough Commutativity Extending the GVW Algorithm to Local Ring Comparison of CAD-based Methods for Computation of Rational Function Limits Polynomial Equivalence Problems for Sum of Affine Powers Fast Straightening Algorithm for Bracket Polynomials Based on Tableau Manipulations
×
引用
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