Using the concept of Geometric Weakly Admissible Meshes together with an algorithm based on the classical QR factorization of matrices, we compute efficient points for discrete multivariate least squares approximation and Lagrange interpolation
Efficient and effective algorithms are designed to compute the coordinates of nearly optimal points ...
AbstractMultiquadric interpolation is a technique for interpolating nonuniform samples of multivaria...
International audienceIn this paper, we propose a low-rank approximation method based on discrete le...
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...
An algorithm is presented to compute good point sets and weights for discrete least squares polynomi...
We discuss and compare two greedy algorithms, that compute discrete versions of Fekete-like points ...
AbstractWe construct symmetric polar WAMs (weakly admissible meshes) with low cardinality for least-...
We discuss and compare two greedy algorithms, that compute discrete versions of Fekete-like points f...
We present the software package WAM, written in Matlab, that generates Weakly Admissible Meshes and ...
AbstractWe propose a numerical method (implemented in Matlab) for computing approximate Fekete point...
AbstractWe have implemented a Matlab code to compute Discrete Extremal Sets (of Fekete and Leja type...
The paper deals with polynomial interpolation, least-square approximation and cubature of functions ...
AbstractWe study uniform approximation of differentiable or analytic functions of one or several var...
We describe an algorithm for complex discrete least squares approximation, which turns out to be ver...
Efficient and effective algorithms are designed to compute the coordinates of nearly optimal points ...
AbstractMultiquadric interpolation is a technique for interpolating nonuniform samples of multivaria...
International audienceIn this paper, we propose a low-rank approximation method based on discrete le...
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...
An algorithm is presented to compute good point sets and weights for discrete least squares polynomi...
We discuss and compare two greedy algorithms, that compute discrete versions of Fekete-like points ...
AbstractWe construct symmetric polar WAMs (weakly admissible meshes) with low cardinality for least-...
We discuss and compare two greedy algorithms, that compute discrete versions of Fekete-like points f...
We present the software package WAM, written in Matlab, that generates Weakly Admissible Meshes and ...
AbstractWe propose a numerical method (implemented in Matlab) for computing approximate Fekete point...
AbstractWe have implemented a Matlab code to compute Discrete Extremal Sets (of Fekete and Leja type...
The paper deals with polynomial interpolation, least-square approximation and cubature of functions ...
AbstractWe study uniform approximation of differentiable or analytic functions of one or several var...
We describe an algorithm for complex discrete least squares approximation, which turns out to be ver...
Efficient and effective algorithms are designed to compute the coordinates of nearly optimal points ...
AbstractMultiquadric interpolation is a technique for interpolating nonuniform samples of multivaria...
International audienceIn this paper, we propose a low-rank approximation method based on discrete le...