Re: sparse polynomial arithmetic

On Apr 1, 3:27 pm, Mike Hansen <mhan...@xxxxxxxxx> wrote:
On Apr 1, 5:57 am, Roman Pearce <rpear...@xxxxxxxxx> wrote:

A new library for high performance sparse polynomial arithmetic has
been under development at Simon Fraser University in Vancouver. The
program is faster than existing systems such as Pari, Magma, and
Singular, and it now rivals Trip (which uses double precision
coefficients).

It seems to be fast for polynomials with a billion terms.
Could you run tests with polynomials with, say, 20 terms, done 100
million times?
That might be more relevant for many people.
.

Relevant Pages

  • Re: sparse polynomial arithmetic
    ... program is faster than existing systems such as Pari, Magma, and ... Singular, and it now rivals Trip (which uses double precision ... I'll update the benchmarks later today, but so far April's build is ...
    (sci.math.symbolic)
  • Re: factoring lists in Singular
    ... general operating on multivariate polynomials. ... Overall Singular is probably the best free open source math software ... I found on the net a few examples of polynomials ... Multivariate polynomial factorization in Singular is very ...
    (sci.math.symbolic)
  • Re: factoring lists in Singular
    ... why is it easier to generate Groebner bases of the ideals ... After factoring we have polynomials of low degree, ... I am not aware of a text explicitely comparing FriCAS and Singular. ...
    (sci.math.symbolic)
  • Re: factoring lists in Singular
    ... polynomials that Maple 11 has had problems with. ... (My solution sets ... Singular to perform these simplifications? ... What's the problem with Maple? ...
    (sci.math.symbolic)
  • Re: factoring lists in Singular
    ... The corresponding command in Singular seems to be ... in Singular corresponds to the FriCAS/etc. ... v22l and v21l have a common root as polynomials in s. ...
    (sci.math.symbolic)