Соболев空间中函数的有限元逼近以及在近似求解微分方程中的应用

用插值节点的均匀性,在空间中函数具有嵌入性质的条件下,导出了最佳逼近的误差估计,本文仍利用插值节点均匀性假设,对空间中的一般函数,也导出了逼近的误差估计,不再要求函数的嵌入性质; Ciarlet在仿射等价和空间函数具有嵌入性质的条件下,对一个二阶椭圆边值问题论证数值积分并不影响有限元子空间近似解逼近变分问题真解的速度。本文借助於空间中的一般函数的有限元逼近理论,对这一特殊的二阶椭圆边值问题,在基函数满足均匀性条件下,不要嵌入性质同样得到上面结果。     

任意凸多面体上布点均匀性的度量

均匀性度量是构作均匀设计的基础,本文从距离概念出发,通过对称的方法,得到一种新的距离函数-势函数,并将势函数作为衡量任意凸多面体上布点均匀性好坏的准则.数值例子和多变量Kendall 协和系数检验表明,当试验区域限制在单位立方体上时,势函数与目前常用的两种偏差-中心化L_2-偏差和可卷L_2.偏差在度量布点均匀性方面结论一致.     

非均匀调和函数的两类边值问题与积分表达式

本文给出非均匀指数函数的定义及性质,并且进一步引入了非均匀三角函数、非均匀双曲函数和非均匀对数函数.最后利用非均匀指数函数表达形式和非均匀解析函数的Cauchy积分理论,建立了非均匀泊松积分公式和非均匀施瓦茨积分公式,获得了非均匀调和函数在两类特殊边界上的狄利克雷问题和诺伊曼问题解的显示表达式.     

非线性抛物组非均匀网格差分解的唯一性和稳定性

１．引言 １．对一维非线性抛物组,在文献山中已构造一般非均匀网格差分格式,其中差分逼近的组合系数对不同的网格点和不同的网格层可以不同,并且运用不动点原理证明了差分解的存在性和收敛性．在非均匀网格差分格式中差分逼近的组合系数为常数的情形,文献［２］证明了具有有界二阶差商的离散向量解的存在性、唯一性和稳定性．本文将对文献［１］中构造的一般非均匀网格差分格式,证明所得到的差分解的唯一性和稳定性． 考虑如下非线性抛物组其中是未知的ｍ－维向量函数是给定的矩阵函数,ｊ（ｘ,ｔ,ｕ,ｐ）。是给定的ｍ－维向量函数…     

长方形区域上非分离非均匀Haar小波

定义了二维Haar尺度函数,构造了长方形区域上的二维非均匀Haar小波函数,给出了非均匀 Haar 小波的分解和重构公式,最后得到了单值重构算法.     

含空隙的各向同性介质Helmholtz方程扰动问题的传输特征值

传输特征值在反散射唯一性理论中具有十分重要的意义.在含空隙的各向同性非均匀介质折射率扰动下,研究了Helmholtz方程传输特征值的存在性问题.首先,通过构造Neumann-Dirichlet算子,建立传输特征值问题的等价形式.然后,进一步构造特征值函数,将扰动的传输特征值问题转化为算子为零特征值的扰动问题.最后,利用隐函数定理的扰动方法证明传输特征值的存在性.     

Bombieri定理的一个推广及其应用

利用Hooley-Huxley围道,证明生成函数满足一定条件的一类数论函数均具有Bombieri均值估计性质.同时给出这一结论在“Dirichiet L-函数的倒数均值估计”、“可表为两个平方和的自然数在算术级数中分布均匀性”等问题中的应用.     

变系数模型变窗宽局部M-估计的相合性

用变窗宽局部M-估计对变系数模型的系数函数进行估计,得到了估计的相合性和渐近正态性.所采用的方法继承了局部多项式回归的优点并且克服了最小二乘方法缺乏稳健性的缺点.变窗宽的使用提高了局部M-估计的可塑性,并使得它们能成功地处理空间非齐性曲线、异方差性及非均匀设计密度.     

二维序贯均匀等距设计对跳比单调函数类的有效性

把序贯的思想和均匀设计相结合,提出的“序贯均匀设计”,其目的在于解决多维空间上快速选优问题。已经证明了二维序贯均匀设计对旋转单调函数类的有效性。本文进一步证明了“二维序贯均匀等距设计”对跳比单调函数类的有效性。     

局部形状可调整的三次有理B样条插值曲线

利用三次非均匀有理B样条,给出了一种构造局部插值曲线的方法,生成的插值曲线是C2连续的.曲线表示式中带有一个局部形状参数,随着一个局部形状参数值的增大,所给曲线将局部地接近插值点构成的控制多边形.基于三次非均匀有理B样条函数的局部单调性和一种保单调性的准则,给出了所给插值曲线的保单调性的条件.     

Height Uniformity for Algebraic Points on Curves

