Add to ORKGWe compute approximate Fekete points for weighted polynomial interpolation, by a recent algorithm based on QR factorizations of Vandermonde matrices. We consider in particular the case of univariate and bivariate functions with prescribed poles or other singularities, which are absorbed in the basis by a weight function. Moreover, we apply the method to the construction of real and complex weighted polynomial filters, where the relevant concept is that of weighted norm
We discuss and compare two greedy algorithms, that compute discrete versions of Fekete-like points ...
We discuss some theoretical aspects of the univariate case of the method recently introduced by Somm...
This thesis deals with generalized inverses, multivariate polynomial interpolation and approximation...
We compute approximate Fekete points for weighted polynomial interpolation, by a recent algorithm ba...
AbstractWe propose a numerical method (implemented in Matlab) for computing approximate Fekete point...
Abstract. We develop a constructive piecewise polynomial approximation theory in weighted Sobolev sp...
Given a finite set of points X in R^n, one may ask for polynomials p which belong to a subspace V an...
Abstract. We develop a constructive piecewise polynomial approximation theory in weighted Sobolev sp...
Abstract. We consider the problem of interpolating sparse multivariate polynomials from their values...
We carefully develop a numerically sane algorithm for constructing polynomial least squares filters ...
We compute Chebyshev-like norming grids for polynomials on spherical triangles. The construction is ...
AbstractThis paper studies a generalization of polynomial interpolation: given a continuous function...
On one hand, consider the problem of finding global solutions to a polynomial optimization problem a...
AbstractWe give complexity estimates for the problems of evaluation and interpolation on various pol...
Firstly, we present new sets of nodes for polynomial interpolation on the square that are asymptotic...
We discuss and compare two greedy algorithms, that compute discrete versions of Fekete-like points ...
We discuss some theoretical aspects of the univariate case of the method recently introduced by Somm...
This thesis deals with generalized inverses, multivariate polynomial interpolation and approximation...
We compute approximate Fekete points for weighted polynomial interpolation, by a recent algorithm ba...
AbstractWe propose a numerical method (implemented in Matlab) for computing approximate Fekete point...
Abstract. We develop a constructive piecewise polynomial approximation theory in weighted Sobolev sp...
Given a finite set of points X in R^n, one may ask for polynomials p which belong to a subspace V an...
Abstract. We develop a constructive piecewise polynomial approximation theory in weighted Sobolev sp...
Abstract. We consider the problem of interpolating sparse multivariate polynomials from their values...
We carefully develop a numerically sane algorithm for constructing polynomial least squares filters ...
We compute Chebyshev-like norming grids for polynomials on spherical triangles. The construction is ...
AbstractThis paper studies a generalization of polynomial interpolation: given a continuous function...
On one hand, consider the problem of finding global solutions to a polynomial optimization problem a...
AbstractWe give complexity estimates for the problems of evaluation and interpolation on various pol...
Firstly, we present new sets of nodes for polynomial interpolation on the square that are asymptotic...
We discuss and compare two greedy algorithms, that compute discrete versions of Fekete-like points ...
We discuss some theoretical aspects of the univariate case of the method recently introduced by Somm...
This thesis deals with generalized inverses, multivariate polynomial interpolation and approximation...