On the complexity of curve fitting algorithms

Details On the complexity of curve fitting algorithms On the complexity of curve fitting algorithms

2003-08-15

arxiv.org/abs/cs/0308023v1

Journal of Complexity, Vol. 20, Issue 4, August 2004, pp. 484-492

Computer Science

Computational Complexity

8 pages, no figures

Scientific paper

10.1016/j.jco.2004.01.004

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.

Affiliated with

Also associated with

No associations

Rating

On the complexity of curve fitting algorithms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the complexity of curve fitting algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the complexity of curve fitting algorithms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-329248