W_2~m空间中样条插值算子与线性泛函的最佳逼近

In this paper,the convergency of spline interpolation operators is obtained,these spline operators are determined by linear differential operators and constraint functionals.The errors of the interpolating spline with EHB fanctionals are estimated.The best approximation of linear functionals on W2^n spaces are investigated,which let to a useful computational method for the approximation solution of higher order linear differential equations with multipoint boundary value conditions.     

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

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

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

This paper discusses generalized interpolating splines which determined by n order linear differential operators, and the best operators of interpolating approximation in W_2~m spaces, The explicit constructive method for the reproducing kernel in W_2~m space is presented, and proves the uniformity of spline interpolating operators and the best operators of interpolating approximation W_2~m space by reproducing kernel. The explicit expression of approximation error on a bounded ball in W_2~m space, and error estimation of spline operator of approximation are obtained.     

Spline Approximation Methods with Uniform Meshes in Algebras of Multiplication and Convolution Operators

The purpose of this paper is to obtain necessary and sufficient conditions for maximum defect spline approximation methods with uniform meshes to be stable. The methods are applied to operators belonging to the closed subalgebra of ℒ︁ (L² (ℝ)) generated by operators of multiplication by piecewise continuous functions on ℝ and convolution operators also with piecewise continuousgenerating functions. To that purpose, a C*-algebra of sequences is introduced, which contains the special sequences of approximating operators we are interested in. There is a direct relationship between the applicability of the approximation method to a given operator and invertibility of the corresponding sequence in this C*-algebra. Exploring this relationship, applicability criteria are derived by the use of C*-algebra and Banach algebra techniques (essentialization, localization andidentification of the local algebras by means of construction of locally equivalent representations). Finally, examples are presented, including explicit conditions for the applicability of spline Galerkin methods to Wiener-Hopf operators with piecewise continuous symbols.     

二元三次样条空间S31,2(Δmn(2)) 的样条拟插值

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

Galerkin method for Wiener-Hopf operators with piecewise continuous symbol

This paper is concerned with the applicability of maximum defect polynomial (Galerkin) spline approximation methods with graded meshes to Wiener-Hopf operators with matrix-valued piecewise continuous generating function defined on R. For this, an algebra of sequences is introduced, which contains the approximating sequences we are interested in. There is a direct relationship between the stability of the approximation method for a given operator and invertibility of the corresponding sequence in this algebra. Exploring this relationship, the methods of essentialization, localization and identification of the local algebras are used in order to derive stability criteria for the approximation sequences.Supported by grant Praxis XXI/BD/4501/94 from FCT.Partly supported by FCT/BMFT grant 423.     

Average Error Bounds of Best Approximation of Continuous Functions on the Wiener Space

In this paper, we study the approximation of the identity operator and the integral operator T_m by Jackson operators, discrete Jackson operators, and spline operators, respectively, on the Wiener space and obtain average error estimation.     

Some extremal properties of multivariate polynomial splines in the metric Lp (Rd )

We constructed a kind of continuous multivariate spline operators as the approximation tools of the multivariate functions on the Bd instead of the usual multivariate cardinal interpolation oper-ators of splines, and obtained the approximation error by this kind of spline operators. Meantime, by the results, we also obtained that the spaces of multivariate polynomial splines are weakly asymptoti-cally optimal for the Kolmogorov widths and the linear widths of some anisotropic Sobolev classes of smooth functions on Bd in the metric Lp(Bd).     

Some extremal properties of multivariate polynomial splines in the metric Lp(ℝd)

