Lower bounds for the rank and estimation for eigenvalues
Junliang Wu
Abstract
Junliang Wu
Abstract
Lower bounds for the rank and the estimation for eigenvalues of matrices are discussed.Two lower bounds for the rank and estimation for the real part and imaginary part of eigenvalues are obtained.Also,we prove that all the eigenvalues of any complex matrix are located in one disk.Some numerical examples show the effectiveness of our results.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Lower bounds for the rank and the estimation for eigenvalues of matrices are discussed.Two lower bounds for the rank and estimation for the real part and imaginary part of eigenvalues are obtained.Also,we prove that all the eigenvalues of any complex matrix are located in one disk.Some numerical examples show the effectiveness of our results.
Key concepts: Eigenvalues and eigenvectors, Rank (graph theory), Mathematics, Estimation, Matrix (chemical analysis), Combinatorics, Upper and lower bounds, Applied mathematics