The Math Forum

Search All of the Math Forum:

Views expressed in these public forums are not endorsed by NCTM or The Math Forum.

Math Forum » Discussions » Inactive » comp.soft-sys.math.mathematica

Notice: We are no longer accepting new posts, but the forums will continue to be readable.

Topic: Problems with Mathematica 8.0 Solve
Replies: 6   Last Post: Dec 17, 2010 11:50 PM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]
Roman Pearce

Posts: 121
Registered: 1/25/05
Re: Problems with Mathematica 8.0 Solve
Posted: Dec 17, 2010 11:50 PM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

On Nov 30, 1:01 am, Daniel Lichtblau <> wrote:
> Version 8 Solve attempts to compute a lexicographic Groebner basis over
> a field of fractions in the parameters. I gather this turns out to be
> very difficult for this example, and it hangs here. I do not know
> offhand whether this indicates a limitation of our Groebnerbasis code,
> or this is just an intrinsically difficult computation.

Unless evaluation and interpolation are used extensively, computing
over the field of fractions is intrinsically harder. The gain is that
you remove content from all the polynomials in each step, which may
help simplify the system. In practice you can just preprocess the
generators because once the Groebner algorithms start running this is
quite rare. A fast modular method over Q using a block order, with
parameters below the original variables, is often better for a small
number of parameters.

Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© The Math Forum at NCTM 1994-2018. All Rights Reserved.