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.     

A two-dimensional minimum-derivative spline

We consider the construction of a C ^(1,1) interpolation parabolic spline function of two variables on a uniform rectangular grid, i.e., a function continuous in a given region together with its first partial derivatives which on every partial grid rectangle is a polynomial of second degree in x and second degree in y. The spline function is constructed as a minimum-derivative one-dimensional quadratic spline in one of the variables, and the spline coefficients themselves are minimum-derivative quadratic spline functions of the other variable.     

Interpolation and convergence of Bernstein-Bézier coefficients

In this paper, two ways of the proof are given for the fact that the Bernstein-Bézier coefficients (BB-coefficients) of a multivariate polynomial converge uniformly to the polynomial under repeated degree elevation over the simplex. We show that the partial derivatives of the inverse Bernstein polynomial A _n (g) converge uniformly to the corresponding partial derivatives of g at the rate 1/n. We also consider multivariate interpolation for the BB-coefficients, and provide effective interpolation formulas by using Bernstein polynomials with ridge form which essentially possess the nature of univariate polynomials in computation, and show that Bernstein polynomials with ridge form with least degree can be constructed for interpolation purpose, and thus a computational algorithm is provided correspondingly.     

High-Dimensional Adaptive Sparse Polynomial Interpolation and Applications to Parametric PDEs

We consider the problem of Lagrange polynomial interpolation in high or countably infinite dimension, motivated by the fast computation of solutions to partial differential equations (PDEs) depending on a possibly large number of parameters which result from the application of generalised polynomial chaos discretisations to random and stochastic PDEs. In such applications there is a substantial advantage in considering polynomial spaces that are sparse and anisotropic with respect to the different parametric variables. In an adaptive context, the polynomial space is enriched at different stages of the computation. In this paper, we study an interpolation technique in which the sample set is incremented as the polynomial dimension increases, leading therefore to a minimal amount of PDE solving. This construction is based on the standard principle of tensorisation of a one-dimensional interpolation scheme and sparsification. We derive bounds on the Lebesgue constants for this interpolation process in terms of their univariate counterpart. For a class of model elliptic parametric PDE’s, we have shown in Chkifa et al. (Modél. Math. Anal. Numér. 47(1):253–280, 2013) that certain polynomial approximations based on Taylor expansions converge in terms of the polynomial dimension with an algebraic rate that is robust with respect to the parametric dimension. We show that this rate is preserved when using our interpolation algorithm. We also propose a greedy algorithm for the adaptive selection of the polynomial spaces based on our interpolation scheme, and illustrate its performance both on scalar valued functions and on parametric elliptic PDE’s.     

二元三方向剖分中B样条的B网结构与递推算法

§1.引言众所周知,de Boor-Con递推公式及微分-差分公式对于一元B样条的理论和应用极为重要。在多元样条中是否存在类似的结果,已成为近年来的研究课题。本文从B网结构出发,讨论三向剖分下不同次数样条空间的B样条之间的递推关系,指出不能简单地把函数形式的de Boor-Con公式搬到这里,然而可以在B网意义下实现递推。与一     

Direct sums of finitary permutation groups

The interpolation problem under consideration is connected with the finite element method in ?³. In most cases, when finite elements are constructed by means of the partition of a given domain in ?² into triangles and interpolation of the Hermite or Birkhoff type, the sine of the smallest angle of the triangle appears in the denominators of the error estimates for the derivatives. In the case of ? ^m (m ≥ 3), the ratio of the radius of the inscribed sphere to the diameter of the simplex is used as an analog of this characteristic. This makes it necessary to impose constraints on the triangulation of the domain. The recent investigations by a number of authors reveal that, in the case of triangles, the smallest angle in the error estimates for some interpolation processes can be replaced by the middle or the greatest one, which makes it possible to weaken the triangulation requirements. There are fewer works of this kind for m ≥ 3, and the error estimates are given there in terms of other characteristics of the simplex. In this paper, methods are suggested for constructing an interpolation third-degree polynomial on a simplex in ?³. These methods allow one to obtain estimates in terms of a new characteristic of a rather simple form and weaken the triangulation requirements.     

Regularity of lex-segment ideals: Some closed formulas and applications

A closed formula for computing the regularity of the lex-segment ideal in terms of the Hilbert function is given. This regularity bounds the one of any ideal with the same Hilbert function. As a consequence, we give explicit expressions to bound the regularity of a projective scheme in terms of the coefficients of the Hilbert polynomial.

