Generalized and quadratic eigenvalue problems with hermitian matrices. [PDF]
Eigenvalue and eigenvector computations are extremely important and have various applications in engineering, physics and other scientific disciplines.
Farah, Ali Mohamud
core +7 more sources
Eigenvalue enclosures and exclosures for non-self-adjoint problems in hydrodynamics [PDF]
In this paper we present computer-assisted proofs of a number of results in theoretical fluid dynamics and in quantum mechanics. An algorithm based on interval arithmetic yields provably correct eigenvalue enclosures and exclosures for non-self-adjoint ...
Langer, M. +10 more
core +3 more sources
A lower bound sequence for the minimum eigenvalue of Hadamard product of an $M$-matrix and its inverse [PDF]
summary:We propose a lower bound sequence for the minimum eigenvalue of Hadamard product of an $M$-matrix and its inverse, in terms of an $S$-type eigenvalues inclusion set and inequality scaling techniques. In addition, it is proved that the lower bound
Liu, Jianzhou, Zeng, Wenlong
core +1 more source
The dual eigenvalue problems of the conformable fractional Sturm–Liouville problems
In this paper, we are concerned with the eigenvalue gap and eigenvalue ratio of the Dirichlet conformable fractional Sturm–Liouville problems. We show that this kind of differential equation satisfies the Sturm–Liouville property by the Prüfer ...
Yan-Hsiou Cheng
doaj +1 more source
Minimum eigenvalue of the complement of tricyclic graphs with n-4 pendent vertexes
In order to discuss the minimum eigenvalue of adjacency matrix in the class of complementary graphs of the tricyclic graph with a given order of n and n-4 pendent vertexes, the unique graph whose minimum eigenvalue reaches the minimum is characterized ...
Hongjuan JU, Yingjie LEI
doaj +1 more source
On the Neumann eigenvalues for second-order Sturm–Liouville difference equations
The paper is concerned with the Neumann eigenvalues for second-order Sturm–Liouville difference equations. By analyzing the new discriminant function, we show the interlacing properties between the periodic, antiperiodic, and Neumann eigenvalues ...
Yan-Hsiou Cheng
doaj +1 more source
On the second minimizing graph in the set of complements of trees
Let G be a graph of order n and A(G)=[ai,j]be its adjacency matrix such that ai,j=1 if viis adjacent to vjand ai,j=0 otherwise, where 1≤i,j≤n. In a certain family of graphs, a graph is called minimizing (or second minimizing) if the least eigenvalue of ...
M. Javaid
doaj +2 more sources
An eigenvalue localization set for tensors and its applications
A new eigenvalue localization set for tensors is given and proved to be tighter than those presented by Li et al. (Linear Algebra Appl. 481:36-53, 2015) and Huang et al. (J. Inequal. Appl. 2016:254, 2016).
Jianxing Zhao, Caili Sang
doaj +1 more source
HUBO formulations for solving the eigenvalue problem
Solving the eigenvalue problem is particularly important in almost all fields of science and engineering. With the development of quantum computers, multiple algorithms have been proposed for this purpose.
Kyungtaek Jun, Hyunju Lee
doaj +1 more source
Bounds on the Minimum Edge Dominating Energy in Terms of Some Parameters of a Graph [PDF]
The minimum edge dominating energy, denoted by $EE_{F}(G)$, is the sum of the absolute values of eigenvalues of the minimum edge dominating matrix of graph $G$.
Fateme Movahedi
doaj +1 more source

