Paper Info
Title
Developing Bi-CG and Bi-CR methods to solve generalized Sylvester-transpose matrix equations
Abstract
The bi-conjugate gradients (Bi-CG) and bi-conjugate residual (Bi-CR) methods are powerful tools for solving nonsymmetric linear systems Ax = b. By using Kronecker product and vectorization operator, this paper develops the Bi-CG and Bi-CR methods for the solution of the generalized Sylvester-transpose matrix equation Σi=1p (AiXBi + CiXTDi) = E (including Lyapunov, Sylvester and Sylvester-transpose matrix equations as special cases). Numerical results validate that the proposed algorithms are much more efficient than some existing algorithms.
Year
DOI
Venue
2014
10.1007/s11633-014-0762-0
International Journal of Automation and Computing
Keywords
DocType
Volume
sylvester-transpose matrix equation,existing algorithm,generalized sylvester-transpose matrix equation,numerical results validate,powerful tool,kronecker product,bi-cr method,nonsymmetric linear system,proposed algorithm,bi-conjugate gradient
Journal
11
Issue
ISSN
Citations 
1
1751-8520
7
PageRank 
References 
Authors
0.55
13
1
Name
Order
Citations
PageRank
Masoud Hajarian134524.18