An always convergent method for finding the spectral radius of an irreducible non-negative matrix R. J. Wood ∗ M. J. O’Neill† An always convergent method is used to calculate the spectral radius of an irreducible non-negative matrix. The method is an adap-tation of a method of Collatz (1942), and has similarities to both the power method and the inverse power method. For large matrices it is faster than the eig routine in Matlab. Special attention is paid to the step-by-step improvement of the bounds and the subsequen
summary:We obtain a sharp upper bound for the spectral radius of a nonnegative matrix. This result i...
Abstract In this paper, we give some new sharp upper and lower bounds for the spectral radius of a n...
AbstractA class of methods for the computation of the Perron root and vector of a nonnegative irredu...
An always convergent method is used to calculate the spectral radius of an irreducible non-negative ...
An always convergent method is used to calculate the spectral radius of an irreducible non-negative ...
An always convergent method is used to calculate the spectral radius of an irreducible non-negative ...
An always convergent method is used to calculate the spectral radius of an irreducible non-negative ...
An always convergent method is used to calculate the spectral radius of an irreducible non-negative ...
A comparison of methods for finding the spectral radius of a large sparse non-negative matrix. The A...
A comparison of methods for finding the spectral radius of a large sparse non-negative matrix. The A...
A comparison of methods for finding the spectral radius of a large sparse non-negative matrix. The A...
A comparison of methods for finding the spectral radius of a large sparse non-negative matrix. The A...
A comparison of methods for finding the spectral radius of a large sparse non-negative matrix. The A...
summary:Let $B$ be a non-negative irreducible $n\times n$ cyclic matrix of index 2, let $I$ be the u...
Elsner L. Inverse iteration for calculating the spectral radius of a non-negative irreducible matrix...
summary:We obtain a sharp upper bound for the spectral radius of a nonnegative matrix. This result i...
Abstract In this paper, we give some new sharp upper and lower bounds for the spectral radius of a n...
AbstractA class of methods for the computation of the Perron root and vector of a nonnegative irredu...
An always convergent method is used to calculate the spectral radius of an irreducible non-negative ...
An always convergent method is used to calculate the spectral radius of an irreducible non-negative ...
An always convergent method is used to calculate the spectral radius of an irreducible non-negative ...
An always convergent method is used to calculate the spectral radius of an irreducible non-negative ...
An always convergent method is used to calculate the spectral radius of an irreducible non-negative ...
A comparison of methods for finding the spectral radius of a large sparse non-negative matrix. The A...
A comparison of methods for finding the spectral radius of a large sparse non-negative matrix. The A...
A comparison of methods for finding the spectral radius of a large sparse non-negative matrix. The A...
A comparison of methods for finding the spectral radius of a large sparse non-negative matrix. The A...
A comparison of methods for finding the spectral radius of a large sparse non-negative matrix. The A...
summary:Let $B$ be a non-negative irreducible $n\times n$ cyclic matrix of index 2, let $I$ be the u...
Elsner L. Inverse iteration for calculating the spectral radius of a non-negative irreducible matrix...
summary:We obtain a sharp upper bound for the spectral radius of a nonnegative matrix. This result i...
Abstract In this paper, we give some new sharp upper and lower bounds for the spectral radius of a n...
AbstractA class of methods for the computation of the Perron root and vector of a nonnegative irredu...