On Sparse Interpolation and the Design of Deterministic Interpolation Points

DOI10.1137/13094596XzbMath1304.65098arXiv1308.6038MaRDI QIDQ2930008

Zhiqiang Xu, Tao Zhou

Publication date: 17 November 2014

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1308.6038

zbMATH Keywords

numerical experimentsmultidimensional interpolationpolynomial approximationsuncertainty quantificationcompressed sensing\(\ell_1\) minimization

Mathematics Subject Classification ID

Numerical interpolation (65D05) Multidimensional problems (41A63) Interpolation in approximation theory (41A05) Approximation by polynomials (41A10)

Related Items (20)

Reconstruction of Sparse Polynomials via Quasi-Orthogonal Matching Pursuit Method ⋮ Subsampling bias and the best-discrepancy systematic cross validation ⋮ A sparse grid stochastic collocation method for elliptic interface problems with random input ⋮ Weighted discrete least-squares polynomial approximation using randomized quadratures ⋮ A General Framework of Rotational Sparse Approximation in Uncertainty Quantification ⋮ Entropy stable Galerkin methods with suitable quadrature rules for hyperbolic systems with random inputs ⋮ Infinite-dimensional compressed sensing and function interpolation ⋮ The Recovery Guarantee for Orthogonal Matching Pursuit Method to Reconstruct Sparse Polynomials ⋮ An outlier detection and recovery method based on moving least squares quasi-interpolation scheme and \(\text{ł}_0\)-minimization problem ⋮ A gradient enhanced \(\ell_{1}\)-minimization for sparse approximation of polynomial chaos expansions ⋮ Weighted Approximate Fekete Points: Sampling for Least-Squares Polynomial Approximation ⋮ Stochastic Collocation Methods via $\ell_1$ Minimization Using Randomized Quadratures ⋮ Stochastic Collocation vial₁-Minimisation on Low Discrepancy Point Sets with Application to Uncertainty Quantification ⋮ Uncertainty Quantification of Derivative Instruments ⋮ Towards optimal sampling for learning sparse approximation in high dimensions ⋮ An adaptive WENO collocation method for differential equations with random coefficients ⋮ A Gradient-Enhanced L1 Approach for the Recovery of Sparse Trigonometric Polynomials ⋮ On Interpolation Approximation: Convergence Rates for Polynomial Interpolation for Functions of Limited Regularity ⋮ Enhancing sparsity of Hermite polynomial expansions by iterative rotations ⋮ Stochastic Collocation Algorithms Using $l_1$-Minimization for Bayesian Solution of Inverse Problems

This page was built for publication: On Sparse Interpolation and the Design of Deterministic Interpolation Points