Results 251 to 260 of about 27,144 (290)
Some of the next articles are maybe not open access.
Fast algorithms for maximizing the minimum eigenvalue in fixed dimension
Operations Research LetterszbMATH Open Web Interface contents unavailable due to conflicting licenses.
Adam Brown, Aditi Laddha, Mohit Singh
exaly +2 more sources
Enhanced Maximum-Minimum Eigenvalue Based Spectrum Sensing
2019 International Conference on Information and Communication Technology Convergence (ICTC), 2019The maximum eigenvalue captures the signal correlation well, and the minimum eigenvalue also captures the noise characteristics well, thus the spectrum sensing algorithm based on the maximum and minimum eigenvalue gets better detection performance.
Sang-Jo Yoo, Minglu Jin, Wenjing Zhao
exaly +2 more sources
Bounds for the minimum eigenvalue of a symmetric Toeplitz matrix [PDF]
In a recent paper Melman [12] derived upper bounds for the smallest eigenvalue of a real symmetric Toeplitz matrix in terms of the smallest roots of rational and polynomial approximations of the secular equation $f(lambda)=0$, the best of which being constructed by the $(1,2)$-Pad{accent19 e} approximation of $f$. In this paper we prove that this bound
Voss, Heinrich
openaire +3 more sources
New bounds for the minimum eigenvalue of the fan product of two M-matrices [PDF]
summary:In this paper, we mainly use the properties of the minimum eigenvalue of the Fan product of $M$-matrices and Cauchy-Schwarz inequality, and propose some new bounds for the minimum eigenvalue of the Fan product of two $M$-matrices.
Guanghui Cheng
exaly +3 more sources
Pole assignment with minimum eigenvalue differential sensitivity [PDF]
Abstract This paper introduces a set of mathematical formulae for calculating the eigenvalue differential sensitivities of the closed-loop state matrix with respect to the open-loop state matrix, input matrix and state feedback matrix. It provides a computational procedure for a robust pole assignment problem.
Lam, J, Tam, HK
openaire +3 more sources
On the lower bounds for the minimum eigenvalue of the Hadamard product of an M-matrix and its inverse [PDF]
Recently, some authors have established a number of inequalities involving the minimum eigen-value for the Hadamard product of M-matrices. In this paper, we improve these results and give some new lower bounds on the minimum eigenvalue for the Hadamard ...
Dilek Varol, Mustafa Ozel
exaly +2 more sources
Minimum values of the second largest \(Q\)-eigenvalue
Discret. Appl. Math., 2022Graphs with small values of the second largest signless Laplacian eigenvalue \(q_2\) are considered in the article. Connected (simple) graphs on at least seven vertices satisfying \(q_2 \leq 3\) were completely characterised by \textit{M. Aouchiche} et al. [Linear Algebra Appl. 435, No. 10, 2591--2606 (2011; Zbl 1222.05146)]. Their result also involves,
Mustapha Aouchiche, Issmail El Hallaoui
openaire +4 more sources
1992
Abstract : For over one hundred years, the eigenvalue problem has been investigated by mathematicians, physicists, and engineers. Scientists explored the characterization, location, perturbation and computation of eigenvalues, to name a few topics. This thesis is devoted to the separation of eigenvalues. We will find the minimum gap between eigenvalues
Tzon-Tzer Lu, Beresford Parlett
openaire +1 more source
Abstract : For over one hundred years, the eigenvalue problem has been investigated by mathematicians, physicists, and engineers. Scientists explored the characterization, location, perturbation and computation of eigenvalues, to name a few topics. This thesis is devoted to the separation of eigenvalues. We will find the minimum gap between eigenvalues
Tzon-Tzer Lu, Beresford Parlett
openaire +1 more source
Maximum-Minimum Eigenvalue Detection for Cognitive Radio
2007 IEEE 18th International Symposium on Personal, Indoor and Mobile Radio Communications, 2007Sensing (signal detection) is a fundamental problem in cognitive radio. In this paper, a new method is proposed based on the eigenvalues of the covariance matrix of the received signal. It is shown that the ratio of the maximum eigenvalue to the minimum eigenvalue can be used to detect the signal existence.
Yonghong Zeng, Ying-Chang Liang
openaire +1 more source
Eigenvalues and parity factors in graphs with given minimum degree
Discrete Mathematics, 2023In this manuscript, the authors investigate sufficient conditions for a graph to have a \((g,f)\)-parity factor in terms of the minimum degree, edge-connectivity, and eigenvalues. \par For a graph \(G\) and non-negative integer-valued functions \(g\) and \(f\) on \(V(G)\), a \((g,f)\)-parity factor of \(G\) is a spanning subgraph \(H\) such that for ...
Donggyu Kim, Suil O
openaire +1 more source

