- Mark as New
- Bookmark
- Subscribe
- Mute
- Subscribe to RSS Feed
- Permalink
- Report Inappropriate Content
I was looking through the LAPACK documentation and came across various instances where there are different routines recommended for large and small matrices. For eg., SYEVD vs SYEVR ( https://software.intel.com/en-us/node/469180 ) - { last paragraph of the description section } .
But nowhere that I could find, is there any mention of how large, large exactly is. Does someone here know?
Thanks!
Link Copied
- Mark as New
- Bookmark
- Subscribe
- Mute
- Subscribe to RSS Feed
- Permalink
- Report Inappropriate Content
There are SMP and distributed versions for both of these routines. Therefore, the problem sizes will be very large ( fit with RAM available on SMP or Cluster Systems correspondingly ).
- Mark as New
- Bookmark
- Subscribe
- Mute
- Subscribe to RSS Feed
- Permalink
- Report Inappropriate Content
Gennady Fedorov (Intel) wrote:
There are SMP and distributed versions for both of these routines. Therefore, the problem sizes will be very large ( fit with RAM available on SMP or Cluster Systems correspondingly ).
I am currently using it on an SMP system. But what is the relative qualification in input matrix sizes that the documentation makes? You say that "the problem sizes will be very large". Do you mean to say that both of them take very large inputs and that it doesn't matter? If so, what does the doc mean?
- Subscribe to RSS Feed
- Mark Topic as New
- Mark Topic as Read
- Float this Topic for Current User
- Bookmark
- Subscribe
- Printer Friendly Page