Optimal polynomial meshes and Carathéodory-Tchakaloff submeshes on the sphere

MaRDI QIDQ5355337zbMATH OpenFDO

Authors Paul C. Leopardi, Alvise Sommariva, Marco Vianello

Publication date 7 September 2017

Full work available at URL https://arxiv.org/abs/1612.04952, http://www.emis.de/journals/DRNA/4-3.html

Mathematics Subject Classification ID

Multidimensional problems (41A63) Approximation by polynomials (41A10)

Abstract: Using the notion of Dubiner distance, we give an elementary proof of the fact that good covering point configurations on the 2-sphere are optimal polynomial meshes. From these we extract Caratheodory-Tchakaloff (CATCH) submeshes for compressed Least Squares fitting.

Recommendations

• Caratheodory-Tchakaloff Subsampling
• Near G-optimal Tchakaloff designs
• Near-optimal polynomial interpolation on spherical triangles
• Tchakaloff polynomial meshes
• On optimal polynomial meshes

Cited in

(7)

• Global polynomial optimization by norming sets on sphere and torus
• Tchakaloff polynomial meshes
• On extremal functions and V. Markov type polynomial inequality for certain subsets of \({\mathbb{R}}^N\)
• On optimal polynomial meshes
• Near G-optimal Tchakaloff designs
• Nearly optimal nested sensors location for polynomial regression on complex geometries
• Markov and Division Inequalities on Algebraic Sets

Describes a project that uses

Uses Software

• eqsp
• CAAsoft
• CPLEX
• Matlab

This page was built for publication: Optimal polynomial meshes and Carathéodory-Tchakaloff submeshes on the sphere

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5355337)