Member of the polynomials class.
[x, eig] = polyeig(a0, a1, ... , an)
Solves the polynomial eigenvalue problem of degree n: (a0+lambda*a1+...+lambda^n*an)*x = 0. You can specify an unlimited number of input matrices. All matrices must be square and of the same size.
| Name | Description |
| a0 | Specifies a real or complex square matrix. |
| a1 | Specifies a real or complex square matrix of the same size as a0. |
| an | Specifies a real or complex square matrix of the same size as a0. |
| Name | Description |
| x | Returns a matrix whose columns represent the eigenvectors of the input matrices. |
| eig | Returns the eigenvalues of the input matrices. eig is a vector. |
A0 = [1, 2; 3, 4]
A1 = [2, 1; 1, 0]
A2 = [-1, -1; 0, 2]
[X, EIG] = polyeig(A0, A1, A2)