Modified Delaunay empty sphere condition in the problem of approximation of the gradient
Let \(P = \{p_j \in {\mathbb R}^n:\,j=1,\dots,n\}\) be given and let \(T\) be a triangulation of \(P\). If \(S\in T\) is a simplex with the vertices \(p_{j_k}\), \(k=0,\dots,n\), then \(f_S\) is the linear function with \(f(p_{j_k}) = f_S(p_{j_k})\), \(k=0,\dots,n\). Then the value \(\nabla f_S(x)\) is used as approximation of the gradient \(\nabla f(x)\) for all \(x\in S\). A triangulation \(T\) is called a Delaunay triangulation if the empty sphere condition holds, i.e., for every simplex \(S\in T\), no point of \(P\) lies inside its circumscribed sphere. \textit{V. A. Klyachin} and \textit{A. A. Shirokii} [Russ. Math. 56, No. 1, 27--34 (2012); translation from Izv. Vyssh. Uchebn. Zaved., Mat. 2012, No. 1, 31--39 (2012; Zbl 1254.68338)] have shown for \(n=2\) and for triangulations of \(\varepsilon\)-networks \(P\) that the error fulfills the estimate NEWLINE\[NEWLINE \max_{S\in T} \left( \max_{x\in S} | \nabla f (x) - \nabla f_S (x)|\right) \leq C(f)\, \varepsilon NEWLINE\]NEWLINE with a constant \(C(f)\) depending on \(f\). But for \(n\geq 3\), the empty sphere condition is not sufficient for such an estimate.NEWLINENEWLINEIn this paper, the author gives a modified empty sphere condition that guarantees such an estimate for arbitrary dimension \(n\geq 3\).
- scientific article; zbMATH DE number 2066953
- The Delaunay triangulation for multidimensional surfaces and its approximative properties
- Building triangulations using \({\epsilon}\)-nets
- Minimal roughness property of the Delaunay triangulation: A shorter approach
- Routing Properties of the Localized Delaunay Triangulation over Heterogeneous Ad-Hoc Wireless Networks
- Optimality of the Delaunay triangulation in \(\mathbb{R}^ d\)
- Nice point sets can have nasty Delaunay triangulations
- Isoperimetry coefficient for simplex in the problem of approximation of derivatives
- Optimization for first order Delaunay triangulations
- Nice point sets can have nasty Delaunay triangulations
- The Delaunay triangulation for multidimensional surfaces and its approximative properties
- Linear interpolation on a tetrahedron
- Description of functionals that are minimized by \(\Phi\)-triangulations
- C^1-approximation of the level surfaces of functions defined on irregular grids
- Hermite Interpolation on a Simplex
- On a multidimensional analogue of the Schwarz example
- Approximation of the gradient of a function on the basis of a special class of triangulations
- On Jamet's estimates for the finite element method with interpolation at uniform nodes of a simplex
- Isoperimetry coefficient for simplex in the problem of approximation of derivatives
- Triangulation method for approximate solving of variational problems in nonlinear elasticity
This page was built for publication: Modified Delaunay empty sphere condition in the problem of approximation of the gradient
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2821885)
