Sadegh Jokar, Volker Mehrmann, Marc Pfetsch, Harry Yserentant
Published 2008-04-05, updated 2009-02-26Version 2
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.
Normal Systems of Algebraic and Partial Differential Equations
Numerical valuation of Bermudan basket options via partial differential equations
Trusting Computations: a Mechanized Proof from Partial Differential Equations to Actual Program
![QR code for arXiv:0804.0864 [math.NA]](http://oss.arxitics.com/images/favicon.svg)