Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
GPT-5.1
GPT-5.1 104 tok/s
Gemini 3.0 Pro 36 tok/s Pro
Gemini 2.5 Flash 133 tok/s Pro
Kimi K2 216 tok/s Pro
Claude Sonnet 4.5 37 tok/s Pro
2000 character limit reached

Shape optimization for interior Neumann and transmission eigenvalues (1810.00629v1)

Published 1 Oct 2018 in math.NA

Abstract: Shape optimization problems for interior eigenvalues is a very challenging task since already the computation of interior eigenvalues for a given shape is far from trivial. For example, a concrete maximizer with respect to shapes of fixed area is theoretically established only for the first two non-trivial Neumann eigenvalues. The existence of such a maximizer for higher Neumann eigenvalues is still unknown. Hence, the problem should be addressed numerically. Better numerical results are achieved for the maximization of some Neumann eigenvalues using boundary integral equations for a simplified parametrization of the boundary in combination with a non-linear eigenvalue solver. Shape optimization for interior transmission eigenvalues is even more complicated since the corresponding transmission problem is non-self-adjoint and non-elliptic. For the first time numerical results are presented for the minimization of interior transmission eigenvalues for which no single theoretical result is yet available.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.