Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2022
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2202.13198 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908809991028736 |
|---|---|
| author | Manjegani, S. M. Peperko, A. Saljooghi, H. Shokooh |
| author_facet | Manjegani, S. M. Peperko, A. Saljooghi, H. Shokooh |
| contents | In this article we introduce a new method, which we call a mutation-sunflower method, for calculating max-eigenvectors of a nonnegative irreducible $n\times 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2202_13198 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | Calculating eigenvectors in max-algebra by mutation-sunflower method Manjegani, S. M. Peperko, A. Saljooghi, H. Shokooh Combinatorics Functional Analysis 15A80, 15A18 In this article we introduce a new method, which we call a mutation-sunflower method, for calculating max-eigenvectors of a nonnegative irreducible $n\times 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. |
| title | Calculating eigenvectors in max-algebra by mutation-sunflower method |
| topic | Combinatorics Functional Analysis 15A80, 15A18 |
| url | https://arxiv.org/abs/2202.13198 |