Post new topic Reply to topic  [ 3 posts ] 
Author Message
 Post subject: Q1: computing polynomial values
PostPosted: Thu Aug 11, 2005 5:31 pm 
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


Report this post
Top
  
Reply with quote  
 Post subject:
PostPosted: Thu Sep 08, 2005 11:44 am 
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


Report this post
Top
  
Reply with quote  
 Post subject:
PostPosted: Thu Sep 08, 2005 11:45 am 

Joined: Mon Aug 29, 2005 9:22 am
Posts: 41
Location: Kaiserslautern, Germany
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


Report this post
Top
 Profile  
Reply with quote  
Display posts from previous:  Sort by  
Post new topic Reply to topic  [ 3 posts ] 

You can post new topics in this forum
You can reply to topics in this forum
You cannot edit your posts in this forum
You cannot delete your posts in this forum
You cannot post attachments in this forum

It is currently Thu Dec 14, 2017 8:55 pm
cron
Powered by phpBB © 2000, 2002, 2005, 2007 phpBB Group