Results 71 to 80 of about 26,944 (191)

Preconditioned Lanczos Methods for the Minimum Eigenvalue of a Symmetric Positive Definite Toeplitz Matrix [PDF]

, 2000
In this paper, we apply the preconditioned Lanczos (PL) method to compute the minimum eigenvalue of a symmetric positive definite Toeplitz matrix. The sine transform-based preconditioner is used to speed up the convergence rate of the PL method.
Michael K. Ng, Ng, KP
core   +1 more source

Optimal decision threshold for eigenvalue-based spectrum sensing techniques

, 2014
This paper investigates optimization of the sensing threshold that minimizes the total error rate (i.e., the sum of the probabilities of false alarm and missed detection) of eigenvalue-based spectrum sensing techniques for multiple-antenna cognitive ...
Yousif, Ebtihal H G, He, Yibo, Xue, Jiang, Ebtihal H. G. Yousif, Jiang Xue, Sellathurai, Mathini; id_orcid, Tharmalingam Ratnarajah, Mathini Sellathurai, Ratnarajah, Tharmalingam, Yibo He   +9 more
core   +1 more source

Performance of Cooperative Eigenvalue Spectrum Sensing with a Realistic Receiver Model under Impulsive Noise

Journal of Sensor and Actuator Networks, 2013
In this paper we present a unified comparison of the performance of four detection techniques for centralized data-fusion cooperative spectrum sensing in cognitive radio networks under impulsive noise, namely, the eigenvalue-based generalized likelihood ...
Dayan A. Guimarães, André N. Barreto, Rausley A. A. de Souza   +2 more
doaj   +1 more source

Some inequalities for the Fan product of M-tensors

Journal of Inequalities and Applications, 2018
In this paper, we investigate some inequalities for the Fan product of M-tensors. We propose exact characterizations of M-tensors and establish some inequalities on the minimum eigenvalue for the Fan product of two M-tensors.
Gang Wang, Yanan Wang, Yuan Zhang
doaj   +1 more source

The Least Eigenvalue of the Graphs Whose Complements Are Connected and Have Pendent Paths

, 2018
The adjacency matrix of a graph is a matrix which represents adjacent relation between the vertices of the graph. Its minimum eigenvalue is defined as the least eigenvalue of the graph.
Cao, J., Yu, G., Jinde Cao, Wang, C., Wei Sun, Sun, W., Guidong Yu, Chen Wang   +7 more
core   +1 more source

Note on the product of the largest and the smallest eigenvalue of a graph

Special Matrices
In this note, we use eigenvalue interlacing to derive an inequality between a graph’s maximum degree and its maximum and minimum adjacency eigenvalues. The equality case is fully characterized.
Abiad Aida, Dalfó Cristina, Fiol Miquel Àngel   +2 more
doaj   +1 more source

Lower bounds of the minimum eigenvalue for $M$-matrices

, 2017
Some monotone increasing sequences of the lower bounds for the minimum eigenvalue of $M$-matrices are given. It is proved that these sequences are convergent and improve some existing results. Numerical examples show that these sequences are more accurate than some existing results and could reach the true value of the minimum eigenvalue in some cases.
Zhao, Jianxing, Sang, Caili
openaire   +2 more sources

On the lower bounds for the minimum eigenvalue of the Hadamard product of an M-matrix and its inverse M-matrix

, 2012
: In this study, for the minimum eigenvalue 1()AAτ− of the Hadamard product 1AA− of an M-matrix A and its inverse1A− are considered. Some new lower bounds on 1()AAτ− for the Hadamard product of A and 1A− are derived.
Özel, Mustafa
core  

On the eigenvalue-based spectrum sensing and secondary user throughput

, 2014
In this paper, we study the tradeoff between sensing time and achievable throughput of the secondary user that employs robust eigenvalue-based spectrum sensing techniques in the presence of noise uncertainty.
Sellathurai, Mathini; id_orcid, Kortun, Ayse, Zeng, Yonghong, Liang, Ying Chang, Ratnarajah, Tharmalingam   +4 more
core   +1 more source