Sparse approximate solution of partial differential equations
From MaRDI portal
Publication:972312
DOI10.1016/J.APNUM.2009.10.003zbMATH Open1220.65170arXiv0804.0864OpenAlexW1980524824MaRDI QIDQ972312FDOQ972312
Authors: Sadegh Jokar, Volker Mehrmann, Marc E. Pfetsch, Harry Yserentant 
Publication date: 25 May 2010
Published in: Applied Numerical Mathematics (Search for Journal in Brave)
Abstract: A new concept is introduced for the adaptive finite element discretization of partial differential equations that have a sparsely representable solution. Motivated by recent work on compressed sensing, a recursive mesh refinement procedure is presented that uses linear programming to find a good approximation to the sparse solution on a given refinement level. Then only those parts of the mesh are refined that belong to large expansion coefficients. Error estimates for this procedure are refined and the behavior of the procedure is demonstrated via some simple elliptic model problems.
Full work available at URL: https://arxiv.org/abs/0804.0864
Recommendations
linear programmingcompressed sensingpartial differential equationrestricted isometry propertysparse solutionmutual incoherencedictionaryhierarchical basis
Numerical mathematical programming methods (65K05) Computational methods for sparse matrices (65F50) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50)
Cites Work
- Probing the Pareto frontier for basis pursuit solutions
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Atomic Decomposition by Basis Pursuit
- A new polynomial-time algorithm for linear programming
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- Compressive sampling
- Decoding by Linear Programming
- Stable recovery of sparse overcomplete representations in the presence of noise
- Just relax: convex programming methods for identifying sparse signals in noise
- Stable signal recovery from incomplete and inaccurate measurements
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Title not available (Why is that?)
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
- Compressed sensing
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit
- Compressed sensing and best \(k\)-term approximation
- Greed is Good: Algorithmic Results for Sparse Approximation
- Uncertainty principles and ideal atomic decomposition
- Title not available (Why is that?)
- Sparse Approximate Solutions to Linear Systems
- An introduction to frames and Riesz bases
- An optimal control approach to a posteriori error estimation in finite element methods
- Adaptive wavelet methods for elliptic operator equations: Convergence rates
- The restricted isometry property and its implications for compressed sensing
- Inertia-revealing preconditioning for large-scale nonconvex constrained optimization
- Deterministic constructions of compressed sensing matrices
- Exact and approximate sparse solutions of underdetermined linear equations
- Finite Elements
- A semismooth Newton method for Tikhonov functionals with sparsity constraints
- Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit
- Random sampling of sparse trigonometric polynomials. II: Orthogonal matching pursuit versus basis pursuit
- Stability Results for Random Sampling of Sparse Trigonometric Polynomials
- Random sampling of sparse trigonometric polynomials
- Quantitative robust uncertainty principles and optimally sparse decompositions
- Tree approximation and optimal encoding
- For most large underdetermined systems of equations, the minimal 𝓁1‐norm near‐solution approximates the sparsest near‐solution
Cited In (19)
- Compressive Algorithms—Adaptive Solutions of PDEs and Variational Problems
- Grid structure impact in sparse point representation of derivatives
- Pass-efficient methods for compression of high-dimensional turbulent flow data
- A theoretical study of compressed solving for advection-diffusion-reaction problems
- Finding a sparse solution of a class of linear differential equations by solving a nonlinear system
- Compressed solving: a numerical approximation technique for elliptic PDEs based on compressed sensing
- Solving shallow water equations by the sparse point representation method
- PDEs with compressed solutions
- Sparse recovery in bounded Riesz systems with applications to numerical methods for PDEs
- A refinement and coarsening indicator algorithm for finding sparse solutions of inverse problems
- Title not available (Why is that?)
- A compressive spectral collocation method for the diffusion equation under the restricted isometry property
- Optimized general sparse grid approximation spaces for operator equations
- Exploiting the sparsity in the solution of linear ordinary differential equations
- Sparse dynamics for partial differential equations
- Dynamic Sparsing in Stiff Extrapolation Methods
- Robust and optimal sparse regression for nonlinear PDE models
- A priori sparsification of Galerkin models
- Sparse finite element approximation of high-dimensional transport-dominated diffusion problems
Uses Software
This page was built for publication: Sparse approximate solution of partial differential equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q972312)
