Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
107 tokens/sec
Gemini 2.5 Pro Premium
58 tokens/sec
GPT-5 Medium
29 tokens/sec
GPT-5 High Premium
25 tokens/sec
GPT-4o
101 tokens/sec
DeepSeek R1 via Azure Premium
84 tokens/sec
GPT OSS 120B via Groq Premium
478 tokens/sec
Kimi K2 via Groq Premium
213 tokens/sec
2000 character limit reached

Optimal Polynomial Admissible Meshes on Some Classes of Compact Subsets of $\R^d$ (1302.4718v6)

Published 19 Feb 2013 in math.NA

Abstract: We show that any compact subset of $\Rd$ which is the closure of a bounded star-shaped Lipschitz domain $\Omega$, such that $\complement \Omega$ has positive reach in the sense of Federer, admits an \emph{optimal AM} (admissible mesh), that is a sequence of polynomial norming sets with optimal cardinality. This extends a recent result of A. Kro\'o on $\mathscr C^ 2$ star-shaped domains. Moreover, we prove constructively the existence of an optimal AM for any $K := \overline\Omega \subset \R^ d$ where $\Omega$ is a bounded $\mathscr C{ 1,1}$ domain. This is done by a particular multivariate sharp version of the Bernstein Inequality via the distance function.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.

Authors (1)

Don't miss out on important new AI/ML research

See which papers are being discussed right now on X, Reddit, and more:

“Emergent Mind helps me see which AI papers have caught fire online.”

Philip

Philip

Creator, AI Explained on YouTube