mirror of
https://github.com/triqs/dft_tools
synced 2024-12-25 13:53:40 +01:00
b534936589
- The previous version of the * operator for matrix was too clever. It was giving a lazy object and then rewriting C = A *B into gemm (a,A,B,0,C). The pb was in case of aliasing : when e.g. C = A, or is a part of A. gemm is not correct that case, and as a result generic code like a = a *b may not be correct in matrix case, which is unacceptable. - So we revert to a simple * operator for matrix that does immediate computation. Same thing for matrix* vector - we also suppress a_x_ty class. -> for M = a * b, when M is a matrix, there is no overhead due to move assignment -> however, when M is a view, there is an additionnal copy. -Correctness comes first, hence the fix. However, if one wants more speed and one can guarantee that there is no aliasing possible, then one has to write a direct gemm call. -> det_manip class was adapted, since in that case, we can show there no alias, and we want the speed gain, so the * ops where replaced by direct blas call (using the array blas interface). -> also gemm, gemv, ger were overloaded in the case the return matrix/vector (i.e. last parameter of the function) is not an lvalue, but a temporary view created on the fly.
64 lines
1.6 KiB
C++
64 lines
1.6 KiB
C++
/*******************************************************************************
|
|
*
|
|
* TRIQS: a Toolbox for Research in Interacting Quantum Systems
|
|
*
|
|
* Copyright (C) 2011 by O. Parcollet
|
|
*
|
|
* TRIQS 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 3 of the License, or (at your option) any later
|
|
* version.
|
|
*
|
|
* TRIQS 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
|
|
* TRIQS. If not, see <http://www.gnu.org/licenses/>.
|
|
*
|
|
******************************************************************************/
|
|
#include <triqs/arrays.hpp>
|
|
|
|
using namespace std;
|
|
using namespace triqs;
|
|
using namespace triqs::arrays;
|
|
|
|
struct gemv_via_binder {
|
|
|
|
triqs::arrays::matrix<double> A;
|
|
typedef triqs::arrays::vector<double> vector_type;
|
|
vector_type MC, MB;
|
|
static const unsigned int N =200;
|
|
|
|
gemv_via_binder(): A(N,N,FORTRAN_LAYOUT), MC(N), MB(N) {
|
|
|
|
for (int i =0; i<N; ++i)
|
|
for (int j=0; j<N; ++j)
|
|
A(i,j) = 0.1*(10*i+ j);
|
|
|
|
make_view(MC) = 1;
|
|
|
|
}
|
|
|
|
void operator()() {
|
|
blas::gemv(1,A, MC, 0, MB);
|
|
}
|
|
};
|
|
|
|
struct expressif : gemv_via_binder {
|
|
void operator()() {
|
|
MB = A * MC;
|
|
}
|
|
};
|
|
|
|
|
|
#include "./speed_tester.hpp"
|
|
int main() {
|
|
const int l= 1000*1000;
|
|
speed_tester<gemv_via_binder> (l);
|
|
speed_tester<expressif> (l);
|
|
return 0;
|
|
}
|
|
|