Numerical study of optimal partitioning problems in relation to an anisotropic perimeter
classification
🧮 math.OC
keywords
numericalanisotropicproblemsallowsanisotropiesapproximationconvergencedensity
read the original abstract
We present a ${\Gamma}$-convergence approximation for the total anisotropic length of a partition. This theoretical result gives rise to a numerical method which allows the study of minimal partitions with respect to different anisotropies. We also give a numerical framework for the study of isoperimetric problems with density.
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.