Add to ORKGGiven a planar compact set \u2126 where a weakly admissible mesh (WAM) is known, we compute WAMs and the corresponding discrete extremal sets for polynomial interpolation on solid (even truncated) cones with base \u2126 (with pyramids as a special case), and on solids corresponding to the rotation of \u2126 around an external coplanar axis by a given angle
The problem of interpolation on the unit sphere S by spherical polynomials of degree at most n i...
summary:We prove that eight dihedral angles in a pyramid with an arbitrary quadrilateral base always...
The problem of interpolation at (n + 1) points on the unit sphere S by spherical polynomials o...
Given a planar compact set Ω where a weakly admissible mesh (WAM) is known, we compute WAMs and the...
We present the software package WAM, written in Matlab, that generates Weakly Admissible Meshes and ...
We compute Chebyshev-like norming grids for polynomials on spherical triangles. The construction is ...
Weakly Admissible Meshes and their Discrete Extremal Sets (computed by basic numerical linear algebr...
AbstractWe construct symmetric polar WAMs (weakly admissible meshes) with low cardinality for least-...
A polynomial mesh on a multivariate compact set or manifold is a sequence of finite norming sets for...
AbstractWe have implemented a Matlab code to compute Discrete Extremal Sets (of Fekete and Leja type...
AbstractThis paper studies a generalization of polynomial interpolation: given a continuous function...
This article shows in detail how to construct in a simple and ordered way a set of rational function...
This monograph examines rotation sets under the multiplication by d (mod 1) map and their relation t...
We construct Weakly Admissible polynomial Meshes (WAMs) on circular sections, such as symmetric and ...
We give configurations of points which are proven to be univsolvent for polynomial interpolation
The problem of interpolation on the unit sphere S by spherical polynomials of degree at most n i...
summary:We prove that eight dihedral angles in a pyramid with an arbitrary quadrilateral base always...
The problem of interpolation at (n + 1) points on the unit sphere S by spherical polynomials o...
Given a planar compact set Ω where a weakly admissible mesh (WAM) is known, we compute WAMs and the...
We present the software package WAM, written in Matlab, that generates Weakly Admissible Meshes and ...
We compute Chebyshev-like norming grids for polynomials on spherical triangles. The construction is ...
Weakly Admissible Meshes and their Discrete Extremal Sets (computed by basic numerical linear algebr...
AbstractWe construct symmetric polar WAMs (weakly admissible meshes) with low cardinality for least-...
A polynomial mesh on a multivariate compact set or manifold is a sequence of finite norming sets for...
AbstractWe have implemented a Matlab code to compute Discrete Extremal Sets (of Fekete and Leja type...
AbstractThis paper studies a generalization of polynomial interpolation: given a continuous function...
This article shows in detail how to construct in a simple and ordered way a set of rational function...
This monograph examines rotation sets under the multiplication by d (mod 1) map and their relation t...
We construct Weakly Admissible polynomial Meshes (WAMs) on circular sections, such as symmetric and ...
We give configurations of points which are proven to be univsolvent for polynomial interpolation
The problem of interpolation on the unit sphere S by spherical polynomials of degree at most n i...
summary:We prove that eight dihedral angles in a pyramid with an arbitrary quadrilateral base always...
The problem of interpolation at (n + 1) points on the unit sphere S by spherical polynomials o...