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

DOI10.1090/MCOM/3113zbMath1358.65034arXiv1410.4929OpenAlexW2117302185MaRDI QIDQ2953202

Christoph Schwab, Holger Rauhut

Publication date: 4 January 2017

Published in: Mathematics of Computation (Search for Journal in Brave)

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

zbMATH Keywords

algorithmconvergencehigh-dimensional approximationcompressive sensingparametric diffusion equation\(s\)-term approximationaffine-parametric operator equationstensorized Chebyshev polynomial chaos approximation

Mathematics Subject Classification ID

Numerical solutions to equations with linear operators (65J10) Equations and inequalities involving linear operators, with vector unknowns (47A50)

Related Items (25)

Discrete least-squares approximations over optimized downward closed polynomial spaces in arbitrary dimension ⋮ Accelerating Stochastic Collocation Methods for Partial Differential Equations with Random Input Data ⋮ Infinite dimensional compressed sensing from anisotropic measurements and applications to inverse problems in PDE ⋮ A theoretical study of COmpRessed SolvING for advection-diffusion-reaction problems ⋮ TWO NEW LOWER BOUNDS FOR THE SPARK OF A MATRIX ⋮ Sampling numbers of smoothness classes via \(\ell^1\)-minimization ⋮ Sparse polynomial approximations for affine parametric saddle point problems ⋮ Analysis of sparse recovery for Legendre expansions using envelope bound ⋮ Correcting for unknown errors in sparse high-dimensional function approximation ⋮ Optimal approximation of infinite-dimensional holomorphic functions ⋮ Polynomial approximation via compressed sensing of high-dimensional functions on lower sets ⋮ A class of null space conditions for sparse recovery via nonconvex, non-separable minimizations ⋮ A sparse FFT approach for ODE with random coefficients ⋮ Towards optimal sampling for learning sparse approximation in high dimensions ⋮ A Compressive Spectral Collocation Method for the Diffusion Equation Under the Restricted Isometry Property ⋮ Sparse harmonic transforms: a new class of sublinear-time algorithms for learning functions of many variables ⋮ Sparse recovery in bounded Riesz systems with applications to numerical methods for PDEs ⋮ Domain Uncertainty Quantification in Computational Electromagnetics ⋮ Numerical solution of the parametric diffusion equation by deep neural networks ⋮ A mixed ℓ₁ regularization approach for sparse simultaneous approximation of parameterized PDEs ⋮ Multilevel approximation of parametric and stochastic PDES ⋮ Uncertainty Quantification Using Periodic Random Variables ⋮ Fast approximation by periodic kernel-based lattice-point interpolation with application in uncertainty quantification ⋮ Uncertainty Quantification for Spectral Fractional Diffusion: Sparsity Analysis of Parametric Solutions ⋮ Sparse polynomial chaos expansions using variational relevance vector machines

Uses Software

• CoSaMP
• ALEA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reweighted \(\ell_1\) minimization method for stochastic elliptic differential equations
• A weighted \(\ell_1\)-minimization approach for sparse polynomial chaos expansions
• Compressive sampling of polynomial chaos expansions: convergence analysis and sampling strategies
• A mathematical introduction to compressive sensing
• Sparse adaptive approximation of high dimensional parametric initial value problems
• On the stability and accuracy of least squares approximations
• High-dimensional adaptive sparse polynomial interpolation and applications to parametric PDEs
• Analysis of discrete \(L^2\) projection on polynomial spaces with random evaluations
• Sparse Legendre expansions via \(\ell_1\)-minimization
• Adaptive stochastic Galerkin FEM
• Breaking the curse of dimensionality in sparse polynomial approximation of parametric PDEs
• A non-adapted sparse approximation of PDEs with stochastic inputs
• Convergence rates of best \(N\)-term Galerkin approximations for a class of elliptic SPDEs
• Enhancing \(\ell_1\)-minimization estimates of polynomial chaos expansions using basis selection
• Interpolation via weighted \(\ell_{1}\) minimization
• The restricted isometry property and its implications for compressed sensing
• CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
• Dimension-adaptive tensor-product quadrature
• Fast algorithms for discrete polynomial transforms on arbitrary grids
• A first-order primal-dual algorithm for convex problems with applications to imaging
• Stability and instance optimality for Gaussian measurements in compressed sensing
• Analysis of quasi-optimal polynomial approximations for parameterized PDEs with deterministic and stochastic coefficients
• Adaptive wavelet methods for elliptic partial differential equations with random operators
• Analytic regularity and nonlinear approximation of a class of parametric semilinear elliptic PDEs
• A prioriconvergence of the Greedy algorithm for the parametrized reduced basis method
• Sparse, adaptive Smolyak quadratures for Bayesian inverse problems
• Multi-level Monte Carlo Finite Volume Methods for Uncertainty Quantification in Nonlinear Systems of Balance Laws
• QMC Galerkin Discretization of Parametric Operator Equations
• Subsampled Gauss Quadrature Nodes for Estimating Polynomial Chaos Expansions
• Space-time adaptive wavelet methods for parabolic evolution problems
• Nonequispaced Hyperbolic Cross Fast Fourier Transform
• ANALYTIC REGULARITY AND POLYNOMIAL APPROXIMATION OF PARAMETRIC AND STOCHASTIC ELLIPTIC PDE'S
• Tensor-Structured Galerkin Approximation of Parametric and Stochastic Elliptic PDEs
• Convergence Rates for Greedy Algorithms in Reduced Basis Methods
• A convergent adaptive stochastic Galerkin finite element method with quasi-optimal spatial meshes
• On sparse reconstruction from Fourier and Gaussian measurements
• Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
• Stability Results for Random Sampling of Sparse Trigonometric Polynomials
• A Sparse Grid Stochastic Collocation Method for Partial Differential Equations with Random Input Data
• An Anisotropic Sparse Grid Stochastic Collocation Method for Partial Differential Equations with Random Input Data
• Fast Discrete Polynomial Transforms with Applications to Data Analysis for Distance Transitive Graphs
• Quasi-Monte Carlo Finite Element Methods for a Class of Elliptic Partial Differential Equations with Random Coefficients
• ANALYTIC REGULARITY AND POLYNOMIAL APPROXIMATION OF STOCHASTIC, PARAMETRIC ELLIPTIC MULTISCALE PDEs
• Neural Network Learning
• DIMENSIONALITY REDUCTION FOR COMPLEX MODELS VIA BAYESIAN COMPRESSIVE SENSING
• Sparsity in Bayesian inversion of parametric operator equations
• Higher Order QMC Petrov--Galerkin Discretization for Affine Parametric Operator Equations with Random Field Inputs
• HIGH-ORDER GALERKIN APPROXIMATIONS FOR PARAMETRIC SECOND-ORDER ELLIPTIC PARTIAL DIFFERENTIAL EQUATIONS
• Sparse Representation of a Polytope and Recovery of Sparse Signals and Low-Rank Matrices
• Stable signal recovery from incomplete and inaccurate measurements

This page was built for publication: Compressive sensing Petrov-Galerkin approximation of high-dimensional parametric operator equations