Maximizing the spectral radius of a matrix product

DOI10.1016/j.laa.2014.10.046zbMath1307.65088OpenAlexW2093890377MaRDI QIDQ486206

Karl Peter Hadeler, Ludwig Elsner

Publication date: 14 January 2015

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

Full work available at URL: https://doi.org/10.1016/j.laa.2014.10.046

zbMATH Keywords

spectral radiusgradient flownonnegative matrixsteepest descentnumerical experimentbasic reproduction numbermax algebrapower methodPerron rootoptimal allocationmatrix eigenvalue problemssteepest descent method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Eigenvalues, singular values, and eigenvectors (15A18) Positive matrices and their generalizations; cones of matrices (15B48) Max-plus and related algebras (15A80)

Related Items (1)

From homogeneous eigenvalue problems to two-sex population dynamics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A characterization of the minimum cycle mean in a digraph
• Reproduction numbers and sub-threshold endemic equilibria for compartmental models of disease transmission
• On the power method in max algebra
• ON AN INEQUALITY IN PARTIAL AVERAGES
• Conditions for the Existence of a Balance Growth Solution for the Leontief Dynamic Input-Output Model
• A new mathematical framework for the study of linkage and selection
• Modifying the power method in max algebra

This page was built for publication: Maximizing the spectral radius of a matrix product