二元三次样条空间S_3~(1,2)(△_(mn)~(2))的样条拟插值

本文首先利用由两组具有局部最小支集的样条所组成的基函数,构造非均匀2型三角剖分上二元三次样条空间S1,23(△(2)mn)的若干样条拟插值算子.这些变差缩减算子由样条函数B1ij支集上5个网格点或中心和样条函数B2ij支集上5个网格点处函数值定义.这些样条拟插值算子具有较好的逼近性,甚至算子Vmn(f)能保持近最优的三次多项式性.然后利用连续模,分析样条拟插值算子Vmn(f)一致逼近于充分光滑的实函数.最后推导误差估计.     

SL(2,R)上一类极大算子的(H∞,s1,L1)型

本文我们引入了函数类B_δ(G//K)={φ∈L¹(G//K)||φ(t)|≤Δ^-1(t)(1+t)^1-δ,δ>0),对f∈L^p(G//K),1≤p≤∞,和极大算子(?),证明了这类算子是(H_∞,s¹,L¹)型的.     

关于一个二元B样条基

连接矩形网剖分中每一矩形的两条对角线得到一个三角剖分,将它记为△_mn。当k≥3时,△_mn上不存在k—1阶光滑度的分片k次非平凡局部支集二元样条函数,所以本文给出了均匀剖分下的具有最小对称支集的二元二次一阶光滑度的B样条基。此外,作为一元样条的Marsden恒等式的推广,我们还得到了二元样条的相应形式以及其它一些恒等式。利用这些恒等式,我们在整个剖分△_mn的二次C¹样条函数空间上建立逼近误差估计以及相应的渐近公式。     

一类Ⅱ型剖分下的二元三次周期样条的超限插值和逼近(英)

本文讨论了Ⅱ一型三角剖分△^（2）_mn下的一类二元三次周期样条的超限插值和逼近,给出了它的表示以及存在唯一性,最后,估计了它的逼近阶．     

关于一类S1，13（△（2）mn）插值与逼近

设△^（2）_mn是矩形域Ｄ＝［ａ，ｂ］(?)［ｃ，ｄ］的Ⅱ－型三角剖分．S^1，1₃（△^（2）_mn）是带边界条件的二元三次样条空间：本文我们将讨论一类S^1，1₃（△^（2）_mn）的插值问题，证明了它的存在性，唯一性及逼近阶：如果ｆ∈Ｃ^４（Ｄ），则有｜ｆ－ｓ｜≤ｋ（ｌ）·ｍａ     

L2(Rs)中正交尺度函数和正交小波的Fourier变换紧支集的刻画

借助于Fourier变换,在较弱条件下给出了φ(x)是L²(R^s)上正交尺度函数的一个充分必要条件.进一步, 假设 {Ψ_μ } 是正交小波, 且正交小波的Fourier变换紧支集是 ∪_μsupp{ψ_μ} =∏^s_i=1[A_i, D_i] -∏^s_i=1(B_i, C_i),A_i≤B_i≤C_i≤D_i, i =1, 2,… , s. 则在最弱条件“每一个 |ψ_μ| 在ω∈∂(∏^s_i=1[A_i, D_i]) 上连续'下, 该文通过一些不等式和等式给出了正交尺度函数和正交小波的Fourier变换紧支集的刻画.文中的结论全面改进了龙瑞麟和张之华的结果.     

二元四次样条函数空间的维数与基底

本文讨论了一类多边形区域上样条空间S₄²(D,△)的维数与基底,给出并证明了文献[1]中主要结果的推广形式。 在文献[1]中,作者解决了平面矩形区域上样条函数空间S_k^μ(△_mn⁽¹⁾)(k=3,μ=1;k=4,μ=2)的基底问题,其主要结果是基本的。本文将要考虑其中有关S₄²(△_mn⁽¹⁾     

单位球上正规权 Dirichlet型空间上的一种积分算子*

设 μ 是 [0, 1)上的正规函数,B_n 是 n 维复空间 Cⁿ 上的单位球, ψ 是 B_n 上的一个全纯函数,? 是 B_n 上的全纯自映射. 作者考虑如下一种积分算子:T_?,ψ(f)(z) =Z01f[?(tz)]Rψ(tz)dt/t, z ∈ B_n.作者主要刻画了正规权Dirichlet型空间D^p_μ(B_nn) (0 < p ≤ 1) 上 T_?,ψ 的有界性和紧性.同时, 本文利用Carleson 方块和Bergman球的测度讨论了正规权Bergman型空间A^p_μ(B_n) 到 D^p_μ(B_n) (p > 0)的同样问题. 对讨论的情形本文均给出了充要条件.     

H2(Bn)上的Toeplitz算子与复合算子

给出H²(B_n)上复合算子具有闭值域的特征,讨论了Toeplitz算子与复合算子的Fredholm性质。     

关于L2(En+1+,(dxdy)/(yn+1)中的柱面函数空间的正交直和分解

本文利用小波变换给出了L²(E_n+1⁺,(dxdy)/(yⁿ⁺¹)中的柱面函数空间的一种正交直和分解.在这种分解下定义了Toeplitz-Hankel型算子,得到了类似的Schatten-Von Neumann性质.     

The boundary element spline collocation for nonuniform meshes on the torus

The spline collocation method for a class of biperiodic strongly elliptic pseudodifferential operators is considered. As trial functions tensor products of odd degree splines are used and the collocation is imposed at the nodal points of the tensor product mesh. It is shown that the collocation problem is uniquely solvable if the maximum mesh length is small enough. Moreover, the approximation is stable and quasioptimal with respect to a norm depending on the order of the operator and the degree of approximating splines. Some convergence results are given for general and quasiuniform meshes. The results cover for example the single layer and the hypersingular operators.     

Adaptive Surface Reconstruction Based on Tensor Product Algebraic Splines

Surface reconstruction from unorganized data points is a challenging problem in Computer Aided Design and Geometric Modeling. In this paper, we extend the mathematical model proposed by Juttler and Felis (Adv. Comput. Math., 17 (2002), pp. 135-152) based on tensor product algebraic spline surfaces from fixed meshes to adaptive meshes. We start with a tensor product algebraic B-spline surface defined on an initial mesh to fit the given data based on an optimization approach. By measuring the fitting errors over each cell of the mesh, we recursively insert new knots in cells over which the errors are larger than some given threshold, and construct a new algebraic spline surface to better fit the given data locally. The algorithm terminates when the error over each cell is less than the threshold. We provide some examples to demonstrate our algorithm and compare it with Jiittler's method. Examples suggest that our method is effective and is able to produce reconstruction surfaces of high quality.AMS subject classifications: 65D17     

Interpolation by quadratic splines

Convergence properties of quadratic spline interpolation of continuous functions that does not necessarily take place at the midpoints of mesh intervals are investigated. A theorem giving lower bounds on the elements of the inverse of certain tridiagonal matrices is proved. This result is used to precisely relate the norm of certain interpolating projections to the points of interpolation and local mesh ratios. It is shown, for example, that for Lipschitz continuous functions, any choice of interpolation points, one in each mesh interval, uniformly bounded away from the mesh points, yields convergence at the best possible rate with no mesh ratio restriction.     

Quasi-interpolation operators based on a cubic spline and applications in SAMR simulations

In this paper, we consider the properties of monotonicity-preserving and global conservation-preserving for interpolation operators. These two properties play important role when interpolation operators used in many real numerical simulations. In order to attain these two aspects, we propose a one-dimensional (1D) new cubic spline, and extend it to two-dimensional (2D) using tensor-product operation. Based on discrete convolution, 1D and 2D quasi-interpolation operators are presented using these functions. Both analysis and numerical results show that the interpolation operators constructed in this paper are monotonic and conservative. In particular, we consider the numerical simulations of 2D Euler equations based on the technique of structured adaptive mesh refinement (SAMR). In SAMR simulations, effective interpolators are needed for information transportation between the coarser/finer meshes. We applied the 2D quasi-interpolation operator to this environment, and the simulation result show the efficiency and correctness of our interpolator.     

Projective ring line encompassing two-qubits

We find that the projective line over the (noncommutative) ring of 2×2 matrices with coefficients in GF(2) fully accommodates the algebra of 15 operators (generalized Pauli matrices) characterizing two-qubit systems. The relevant subconfiguration consists of 15 points, each of which is either simultaneously distant or simultaneously neighbor to (any) two given distant points of the line. The operators can be identified one-to-one with the points such that their commutation relations are exactly reproduced by the underlying geometry of the points with the ring geometric notions of neighbor and distant corresponding to the respective operational notions of commuting and noncommuting. This remarkable configuration can be viewed in two principally different ways accounting for the basic corresponding 9+6 and 10+5 factorizations of the algebra of observables: first, as a disjoint union of the projective line over GF(2) × GF(2) (the “Mermin” part) and two lines over GF(4) passing through the two selected points that are omitted; second, as the generalized quadrangle of order two with its ovoids and/or spreads corresponding to (maximum) sets of five mutually noncommuting operators and/or groups of five maximally commuting subsets of three operators each. These findings open unexpected possibilities for an algebro-geometric modeling of finite-dimensional quantum systems and completely new prospects for their numerous applications. __________ Translated from Teoreticheskaya i Matematicheskaya Fizika, Vol. 155, No. 3, pp. 463–473, June, 2008.     

Three-dimensional data transfer operators in large plasticity deformations using modified-SPR technique

In this paper, the data transfer operators are developed in 3D large plasticity deformations using superconvergent patch recovery (SPR) method. The history-dependent nature of plasticity problems necessitates the transfer of all relevant variables from the old mesh to new one, which is performed in three main stages. In the first step, the history-dependent internal variables are transferred from the Gauss points of old mesh to nodal points. The variables are then transferred from nodal points of old mesh to nodal points of new mesh. Finally, the values are computed at the Gauss points of new mesh using their values at nodal points. As the solution procedure, in general, cannot be re-computed from the initial configuration, it is continued from the previously computed state. In particular, the transfer operators are defined for mapping of the state and internal variables between different meshes. Aspects of the transfer operators are presented by fitting the best polynomial function with the C₀, C₁ and C₂ continuity in 3D superconvergent patch recovery technique. Finally, the efficiency of the proposed model and computational algorithms is demonstrated through numerical examples.     

Some new consistency relations connecting spline values at mesh and mid points

This paper is concerned with polynomial splines on a uniform mesh. Linear dependence relations connecting spline values at mesh and mid points are developed.     

A cubic spline approximation and application of TAGE iterative method for the solution of two point boundary value problems with forcing function in integral form

In this article, we report an efficient high order numerical method based on cubic spline approximation and application of alternating group explicit method for the solution of two point non-linear boundary value problems, whose forcing functions are in integral form, on a non-uniform mesh. The proposed method is applicable when the internal grid points of solution interval are odd in number. The proposed cubic spline method is also applicable to integro-differential equations having singularities. Computational results are given to demonstrate the utility of the method.     

W_2~m空间中样条插值算子与最佳逼近算子的一致性

由线性微分算子确定的样条是连接多项式样条与希氏空间中抽象算子样条的重要环节,对微分算子样条的研究,既可从更高的观点揭示和概括多项式样条,又可启示我们去发现抽象算子样条的一些新的理论和应用． Ｇｒｅｅｎ函数是研究微分算子样条的重要工具 ［１］,但在微分算子插值样条的计算及将样条用于数值分析中,再生核方法起着更重要的作用．文献［２］［３］给出了与二阶线性微分算子插值样条有关的再生核解析表达式;由此得到了二阶微分算子插值样条与空间Ｗ_２～１［ａ,ｂ］中最佳插值逼近算子的一致性;而且还利用再生核给出了Ｈｉ…     

CAN A CUBIC SPLINE CURVE BE G3

This paper proposes a method to construct an G³cubic spline curve from any given open control polygon.For any two inner Bezier points on each edge of a control polygon,we can de ne each Bezier junction point such that the spline curve is G2-continuous.Then by suitably choosing the inner Bezier points,we can construct a global G³spline curve.The curvature combs and curvature plots show the advantage of the G³cubic spline curve in contrast with the traditional C2 cubic spline curve.