首页> 外文期刊>Bulletin of the Polish Academy of Sciences. Technical Sciences >Heuristic algorithm to predict the location of C° separators for efficient isogeometric analysis simulations with direct solvers
【24h】

Heuristic algorithm to predict the location of C° separators for efficient isogeometric analysis simulations with direct solvers

机译:启发式算法预测C°分离器的位置,具有直接求解器的高效异构分析模拟

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

摘要

We focus on two and three-dimensional isogeometric finite element method computations with tensor product Ck B-spline basis functions.We consider the computational cost of the multi-frontal direct solver algorithm executed over such tensor product grids.We present an algorithm for estimation of the number of floating-point operations per mesh node resulting from the execution of the multi-frontal solver algorithm with the ordering obtained from the element partition trees.Next,we propose an algorithm that introduces C° separators between patches of elements of a given size based on the stimated number of flops per node.We show that the computational cost of the multi-frontal solver algorithm executed over the computational grids with C° separators introduced is around one or two orders of magnitude lower,while the approximability of the functional space is improved.We show O(NlogN)computational complexity of the heuristic algorithm proposing the introduction of the C~0 separators between the patches of elements,reducing the computational cost of the multi-frontal solver algorithm.
机译:我们重点讨论了二维和三维等几何有限元方法的张量积Ck B样条基函数计算。我们考虑多额叶直接求解器算法在这样的张量乘积网格上执行的计算成本。我们提出了一种算法,用于估计每个网格节点的浮点操作数,该算法由执行多前沿解算器算法产生,其顺序从元素划分树获得。接下来,我们提出了一种算法,根据每个节点估计的失败次数,在给定大小的元素块之间引入C°分隔符。我们表明,在引入C°分隔符的计算网格上执行的多前沿求解器算法的计算成本大约降低了一到两个数量级,同时函数空间的可逼近性得到了改善。我们展示了启发式算法的O(NlogN)计算复杂度,提出在元素块之间引入C~0分隔符,从而降低了多前沿求解算法的计算成本。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号