Results 71 to 80 of about 1,914,031 (237)
Inequalities for the Minimum Eigenvalue of Doubly Strictly Diagonally Dominant M-Matrices
Journal of Applied Mathematics, 2014 Let A be a doubly strictly diagonally dominant M-matrix. Inequalities on upper and lower bounds for the entries of the inverse of A are given. And some new inequalities on the lower bound for the minimal eigenvalue of A and the corresponding eigenvector ...
Ming Xu, Suhua Li, Chaoqian Li
doaj +1 more source
Frequency and power estimation of sinusoids using eigen-approach [PDF]
MATEC Web of Conferences, 2019 Frequency and power estimation of sinusoidal signals, has captured the attention of researchers due to its important applications. This paper involves a frequency and power estimation method of unidentified number of source sinusoidal signals using Eigen
Mismar M.J., Elissa F.B.
doaj +1 more source
On the Maximum and Minimum of Some Functionals for the Eigenvalue Problem of Sturm-Liouville Type
Journal of Differential Equations, 1994 One considers the eigenvalues \(\lambda_ n= \lambda_ n(q)\) of the Sturm-Liouville equation \(y''+ (\lambda- q(x))y= 0\), with the boundary conditions \(y(-\ell)= y(\ell)=0\). Let \(E(h,H,M,\ell)\) be the set of potential functions \(q\) such that \(h\leq q(x)\leq H\), \(\int^ \ell_ \ell q(x)dx= M\). One determines the potential functions in \(E(h,H,M,\
Hua‐Huai Chern, Chengcai Shen
openalex +4 more sources
, 2013 Let A and B be nonsingular M-matrices. Several new bounds on the minimum eigenvalue for the Hadamard product of B and the inverse matrix of A are given. These bounds can improve considerably some previous results.MSC:15A42, 15B34.
Yaotang Li +3 more
semanticscholar +1 more source
On the second minimum algebraic connectivity of the graphs whose complements are trees
AKCE International Journal of Graphs and Combinatorics, 2017 For a graph the algebraic connectivity denoted by , is the second smallest eigenvalue of the Laplacian matrix of . In Jiang et al. (2015), proved a unique graph with first minimum algebraic connectivity among the graphs which belong to a class of graphs ...
M. Javaid, Masood Ur Rehman
doaj +1 more source
Improving the condition number of estimated covariance matrices
Tellus: Series A, Dynamic Meteorology and Oceanography, 2020 High dimensional error covariance matrices and their inverses are used to weight the contribution of observation and background information in data assimilation procedures.
Jemima M. Tabeart +4 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
Journal of Inequalities and Applications, 2017 In this paper, we determine the unique graph whose least signless Laplacian eigenvalue attains the minimum among all non-bipartite unicyclic graphs of order n with maximum degree Δ and among all non-bipartite connected graphs of order n with maximum ...
Shu-Guang Guo, Rong Zhang
doaj +1 more source
The minimum number of multiplicity 1 eigenvalues among real symmetric matrices whose graph is a nonlinear tree [PDF]
, 2021 Wenxuan Ding, Charles R. Johnson
openalex +1 more source
Bound on the Minimum Eigenvalue of -Matrices Involving Hadamard Products
, 2013 We present a new lower bound on the minimum eigenvalue of -matrices involving Hadamard products , and we show that our lower bound is larger than the lower bound . Three examples verify our result.
K. Du, Guiding Gu, Guo Liu
semanticscholar +1 more source