Numerical Methods for Solving High Order Polynomial Equations

Ling Wamg, Kaili Wang, Guanchen Zhou, Yuhuan Cui
{"title":"Numerical Methods for Solving High Order Polynomial Equations","authors":"Ling Wamg, Kaili Wang, Guanchen Zhou, Yuhuan Cui","doi":"10.1109/ICIC.2011.83","DOIUrl":null,"url":null,"abstract":"The problem of finding the roots of a polynomial equation is important because many calculations in engineering and scientific computation can be summarized to it. An adaptive algorithm based on Sturm's theorem which could find the isolate intervals for all the real roots rapidly is used to locate all the roots. To find the numerical root, they will first be roughly approximated by dichotomy method. And then these roots are computed by Newton method using the initial values got in the first step. This method overcomes the shortcomings of dichotomy method and iterative method. The first step could find a good initial point quickly for Newton method, and Newton method converges faster than dichotomy method. Numerical example shows the effectiveness of this method.","PeriodicalId":6397,"journal":{"name":"2011 Fourth International Conference on Information and Computing","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2011-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 Fourth International Conference on Information and Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIC.2011.83","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

The problem of finding the roots of a polynomial equation is important because many calculations in engineering and scientific computation can be summarized to it. An adaptive algorithm based on Sturm's theorem which could find the isolate intervals for all the real roots rapidly is used to locate all the roots. To find the numerical root, they will first be roughly approximated by dichotomy method. And then these roots are computed by Newton method using the initial values got in the first step. This method overcomes the shortcomings of dichotomy method and iterative method. The first step could find a good initial point quickly for Newton method, and Newton method converges faster than dichotomy method. Numerical example shows the effectiveness of this method.
求解高阶多项式方程的数值方法
多项式方程的求根问题很重要,因为工程和科学计算中的许多计算都可以归结为它。采用基于Sturm定理的自适应算法,快速找到所有实数根的隔离区间,实现了所有实数根的定位。为了求出数值根,首先用二分法对它们进行粗略近似。然后用牛顿法计算这些根用第一步得到的初值。该方法克服了二分法和迭代法的不足。牛顿法第一步可以快速找到一个好的初始点,牛顿法比二分法收敛速度快。数值算例表明了该方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信