MathGroup Archive 2013

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

Search the Archive

Re: Elimination problem

  • To: mathgroup at smc.vnet.net
  • Subject: [mg130273] Re: Elimination problem
  • From: debguy <johnandsara2 at cox.net>
  • Date: Sun, 31 Mar 2013 03:12:30 -0400 (EDT)
  • Delivered-to: l-mathgroup@mail-archive0.wolfram.com
  • Delivered-to: l-mathgroup@wolfram.com
  • Delivered-to: mathgroup-newout@smc.vnet.net
  • Delivered-to: mathgroup-newsend@smc.vnet.net
  • References: <ki8o42$knp$1@smc.vnet.net>

First I'm sorry in the way I sounded you should post whatever pleases
you.

I tried again (egg on my face) the equations are well formed that was
my fault.

I see using Eliminate on parts of the equations that m,n eliminate
completely.  I imagine if Elimanate is used long enough on the whole
equation it will remove them all completely, assuming it ever
finishes.

I have no time to check or proof it, I'm guessing the number of roots
for the eq'n you gave is is 3 and the others fall out because of the
way you asked the question and because m and n appear in patterns
sequentially in the terms (it isn't true in general for the polynomial
of any form).  Which is why if I remove the head or tail m and n are
removed.

I don't know a law of elimination that applies off the top of my head
I'd have to look it up.  You could use a divide and conquer strategy.

Nice question actually.



  • Prev by Date: Re: OpenCL yes, Cuda no
  • Next by Date: Side-by-side cells ("bilateral cells"): text and graphics side-by-side
  • Previous by thread: Re: Elimination problem
  • Next by thread: PERatio