Weighted approximate Fekete points: Sampling for least-squares polynomial approximation
arXiv:1708.01296
Abstract
We propose and analyze a weighted greedy scheme for computing deterministic sample configurations in multidimensional space for performing least-squares polynomial approximations on spaces weighted by a probability density function. Our procedure is a particular weighted version of the approximate Fekete points method, with the weight function chosen as the (inverse) Christoffel function. Our procedure has theoretical advantages: when linear systems with optimal condition number exist, the procedure finds them. In the one-dimensional setting with any density function, our greedy procedure almost always generates optimally-conditioned linear systems. Our method also has practical advantages: our procedure is impartial to compactness of the domain of approximation, and uses only pivoted linear algebraic routines. We show through numerous examples that our sampling design outperforms competing randomized and deterministic designs when the domain is both low and high dimensional.
arXiv comment21 pages, 11 figures
References in corpus (5)
- Coherence Motivated Sampling and Convergence Analysis of Least-Squares Polynomial Chaos Regression
- A Christoffel function weighted least squares algorithm for collocation approximations
- A generalized sampling and preconditioning scheme for sparse approximation of polynomial chaos expansions
- Stochastic collocation on unstructured multivariate meshes
- Generation and application of multivariate polynomial quadrature rules