کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4635211 | 1340708 | 2007 | 15 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A minimal residual algorithm for the inconsistent matrix equation AXBÂ =Â C over symmetric matrices
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات کاربردی
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
An iterative method with short recurrences is presented by Peng [Z.-Y. Peng, An iteration method for the least squares symmetric solution of the linear matrix equation AXBÂ =Â C, Appl. Math. Comput. 170 (2005) 711-723] for solving the nearness problem associated with the inconsistent matrix equation AXBÂ =Â C for symmetric matrices. The solution of this nearness problem can be computed with little work and low storage requirements per iteration. However, this algorithm may be slow in case of the irregular convergence behavior in the residual norm of AXBÂ =Â C. In order to remedy this problem, a modification based on the idea of the classical CG method is presented in this paper and an error bound is given. Finally, numerical experiments are reported.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Applied Mathematics and Computation - Volume 188, Issue 1, 1 May 2007, Pages 499-513
Journal: Applied Mathematics and Computation - Volume 188, Issue 1, 1 May 2007, Pages 499-513
نویسندگان
Yuan Lei, An-ping Liao,