Results 51 to 60 of about 244 (170)
On minimum algebraic connectivity of graphs whose complements are bicyclic
Open Mathematics, 2019 The second smallest eigenvalue of the Laplacian matrix of a graph (network) is called its algebraic connectivity which is used to diagnose Alzheimer’s disease, distinguish the group differences, measure the robustness, construct multiplex model ...
Liu Jia-Bao +3 more
doaj +1 more source
The non-negative spectrum of a digraph
Open Mathematics, 2020 Given the adjacency matrix A of a digraph, the eigenvalues of the matrix AAT constitute the so-called non-negative spectrum of this digraph. We investigate the relation between the structure of digraphs and their non-negative spectra and associated ...
Alomari Omar +2 more
doaj +1 more source
A convergence analysis of SOR iterative methods for linear systems with weak H-matrices
Open Mathematics, 2016 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
Bound for the largest singular value of nonnegative rectangular tensors
Open Mathematics, 2016 In this paper, we give a new bound for the largest singular value of nonnegative rectangular tensors when m = n, which is tighter than the bound provided by Yang and Yang in “Singular values of nonnegative rectangular tensors”, Front. Math.
He Jun +4 more
doaj +1 more source
Two new eigenvalue localization sets for tensors and theirs applications
Open Mathematics, 2017 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
INTERVAL ITERATIVE METHODS FOR COMPUTING MOORE-PENROSE INVERSE ∗
, 2008 In this paper, we import interval method to the iteration for computing Moore-Penrose inverse of the full row (or column) rank matrix. Through modifying the classical Newton iteration by interval method, we can get better numerical results.
Xian Zhang, Yimin Wei, Jianfeng Cai
core
Spectral Functions For Real Symmetric Toeplitz Matrices
, 1998 We derive separate spectral functions for the even and odd spectra of a real symmetric Toeplitz matrix, which are given by the roots of those functions. These are rational functions, also commonly referred to as secular functions.
Melman, A., A. Melman
core +1 more source
Potential counter-examples to a conjecture on the column space of the adjacency matrix
Special MatricesAttempts to resolve the Akbari-Cameron-Khosrovshahi-conjecture have so far focused on the rank of a matrix. The conjecture claims that there exists a nonzero (0, 1)-vector in the row space of a (0, 1)-adjacency matrix A{\bf{A}} of a graph GG, that is not
Sciriha Irene +3 more
doaj +1 more source
Some stable and closed-shell structures of anticancer drugs by graph theoretical parameters. [PDF]
Heliyon, 2023 Koam ANA +4 more
europepmc +1 more source