We construct Weakly Admissible polynomial Meshes (WAMs) on circular sections, such as symmetric and asymmetric circular sectors, circular segments, zones, lenses and lunes. The construction resorts to recent results on subperiodic trigonometric interpolation. The paper is accompanied by a software package to perform polynomial fitting and interpolation at discrete extremal sets on such regions
Efficient and effective algorithms are designed to compute the coordinates of nearly optimal points ...
A polynomial mesh on a multivariate compact set or manifold is a sequence of finite norming sets for...
In order to predict the effective properties of heterogeneous materials using the finite element app...
We present the software package WAM, written in Matlab, that generates Weakly Admissible Meshes and ...
By discrete trigonometric norming inequalities on subintervals of the period, we construct norming m...
Using some recent results on subperiodic trigonometric interpolation and quadrature, and the theor...
AbstractWe construct symmetric polar WAMs (weakly admissible meshes) with low cardinality for least-...
AbstractWe have implemented a Matlab code to compute Discrete Extremal Sets (of Fekete and Leja type...
A polynomial of degree n in z~l and n- 1 in z is defined by an interpolation projection I', fro...
We extend the notion of Dubiner distance from algebraic to trigonometric polynomials on subintervals...
AbstractThis paper studies a generalization of polynomial interpolation: given a continuous function...
Given a planar compact set Ω where a weakly admissible mesh (WAM) is known, we compute WAMs and the...
A polynomial mesh on a multivariate compact set or manifold is a sequence of finite norming sets for...
We compute low-cardinality algebraic cubature formulas on convex or concave polygonal elements with ...
We compute Chebyshev-like norming grids for polynomials on spherical triangles. The construction is ...
Efficient and effective algorithms are designed to compute the coordinates of nearly optimal points ...
A polynomial mesh on a multivariate compact set or manifold is a sequence of finite norming sets for...
In order to predict the effective properties of heterogeneous materials using the finite element app...
We present the software package WAM, written in Matlab, that generates Weakly Admissible Meshes and ...
By discrete trigonometric norming inequalities on subintervals of the period, we construct norming m...
Using some recent results on subperiodic trigonometric interpolation and quadrature, and the theor...
AbstractWe construct symmetric polar WAMs (weakly admissible meshes) with low cardinality for least-...
AbstractWe have implemented a Matlab code to compute Discrete Extremal Sets (of Fekete and Leja type...
A polynomial of degree n in z~l and n- 1 in z is defined by an interpolation projection I', fro...
We extend the notion of Dubiner distance from algebraic to trigonometric polynomials on subintervals...
AbstractThis paper studies a generalization of polynomial interpolation: given a continuous function...
Given a planar compact set Ω where a weakly admissible mesh (WAM) is known, we compute WAMs and the...
A polynomial mesh on a multivariate compact set or manifold is a sequence of finite norming sets for...
We compute low-cardinality algebraic cubature formulas on convex or concave polygonal elements with ...
We compute Chebyshev-like norming grids for polynomials on spherical triangles. The construction is ...
Efficient and effective algorithms are designed to compute the coordinates of nearly optimal points ...
A polynomial mesh on a multivariate compact set or manifold is a sequence of finite norming sets for...
In order to predict the effective properties of heterogeneous materials using the finite element app...