Results 11 to 20 of about 375 (52)
New bounds for the minimum eigenvalue of M-matrices
Some new bounds for the minimum eigenvalue of M-matrices are obtained. These inequalities improve existing results, and the estimating formulas are easier to calculate since they only depend on the entries of matrices.
Wang Feng, Sun Deshu
doaj +1 more source
More eigenvalue problems of Nordhaus-Gaddum type [PDF]
Let $G$ be a graph of order $n$ and let $\mu_{1}\left(G\right) \geq \cdots\geq\mu_{n}\left(G\right) $ be the eigenvalues of its adjacency matrix. This note studies eigenvalue problems of Nordhaus-Gaddum type.
Nikiforov, Vladimir, Yuan, Xiying
core +1 more source
An S-type upper bound for the largest singular value of nonnegative rectangular tensors
An S-type upper bound for the largest singular value of a nonnegative rectangular tensor is given by breaking N = {1, 2, … n} into disjoint subsets S and its complement. It is shown that the new upper bound is smaller than that provided by Yang and Yang (
Zhao Jianxing, Sang Caili
doaj +1 more source
New bounds for the minimum eigenvalue of 𝓜-tensors
A new lower bound and a new upper bound for the minimum eigenvalue of an 𝓜-tensor are obtained. It is proved that the new lower and upper bounds improve the corresponding bounds provided by He and Huang (J. Inequal.
Zhao Jianxing, Sang Caili
doaj +1 more source
THE HYPERBOLIC QUADRATIC EIGENVALUE PROBLEM
The hyperbolic quadratic eigenvalue problem (HQEP) was shown to admit Courant–Fischer type min–max principles in 1955 by Duffin and Cauchy type interlacing inequalities in 2010 by Veselić.
XIN LIANG, REN-CANG LI
doaj +1 more source
A convergence analysis of SOR iterative methods for linear systems with weak H-matrices
It is well known that SOR iterative methods are convergent for linear systems, whose coefficient matrices are strictly or irreducibly diagonally dominant matrices and strong H-matrices (whose comparison matrices are nonsingular M-matrices).
Zhang Cheng-yi +2 more
doaj +1 more source
The Laplacian Eigenvalues and Invariants of Graphs
In this paper, we investigate some relations between the invariants (including vertex and edge connectivity and forwarding indices) of a graph and its Laplacian eigenvalues.
Pan, Rong-Ying +2 more
core +1 more source
Two new eigenvalue localization sets for tensors and theirs applications
A new eigenvalue localization set for tensors is given and proved to be tighter than those presented by Qi (J. Symbolic Comput., 2005, 40, 1302-1324) and Li et al. (Numer. Linear Algebra Appl., 2014, 21, 39-50).
Zhao Jianxing, Sang Caili
doaj +1 more source
Changes in signature induced by the Lyapunov mapping LA : X → AX + XAA±
International Journal of Mathematics and Mathematical Sciences, Volume 12, Issue 3, Page 503-506, 1989.
Tyler Haynes
wiley +1 more source
Linear combinations of graph eigenvalues
Let F(G) be a fixed linear combination of the k extremal eigenvalues of a graph G and of its complement. The problem of finding max{F(G):v(G)=n} generalizes a number of problems raised previously in the literature. We show that the limit max{F(G):v(G)=n}/
Nikiforov, Vladimir
core +1 more source

