Bernstein-type Operators on a Triangle with One Curved Side

We construct Bernstein-type operators on a triangle with one curved side. We study univariate operators, their product and Boolean sum, as well as their interpolation properties, the order of accuracy (degree of exactness, precision set) and the remainder of the corresponding approximation formulas. We also give some illustrative examples.     

A new multiquadric quasi‐interpolation operator with interpolation property

In this article, we discuss a class of multiquadric quasi‐interpolation operator that is primarily on the basis of Wu–Schaback's quasi‐interpolation operator and radial basis function interpolation. The proposed operator possesses the advantages of linear polynomial reproducing property, interpolation property, and high accuracy. It can be applied to construct flexible function approximation and scattered data fitting from numerical experiments. Copyright © 2013 John Wiley & Sons, Ltd.     

任意三角形域上的一种C~2插值方法

1.引言 平面上任意给出一组离散的数据点,经三角剖分后构成以三角形为基本单位的平面域,然后在每个三角形上进行插值,使之在这一平面域上达到一定的光滑连续阶。这一插值方法已经应用于CAGD和有限元,以及生物、医学、考古学等。1973年Barnhill等首次提出标准三角形(以(0,0),(1,0),(0,1)为顶点的三角形)上的插值逼近,他们构造     

Marcinkiewicz–Zygmund Inequalities and Polynomial Approximation from Scattered Data on SO(3)

We consider scattered data approximation problems on SO(3). To this end, we construct a new operator for polynomial approximation on the rotation group. This operator reproduces Wigner-D functions up to a given degree and has uniformly bounded L ^p -operator norm for all 1 ≤ p ≤ ∞. The operator provides a polynomial approximation with the same approximation degree of the best polynomial approximation. Moreover, the operator together with a Markov type inequality for Wigner-D functions enables us to derive scattered data L ^p -Marcinkiewicz–Zygmund inequalities for these functions for all 1 ≤ p ≤ ∞. As a major application of such inequalities, we consider the stability of the weighted least squares approximation problem on SO(3).     

Interpolation operators on a triangle with one curved side

We construct certain Lagrange, Hermite and Birkhoff-type operators, which interpolate a given function and some of its derivatives on the border of a triangle with one curved side, as well as some of their product and Boolean sum operators. We study the interpolation properties and the order of accuracy (degree of exactness and precision set) of the constructed operators, respectively the remainders of the corresponding interpolation formulas. Finally, we give some numerical examples.     

Bernstein-type operators on a triangle with all curved sides

We construct and analyze Bernstein-type operators on triangles with curved sides, their product and Boolean sum. We study the interpolation properties and approximation accuracy. Using the modulus of continuity we also study the remainders of the corresponding approximation formulas. Finally, there are given some particular cases and numerical examples.     

On a quadrature algorithm for the piecewise linear wavelet collocation applied to boundary integral equations

In this paper, we consider a piecewise linear collocation method for the solution of a pseudo‐differential equation of order r=0, ?1 over a closed and smooth boundary manifold. The trial space is the space of all continuous and piecewise linear functions defined over a uniform triangular grid and the collocation points are the grid points. For the wavelet basis in the trial space we choose the three‐point hierarchical basis together with a slight modification near the boundary points of the global patches of parametrization. We choose linear combinations of Dirac delta functionals as wavelet basis in the space of test functionals. For the corresponding wavelet algorithm, we show that the parametrization can be approximated by low‐order piecewise polynomial interpolation and that the integrals in the stiffness matrix can be computed by quadrature, where the quadrature rules are composite rules of simple low‐order quadratures. The whole algorithm for the assembling of the matrix requires no more than O(N [logN]³) arithmetic operations, and the error of the collocation approximation, including the compression, the approximative parametrization, and the quadratures, is less than O(N^?(2?r)/2). Note that, in contrast to well‐known algorithms by Petersdorff, Schwab, and Schneider, only a finite degree of smoothness is required. In contrast to an algorithm of Ehrich and Rathsfeld, no multiplicative splitting of the kernel function is required. Beside the usual mapping properties of the integral operator in low order Sobolev spaces, estimates of Calderón–Zygmund type are the only assumptions on the kernel function. Copyright © 2003 John Wiley & Sons, Ltd.     

<Emphasis Type="Italic">L</Emphasis><Superscript>2</Superscript>-error estimates for Dirichlet and Neumann problems on anisotropic finite element meshes

