Compressive sensing Petrov-Galerkin approximation of high-dimensional parametric operator equations
From MaRDI portal
Abstract: We analyze the convergence of compressive sensing based sampling techniques for the efficient evaluation of functionals of solutions for a class of high-dimensional, affine-parametric, linear operator equations which depend on possibly infinitely many parameters. The proposed algorithms are based on so-called "non-intrusive" sampling of the high-dimensional parameter space, reminiscent of Monte-Carlo sampling. In contrast to Monte-Carlo, however, a functional of the parametric solution is then computed via compressive sensing methods from samples of functionals of the solution. A key ingredient in our analysis of independent interest consists in a generalization of recent results on the approximate sparsity of generalized polynomial chaos representations (gpc) of the parametric solution families, in terms of the gpc series with respect to tensorized Chebyshev polynomials. In particular, we establish sufficient conditions on the parametric inputs to the parametric operator equation such that the Chebyshev coefficients of the gpc expansion are contained in certain weighted -spaces for . Based on this we show that reconstructions of the parametric solutions computed from the sampled problems converge, with high probability, at the , resp. convergence rates afforded by best -term approximations of the parametric solution up to logarithmic factors.
Recommendations
- Parametric PDEs: sparse or low-rank approximations?
- A compressed sensing approach for partial differential equations with random input data
- Compressive sensing with cross-validation and stop-sampling for sparse polynomial chaos expansions
- Multilevel approximation of parametric and stochastic PDES
- To be or not to be intrusive? The solution of parametric and stochastic equations -- proper generalized decomposition
Cites work
- \textit{A priori} convergence of the greedy algorithm for the parametrized reduced basis method
- A convergent adaptive stochastic Galerkin finite element method with quasi-optimal spatial meshes
- A first-order primal-dual algorithm for convex problems with applications to imaging
- A mathematical introduction to compressive sensing
- A non-adapted sparse approximation of PDEs with stochastic inputs
- A Sparse Grid Stochastic Collocation Method for Partial Differential Equations with Random Input Data
- A weighted _1-minimization approach for sparse polynomial chaos expansions
- Adaptive stochastic Galerkin FEM
- Adaptive wavelet methods for elliptic partial differential equations with random operators
- 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
- Analysis of quasi-optimal polynomial approximations for parameterized PDEs with deterministic and stochastic coefficients
- Analytic regularity and nonlinear approximation of a class of parametric semilinear elliptic PDEs
- Analytic regularity and polynomial approximation of parametric and stochastic elliptic PDE's
- Analytic regularity and polynomial approximation of stochastic, parametric elliptic multiscale PDEs
- Approximation theory and approximation practice
- Breaking the curse of dimensionality in sparse polynomial approximation of parametric PDEs
- Compressive sampling of polynomial chaos expansions: convergence analysis and sampling strategies
- Compressive sensing and structured random matrices
- Convergence rates for greedy algorithms in reduced basis methods
- Convergence rates of best \(N\)-term Galerkin approximations for a class of elliptic SPDEs
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Dimension-adaptive tensor-product quadrature
- Dimensionality reduction for complex models via Bayesian compressive sensing
- Enhancing \(\ell_1\)-minimization estimates of polynomial chaos expansions using basis selection
- Fast algorithms for discrete polynomial transforms on arbitrary grids
- Fast Discrete Polynomial Transforms with Applications to Data Analysis for Distance Transitive Graphs
- High-dimensional adaptive sparse polynomial interpolation and applications to parametric PDEs
- High-order Galerkin approximations for parametric second-order elliptic partial differential equations
- Higher order QMC Petrov-Galerkin discretization for affine parametric operator equations with random field inputs
- scientific article; zbMATH DE number 48688 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- Interpolation via weighted \(\ell_{1}\) minimization
- Multi-level Monte Carlo finite volume methods for uncertainty quantification in nonlinear systems of balance laws
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Neural Network Learning
- Nonequispaced Hyperbolic Cross Fast Fourier Transform
- On sparse reconstruction from Fourier and Gaussian measurements
- On the stability and accuracy of least squares approximations
- QMC Galerkin discretization of parametric operator equations
- Quasi-Monte Carlo finite element methods for a class of elliptic partial differential equations with random coefficients
- Reweighted \(\ell_1\) minimization method for stochastic elliptic differential equations
- Space-time adaptive wavelet methods for parabolic evolution problems
- Sparse adaptive approximation of high dimensional parametric initial value problems
- Sparse Legendre expansions via _1-minimization
- Sparse Representation of a Polytope and Recovery of Sparse Signals and Low-Rank Matrices
- Sparse, adaptive Smolyak quadratures for Bayesian inverse problems
- Sparsity in Bayesian inversion of parametric operator equations
- Stability and instance optimality for Gaussian measurements in compressed sensing
- Stability Results for Random Sampling of Sparse Trigonometric Polynomials
- Stable signal recovery from incomplete and inaccurate measurements
- Subsampled Gauss quadrature nodes for estimating polynomial chaos expansions
- Tensor-structured Galerkin approximation of parametric and stochastic elliptic PDEs
- The restricted isometry property and its implications for compressed sensing
Cited in
(29)- 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
- Numerical solution of the parametric diffusion equation by deep neural networks
- Fast approximation by periodic kernel-based lattice-point interpolation with application in uncertainty quantification
- A class of null space conditions for sparse recovery via nonconvex, non-separable minimizations
- A sparse FFT approach for ODE with random coefficients
- Discrete least-squares approximations over optimized downward closed polynomial spaces in arbitrary dimension
- Correcting for unknown errors in sparse high-dimensional function approximation
- Infinite dimensional compressed sensing from anisotropic measurements and applications to inverse problems in PDE
- Sparse polynomial approximations for affine parametric saddle point problems
- Accelerating stochastic collocation methods for partial differential equations with random input data
- A theoretical study of compressed solving for advection-diffusion-reaction problems
- Two new lower bounds for the spark of a matrix
- Polynomial approximation via compressed sensing of high-dimensional functions on lower sets
- Domain uncertainty quantification in computational electromagnetics
- Multilevel approximation of parametric and stochastic PDES
- A compressive spectral collocation method for the diffusion equation under the restricted isometry property
- A mixed ℓ1 regularization approach for sparse simultaneous approximation of parameterized PDEs
- Uncertainty Quantification Using Periodic Random Variables
- Uncertainty Quantification for Spectral Fractional Diffusion: Sparsity Analysis of Parametric Solutions
- Sampling numbers of smoothness classes via \(\ell^1\)-minimization
- Analysis of sparse recovery for Legendre expansions using envelope bound
- Optimal approximation of infinite-dimensional holomorphic functions
- Towards optimal sampling for learning sparse approximation in high dimensions
- Neural networks for singular perturbations
- Weighted sparsity and sparse tensor networks for least squares approximation
- Sparse spectral methods for solving high-dimensional and multiscale elliptic PDEs
- An efficient spatial discretization of spans of multivariate Chebyshev polynomials
- Sparse polynomial chaos expansions using variational relevance vector machines
This page was built for publication: Compressive sensing Petrov-Galerkin approximation of high-dimensional parametric operator equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2953202)
