A New Iterative Algorithm for Solving a Class of Matrix Nearness Problem

Table 1

		Algorithm 1	Algorithm 2
𝑛=50	IT	5	36
	CPU	0.019262	0.125212
	ERR	3.46×10^−11	9.01×10^−10
	DIS	50.00	50.00
𝑛=80	IT	8	167
	CPU	0.096335	4.660955
	ERR	2.31×10^−10	9.26×10^−10
	MIN	80.00	80.0010
𝑛=100	IT	16	1673
	CPU	0.168511	17.604961
	ERR	5.21×10^−10	9.8×10^−10
	MIN	99.9997	100.0001
𝑛=150	IT	79	—
	CPU	2.589103	—
	ERR	5.21×10^−10	—
	MIN	150.0261	—