用有限元方法求解界面特征值问题

用有限元方法计算椭圆型界面特征值问题,实验数据显示近似特征值的变化规律:界面特征值问题中系数的间断性对协调和非协调Crouzeix-Raviart有限元特征值的收敛性并无影响,而且对协调有限元特征值外推以后得到高精度的解,相应的外推值还提供特征值下界;Crouzeix-Raviart元特征值提供特征值下界,这对一般有界区域如"镂空"型区域也成立.另外,还展示近似特征函数的图形.     

任意维空间Stokes算子特征值的确切下界

本文研究Stokes算子特征值的确切下界.主要思想有二:其一是在散度算子的核空间中,该算子是正定的;其二是扩充非协调旋转Q_1元标准的插值算子有可交换和质量守恒性质,因此可以证明插值误差常数及相应的后处理常数可以显式表示出来且与空间维数无关.于是,可以利用扩充非协调旋转Q_1元产生的真实特征值的渐近下界,通过一个简单的后处理,在任意正则张量积网格上得到真实特征值的确切下界.     

三维区域上Qrot1元的渐近展开及外推

本文研究了正方体区域上Qrot1非协调元渐近展开式.利用林群、吕涛等提出的有限元误差渐近展开法,获得了正方体区域上Qrot1非协调元特征值的误差渐近展开式.理论分析和数值实验结果表明三维Qrot1非协渊元特征值外推公式是有效的,可以把特征值的精度从二阶提高到四阶.     

三维区域上Q_1~(rot)元的渐近展开及外推

本文研究了正方体区域上Q₁^rot非协调元渐近展开式.利用林群、吕涛等提出的有限元误差渐近展开法,获得了正方体区域上Q₁^rot非协调元特征值的误差渐近展开式.理论分析和数值实验结果表明三维Q₁^rot非协调元特征值外推公式是有效的,可以把特征值的精度从二阶提高到四阶.     

关于有限元离散方程特征值的界

各种有限元离散方程(包括协调元、非协调元及混合元等)的特征值的上、下界以及条件数的估计,早已引起了注意(见[1],[2],[5]).这里我们用一种简明的方法来处理这类问题.本文用到的关于Sobolev空间中的标准符号见[3].下面出现的常数c,c_1,c_2等在不同地方可能取不同的值.     

三维Poisson方程特征值的四种有限元解及比较

应用三维EQ1rot元、三维Crouzeix-Raviart元、八节点等参数元、四面体线性元计算三维Poisson方程的近似特征值.计算结果表明:三维EQ1rot元和三维Crouzeix-Raviart元特征值下逼近准确特征值,八节点等参数元、四面体线性元特征值上逼近准确特征值,三维EQr1ot元和三维Crouzeix-Raviart元外推特征值下逼近准确特征值.计算结果还表明三维Crouzeix-Raviart元是一种计算效率较高的非协调元.     

M-矩阵最小特征值下界的新不等式

非奇异M-矩阵B的最小特征值τ(B)的下界是矩阵论中重要的研究课题.利用特征值定位定理,首先给出非负矩阵与M-矩阵的逆矩阵Hadamard积的谱半径上界,进而给出M-矩阵最小特征值下界的新不等式.新不等式只与矩阵的元素有关,易于计算.理论分析和数值例子表明所给结果改进了现有结果.     

非正曲率流形及其子流形上有界区域的特征值

本文研究了完备单连通具有非正曲率黎曼流形及其子流形上有界区域的特征值问题.利用广义Hessian比较定理,获得了局部特征值的下界估计式,将McKean[2]的定理在局部上推广到了非正曲率的情形.     

二阶特征值问题的非协调元逼近

本文以非协调三角形线性元为例,讨论了二阶特征值问题的非协调有限元逼近,基于二阶变分问题非协调有限元逼近的有关分析结果,不仅得到了特征值逼近解的误差估计,而且得到了特征函数逼近解的最优的L~2-误差估计和拟最优的L~∞-误差估计。     

关于正矩阵的最大特征值的包含定理及其应用

1　引　　言由于矩阵特征值问题在弹性动力学和自动控制等领域均已获得广泛的应用,所以关于矩阵特征值的计算方法及其上、下界的估计均为人们所关注.随着计算机的发展,有关矩阵特征值的各种有效算法应运而生[1].至于特征值的上、下界的估计问题,虽然也有很多成果[2-4],且它们在数学上都有一定的理论意义和应用价值,但常因其界限太宽而缺少工程价值.鉴于此,笔者利用文[3]引入的同步向量这一概念,讨论了正矩阵的最大特征值的上、下界的确定问题,获得了这类矩阵最大特征值的较为精确的包含定理,又与幂法[1]相结合,给出了非亏损正矩阵的最大特征…     

