Solving the Matrix Nearness Problem in the Maximum Norm by Applying a Projection and Contraction Method

Table 1

Numerical results of example 1.

𝑛	𝜆1	𝜆𝑛	𝑘	CPU time (s)	‖𝑒(𝑢)‖∞	‖vec(𝑋−𝐶)‖∞/‖vec(𝐶)‖∞
10	0.2947	2.2687	55	0.06	9.2699×10^−8	1.9768×10^−7
20	−0.5849	2.8134	58	0.17	7.3282×10^−8	2.7002×10^−7
30	−0.9467	2.9938	65	0.35	7.5651×10^−8	2.8008×10^−7
40	−1.2405	3.4024	75	0.49	9.6325×10^−8	5.0350×10^−7
50	−1.7593	3.7925	89	0.67	8.5592×10^−8	3.9993×10^−7
60	−2.0733	4.1648	106	1.29	8.9517×10^−8	6.1197×10^−7
70	−2.3450	4.3352	121	2.00	9.5952×10^−8	6.6696×10^−7
80	−2.5817	4.5194	140	3.56	8.3927×10^−8	3.7658×10^−7
90	−2.8345	4.7512	160	5.23	8.3227×10^−8	4.8914×10^−7
100	−2.9193	5.1780	181	7.43	9.3473×10^−8	6.2160×10^−7
150	−4.1850	5.7006	302	35.90	7.4435×10^−8	6.1552×10^−7
200	−4.6721	6.7545	446	119.07	7.8171×10^−8	8.4093×10^−7