On the existence of optimal meshes in every convex domain on the plane

DOI10.1016/j.jat.2017.02.004zbMath1408.41005OpenAlexW2599333814MaRDI QIDQ1711820

András Kroó

Publication date: 18 January 2019

Published in: Journal of Approximation Theory (Search for Journal in Brave)

Full work available at URL: http://real.mtak.hu/102406/1/existence.opt.m.pdf

zbMATH Keywords

multivariate polynomialsconvex bodiesoptimal meshestangential Bernstein inequalities

Mathematics Subject Classification ID

Inequalities in approximation (Bernstein, Jackson, Nikol'ski?-type inequalities) (41A17) Multidimensional problems (41A63)

Related Items (5)

𝐿^{𝑝}-Bernstein inequalities on 𝐶²-domains and applications to discretization ⋮ Sampling discretization and related problems ⋮ On discretizing uniform norms of exponential sums ⋮ On generalized least power approximation ⋮ Geometric computation of Christoffel functions on planar convex domains

Cites Work

• Unnamed Item
• Optimal polynomial admissible meshes on some classes of compact subsets of \(\mathbb{R}^d\)
• Polynomial approximation and cubature at approximate Fekete and Leja points of the cylinder
• On optimal polynomial meshes
• Uniform approximation by discrete least squares polynomials
• Markov-type inequalities for surface gradients of multivariate polynomials
• Weakly Admissible Meshes and Discrete Extremal Sets
• Polynomial interpolation and approximation in C^d
• Error estimates for scattered data interpolation on spheres
• Bernstein type inequalities on star-like domains in $${\mathbb{R }}^d$$ with application to norming sets

This page was built for publication: On the existence of optimal meshes in every convex domain on the plane