|  | //===================================================== | 
|  | // Copyright (C) 2008 Gael Guennebaud <gael.guennebaud@inria.fr> | 
|  | //===================================================== | 
|  | // | 
|  | // 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 MTL4_INTERFACE_HH | 
|  | #define MTL4_INTERFACE_HH | 
|  |  | 
|  | #include <boost/numeric/mtl/mtl.hpp> | 
|  | #include <boost/numeric/mtl/utility/range_generator.hpp> | 
|  | // #include <boost/numeric/mtl/operation/cholesky.hpp> | 
|  | #include <vector> | 
|  |  | 
|  | using namespace mtl; | 
|  |  | 
|  | template<class real> | 
|  | class mtl4_interface { | 
|  |  | 
|  | public : | 
|  |  | 
|  | typedef real real_type ; | 
|  |  | 
|  | typedef std::vector<real>  stl_vector; | 
|  | typedef std::vector<stl_vector > stl_matrix; | 
|  |  | 
|  | typedef mtl::dense2D<real, mtl::matrix::parameters<mtl::tag::col_major> > gene_matrix; | 
|  | typedef mtl::dense_vector<real>  gene_vector; | 
|  |  | 
|  | static inline std::string name() { return "mtl4"; } | 
|  |  | 
|  | static void free_matrix(gene_matrix & A, int N){ | 
|  | return ; | 
|  | } | 
|  |  | 
|  | static void free_vector(gene_vector & B){ | 
|  | return ; | 
|  | } | 
|  |  | 
|  | static inline void matrix_from_stl(gene_matrix & A, stl_matrix & A_stl){ | 
|  | A.change_dim(A_stl[0].size(), A_stl.size()); | 
|  |  | 
|  | for (int j=0; j<A_stl.size() ; j++){ | 
|  | for (int i=0; i<A_stl[j].size() ; i++){ | 
|  | A(i,j) = A_stl[j][i]; | 
|  | } | 
|  | } | 
|  | } | 
|  |  | 
|  | static inline void vector_from_stl(gene_vector & B, stl_vector & B_stl){ | 
|  | B.change_dim(B_stl.size()); | 
|  | for (int i=0; i<B_stl.size() ; i++){ | 
|  | B[i] = B_stl[i]; | 
|  | } | 
|  | } | 
|  |  | 
|  | static inline void vector_to_stl(gene_vector & B, stl_vector & B_stl){ | 
|  | for (int i=0; i<B_stl.size() ; i++){ | 
|  | B_stl[i] = B[i]; | 
|  | } | 
|  | } | 
|  |  | 
|  | static inline void matrix_to_stl(gene_matrix & A, stl_matrix & A_stl){ | 
|  | int N=A_stl.size(); | 
|  | for (int j=0;j<N;j++){ | 
|  | A_stl[j].resize(N); | 
|  | for (int i=0;i<N;i++){ | 
|  | A_stl[j][i] = A(i,j); | 
|  | } | 
|  | } | 
|  | } | 
|  |  | 
|  | static inline void matrix_matrix_product(const gene_matrix & A, const gene_matrix & B, gene_matrix & X, int N){ | 
|  | X = (A*B); | 
|  | //     morton_dense<double, doppled_64_row_mask> C(N,N); | 
|  | //     C = B; | 
|  | //     X = (A*C); | 
|  | } | 
|  |  | 
|  | static inline void transposed_matrix_matrix_product(const gene_matrix & A, const gene_matrix & B, gene_matrix & X, int N){ | 
|  | X = (trans(A)*trans(B)); | 
|  | } | 
|  |  | 
|  | //   static inline void ata_product(const gene_matrix & A, gene_matrix & X, int N){ | 
|  | //     X = (trans(A)*A); | 
|  | //   } | 
|  |  | 
|  | static inline void aat_product(const gene_matrix & A, gene_matrix & X, int N){ | 
|  | X = (A*trans(A)); | 
|  | } | 
|  |  | 
|  | static inline void matrix_vector_product(gene_matrix & A, gene_vector & B, gene_vector & X, int N){ | 
|  | X = (A*B); | 
|  | } | 
|  |  | 
|  | static inline void atv_product(gene_matrix & A, gene_vector & B, gene_vector & X, int N){ | 
|  | X = (trans(A)*B); | 
|  | } | 
|  |  | 
|  | static inline void axpy(const real coef, const gene_vector & X, gene_vector & Y, int N){ | 
|  | Y += coef * X; | 
|  | } | 
|  |  | 
|  | static inline void axpby(real a, const gene_vector & X, real b, gene_vector & Y, int N){ | 
|  | Y = a*X + b*Y; | 
|  | } | 
|  |  | 
|  | //   static inline void cholesky(const gene_matrix & X, gene_matrix & C, int N){ | 
|  | //     C = X; | 
|  | //     recursive_cholesky(C); | 
|  | //   } | 
|  |  | 
|  | //   static inline void lu_decomp(const gene_matrix & X, gene_matrix & R, int N){ | 
|  | //     R = X; | 
|  | //     std::vector<int> ipvt(N); | 
|  | //     lu_factor(R, ipvt); | 
|  | //   } | 
|  |  | 
|  | static inline void trisolve_lower(const gene_matrix & L, const gene_vector& B, gene_vector & X, int N){ | 
|  | X = lower_trisolve(L, B); | 
|  | } | 
|  |  | 
|  | static inline void copy_matrix(const gene_matrix & source, gene_matrix & cible, int N){ | 
|  | cible = source; | 
|  | } | 
|  |  | 
|  | static inline void copy_vector(const gene_vector & source, gene_vector & cible, int N){ | 
|  | cible = source; | 
|  | } | 
|  |  | 
|  | }; | 
|  |  | 
|  | #endif |