I have a matrix A, and want to implement a simple power method iteration to find the largest eigenvalue in modulus. After doing this, I want to find the smallest (most negative) eigenpair of A, and here I think I need the Inverse power method with a shift. I know eig(A) works just fine, but I want to know how to do this using the power method iteration. Thanks!

 採用された回答

Andrew Newell
Andrew Newell 2011 年 3 月 30 日

1 投票

The power method is implemented in MATLAB here. They point out that a naive version of this algorithm will not work well under some circumstances.

2 件のコメント

sucheta
sucheta 2011 年 3 月 31 日
Thanks Andrew, I did look at that code but it seems far more complicated. I figured out a simpler code for the iteration. Thanks anyways!
Farudi
Farudi 2014 年 2 月 27 日
hi sucheta, can you give me the simpler code that you made?? thanks before :)

サインインしてコメントする。

その他の回答 (0 件)

カテゴリ

ヘルプ センター および File ExchangeLinear Algebra についてさらに検索

製品

質問済み:

2011 年 3 月 30 日

コメント済み:

2014 年 2 月 27 日

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by