A Christoffel function weighted least squares algorithm for collocation approximations
From MaRDI portal
Abstract: We propose, theoretically investigate, and numerically validate an algorithm for the Monte Carlo solution of least-squares polynomial approximation problems in a collocation frame- work. Our method is motivated by generalized Polynomial Chaos approximation in uncertainty quantification where a polynomial approximation is formed from a combination of orthogonal polynomials. A standard Monte Carlo approach would draw samples according to the density of orthogonality. Our proposed algorithm samples with respect to the equilibrium measure of the parametric domain, and subsequently solves a weighted least-squares problem, with weights given by evaluations of the Christoffel function. We present theoretical analysis to motivate the algorithm, and numerical results that show our method is superior to standard Monte Carlo methods in many situations of interest.
Recommendations
- Constructing least-squares polynomial approximations
- Weighted discrete least-squares polynomial approximation using randomized quadratures
- Optimal sampling and Christoffel functions on general domains
- Discrete least squares polynomial approximation with random evaluations - application to parametric and stochastic elliptic PDEs
- Weighted approximate Fekete points: sampling for least-squares polynomial approximation
Cites work
- A non-adapted sparse approximation of PDEs with stochastic inputs
- A survey of weighted polynomial approximation with exponential weights
- 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
- Asymptotics for Christoffel functions for general measures on the real line
- Asymptotics for Christoffel functions of planar measures
- Asymptotics for Christoffel functions with varying weights
- Asymptotics of the Christoffel functions on a simplex in \(\mathbb{R}^d\)
- Bergman kernels and equilibrium measures for line bundles over projective manifolds
- Bergman kernels for weighted polynomials and weighted equilibrium measures of $\mathbb{C}^{n}$
- Christoffel functions and Fourier series for multivariate orthogonal polynomials
- Christoffel functions and universality in the bulk for multivariate orthogonal polynomials
- Coherence motivated sampling and convergence analysis of least squares polynomial chaos regression
- Discrete least squares polynomial approximation with random evaluations - application to parametric and stochastic elliptic PDEs
- Fekete points and convergence towards equilibrium measures on complex manifolds
- Géza Freud, orthogonal polynomials and Christoffel functions. A case study
- High dimensional polynomial interpolation on sparse grids
- High-Order Collocation Methods for Differential Equations with Random Inputs
- scientific article; zbMATH DE number 1188845 (Why is no real title available?)
- scientific article; zbMATH DE number 52146 (Why is no real title available?)
- scientific article; zbMATH DE number 1077997 (Why is no real title available?)
- scientific article; zbMATH DE number 770285 (Why is no real title available?)
- Monge-Ampère measures for convex bodies and Bernstein-Markov type inequalities
- Multivariate discrete least-squares approximations with a new type of collocation grid
- Multivariate Markov-type and Nikolskii-type inequalities for polynomials associated with downward closed multi-index sets
- Numerical methods for stochastic computations. A spectral method approach.
- On Discrete Least-Squares Projection in Unbounded Domain with Random Evaluations and its Application to Parametric Uncertainty Quantification
- On the convergence of generalized polynomial chaos expansions
- On the convergence of optimal measures
- On the stability and accuracy of least squares approximations
- Sparse Legendre expansions via _1-minimization
- Stochastic collocation methods on unstructured grids in high dimensions via interpolation
- Stochastic collocation on unstructured multivariate meshes
- Supports of weighted equilibrium measures and examples
- The Complex Equilibrium Measure of a Symmetric Convex Set in R n
- The Homogeneous Chaos
- The Wiener--Askey Polynomial Chaos for Stochastic Differential Equations
- User-friendly tail bounds for sums of random matrices
- Weighted discrete least-squares polynomial approximation using randomized quadratures
- Weighted polynomials and weighted pluripotential theory
Cited in
(55)- An adaptive least-squares global sensitivity method and application to a plasma-coupled combustion prediction with parametric correlation
- Infinite-dimensional compressed sensing and function interpolation
- On a near optimal sampling strategy for least squares polynomial regression
- Computation of induced orthogonal polynomial distributions
- Pluripotential numerics
- Optimal pointwise sampling for \(L^2\) approximation
- Semi-algebraic approximation using Christoffel-Darboux kernel
- Randomized weakly admissible meshes
- Optimal design for kernel interpolation: applications to uncertainty quantification
- Optimal sampling and Christoffel functions on general domains
- A stochastic Galerkin method with adaptive time-stepping for the Navier-Stokes equations
- Polynomial chaos expansions for dependent random variables
- Adaptive weighted least-squares polynomial chaos expansion with basis adaptivity and sequential adaptive sampling
- Adaptive multi-fidelity polynomial chaos approach to Bayesian inference in inverse problems
- Data-driven polynomial chaos expansions: a weighted least-square approximation
- PLS-based adaptation for efficient PCE representation in high dimensions
- Some greedy algorithms for sparse polynomial chaos expansions
- Non-intrusive framework of reduced-order modeling based on proper orthogonal decomposition and polynomial chaos expansion
- Variance-based adaptive sequential sampling for polynomial chaos expansion
- Least squares polynomial chaos expansion: a review of sampling strategies
- A gradient enhanced \(\ell_{1}\)-minimization for sparse approximation of polynomial chaos expansions
- Basis adaptive sample efficient polynomial chaos (BASE-PC)
- Sparse polynomial approximations for affine parametric saddle point problems
- Stochastic collocation methods via \(\ell_1\) minimization using randomized quadratures
- Numerical integration in multiple dimensions with designed quadrature
- Weighted approximate Fekete points: sampling for least-squares polynomial approximation
- Multivariate approximation in downward closed polynomial spaces
- Sequential Design of Experiment for Sparse Polynomial Chaos Expansions
- Effectively subsampled quadratures for least squares polynomial approximations
- Optimal weighted least-squares methods
- Sparse polynomial chaos expansions: literature survey and benchmark
- 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
- APPROXIMATING SMOOTH, MULTIVARIATE FUNCTIONS ON IRREGULAR DOMAINS
- Constructing least-squares polynomial approximations
- A Gauss-Seidel type method for dynamic nonlinear complementarity problems
- Adaptive approximation by optimal weighted least-squares methods
- An adaptive minimum spanning tree multielement method for uncertainty quantification of smooth and discontinuous responses
- A randomized algorithm for multivariate function approximation
- A generalized sampling and preconditioning scheme for sparse approximation of polynomial chaos expansions
- Convergence of spectral likelihood approximation based on q-Hermite polynomials for Bayesian inverse problems
- Error guarantees for least squares approximation with noisy samples in domain adaptation
- Multifidelity uncertainty quantification with models based on dissimilar parameters
- On the reconstruction of functions from values at subsampled quadrature points
- Towards optimal sampling for learning sparse approximation in high dimensions
- Physics-informed polynomial chaos expansions
- S-OPT: a points selection algorithm for hyper-reduction in reduced order models
- Solving inverse acoustic obstacle scattering problem from phaseless far-field measurement using deep neural network surrogates
- Measure transport via polynomial density surrogates
- A multivariate Jacobi polynomials regression estimator associated with an ANOVA decomposition model
- Noise-robust multi-fidelity surrogate modelling for parametric partial differential equations
- Residual-Christoffel Sampling for Random Feature Collocation of Linear PDEs
- Polynomial-augmented neural networks (PANNs) with weak orthogonality constraints for enhanced function and PDE approximation
This page was built for publication: A Christoffel function weighted least squares algorithm for collocation approximations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2970106)
