...
首页> 外文期刊>Journal of Scientific Computing >Efficient Rearrangement Algorithms for Shape Optimization on Elliptic Eigenvalue Problems
【24h】

Efficient Rearrangement Algorithms for Shape Optimization on Elliptic Eigenvalue Problems

机译:椭圆特征值问题形状优化的高效重排算法

获取原文
获取原文并翻译 | 示例
   

获取外文期刊封面封底 >>

       

摘要

In this paper, several efficient rearrangement algorithms are proposed to find the optimal shape and topology for elliptic eigenvalue problems with inhomogeneous structures. The goal is to solve minimization and maximization of the k-th eigenvalue and maximization of spectrum ratios of the second order elliptic differential operator. Physically, these problems are motivated by the frequency control based on density distribution of vibrating membranes. The methods proposed are based on Rayleigh quotient formulation of eigenvalues and rearrangement algorithms which can handle topology changes automatically. Due to the efficient rearrangement strategy, the new proposed methods are more efficient than classical level set approaches based on shape and/or topological derivatives. Numerous numerical examples are provided to demonstrate the robustness and efficiency of new approach.
机译:本文提出了几种有效的重排算法,以找到结构不均匀的椭圆特征值问题的最佳形状和拓扑。目标是解决第k个特征值的最小化和最大化以及二阶椭圆微分算子的频谱比的最大化。从物理上讲,这些问题是由基于振动膜密度分布的频率控制引起的。所提出的方法基于特征值的瑞利商公式和可自动处理拓扑变化的重排算法。由于有效的重排策略,新提出的方法比基于形状和/或拓扑派生的经典水平集方法更有效。提供了大量数值示例,以证明新方法的鲁棒性和效率。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号