Global algorithms for maximal eigenpair
Mu-Fa CHEN
Front. Math. China ›› 2017, Vol. 12 ›› Issue (5) : 1023 -1043.
Global algorithms for maximal eigenpair
This paper is a continuation of our previous work [Front. Math. China, 2016, 11(6): 1379–1418] where an efficient algorithm for computing the maximal eigenpair was introduced first for tridiagonal matrices and then extended to the irreducible matrices with nonnegative off-diagonal elements. This paper introduces mainly two global algorithms for computing the maximal eigenpair in a rather general setup, including even a class of real (with some negative off-diagonal elements) or complex matrices.
Maximal eigenpair / shifted inverse iteration / global algorithm
| [1] |
|
| [2] |
|
| [3] |
|
| [4] |
|
| [5] |
|
| [6] |
|
| [7] |
|
| [8] |
|
| [9] |
|
| [10] |
|
| [11] |
|
| [12] |
|
| [13] |
|
Higher Education Press and Springer-Verlag GmbH Germany
/
| 〈 |
|
〉 |