Singular

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: [email protected]
Posted in old Singular Forum on: 2003-04-10 03:31:33+02

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: [email protected]
Posted in old Singular Forum on: 2003-04-10 03:33:12+02

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: [email protected]
Posted in old Singular Forum on: 2003-04-15 22:11:44+02