Extrapolation of Mixed Finite Element Approximations for the Maxwell Eigenvalue Problem

In this paper,a general method to derive asymptotic error expansion formulas for the mixed finite element approximations of the Maxwell eigenvalue problem is established.Abstract lemmas for the error of the eigenvalue approximations are obtained.Based on the asymptotic error expansion formulas,the Richardson extrapolation method is employed to improve the accuracy of the approximations for the eigenvalues of the Maxwell system from θ(h2) to θ(h4) when applying the lowest order Nédé1ec mixed finite element and a nonconforming mixed finite element.To our best knowledge,this is the first superconvergence result of the Maxwell eigenvalue problem by the extrapolation of the mixed finite element approximation.Numerical experiments are provided to demonstrate the theoretical results.     

每个忙期中第一个顾客被拒绝服务的M／M/1排队模型的其他特征值

研究每个忙期中第一个顾客被拒绝服务的M／M／1排队模型的主算子在左半复平面中的特征值,证明对一切θ∈（0,1）,（2√λμ-λ—μ）θ是该主算子的几何重数为1的特征值．     

M/M/1算子的其它特征值

证明对一切θ∈（0,1）,θ（2（λμ）~（1/2）-λ-μ）都是偏微分方程形式的M/M/1排队模型主算子的几何重数为1的特征值.     

对称循环M-矩阵的若干性质

研究实对称循环M-矩阵A的特征值范围、逆矩阵A<'-1>的存在性以及讨论了矩阵(A<'-1>)<'k>的极限性质和(A<'-1>)<'k>的||·||<,2>性质,最后给出了A<'-1>摄动定理.     

带形域内裂纹对SH波散射问题的边界元解

采用边界元法研究含裂纹的带形域各向同性弹性体，裂纹对SH波的散射问题，推导出带形域情况下不同边界条件的各种Green函数，导出了以裂纹张开位移为未知数的边界积分方程，计算出表面散射场和总位移．算例表明，利用所提供的格林函数和边界元格式解答带形域的散射问题比较方便．     

计算重根特征向量导数的消元法

本文提出了重根特征向量导数计算的消无法，它分为若干直接算法和一种迭代算法。这种方法概念简单、实施容易、精度良好。该方法可经简单移值用于非重根情况。     

GREEN＇S FUNCTIONS OF TWO－DIMENSIONAL ANISOTROPIC BODY WITH A PARABOLIC BOUNDARY

ＧＲＥＥＮ＇ＳＦＵＮＣＴＩＯＮＳＯＦＴＷＯ－ＤＩＭＥＮＳＩＯＮＡＬＡＮＩＳＯＴＲＯＰＩＣ ＢＯＤＹ ＷＩＴＨ Ａ ＰＡＲＡＢＯＬＩＣ ＢＯＵＮＤＡＲＹ（胡元太）（赵兴华）ＧＲＥＥＮ＇ＳＦＵＮＣＴＩＯＮＳＯＦＴＷＯ－ＤＩＭＥＮＳＩＯＮＡＬＡＮＩＳＯＴＲＯＰ?..     

A METHOD OF DETERMINING BUCKLED STATES OF THIN PLATES AT A DOUBLE EIGENVALUE

A method of determining bifurcation directions at a double eigenvalue is presented by combining the finite element method with the perturbation method. By using the present method, the buckled states of rectangular plates at a double eigenvalue are numerically analyzed. The results show that this method is effective.     

Implicit QR algorithms for palindromic and even eigenvalue problems

In the spirit of the Hamiltonian QR algorithm and other bidirectional chasing algorithms, a structure-preserving variant of the implicit QR algorithm for palindromic eigenvalue problems is proposed. This new palindromic QR algorithm is strongly backward stable and requires less operations than the standard QZ algorithm, but is restricted to matrix classes where a preliminary reduction to structured Hessenberg form can be performed. By an extension of the implicit Q theorem, the palindromic QR algorithm is shown to be equivalent to a previously developed explicit version. Also, the classical convergence theory for the QR algorithm can be extended to prove local quadratic convergence. We briefly demonstrate how even eigenvalue problems can be addressed by similar techniques. D. S. Watkins partly supported by Deutsche Forschungsgemeinschaft through Matheon, the DFG Research Center Mathematics for key technologies in Berlin.