Matrix form of the CGS method for solving general coupled 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...
متن کاملA numerical algorithm for solving a class of matrix equations
In this paper, we present a numerical algorithm for solving matrix equations $(A otimes B)X = F$ by extending the well-known Gaussian elimination for $Ax = b$. The proposed algorithm has a high computational efficiency. Two numerical examples are provided to show the effectiveness of the proposed algorithm.
متن کاملSinc operational matrix method for solving the Bagley-Torvik equation
The aim of this paper is to present a new numerical method for solving the Bagley-Torvik equation. This equation has an important role in fractional calculus. The fractional derivatives are described based on the Caputo sense. Some properties of the sinc functions required for our subsequent development are given and are utilized to reduce the computation of solution of the Bagley-Torvik equati...
متن کاملA matrix LSQR algorithm for solving constrained linear operator equations
In this work, an iterative method based on a matrix form of LSQR algorithm is constructed for solving the linear operator equation $mathcal{A}(X)=B$ and the minimum Frobenius norm residual problem $||mathcal{A}(X)-B||_F$ where $Xin mathcal{S}:={Xin textsf{R}^{ntimes n}~|~X=mathcal{G}(X)}$, $mathcal{F}$ is the linear operator from $textsf{R}^{ntimes n}$ onto $textsf{R}^{rtimes s}$, $ma...
متن کاملOn the gradient based algorithm for solving the general coupled matrix equations
Recently, the gradient based iterative algorithms have been widely exploited for finding the (leastsquares) solutions of the different kinds of the (coupled) linear matrix equations. Nevertheless, so far, the convergence of the propounded gradient based algorithms has been studied under the circumstance that the mentioned (coupled) linear matrix equations have a unique (least-squares) solution....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics Letters
سال: 2014
ISSN: 0893-9659
DOI: 10.1016/j.aml.2014.03.013