Approximation of Partitions of Least Perimeter by Γ-Convergence: Around Kelvin’s Conjecture

From MaRDI portal
Revision as of 07:34, 8 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4915389


DOI10.1080/10586458.2011.565233zbMath1261.49009OpenAlexW2060636973WikidataQ122960854 ScholiaQ122960854MaRDI QIDQ4915389

Edouard Oudet

Publication date: 10 April 2013

Published in: Experimental Mathematics (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.em/1317924419



Related Items

Longest minimal length partitions, An isoperimetric problem for three-dimensional parallelohedra, Consistency of modularity clustering on random geometric graphs, Unconditionally energy stable time stepping scheme for Cahn-Morral equation: application to multi-component spinodal decomposition and optimal space tiling, Unnamed Item, A metric-based approach to multiphase mean curvature flows with mobilities, A minimal surface criterion for graph partitioning, Multimaterial topology optimization by volume constrained Allen-Cahn system and regularized projected steepest descent method, Optimal design of multiphase composites under elastodynamic loading, Approximation of multiphase mean curvature flows with arbitrary nonnegative mobilities, A Modica-Mortola approximation for the Steiner problem, Minimal partitions and image classification using a gradient-free perimeter approximation, A Modica-Mortola approximation for branched transport and applications, Multiphase mean curvature flows with high mobility contrasts: a phase-field approach, with applications to nanowires, Qualitative and Numerical Analysis of a Spectral Problem with Perimeter Constraint, Variational approximation of interface energies and applications, Phase field approach to optimal packing problems and related Cheeger clusters, Phase-field modelling and computing for a large number of phases, Learning phase field mean curvature flows with neural networks, Efficient algorithm for optimizing spectral partitions, Approximation of Length Minimization Problems Among Compact Connected Sets


Uses Software


Cites Work