NewRPL: Complex Numbers in Cartesian Form r[x,y] , ...
|
03-21-2017, 02:06 PM
Post: #8
|
|||
|
|||
RE: NewRPL: Complex Numbers in Cartesian Form
(03-18-2017 07:24 PM)Claudio L. Wrote: Actually, quaternions only have one challenge: make sure the CAS supports non-commutative multiplication. I was pondering this myself. The simple-but-ugly way would be to define a new operator for matrix multiplication, and another for anticommutative (ie, quaternion) multiplication. This would definitely work, but it feels unsatisfactory. It's not without precedent in RPL, though. Witness the DOT and CROSS commands. Hmm. The cross product is also anticommutative, maybe it could be repurposed to handle quaternions too? It's a pity that Hamilton accidentally defined the quaternions as a left-handed system! Speaking of which, find an elegant way to do Clifford algebras in newRPL, and I'll love you forever! I've been limping along with matrix representations... Hey, now there's a thought! How about implementing Clifford's geometric product? You'd get quaternion multiplication and cross products basically for free, along with plenty more stuff! The only annoying part would be deciding how to represent bivectors, trivectors, and the like in RPL, and how to store the signature of the space you're using. Maybe a fixed signature would be best if you chose to go this route, but what should it be? 4d Euclidean? Spacetime? Or *sob*, just 3d Euclidean? Even that would be a marked increase in power. |
|||
« Next Oldest | Next Newest »
|
User(s) browsing this thread: 1 Guest(s)