Mentions légales du service

Skip to content
Snippets Groups Projects
Commit c2ca5d6e authored by hhakim's avatar hhakim
Browse files

Fall back to truncated SVD for the butterfly factorization (it has proved...

Fall back to truncated SVD for the butterfly factorization (it has proved practically to be more efficient).
parent ccdbbbda
Branches
Tags 3.21.0
No related merge requests found
Pipeline #834049 skipped
...@@ -151,7 +151,7 @@ namespace Faust ...@@ -151,7 +151,7 @@ namespace Faust
} }
} }
// #pragma omp parallel for // Tested but non-efficient because of solveDTO already parallelized // #pragma omp parallel for // Tested but non-efficient because of solveDTO calls are already parallelized
// for(int i=0;i<noncec.size();i++) // for(int i=0;i<noncec.size();i++)
// { // {
// Faust::MatDense<FPP, Cpu> submat, bestx, besty; // Faust::MatDense<FPP, Cpu> submat, bestx, besty;
...@@ -162,10 +162,10 @@ namespace Faust ...@@ -162,10 +162,10 @@ namespace Faust
auto RP = s1.col_nonzero_inds(r); auto RP = s1.col_nonzero_inds(r);
auto CP = s2.row_nonzero_inds(r); auto CP = s2.row_nonzero_inds(r);
A.submatrix(RP, CP, submat); A.submatrix(RP, CP, submat);
#ifdef BUTTERFLY_TUNCATED_SVD #ifdef BUTTERFLY_APPROX_RANK1
submat.best_low_rank(ce->size(), bestx, besty);
#else
submat.approx_rank1(bestx, besty); submat.approx_rank1(bestx, besty);
#else
submat.best_low_rank(ce->size(), bestx, besty);
#endif #endif
for(int i=0;i< ce->size();i++) for(int i=0;i< ce->size();i++)
{ {
......
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Please register or to comment