کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
6892195 | 1445351 | 2018 | 25 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Parameterized generalized shift-splitting preconditioners for nonsymmetric saddle point problems
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله

چکیده انگلیسی
To solve nonsymmetric saddle point problems, the parameterized generalized shift-splitting (PGSS) preconditioner is presented and analyzed. The corresponding PGSS iteration method can be applied not only to the nonsingular saddle point problems but also to the singular ones. The convergence and semi-convergence of the PGSS iteration method are discussed carefully. Meanwhile, the spectral properties of the preconditioned matrix and the strategy of the choices of the parameters are given. Numerical experiments further demonstrate that the PGSS iteration method and the PGSS preconditioner are efficient and have better performance than some existing iteration methods and newly proposed preconditioners, respectively, for solving both the nonsingular and singular nonsymmetric saddle point problems.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Mathematics with Applications - Volume 75, Issue 2, 15 January 2018, Pages 349-373
Journal: Computers & Mathematics with Applications - Volume 75, Issue 2, 15 January 2018, Pages 349-373
نویسندگان
Zheng-Ge Huang, Li-Gong Wang, Zhong Xu, Jing-Jing Cui,