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

DOI10.4208/cicp.151110.090911azbMath1388.65018OpenAlexW2158829028MaRDI QIDQ4588703

Kyle A. Gallivan, Lionel Mathelin

Publication date: 27 October 2017

Published in: Communications in Computational Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4208/cicp.151110.090911a

Mathematics Subject Classification ID

Related Items (36)

Infinite-dimensional \(\ell ^1\) minimization and function approximation from pointwise data ⋮ Global sensitivity analysis based on high-dimensional sparse surrogate construction ⋮ Efficient uncertainty quantification of stochastic CFD problems using sparse polynomial chaos and compressed sensing ⋮ Infinite-dimensional compressed sensing and function interpolation ⋮ A weighted \(\ell_1\)-minimization approach for sparse polynomial chaos expansions ⋮ Compressive sampling of polynomial chaos expansions: convergence analysis and sampling strategies ⋮ Analysis of sparse recovery for Legendre expansions using envelope bound ⋮ Basis adaptive sample efficient polynomial chaos (BASE-PC) ⋮ A near-optimal sampling strategy for sparse recovery of polynomial chaos expansions ⋮ Multiscale stochastic preconditioners in non-intrusive spectral projection ⋮ Sparse Approximation using $\ell_1-\ell_2$ Minimization and Its Application to Stochastic Collocation ⋮ Polynomial approximation via compressed sensing of high-dimensional functions on lower sets ⋮ Stochastic Collocation vial₁-Minimisation on Low Discrepancy Point Sets with Application to Uncertainty Quantification ⋮ Towards optimal sampling for learning sparse approximation in high dimensions ⋮ A Compressive Spectral Collocation Method for the Diffusion Equation Under the Restricted Isometry Property ⋮ Surrogate-Based Ensemble Grouping Strategies for Embedded Sampling-Based Uncertainty Quantification ⋮ Coherence motivated sampling and convergence analysis of least squares polynomial chaos regression ⋮ Ensemble Grouping Strategies for Embedded Stochastic Collocation Methods Applied to Anisotropic Diffusion Problems ⋮ Sparse polynomial chaos expansions via compressed sensing and D-optimal design ⋮ A data-driven framework for sparsity-enhanced surrogates with arbitrary mutually dependent randomness ⋮ A compressed-sensing approach for closed-loop optimal control of nonlinear systems ⋮ Stochastic finite element methods for partial differential equations with random input data ⋮ A heterogeneous stochastic FEM framework for elliptic PDEs ⋮ Solving stochastic optimal control problems by a Wiener chaos approach ⋮ Enhancing \(\ell_1\)-minimization estimates of polynomial chaos expansions using basis selection ⋮ Spectral likelihood expansions for Bayesian inference ⋮ Sparse recovery in bounded Riesz systems with applications to numerical methods for PDEs ⋮ A mixed ℓ₁ regularization approach for sparse simultaneous approximation of parameterized PDEs ⋮ Divide and conquer: an incremental sparsity promoting compressive sampling approach for polynomial chaos expansions ⋮ An efficient multifidelity \(\ell_1\)-minimization method for sparse polynomial chaos ⋮ Gradient-based optimization for regression in the functional tensor-train format ⋮ New conditions on stable recovery of weighted sparse signals via weighted \(l_1\) minimization ⋮ Sparse Polynomial Chaos Expansions: Literature Survey and Benchmark ⋮ Learning ``best kernels from data in Gaussian process regression. With application to aerodynamics ⋮ Stochastic Collocation Algorithms Using $l_1$-Minimization for Bayesian Solution of Inverse Problems ⋮ Bi-fidelity reduced polynomial chaos expansion for uncertainty quantification

This page was built for publication: A Compressed Sensing Approach for Partial Differential Equations with Random Input Data