Results 41 to 50 of about 244 (170)
A Geršgorin-type eigenvalue localization set with n parameters for stochastic matrices
Open Mathematics, 2018 A set in the complex plane which involves n parameters in [0, 1] is given to localize all eigenvalues different from 1 for stochastic matrices. As an application of this set, an upper bound for the moduli of the subdominant eigenvalues of a stochastic ...
Wang Xiaoxiao, Li Chaoqian, Li Yaotang
doaj +1 more source
Error bounds in the isometric Arnoldi process
, 1997 Error bounds for the eigenvalues computed in the isometric Arnoldi method are derived. The Arnoldi method applied to a unitary matrix U successively computes a sequence of unitary upper Hessenberg matrices Hk ; k = 1; 2; : : :. The eigenvalues of the Hk
H. Faßbender +3 more
core +1 more source
Open Mathematics, 2016 Some convergent sequences of the lower bounds of the minimum eigenvalue for the Hadamard product of a nonsingular M-matrix B and the inverse of a nonsingular M-matrix A are given by using Brauer’s theorem.
Zhao Jianxing, Sang Caili
doaj +1 more source
On nested block designs geometry
Orthogonal designs, Orthogonal block structure, General balance, Commutativity of projectors, Commutative quadratic subspace, Primary 62J05, Secondary 05A15, 15A18,
Radosław Kala
core +1 more source
Special Matrices, 2017 We take as given a real symmetric matrix A, whose graph is a tree T, and the eigenvalues of A, with their multiplicities. Each edge of T may then be classified in one of four categories, based upon the change in multiplicity of a particular eigenvalue ...
Toyonaga Kenji, Johnson Charles R.
doaj +1 more source
Hardness Results and Spectral Techniques for Combinatorial Problems on Circulant Graphs
, 1998 We show that computing (and even approximating) MAXIMUM CLIQUE and MINIMUM GRAPH COLORING for circulant graphs is essentially as hard as in the general case.
Ivan Gerace +8 more
core +1 more source
Fractional Revival of Threshold Graphs Under Laplacian Dynamics
Discussiones Mathematicae Graph Theory, 2020 We consider Laplacian fractional revival between two vertices of a graph X. Assume that it occurs at time τ between vertices 1 and 2. We prove that for the spectral decomposition L=∑r=0qθrErL = \sum\nolimits_{r = 0}^q {{\theta _r}{E_r}} of the Laplacian
Kirkland Steve, Zhang Xiaohong
doaj +1 more source
Existence Results for a Class of Semilinear Elliptic Systems
, 2020 . In this paper, we study the existence of nontrivial solutions for the problem where Ω is bounded domain in R N and h 1 ,h 2 ∈ L 2 (Ω). The existence result is obtained by using the Leray-Schauder degree under the following condition on the ...
Moussaoui Abdelkrim, Khodja Brahim
core
Row stochastic inverse eigenvalue problem
, 2011 In this paper, we give sufficient conditions or realizability criteria for the existence of a row stochastic matrix with a given spectrum Λ = {λ1, ..., λn} = Λ1 ∪ ⋯ ∪ Λm ∪ Λm+1, m > 0; where (pk ...
Chang-qing Xu +3 more
core +1 more source
Achievable multiplicity partitions in the inverse eigenvalue problem of a graph
Special Matrices, 2019 Associated to a graph G is a set 𝒮(G) of all real-valued symmetric matrices whose off-diagonal entries are nonzero precisely when the corresponding vertices of the graph are adjacent, and the diagonal entries are free to be chosen.
Adm Mohammad +5 more
doaj +1 more source