Weighted approximate Fekete points: sampling for least-squares polynomial approximation
From MaRDI portal
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.
Recommendations
- Constructing least-squares polynomial approximations
- Optimal weighted least-squares methods
- Multilevel weighted least squares polynomial approximation
- Least squares approximation of polynomial chaos expansions with optimized grid points
- Sequential sampling for optimal weighted least squares approximations in hierarchical spaces
Cites work
- A Christoffel function weighted least squares algorithm for collocation approximations
- A class of orthogonal polynomials
- A generalized sampling and preconditioning scheme for sparse approximation of polynomial chaos expansions
- A non-adapted sparse approximation of PDEs with stochastic inputs
- Adaptive Leja sparse grid constructions for stochastic collocation and high-dimensional approximation
- An Anisotropic Sparse Grid Stochastic Collocation Method for Partial Differential Equations with Random Input Data
- Analysis of discrete L^2 projection on polynomial spaces with random evaluations
- Approximation of quantities of interest in stochastic PDEs by the random discrete L^2 projection on polynomial spaces
- Compressive sampling of polynomial chaos expansions: convergence analysis and sampling strategies
- Computation of induced orthogonal polynomial distributions
- Computing approximate Fekete points by QR factorizations of Vandermonde matrices
- Computing multivariate Fekete and Leja points by numerical linear algebra
- Discrete least squares polynomial approximation with random evaluations - application to parametric and stochastic elliptic PDEs
- Generation and application of multivariate polynomial quadrature rules
- Geometric weakly admissible meshes, discrete least squares approximations and approximate Fekete points
- High-dimensional adaptive sparse polynomial interpolation and applications to parametric PDEs
- High-Order Collocation Methods for Differential Equations with Random Inputs
- scientific article; zbMATH DE number 49187 (Why is no real title available?)
- scientific article; zbMATH DE number 3477793 (Why is no real title available?)
- Minimizing the condition number to construct design points for polynomial regression models
- Multivariate Markov-type and Nikolskii-type inequalities for polynomials associated with downward closed multi-index sets
- Nonadaptive quasi-optimal points selection for least squares linear regression
- On Discrete Least-Squares Projection in Unbounded Domain with Random Evaluations and its Application to Parametric Uncertainty Quantification
- On sparse interpolation and the design of deterministic interpolation points
- On the calculation of approximate fekete points: the univariate case
- On the stability and accuracy of least squares approximations
- Optimal weighted least-squares methods
- Sparse grid collocation schemes for stochastic natural convection problems
- Stochastic collocation algorithms using _1-minimization
- Stochastic collocation methods on unstructured grids in high dimensions via interpolation
- Stochastic collocation on unstructured multivariate meshes
- The Wiener--Askey Polynomial Chaos for Stochastic Differential Equations
- Uniform approximation by discrete least squares polynomials
- Weighted discrete least-squares polynomial approximation using randomized quadratures
Cited in
(24)- On a near optimal sampling strategy for least squares polynomial regression
- Optimal design for kernel interpolation: applications to uncertainty quantification
- Optimal sampling and Christoffel functions on general domains
- Polynomial chaos expansions for dependent random variables
- Simultaneous identification of three parameters in a time-fractional diffusion-wave equation by a part of boundary Cauchy data
- Data-driven polynomial chaos expansions: a weighted least-square approximation
- Weighted Fekete points on the real line and the unit circle
- A gradient enhanced \(\ell_{1}\)-minimization for sparse approximation of polynomial chaos expansions
- A metalearning approach for physics-informed neural networks (PINNs): application to parameterized PDEs
- A Christoffel function weighted least squares algorithm for collocation approximations
- Optimal weighted least-squares methods
- Sequential sampling for optimal weighted least squares approximations in hierarchical spaces
- Near-optimal sampling strategies for multivariate function approximation on general domains
- Boosted optimal weighted least-squares
- Multilevel weighted least squares polynomial approximation
- Constructing least-squares polynomial approximations
- A reduced-basis polynomial-chaos approach with a multi-parametric truncation scheme for problems with uncertainties
- On the stability and accuracy of the empirical interpolation method and gravitational wave surrogates
- Good point sets and corresponding weights for bivariate discrete least squares approximation
- Least squares approximation of polynomial chaos expansions with optimized grid points
- Weighted Rectilinear Approximation of Points in the Plane
- Sensitivity-enhanced generalized polynomial chaos for efficient uncertainty quantification
- A high-order fast boundary element method with near-boundary stability for field emission from nanoscale structures
- Approximate Fekete points for weighted polynomial interpolation
This page was built for publication: Weighted approximate Fekete points: sampling for least-squares polynomial approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4603503)
