Polynomial approximation and quadrature on geographic rectangles

Using some recent results on subperiodic trigonometric interpolation and quadrature, and the theory of admissible meshes for multivariate polynomial approximation, we study product Gaussian quadrature, hyperinterpolation and interpolation on some regions of dS,d ≥ 2. Such regions include caps, zones, slices and more generally spherical rectangles defined on S2 by longitude and (co)latitude (geographic rectangles). We provide the corresponding Matlab codes and discuss several numerical examples on S

Subperiodic trigonometric subsampling: A numerical approach

We show that Gauss-Legendre quadrature applied to trigonometric poly- nomials on subintervals of the period can be competitive with subperiodic trigonometric Gaussian quadrature. For example with intervals correspond- ing to few angular degrees, relevant for regional scale models on the earth surface, we see a subsampling ratio of one order of magnitude already at moderate trigonometric degrees

Numerical hyperinterpolation over nonstandard planar regions

We discuss an algorithm (implemented in Matlab) that computes numerically total-degree bivariate orthogonal polynomials (OPs) given an algebraic cubature formula with positive weights, and constructs the orthogonal projection (hyperinterpolation) of a function sampled at the cubature nodes. The method is applicable to nonstandard regions where OPs are not known analytically, for example convex and concave polygons, or circular sections such as sectors, lenses and lunes

Subperiodic Dubiner distance, norming meshes and trigonometric polynomial optimization

We extend the notion of Dubiner distance from algebraic to trigonometric polynomials on subintervals of the period, and we obtain its explicit form by the Szego variant of Videnskii inequality. This allows to improve previous estimates for Chebyshev-like trigonometric norming meshes, and suggests a possible use of such meshes in the framework of multivariate polynomial optimization on regions defined by circular arcs

An elementary approach to polynomial optimization on polynomial meshes

A polynomial mesh on a multivariate compact set or manifold is a sequence of finite norming sets for polynomials whose norming constant is independent of degree. We apply the recently developed theory of polynomial meshes to an elementary discrete approach for polynomial optimization on nonstandard domains, providing a rigorous (over)estimate of the convergence rate. Examples include surface/solid subregions of sphere or torus, such as caps, lenses, lunes, and slices

Computing the Region Areas of Euler Diagrams Drawn with Three Ellipses

Ellipses generate accurate area-proportional Euler diagrams for more data than is possible with circles. However, computing the region areas is difficult as ellipses have various degrees of freedom. Numerical methods could be used, but approximation errors are introduced. Current analytic methods are limited to computing the area of only two overlapping ellipses, but area-proportional Euler diagrams in diverse application areas often have three curves. This paper provides an overview of different methods that could be used to compute the region areas of Euler diagrams drawn with ellipses. We also detail two novel analytic algorithms to instantaneously compute the exact region areas of three general overlapping ellipses. One of the algorithms decomposes the region of interest into ellipse segments, while the other uses integral calculus. Both methods perform equally well with respect to accuracy and time

On "marcov" inequalities

As colleagues and friends we wish to dedicate these pages to Marco Vianello on the occasion of his 60th birthday, which is on October 26, 2021. Marco has made many important contributions to approximation theory and beyond. Here we briefly summarize some of them in the spirit of the occasion

Discrete norming inequalities on sections of sphere, ball and torus

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

Discrete norming inequalities on sections of sphere, ball and torus

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