Advances in Continuous and Discrete Models

Theory and Modern Applications

Table 3 Relative error and computational time for Example 5.3

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

	Dimension 2 × 2		Dimension 10 × 10		Dimension 100 × 100
Method	CT	Error	CT	Error	CT	Error
GI opt	2.7170e-04	9.4674e-04	4.5690e-04	0.0018	0.0188	0.0036
GI	2.3330e-04	0.0996	4.3030e-04	0.2125	0.0160	0.0709
RGI	2.6100e-04	0.0254	5.3710e-04	0.8040	0.0205	0.0456
MGI	2.7400e-04	0.0074	7.2790e-04	0.0072	0.0195	0.0240
JGI	2.6410e-04	0.0772	7.6200e-04	0.1649	0.0200	0.0267
AJGI 1	2.8810e-04	0.1601	7.8790e-04	0.1465	0.0267	0.1936
AJGI 2	2.8420e-04	0.0167	8.2090e-04	0.0251	0.0262	0.0229
LSI	2.5810e-04	0.2567	7.9300e-04	0.2935	0.0261	0.2329

Back to article page