Finding largest eigenvalue of a polynomial eigenvalue problem

Hello

I am trying to solve an eigenvalue problem of the type find largest lambda such that : (A+lambda*B)*v=0 where A,B are n*n matrices. The function polyeig returns all the eigenvalues for the latter problem and thus this method is very slow to compute the largest eigenvalue. Is there a possibility to find only few largest eigenvalues? (In similar way like the function eigs for standard eigenvalue problem)

thanks

[KSSV]

Have you tried eig(A,B)?

[kevin k]

thank you. Indeed eigs(A,-B) does the work.