Approximation of bandlimited functions

Many signals encountered in science and engineering are approximated well by bandlimited functions. We provide suitable error bounds for the approximation of bandlimited functions by linear combinations of certain special functions—the prolate spheroidal wave functions of order 0. The coefficients in the approximating linear combinations are given explicitly via appropriate quadrature formulae.     

Ⅱ型三角剖分上二次双周期样条

本文用B-网方法确定了△_(nm)~((2))剖分上二次双周期样条函数空间的维数,给出了插值条件的几种提法,证明了解的存在唯一性.     

The regularizing properties of anisotropic radial basis functions

In the present work we consider the problem of interpolating scattered data using radial basis functions (RBF). In general, it is well known that this leads to a discrete linear inverse problem that needs to be regularized in order to provide a meaningful solution. The work focuses on a metric-regularization approach, based on a new class of RBF, called anisotropic RBF. The work provides theoretical justifications for the regularization approach and it considers a suitable proposal for the metric, supporting it by numerical examples.     

Separable anisotropic differential operators and applications

The nonlocal boundary value problems for anisotropic partial differential-operator equations with a dependent coefficients are studied. The principal parts of the appropriate generated differential operators are nonself-adjoint. Several conditions for the maximal regularity and the fredholmness in Banach-valued Lp-spaces of these problems are given. These results permit us to establish that the inverse of corresponding differential operators belongs to Schatten q-class. Some spectral properties of the operators are investigated. In applications, the nonlocal BVP's for quasielliptic partial differential equations and for systems of quasielliptic equations on cylindrical domain are studied.     

拟协调元的精度分析

利用双参数有限元的框架，证明利用拟协调元方法构造的非协调三角形板元都具有一个非常特殊的性质。即相容误差比插值误差高一阶。这是常规有限元和一般非协调元所不具备的。     

The intertwining lifting theorem for ordered groups

Sz.-Nagy's dilation theorem for a contraction on a Hilbert space has been extended by Mlak to the case of a contraction semigroup whose indices are the positive elements of a totally ordered discrete group. We generalize to this case the intertwining lifting theorem of Sz.-Nagy and Foias. Some previous interpolation results on ordered groups are obtained as consequences.     

On the stationary Lp-approximation power to derivatives by radial basis function interpolation

In this paper, we consider approximation to derivatives of a function by using radial basis function interpolation. Most of well-known theories for this problem provide error analysis in terms of the so-called native space, say C_φ. However, if a basis function φ is smooth, the space C_φ is extremely small. Thus, the purpose of this study is to extend this result to functions in the homogenous Sobolev space.     

The LEM exponential integrator for advection–diffusion–reaction equations

We implement a second-order exponential integrator for semidiscretized advection–diffusion–reaction equations, obtained by coupling exponential-like Euler and Midpoint integrators, and computing the relevant matrix exponentials by polynomial interpolation at Leja points. Numerical tests on 2D models discretized in space by finite differences or finite elements, show that the Leja–Euler–Midpoint (LEM) exponential integrator can be up to 5 times faster than a classical second-order implicit solver.     

Interpolation by a Game

We introduce a notion of a real game (a generalisation of the Karchmer-Wigderson game (cf. [3]) and of real communication complexity, and relate this complexity to the size of monotone real formulas and circuits. We give an exponential lower bound for tree-like monotone protocols (defined in [4, Definition 2.2]) of small real communication complexity solving the monotone communication complexity problem associated with the bipartite perfect matching problem. This work is motivated by a research in interpolation theorems for prepositional logic (by a problem posed in [5, Section 8], in particular). Our main objective is to extend the communication complexity approach of [4, 5] to a wider class of proof systems. In this direction we obtain an effective interpolation in a form of a protocol of small real communication complexity. Together with the above mentioned lower bound for tree-like protocols this yields as a corollary a lower bound on the number of steps for particular semantic derivations of Hall's theorem (these include tree-like cutting planes proofs for which an exponential lower bound was demonstrated in [2]).     

内积在溶液浓度测定中的应用

提出内积的溶液浓度测定方法。该方法计算已知浓度溶液透光率曲线与0号溶液（浓度最低的溶液）透光率曲线的内积ρ,确定溶液的ρ-C曲线,然后测定未知溶液的透光率曲线,计算其与0号溶液透光率曲线的内积,并利用已建立好的ρ-C曲线进行插值以估计溶液浓度。由于该方法利用了透光率曲线的全部信息,因此对溶液浓度的估计精度较高。对K2Cr2O7溶液浓度的测定实验结果表明,该方法对溶液浓度的估计相对误差小于1.00%。