We present two theoretical results for the linear response eigenvalue problem. The first result is a minimization principle for the sum of the smallest eigenvalues with the positive sign. The second result is Cauchy-like interlacing inequalities. Although the linear response eigenvalue problem is a nonsymmetric eigenvalue problem, these results mirror the well-known trace minimization principle...

We consider a new adaptive finite element (AFEM) algorithm for self-adjoint elliptic PDE eigenvalue problems. In contrast to other approaches we incorporate the inexact solutions of the resulting finite dimensional algebraic eigenvalue problems into the adaptation process. In this way we can balance the costs of the adaptive refinement of the mesh with the costs for the iterative eigenvalue met...

In this paper, we derive an asymptotic error expansion for the eigenvalue approximations by the lowest order Raviart-Thomas mixed finite element method for the general second order elliptic eigenvalue problems. Extrapolation based on such an expansion is applied to improve the accuracy of the eigenvalue approximations. Furthermore, we also prove the superclose property between the finite elemen...

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...