Back to Forum  View unanswered posts  View active topics
Topic review  Q1: computing polynomial values 
Author 
Message 


Post subject: 



Use the subst command, e.g. ring r = 0,(x,y,z),dp; poly f = x3+xyzyz+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. GertMartin email: greuel@mathematik.unikl.dePosted in old Singular Forum on: 20030415 22:11:44+02
Use the subst command, e.g. ring r = 0,(x,y,z),dp; poly f = x3+xyzyz+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.
GertMartin
email: greuel@mathematik.unikl.de Posted in old Singular Forum on: 20030415 22:11:44+02




Posted: Thu Sep 08, 2005 11:45 am 





Post subject: 



I'll redo this...forgot about the linewrap 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.comPosted in old Singular Forum on: 20030410 03:33:12+02
I'll redo this...forgot about the linewrap 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: 20030410 03:33:12+02




Posted: Thu Sep 08, 2005 11:44 am 





Post subject: 
Q1: computing polynomial values 


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.comPosted in old Singular Forum on: 20030410 03:31:33+02
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: 20030410 03:31:33+02




Posted: Thu Aug 11, 2005 5:31 pm 





It is currently Sun Aug 19, 2018 5:26 pm

