拟贯穿剖分上的二元样条Lagrange插值

分片代数曲线足经典代数曲线的推广.利用沿分片代数曲线插值以及分片代数曲线的Nother型定理,给出了一类构造拟贯穿剖分上的二元样条Lagrange插值适定结点组的一种方法,并给出具体算法与实例.     

特殊形式的多元有理样条插值

有理样条插值问题最早是由R.Schaback提出的,由于R.Schaback考虑此问题时涉及到了非线性方程组的求解,因而实现起来比较复杂.后来,王仁宏等研究了几类特殊形式的插值有理样条函数,避开了求解非线性方程的困难.能否在多元情形下建立类似的结果?本文对此作出了肯定的回答,并就二元情形的三角剖分和四边形剖分建立了几类特殊形式的插值多元有理样条,构造性地证明了解的存在性和唯一性.     

关于II型三角剖分上三次样条的一类有限插值与逼近

关于ＩＩ型三角剖分上三次样条的一类有限插值与逼近宣培才（绍兴师专）ＯＮＴＨＥＴＲＡＮＳＦＩＮＩＴＥＩＮＴＥＲＰＯＬＡＴＩＯＮＡＮＤＡＰＰＲＯＸＩＭＡＴＩＯＮＢＹＢＩＶＡＲＩＡＴＥＣＵＢＩＣＳＰＬＩＮＥＳＯＮＴＹＰＥ－ＩＩＴＲＩＡＮＧＵＬＡＲ￥Ｘｕａｎ...     

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

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

一种四次有理插值样条及其逼近性质

1引言有理样条函数是多项式样条函数的一种自然推广,但由于有理样条空间的复杂性,所以有关它的研究成果不象多项式样条那样完美,许多问题还值得进一步的研究．近几十年来,有理插值样条,特别是有理三次有理插值样条,由于它们在曲线曲面设计中的应用,已有许多学者进行了深入研究,取得了一系列的成果(见[1]-[7])．但四次有理插值样条由于其构造所花费的计算量太大以及在使用上很不方便而让人们忽视了其重要的应用价值,因此很少有人研究他们．实际上,在某些情况下四次有理插值样条有其独特的应用效果,如文[8]建立的一种具有局部插值性质的分母为二次的四次有理样条,即一个剖分     

二元三次一阶光滑的分片多项式样条函数

一元样条大致从以下三个方向上发展起来的:一元截断多项式样条;一元B-样条;一元分片多项式样条。二元样条的研究已取得了不少进展,文[2]可视为一元截断多项式样条向二元截断多项式样条推广的奠基性的工作,文[3]又讨论了二元B样条的构造方面的进展,但一元分片多项式样条的构造方法如何推广到二元样条上来,几乎没有见到什么工作。我们曾在文[4]中作过一点努力,但那是讨论二元二     

非均匀Ⅱ型三角剖分上的双周期三次样条函数空间

本文确立了非均匀Ⅱ型三角剖分上双周期三次样条函数空间的维数,并给出了一组具有局部支集的基底.     

多元弱样条函数空间的维数

讨论了多元弱样条一点处的维数公式及任意三角剖分下的维数公式．得到了１－型剖分下Ｗ_３^１（Ｉ₁Δ_ｍｎ^１）的维数与局部支集样条基．     

Construction of Cubature Formulas via Bivariate Quadratic Spline Spaces over Non-Uniform Type-2 Triangulation

In this paper, matrix representations of the best spline quasi-interpolating operator over triangular sub-domains in $S^1_2 (∆^{(2)}_{mn})$, and coefficients of splines in terms of B-net are reviewed firstly. Moreover, by means of coefficients in terms of B-net, computation of bivariate numerical cubature over triangular sub-domains with respect to variables $x$ and $y$ is transferred into summation of coefficients of splines in terms of B-net. Thus concise bivariate cubature formulas are constructed over rectangular sub-domain. Furthermore, by means of module of continuity and max-norms, error estimates for cubature formulas are derived over both sub-domains and the domain.     

Delaunay configurations and multivariate splines: A generalization of a result of B. N. Delaunay

