曲线拟合算法的复杂性
On the complexity of curve fitting algorithms
摘要：
研究了一种基于梯度权最小二乘的散乱数据多项式曲线拟合算法。我们表明，有时这种算法承认大幅降低复杂性，而且，找到精确的条件下，这是可能的。事实证明，这确实是可能的，当一个适合圆，但不是椭圆或双曲线。
英文摘要：
We study a popular algorithm for fitting polynomial curves to scattered data based on the least squares with gradient weights. We show that sometimes this algorithm admits a substantial reduction of complexity, and, furthermore, find precise conditions under which this is possible. It turns out that this is, indeed, possible when one fits circles but not ellipses or hyperbolas.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
