A note on Davis type error bounds

Bounds for the error of the approximation of the value of a bounded linear functionalUf by the weighted sumU _n f= _k ^=0/n–1 a _k f (x _k ) in Hilbert function spacesH(B) based upon the Davis method are considered. Taking into account that functionsf H (B) withUf=U _n f are known, improved error bounds are computed. Applying the explicit formulas numerical examples are treated and comparisons are made.     

一类与BB型对偶剖分相关的广义差分格式

豆引言考虑二阶椭圆方程的边值问题〔,a.an.a.＆t-。^D一[六（a于）十十…于）」一八x,y）,（x,y）En,（1.1）J“山一而“av”-av”。。、一、。。,\一·。·---,l。。、____（.2）LU一0,（J,y）E厂一go,其中D是多边形区域,厂一JD为0的边界,f（x,y）为o上的已知函数/三L‘（0）,系数a—a（xJ）充分光滑,且存在常数7>O,使得以X,y）>/,对任意（X,y）ED.文[1],[2]已系统地研究了求解口.1）,（l.2）的广义差分法.广义差分法的基本思想是对求解区域0作三角形剖分TA及其对偶剖分T;,然后构造T^上的试探函数空间U。（有限元空间）和耳上的…     

利用三次样条插值提高自准直仪的准确度

为了提高自准直仪的准确度,利用三次样条插值法对CCD像元进行细分,并利用直线边缘拟合法检测图像边缘.实验采取独立的测量手段,将自准直仪的实际转角和算法计算得到的角度值进行比较,分析其准确度.实验结果表明,该方法能明显提高自准直仪的准确度,准确度达到0.1角秒.     

基于FPGA的准直测角系统

为了提高线阵CCD准直测角系统的精度、速度、集成度,以及可靠性,提出一种集成于单片FPGA、光积分时间可自适应调节的片上准直测角系统。以FPGA作为系统处理核心,利用高斯滤波算法对CCD输出信号进行数字滤波,利用边缘自动检测算法获得图像的像元级边界,在此基础上应用多项式插值算法对图像边缘位置进行亚像元细分,最终计算出失准角。利用VHDL语言以及MAX+plus II软件完成了系统设计。系统仿真和实验表明,所设计的片上系统具有高精度、高集成度、高可靠性的特点。     

Interpolation Operators on the Space of Holomorphic Functions on the Unit Circle

The aim of the paper is to get an estimation of the error of the general interpolation rule for functions which are real valued on the interval [—a, a],a (0,1), have a holomorphic extension on the unit circle and are quadratic integrable on the boundary of it. The obtained estimate does not depend on the derivatives of the function to be interpolated. The optimal interpolation formula with mutually different nodes is constructed and an error estimate as well as the rate of convergence are obtained. The general extremal problem with free weights and knots is solved.     

Smoothness of Nonlinear Median-Interpolation Subdivision

We give a refined analysis of the Hölder regularity for the limit functions arising from a nonlinear pyramid algorithm for robust removal of non-Gaussian noise proposed by Donoho and Yu [6,7,17]. The synthesis part of this algorithm can be interpreted as a nonlinear triadic subdivision scheme where new points are inserted based on local quadratic polynomial median interpolation and imputation. We introduce the analogon of the Donoho–Yu scheme for dyadic refinement, and show that its limit functions are in C for >log₄(128/31)=1.0229.... In the triadic case, we improve the lower bound of >log₂(135/121)=0.0997... previously obtained in [6] to >log₃(135/53)=0.8510.... These lower bounds are relatively close to the anticipated upper bounds of log₂(16/7)=1.1982... in the dyadic, respectivly 1 in the triadic cases, and have been obtained by deriving recursive inequalities for the norm of second rather than first order differences of the sequences arising in the subdivision process.     

路图P3(G)的色数

设G是一个图,G的路图P3(G)的顶点集是G中所有三个顶点的路P3, 当G中的两个P3路形成P4路或C3圈时,在P3(G)中它们所代表的两个顶点相邻. 在这篇文章中,我们得到对于一个无三角形的图G, χ(P3(G))≤β(G),其中β(G)表G的点覆盖数. 对于顶点数至少为3的连通图G,χ(P3(G))≤2当且仅当G是二部图, 并且χ(P3(G))=1当且仅当 G是星图. 对于K4的剖分图G,2≤χ(P3(G))≤3. 对于系列平行图和外可平面图G,χ(P3(G))≤3.     

基于亏量方程的多重网格解法

基于亏量方程提出了一种生成多重网格插值公式的新方法,新插值公式充分利用了粗网格的信息,因而具有更高的精度.对Poisson方程,各向异性方程,双调和方程,甚至三维问题的数值试验表明,新插值公式改进了多重网格法的渐近收敛速度,节省了存储空间及计算时间.     

Hitting times for random walks on subdivision and triangulation graphs

Let G be a connected graph. The subdivision graph of G, denoted by S(G), is the graph obtained from G by inserting a new vertex into every edge of G. The triangulation graph of G, denoted by R(G), is the graph obtained from G by adding, for each edge uv, a new vertex whose neighbours are u and v. In this paper, we first provide complete information for the eigenvalues and eigenvectors of the probability transition matrix of a random walk on S(G) (res. R(G)) in terms of those of G. Then we give an explicit formula for the expected hitting time between any two vertices of S(G) (res. R(G)) in terms of those of G. Finally, as applications, we show that, the relations between the resistance distances, the number of spanning trees and the multiplicative degree-Kirchhoff index of S(G) (res. R(G)) and G can all be deduced from our results directly.     

Subdivision Schemes and Irregular Grids

The present paper deals with subdivision schemes associated with irregular grids. We first give a sufficient condition concerning the difference scheme to obtain convergence. This condition generalizes a necessary and sufficient condition for convergence known in the case of uniform and stationary schemes associated with a regular grid. Through this sufficient condition, convergence of a given subdivision scheme can be proved by comparison with another scheme. Indeed, when two schemes are equivalent in some sense, and when one satisfies the sufficient condition for convergence, the other also satisfies it and it therefore converges too. We also study the smoothness of the limit functions produced by a scheme which satisfies the sufficient condition. Finally, the results are applied to the study of Lagrange interpolating subdivision schemes of any degree, with respect to particular irregular grids.