A theoretical study of COmpRessed SolvING for advection-diffusion-reaction problems

DOI10.1090/mcom/3209zbMath1376.65127OpenAlexW1959436232MaRDI QIDQ4586610

Simone Brugiapaglia, Fabio Nobile, Stefano Micheletti, Simona Perotto

Publication date: 30 October 2017

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

Full work available at URL: https://doi.org/10.1090/mcom/3209

zbMATH Keywords

compressed sensingadvection-diffusion-reaction equationPetrov-Galerkin formulationlocal coherence\(\inf\)-\(\sup\) property

Mathematics Subject Classification ID

Reaction-diffusion equations (35K57) Finite element, Rayleigh-Ritz and Galerkin methods for initial value and initial-boundary value problems involving PDEs (65M60) Probabilistic methods, particle methods, etc. for initial value and initial-boundary value problems involving PDEs (65M75)

Related Items (7)

A priori error analysis of high-order LL* (FOSLL*) finite element methods ⋮ Infinite dimensional compressed sensing from anisotropic measurements and applications to inverse problems in PDE ⋮ Robust recovery of a kind of weighted l1-minimization without noise level ⋮ Analysis of sparse recovery for Legendre expansions using envelope bound ⋮ Compressive isogeometric analysis ⋮ A Compressive Spectral Collocation Method for the Diffusion Equation Under the Restricted Isometry Property ⋮ Sparse recovery in bounded Riesz systems with applications to numerical methods for PDEs

Uses Software

• PDCO
• CoSaMP
• ma2dfc

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The fractional Laplacian operator on bounded domains as a special case of the nonlocal diffusion operator
• Reweighted \(\ell_1\) minimization method for stochastic elliptic differential equations
• A weighted \(\ell_1\)-minimization approach for sparse polynomial chaos expansions
• A mathematical introduction to compressive sensing
• On the stability and accuracy of least squares approximations
• Sparse Legendre expansions via \(\ell_1\)-minimization
• A non-adapted sparse approximation of PDEs with stochastic inputs
• User-friendly tail bounds for sums of random matrices
• Hard thresholding pursuit algorithms: number of iterations
• Interpolation via weighted \(\ell_{1}\) minimization
• CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
• Matrix approach to discrete fractional calculus. II: Partial fractional differential equations
• On the multi-level splitting of finite element spaces
• Nonlinear methods of approximation
• Theory and practice of finite elements.
• Compressed solving: a numerical approximation technique for elliptic PDEs based on compressed sensing
• Compressive sensing Petrov-Galerkin approximation of high-dimensional parametric operator equations
• Hard Thresholding Pursuit: An Algorithm for Compressive Sensing
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Greed is Good: Algorithmic Results for Sparse Approximation
• Theory of adaptive finite element methods: An introduction
• Mixed and Hybrid Finite Element Methods
• Atomic Decomposition by Basis Pursuit
• Strong converse for identification via quantum channels
• Stable and Robust Sampling Strategies for Compressive Imaging
• Sparse Approximate Solutions to Linear Systems
• Matching pursuits with time-frequency dictionaries
• Adaptive Petrov--Galerkin Methods for First Order Transport Equations
• DIMENSIONALITY REDUCTION FOR COMPLEX MODELS VIA BAYESIAN COMPRESSIVE SENSING
• Discrete least squares polynomial approximation with random evaluations − application to parametric and stochastic elliptic PDEs
• Sparse Recovery With Orthogonal Matching Pursuit Under RIP
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
• An introduction to frames and Riesz bases
• Compressed sensing

This page was built for publication: A theoretical study of COmpRessed SolvING for advection-diffusion-reaction problems