首页> 外文期刊>Engineering analysis with boundary elements >Proof of linear independence of flat-top PU-based high-order approximation
【24h】

Proof of linear independence of flat-top PU-based high-order approximation

机译:基于平顶PU的高阶逼近的线性独立性证明

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

摘要

This paper extends a rank deficiency counting approach, which was initially established by An et al. (2011, 2012 [1,2]) to determine the rank deficiency of finite element partition of unity (PU)-based approximations, to explicitly prove the linear independence of the flat-top PU-based high-order polynomial approximation. The study also examines the coupled flat-top PL) and finite element PU-based approximation, and the results indicate that the space at a global level is also linearly independent for 1 -D setting and 2-D setting with triangular mesh, but not so for rectangular mesh. Moreover, a new procedure is proposed to simplify the construction of flat-top PU, and its feasibility, accuracy and efficiency have been validated by a typical numerical example.
机译:本文扩展了秩缺陷计数方法,该方法最初由An等人建立。 (2011,2012 [1,2])确定基于单位(PU)逼近的有限元划分的秩不足,以明确证明基于平顶PU的高阶多项式逼近的线性独立性。该研究还研究了基于平顶PL和有限元PU的耦合逼近,结果表明,对于具有三角形网格的一维设置和二维设置,全局水平的空间也是线性独立的,但不是所以对于矩形网格。此外,提出了一种简化平板式PU结构的新方法,并通过一个典型的数值例子验证了其可行性,准确性和效率。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号