Hello,
I am solving a sparse linear system
Ku = B using
alglib::sparsesolve in C++, the matrix is around 1e4x1e4 in size and 99.9% empty. However the computation time on my personal computer is around 1 minute, which looks very high for such matrix (I am running in sequential with commercial version of
Alglib, the matrix is in CSR format). I was wondering if this computation time was normal or if I misunderstood something.
Code:
alglib::sparsematrix K;
alglib::real_1d_array B;
......
int nLen = B.length()
alglib::real_1d_array u;
u.setlength(nLen);
alglib::sparsesolverreport rep;
alglib::sparsesolve(K,nLen,B,u,rep);
Login
Register
FAQ
Search
