Advances in Continuous and Discrete Models

Theory and Modern Applications

Table 4 Relative error and computational time for Example 5.4

From: Convergence analysis of gradient-based iterative algorithms for a class of rectangular Sylvester matrix equations based on Banach contraction principle

Method	CT	Error
GI opt	0.0185	0.0089
GI	0.0176	0.0336
RGI	0.0199	0.1053
MGI	0.0196	0.1819
direct method	3.6177

Back to article page