mjacobi Posted May 21, 2008 Posted May 21, 2008 Hi all, Given two quadratic matrices A and B. Does anyone know if there exist some efficient (polynomial) algorithm for identifying subspaces that are invariant under both A and B? Thanks for help on this
Dr. Jekyll Posted May 23, 2008 Posted May 23, 2008 I remember something about generalized eigenvalue problem in connection to this, but I can't place it. Think it was a presentation at some conference I attended some years ago.
Recommended Posts
Create an account or sign in to comment
You need to be a member in order to leave a comment
Create an account
Sign up for a new account in our community. It's easy!
Register a new accountSign in
Already have an account? Sign in here.
Sign In Now