Gradient based and least squares based iterative algorithms for matrix equations AXB + CX^TD = F

From MaRDI portal
Publication:606754





A gradient based iterative algorithm and a least squares based iterative algorithm are developed and presented for the solution of the matrix equation \(AXB + CX^{T}D = F\). The hierarchical identification principle is applied to the matrix equation in order to decompose the system under consideration into two subsystems and to derive the iterative algorithms by extending the iterative methods for solving \(Ax = b\) and \(AXB = F\). Further analysis shows that when the matrix equation has a unique solution, under the sense of least squares, the iterative solution converges to the exact solution for any initial values. A numerical example is used to verify the proposed methods.



Cites work


Cited in
(only showing first 100 items - show all)








This page was built for publication: Gradient based and least squares based iterative algorithms for matrix equations \(AXB + CX^{T}D = F\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q606754)