[
https://issues.apache.org/jira/browse/MATH-1009?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=13906805#comment-13906805
]
Luc Maisonobe commented on MATH-1009:
-------------------------------------
I think this issue was fixed with one of the patches applied for MATH-1099.
Can we consider it resolved?
> 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
>
> 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)
