Skip to main content

Table 1 Numerical results with partial DCT sensing matrices for noise-free 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

4.99e −15

6.77e −16

6.55e −14

1.0153

387

DADM

4.48e −15

6.45e −16

5.24e −14

1.1525

391

NESTA

8.29e −11

1.75e −10

6.10e −10

1.8168

469

n=215

 

Algorithm 3

3.04e −15

3.81e −16

4.71e −14

5.1618

394

DADM

2.10e −15

2.96e −16

2.96e −14

5.6775

398

NESTA

8.48e −11

1.77e −10

6.80e −10

7.7550

477

n=213

 

Algorithm 3

6.20e −15

1.07e −15

4.65e −12

1.0640

394

DADM

3.96e −15

1.20e −15

2.72e −12

1.1331

388

NESTA

1.41e −12

4.70e −12

6.34e −10

2.8384

742

n=215

 

Algorithm 3

3.18e −15

5.39e −16

2.81e −12

5.3503

403

DADM

2.35e −15

3.96e −16

1.84e −12

5.7291

395

NESTA

1.48e −12

4.78e −12

6.95e −10

12.1293

748

n=213

 

Algorithm 3

4.69e −15

9.25e −16

2.94e −10

1.0637

397

DADM

3.01e −15

1.46e −15

1.74e −10

1.9593

665

NESTA

2.05e −14

1.96e −14

8.12e −10

4.7221

1236

n=215

 

Algorithm 3

3.04e −15

4.74e −16

2.08e −10

5.4653

404

DADM

2.05e −15

4.85e −16

1.28e −10

10.2053

691

NESTA

2.09e −14

3.04e −14

7.93e −10

19.5025

1209