The block smoothing method for estimating the spectral radius of a nonnegative matrix
DOI10.1016/J.AMC.2006.06.108zbMATH Open1119.65026OpenAlexW2021824559MaRDI QIDQ870159FDOQ870159
Authors: Zhi-Ming Yang 
Publication date: 12 March 2007
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2006.06.108
Recommendations
Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Positive matrices and their generalizations; cones of matrices (15B48)
Cites Work
Cited In (9)
- A half-quadratic block-coordinate descent method for spectral estimation.
- A note on estimates for the spectral radius of a nonnegative matrix
- The limited methed of estimating the spectral radius of nonnegative irreducible matrices
- An estimation of the spectral radius of a product of block matrices.
- The smoothing method for finding the largest eigenvalue of nonnegative matrices
- Block diagonally dominant positive definite approximate filters and smoothers
- Finding the spectral radius of a large sparse non-negative matrix
- Spectral radius of a nonnegative matrix: from rome to indy
- Title not available (Why is that?)
Uses Software
This page was built for publication: The block smoothing method for estimating the spectral radius of a nonnegative matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q870159)
