I think most matrix code is niave actually. Most references you will find will deal with numerical matrices, and the algorithms there generally don't apply very well for symbolic matrices, because they deal with different problems. I think as long as you aren't literally computing the 1 through nth power of the matrix that it should be fine.
I think there's also handy tricks to compute the exponential of a jordan matrix, if you are also implementing that. Aaron Meurer On Fri, Aug 3, 2012 at 4:24 PM, [email protected] <[email protected]> wrote: > Hello, > > I have been playing with implementing jordan forms and generalized > eigenvectors on and off for the last week and a half. It is not > directly related to my gsoc so I have not spent much time on it, > however it will permit extending the ODE system solver which I was > implementing and which is useful for the gsoc work. > > I have some initial code that I will clean up and post soon, however I > was wondering whether there are any good references that I have > missed. I have found discussions about jordan forms and eigenvectors, > however nothing that is directly related to implementing them in a > CAS, hence most of my code is quite naive. > > Do you have any good references that I should consult before > submitting the code? > > Regards > Stefan > > -- > You received this message because you are subscribed to the Google Groups > "sympy" group. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]. > For more options, visit this group at > http://groups.google.com/group/sympy?hl=en. > -- You received this message because you are subscribed to the Google Groups "sympy" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/sympy?hl=en.
