Convergence analysis of a gradient iterative algorithm with optimal convergence factor for a generalized Sylvester-transpose matrix equation

Abstract

<abstract> Consider a generalized Sylvester-transpose matrix equation with rectangular coefficient matrices. Based on gradients and hierarchical identification principle, we derive an iterative algorithm to produce a sequence of approximated solutions with a reasonable stopping rule concerning a relative norm-error. A convergence analysis via Banach fixed-point theorem reveals the sequence converges to a unique solution of the matrix equation for any given initial matrix if and only if the convergence factor is chosen appropriately in a certain range. The performance of algorithm is theoretically analysed through the convergence rate and error estimations. The optimal convergence factor is chosen to attain the fastest asymptotic behaviour. Finally, numerical experiments are provided to illustrate the capability and efficiency of the proposed algorithm, compared to recent gradient-based iterative algorithms. </abstract>