2024-04-28 00:42:32 +0200 | received badge | ● Taxonomist |

2021-08-30 16:55:24 +0200 | received badge | ● Famous Question (source) |

2018-09-20 10:24:12 +0200 | received badge | ● Notable Question (source) |

2018-08-19 19:37:27 +0200 | received badge | ● Great Question (source) |

2018-08-19 13:04:40 +0200 | received badge | ● Popular Question (source) |

2018-08-19 11:45:01 +0200 | received badge | ● Nice Answer (source) |

2018-08-19 11:40:20 +0200 | received badge | ● Good Question (source) |

2016-08-26 23:13:11 +0200 | commented answer | Quaternions Missing Important Functionality? I have run into another major problem with the quaternion package. You can not create functions that map variables to quaternions nor can you do global substitutions of variables. Here is an example, e1 is a quaternion. ~~~~ ~~~~ With output: ~~~~ ~~~~ As you can see, only when I extract a coefficient of the quaternion do I get what I expect from a simple substitution. |

2016-08-26 18:45:10 +0200 | received badge | ● Nice Question (source) |

2016-08-26 18:45:06 +0200 | received badge | ● Self-Learner (source) |

2016-08-26 18:45:06 +0200 | received badge | ● Teacher (source) |

2016-08-26 18:14:19 +0200 | received badge | ● Editor (source) |

2016-08-26 17:46:42 +0200 | answered a question | Quaternions Missing Important Functionality? After hacking away at this for a day or so, I can start answering some of my own questions. One reason why I didn't have answers right away is due to the fact that the automatically generated documentation for the quaternions does not cover the methods in the parent class nor does it cover several external functions that still work against the quaternion object. The other problem is that I am not an algebraist. So for example the fact that the scalar part is actually half the reduced trace was not readily obvious. So here is my take so far on my "issues". 1) Let q be an instance of a quaternion. q.reduced_trace()/2 is the scalar part. But even better is the undocumented fact that the [] operator has been overloaded so that you can simply do q[0]. That latter is a nice feature. Once you have that generating the "vector part" is easy enough. 2) Another undocumented feature is the .C method for matrices and the .conjugate() method which appears to exist for both quaternions and matrices. However it only gives you the quaternion conjugation not the elementwise complex conjugation. The latter has to be added by the programmer as far as I can tell. As for the other automorphisms like involution and reversion, they would have to be implemented by the programmer as far as I can tell. I suspect the same might be true for the more general Clifford algebras, but I'm not certain. 3) I'm stuck with this for now. Maybe there are undocumented constructors somewhere. 4) Well quaternions can not be elements of a vector, but it can be elements of a matrix! Whoo Hoo! Something like 5) As for rotations I guess we are on our own here. You will have to implement that your self as well as slerp and so forth for the computer graphics guys. I guess reflections or Lorentz transformations and so forth, which are nicely expressed in quaternions would also have to be a user application for now, along with wedge products, inner products and all the other types of multiplication in geometric algebras/clifford algebras. I have accumulated a few more complaints though as I have continued. First it appears that there is not a lot of support for global substitutions on symbolic quaternions. You can't define quaternion functions symbolically and you can't do global variable substitutions without directly accessing the components. Global differentiation also appears broken. Another gaping hole for any serious use of these libraries is the complete absence of quaternion transcendental functions. First there is no inverse! Yup quaternion inverse is missing. There is no exponentiation, no logarithm, no powers ... (more) |

2016-08-26 17:12:08 +0200 | answered a question | What are my best options for taking advantage of multiple cores? Meanwhile your high end gaming GPU might have 1500 cores in it. NVIDIA has a pretty good blas library that runs on their gpu's using CUDA. You can get access to CUDA through PyCuda https://mathema.tician.de/software/py... I believe that numba has a more direct link to cublas http://numba.pydata.org/ Of course this is for numerics. Wouldn't it be nice to write some opencl or cuda backends for some of the symbolic processing? I'd have to think that theorem proving or term rewriting is embarrassingly parallel based on the pure combinatorial searches that it entails. |

2016-08-26 13:39:33 +0200 | received badge | ● Student (source) |

2016-08-26 09:45:12 +0200 | answered a question | How do I save .sws files from notebook() on Safari? I'm having the same problem on linux mint 18 and it's sage 7.3 and five years later. I have no idea where the save files are and save as does not appear to work. Moreover I always get errors if I try to save. I do still see my notebook though. This is really bad. |

2016-08-26 09:45:11 +0200 | asked a question | Quaternions Missing Important Functionality? I use quaternions and Clifford algebras frequently for solving PDE boundary value problems as well as things like reflections, rotations etc. The underlying field for my quaternions is almost always either the complex numbers or the symbolic ring. I am making an attempt to use them in Sage but I've run into a couple of obstacles that have given me pause. The absolute first things I looked for were, 1) scalar part or real part of the quaternion. Where is this function? I stumbled upon turning it into a list or vector but I presume that just taking the scalar part would be more efficient than dumping all the coefficients. For matrix representations it's often just the trace of the matrix. Correspondingly obtaining the vector part should be a standard function as well. 2) Quaternion automorphisms and anti-automorphisms? where are they? Yes we have conjugate which is both a method and an external function but what about the reversion and involution and the many other automorphisms? I don't expect to have to multiply by a bunch of unit vectors to get them for efficiency reasons. Also how do I distinguish between the quaternion conjugate and the complex conjugate of each of it's elements? This is a very important distinction that I would not know how to do without stripping out it's components and then remapping it. 3) Constructing a quaternion from coefficients. The only examples I've seen require explicit multiplications like q = q0 + q1 * i + q2 * j + q3 * k . That doesn't seem efficient. 4) quaternions as elements of enclosing matrices and vectors. This would be very helpful since you could generate any Clifford algebra with this and it's often easier to analyze the components of said algebra that are isomorphic to Quaternions or Biquaternions in the complex case. Moreover I need to be able to do this for quaternions over the symbolic ring. It fails for me as this example from sage 7.3 shows: 5) quaternion rotations. Most libraries will generate the unit quaternion that rotates in 3D space and/or have a function that applies it efficiently. There are probably a few other things like generating a canonical matrix ... (more) |

Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.