On the complexity of curve fitting algorithms

DOI10.1016/J.JCO.2004.01.004zbMATH Open1344.65020OpenAlexW2115341498MaRDI QIDQ876816FDOQ876816

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

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) Complexity and performance of numerical algorithms (65Y20) Analysis of algorithms (68W40)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Least-squares fitting of circles and ellipses
• Statistical efficiency of curve fitting algorithms
• Title not available (Why is that?)
• Heteroscedastic regression in computer vision: Problems with bilinear constraint
• Rationalising the renormalisation method of Kanatani

Cited In (1)

• The theoretical analysis and algorithm on a class of optimal curve fitting problems

   Recommendations

• Statistical efficiency of curve fitting algorithms 👍 👎
• Title not available (Why is that?) 👍 👎
• On the complexity of parametrizing curves 👍 👎
• On the performance of the approximate parametrization algorithm for curves 👍 👎
• Title not available (Why is that?) 👍 👎
• The theoretical analysis and algorithm on a class of optimal curve fitting problems 👍 👎
• Title not available (Why is that?) 👍 👎
• Complexity of curves 👍 👎
• The Curve Fitting Problem: A Solution 👍 👎

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q876816)