Skip to main content

Table 3 Numerical results with partial DCT sensing matrices for noisy data. The number of measurements m is m=n/4, and the test signals are s-sparse with s=0.02n. Each value in a cell represents the mean over 50 trials

From: A fast and accurate algorithm for 1 minimization problems in compressive sampling

Method

2-error

1-error

-error

CPU time(s)

Iterations

n=213

 

Algorithm 3

6.06e −2

6.28e −3

5.49e −1

0.2309

82

DADM

6.06e −2

6.23e −3

5.49e −1

0.2268

75

NESTA

7.25e −2

2.47e −2

6.68e −1

0.4006

123

n=215

 

Algorithm 3

6.10e −2

6.28e −3

6.15e −1

1.0700

80

DADM

6.10e −2

6.23e −3

6.15e −1

1.0925

76

NESTA

7.23e −2

2.29e −2

7.14e −1

1.7906

123

n=213

 

Algorithm 3

1.90e −2

1.76e −3

10.0453

0.2684

99

DADM

1.89e −2

1.72e −3

10.0370

0.2181

71

NESTA

2.05e −2

1.61e −2

12.0646

0.4353

132

n=215

 

Algorithm 3

1.88e −2

1.60e −3

11.3331

1.5018

111

DADM

1.88e −2

1.54e −3

11.3232

1.0662

71

NESTA

2.09e −2

1.54e −2

13.0586

1.8931

132

n=213

 

Algorithm 3

1.13e −3

1.03e −4

49.7915

0.2740

101

DADM

1.13e −3

5.85e −4

50.3671

0.5953

199

NESTA

1.28e −3

1.13e −3

61.2107

0.4243

125

n=215

 

Algorithm 3

1.18e −3

5.73e −5

56.1854

1.3543

102

DADM

1.18e −3

5.49e −4

56.8402

2.9696

200

NESTA

1.34e −3

1.11e −3

66.0787

1.7721

126