Re: Looking for an algorithm: polynomial eigenvalue problem

Peter, thanks for the suggestions.

Since originally posting, I now see at least how to do the
'naive' linearization, and have coded that successfully in Mathematica.
If this leads to problematically large systems
in my application, I'll investigate further methods.

Rainer,
Perhaps I should have said that
both A_0 and A_p should be non-singular (I am
still learning about this problem). The method
I coded certainly requires that the leading
coefficient matrix A_p be non-singular, since I have
to invert it. I expect you will find that there is a non-trivial solution to
any simple p=1 and N=2 case (your example) as long as you ensure this.
If you find an exception to that rule, I would certainly like to
hear about it.

regards,
alan


.

Loading