Polynomial approximation via compressed sensing of high-dimensional functions on lower sets (Q4605704)

scientific article; zbMATH DE number 6843973

Language	Label	Description	Also known as
English	Polynomial approximation via compressed sensing of high-dimensional functions on lower sets	scientific article; zbMATH DE number 6843973

Statements

instance of

scholarly article

0 references

title

Polynomial approximation via compressed sensing of high-dimensional functions on lower sets (English)

0 references

published in

Mathematics of Computation

0 references

publication date

27 February 2018

0 references

full work available at URL

https://arxiv.org/abs/1602.05823

0 references

zbMATH Keywords

compressed sensing

0 references

high-dimensional methods

0 references

polynomial approximation

0 references

convex optimization

0 references

downward closed (lower) sets

0 references

describes a project that uses

SPGL1

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Convergence of quasi-optimal stochastic Galerkin methods for a class of PDES with random coefficients

0 references

Iterative hard thresholding for compressed sensing

0 references

An Improved Estimate in the Restricted Isometry Problem

0 references

Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information

0 references

Restricted Isometry of Fourier Matrices and List Decodability of Random Linear Codes

0 references

New explicit-in-dimension estimates for the cardinality of high-dimensional hyperbolic crosses and approximation of functions having mixed smoothness

0 references

Sparse adaptive Taylor approximation algorithms for parametric and stochastic elliptic PDEs

0 references

Discrete least squares polynomial approximation with random evaluations − application to parametric and stochastic elliptic PDEs

0 references

High-dimensional adaptive sparse polynomial interpolation and applications to parametric PDEs

0 references

Breaking the curse of dimensionality in sparse polynomial approximation of parametric PDEs

0 references

On the stability and accuracy of least squares approximations

0 references

Approximation of high-dimensional parametric PDEs

0 references

ANALYTIC REGULARITY AND POLYNOMIAL APPROXIMATION OF PARAMETRIC AND STOCHASTIC ELLIPTIC PDE'S

0 references

Discrete least-squares approximations over optimized downward closed polynomial spaces in arbitrary dimension

0 references

Compressed sensing

0 references

A non-adapted sparse approximation of PDEs with stochastic inputs

0 references

Sparse Recovery Algorithms: Sufficient Conditions in Terms of Restricted Isometry Constants

0 references

A mathematical introduction to compressive sensing

0 references

Recovering Compressively Sampled Signals Using Partial Support Information

0 references

Q3997987

0 references

An Adaptive Wavelet Stochastic Collocation Method for Irregular Solutions of Partial Differential Equations with Random Input Data

0 references

Compressive sampling of polynomial chaos expansions: convergence analysis and sampling strategies

0 references

The Restricted Isometry Property of Subsampled Fourier Matrices

0 references

REGULARITY AND GENERALIZED POLYNOMIAL CHAOS APPROXIMATION OF PARAMETRIC AND RANDOM SECOND-ORDER HYPERBOLIC PARTIAL DIFFERENTIAL EQUATIONS

0 references

Probability Inequalities for Sums of Bounded Random Variables

0 references

Approximation of mixed order Sobolev functions on the \(d\)-torus: asymptotics, preasymptotics, and \(d\)-dependence

0 references

A Compressed Sensing Approach for Partial Differential Equations with Random Input Data

0 references

Stochastic Collocation on Unstructured Multivariate Meshes

0 references

An Anisotropic Sparse Grid Stochastic Collocation Method for Partial Differential Equations with Random Input Data

0 references

A Sparse Grid Stochastic Collocation Method for Partial Differential Equations with Random Input Data

0 references

On polynomial chaos expansion via gradient-enhanced \(\ell_1\)-minimization

0 references

A weighted \(\ell_1\)-minimization approach for sparse polynomial chaos expansions

0 references

Impossibility of Fast Stable Approximation of Analytic Functions from Equispaced Samples

0 references

Q3078293

0 references

Low rank tensor recovery via iterative hard thresholding

0 references

Compressive sensing Petrov-Galerkin approximation of high-dimensional parametric operator equations

0 references

Sparse Legendre expansions via \(\ell_1\)-minimization

0 references

Interpolation via weighted \(\ell_{1}\) minimization

0 references

On sparse reconstruction from Fourier and Gaussian measurements

0 references

Probing the Pareto Frontier for Basis Pursuit Solutions

0 references

Modeling uncertainty in steady state diffusion problems via generalized polynomial chaos

0 references

STOCHASTIC COLLOCATION ALGORITHMS USING l1-MINIMIZATION

0 references

Reweighted \(\ell_1\) minimization method for stochastic elliptic differential equations

0 references

Identifiers

DOI

10.1090/mcom/3272

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:4605704