An L ²-estimate of the finite element error is proved for a Dirichlet and a Neumann boundary value problem on a three-dimensional, prismatic and non-convex domain that is discretized by an anisotropic tetrahedral mesh. To this end, an approximation error estimate for an interpolation operator that is preserving the Dirichlet boundary conditions is given. The challenge for the Neumann problem is the proof of a local interpolation error estimate for functions from a weighted Sobolev space.     

Green function of fourth-order differential operator with eigenparameter-dependent boundary and transmission conditions

We investigate a class of fourth-order regular differential operator with transmission conditions at an interior discontinuous point and the eigenparameter appears not only in the differential equation but also in the boundary conditions. We prove that the operator is symmetric, construct basic solutions of differential equation, and give the corresponding Green function of the operator is given.     

A two‐grid SA‐AMG convergence bound that improves when increasing the polynomial degree

In this paper, we consider the convergence rate of a smoothed aggregation algebraic multigrid method, which uses a simple polynomial (1 ? t)^ν or an optimal Chebyshev‐like polynomial to construct the smoother and prolongation operator. The result is purely algebraic, whereas a required main weak approximation property of the tentative interpolation operator is verified for a spectral element agglomeration version of the method. More specifically, we prove that, for partial differential equations (PDEs), the two‐grid method converges uniformly without any regularity assumptions. Moreover, the convergence rate improves uniformly when the degree of the polynomials used for the smoother and the prolongation increases. Such a result, as is well‐known, would imply uniform convergence of the multilevel W‐cycle version of the algorithm. Numerical results, for both PDE and non‐PDE (graph Laplacian) problems are presented to illustrate the theoretical findings. Published 2016. This article is a U.S. Government work and is in the public domain in the USA.     

一种修正的拟Grünwald插值在Orlicz空间内的逼近度

修正了以第二类Chebyshev多项式的零点为插值结点组的拟Grünwald插值多项式,使之转化为积分形式,并利用不等式技巧和Hardy-Littlewood极大函数的方法,研究了此积分型拟Grünwald插值算子在带权Orlicz空间内的逼近问题,得出了意义相对广泛的逼近度估计的结果.     

On the Parameter-Uniform Convergence of Exponential Spline Interpolation in the Presence of a Boundary Layer

The paper is concerned with the problem of generalized spline interpolation of functions having large-gradient regions. Splines of the class C², represented on each interval of the grid by the sum of a second-degree polynomial and a boundary layer function, are considered. The existence and uniqueness of the interpolation L-spline are proven, and asymptotically exact two-sided error estimates for the class of functions with an exponential boundary layer are obtained. It is established that the cubic and parabolic interpolation splines are limiting for the solution of the given problem. The results of numerical experiments are presented.     

一种修正的拟Grünwald插值在Orlicz空间内的逼近度

修正了以第二类Chebyshev多项式的零点为插值结点组的拟Grünwald插值多项式,使之转化为积分形式,并利用不等式技巧和Hardy-Littlewood极大函数的方法,研究了此积分型拟Grünwald插值算子在带权Orlicz空间内的逼近问题,得出了意义相对广泛的逼近度估计的结果.     

Multilevel preconditioning on the refined interface and optimal boundary solvers for the Laplace equation

In this paper we propose and analyze some strategies to construct asymptotically optimal algorithms for solving boundary reductions of the Laplace equation in the interior and exterior of a polygon. The interior Dirichlet or Neumann problems are, in fact, equivalent to a direct treatment of the Dirichlet-Neumann mapping or its inverse, i.e., the Poincaré-Steklov (PS) operator. To construct a fast algorithm for the treatment of the discrete PS operator in the case of polygons composed of rectangles and regular right triangles, we apply the Bramble-Pasciak-Xu (BPX) multilevel preconditioner to the equivalent interface problem in theH ^1/2-setting. Furthermore, a fast matrix-vector multiplication algorithm is based on the frequency cutting techniques applied to the local Schur complements associated with the rectangular substructures specifying the nonmatching decomposition of a given polygon. The proposed compression scheme to compute the action of the discrete interior PS operator is shown to have a complexity of the orderO(N log ^q N),q [2, 3], with memory needsO(N log² N), whereN is the number of degrees of freedom on the polygonal boundary under consideration. In the case of exterior problems we propose a modification of the standard direct BEM whose implementation is reduced to the wavelet approximation applied to either single layer or hypersingular harmonic potentials and, in addition, to the matrix-vector multiplication for the discrete interior PS operator.     

