Improved global algorithms for maximal eigenpair
This paper is a continuation of our previous paper [Front. Math. China, 2017, 12(5): 1023–1043] where global algorithms for computing the maximal eigenpair were introduced in a rather general setup. The efficiency of the global algorithms is improved in this paper in terms of a good use of power ite...
Saved in:
Published in | Frontiers of Mathematics Vol. 14; no. 6; pp. 1077 - 1116 |
---|---|
Main Authors | , |
Format | Journal Article |
Language | English |
Published |
Beijing
Higher Education Press
01.12.2019
Springer Nature B.V |
Subjects | |
Online Access | Get full text |
ISSN | 1673-3452 2731-8648 1673-3576 2731-8656 |
DOI | 10.1007/s11464-019-0799-z |
Cover
Summary: | This paper is a continuation of our previous paper [Front. Math. China, 2017, 12(5): 1023–1043] where global algorithms for computing the maximal eigenpair were introduced in a rather general setup. The efficiency of the global algorithms is improved in this paper in terms of a good use of power iteration and two quasi-symmetric techniques. Finally, the new algorithms are applied to Hua’s economic optimization model. |
---|---|
Bibliography: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
ISSN: | 1673-3452 2731-8648 1673-3576 2731-8656 |
DOI: | 10.1007/s11464-019-0799-z |