
doi: 10.1137/0601022
Let A be a nonnegative $n \times n$ matrix. In this paper we study the growth of the powers $A^m, m = 1,2,3, \cdots $ when $\rho ( A ) = 1$. These powers occur naturally in the iteration process \[x^{( m + 1 )} = Ax^{( m )} ,\quad x^{( 0 )} \geqq 0,\] which is important in applications and numerical techniques. Roughly speaking, we analyze the asymptotic behavior of each entry of $A^m $. We apply our main result to determine necessary and sufficient conditions for the convergence to the spectral radius of A of certain ratios naturally associated with the iteration above.
Numerical computation of eigenvalues and eigenvectors of matrices, vector iteration, Norms of matrices, numerical range, applications of functional analysis to matrix theory, asymptotic behavior, growth of the powers, convergence to the spectral radius
Numerical computation of eigenvalues and eigenvectors of matrices, vector iteration, Norms of matrices, numerical range, applications of functional analysis to matrix theory, asymptotic behavior, growth of the powers, convergence to the spectral radius
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 34 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 1% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Top 10% |
