Dear all,
I am running PARDISO to solve sparse symmetric indefinite matrices. Since matrices may be very large, we want to estimate how many memory PARDISO will use given matrix size n and number of nonzero terms nz. In this post https://software.intel.com/en-us/forums/topic/474289, an estimated method is introduced: 1024 * max(iparm(15), iparm(16)+iparm(17)) + n*nrhs*32 for in-core mode. Also, there is a MKL function mkl_peak_mem_usage() that can report memory usage information. However, we cannot obtain the information before executing PARDISO. I wonder if there is any way that can estimate memory usage only by matrix size n and number of nonzero terms nz. I think the reordering algorithm may have some affects on memory usage, but I don't know how to analyze it.
Regards,
Gisiu
