Back to Forum | View unanswered posts | View active topics





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 - Q1: computing polynomial values
Author Message
greuel
  Post subject:   Reply with quote
Use the subst command, e.g.
ring r = 0,(x,y,z),dp;
poly f = x3+xyz-yz+z3;
//evaluate f at x=2,y=3,z=5:
subst(f,x,2,y,3,z,5);
//-> 148
For many points you should use a loop.

Gert-Martin

email: greuel@mathematik.uni-kl.de
Posted in old Singular Forum on: 2003-04-15 22:11:44+02
Post Posted: Thu Sep 08, 2005 11:45 am
Justin C. Walker
  Post subject:   Reply with quote
I'll redo this...forgot about the line-wrap problem:

It appears based on what I read that the only way to evaluate
a polynomial at a point is the following sort of code:
poly f ...;
map F CurRing, values;
F(f);
Is this correct? It seems quite tedious if one wants to compute
a bunch of values. Is there an alternative? A different way of
viewing the problem?

Regards,

Justin

email: justin@mac.com
Posted in old Singular Forum on: 2003-04-10 03:33:12+02
Post Posted: Thu Sep 08, 2005 11:44 am
Justin C. Walker
  Post subject:  Q1: computing polynomial values  Reply with quote
Hi,

It appears based on what I read that the only way to evaluate a polynomial at a point is the following sort of code:
poly f ...;
map F CurRing, values;
F(f);
Is this correct? It seems quite tedious if one wants to compute a bunch of values. Is there an alternative? A different way of viewing the problem?

Thanks for your help.

Regards,

Justin

email: justin@mac.com
Posted in old Singular Forum on: 2003-04-10 03:31:33+02
Post Posted: Thu Aug 11, 2005 5:31 pm


It is currently Fri May 13, 2022 10:57 am
cron
Powered by phpBB © 2000, 2002, 2005, 2007 phpBB Group