Error using armadillo with code blocks

I am using mingw compiler in codeblocks.
When I compile my code it is compiled perfectly. However while I run it, I get the following error. Although I have changed the config.hpp file to enable the use of Lapck I still get this error. Also using #define ARMA_DONT_USE_WRAPPER givesthe same error.


error: svd(): use of LAPACK needs to be enabled

terminate called after throwing an instance of 'std::logic_error'
  what():  svd(): use of LAPACK needs to be enabled

This application has requested the Runtime to terminate it in an unusual way.
Please contact the application's support team for more information.

Process returned 3 (0x3)   execution time : 4.227 s
Press any key to continue.



Following is my code:

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
#include<fstream>
#include<sstream>
#include<iostream>
#include<conio.h>
#include<stdio.h>
#include<process.h>
#include<string>
#include<iomanip>
#include <random>
#include <math.h>
#define  ARMA_DONT_USE_WRAPPER
#include <armadillo>
#include <cstdio>
#include <cstdlib>


using namespace std;
using namespace arma;
//function to solve the nmf
double** pnmf(double** Xget, int row, int column)
{   int rows=row;
    int columns=column;
    int rinit=2;
    double X[rows][columns];
    for(int i = 0; i < rows; i++) {

        for(int j = 0; j < columns; j++){ X[i][j] = Xget[i][j]; }// sample set value;
    }
    // finding the transpose
    double Xt[columns][rows];
    for(int j=0; j<columns; j++) {
        for(int i=0; i<rows; i++){
            Xt[j][i]=X[i][j];
        }
    }

    int k=0;
    double XX[rows][columns];
    double r1[rows][rinit];
    double r2[rows][rinit];
    double r3[rinit][rinit];
    double r4[rows][rinit];
    double r5[rinit][rinit];
    double r6[rows][rinit];
    double r7[rows][rinit];
    double r8[rows][rinit];
    double r9[rows][rinit];
    double r10[rows][rinit];

      for(int i=0;i< rows;i++)
     {
          for(int j=0; j < columns ;j++)
          {
               XX[i][j] = 0;
          for(k=0;k< columns;k++)
          {
               XX[i][j] = XX[i][j] + X[i][k] * Xt[k][j];
          }
          } // end of j sub loop
     } // end of i main loop
    // initializing W;
    double W[rows][rinit];
    double Wt[rinit][rows];
    double W_Wold[rinit][rows];
    double Wold[rows][rinit];
    for(int i = 0; i < rows; ++i){
        for(int j = 0; j < rinit; j++){
            W[i][j] = (double)rand()/(double)RAND_MAX;
        }
    }

    int max_iter =100;
    double tol=0.00001;
    double sigma[rinit];
    double sigma_diag[rinit][rinit];
    double bsx[rows][rinit];

    for(int iter=0; iter<max_iter; iter++){
        // W_old
        for(int i = 0; i < rows; ++i){
        for(int j = 0; j < rinit; ++j){
            Wold[i][j] = W[i][j];
         }
       }
       mat B(rows,rinit);

       // calculate transpose of W
       for(int j=0; j<rinit; j++) {
        for(int i=0; i<rows; i++){
            Wt[j][i]=W[i][j];
        }
    }
        // calculate bsxfun
        for(int i = 0; i < rows; ++i){
        for(int j = 0; j < rinit; ++j){
            bsx[i][j] = W[i][j]*W[i][j];
         }
       }
       // calculate sigma
       for(int j = 0; j < rinit; ++j){
            sigma[j]=0;
        for(int i = 0; i < rows; ++i){
            sigma[j] = sigma[j]+bsx[i][j];
         }
       }
       //creating diagonal matrix of sigma
       for(int i = 0; i < rinit; ++i){
        for(int j = 0; j < rinit; ++j){
                if (i==j) {sigma_diag[i][j] = sigma[j];}
                else {sigma_diag[i][j] = 0; }
         }
       }
       // creating terms to update W
       for(int i=0;i< rows;i++)
     {
          for(int j=0; j < rinit ;j++)
          {
               r1[i][j] = 0;
          for(k=0;k< rows;k++)
          {
               r1[i][j] = r1[i][j] + XX[i][k] * W[k][j];
          }
          } // end of j sub loop
     }
     for(int i=0;i< rows;i++)
     {
          for(int j=0; j < rinit ;j++)
          {
               r2[i][j] = 0;
          for(k=0;k< rinit;k++)
          {
               r2[i][j] = r2[i][j] + r1[i][k] * sigma_diag[k][j];
          }
          } // end of j sub loop
     }
     for(int i=0;i< rinit; i++)
     {
          for(int j=0; j < rinit ;j++)
          {
               r3[i][j] = 0;
          for(k=0;k< rows;k++)
          {
               r3[i][j] = r3[i][j] + Wt[i][k] * r1[k][j];
          }
          } // end of j sub loop
     }
     for(int i=0;i< rows;i++)
     {
          for(int j=0; j < rinit ;j++)
          {
               r4[i][j] = 0;
          for(k=0;k< rinit; k++)
          {
               r4[i][j] = r4[i][j] + W[i][k] * r3[k][j];
          }
          } // end of j sub loop
     }
     for(int i=0;i< rinit;i++)
     {
          for(int j=0; j < rinit ;j++)
          {
               r5[i][j] = 0;
          for(k=0;k< rows;k++)
          {
               r5[i][j] = r5[i][j] + Wt[i][k] * W[k][j];
          }
          } // end of j sub loop
     }
     for(int i=0;i< rows;i++)
     {
          for(int j=0; j < rinit ;j++)
          {
               r6[i][j] = 0;
          for(k=0;k< rinit;k++)
          {
               r6[i][j] = r6[i][j] + r1[i][k] * r5[k][j];
          }
          } // end of j sub loop
     }
     for(int i=0;i< rows;i++)
     {
          for(int j=0; j < rinit ;j++)
          {
              r7[i][j]=r4[i][j]+r6[i][j];
          } // end of j sub loop
     }
     for(int i=0;i< rows;i++)
     {
          for(int j=0; j < rinit ;j++)
          {
               r8[i][j] = 0;
          for(k=0;k< rinit;k++)
          {
               r8[i][j] = r8[i][j] + r7[i][k] * sigma_diag[k][j];
          }
          } // end of j sub loop
     }
     for(int i=0;i< rows;i++)
     {
          for(int j=0; j < rinit ;j++)
          {
              r9[i][j]=W[i][j]+r8[i][j];
          } // end of j sub loop
     }
     for(int i=0;i< rows;i++)
     {
          for(int j=0; j < rinit ;j++)
          {
              r10[i][j]=r2[i][j]/r9[i][j];
          } // end of j sub loop
     }
     for(int i=0;i< rows;i++)
     {
          for(int j=0; j < rinit ;j++)
          {
              W[i][j]=W[i][j]*r10[i][j];
          } // end of j sub loop
     }
     // finding norm of W
     //assigning W to A
     mat A(rows,rinit);
     for(int i=0;i< rows;i++)
     {
          for(int j=0; j < rinit ;j++)
          {
              A(i,j) = W[i][j];
          } // end of j sub loop
     }

      double norm_W = norm(A);
     // final W
     for(int i=0;i< rows;i++)
     {
          for(int j=0; j < rinit ;j++)
          {
              W[i][j]=W[i][j]/norm_W;
          } // end of j sub loop
     }

     //check convergence
     for(int i=0;i< rows;i++)
     {
          for(int j=0; j < rinit ;j++)
          {
              W_Wold[i][j]=Wold[i][j] - W[i][j];
          } // end of j sub loop
     }
    // assigning W_Wold to B and W_old to A
    for(int i=0;i< rows;i++)
     {
          for(int j=0; j < rinit ;j++)
          {
              A(i,j) = Wold[i][j];
          } // end of j sub loop
     }
     for(int i=0;i< rows;i++)
     {
          for(int j=0; j < rinit ;j++)
          {
              B(i,j) = W_Wold[i][j];
          } // end of j sub loop
     }
     double diffW= norm(B, "fro")/ norm(A, "fro");
     if (diffW<tol)
     {
         cout<<"\nconverged after"<<iter<<"steps";
         break;
     }
    }

    double** table = new double*[rows];
    for(int i = 0; i < rows; i++) {
        table[i] = new double[rinit];
        for(int j = 0; j < rinit; j++){ table[i][j] = W[i][j]; }// sample set value;
    }


    return table;
}
Topic archived. No new replies allowed.