4,336 research outputs found

    PDEs with Compressed Solutions

    Get PDF
    Sparsity plays a central role in recent developments in signal processing, linear algebra, statistics, optimization, and other fields. In these developments, sparsity is promoted through the addition of an L1L^1 norm (or related quantity) as a constraint or penalty in a variational principle. We apply this approach to partial differential equations that come from a variational quantity, either by minimization (to obtain an elliptic PDE) or by gradient flow (to obtain a parabolic PDE). Also, we show that some PDEs can be rewritten in an L1L^1 form, such as the divisible sandpile problem and signum-Gordon. Addition of an L1L^1 term in the variational principle leads to a modified PDE where a subgradient term appears. It is known that modified PDEs of this form will often have solutions with compact support, which corresponds to the discrete solution being sparse. We show that this is advantageous numerically through the use of efficient algorithms for solving L1L^1 based problems.Comment: 21 pages, 15 figure

    Unsaturated subsurface flow with surface water and nonlinear in- and outflow conditions

    Get PDF
    We analytically and numerically analyze groundwater flow in a homogeneous soil described by the Richards equation, coupled to surface water represented by a set of ordinary differential equations (ODE's) on parts of the domain boundary, and with nonlinear outflow conditions of Signorini's type. The coupling of the partial differential equation (PDE) and the ODE's is given by nonlinear Robin boundary conditions. This article provides two major new contributions regarding these infiltration conditions. First, an existence result for the continuous coupled problem is established with the help of a regularization technique. Second, we analyze and validate a solver-friendly discretization of the coupled problem based on an implicit-explicit time discretization and on finite elements in space. The discretized PDE leads to convex spatial minimization problems which can be solved efficiently by monotone multigrid. Numerical experiments are provided using the DUNE numerics framework.Comment: 34 pages, 5 figure
    • …
    corecore