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
回答（0 个）
类别
在 帮助中心 和 File Exchange 中查找有关 Linear Algebra 的更多信息
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
Translated by 
