In this paper we study a non-homogeneous eigenvalue problem involving variable growth conditions and a sign-changing potential. We prove that any λ > 0 sufficiently small is an eigenvalue of the nonhomogeneous eigenvalue problem { −div(a(|∇u|)∇u) = λV(x)|u|q(x)−2u, in Ω, u = 0, on ∂Ω. The proofs of the main results are based on Ekeland’s variational principle.

We first develop an efficient spectral-Galerkin method and an rigorous error analysis for the generalized eigenvalue problems associated to a transmission eigenvalue problem. Then, we present an iterative scheme, based on computation of the first transmission eigenvalue, to estimate the index of refraction of an inhomogeneous medium. We present ample numerical results to demonstrate the effecti...

Ren-Cang Li University of Texas at Arlington 15.1 Eigenvalue Problems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15-1 15.2 Singular Value Problems . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15-6 15.3 Polar Decomposition . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15-7 15.4 Generalized Eigenvalue Problems . . . . . . . . . . . . . . . . . . . 15-...

2 Eigenvalues of graphs 5 2.1 Matrices associated with graphs . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 2.2 The largest eigenvalue . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 2.2.1 Adjacency matrix . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 2.2.2 Laplacian . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 2.2.3...

A reduction of the transmission eigenvalue problem for multiplicative sign-definite perturbations of elliptic operators with constant coefficients to an eigenvalue problem for a non-selfadjoint compact operator is given. Sufficient conditions for the existence of transmission eigenvalues and completeness of generalized eigenstates for the transmission eigenvalue problem are derived. In the trac...

The present paper deals with the spectrum of a fourth order nonlinear eigenvalue problem involving variable exponent conditions and a sign-changing potential. The main result of this paper establishes the existence of two positive constants λ0 and λ1 with λ0 ≤ λ1 such that every λ ∈ [λ1,+∞) is an eigenvalue, while λ ∈ (−∞, λ0) cannot be an eigenvalue of the above problem.

In this paper, we show that the covariance-eigenvalue approach converges much faster than using cumulative distribution function (CDF) for determining diversity gain from channel measurements in reverberation chamber. The covariance-eigenvalue approach can be used for arbitrary multi-port antennas, but it is limited to Maximum Ratio Combining (MRC). key words: MRC, diversity gain, eigenvalue, r...

In this paper we investigate the least eigenvalue of a graph whose complement is connected, and present a lower bound for the least eigenvalue of such graph. We also characterize the unique graph whose least eigenvalue attains the second minimum among all graphs of fixed order.

We study local bifurcation from an eigenvalue with multiplicity greater than one for a class of semilinear elliptic equations. In particular, we obtain the exact number of bifurcation branches of non trivial solutions at every eigenvalue of a square and at the second eigenvalue of a cube. We also compute the Morse index of the solutions in those branches.

This paper concerns with the sensitivity analysis for the multivariate eigenvalue problem (MEP). The concept of a simple multivariate eigenvalue of a matrix is generalized to the MEP and the first-order perturbation expansions of a simple multivariate eigenvalue and the corresponding multivariate eigenvector are presented. The explicit expressions of condition numbers, perturbation upper bounds...