Skip to main content
Advances in Continuous and Discrete Models

Theory and Modern Applications

Table 1 Relative error and computational time for Example 5.1

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

θ

Relative error

CT

θ = 6.5398e-04

5.800 × 10−3

0.0324

θ = 2.500e-07

9.629 × 10−1

0.0311

θ = 1.6700e-06

7.810 × 10−1

0.0322

θ = 1.9580e-05

1.585 × 10−1

0.0316

θ = 9.8530e-05

4.460 × 10−2

0.0303

Direct method

 

20.8804

Back to article page