Sparse approximate solution of partial differential equations

DOI10.1016/J.APNUM.2009.10.003zbMath1220.65170arXiv0804.0864OpenAlexW1980524824MaRDI QIDQ972312

Harry Yserentant, Marc E. Pfetsch, Volker Mehrmann, Sadegh Jokar

Publication date: 25 May 2010

Published in: Applied Numerical Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

linear programmingpartial differential equationcompressed sensingrestricted isometry propertysparse solutionmutual incoherencedictionaryhierarchical basis

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Numerical mathematical programming methods (65K05) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50)

Related Items (4)

Pass-efficient methods for compression of high-dimensional turbulent flow data ⋮ A Compressive Spectral Collocation Method for the Diffusion Equation Under the Restricted Isometry Property ⋮ Compressed solving: a numerical approximation technique for elliptic PDEs based on compressed sensing ⋮ Sparse recovery in bounded Riesz systems with applications to numerical methods for PDEs

Uses Software

• PDCO
• SPGL1
• CoSaMP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new polynomial-time algorithm for linear programming
• Random sampling of sparse trigonometric polynomials
• The restricted isometry property and its implications for compressed sensing
• CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
• Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit
• Random sampling of sparse trigonometric polynomials. II: Orthogonal matching pursuit versus basis pursuit
• Deterministic constructions of compressed sensing matrices
• Quantitative robust uncertainty principles and optimally sparse decompositions
• Compressed sensing and best 𝑘-term approximation
• An optimal control approach to a posteriori error estimation in finite element methods
• A semismooth Newton method for Tikhonov functionals with sparsity constraints
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Decoding by Linear Programming
• Stable recovery of sparse overcomplete representations in the presence of noise
• Greed is Good: Algorithmic Results for Sparse Approximation
• Just relax: convex programming methods for identifying sparse signals in noise
• Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
• Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
• Probing the Pareto Frontier for Basis Pursuit Solutions
• Inertia-Revealing Preconditioning For Large-Scale Nonconvex Constrained Optimization
• Stability Results for Random Sampling of Sparse Trigonometric Polynomials
• From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
• Atomic Decomposition by Basis Pursuit
• Adaptive wavelet methods for elliptic operator equations: Convergence rates
• Uncertainty principles and ideal atomic decomposition
• Sparse Approximate Solutions to Linear Systems
• Exact and Approximate Sparse Solutions of Underdetermined Linear Equations
• Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit
• Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ ¹ minimization
• For most large underdetermined systems of linear equations the minimal 𝓁₁‐norm solution is also the sparsest solution
• For most large underdetermined systems of equations, the minimal 𝓁₁‐norm near‐solution approximates the sparsest near‐solution
• Stable signal recovery from incomplete and inaccurate measurements
• Compressed sensing
• Finite Elements
• An introduction to frames and Riesz bases
• Tree approximation and optimal encoding

This page was built for publication: Sparse approximate solution of partial differential equations