| forum.alglib.net http://forum.alglib.net/ |
|
| Fast sparse matrix solver http://forum.alglib.net/viewtopic.php?f=2&t=4670 |
Page 1 of 1 |
| Author: | Ben136 [ Mon Jun 23, 2025 4:25 pm ] |
| Post subject: | Fast sparse matrix solver |
I see that the commercial version of ALGLIB supports multithreading. I am looking for a multithreaded sparse direct matrix solver. The matrix may have up to 50000 real (double precision) entries and matrices with the same structure and similar numerical values are repeated solved. The Harwell Subroutine Library routines MA48 works great for this situation. But it is single threaded. I see ALGLIB has a sparse nonsymmetric direct solver called sparsesolv which utilizes the sparse LU decomposition with dynamic pivoting. Is it multithreaded by chance? Anyone have experience with it? |
|
| Author: | Ben136 [ Mon Jun 23, 2025 5:13 pm ] |
| Post subject: | Re: Fast sparse matrix solver |
I got a reply from Sergey Bochkanov which reads: "Yes, the commercial version comes with many algorithms multithreaded and that specific one was parallelized. Specific speed-up depends on the sparsity pattern. For example, if you matrix is band diagonal, it is impossible to parallelize no matter how large, because band diagonal structure promotes sequential interdependencies. So, I think that we should just try and see how it works for your case!" |
|
| Page 1 of 1 | All times are UTC |
| Powered by phpBB © 2000, 2002, 2005, 2007 phpBB Group http://www.phpbb.com/ |
|