AbstractWe have implemented a Matlab code to compute Discrete Extremal Sets (of Fekete and Leja type) on convex or concave polygons, together with the corresponding interpolatory cubature formulas. The method works by QR and LU factorizations of rectangular Vandermonde matrices on Weakly Admissible Meshes (WAMs) of polygons, constructed by polygon quadrangulation
In this paper we establish the unisolvence of any interlacing pair of rectangular grids of points wi...
This paper describes a method for building interpolating or approximating implicit surfaces from pol...
We discuss and compare two greedy algorithms, that compute discrete versions of Fekete-like points f...
AbstractWe have implemented a Matlab code to compute Discrete Extremal Sets (of Fekete and Leja type...
We present the software package WAM, written in Matlab, that generates Weakly Admissible Meshes and ...
We present a brief survey on (Weakly) Admissible Meshes and corresponding Discrete Extremal Sets, na...
Weakly Admissible Meshes and their Discrete Extremal Sets (computed by basic numerical linear algebr...
AbstractWe propose a numerical method (implemented in Matlab) for computing approximate Fekete point...
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 ...
Given a planar compact set \u2126 where a weakly admissible mesh (WAM) is known, we compute WAMs and...
This paper is concerned with Lagrange interpolation by total degree polynomials in moderate dimensio...
The paper deals with polynomial interpolation, least-square approximation and cubature of functions ...
Using the concept of Geometric Weakly Admissible Meshes together with an algorithm based on the clas...
We present a stable and efficient Fortran implementation of polynomial interpolation at the “Padua p...
In this paper we establish the unisolvence of any interlacing pair of rectangular grids of points wi...
This paper describes a method for building interpolating or approximating implicit surfaces from pol...
We discuss and compare two greedy algorithms, that compute discrete versions of Fekete-like points f...
AbstractWe have implemented a Matlab code to compute Discrete Extremal Sets (of Fekete and Leja type...
We present the software package WAM, written in Matlab, that generates Weakly Admissible Meshes and ...
We present a brief survey on (Weakly) Admissible Meshes and corresponding Discrete Extremal Sets, na...
Weakly Admissible Meshes and their Discrete Extremal Sets (computed by basic numerical linear algebr...
AbstractWe propose a numerical method (implemented in Matlab) for computing approximate Fekete point...
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 ...
Given a planar compact set \u2126 where a weakly admissible mesh (WAM) is known, we compute WAMs and...
This paper is concerned with Lagrange interpolation by total degree polynomials in moderate dimensio...
The paper deals with polynomial interpolation, least-square approximation and cubature of functions ...
Using the concept of Geometric Weakly Admissible Meshes together with an algorithm based on the clas...
We present a stable and efficient Fortran implementation of polynomial interpolation at the “Padua p...
In this paper we establish the unisolvence of any interlacing pair of rectangular grids of points wi...
This paper describes a method for building interpolating or approximating implicit surfaces from pol...
We discuss and compare two greedy algorithms, that compute discrete versions of Fekete-like points f...
DOI
Add to ORKG