کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
9506290 | 1631840 | 2005 | 11 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Suitable iterative methods for solving the linear system arising in the three fields domain decomposition method
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات کاربردی
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Suitable iterative methods for solving the linear system arising in the three fields domain decomposition method Suitable iterative methods for solving the linear system arising in the three fields domain decomposition method](/preview/png/9506290.png)
چکیده انگلیسی
There are two approaches for applying substructuring preconditioner for the linear system corresponding to the discrete Steklov-Poincaré operator arising in the three fields domain decomposition method for elliptic problems. One of them is to apply the preconditioner in a common way, i.e. using an iterative method such as preconditioned conjugate gradient method [S. Bertoluzza, Substructuring preconditioners for the three fields domain decomposition method, I.A.N.-C.N.R, 2000] and the other one is to apply iterative methods like for instance bi-conjugate gradient method, conjugate gradient square and etc. which are efficient for nonsymmetric systems (the preconditioned system will be nonsymmetric). In this paper, second approach will be followed and extensive numerical tests will be presented which imply that the considered iterative methods are efficient.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Applied Mathematics and Computation - Volume 170, Issue 2, 15 November 2005, Pages 741-751
Journal: Applied Mathematics and Computation - Volume 170, Issue 2, 15 November 2005, Pages 741-751
نویسندگان
M.R. Mokhtarzadeh, A. Golbabaee, R. Mokhtary, N.G. Chegini,