0

Hello,
So I have been trying to produce an algorithm for unsymmetric matrices which finds the smallest magnitude eigen value.
I have found this:
cfafcf24b5563ebb8aad4395c3c90ff0cfafcf24b5563ebb8aad4395c3c90ff0
However, I still don't know how to implement it in python. Can someone help out or provide psudocode/code ?

Edited by pyTony: fixed rubbish code for link

3
Contributors
2
Replies
22
Views
3 Years
Discussion Span
Last Post by BearofNH
1

The first question I will ask is, how are you representing the matrices? The most common matrix representions in Python would be as a list of lists, or (for constant matrices) a tuple of tuples. However, if you intend more elaborate operations, it may make sense to wrap that in a class. How are you representing them, and why?

2

I would use numpy and represent the matrix as an ARRAY datatype. Additionally, I'd look around numpy to see if somebody has already solved your problem. If not, please submit your solution when you got it working.

This topic has been dead for over six months. Start a new discussion instead.
Have something to contribute to this discussion? Please be thoughtful, detailed and courteous, and be sure to adhere to our posting rules.