Iterative solution of piecewise linear systems for the numerical solution of obstacle problems

Abstract

We investigate the use of piecewise linear systems, whose coefficient matrix is a piecewise constant function of the solution itself. Such systems arise, for example, from the numerical solution of linear complementarity problems and in the numerical solution of free-surface problems. In particular, we here study their application to the numerical solution of both the (linear) parabolic obstacle problem and the obstacle problem. We propose a class of effective semi-iterative Newton-type methods to find the exact solution of such piecewise linear systems. We prove that the semiiterative Newton-type methods have a global monotonic convergence property, i.e., the iterates converge monotonically to the exact solution in a finite number of steps. Numerical examples are presented to demonstrate the effectiveness of the proposed methods.

22 pages, 5 figures

Cited by in corpus (6)

• Space-time adaptive ADER discontinuous Galerkin finite element schemes with a posteriori sub-cell finite volume limiting
• Spectral semi-implicit and space-time discontinuous Galerkin methods for the incompressible Navier-Stokes equations on staggered Cartesian grids
• A semi-implicit hybrid finite volume / finite element scheme for all Mach number flows on staggered unstructured meshes
• An efficient semi-implicit method for three-dimensional non-hydrostatic flows in compliant arterial vessels
• Gradient schemes for the Signorini and the obstacle problems, and application to hybrid mimetic mixed methods
• A semi-smooth Newton method for a special piecewise linear system with application to positively constrained convex quadratic programming