In the 1920s, B. N. Delaunay proved that the dual graph of the Voronoi diagram of a discrete set of points in a Euclidean space gives rise to a collection of simplices, whose circumspheres contain no points from this set in their interior. Such Delaunay simplices tessellate the convex hull of these points. An equivalent formulation of this property is that the characteristic functions of the Delaunay simplices form a partition of unity. In the paper this result is generalized to the so-called Delaunay configurations. These are defined by considering all simplices for which the interiors of their circumspheres contain a fixed number of points from the given set, in contrast to the Delaunay simplices, whose circumspheres are empty. It is proved that every family of Delaunay configurations generates a partition of unity, formed by the so-called simplex splines. These are compactly supported piecewise polynomial functions which are multivariate analogs of the well-known univariate B-splines. It is also shown that the linear span of the simplex splines contains all algebraic polynomials of degree not exceeding the degree of the splines.

     

关于多元多项式分解的必要条件

类似于一元多项式因式分解的相关结论,利用多元多项式函数与其偏导函数的关系,介绍多元多项式能够因式分解的必要条件,即若 f′xi （x1,x2,…,xn ）与 f （x1,…,xi-1,0,xi＋1,…,xn ）有公因式,则 f （x1,x2,…,xn ）可以分解。     

Spline methods for the solution of hyperbolic equation with variable coefficients

In this study, we developed the methods based on nonpolynomial cubic spline for numerical solution of second‐order nonhomogeneous hyperbolic partial differential equation. Using nonpolynomial cubic spline in space and finite difference in time directions, we obtained the implicit three level methods of O(k² + h²) and O(k² + h⁴). The proposed methods are applicable to the problems having singularity at x = 0, too. Stability analysis of the presented methods have been carried out. The presented methods are applied to the nonhomogeneous examples of different types. Numerical comparison with Mohanty's method (Mohanty, Appl Math Comput, 165 (2005), 229–236) shows the superiority of our presented schemes. © 2007 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2007     

棋盘游戏与有限域上多项式分解算法

将有限域F_2上多项式分解问题转化为一种对应的棋盘游戏,利用后者的性质设计了一个F_2上m+n-2次多项式f(x)分解为一个m-1次多项式与一个n-1次多项式的判断、分解算法,并对算法的复杂度进行了分析.算法的一个优势是,如果f(x)不能按要求分解,也可以找到一个与f(x)相近(这里指系数相异项较少)的多项式的分解.     

The <Emphasis Type="Italic">L</Emphasis><Subscript><Emphasis Type="Italic">p</Emphasis></Subscript>-Approximation Order of Surface Spline Interpolation for 1 \leq <Emphasis Type="Italic">p</Emphasis> \leq 2

We show that the L_p-approximation order of surface spline interpolation equals m+1/p for p in the range 1 \leq p \leq 2, where m is an integer parameter which specifies the surface spline. Previously it was known that this order was bounded below by m + &frac; and above by m+1/p. With h denoting the fill-distance between the interpolation points and the domain , we show specifically that the L_p()-norm of the error between f and its surface spline interpolant is O(h^{m + 1/p}) provided that f belongs to an appropriate Sobolev or Besov space and that \subset R^d is open, bounded, and has the C^2m-regularity property. We also show that the boundary effects (which cause the rate of convergence to be significantly worse than O(h^2m)) are confined to a boundary layer whose width is no larger than a constant multiple of h |log h|. Finally, we state numerical evidence which supports the conjecture that the L_p-approximation order of surface spline interpolation is m + 1/p for 2 < p \leq \infty.     

An iterative regularization method for the 2-constrained pseudoinversion of an operator equation

An iterative regularization algorithm is proposed for solving a special optimization problem, the so-called 2-constrained operator pseudoinversion. The convergence of the algorithm is examined in the case of perturbed input data. An error estimate is derived, and an a priori choice of the regularization parameters is described. The algorithm is applied to an optimal control problem with minimal costs.     

Numerical Solution of Boundary Value Problems for Selfadjoint Differential Equations of 2nth Order

The paper is devoted to solving boundary value problems for self-adjoint linear differential equations of 2nth order in the case that the corresponding differential operator is self-adjoint and positive semidefinite. The method proposed consists in transforming the original problem to solving several initial value problems for certain systems of first order ODEs. Even if this approach may be used for quite general linear boundary value problems, the new algorithms described here exploit the special properties of the boundary value problems treated in the paper. As a consequence, we obtain algorithms that are much more effective than similar ones used in the general case. Moreover, it is shown that the algorithms studied here are numerically stable.