A computational approach to an optimal partition problem on surfaces (Q899696)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A computational approach to an optimal partition problem on surfaces |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A computational approach to an optimal partition problem on surfaces |
scientific article |
Statements
A computational approach to an optimal partition problem on surfaces (English)
0 references
30 December 2015
0 references
Summary: We explore an optimal partition problem on surfaces using a computational approach. The problem is to minimize the sum of the first Dirichlet Laplace-Beltrami operator eigenvalues over a given number of partitions of a surface. We consider a method based on eigenfunction segregation and perform calculations using modern high performance computing techniques. We first test the accuracy of the method in the case of three partitions on the sphere, then explore the problem for higher numbers of partitions and on other surfaces.
0 references
optimal partition problem
0 references
surfaces
0 references
Dirichlet Laplace-Beltrami operator
0 references
eigenvaules
0 references
computational methods
0 references
Schrödinger equation
0 references
infinite well potential
0 references
Hardy potentials
0 references