[
https://issues.apache.org/jira/browse/MATH-1009?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=13914556#comment-13914556
]
Luc Maisonobe commented on MATH-1009:
-------------------------------------
Yes, this specific bug is considered fixed.
Another bug report should be opened for removing the uneeded initial guess and
max iteration. You can open it if you want, so we don't lose track of the
problem.
Thanks in advance.
> PolynomialFitter
> ----------------
>
> Key: MATH-1009
> URL: https://issues.apache.org/jira/browse/MATH-1009
> Project: Commons Math
> Issue Type: Improvement
> Affects Versions: 3.2
> Environment: All
> Reporter: Konstantin Berlin
> Priority: Minor
> Fix For: 3.3
>
>
> org.apache.commons.math3.fitting.PolynomialFitter
> should be implemented using linear least-squares method like QR decomposition
> solver.
> There are several reasons for this
> 1) Nonlinear methods are much slower
> 2) Linear methods (QR and SVD) are numerically more stable.
> 3) By storing the QR decomposition it is possible to recompute the solution
> for different input data values.
> See
> http://mathworld.wolfram.com/LeastSquaresFittingPolynomial.html
--
This message was sent by Atlassian JIRA
(v6.1.5#6160)
