کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4967870 | 1449387 | 2016 | 16 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Compact moving least squares: An optimization framework for generating high-order compact meshless discretizations
ترجمه فارسی عنوان
کمترین مربعات متحرک: یک چارچوب بهینه سازی برای تولید اختیارات بی نظیر بی نظیر بالا
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نرم افزارهای علوم کامپیوتر
چکیده انگلیسی
A generalization of the optimization framework typically used in moving least squares is presented that provides high-order approximation while maintaining compact stencils and a consistent treatment of boundaries. The approach, which we refer to as compact moving least squares, resembles the capabilities of compact finite differences but requires no structure in the underlying set of nodes. An efficient collocation scheme is used to demonstrate the capabilities of the method to solve elliptic boundary value problems in strong form stably without the need for an expensive weak form. The flexibility of the approach is demonstrated by using the same framework to both solve a variety of elliptic problems and to generate implicit approximations to derivatives. Finally, an efficient preconditioner is presented for the steady Stokes equations, and the approach's efficiency and high order of accuracy is demonstrated for domains with curvi-linear boundaries.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Journal of Computational Physics - Volume 326, 1 December 2016, Pages 596-611
Journal: Journal of Computational Physics - Volume 326, 1 December 2016, Pages 596-611
نویسندگان
Nathaniel Trask, Martin Maxey, Xiaozhe Hu,