多项式零点的一种求解算法
首发时间:2019-11-21
摘要:已知多项式$\sum\limits_{i=0}^m a_i\,x^i\,(a_i\in \mathbb{R}, a_m=1, a_0\neq0)$有\,$m$\,个实的绝对值互异的零点. 本文提出一种迭代算法, 可以依次获得这些零点. 实验表明, 在实数轴上, 若相邻零点之间的距离较远, 则计算每个零点时的迭代次数很少(有时甚至仅1、2次). 另外, 迭代时的初始点可以随便取, 即不用刻意选.
For information in English, please click here
An algorithm for finding all zeros of a polynomial
Abstract:Given the polynomial $\sum\limits_{i=0}^m a_i\,x^i\,(a_i\in \mathbb{R}, a_m=1, a_0\neq0)$, which has $m$ real zeros with different absolute values. In this paper, an iterative algorithm is proposed to obtain these zeros in turn. Experiments show that if the distance between adjacent zeros is far, the number of iterations is very small (sometimes only 1 or 2) when calculating each zero. In addition, the initial points of iteration can be taken at will, that is, it is unnecessary to select deliberately.
Keywords: zero root iteration polynomial equation
引用
No.****
同行评议
共计0人参与
勘误表
多项式零点的一种求解算法
评论
全部评论0/1000