Lower bound theorem for normal pseudomanifolds

In this paper we present a self-contained combinatorial proof of the lower bound theorem for normal pseudomanifolds, including a treatment of the cases of equality in this theorem. We also discuss McMullen and Walkup's generalized lower bound conjecture for triangulated spheres in the context of the lower bound theorem. Finally, we pose a new lower bound conjecture for non-simply connected triangulated manifolds.     

Ricci curvature and betti numbers

We derive a uniform bound for the total betti number of a closed manifold in terms of a Ricci curvature lower bound, a conjugate radius lower bound and a diameter upper bound. The result is based on an angle version of Toponogov comparison estimate for small triangles in a complete manifold with a Ricci curvature lower bound. We also give a uniform estimate on the generators of the fundamental group and prove a fibration theorem in this setting.     

仿射不变量W_i(K)W_i(K~*)的下界估计

对于所有凸体与每一个i,寻找仿射不变量Wi(K)Wi(K*)下界的问题,是一个至今未能解决的公开问题.本文考虑了仿射不变量Wi(K)Wi(K*)的下界是与凸体K本身有关的常数的情形,并利用混合体积与对偶混合体积的关系理论,对仿射不变量Wi(K)Wi(K*)进行了讨论,获得了仿射不变量Wi(K)Wi(K*)的一个下界.作为应用,其对偶仿射不变量Wi(K)Wi(K*)的下界也被建立.     

On the average‐case complexity of Shellsort

We prove a lower bound expressed in the increment sequence on the average‐case complexity of the number of inversions of Shellsort. This lower bound is sharp in every case where it could be checked. A special case of this lower bound yields the general Jiang‐Li‐Vitányi lower bound. We obtain new results, for example, determining the average‐case complexity precisely in the Yao‐Janson‐Knuth 3‐pass case.     

Roper-Suffridge算子上的偏差定理下界估计的简单证明

Liczberski-Starkov first found a lower bound for ||D(f)|| near the origin, where is the Roper-Suffridge operator on the unit ball Bn in Cn and F is a normalized convex function on the unit disk. Later, Liczberski-Starkov and Hamada-Kohr proved the lower bound holds on the whole unit ball using a complex computation. Here we provide a rather short and easy proof for the lower bound. Similarly, when F is a normalized starlike function on the unit disk, a lower bound of ||D(f)|| is obtained again.     

On the Lower Bound of the Divisibility of Exponential Sums in Binomial Case

In this article,we analyze the lower bound of the divisibility of families of exponential sums for binomials over prime field.An upper bound is given for the lower bound,and,it is related to permutation polynomials.     

Notes on the braid index of closed positive braids

The Morton–Franks–Williams inequality for a link gives a lower bound for the braid index in terms of the HOMFLY polynomial. Franks and Williams conjectured that for any closed positive braid the lower bound coincides with the braid index. In this paper, we show that the bound is achieved for a certain class of closed positive braids. We also give an infinite family of prime closed positive braids such that the lower bound does not coincide with their braid indices.     

Equality conditions for lower bounds on the smallest singular value of a bidiagonal matrix

Several lower bounds have been proposed for the smallest singular value of a square matrix, such as Johnson’s bound, Brauer-type bound, Li’s bound and Ostrowski-type bound. In this paper, we focus on a bidiagonal matrix and investigate the equality conditions for these bounds. We show that the former three bounds give strict lower bounds if all the bidiagonal elements are non-zero. For the Ostrowski-type bound, we present an easily verifiable necessary and sufficient condition for the equality to hold.     

A Lagrangian lower bound for the container transshipment problem at a railway hub for a fast branch-and-bound algorithm

In this paper, we consider the container transshipment problem at a railway hub. A simple lower bound known for this problem will be improved by a new Lagrangian relaxation lower bound. Computational tests show that this lower bound outperforms the simple one and decreases substantially the run time of the branch-and-bound algorithm.     

Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem

In this paper we present a lower bound for the capacitated warehouse location problem based upon the Lagrangean relaxation of a mixed-integer formulation of the problem, where we use subgradient optimisation in an attempt to maximise this lower bound. Problem reduction tests based upon this lower bound and the original problem are given. Incorporating this bound and the reduction tests into a tree search procedure enables us to solve problems involving up to 50 warehouses and 150 customers.