We also characterize, in terms of their coefficients, which polynomials are Hilbert polynomials of some projective scheme.

Finally, we provide some applications to estimates for the maximal degree of generators of Gröbner bases in terms of the degrees of defining equations.

     

A remark on interpolation by bivariate splines

We study the determining set for bivariate spline spacesS _k ^o on type-1 triangulation of square using B-net techniques. We further construct the interpolation schemes for these spline spaces that are unisolvent for any function f of C^σ.     

ON TRIANGULAR C~1 SCHEMES: A NOVEL CONSTRUCTION

1. IntroductionThe smooth interpolation on a triangulation of a planar region is of great importancein most applied areas) such as computation of finite element method, computer aided(geometric) design and scattered data processing.Let A be a triangulation of a polygonal domain fi C RZ and Ac, al and aZ the setso f venices, edges and triangles in a respectively. Usually the triangulation in practiceis formed by a mass of scattered nodes that, covered by the region fi, are carryingsimilar typ…     

Newton–Hensel Interpolation Lifting

The main result of this paper is a new version of Newton-Hensel lifting that relates to interpolation questions. It allows one to lift polynomials in ℤ[x] from information modulo a prime number p ≠ 2 to a power p^k for any k, and its originality is that it is a mixed version that not only lifts the coefficients of the polynomial but also its exponents. We show that this result corresponds exactly to a Newton--Hensel lifting of a system of 2t generalized equations in 2t unknowns in the ring of p-adic integers ℤ_p. Finally, we apply our results to sparse polynomial interpolation in ℤ[x].     

Constructing C1 triangular patch of degree six by the Boolean sum of an approximation operator and an interpolation operator

A new method to construct C¹ triangular patches which satisfy the given boundary curves and cross-boundary slopes is presented. The Boolean sum of an approximation operator and an interpolation operator is employed to construct the triangular patch. The approximation operator is used to construct a polynomial patch of degree six. The polynomial of degree six affords more freedoms, which makes the approximation operator not only approximate the given boundary interpolation conditions but also have a better approximation precision in the interior of the triangle, so that the triangular patch has a better precision on both the boundary and the interior of the triangular domain. The interpolation operator is utilized to build an interpolation patch which satisfies the given boundary conditions. The Boolean sum of the approximation and interpolation patches forms the triangular patch. Comparison results of the new method with other three methods are given.     

A new formulation of Bernstein-Bezier based smoothness conditions forpp functions

In this note, we establish a new formulation of smoothness conditions for piecewise polynomial (: =pp) functions in terms of the B-net representation in the general n-dimensional setting. It plays an important role for 2-dimensional setting in the constructive proof of the fact that the spaces of polynomial splines with smoothness r and total degree k≥3r+2 over arbitrary triangulations achieve the optimal approximation order with the approximation constant depending only on k and the smallest angle of the partition in [5].     

Grid structure impact in sparse point representation of derivatives

In the Sparse Point Representation (SPR) method the principle is to retain the function data indicated by significant interpolatory wavelet coefficients, which are defined as interpolation errors by means of an interpolating subdivision scheme. Typically, a SPR grid is coarse in smooth regions, and refined close to irregularities. Furthermore, the computation of partial derivatives of a function from the information of its SPR content is performed in two steps. The first one is a refinement procedure to extend the SPR by the inclusion of new interpolated point values in a security zone. Then, for points in the refined grid, such derivatives are approximated by uniform finite differences, using a step size proportional to each point local scale. If required neighboring stencils are not present in the grid, the corresponding missing point values are approximated from coarser scales using the interpolating subdivision scheme. Using the cubic interpolation subdivision scheme, we demonstrate that such adaptive finite differences can be formulated in terms of a collocation scheme based on the wavelet expansion associated to the SPR. For this purpose, we prove some results concerning the local behavior of such wavelet reconstruction operators, which stand for SPR grids having appropriate structures. This statement implies that the adaptive finite difference scheme and the one using the step size of the finest level produce the same result at SPR grid points. Consequently, in addition to the refinement strategy, our analysis indicates that some care must be taken concerning the grid structure, in order to keep the truncation error under a certain accuracy limit. Illustrating results are presented for 2D Maxwell’s equation numerical solutions.     

Least Frobenius norm updating of quadratic models that satisfy interpolation conditions

