کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
511209 | 865824 | 2009 | 10 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Computational complexity and parallelization of the meshless local Petrov–Galerkin method
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نرم افزارهای علوم کامپیوتر
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Computational complexity and parallelization of the meshless local Petrov–Galerkin method Computational complexity and parallelization of the meshless local Petrov–Galerkin method](/preview/png/511209.png)
چکیده انگلیسی
The computational complexity of the meshless local Petrov–Galerkin method (MLPG) has been analyzed and compared with the finite difference (FDM) and finite element methods (FEM) from the user point of view. Theoretically, MLPG is the most complex of the three methods. Experimental results show that MLPG, with appropriately selected integration order and dimensions of support and quadrature domains, achieves similar accuracy to that of FEM. The measurements of parallel complexity and speed-up indicate that parallel MLPG scales well on larger systems. The normalized computational complexity makes FEM the best choice. MLPG remains competitive if human assistance is needed for meshing.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Structures - Volume 87, Issues 1–2, January 2009, Pages 81–90
Journal: Computers & Structures - Volume 87, Issues 1–2, January 2009, Pages 81–90
نویسندگان
Roman Trobec, Marjan Šterk, Borut Robič,