一类混合图的结构及其特征空间

主要讨论具有如下性质的一类连通混合图G:其所有非奇异圈恰有一条公共边,且除了该公共边的端点外,任意两个非奇异圈没有其它交点.本文给出了图G的结构性质,建立了其最小特征值λ1(G)(以及相对应的特征向量)与某个简单图的代数连通度(以及Fiedler向量)之间联系,并应用上述联系证明了λ1(■)≤α(G),其中G是由G通过对其所有无向边定向而获得,α(■)为■的代数连通度.     

On spectral radii of matrices governing some numerical estimating algorithms with incomplete data

Summary Many estimating procedures are carried out with incomplete data by means of different types of EM algorithms. They allow us to obtain maximum likelihood parameter estimates in classical inference and also estimates based on the posterior mode in Bayesian inference. This paper analyzes in detail the spectral radii of the Jacobian matrices algorithm as a possible way to evaluate convergence rates. The eigenvalues of such matrices are explicitly obtained in some cases and, in all of them, a geometric convergence rate is, at least, guaranteed near the optimum. Finally, a comparison between the leading eigenvalues of EM and direct and approximate EM-Bayes algorithms may suggest the efficiency of each case.     

Eigenvalues of the antiplane-shear crack problem for a power-law material

This paper discusses the problem of finding the eigenvalue spectrum in determining the stress and strain fields at the tip of an antiplane-shear crack in a power-law material. It is shown that the perturbation method provides an analytical dependence of the eigenvalue on the material nonlinearity parameter and the eigenvalue of the linear problem. Thus, it is possible to find the entire spectrum of eigenvalues and not only the eigenvalue of the Hutchinson-Rice-Rosengren problem. __________ Translated from Prikladnaya Mekhanika i Tekhnicheskaya Fizika, Vol. 49, No. 1, pp. 173–180, January–February, 2008.     

Optimal Control for the Degenerate Elliptic Logistic Equation

We consider the optimal control of harvesting the diffusive degenerate elliptic logistic equation. Under certain assumptions, we prove the existence and uniqueness of an optimal control. Moreover, the optimality system and a characterization of the optimal control are also derived. The sub-supersolution method, the singular eigenvalue problem and differentiability with respect to the positive cone are the techniques used to obtain our results.     

Large deviations: An introduction to 2007 Abel prize

2007 Abel prize has been awarded to S R S Varadhan for creating a unified theory of large deviations. We attempt to give a flavour of this branch of probability theory, highlighting the role of Varadhan.     

板几何中具反射边界条件的迁移算子的谱分析

在Lp(1 p<∞)空间上研究了板几何中具反射边界条件下各向异性、连续能量、非均匀介质的迁移方程,证明了该迁移算子产生C0半群的Dyson-Phillips展开式的二阶余项在Lp(1相似文献   

A convergence analysis of the inexact Rayleigh quotient iteration and simplified Jacobi-Davidson method for the large Hermitian matrix eigenproblem

The inexact Rayleigh quotient iteration (RQI) is used for computing the smallest eigenpair of a large Hermitian matrix. Under certain condition, the method was proved to converge quadratically in literature. However, it is shown in this paper that under the original given condition the inexact RQI may not quadratically converge to the desired eigenpair and even may misconverge to some other undesired eigenpair. A new condition, called the uniform positiveness condition, is given that can fix misconvergence problem and ensure the quadratic convergence of the inexact RQI. An alternative to the inexact RQI is the Jacobi-Davidson (JD) method without subspace acceleration. A new proof of its linear convergence is presented and a sharper bound is established in the paper. All the results are verified and analyzed by numerical experiments. This work was supported by the National Natural Science Foundation of China (Grant Nos. 10471074, 10771116) and the Doctoral Program of the Ministry of Education of China (Grant No. 20060003003)     

图的无号Laplace矩阵的最大特征值

The signless Laplacian matrix of a graph is the sum of its diagonal matrix of vertex degrees and its adjacency matrix. Li and Feng gave some basic results on the largest eigenvalue and characteristic polynomial of adjacency matrix of a graph in 1979. In this paper, we translate these results into the signless Laplacian matrix of a graph and obtain the similar results.     

单圈图的最大特征值的上界的改进

Let G（V, E） be a unicyclic graph, Cm be a cycle of length m and Cm G, and ui ∈ V（Cm）. The G - E（Cm） are m trees, denoted by Ti, i = 1, 2,..., m. For i = 1, 2,..., m, let eui be the excentricity of ui in Ti and ec = max{eui ： i = 1, 2 , m}. Let κ = ec＋1. Forj = 1,2,...,k- 1, let δij = max{dv ： dist（v, ui） = j,v ∈ Ti}, δj = max{δij ： i = 1, 2,..., m}, δ0 = max{dui ： ui ∈ V（Cm）}. Then λ1（G）≤max{max 2≤j≤k-2 （√δj-1-1＋√δj-1）,2＋√δ0-2,√δ0-2＋√δ1-1}. If G ≌ Cn, then the equality holds, where λ1 （G） is the largest eigenvalue of the adjacency matrix of G.     

拟线性椭圆方程非零解

In this paper, the author has given an existence theorem for the resonant equa-tion,-△pu=λ1|u|p-2u+f(u)+h(x), without any Landesman-Lazer conditions on h(x).