Sparse approximate solution of partial differential equations
From MaRDI portal
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.
Recommendations
Cites work
- scientific article; zbMATH DE number 3644821 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A new polynomial-time algorithm for linear programming
- A semismooth Newton method for Tikhonov functionals with sparsity constraints
- Adaptive wavelet methods for elliptic operator equations: Convergence rates
- An introduction to frames and Riesz bases
- An optimal control approach to a posteriori error estimation in finite element methods
- Atomic Decomposition by Basis Pursuit
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Compressed sensing
- Compressed sensing and best \(k\)-term approximation
- Compressive sampling
- Decoding by Linear Programming
- Deterministic constructions of compressed sensing matrices
- Exact and approximate sparse solutions of underdetermined linear equations
- Finite Elements
- For most large underdetermined systems of equations, the minimal 𝓁1‐norm near‐solution approximates the sparsest near‐solution
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Greed is Good: Algorithmic Results for Sparse Approximation
- Inertia-revealing preconditioning for large-scale nonconvex constrained optimization
- Just relax: convex programming methods for identifying sparse signals in noise
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- Probing the Pareto frontier for basis pursuit solutions
- Quantitative robust uncertainty principles and optimally sparse decompositions
- Random sampling of sparse trigonometric polynomials
- Random sampling of sparse trigonometric polynomials. II: Orthogonal matching pursuit versus basis pursuit
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- Sparse Approximate Solutions to Linear Systems
- Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit
- Stability Results for Random Sampling of Sparse Trigonometric Polynomials
- Stable recovery of sparse overcomplete representations in the presence of noise
- Stable signal recovery from incomplete and inaccurate measurements
- The restricted isometry property and its implications for compressed sensing
- Tree approximation and optimal encoding
- Uncertainty principles and ideal atomic decomposition
- Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit
Cited in
(19)- scientific article; zbMATH DE number 3898147 (Why is no real title available?)
- 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
- Exploiting the sparsity in the solution of linear ordinary differential equations
- Sparse recovery in bounded Riesz systems with applications to numerical methods for PDEs
- A theoretical study of compressed solving for advection-diffusion-reaction problems
- Sparse dynamics for partial differential equations
- Solving shallow water equations by the sparse point representation method
- Grid structure impact in sparse point representation of derivatives
- Dynamic Sparsing in Stiff Extrapolation Methods
- A refinement and coarsening indicator algorithm for finding sparse solutions of inverse problems
- Finding a sparse solution of a class of linear differential equations by solving a nonlinear system
- Optimized general sparse grid approximation spaces for operator equations
- Compressive Algorithms—Adaptive Solutions of PDEs and Variational Problems
- PDEs with compressed solutions
- 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
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)
