
The authors obtain some upper and lower bounds for the largest and the smallest singular values of certain complex matrices based on the entries and diagonal dominance. A relationship between largest singular value of a block matrix and its block norm matrix is obtained. Numerical examples are given to demonstrate the usefulness of their results.
saddle point, numerical examples, Eigenvalues, singular values, and eigenvectors, Numerical solutions to overdetermined systems, pseudoinverses, Applied Mathematics, singular value, Inequalities involving eigenvalues and eigenvectors, block matrix, Computational Mathematics, Theory of matrix inversion and generalized inverses, diagonal dominance, Wielandt's lemma
saddle point, numerical examples, Eigenvalues, singular values, and eigenvectors, Numerical solutions to overdetermined systems, pseudoinverses, Applied Mathematics, singular value, Inequalities involving eigenvalues and eigenvectors, block matrix, Computational Mathematics, Theory of matrix inversion and generalized inverses, diagonal dominance, Wielandt's lemma
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 7 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
