| 论文简介 |
In the partition of unity (PU)-based methods, the global approximation is built by multiplying a partition of unity by local approximations. Within this framework, high-order approximations are achieved by
directly adopting high-order polynomials as local approximations, and therefore nodes along sides or inside elements, which are usually adopted in the conventional finite element methods, are no more required. However, the PU-based approximation constructed in this way may suffer from rank deficiency due to the linear dependence of the global degrees of freedom. In this paper, the origin of the rank deficiency in the PU-based approximation space is first dissected at an element level, and then an approach to predict the rank deficiency for a mesh is proposed together with the principle of the increase of rank deficiency. Finally, examples are investigated to validate the present approach. The current work indicates such a fact that the rank deficiency is an unrelated issue to the nullity of the global matrix. It can be resolved in its own manner. |
(创新港)
