具有可选服务的M／M／1排队模型的一个特征值及其应用

证明0是具有可选服务的M／M／1排队模型的主算子及其共轭算子的几何重数为1的特征值,由此推出该模型的时间依赖解强收敛于该模型的稳态解．     

带特殊重试时间的M／M／1重试排队模型的另一个特征值

研究对应于带特殊重试时间的M／M／1重试排队模型主算子在左半复平面的谱,证明-（2λ＋α＋β＋√（α＋β）^2＋4λβ/4是该主算子的几何重数为1的特征值．     

一类正则Sturm—Liouville问题特征的渐近分析

考虑[0,π]上一类带一般分离型边界条件的正则Sturm—Liouville问题特征的渐近表示,利用Frechet导数,对特征值进行精细的分析,清楚地给出了方程系数q（x）及边界条件中常数cot α,col β对特征值的影响．使结论更具一般化．     

Subspace methods for three‐parameter eigenvalue problems

We propose subspace methods for three‐parameter eigenvalue problems. Such problems arise when separation of variables is applied to separable boundary value problems; a particular example is the Helmholtz equation in ellipsoidal and paraboloidal coordinates. While several subspace methods for two‐parameter eigenvalue problems exist, their extensions to a three‐parameter setting seem challenging. An inherent difficulty is that, while for two‐parameter eigenvalue problems, we can exploit a relation to Sylvester equations to obtain a fast Arnoldi‐type method, such a relation does not seem to exist when there are three or more parameters. Instead, we introduce a subspace iteration method with projections onto generalized Krylov subspaces that are constructed from scratch at every iteration using certain Ritz vectors as the initial vectors. Another possibility is a Jacobi–Davidson‐type method for three or more parameters, which we generalize from its two‐parameter counterpart. For both approaches, we introduce a selection criterion for deflation that is based on the angles between left and right eigenvectors. The Jacobi–Davidson approach is devised to locate eigenvalues close to a prescribed target; yet, it often also performs well when eigenvalues are sought based on the proximity of one of the components to a prescribed target. The subspace iteration method is devised specifically for the latter task. The proposed approaches are suitable especially for problems where the computation of several eigenvalues is required with high accuracy. MATLAB implementations of both methods have been made available in the package MultiParEig (see http://www.mathworks.com/matlabcentral/fileexchange/47844-multipareig ).     

Global eigenvalue distribution regime of random matrices with an anharmonic potential and an external source

We consider ensembles of random Hermitian matrices with a distribution measure determined by a polynomial potential perturbed by an external source. We find the genus-zero algebraic function describing the limit mean density of eigenvalues in the case of an anharmonic potential and a diagonal external source with two symmetric eigenvalues. We discuss critical regimes where the density support changes the connectivity or increases the genus of the algebraic function and consequently obtain local universal asymptotic representations for the density at interior and boundary points of its support (in the generic cases). The investigation technique is based on an analysis of the asymptotic properties of multiple orthogonal polynomials, equilibrium problems for vector potentials with interaction matrices and external fields, and the matrix Riemann-Hilbert boundary value problem. __________ Translated from Teoreticheskaya i Matematicheskaya Fizika, Vol. 159, No. 1, pp. 34–57, April, 2009.     

On preconditioned eigensolvers and Invert-Lanczos processes

This paper deals with the convergence analysis of various preconditioned iterations to compute the smallest eigenvalue of a discretized self-adjoint and elliptic partial differential operator. For these eigenproblems several preconditioned iterative solvers are known, but unfortunately, the convergence theory for some of these solvers is not very well understood.The aim is to show that preconditioned eigensolvers (like the preconditioned steepest descent iteration (PSD) and the locally optimal preconditioned conjugate gradient method (LOPCG)) can be interpreted as truncated approximate Krylov subspace iterations. In the limit of preconditioning with the exact inverse of the system matrix (such preconditioning can be approximated by multiple steps of a preconditioned linear solver) the iterations behave like Invert-Lanczos processes for which convergence estimates are derived.     

Lyapunov‐type inequalities for a class of fractional boundary value problems with integral boundary conditions

In this paper, Lyapunov‐type inequalities are derived for a class of fractional boundary value problems with integral boundary conditions. As an application, we obtain a lower bound for the eigenvalues of corresponding equations.     

类Hartree-Fock方程的数值方法

本文的主要目的是介绍近年来大基组下的类Hartree-Fock方程数值求解的一些进展.类Hartree-Fock方程出现在Hartree-Fock理论和含杂化泛函的Kohn-Sham密度泛函理论中,是电子结构理论中一类重要的方程.该方程在复杂的化学和材料体系的电子结构计算中有广泛地应用.由于计算代价的原因,类Hartree-Fock方程一般只被用在较小规模的量子体系（含几十到几百个电子）的计算.从数学角度上讲,类Hartree-Fock方程是一个非线性积分-微分方程组,其计算代价主要来自于积分算子的部分,也就是Fock交换算子.通过发展和结合自适应压缩交换算子方法（ACE）,投影的C-DⅡS方法（PC-DⅡS）方法,以及插值可分密度近似方法（ISDF）,我们大大降低了杂化泛函密度泛函理论的计算代价.以含1000个硅原子的体系为例,我们将平面波基组下的杂化泛函的计算代价降至接近不含Fock交换算子的半局域泛函计算的水平.同时,我们发现类Hartree-Fock方程的数学结构也为一类特征值问题的迭代求解提供了新的思路.     

Some mathematical aspects of Anderson localization: boundary effect,multimodality, and bifurcation

Anderson localization is a famous wave phenomenon that describes the absence of diffusion of waves in a disordered medium. Here we generalize the landscape theory of Anderson localization to general elliptic operators and complex boundary conditions using a probabilistic approach, and further investigate some mathematical aspects of Anderson localization that are rarely discussed before. First, we observe that under the Neumann boundary condition, the low energy quantum states are localized on the boundary of the domain with high probability. We provide a detailed explanation of this phenomenon using the concept of extended subregions and obtain an analytical expression of this probability in the one-dimensional case. Second, we find that the quantum states may be localized in multiple different subregions with high probability in the one-dimensional case and we derive an explicit expression of this probability for various boundary conditions. Finally, we examine a bifurcation phenomenon of the localization subregion as the strength of disorder varies. The critical threshold of bifurcation is analytically computed based on a toy model and the dependence of the critical threshold on model parameters is analyzed.