Approximating rational triangular Bézier surfaces by polynomial triangular Bézier surfaces

An attractive method for approximating rational triangular Bézier surfaces by polynomial triangular Bézier surfaces is introduced. The main result is that the arbitrary given order derived vectors of a polynomial triangular surface converge uniformly to those of the approximated rational triangular Bézier surface as the elevated degree tends to infinity. The polynomial triangular surface is constructed as follows. Firstly, we elevate the degree of the approximated rational triangular Bézier surface, then a polynomial triangular Bézier surface is produced, which has the same order and new control points of the degree-elevated rational surface. The approximation method has theoretical significance and application value: it solves two shortcomings-fussy expression and uninsured convergence of the approximation-of Hybrid algorithms for rational polynomial curves and surfaces approximation.     

A note on initial higher‐order convergence results for boundary element methods with approximated boundary conditions

We consider a variational problem associated with a pseudo‐differential operator of negative order 2s < 0 with an additional approximation of the given linear form. Such an approximation may correspond to an interpolation of given boundary conditions for a partial differential equation. The asymptotic order of convergence of the related Galerkin solution can be reached for ν = μ +2s, where ν and μ are the polynomial degrees of the trial functions used to approximate the solution and boundary conditions, respectively. The main result of this article is to prove that one can expect higher initial rates in the convergence behavior, even in the worst case of isoparametric approximations (ν = μ) when the error is measured in the Sobolev norm H^τ(Γ) with τ ∈ [s, 0]; i.e., this initial estimate is also valid in the energy norm ‖ · ‖. This result is based on the relation between the approximation error of the Galerkin solution without this additional approximation and the additional approximation error itself. As an illustration of the technique, an application of a boundary element method for the Dirichlet problem of a second‐order elliptic partial differential operator is given. Numerical examples confirm the theoretical results for this case. © 2000 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 16: 581–588, 2000.     

Pre-compactness of isospectral sets for the neumann operator on planar domains

The Neumann operator maps the boundary value of a harmonic function tc its normal derivative. The inverse spectral properties of the Neumann operator associated to smooth, planar, Jordan curves are studied. The Riemann mapping theorem is used tc parametrize the set of planar Jordan curves by positive functions on the unit circle. By studying the zeta function associated to the spectrum, it is shown that isospectral sets of these functions are pre-compact in the topology of the L²-Sobolev space of order 5/2 - [euro]. Spectral criteria are given for the limiting curves of an isospectral set to be Jordan. A spectrally determined lower bound on the area of the interior of the curve is given.     

Constrained multi-degree reduction of triangular Bézier surfaces using dual Bernstein polynomials

We propose a novel approach to the problem of multi-degree reduction of Bézier triangular patches with prescribed boundary control points. We observe that the solution can be given in terms of bivariate dual discrete Bernstein polynomials. The algorithm is very efficient thanks to using the recursive properties of these polynomials. The complexity of the method is O(n²m²), n and m being the degrees of the input and output Bézier surfaces, respectively. If the approximation—with appropriate boundary constraints—is performed for each patch of several smoothly joined triangular Bézier surfaces, the result is a composite surface of global C^r continuity with a prescribed order r. Some illustrative examples are given.     

Interpolation of cosine operator functions

Summary Using basic techniques from the theory of interpolation spaces equivalence theorems are established for the intermediate spaces between a given Banach space A and the domain D(^r) of the r-th power of the infinitesimal generator of a strongly continuous cosine operator function C. The results are applied to the study of second order evolution equations including regularity, order reduction and approximation by finite difference methods.     

On G 2 Continuous Spline Interpolation of Curves in ℝ d

In this paper the problem of G ² continuous interpolation of curves in ^d by polynomial splines of degree n is studied. The interpolation of the data points and two tangent directions at the boundary is considered. The case n = r + 2 = d, where r is the number of interior points interpolated by each segment of the spline curve, is studied in detail. It is shown that the problem is uniquely solvable asymptotically, e., when the data points are sampled regularly and sufficiently dense, and lie on a regular, convex parametric curve in ^d . In this case the optimal approximation order is also determined.