a graph is called textit{circulant} if it is a cayley graph on a cyclic group, i.e. its adjacency matrix is circulant. let $d$ be a set of positive, proper divisors of the integer $n>1$. the integral circulant graph $icg_{n}(d)$ has the vertex set $mathbb{z}_{n}$ and the edge set e$(icg_{n}(d))= {{a,b}; gcd(a-b,n)in d }$. let $n=p_{1}p_{2}cdots p_{k}m$, where $p_{1},p_{2},cdots,p_{k}$ are disti...

in this paper, at rst for a given set of real or complex numbers  with nonnegative summation, we introduce some special conditions that with them there is no nonnegative tridiagonal matrix in which  is its spectrum. in continue we present some conditions for existence such nonnegative tridiagonal matrices.

In this paper, an eigenvalue analysis of the SIMPLE preconditioning for incompressible ow is presented. Some formulations have been set up to characterize the spectrum of the preconditioned matrix. This leads to a generalized eigenvalue problem. The generalized eigenvalue problem is investigated. Some eigenvalue bounds and the estimation for the spectral condition number in the symmetric case a...

The Perron-Frobenius Theorem for irreducible higher order tensors does not guarantee simplicity of the unique positive eigenvalue nor does it guarantee the unique positive eigenvalue is strictly larger than the modulus of any other eigenvalue. Irreducibility of a tensor in relation to a graph is studied. A higher order tensor is essentially positive if it takes the positive cone to its interior...

The paper deals with eigenvalue estimates for block incomplete factorization methods for symmetric matrices. First, some previous results on upper bounds for the maximum eigenvalue of preconditioned matrices are generalized to each eigenvalue. Second, upper bounds for the maximum eigenvalue of the preconditioned matrix are further estimated, which presents a substantial improvement of earlier r...

We present an iterative method to compute the Maxwell’s transmission eigenvalue problem which has importance in non-destructive testing of anisotropic materials. The transmission eigenvalue problem is first written as a quad-curl eigenvalue problem. Then we show that the real transmission eigenvalues are the roots of a non-linear function whose value is the generalized eigenvalue of a related s...

Consider the linear general eigenvalue problem Ay = λBy , where A and B are both invertible and Hermitian N × N matrices. In this paper we construct a set of meromorphic functions, the Krein eigenvalues, whose zeros correspond to the real eigenvalues of the general eigenvalue problem. The Krein eigenvalues are generated by the Krein matrix, which is constructed through projections on the positi...

Support Vector Machine (SVM) is an effective model for many classification problems. However, SVM needs the solution of a quadratic program which require specialized code. In addition, SVM has many parameters, which affects the performance of SVM classi?er. Recently, the Generalized Eigenvalue Proximal SVM (GEPSVM) has been presented to solve the SVM complexity. In real world applications data ...

The mixing time of an ergodic, reversible Markov chain can be bounded in terms of the eigenvalues of the chain: specifically, the second-largest eigenvalue and the smallest eigenvalue. It has become standard to focus only on the secondlargest eigenvalue, by making the Markov chain “lazy”. (A lazy chain does nothing at each step with probability at least 1 2 , and has only nonnegative eigenvalue...

The cross-correlation matrix between equities comprises multiple interactions between traders with varying strategies and time horizons. In this paper, we use the Maximum Overlap Discrete Wavelet Transform (MODWT) to calculate correlation matrices over different time scales and then explore the eigenvalue spectrum over sliding time windows. The dynamics of the eigenvalue spectrum at different s...