You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Blaze and (Boost.)uBLAS could be slightly faster for OpenDSS. Since MVMult is a tiny portion of the code, it should be easy to test multiply libraries. Currently KLUSolve is used as a dynamic library, also easier to test multiple versions.
(Low priority)
The text was updated successfully, but these errors were encountered:
uBLAS with complex numbers didn't result in better results -- I expected this but there are some benchmarks around that suggest it might work better for very small float matrices.
Blaze is a bit faster than Eigen on MSVC, but slower on GCC on Windows. There are also some compilation issues that require headers changes for it to work with mingw-w64. It might be worth revisiting this in the future.
For Eigen, one interesting observation is that using just the dynamic matrix part...
Map<VectorXcd>(b, N).noalias() = Map<MatrixXcd>(A, N, N) * Map<VectorXcd>(x, N);
...instead of the switch for different (statically sized) matrices is faster on MSVC (2017 15.9.9), which also makes it faster than the GCC (8) DLL.
Blaze and (Boost.)uBLAS could be slightly faster for OpenDSS. Since MVMult is a tiny portion of the code, it should be easy to test multiply libraries. Currently KLUSolve is used as a dynamic library, also easier to test multiple versions.
(Low priority)
The text was updated successfully, but these errors were encountered: