Skip to Main content Skip to Navigation
Journal articles

Efficient algorithm for optimizing spectral partitions

Abstract : We present an amelioration of current known algorithms for minimizing functions depending on the eigenvalues corresponding to a partition of a given domain. The idea is to use the advantage of a representation using density functions on a fixed grid while decreasing the computational time. This is done by restricting the computation to neighbourhoods of regions where the associated densities are above a certain threshold. The algorithm extends and improves known methods in the plane and on surfaces in dimension 3. It also makes possible to make computations of optimal volumic 3D spectral partitions on sufficiently important discretizations.
Document type :
Journal articles
Complete list of metadata

https://hal.archives-ouvertes.fr/hal-03181136
Contributor : Beniamin Bogosel <>
Submitted on : Thursday, March 25, 2021 - 2:14:35 PM
Last modification on : Sunday, March 28, 2021 - 3:25:13 AM

File

large_spart.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Beniamin Bogosel. Efficient algorithm for optimizing spectral partitions. Applied Mathematics and Computation, Elsevier, 2018, 333, pp.61-75. ⟨10.1016/j.amc.2018.03.087⟩. ⟨hal-03181136⟩

Share

Metrics

Record views

16

Files downloads

24