On the complexity of curve fitting algorithms
type: Item
instance of: scholarly article
title: On the complexity of curve fitting algorithms
zbMATH Open document ID: 1344.65020
author: C. Lesort
author: Nikolai Chernov
author: Nándor Simányi
published in: Journal of Complexity
publication date: 2007-04-30T00:00:00Z
Mathematics Subject Classification ID: 65D10
Mathematics Subject Classification ID: 65Y20
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 5147742
zbMATH Keywords: least-squares fit
zbMATH Keywords: curve Fitting
zbMATH Keywords: algebraic gradient weight Fitting
zbMATH Keywords: complexity
MaRDI profile type: Publication
full work available at URL: j.jco.2004.01.004
OpenAlex ID: W2115341498
cites work: Q3763410
cites work: Statistical efficiency of curve fitting algorithms
cites work: Rationalising the renormalisation method of Kanatani
cites work: Least-squares fitting of circles and ellipses
cites work: Q4888878
cites work: Heteroscedastic regression in computer vision: Problems with bilinear constraint
cites work: Q5537599
cites work: Q3249822
DOI: 10.1016/J.JCO.2004.01.004
Recommended article: Statistical efficiency of curve fitting algorithms
Recommended article: Q3759722
Recommended article: On the complexity of parametrizing curves
Recommended article: On the performance of the approximate parametrization algorithm for curves
Recommended article: Q4717941
Recommended article: The theoretical analysis and algorithm on a class of optimal curve fitting problems
Recommended article: Q4539162
Recommended article: Complexity of curves
Recommended article: The Curve Fitting Problem: A Solution
description: scientific article; zbMATH DE number 5147742