MathGroup Archive 2010

[Date Index] [Thread Index] [Author Index]

Search the Archive

Re: Problems with Mathematica 8.0 Solve

  • To: mathgroup at
  • Subject: [mg114824] Re: Problems with Mathematica 8.0 Solve
  • From: Roman Pearce <rpearcea at>
  • Date: Fri, 17 Dec 2010 23:50:19 -0500 (EST)
  • References: <id2eh3$d1i$>

On Nov 30, 1:01 am, Daniel Lichtblau <d... at> 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.

  • Prev by Date: Re: How can I perform Matrix comparison?Can any one with kindness help
  • Next by Date: Re: GPS
  • Previous by thread: Re: TextRecognize tabular data
  • Next by thread: need help with CUDA setup on my MacBook Pro