You are viewing a plain text version of this content. The canonical link for it is here.

Posted to issues@commons.apache.org by "Gilles (JIRA)" <ji...@apache.org> on 2013/07/18 15:44:56 UTC

[jira] [Updated] (MATH-1009) PolynomialFitter

     [ https://issues.apache.org/jira/browse/MATH-1009?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel ]

Gilles updated MATH-1009:
-------------------------

             Priority: Minor  (was: Major)
    Affects Version/s:     (was: 4.0)

Patch welcome.
                
> 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 is automatically generated by JIRA.
If you think it was sent incorrectly, please contact your JIRA administrators
For more information on JIRA, see: http://www.atlassian.com/software/jira