Hi, everyone,
I have recently run accross a problem, which requires manipulations with large sparse matrices, in particular, it is desired to efficiently compute Cholesky decomposition of a symmetric matrix of the order >=30000. I checked that PARDISO can factorize such matrix relatively fast (at phase 22), but how do I exctract the factored matrix without actually solving the associated system of equations?
Thanks,
Leonid.
链接已复制
3 回复数