The smoothing method for finding the largest eigenvalue of nonnegative matrices

MaRDI QIDQ2746283zbMATH OpenFDO

Authors Fengxiang Zhang

Publication date 10 October 2001

Published in Numerical Mathematics (Search for Journal in Brave)

zbMATH Keywords

convergenceeigenvectorlargest eigenvaluenonnegative matrixnumerical examplessmoothing method

Mathematics Subject Classification ID

Positive matrices and their generalizations; cones of matrices (15B48) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Review text

A new method for finding the largest eigenvalue and its corresponding eigenvector of a nonnegative matrix is proposed. The convergence of the method is proved. Several numerical examples are given to illustrate the results. This new method is good for computing the largest eigenvalue of a positive matrix. However, it seems to be complicated to approximate the corresponding eigenvector. By the way, the rate of convergence of this method needs to be studied.

Recommendations

• The block smoothing method for estimating the spectral radius of a nonnegative matrix
• Calculation of maximum eigenvalue of nonnegative matrix
• Finding the largest eigenvalue of a nonnegative tensor
• A method of calculating the spectral radius of a nonnegative matrix and its applications
• scientific article; zbMATH DE number 4037037

Cited in

(2)

• On the complexity of detecting positive eigenvectors of nonlinear cone maps
• Bounds for the greatest eigenvalue of positive tensors

This page was built for publication: The smoothing method for finding the largest eigenvalue of nonnegative matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2746283)