Randomized weakly admissible meshes

by   Yiming Xu, et al.

A weakly admissible mesh (WAM) on a continuum real-valued domain is a sequence of discrete grids such that the discrete maximum norm of polynomials on the grid is comparable to the supremum norm of polynomials on the domain. The asymptotic rate of growth of the grid sizes and of the comparability constant must grow in a controlled manner. In this paper we generalize the notion of a WAM to a hierarchical subspaces of not necessarily polynomial functions, and we analyze particular strategies for random sampling as a technique for generating WAMs. Our main results show that WAM's and their stronger variant, admissible meshes, can be generated by random sampling, and our analysis provides concrete estimates for growth of both the meshes and the discrete-continuum comparability constants.


page 1

page 2

page 3

page 4


On interpolation spaces of piecewise polynomials on mixed meshes

We consider fractional Sobolev spaces H^θ, θ∈ (0,1), on 2D domains and H...

The distribution of the L_4 norm of Littlewood polynomials

Classical conjectures due to Littlewood, Erdős and Golay concern the asy...

Extremal polynomials on the n-grid

The n-grid E_n consists of n equally spaced points in [-1,1] including t...

An arbitrary-order method for magnetostatics on polyhedral meshes based on a discrete de Rham sequence

In this work, we develop a discretisation method for the mixed formulati...

Asymptotic growth rate of square grids dominating sets: a symbolic dynamics approach

In this text, we prove the existence of an asymptotic growth rate of the...

A short note on inf-sup conditions for the Taylor-Hood family Q_k-Q_k-1

We discuss two types of discrete inf-sup conditions for the Taylor-Hood ...

Please sign up or login with your details

Forgot password? Click here to reset