arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2103.13949math.NAcs.NA
收藏

Lagrange基中的近似GCD

Approximate GCD in Lagrange bases

Leili Rafiee Sevyeri, Robert M. Corless

摘要:

对于一对具有实系数或复系数的多项式,在任何特定的基础上,找到它们的GCD的问题是已知的不适定。然而,对于许多应用仍然需要答案。因此,寻找所谓的近似多项式的GCD,其中该术语明确表示系数中的小不确定性,在混合符号-数值计算领域中受到了极大的关注。在本文中,我们给出了一个算法的基础上,维克多亚。潘,找到一个近似的GCD为一对近似多项式在拉格朗日基础。更准确地说,我们假设这些多项式是由它们在不同已知点处的近似值给出的。我们首先通过使用每个多项式的拉格朗日基友矩阵来找到它们的每个根,对每个多项式的根进行聚类以识别重根,然后将两个多项式“结合”以找到它们的GCD。在任何时候,我们都不改变单项基础,从而保持了良好的条件性质的原始拉格朗日基础。我们讨论了这种方法的优点和缺点。计算成本主要由求根步骤决定;除非使用特殊用途的特征值算法,否则成本是多项式次数的三次方。原则上,这一成本可以降低,但我们在这里不这样做。

英文摘要:

For a pair of polynomials with real or complex coefficients, given in any particular basis, the problem of finding their GCD is known to be ill-posed. An answer is still desired for many applications, however. Hence, looking for a GCD of so-called approximate polynomials where this term explicitly denotes small uncertainties in the coefficients has received significant attention in the field of hybrid symbolic-numeric computation. In this paper we give an algorithm, based on one of Victor Ya. Pan, to find an approximate GCD for a pair of approximate polynomials given in a Lagrange basis. More precisely, we suppose that these polynomials are given by their approximate values at distinct known points. We first find each of their roots by using a Lagrange basis companion matrix for each polynomial, cluster the roots of each polynomial to identify multiple roots, and then "marry" the two polynomials to find their GCD. At no point do we change to the monomial basis, thus preserving the good conditioning properties of the original Lagrange basis. We discuss advantages and drawbacks of this method. The computational cost is dominated by the rootfinding step; unless special-purpose eigenvalue algorithms are used, the cost is cubic in the degrees of the polynomials. In principle, this cost could be reduced but we do not do so here.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