Auto-suggest helps you quickly narrow down your search results by suggesting possible matches as you type.

Showing results for

- Intel Community
- Software
- Software Development SDKs and Libraries
- Intel® oneAPI Math Kernel Library
- pardiso multiple right hand side with sparse matrix

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

Ma_L_

Beginner

- Mark as New
- Bookmark
- Subscribe
- Mute
- Subscribe to RSS Feed
- Permalink
- Email to a Friend
- Report Inappropriate Content

06-01-2014
10:12 PM

51 Views

pardiso multiple right hand side with sparse matrix

Hi All,

Pardiso can handle multiple right side, AX=B, meaning B is a matrix. Every column of B is a right hand side. If B is very sparse, is there any way to exploit this feature, instead of storing B as a full matrix? Thank you!

Link Copied

1 Reply

mecej4

Black Belt

- Mark as New
- Bookmark
- Subscribe
- Mute
- Subscribe to RSS Feed
- Permalink
- Email to a Friend
- Report Inappropriate Content

06-02-2014
06:56 AM

51 Views

Here is an untested suggestion:

Store B using CSC storage. After the factorization of A has been performed, do the forward and backward substitutions on one column of B at a time: for each column of B, (i) unpack into a full vector using ?sctr (ii) call pardiso to obtain the corresponding column of X by forward and backward substitution, (iii) pack the result just found into the proper column of X using ?gthr.

A simpler alternative is not to store B at all, but compute each column of B just when it is needed, solve for the corresponding column of X, and store X in any way suitable in memory or on disk.

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

For more complete information about compiler optimizations, see our Optimization Notice.