NANAFeb 5, 2018

Discrete norming inequalities on sections of sphere, ball and torus

arXiv:1802.017116 citationsh-index: 27
Originality Synthesis-oriented
AI Analysis

Provides optimal norming meshes for polynomial approximation on curved domains, relevant to numerical analysis and approximation theory.

The paper constructs norming meshes with optimal cardinality growth for algebraic polynomials on sections of sphere, ball, and torus using discrete trigonometric norming inequalities on subintervals of the period.

By discrete trigonometric norming inequalities on subintervals of the period, we construct norming meshes with optimal cardinality growth for algebraic polynomials on sections of sphere, ball and torus.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes