Developing Bi-CG and Bi-CR Methods to Solve Generalized Sylvester-transpose Matrix Equations
نویسندگان
چکیده
منابع مشابه
An accelerated gradient based iterative algorithm for solving systems of coupled generalized Sylvester-transpose matrix equations
In this paper, an accelerated gradient based iterative algorithm for solving systems of coupled generalized Sylvester-transpose matrix equations is proposed. The convergence analysis of the algorithm is investigated. We show that the proposed algorithm converges to the exact solution for any initial value under certain assumptions. Finally, some numerical examples are given to demons...
متن کاملOn the numerical solution of generalized Sylvester matrix equations
The global FOM and GMRES algorithms are among the effective methods to solve Sylvester matrix equations. In this paper, we study these algorithms in the case that the coefficient matrices are real symmetric (real symmetric positive definite) and extract two CG-type algorithms for solving generalized Sylvester matrix equations. The proposed methods are iterative projection metho...
متن کاملThe coupled Sylvester-transpose matrix equations over generalized centro-symmetric matrices
In this paper, we present an iterative algorithm for solving the following coupled Sylvester-transpose matrix equations q ∑ j=1 ( AijXjBij + CijX j Dij ) = Fi, i = 1, 2, . . . , p, over the generalized centro-symmetric matrix group (X1, X2, . . . , Xq). The solvability of the problem can be determined by the proposed algorithm, automatically. If the coupled Sylvester-transpose matrix equations ...
متن کاملCR Variants of Hybrid Bi-CG Methods for Solving Linear Systems with Nonsymmetric Matrices
s at ICCAM 2008 CR Variants of Hybrid Bi-CG Methods for Solving Linear Systems with Nonsymmetric Matrices Kuniyoshi Abe Gifu Shotoku University 1-38, Nakauzura, Gifu, 500-8288 Japan [email protected] Joint work with: S. Fujino By Krylov subspace methods, we are solving a large sparse linear system Ax = b, where A stand for an n-by-n matrix, and x and b are n-vectors, respectively. The Bi-C...
متن کاملCG-type algorithms to solve symmetric matrix equations
The global FOM and GMRES are among the effective algorithms to solve linear system of equations with multiple right-hand sides. In this paper, we study these algorithms in the case that the coefficient matrix is symmetric and extract two CGtype algorithms for solving symmetric linear systems of equations with multiple right– hand sides. Then, we compare the numerical performance of the new algo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Automation and Computing
سال: 2014
ISSN: 1476-8186,1751-8520
DOI: 10.1007/s11633-014-0762-0