The decomposition-coordination method for the p(x)-Laplacian
classification
🧮 math.NA
cs.NA
keywords
laplacianmethodalgorithmsapproximatecomesconstructdecomposition-coordinationdimension
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.