Diagonal transformation methods for computing the maximal eigenvalue and eigenvector of a nonnegative irreducible matrix

DOI10.1016/0024-3795(91)90089-FzbMath0716.65037OpenAlexW2172109545MaRDI QIDQ753420

Pham Van At

Publication date: 1991

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(91)90089-f

zbMATH Keywords

convergenceeigenvectorspectral radiusmaximal eigenvaluenonnegative irreducible matrixdiagonal transformation method

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Related Items (1)

The Yakubovich S-Lemma Revisited: Stability and Contractivity in Non-Euclidean Norms

Cites Work

• Unnamed Item
• Unnamed Item
• Verfahren zur Berechnung des Spektralradius nichtnegativer irreduzibler Matrizen. (A method for calculating the spectral radius of non-negative irreducible matrices)
• A Class of Diagonal Transformation Methods for the Computation of the Spectral Radius of a Nonnegative Irreducible Matrix
• Reduction of an irreducible non-negative matrix to quasi-stochastic form by the method of similarity variation
• Computing the Maximal Eigenvalue and Eigenvector of a Positive Matrix
• A Method for the Computation of the Greatest Root of a Nonnegative Matrix
• An Iterative Procedure for Computing the Maximal Root of a Positive Matrix
• Computing the Maximal Eigenvalue and Eigenvector of a Nonnegative Irreducible Matrix
• Reduction of a positive matrix to a quasistochastic matrix by a similar variation method

This page was built for publication: Diagonal transformation methods for computing the maximal eigenvalue and eigenvector of a nonnegative irreducible matrix