TalksClosest point method for eigenvalue optimization on surfaces
80
reads
In this talk, an efficient algorithm is presented for shape optimization of eigenvalue problems on surfaces. The closest point method is adapted to solve the forward eigenvalue problems on surfaces in a simple and efficient way. The optimal shape is achieved by an iterative method based on the efficient rearrangement algorithm. Unlike classical iterative approaches based on shape or topological derivative, the new method can obtain optimal shape in just a few iterations.
reads
Chiu-Yen Kao
2012-01-11
16:00:00 - 17:00:00
308 , Mathematics Research Center Building (ori. New Math. Bldg.)
In this talk, an efficient algorithm is presented for shape optimization of eigenvalue problems on surfaces. The closest point method is adapted to solve the forward eigenvalue problems on surfaces in a simple and efficient way. The optimal shape is achieved by an iterative method based on the efficient rearrangement algorithm. Unlike classical iterative approaches based on shape or topological derivative, the new method can obtain optimal shape in just a few iterations.