کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
512685 866421 2014 8 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Proof of linear independence of flat-top PU-based high-order approximation
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نرم افزارهای علوم کامپیوتر
پیش نمایش صفحه اول مقاله
Proof of linear independence of flat-top PU-based high-order approximation
چکیده انگلیسی

This paper extends a rank deficiency counting approach, which was initially established by An et al. (2011, 2012 [1] and [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 PU 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.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Engineering Analysis with Boundary Elements - Volume 44, July 2014, Pages 104–111
نویسندگان
, , , ,