对偶伯恩斯坦多项式的快速精确计算
Fast and accurate evaluation of dual Bernstein polynomials
摘要:
对偶伯恩斯坦多项式在逼近论、计算数学、数值分析和计算机辅助几何设计中有着广泛的应用。在这种情况下,一个主要的问题是快速和准确的评估这些多项式和它们的线性组合。给出了对偶伯恩斯坦多项式所满足的新的简单的低阶递推关系。特别地,得到了对偶Bernstein多项式与移位Jacobi正交多项式之间的一阶非齐次递推关系.当使用得当,它允许提出快速和数值有效的算法,用于评估所有$n+1$双伯恩斯坦多项式的程度$n$与$O(n)$计算复杂性。
英文摘要:
Dual Bernstein polynomials find many applications in approximation theory, computational mathematics, numerical analysis and computer-aided geometric design. In this context, one of the main problems is fast and accurate evaluation both of these polynomials and their linear combinations. New simple recurrence relations of low order satisfied by dual Bernstein polynomials are given. In particular, a first-order non-homogeneous recurrence relation linking dual Bernstein and shifted Jacobi orthogonal polynomials has been obtained. When used properly, it allows to propose fast and numerically efficient algorithms for evaluating all $n+1$ dual Bernstein polynomials of degree $n$ with $O(n)$ computational complexity.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。