Abstract
AbstractWe analyze the global convergence of the power iterates for the computation of a general mixed-subordinate matrix norm. We prove a new global convergence theorem for a class of entrywise nonnegative matrices that generalizes and improves a well-known results for mixed-subordinate $$\ell ^p$$
ℓ
p
matrix norms. In particular, exploiting the Birkoff–Hopf contraction ratio of nonnegative matrices, we obtain novel and explicit global convergence guarantees for a range of matrix norms whose computation has been recently proven to be NP-hard in the general case, including the case of mixed-subordinate norms induced by the vector norms made by the sum of different $$\ell ^p$$
ℓ
p
-norms of subsets of entries.
Funder
H2020 European Research Council
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,General Engineering,Theoretical Computer Science,Software,Applied Mathematics,Computational Mathematics,Numerical Analysis
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献