On the complexity of curve fitting algorithms
N. Chernov, C. Lesort, N. Simanyi
Abstract
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.
Create a lesson
Related papers
Asymptotic advantage of quantum one-way and SMP communication for total functions
Dmytro Gavinsky
A New Characterization of Streaming Decidability of Boolean CSPs Under Deletions
Aditya Bandekar, Amatya Sharma, Santhoshini Velusamy
Degree profiles of uniform polynomial consequences: Linear lower bounds for Nullstellensatz and Polynomial Calculus
Søren Riis
Quadratic Extractors
Gautam Chandrasekaran, Jesse Goodman, David Zuckerman
PIT and Reconstruction for Sums of Powers
Nimrod Kaplan, Amir Shpilka, Yann Tal
The determinantal complexity of the 4*4 permanent is 15
Karthik Sheshadri