- Mark as New
- Bookmark
- Subscribe
- Mute
- Subscribe to RSS Feed
- Permalink
- Report Inappropriate Content
I have an application where I need to solve two sparse problems per time step. The two sparse problems are almost identical (same sparseness, etc), except one does not change from time step to time step, whereas the other changes slightly. Thus, I generate the LU decomposition of the first problem at the beginning and solve the first problem directly at each time step (iparm(4)=0). The second problem is solved using the LU decomposition from the first problem as a preconditioner for CG (iparm(4)=32). The issue is that the second problem results in a memory leak. If the second problem is solved directly (factorization+solution+memory release) at each time step, no leaks occurs. Tried with mkl version 9.0, 9.1 and 10.0 and get the same problem.Tried to use MKL_FreeBuffers() after CG step, but still leaks...
Thank you
Link Copied
- Mark as New
- Bookmark
- Subscribe
- Mute
- Subscribe to RSS Feed
- Permalink
- Report Inappropriate Content
- Mark as New
- Bookmark
- Subscribe
- Mute
- Subscribe to RSS Feed
- Permalink
- Report Inappropriate Content
Glad to hear that. Any idea regarding the release date?
Alberto
- Mark as New
- Bookmark
- Subscribe
- Mute
- Subscribe to RSS Feed
- Permalink
- Report Inappropriate Content
Alberto,
In the November this year, but I couldnt provide more the exact date.
-- Gennady

- Subscribe to RSS Feed
- Mark Topic as New
- Mark Topic as Read
- Float this Topic for Current User
- Bookmark
- Subscribe
- Printer Friendly Page