Quadratic models of objective functions are highly useful in many optimization algorithms. They are updated regularly to include new information about the objective function, such as the difference between two gradient vectors. We consider the case, however, when each model interpolates some function values, so an update is required when a new function value replaces an old one. We let the number of interpolation conditions, m say, be such that there is freedom in each new quadratic model that is taken up by minimizing the Frobenius norm of the second derivative matrix of the change to the model. This variational problem is expressed as the solution of an (m+n+1)×(m+n+1) system of linear equations, where n is the number of variables of the objective function. Further, the inverse of the matrix of the system provides the coefficients of quadratic Lagrange functions of the current interpolation problem. A method is presented for updating all these coefficients in ({m+n}²) operations, which allows the model to be updated too. An extension to the method is also described that suppresses the constant terms of the Lagrange functions. These techniques have a useful stability property that is investigated in some numerical experiments.     

Construction of interpolation splines minimizing semi-norm in W_{2}^{(m,m-1)}(0,1) space

In the present paper using S.L. Sobolev’s method interpolation splines minimizing the semi-norm in a Hilbert space are constructed. Explicit formulas for coefficients of interpolation splines are obtained. The obtained interpolation spline is exact for polynomials of degree m?2 and e ^?x . Also some numerical results are presented.     

一元B样条的B网观点

1.问题的提出 近年来,多元样条的研究进程表明,从多变量的观点重新认识一元样条的理论是很有必要的.本文运用重心坐标,以近代的B网方法为工具,重新探讨一元分片多项式的结构,进而为研究多元样条提供工具. 假设Q_n(t)是给定的分割:     

Irreducibility of Hypersurfaces

Given a polynomial P in several variables over an algebraically closed field, we show that except in some special cases that we fully describe, if one coefficient is allowed to vary, then the polynomial is irreducible for all but at most deg(P)² ? 1 values of the coefficient. We more generally handle the situation where several specified coefficients vary.     

A new non‐polynomial univariate interpolation formula of Hermite type

A new C ^∞ interpolant is presented for the univariate Hermite interpolation problem. It differs from the classical solution in that the interpolant is of non‐polynomial nature. Its basis functions are a set of simple, compact support, transcendental functions. The interpolant can be regarded as a truncated Multipoint Taylor series. It has essential singularities at the sample points, but is well behaved over the real axis and satisfies the given functional data. The interpolant converges to the underlying real‐analytic function when (i) the number of derivatives at each point tends to infinity and the number of sample points remains finite, and when (ii) the spacing between sample points tends to zero and the number of specified derivatives at each sample point remains finite. A comparison is made between the numerical results achieved with the new method and those obtained with polynomial Hermite interpolation. In contrast with the classical polynomial solution, the new interpolant does not suffer from any ill conditioning, so it is always numerically stable. In addition, it is a much more computationally efficient method than the polynomial approach. This revised version was published online in June 2006 with corrections to the Cover Date.     

A Family of Approximation Formulas and some Applications

The general scheme, suggested in [1] using a basis of an infinite-dimensional space and allowing to construct finite-dimensional orthogonal systems and interpolation formulas, is improved in the paper. This results particularly in a generalization of the well-known scheme by which periodic interpolatory wavelets are constructed. A number of systems which do not satisfy all the conditions for multiresolution analysis but have some useful properties are introduced and investigated.

Starting with general constructions in Hilbert spaces, we give a more careful consideration to the case connected with the classic Fourier basis.

Convergence of expansions which are similar to partial sums of the summation method of Fourier series, as well as convergence of interpolation formulas are considered.

Some applications to fast calculation of Fourier coefficients and to solution of integrodifferential equations are given. The corresponding numerical results have been obtained by means of MATHEMATICA 3.0 system.     

On branched continued fractions rational interpolation over pyramid-typed grids

In this paper, three-term recurrence relations for branched continued fractions are determined. Based on the algorithm of partial inverse differences in tensor-product-like manner, the finite branched continued fractions can be applied to rational interpolation over pyramid-typed grids in R ³. By means of the three-term recurrence relations, a characterization theorem is valid. Then an error estimation is worked out. Based on the relationship between the partial inverse differences and partial reciprocal ones, and the partial reciprocal derivatives as well, the BCFs osculatory interpolation with its algorithm is stated which shows it feasibility of partial derivable functions in BCFs expansion at one point.