Post a reply
Username:
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
:D :) :( :o :shock: :? 8) :lol: :x :P :oops: :cry: :evil: :twisted: :roll: :wink: :!: :?: :idea: :arrow: :| :mrgreen:
Font size:
Font colour
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 - Robotic example in Ideals, Varieties and Algorithms (Cox)
Author Message
  Post subject:  Re: Robotic example in Ideals, Varieties and Algorithms (Cox)  Reply with quote
Please note that there is a simple typo in f_2:
f_2=(l(3))*s(2)*c(1)+(l(3))*c(2)*s(1)+(l(2))*s(1)+(-b);
Post Posted: Sun Jan 29, 2012 10:07 pm
  Post subject:  Robotic example in Ideals, Varieties and Algorithms (Cox)  Reply with quote
Hello,
for some time I've been trying the "reverse-kinematic-example" in the book (section 6, §3).
Unfortunately I don't get the solution the author has calculated in the book.
Could someone give me some hint for the corresponding singular code?
Below the code I tried so far:

Code:
ring R=(0,a,b,l(2),l(3)),(c(2),s(2),c(1),s(1)),lp;
poly f_1=l(3)*c(1)*c(2)-l(3)*s(1)*s(2)+l(2)*c(1)-a;
poly f_2=l(3)*c(1)*c(2)+l(3)*c(2)*s(1)+l(2)*s(1)-b;
poly f_3=c(1)^2+s(1)^2-1;
poly f_4=c(2)^2+s(2)^2-1;
ideal I = f_1, f_2, f_3, f_4;
option(redSB);
ideal G=std(I);
G;


Many thanks,
MK
Post Posted: Sat Jan 28, 2012 11:59 pm


It is currently Fri May 13, 2022 11:05 am
Powered by phpBB © 2000, 2002, 2005, 2007 phpBB Group