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

preprint2014arXivOpen access

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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Write a reviewWrite

No reviews yet.

Add a commentWrite

No comments yet.

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

Abstract

Connections

Building this map preview

Reviews 0

Discussion 0

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

Abstract

Connections

Building this map preview

Reviews 0

Discussion 0

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