Skip to main content
Log in

Global algorithms for maximal eigenpair

  • Research Article
  • Published:
Frontiers of Mathematics in China Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Arapostathis A, Borkar V S, Kumar K S. Risk-sensitive control and an abstract Collatz–Wielandt formula. J Theoret Probab, 2016, 29(4): 1458–1484

    Article  MathSciNet  MATH  Google Scholar 

  2. Chang K C. Nonlinear extensions of the Perron–Frobenius theorem and the Krein–Rutman theorem. J Fixed Point Theory Appl, 2014, 15: 433–457

    Article  MathSciNet  MATH  Google Scholar 

  3. Chen M F. From Markov Chains to Non-Equilibrium Particle Systems. 2nd ed. Singapore: World Scientific, 2004

    Book  MATH  Google Scholar 

  4. Chen M F. Speed of stability for birth-death processes. Front Math China, 2010, 5(3): 379–515

    Article  MathSciNet  MATH  Google Scholar 

  5. Chen M F. Efficient initials for computing the maximal eigenpair. Front Math China, 2016, 11(6): 1379–1418; see also volume 4 in the middle of author’s homepage: http://math0.bnu.edu.cn/chenmf A package based on the paper is available on CRAN now (by X. J. Mao). One may check it through the link: https://cran.r-project.org/web/packages/EfficientMaxEigenpair/index.html

    Article  MathSciNet  MATH  Google Scholar 

  6. Chen M F. Efficient algorithm for principal eigenpair of discrete p-Laplacian. Preprint, 2017

    Google Scholar 

  7. Chen M F, Zhang X. Isospectral operators. Commun Math Stat, 2014, 2: 17–32

    Article  MathSciNet  MATH  Google Scholar 

  8. Chen R R. An extended class of time-continuous branching processes. J Appl Probab, 1997, 34(1): 14–23

    Article  MathSciNet  MATH  Google Scholar 

  9. Donsker W D, Varadhan S R S. On a variational formula for the principal eigenvalue for operators with maximum principle. Proc Natl Acad Sci, 1975, 72(3): 780–783

    Article  MathSciNet  MATH  Google Scholar 

  10. Noutsos D. On Perron–Frobenius property of matrices having some negative entries. Linear Algebra Appl, 2006, 412: 132–153

    Article  MathSciNet  MATH  Google Scholar 

  11. Noutsos D. Perron Frobenius theory and some extensions. 2008, http://www.pdfdrive. net/perron-frobenius-theory-and-some-extensions-e10082439.html

    MATH  Google Scholar 

  12. Noutsos D, Varga R S. On the Perron–Frobenius theory for complex matrices. Linear Algebra Appl, 2012, 437: 1071–1088

    Article  MathSciNet  MATH  Google Scholar 

  13. Sheu S J. Stochastic control and principal eigenvalue. Stochastics, 1984, 11(3-4): 191–211

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Mu-Fa Chen.

Additional information

Assisted by Yue-Shuang Li

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Chen, MF. Global algorithms for maximal eigenpair. Front. Math. China 12, 1023–1043 (2017). https://doi.org/10.1007/s11464-017-0658-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11464-017-0658-8

Keywords

MSC

Navigation