On the Maximal Eigenvector of a Positive Matrix

Henryk Minc · SIAM Journal on Numerical Analysis · 1970

Previous article Next article On the Maximal Eigenvector of a Positive MatrixHenryk MincHenryk Minchttps://doi.org/10.1137/0707035PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAbout[1] Alfred Brauer, The theorems of Ledermann and Ostrowski on positive matrices, Duke Math. J., 24 (1957), 265–274 10.1215/S0012-7094-57-02434-1 MR0085218 0081.25103 CrossrefISIGoogle Scholar[2] M. Marcus and , H. Minc, Modern University Algebra, Macmillan, New York, 1966 Google Scholar[3] A. Ostrowski, Bounds for the greatest latent root of a positive matrix, J. London Math. Soc., 27 (1952), 253–256 MR0049152 0046.01301 CrossrefGoogle Scholar[4] A. M. Ostrowski, On the eigenvector belonging to the maximal root of a non-negative matrix, Proc. Edinburgh Math. Soc. (2), 12 (1960/1961), 107–112 MR0137718 0102.01501 CrossrefGoogle Scholar[5] Hans Schneider, Note on the fundamental theorem on irreducible non-negative matrices., Proc. Edinburgh Math. Soc., 11 (1958/1959), 127–130 MR0099349 0085.01104 CrossrefGoogle Scholar Previous article Next article FiguresRelatedReferencesCited byDetails Entrywise lower and upper bounds for the Perron vectorLinear Algebra and its Applications, Vol. 653 Cross Ref On tight bounds for function approximation error in risk-sensitive reinforcement learningSystems & Control Letters, Vol. 150 Cross Ref Extreme values of the stationary distribution of random walks on directed graphsAdvances in Applied Mathematics, Vol. 81 Cross Ref Quantum eigenvalue estimation for irreducible non-negative matrices24 May 2016 | International Journal of Quantum Information, Vol. 14, No. 01 Cross Ref On the Impact of Mutation-Selection Balance on the Runtime of Evolutionary AlgorithmsIEEE Transactions on Evolutionary Computation, Vol. 16, No. 2 Cross Ref Some Results on Correlation Matrices for Interest Rates17 June 2011 | Acta Applicandae Mathematicae, Vol. 115, No. 3 Cross Ref Spectral and graph-theoretic bounds on steady-state-probability estimation performance for an ergodic Markov chain Cross Ref Negative Drift in Populations Cross Ref On the largest eigenvalue of non-regular graphsJournal of Combinatorial Theory, Series B, Vol. 97, No. 6 Cross Ref Correlation matrices of yields and total positivityLinear Algebra and its Applications, Vol. 418, No. 2-3 Cross Ref Eigenvectors and eigenvalues of non-regular graphsLinear Algebra and its Applications, Vol. 409 Cross Ref Henryk Minc - A BiographyLinear and Multilinear Algebra, Vol. 51, No. 1 Cross Ref A Remark on Minc's Maximal Eigenvector Bound for Positive MatricesGeoff A. Latham17 July 2006 | SIAM Journal on Matrix Analysis and Applications, Vol. 16, No. 1AbstractPDF (484 KB)Alfred T. Brauer as a mathematician and teacherLinear Algebra and its Applications, Vol. 59 Cross Ref REFERENCES Cross Ref Results on measures of irreducibility and full indecomposability1 January 1975 | Transactions of the American Mathematical Society, Vol. 202, No. 0 Cross Ref Volume 7, Issue 3| 1970SIAM Journal on Numerical Analysis History Submitted:11 November 1969Published online:14 July 2006 InformationCopyright © 1970 Society for Industrial and Applied MathematicsPDF Download Article & Publication DataArticle DOI:10.1137/0707035Article page range:pp. 424-427ISSN (print):0036-1429ISSN (online):1095-7170Publisher:Society for Industrial and Applied Mathematics

Read the paper · More papers on PaperTik