Skip to main content

Table 2 Numerical results with partial DCT sensing matrices for noise-free data. The number of measurements m is m=n/8, and the test signals are s-sparse with s=0.01n. 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

1.24e −14

1.65e −15

1.47e −13

2.0684

776

DADM

1.11e −14

4.34e −15

1.33e −13

2.3184

803

NESTA

1.96e −10

3.89e −10

1.61e −09

2.8518

764

n=215

 

Algorithm 3

5.67e −15

5.81e −16

8.02e −14

10.2525

799

DADM

4.58e −15

6.12e −16

6.15e −14

12.0084

832

NESTA

2.00e −10

3.89e −10

1.79e −09

11.9268

761

n=213

 

Algorithm 3

9.65e −15

1.99e −15

6.91e −12

1.9584

758

DADM

1.04e −14

6.61e −15

7.02e −12

2.2513

791

NESTA

3.14e −12

9.96e −12

1.49e −09

4.5468

1216

n=215

 

Algorithm 3

5.09e −15

6.58e −16

4.29e −12

9.7934

762

DADM

5.21e −15

6.98e −16

4.21e −12

11.5441

817

NESTA

3.18e −12

9.97e −12

1.64e −09

18.3234

1187

n=213

 

Algorithm 3

1.36e −14

2.22e −15

5.62e −10

1.8825

727

DADM

7.87e −15

7.69e −15

4.09e −10

3.2409

1129

NESTA

4.68e −14

1.04e −13

2.09e −09

7.3318

1950

n=215

 

Algorithm 3

5.26e −15

7.99e −16

3.39e −10

9.4868

739

DADM

4.32e −15

7.42e −16

2.59e −10

17.2200

1202

NESTA

5.19e −14

3.54e −14

2.35e −09

24.6468

1793