Serge D. Mechveliani wrote:
>
> > You ask: "What is the fastest in Spad way to make f : UP(x, R) from
> > its _term (monomial) list_ free of zero coefficients and ordered
> > decreasingly by the exponent part?".
> > If you have list of pairs (exponent, coefficient) then using 'pretend'
> > to SparseUnivariatePolynomial and then coerce to
> > UnivariatePolynomial is fastest (but depends on internal details).
>
> In "Browse -- UnivariatePolynomial -- constructors",
> it is written that
> UnivariatePolynomial is represented sparsely_.
>
> Why does it also needs SparseUnivariatePolynomial ?
>
In SparseUnivariatePolynomial the variable is anonymous (have
no name). UnivariatePolynomial is SparseUnivariatePolynomial +
variable name.
--
Waldek Hebisch
[email protected]
--
You received this message because you are subscribed to the Google Groups
"FriCAS - computer algebra system" 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/fricas-devel?hl=en.
