Small eigenvalues of large Hermitian moment matrices

We consider an infinite Hermitian positive definite matrix M which is the moment matrix associated with a measure μ with infinite and compact support on the complex plane. We prove that if the polynomials are dense in L²(μ) then the smallest eigenvalue λn of the truncated matrix Mn of M of size (n+1)×(n+1) tends to zero when n tends to infinity. In the case of measures in the closed unit disk we obtain some related results.     

Spectral characterization of graphs whose second largest eigenvalue is less than 1

Graphs with second largest eigenvalue λ₂?1 are extensively studied, however, whether they are determined by their adjacency spectra or not is less considered. In this paper we completely characterize all the connected bipartite graphs with λ₂<1 that are determined by their adjacency spectra. In addition, we prove that all the connected non-bipartite graphs with girth no less than 4 and λ₂<1 are determined by their adjacency spectra.     

Perturbation, extraction and refinement of invariant pairs for matrix polynomials

Generalizing the notion of an eigenvector, invariant subspaces are frequently used in the context of linear eigenvalue problems, leading to conceptually elegant and numerically stable formulations in applications that require the computation of several eigenvalues and/or eigenvectors. Similar benefits can be expected for polynomial eigenvalue problems, for which the concept of an invariant subspace needs to be replaced by the concept of an invariant pair. Little has been known so far about numerical aspects of such invariant pairs. The aim of this paper is to fill this gap. The behavior of invariant pairs under perturbations of the matrix polynomial is studied and a first-order perturbation expansion is given. From a computational point of view, we investigate how to best extract invariant pairs from a linearization of the matrix polynomial. Moreover, we describe efficient refinement procedures directly based on the polynomial formulation. Numerical experiments with matrix polynomials from a number of applications demonstrate the effectiveness of our extraction and refinement procedures.     

On the extremal values of the second largest Q-eigenvalue

We study extremal graphs for the extremal values of the second largest Q-eigenvalue of a connected graph. We first characterize all simple connected graphs with second largest signless Laplacian eigenvalue at most 3. The second part of the present paper is devoted to the study of the graphs that maximize the second largest Q-eigenvalue. We construct families of such graphs and prove that some of theses families are minimal for the fact that they maximize the second largest signless Laplacian eigenvalue.     

Postprocessing and higher order convergence for the mixed finite element approximations of the eigenvalue problem

In this paper, we propose a method to improve the convergence rate of the lowest order Raviart-Thomas mixed finite element approximations for the second order elliptic eigenvalue problem. Here, we prove a supercloseness result for the eigenfunction approximations and use a type of finite element postprocessing operator to construct an auxiliary source problem. Then solving the auxiliary additional source problem on an augmented mixed finite element space constructed by refining the mesh or by using the same mesh but increasing the order of corresponding mixed finite element space, we can increase the convergence order of the eigenpair approximation. This postprocessing method costs less computation than solving the eigenvalue problem on the finer mesh directly. Some numerical results are used to confirm the theoretical analysis.     

ESTIMATES ON EIGENVALUES FOR THE BIHARMONIC OPERATOR ON A BOUNDED DOMAIN IN H~n（-1）

In this paper, we consider eigenvalues of the Dirichlet biharmonic operator on a bounded domain in a hyperbolic space. We obtain universal bounds on the (k + 1)th eigenvalue in terms of the first kth eigenvalues independent of the domains.     

混合气体线性化Boltzmann算子的特征值与特征函数

考虑了混合气体线性化Boltzmann算子的特征值与特征函数问题.通过对算子中核函数的分析得出了更一般的混合气体线性化Boltzmann算子的特征值与特征函数.而且结论还适用于单一气体情况.     

Improved modal truncation method for eigensensitivity analysis of asymmetric matrix with repeated eigenvalues

An improved modal truncation method with arbitrarily high order accuracy is developed for calculating the second- and third-order eigenvalue derivatives and the first- and second-order eigenvector derivatives of an asymmetric and non-defective matrix with repeated eigenvalues. If the different eigenvalues λ1, λ2,, λrof the matrix satisfy |λ1| |λr| and |λs| |λs+1|(s r-1), then associated with any eigenvalue λi(i s), the errors of the eigenvalue and eigenvector derivatives obtained by the qth-order approximate method are proportional to |λi/λs+1|q+1, where the approximate method only uses the eigenpairs corresponding to λ1, λ2,, λs. A numerical example shows the validity of the approximate method. The numerical example also shows that in order to get the approximate solutions with the same order accuracy, a higher order method should be used for higher order eigenvalue and eigenvector derivatives.