کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4640334 | 1341271 | 2011 | 11 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Convergence of a FEM and two-grid algorithms for elliptic problems on disjoint domains
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات کاربردی
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
In this paper, we analyze a FEM and two-grid FEM decoupling algorithms for elliptic problems on disjoint domains. First, we study the rate of convergence of the FEM and, in particular, we obtain a superconvergence result. Then with proposed algorithms, the solution of the multi-component domain problem (simple example — two disjoint rectangles) on a fine grid is reduced to the solution of the original problem on a much coarser grid together with solution of several problems (each on a single-component domain) on fine meshes. The advantage is the computational cost although the resulting solution still achieves asymptotically optimal accuracy. Numerical experiments demonstrate the efficiency of the algorithms.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Journal of Computational and Applied Mathematics - Volume 236, Issue 3, 1 September 2011, Pages 364–374
Journal: Journal of Computational and Applied Mathematics - Volume 236, Issue 3, 1 September 2011, Pages 364–374
نویسندگان
Boško S. Jovanovic, Miglena N. Koleva, Lubin G. Vulkov,