Efficient algorithm for optimizing spectral partitions

Beniamin Bogosel

Applied Mathematics and Computation, 2018, vol. 333, issue C, 61-75

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.

Keywords: Optimal partition; Eigenvalue; Shape optimization (search for similar items in EconPapers)
Date: 2018
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300318302686
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:333:y:2018:i:c:p:61-75

DOI: 10.1016/j.amc.2018.03.087

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().