We recall the main result of L. Caporaso, J. Harris, and B. Mazur's 1997 paper of Uniformity of rational points. It says that the Lang conjecture on the distribution of rational points on varieties of general type implies the uniformity for the numbers of rational points on curves of genus at least 2. In this paper we will investigate its analogue for their heights under the assumption of the Vojta conjecture. Basically, we will show that the Vojta conjecture gives a naturally expected simple uniformity for their heights.     

Asymptotic distribution of integer-valued binary forms of a fixed discriminant

Under the assumption on the boundary of the zeros of the Dirichlet L-functions, one obtains a refinement of the results of Yu. V. Linnik and B. F. Skubenko on the uniformity of the distribution of integral points on the hyperboloids D=b²–ac (D0). As a corollary one obtains the asymptotic behavior of the number of reduced indefinite binary quadratic forms of discriminant 4D.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 112, pp. 26–40, 1981.     

Height uniformity for integral points on elliptic curves

We recall the result of D. Abramovich and its generalization by P. Pacelli on the uniformity for stably integral points on elliptic curves. It says that the Lang-Vojta conjecture on the distribution of integral points on a variety of logarithmic general type implies the uniformity for the numbers of stably integral points on elliptic curves. In this paper we will investigate its analogue for their heights under the assumption of the Vojta conjecture. Basically, we will show that the Vojta conjecture gives a naturally expected simple uniformity for their heights.

     

Persistence of noncompact normally hyperbolic invariant manifolds in bounded geometry

We prove a persistence result for noncompact normally hyperbolic invariant manifolds in Riemannian manifolds of bounded geometry. The bounded geometry of the ambient manifold is a crucial assumption in order to control the uniformity of all estimates throughout the proof.     

Preference intensity and cardinality

Beyond its mathematization, preference intensity is a relevant concept, more general than cardinal representable preference, and an according axiomatic definition is introduced, dispensing with the Archimedean assumption. Given a preference intensity, a uniform space (generating the order topology of the induced preference) is associated to it. If the preference intensity is representable, this uniformity is semimetrizable. A “uniqueness” result for preference intensities leads naturally to the hypothesis of compactness. Through the uniformity corresponding to the preference intensity, compactness can be characterized.     

Asymptotics for the ruin probabilities of a two‐dimensional renewal risk model with heavy‐tailed claims

In this paper, we consider two dependent classes of insurance business with heavy‐tailed claims. The dependence comes from the assumption that claim arrivals of the two classes are governed by a common renewal counting process. We study two types of ruin in the two‐dimensional framework. For each type of ruin, we establish an asymptotic formula for the finite‐time ruin probability. These formulae possess a certain uniformity feature in the time horizon. Copyright © 2010 John Wiley & Sons, Ltd.     

Uniform binary geometries

In a geometric lattice every interval can be mapped isomorphically into an upper interval (containing 1) by a strong map. A natural question thus arises as to what extent certain assumptions on the upper interval structure determine the whole lattice. We consider conditions of the following sort: that above a certain levelm any two upper intervals of the same length be isomorphic. This property, called uniformity, is studied for binary geometries. The geometries satisfying the strongest uniformity condition (m = 1) are determined (except for one open case). As is to be expected the corresponding problem for lower intervals is easier and is solved completely.     

Uniformities,hyperspaces, and normality

LetX be a completely regular space and 2 ^X the hyperspace ofX. It is shown that the uniform topologies on 2 ^X arising from Nachbin uniformity onX, which is the weak uniformity generated byC(X, ), and from Tukey—Shirota uniformity onX, generated by all countable open normal coverings ofX, agree. They, both, coincide with a Vietoris-type topology on 2 ^X , the countable locally finite topology, iffX is normal.     

Approximation in the finite element method

Summary The rate of convergence of the finite element method depends on the order to which the solutionu can be approximated by the trial space of piecewise polynomials. We attempt to unify the many published estimates, by proving that if the trial space is complete through polynomials of degreek–1, then it contains a functionv ^h such that |u–v ^h | _s ch ^k–s|u| _k . The derivatives of orders andk are measured either in the maximum norm or in the mean-square norm, and the estimate can be made local: the error in a given element depends on the diameterh _i of that element. The proof applies to domains in any number of dimensions, and employs a uniformity assumption which avoids degenerate element shapes.This research was supported by the National Science Foundation (GP-13778).     

Finiteness Result for the Simplicial Branch-and-Bound Algorithm Based on ω-Subdivisions

The question of the finiteness of simplicial branch-and-bound algorithms employing only -subdivisions is considered. In Ref. 1, it was shown that this algorithm is convergent; here, it is proved that the algorithm is also finite if two assumptions are fulfilled. The first assumption requires the function values at vertices of the initial simplex to be lower than the optimal value of the problem. The second assumption requires each vertex of the initial simplex to violate at most one of the constraints defining the feasible polytope. The first assumption is mild from a theoretical point of view; the second assumption is strong, but holds always for instance when the feasible region is a hypercube.