相关论文: Local approximation operators on box meshes

Given an operator ideal I, a Banach space E has the I-approximation property if operators on E can be uniformly approximated on compact subsets of E by operators belonging to I. In this paper the I- approximation property is studied in…

Isogeometric analysis (IGA) enables exact representations of computational geometries and higher-order approximation of PDEs. In non-smooth domains, however, singularities near corners limit the effectiveness of IGA, since standard methods…

Polynomial meshes (called sometimes "norming sets") allow us to estimate the supremum norm of polynomials on a fixed compact set by the norm on its discrete subset. We give a general construction of polynomial weakly admissible meshes on…

We study approximation properties of weighted $L^2$-orthogonal projectors onto the space of polynomials of degree less than or equal to $N$ on the unit disk where the weight is of the generalized Gegenbauer form $x \mapsto…

In a recent work, we analyzed a weighted-residual error estimator for isogeometric boundary element methods in 2D and proposed an adaptive algorithm which steers the local mesh-refinement of the underlying partition as well as the…

We study integration and $L_2$-approximation on countable tensor products of function spaces of increasing smoothness. We obtain upper and lower bounds for the minimal errors, which are sharp in many cases including, e.g., Korobov, Walsh,…

This work is concerned with the formulation of a general framework for the analysis of meshfree approximation schemes and with the convergence analysis of the Local Maximum-Entropy (LME) scheme as a particular example. We provide conditions…

We show that product Chebyshev polynomial meshes can be used, in a fully discrete way, to evaluate with rigorous error bounds the Lebesgue constant, i.e. the maximum of the Lebesgue function, for a class of polynomial projectors on cube,…

We develop a constructive piecewise polynomial approximation theory in weighted Sobolev spaces with Muckenhoupt weights for any polynomial degree. The main ingredients to derive optimal error estimates for an averaged Taylor polynomial are…

Motivated by conforming finite element methods for elliptic problems of second order, we analyze the approximation of the gradient of a target function by continuous piecewise polynomial functions over a simplicial mesh. The main result is…

We study local approximation properties in hierarchical spline spaces through a twofold approach. First, we design and analyze a robust adaptive refinement algorithm to construct locally graded meshes. Second, we establish rigorous…

The main purpose of this paper is to prove some density results of polynomials in Fock spaces of slice regular functions. The spaces can be of two different kinds since they are equipped with different inner products and contain different…

We present a simple, general technique for reducing the sample complexity of matrix and tensor decomposition algorithms applied to distributions. We use the technique to give a polynomial-time algorithm for standard ICA with sample…

Geometric embeddings have recently received attention for their natural ability to represent transitive asymmetric relations via containment. Box embeddings, where objects are represented by n-dimensional hyperrectangles, are a particularly…

We construct admissible polynomial meshes on piecewise polynomial or trigonometric curves of the complex plane, by mapping univariate Chebyshev points. Such meshes can be used for polynomial least-squares, for the extraction of Fekete-like…

Given a finite Borel measure $\mu$ on R n and basic semi-algebraic sets $\Omega$\_i $\subset$ R n , i = 1,. .. , p, we provide a systematic numerical scheme to approximate as closely as desired $\mu$(\cup\_i $\Omega$\_i), when all moments…

We prove lower bounds on the error incurred when approximating any oscillating function using piecewise polynomial spaces. The estimates are explicit in the polynomial degree and have optimal dependence on the meshwidth and frequency when…

In this communication the advantages and drawbacks of the isogeometric analysis (IGA) are reviewed in the context of electromagnetic simulations. IGA extends the set of polynomial basis functions, commonly employed by the classical Finite…

Variable Muckenhoupt weights are considered in variable exponent Lebesgue spaces. Applications are given for polynomial approximation in these spaces. Boundedness of averaging operator is proved to gain a transference result. Almost all…

This paper offers a newly created integral approach for operators employing the orthogonal modified Laguerre polynomials and P\u{a}lt\u{a}nea basis. These operators approximate the functions over the interval $[0,\infty)$. Further, the…