Document Type

Article

Publication Date

12-1-2009

Abstract

We introduce a new numerical method for approximating partitions of a domain minimizing the sum of Dirichlet-Laplacian eigenvalues of any order. First we prove the equivalence of the original problem and a relaxed formulation based on measures. Using this result, we build a numerical algorithm to approximate optimal configurations. We describe numerical experiments aimed at studying the asymptotic behavior of optimal partitions with large numbers of cells. © 2009 Society for Industrial and Applied Mathematics.

Publication Source (Journal or Book title)

SIAM Journal on Scientific Computing

First Page

4100

Last Page

4114

Download
COinS