2022/02/26 by Seyed Mahmoud Manjegani, Manjegani, S. M., Aljoša Peperko +3
Computer Science · Mathematics · #15A18 #15A80 #Advanced Topics in Algebra #Combinatorics (math.CO) #FOS: Mathematics #Functional Analysis (math.FA) #Matrix Theory and Algorithms #Polynomial and algebraic computation
paper · pdf · doi:10.48550/arxiv.2202.13198
openalex publication_date 2022/02/26 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this article we introduce a new method, which we call a mutation-sunflower method, for calculating max-eigenvectors of a nonnegative irreducible n× n matrix A. Our method works in the general irreducible case, but it is in comparison with existing methods most effective for some special classes of matrices for example for sparse enough matrices. Our method reduces to solving max-eigenproblems for simple mutation-sunflower matrices that have exactly one positive entry in each row. We include some instructive examples.