首页> 外文会议>International Conference on the Computation of Electromagnetic Fields >An Efficient Algorithm For Accurate Reduced Models With The Proper Generalized Decomposition For Magnetoquasi-Static Problems
【24h】

An Efficient Algorithm For Accurate Reduced Models With The Proper Generalized Decomposition For Magnetoquasi-Static Problems

机译:一种高效的算法,可用于磁化静态问题的适当广义分解的精确降低模型

获取原文

摘要

Consideration of electromagnetic field problems solved by the finite-element (FE) method with large FE models yield high computational effort. Model order reduction (MOR) techniques can be applied to reduce the computational effort. The proper generalized decompostition (PGD) is an a-priori method which calculates the reduced model (RM) from differential equations separated in previous defined coordinates. To exploit the a-priori property of PGD the RM is evaluated for each new mode without the use of a time stepping FE solution. Methods to efficiently evaluate the RM are presented.
机译:大型FE模型有限元(FE)法解决了电磁场问题的考虑,得到了高计算工作。可以应用模型顺序(Mor)技术来减少计算工作。适当的广义分解(PGD)是一种先验方法,该方法计算在先前定义的坐标中分离的差分方程的缩小模型(RM)。为了利用PGD的a-priori属性,可以在不使用时间踩飞机FE解决方案的情况下对每个新模式进行评估RM。提出了有效评估RM的方法。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号