The decomposition-coordination method for the $p(x)$-Laplacian

Abstract

In this paper we construct two algorithms to approximate the minimizer of a discrete functional which comes from using a discontinuous Galerkin method for a variational problem related to the $p(x)$-Laplacian. We also make some numerical experiments in dimension two.

18 pages and 1 figure. arXiv admin note: text overlap with arXiv:1009.2063

References in corpus (2)

• $H^2$ regularity for the $p(x)-$Laplacian in two-dimensional convex domains
• Finite element approximation of the $p(\cdot )$-Laplacian