Post a reply
Username:
Note:If not registered, provide any username. For more comfort, register here.
Subject:
Message body:
Enter your message here, it may contain no more than 60000 characters. 

Smilies
:D :) :( :o :shock: :? 8) :lol: :x :P :oops: :cry: :evil: :twisted: :roll: :wink: :!: :?: :idea: :arrow: :| :mrgreen:
Font size:
Font colour
Options:
BBCode is ON
[img] is ON
[flash] is OFF
[url] is ON
Smilies are ON
Disable BBCode
Disable smilies
Do not automatically parse URLs
Confirmation of post
To prevent automated posts the board requires you to enter a confirmation code. The code is displayed in the image you should see below. If you are visually impaired or cannot otherwise read this code please contact the %sBoard Administrator%s.
Confirmation code:
Enter the code exactly as it appears. All letters are case insensitive, there is no zero.
   

Topic review - How to calculate Univariate Polynomial in singular?
Author Message
  Post subject:  Re: How to calculate Univariate Polynomial in singular?  Reply with quote
Quote:
gorzel


thank you very much!!!
Post Posted: Fri Sep 16, 2011 7:42 pm
  Post subject:  Re: How to calculate Univariate Polynomial in singular?  Reply with quote
The task behind is to eliminate the variable y from the two equations.

There exist two methods:

A) do a Groebner basis calculation w.r.t. to a elimination ordering
e.g. a lexicographical ordering.
Here you may also use simply Singular's command eliminate
which uses some (hidden) strategies for the choice of the ordering

B) make a resultant computation

In both cases the result is (upto to the sign) the same,
however the the speed may variy in some cases and it can not be said
which is the faster.
In your example the result is obtained instantly with both methods.

Code:
> ring r =(0,a,b),(x,y),dp;    // a and b are parameters, x,y are variables
> poly f = ax3-3xy+b;
> poly g = x2y-2y2+x;
> ideal I = f,g;

// Groebnerbasis method: eliminate takes as input an ideal an returns an ideal
> eliminate(I,y);
_[1]=(2a2-3a)*x6+(4ab-3b-9)*x3+(2b2)
> poly h = _[1];      // access to the last result with _  (in Maple it is %)
> h;
(2a2-3a)*x6+(4ab-3b-9)*x3+(2b2)

> // resultant method
> resultant(f,g,y);
(-2a2+3a)*x6+(-4ab+3b+9)*x3+(-2b2)
> short =0;
> _;
(-2*a^2+3*a)*x^6+(-4*a*b+3*b+9)*x^3+(-2*b^2)


As you see, the result is displayed as polynomial in x with polynomial
coefficient in the the parameters a and b.
Post Posted: Fri Sep 16, 2011 11:58 am
  Post subject:  How to calculate Univariate Polynomial in singular?  Reply with quote
Could someone please give me a screen shot and/or a copy-and-paste of the codes that would do the following simple task done in maple:

Image

Let me explain a bit:

The input is F, which is a set of 2 polynomials.

The command Groebner:-UnivariatePolynomial takes F as the input, and outputs a polynomial only in x, you might ask: "but a and b are also in the output, why?" this is because a and b are considered to be parameters, only x and y are variables as defined by {x,y} in the command.

I tried to look for a "Univariate Polynomial"-like command in the singular tutorial but with no luck, as you probably have guessed, for a long time Maple user like me, Singular is kind of hard to get the hang of, many thanks to anyone who would kindly help me out!!!
Post Posted: Thu Sep 15, 2011 9:18 pm


It is currently Fri May 13, 2022 11:02 am
Powered by phpBB © 2000, 2002, 2005, 2007 phpBB Group