On the complexity of curve fitting algorithms

DOI10.1016/J.JCO.2004.01.004zbMath1344.65020OpenAlexW2115341498MaRDI QIDQ876816

C. Lesort, Nikolai I. Chernov, Nándor Simányi

Publication date: 30 April 2007

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jco.2004.01.004

zbMATH Keywords

complexitycurve Fittingalgebraic gradient weight Fittingleast-squares fit

Mathematics Subject Classification ID

Numerical smoothing, curve fitting (65D10) Analysis of algorithms (68W40) Complexity and performance of numerical algorithms (65Y20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Statistical efficiency of curve fitting algorithms
• Least-squares fitting of circles and ellipses
• Rationalising the renormalisation method of Kanatani
• Heteroscedastic regression in computer vision: Problems with bilinear constraint

This page was built for publication: On the complexity of curve fitting algorithms