An improvement on a new upper bound for moduli of eigenvalues of iterative matrices

DOI10.1016/J.AMC.2005.04.028MaRDI QIDQ2489453zbMATH OpenOpenAlexFDO

Authors Hou-Biao Li, Ting-Zhu Huang, Hong Li

Publication date 28 April 2006

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2005.04.028

zbMATH Keywords

eigenvalue Geršgorin theorem Iteration matrix numerical examples spectral radius

Mathematics Subject Classification ID

Inequalities involving eigenvalues and eigenvectors (15A42) Iterative numerical methods for linear systems (65F10)

Review text

If \(M=(m_{ij})\) is a \(n\times n\) doubly diagonally dominant matrix, that is, \(| m_{ii}| | m_{jj}| >R_i(M)R_j(M)\) for all distinct \(i, j\), where \(R_i(M)=\sum_{j\not=i}| m_{ij}| \), one of the results shows that for any \(n\times n\) matrix \(N=(n_{ij})\), the eigenvalues of \(M^{-1}N\) are bounded by the maximum of \(\frac{B'+\sqrt{B'{^2-4AC'}}}{2A}\) for all distinct \(i, j\), where \(A=| m_{ii}m_{jj}| -R_i(M)R_j(M)\), \(B'=| m_{ii}n_{jj}+n_{ii}m_{jj}| +R_i(M)R_j(N)+R_i(N)R_j(M)\), and \(C'=-[| n_{ii}n_{jj}| +R_i(N)R_j(N)]\). The proof depends on the Geršgorin theorem. Numerical examples are given to show that the new bound improves earlier results of similar type.

Recommendations

Cites work

Cited in

(8)

This page was built for publication: An improvement on a new upper bound for moduli of eigenvalues of iterative matrices

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