aboutsummaryrefslogtreecommitdiffhomepage
path: root/bench/btl/libs/STL/STL_interface.hh
blob: ef4cc923309fe6c7ce2e1761749cbb420c812ada (plain)
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
//=====================================================
// File   :  STL_interface.hh
// Author :  L. Plagne <laurent.plagne@edf.fr)>
// Copyright (C) EDF R&D,  lun sep 30 14:23:24 CEST 2002
//=====================================================
//
// This program is free software; you can redistribute it and/or
// modify it under the terms of the GNU General Public License
// as published by the Free Software Foundation; either version 2
// of the License, or (at your option) any later version.
//
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU General Public License for more details.
// You should have received a copy of the GNU General Public License
// along with this program; if not, write to the Free Software
// Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.
//
#ifndef STL_INTERFACE_HH
#define STL_INTERFACE_HH
#include <string>
#include <vector>
#include "utilities.h"

using namespace std;

template<class real>
class STL_interface{

public :

  typedef real real_type ;

  typedef std::vector<real>  stl_vector;
  typedef std::vector<stl_vector > stl_matrix;

  typedef stl_matrix gene_matrix;

  typedef stl_vector gene_vector;

  static inline std::string name( void )
  {
    return "STL";
  }

  static void free_matrix(gene_matrix & /*A*/, int /*N*/){}

  static void free_vector(gene_vector & /*B*/){}

  static inline void matrix_from_stl(gene_matrix & A, stl_matrix & A_stl){
    A = A_stl;
  }

  static inline void vector_from_stl(gene_vector & B, stl_vector & B_stl){
    B = B_stl;
  }

  static inline void vector_to_stl(gene_vector & B, stl_vector & B_stl){
    B_stl = B ;
  }


  static inline void matrix_to_stl(gene_matrix & A, stl_matrix & A_stl){
    A_stl = A ;
  }

  static inline void copy_vector(const gene_vector & source, gene_vector & cible, int N){
    for (int i=0;i<N;i++){
      cible[i]=source[i];
    }
  }


  static inline void copy_matrix(const gene_matrix & source, gene_matrix & cible, int N){
    for (int i=0;i<N;i++)
      for (int j=0;j<N;j++)
        cible[i][j]=source[i][j];
  }

//   static inline void ata_product(const gene_matrix & A, gene_matrix & X, int N)
//   {
//     real somme;
//     for (int j=0;j<N;j++){
//       for (int i=0;i<N;i++){
//         somme=0.0;
//         for (int k=0;k<N;k++)
//           somme += A[i][k]*A[j][k];
//         X[j][i]=somme;
//       }
//     }
//   }

  static inline void aat_product(const gene_matrix & A, gene_matrix & X, int N)
  {
    real somme;
    for (int j=0;j<N;j++){
      for (int i=0;i<N;i++){
        somme=0.0;
        if(i>=j)
        {
          for (int k=0;k<N;k++){
            somme+=A[k][i]*A[k][j];
          }
          X[j][i]=somme;
        }
      }
    }
  }


  static inline void matrix_matrix_product(const gene_matrix & A, const gene_matrix & B, gene_matrix & X, int N)
  {
    real somme;
    for (int j=0;j<N;j++){
      for (int i=0;i<N;i++){
        somme=0.0;
        for (int k=0;k<N;k++)
          somme+=A[k][i]*B[j][k];
        X[j][i]=somme;
      }
    }
  }

  static inline void matrix_vector_product(gene_matrix & A, gene_vector & B, gene_vector & X, int N)
  {
    real somme;
    for (int i=0;i<N;i++){
      somme=0.0;
      for (int j=0;j<N;j++)
        somme+=A[j][i]*B[j];
      X[i]=somme;
    }
  }

  static inline void symv(gene_matrix & A, gene_vector & B, gene_vector & X, int N)
  {
    for (int j=0; j<N; ++j)
      X[j] = 0;
    for (int j=0; j<N; ++j)
    {
      real t1 = B[j];
      real t2 = 0;
      X[j] += t1 * A[j][j];
      for (int i=j+1; i<N; ++i) {
        X[i] += t1 * A[j][i];
        t2 += A[j][i] * B[i];
      }
      X[j] += t2;
    }
  }
  
  static inline void syr2(gene_matrix & A, gene_vector & B, gene_vector & X, int N)
  {
    for (int j=0; j<N; ++j)
    {
      for (int i=j; i<N; ++i)
        A[j][i] += B[i]*X[j] + B[j]*X[i];
    }
  }

  static inline void ger(gene_matrix & A, gene_vector & X, gene_vector & Y, int N)
  {
    for (int j=0; j<N; ++j)
    {
      for (int i=j; i<N; ++i)
        A[j][i] += X[i]*Y[j];
    }
  }

  static inline void atv_product(gene_matrix & A, gene_vector & B, gene_vector & X, int N)
  {
    real somme;
    for (int i=0;i<N;i++){
      somme = 0.0;
      for (int j=0;j<N;j++)
        somme += A[i][j]*B[j];
      X[i] = somme;
    }
  }

  static inline void axpy(real coef, const gene_vector & X, gene_vector & Y, int N){
    for (int i=0;i<N;i++)
      Y[i]+=coef*X[i];
  }

  static inline void axpby(real a, const gene_vector & X, real b, gene_vector & Y, int N){
    for (int i=0;i<N;i++)
      Y[i] = a*X[i] + b*Y[i];
  }

  static inline void trisolve_lower(const gene_matrix & L, const gene_vector & B, gene_vector & X, int N){
    copy_vector(B,X,N);
    for(int i=0; i<N; ++i)
    {
      X[i] /= L[i][i];
      real tmp = X[i];
      for (int j=i+1; j<N; ++j)
        X[j] -= tmp * L[i][j];
    }
  }

  static inline real norm_diff(const stl_vector & A, const stl_vector & B)
  {
    int N=A.size();
    real somme=0.0;
    real somme2=0.0;

    for (int i=0;i<N;i++){
      real diff=A[i]-B[i];
      somme+=diff*diff;
      somme2+=A[i]*A[i];
    }
    return somme/somme2;
  }

  static inline real norm_diff(const stl_matrix & A, const stl_matrix & B)
  {
    int N=A[0].size();
    real somme=0.0;
    real somme2=0.0;

    for (int i=0;i<N;i++){
      for (int j=0;j<N;j++){
        real diff=A[i][j] - B[i][j];
        somme += diff*diff;
        somme2 += A[i][j]*A[i][j];
      }
    }

    return somme/somme2;
  }

  static inline void display_vector(const stl_vector & A)
  {
    int N=A.size();
    for (int i=0;i<N;i++){
      INFOS("A["<<i<<"]="<<A[i]<<endl);
    }
  }

};

#endif