# Singular

 Page 1 of 1 [ 3 posts ]
 Print view | E-mail friend Previous topic | Next topic
Author Message
 Post subject: Q1: computing polynomial valuesPosted: 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?

Regards,

Justin

email: justin@mac.com
Posted in old Singular Forum on: 2003-04-10 03:31:33+02

Top

 Post subject: Posted: 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

Top

 Post subject: Posted: 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

Top

 Display posts from previous: All posts1 day7 days2 weeks1 month3 months6 months1 year Sort by AuthorPost timeSubject AscendingDescending
 Page 1 of 1 [ 3 posts ]

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

 It is currently Wed Oct 17, 2018 3:33 pm