Results 51 to 60 of about 1,914,031 (237)

Some new bounds of the minimum eigenvalue for the Hadamard product of an M-matrix and an inverse M-matrix

open access: yesOpen 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

The second Yamabe invariant with singularities [PDF]

open access: yes, 2012
Let (M,g) be a compact manifold of dimension n greater or equals to 3. We suppose that g is a given metric in a precised Sobolev space and there is a point P in M and d>o such that g is smooth on the ball B(P,d).
Benalili, Mohammed, Boughazi, Hichem
core   +2 more sources

Cooperative Spectrum Sensing Algorithm Based on Double Eigenvalue Limiting Distribution

open access: yesDianxin kexue, 2014
A spectrum sensing algorithm using double eigenvalue limiting(DEL)distributions was presented. The difference between the maximum and the minimum eigenvalue was exploited as the test statistic.
Zhijin zhao, Weikang Hu, Haiquan Wang
doaj   +2 more sources

Some Bounds on Eigenvalues of the Hadamard Product and the Fan Product of Matrices

open access: yesMathematics, 2019
In this paper, an upper bound on the spectral radius ρ ( A ∘ B ) for the Hadamard product of two nonnegative matrices (A and B) and the minimum eigenvalue τ ( C ★ D ) of the Fan product of two M-matrices (C and D) are researched.
Qianping Guo   +3 more
doaj   +1 more source

Minimum higher eigenvalues of Laplacians on graphs

open access: yesDuke Mathematical Journal, 1996
If \(G\) is an undirected graph, let \(A\) be the adjacency matrix of \(G\), \(D\) be the diagonal matrix whose \((v,v)\) entry is the degree of \(v\), and \(\Delta=D-A\) be the Laplacian of \(G\). If \(G\) is a connected graph, it is known that the eigenvalues of \(\Delta\) satisfy the condition \(0 ...
openaire   +4 more sources

Machine Learning Methods for Inferring the Number of UAV Emitters via Massive MIMO Receive Array

open access: yesDrones, 2023
To provide important prior knowledge for the direction of arrival (DOA) estimation of UAV emitters in future wireless networks, we present a complete DOA preprocessing system for inferring the number of emitters via a massive multiple-input multiple ...
Yifan Li   +8 more
doaj   +1 more source

Analytical results for entanglement in the five-qubit anisotropic Heisenberg model

open access: yes, 2004
We solve the eigenvalue problem of the five-qubit anisotropic Heisenberg model, without use of Bethe's Ansatz, and give analytical results for entanglement and mixedness of two nearest-neighbor qubits.
Arnesen   +43 more
core   +1 more source

The domination number and the least $Q$-eigenvalue [PDF]

open access: yes, 2013
A vertex set $D$ of a graph $G$ is said to be a dominating set if every vertex of $V(G)\setminus D$ is adjacent to at least a vertex in $D$, and the domination number $\gamma(G)$ ($\gamma$, for short) is the minimum cardinality of all dominating sets of $
Guo, Shu-Guang   +3 more
core  

Cooperative Spectrum Sensing Using Eigenvalue Fusion for OFDMA and Other Wideband Signals

open access: yesJournal of Sensor and Actuator Networks, 2013
In this paper, we propose a new approach for the detection of OFDMA and other wideband signals in the context of centralized cooperative spectrum sensing for cognitive radio (CR) applications.
Dayan A. Guimarães   +2 more
doaj   +1 more source

Strongly Regular Graphs as Laplacian Extremal Graphs [PDF]

open access: yes, 2014
The Laplacian spread of a graph is the difference between the largest eigenvalue and the second-smallest eigenvalue of the Laplacian matrix of the graph.
Lin, Fan-Hsuan, Weng, Chih-wen
core  

Home - About - Disclaimer - Privacy