| Singular https://www.singular.uni-kl.de/forum/ |
|
| Q1: computing polynomial values https://www.singular.uni-kl.de/forum/viewtopic.php?f=10&t=1352 |
Page 1 of 1 |
| Author: | Justin C. Walker [ Thu Aug 11, 2005 5:31 pm ] |
| 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.com Posted in old Singular Forum on: 2003-04-10 03:31:33+02 |
|
| Author: | Justin C. Walker [ Thu Sep 08, 2005 11:44 am ] |
| Post subject: | |
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 |
|
| Author: | greuel [ Thu Sep 08, 2005 11:45 am ] |
| Post subject: | |
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 |
|
| Page 1 of 1 | All times are UTC + 1 hour [ DST ] |
| Powered by phpBB © 2000, 2002, 2005, 2007 phpBB Group http://www.phpbb.com/ |
|