#9406: Multi-dimensional polynomial fit
---------------------------+------------------------------------------------
Reporter: olazo | Owner: olazo
Type: enhancement | Status: new
Priority: major | Milestone: sage-4.5
Component: numerical | Keywords: polynomial,fit
Author: | Upstream: N/A
Reviewer: | Merged:
Work_issues: |
---------------------------+------------------------------------------------
At this point, the only way (to my knowledge) to use the least-squares
algorithm within sage is trough numpy.polyfit, which is limited to
1-dimensional polynomials. It takes a list of 2-tuples which are
interpreted as points of the form (x,P). And returns an array of
coefficients of the polynomial with the specified degree.
I've written a sage script that works for arbitrary dimensions, taking a
list of N-tuples, and returns a polynomial (as a sage-expression) with the
specified degree for each dimension.
I'll post this as soon as I gain access to off-line sage (at this point I
am stuck without it).
This would bring us closer to Mathematica's mighty Fit:
[http://reference.wolfram.com/mathematica/ref/Fit.html]
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/9406>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en.