We constructed a kind of continuous multivariate spline operators as the approximation tools of the multivariate functions on the (?^d instead of the usual multivariate cardinal interpolation operators of splines, and obtained the approximation error by this kind of spline operators. Meantime, by the results, we also obtained that the spaces of multivariate polynomial splines are weakly asyrnptotically optimal for the Kolrnogorov widths and the linear widths of some anisotropic Sobolev classes of smooth functions on (?^d in the metric L_p((?^d).     

On the approximation of eigenvalues associated with functional differential equations

In this paper an approximation method based upon spline functions is developed for the eigenvalue problem associated with functional differential equations. Convergence results are established and the rate of convergence is investigated. Numerical results for cubic and quintic spline based methods are given. The paper concludes with a brief discussion of other possible approximation methods.     

A SPLINE METHOD FOR SOLVING TWO-DIMENSIONAL FREDHOLM INTEGRAL EQUATION OF SECOND KIND WITH THE HYPERSINGULAR KERNEL

1. IntroductionIn recent years, the boundary element methods became a reliable and powerful numerical methods for solving the boundary value problems, such as elastoplasticitys etc. In thesemethods, the original problem is reduced to a boundary integral equation. For the one dimensional boundarys a lot of methods have been put forward recently. But for the two dimensionalboundary situation, it is not so easy to be done because the partition can be very complicated.Since P. Zwart obtained an …     

Some extremal properties of multivariate polynomial splines in the metric Lp(?d)

We constructed a kind of continuous multivariate spline operators as the approximation tools of the multivariate functions on the (ℝ^d instead of the usual multivariate cardinal interpolation operators of splines, and obtained the approximation error by this kind of spline operators. Meantime, by the results, we also obtained that the spaces of multivariate polynomial splines are weakly asyrnptotically optimal for the Kolrnogorov widths and the linear widths of some anisotropic Sobolev classes of smooth functions on (ℝ^d in the metric L_p((ℝ^d).     

Fast one-sided approximation with spline functions

For the approximation of functions, interpolation compromises approximation error for computational convenience. For a bounded interpolation operator the Lebesque inequality bounds the factor by which the interpolation differs from the best approximation available in the range of the operator. A comparable process for one-sided approximation is not readily apparent. Methods are suggested for the computationally economical construction of one-sided spline approximation to large classes of functions, and criteria for comparing such approximation operators are investigated. Since the operators are generally nonlinear the Lebesque inequality is invalidated as an aid for comparing with the best one-sided approximation in the range of the operator, but comparable inequalities are shown to exist in some cases.     

Near-Best Univariate Spline Discrete Quasi-Interpolants on Nonuniform Partitions

The univariate spline quasi-interpolants (QIs) studied in this paper are approximation operators using B-spline expansions with coefficients that are linear combinations of discrete values of the function to be approximated. When working with nonuniform partitions, the main challenge is to find QIs that have both good approximation orders and uniform norms which are bounded independently of the given partition. Near-best QIs are obtained by minimizing an upper bound for the infinity norm of QIs depending on a certain number of free parameters, thus reducing this norm. This paper is devoted to the study of some families of near-best discrete quasi-interpolants (dQIs) of approximation order 3.      

The spline collocation method for parabolic boundary integral equations on smooth curves

Summary. We consider the spline collocation method for a class of parabolic pseudodifferential operators. We show optimal order convergence results in a large scale of anisotropic Sobolev spaces. The results cover the classical boundary integral equations for the heat equation in the general case where the spatial domain has a smooth boundary in the plane. Our proof is based on a localization technique for which we use our recent results proved for parabolic pseudodifferential operators. For the localization we need also some special spline approximation results in anisotropic Sobolev spaces. Received May 17, 2001 / Revised version received February 19, 2002 / Published online April 17, 2002     

Sharp asymptotics of the <Emphasis Type="Italic">L</Emphasis><Subscript><Emphasis Type="Italic">p</Emphasis></Subscript> approximation error for interpolation on block partitions

Adaptive approximation (or interpolation) takes into account local variations in the behavior of the given function, adjusts the approximant depending on it, and hence yields the smaller error of approximation. The question of constructing optimal approximating spline for each function proved to be very hard. In fact, no polynomial time algorithm of adaptive spline approximation can be designed and no exact formula for the optimal error of approximation can be given. Therefore, the next natural question would be to study the asymptotic behavior of the error and construct asymptotically optimal sequences of partitions. In this paper we provide sharp asymptotic estimates for the error of interpolation by splines on block partitions in \mathbbR^d{\mathbb{R}^d} . We consider various projection operators to define the interpolant and provide the analysis of the exact constant in the asymptotics as well as its explicit form in certain cases.     

Dynamic programming and bicubic spline interpolation

Dynamic programming techniques were used to obtain the spline approximation for a function with prescribed values on the knot points along a line. Extending this procedure to two dimensions, the bicubic spline approximation defined over a two-dimensional region is obtained in this paper employing the methods of dynamic programming. A regular rectangular region as well as a region with irregular boundaries can be handled by this method, avoiding the difficulties of large storage and high dimensionality.     

On the cardinal spline interpolation corresponding to infinite order differential operators

This paper discusses some problems on the cardinal spline interpolation corresponding to infinite order differential operators. The remainder formulas and a dual theorem are established for some convolution classes, where the kernels arePF densities. Moreover, the exact error of approximation of a convolution class with interpolation cardinal splines is determined. The exact values of averagen-Kolmogorov widths are obtained for the convolution class. Supported in part by NSFC.     

Local spline approximation methods for singular product integration

The purpose of this paper is to propose and study local spline approximation methods for singular product integration, for which; i) the precision degree is the highest possible using spline approximation; ii) the nodes can be assumed equal to arbitrary points, where the integrand function f is known; iii) the number of the requested evaluations of f at the nodes is low; iv) a satis factory convergence theory can be proved. Work sponsored by “Ministero dell' University” and CNR of Italy     

On Spline Approximation for Singular Integral Equations on an Interval

This paper analyses the convergence of spline approximation methods for strongly elliptic singular integral equations on a finite interval. We consider collocation by smooth polynomial splines of odd degree multiplied by a weight function and a Galerkin-Petrov method with spline trial functions of even degree and piecewise constant test functions. We prove the stability of the methods in weighted Sobolev spaces and obtain the optimal orders of convergence in the case of graded meshes.