Sparse recovery in bounded Riesz systems with applications to numerical methods for PDEs

DOI10.1016/j.acha.2021.01.004zbMath1477.65197arXiv2005.06994OpenAlexW3128734291WikidataQ114214271 ScholiaQ114214271MaRDI QIDQ2036421

Simone Brugiapaglia, Sjoerd Dirksen, Hans Christian Jung, Holger Rauhut

Publication date: 29 June 2021

Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)

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

zbMATH Keywords

parallelizationcompressive sensinggeneric chainingrestricted isometry constantsnumerical PDEsbounded Riesz systemsCORSING method

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Random matrices (algebraic aspects) (15B52)

Related Items

On fast Johnson-Lindenstrauss embeddings of compact submanifolds of \(\mathbb{R}^N\) with boundary, Towards optimal sampling for learning sparse approximation in high dimensions, Sparse harmonic transforms. II: Best \(s\)-term approximation guarantees for bounded orthonormal product bases in sublinear-time

Cites Work

• Reweighted \(\ell_1\) minimization method for stochastic elliptic differential equations
• A mathematical introduction to compressive sensing
• Sparse Legendre expansions via \(\ell_1\)-minimization
• Orthogonal matching pursuit under the restricted isometry property
• A non-adapted sparse approximation of PDEs with stochastic inputs
• Explicit constructions of RIP matrices and related problems
• Random sampling of sparse trigonometric polynomials
• Analysis \(\ell_1\)-recovery with frames and Gaussian measurements
• Interpolation via weighted \(\ell_{1}\) minimization
• Sparse approximate solution of partial differential equations
• A Bennett concentration inequality and its application to suprema of empirical processes
• Infinite-dimensional compressed sensing and function interpolation
• Compressed solving: a numerical approximation technique for elliptic PDEs based on compressed sensing
• Correcting for unknown errors in sparse high-dimensional function approximation
• Compressive sensing Petrov-Galerkin approximation of high-dimensional parametric operator equations
• BREAKING THE COHERENCE BARRIER: A NEW THEORY FOR COMPRESSED SENSING
• New and Improved Johnson–Lindenstrauss Embeddings via the Restricted Isometry Property
• On sparse reconstruction from Fourier and Gaussian measurements
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Decoding by Linear Programming
• Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
• Wavelet Methods for Elliptic Partial Differential Equations
• A theoretical study of COmpRessed SolvING for advection-diffusion-reaction problems
• A Compressed Sensing Approach for Partial Differential Equations with Random Input Data
• Stable and Robust Sampling Strategies for Compressive Imaging
• Polynomial approximation via compressed sensing of high-dimensional functions on lower sets
• On the Gap Between Restricted Isometry Properties and Sparse Recovery Conditions
• Isometric sketching of any set via the Restricted Isometry Property
• On the Compressive Spectral Method
• An Improved Estimate in the Restricted Isometry Problem
• Sparse Recovery With Orthogonal Matching Pursuit Under RIP
• The Restricted Isometry Property of Subsampled Fourier Matrices
• Sparse Representation of a Polytope and Recovery of Sparse Signals and Low-Rank Matrices
• Upper and Lower Bounds for Stochastic Processes
• Restricted Isometry of Fourier Matrices and List Decodability of Random Linear Codes
• STOCHASTIC COLLOCATION ALGORITHMS USING l1-MINIMIZATION
• Compressed sensing
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item