Dirichlet eigenvalue problems of irreversible Langevin diffusion
, 2021 International audienceThe basic objective of this research work is to investigate the asymptotic behavior of the first eigenvalue of an irreversible Langevin diffusion with zero boundary values.
Damak, Mondher +2 more
core +1 more source
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
Dynamic Channelized Subband Detection Algorithm Based on Double Characteristic Ratio [PDF]
Hangkong bingqiIn the dynamic digital channelized reception architecture， subband detection provides positional information to the synthesis filter bank for signal reconstruction.
Cao Ruilong, Si Weijian, Han Shunli, Zhou You
doaj +1 more source
An innovative algorithm for estimating the minimum eigenvalue of M-matrices
Journal of Inequalities and ApplicationsFor a general M-matrix, we construct a specialized matrix to derive monotonically increasing lower bounds and monotonically decreasing upper bounds for its minimum eigenvalue.
Qin Zhong, Ling Li, Gufang Mou
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
Minimum higher eigenvalues of Laplacians on graphs
Duke 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 +3 more sources
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
Computation of the minimum eigenvalue for a nonlinear Sturm-Liouville problem
, 2020 © 2014, Pleiades Publishing, Ltd. A condition for the existence of a minimum eigenvalue corresponding to a positive eigenfunction of the nonlinear eigenvalue problem for an ordinary differential equation is determined.
Solov’ev S. +3 more
core
On the Maximum and Minimum of Some Functionals for the Eigenvalue Problem of Sturm-Liouville Type
, 1994 Let λn(q) be the nth eigenvalue of the Sturm-Liouville equation y′′+(λ−q(x))y=0, y(−l/2) = y(l/2) = 0. With certain restrictions on the class of functions q we determine the shapes of the solutions of the extremal problems for the functionals λn(q) and ...
Chern, H.H., Shen, C.L.
core +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