# Singular

 Note: If not registered, provide any username. For more comfort, register here.
Subject:
Message body:
Enter your message here, it may contain no more than 60000 characters.

 Smilies
 Font size: Tiny Small Normal Large Huge Font colour [quote="Justin C. Walker"]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[/quote]
Options:
 BBCode is ON [img] is ON [flash] is OFF [url] is ON Smilies are ON
 Disable BBCode Disable smilies Do not automatically parse URLs
Confirmation of post
To prevent automated posts the board requires you to enter a confirmation code. The code is displayed in the image you should see below. If you are visually impaired or cannot otherwise read this code please contact the %sBoard Administrator%s.
Confirmation code:
Enter the code exactly as it appears. All letters are case insensitive, there is no zero.

Topic review - Q1: computing polynomial values
Author Message
 greuel
 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);//-> 148For many points you should use a loop.Gert-Martinemail: greuel@mathematik.uni-kl.dePosted in old Singular Forum on: 2003-04-15 22:11:44+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);//-> 148For many points you should use a loop.Gert-Martinemail: greuel@mathematik.uni-kl.dePosted in old Singular Forum on: 2003-04-15 22:11:44+02
 Posted: Thu Sep 08, 2005 11:45 am
 Justin C. Walker
 Post subject:
 I'll redo this...forgot about the line-wrap problem:It appears based on what I read that the only way to evaluatea 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 computea bunch of values. Is there an alternative? A different way ofviewing the problem?Regards,Justinemail: justin@mac.comPosted in old Singular Forum on: 2003-04-10 03:33:12+02 I'll redo this...forgot about the line-wrap problem:It appears based on what I read that the only way to evaluatea 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 computea bunch of values. Is there an alternative? A different way ofviewing the problem?Regards,Justinemail: justin@mac.comPosted in old Singular Forum on: 2003-04-10 03:33:12+02
 Posted: Thu Sep 08, 2005 11:44 am
 Justin C. Walker
 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,Justinemail: justin@mac.comPosted in old Singular Forum on: 2003-04-10 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,Justinemail: justin@mac.comPosted in old Singular Forum on: 2003-04-10 03:31:33+02
 Posted: Thu Aug 11, 2005 5:31 pm

 It is currently Wed Jan 23, 2019 5:27 pm