The paper deals with polynomial interpolation, least-square approximation and cubature of functions defined on the rectangular cylinder, K=D 7[-1,1], with D the unit disk. The nodes used for these processes are the Approximate Fekete Points (AFP) and the Discrete Leja Points (DLP) extracted from suitable Weakly Admissible Meshes (WAMs) of the cylinder. From the analysis of the growth of the Lebesgue constants, approximation and cubature errors, we show that the AFP and the DLP extracted from WAM are good points for polynomial approximation and numerical integration of functions defined on the cylinde
For an interpolation process with algebraic polynomials of degree n on equidistant nodes of an m-sim...
summary:In current textbooks the use of Chebyshev nodes with Newton interpolation is advocated as th...
AbstractThis paper studies a generalization of polynomial interpolation: given a continuous function...
We present a brief survey on (Weakly) Admissible Meshes and corresponding Discrete Extremal Sets, na...
We present the software package WAM, written in Matlab, that generates Weakly Admissible Meshes and ...
AbstractWe have implemented a Matlab code to compute Discrete Extremal Sets (of Fekete and Leja type...
AbstractWe construct symmetric polar WAMs (weakly admissible meshes) with low cardinality for least-...
Firstly, we present new sets of nodes for {\em polynomial interpolation on the square} that are asym...
We discuss some theoretical aspects of the univariate case of the method recently introduced by Somm...
We discuss and compare two greedy algorithms, that compute discrete versions of Fekete-like points ...
Weakly Admissible Meshes and their Discrete Extremal Sets (computed by basic numerical linear algebr...
Fekete points are the points that maximize a Vandermonde-type determinant that appears in the polyno...
Firstly, we present new sets of nodes for polynomial interpolation on the square that are asymptotic...
Using the concept of Geometric Weakly Admissible Meshes together with an algorithm based on the clas...
This paper is concerned with Lagrange interpolation by total degree polynomials in moderate dimensio...
For an interpolation process with algebraic polynomials of degree n on equidistant nodes of an m-sim...
summary:In current textbooks the use of Chebyshev nodes with Newton interpolation is advocated as th...
AbstractThis paper studies a generalization of polynomial interpolation: given a continuous function...
We present a brief survey on (Weakly) Admissible Meshes and corresponding Discrete Extremal Sets, na...
We present the software package WAM, written in Matlab, that generates Weakly Admissible Meshes and ...
AbstractWe have implemented a Matlab code to compute Discrete Extremal Sets (of Fekete and Leja type...
AbstractWe construct symmetric polar WAMs (weakly admissible meshes) with low cardinality for least-...
Firstly, we present new sets of nodes for {\em polynomial interpolation on the square} that are asym...
We discuss some theoretical aspects of the univariate case of the method recently introduced by Somm...
We discuss and compare two greedy algorithms, that compute discrete versions of Fekete-like points ...
Weakly Admissible Meshes and their Discrete Extremal Sets (computed by basic numerical linear algebr...
Fekete points are the points that maximize a Vandermonde-type determinant that appears in the polyno...
Firstly, we present new sets of nodes for polynomial interpolation on the square that are asymptotic...
Using the concept of Geometric Weakly Admissible Meshes together with an algorithm based on the clas...
This paper is concerned with Lagrange interpolation by total degree polynomials in moderate dimensio...
For an interpolation process with algebraic polynomials of degree n on equidistant nodes of an m-sim...
summary:In current textbooks the use of Chebyshev nodes with Newton interpolation is advocated as th...
AbstractThis paper studies a generalization of polynomial interpolation: given a continuous function...