This work is devoted to designing two conjugate gradient methods for the least Frobenius norm solution of the generalized periodic Sylvester matrix equations. When the studied problem is consistent, the… Click to show full abstract
This work is devoted to designing two conjugate gradient methods for the least Frobenius norm solution of the generalized periodic Sylvester matrix equations. When the studied problem is consistent, the first conjugate gradient method can find its solution within finite iterative steps in the absence of round-off errors. Furthermore, its least Frobenius norm solution can be obtained with some special kind of initial matrices. When the studied problem is inconsistent, the second conjugate gradient method with some special kind of initial matrices can find its least squares solution with the least Frobenius norm within finite iterative steps in the absence of round-off errors. Finally, several numerical examples are tested to validate the performance of the proposed methods.
               
Click one of the above tabs to view related content.