An a posteriori certification algorithm for Newton homotopies

J. Hauenstein, Ian Haywood, Alan C. Liddell
{"title":"An a posteriori certification algorithm for Newton homotopies","authors":"J. Hauenstein, Ian Haywood, Alan C. Liddell","doi":"10.1145/2608628.2608651","DOIUrl":null,"url":null,"abstract":"A Newton homotopy is a homotopy that involves changing only the constant terms. They arise naturally, for example, when performing monodromy loops, moving end effectors of robots, and simply when trying to compute a solution to a square system of equations. Previous certified path tracking techniques have focused on using an a priori certified tracking scheme which means that the stepsize is constructed so that the result automatically satisfies some conditions. These schemes use pessimistic stepsizes that can be much smaller than those used by heuristic tracking methods. This article designs an a posteriori certification scheme that uses the result of a heuristic tracking scheme as input to produce a certificate that the path was indeed tracked correctly, e.g., no path jumpings occurred. By using an a posteriori approach, each step can be certified independently and thus certification of the path can be performed in parallel. Examples are presented demonstrating the efficiency of this a posteriori certification approach.","PeriodicalId":243282,"journal":{"name":"International Symposium on Symbolic and Algebraic Computation","volume":"45 6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"20","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Symposium on Symbolic and Algebraic Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2608628.2608651","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 20

Abstract

A Newton homotopy is a homotopy that involves changing only the constant terms. They arise naturally, for example, when performing monodromy loops, moving end effectors of robots, and simply when trying to compute a solution to a square system of equations. Previous certified path tracking techniques have focused on using an a priori certified tracking scheme which means that the stepsize is constructed so that the result automatically satisfies some conditions. These schemes use pessimistic stepsizes that can be much smaller than those used by heuristic tracking methods. This article designs an a posteriori certification scheme that uses the result of a heuristic tracking scheme as input to produce a certificate that the path was indeed tracked correctly, e.g., no path jumpings occurred. By using an a posteriori approach, each step can be certified independently and thus certification of the path can be performed in parallel. Examples are presented demonstrating the efficiency of this a posteriori certification approach.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
牛顿同伦的后验证明算法
牛顿同伦是一种只改变常数项的同伦。它们很自然地出现,例如,在执行单回路时,移动机器人的末端执行器时,或者只是在试图计算平方方程组的解时。以前的认证路径跟踪技术主要集中在使用先验认证跟踪方案,即构造步长,使结果自动满足某些条件。这些方案使用悲观步长,可以比启发式跟踪方法使用的步长小得多。本文设计了一个后验认证方案,它使用启发式跟踪方案的结果作为输入来生成路径确实被正确跟踪的证书,例如,没有发生路径跳转。通过使用后验方法,每个步骤都可以独立地进行认证,因此可以并行执行路径的认证。举例说明了这种后验认证方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
On Minimal and Minimum Cylindrical Algebraic Decompositions Automated Reasoning For The Existence Of Darboux Polynomials New Bounds on Quotient Polynomials with Applications to Exact Division and Divisibility Testing of Sparse Polynomials Efficient detection of redundancies in systems of linear inequalities✱ Transcendental methods in numerical algebraic geometry
×
引用
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