Turn on suggestions

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
- Rank updates to pardiso factorization

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

Jens_E_

New Contributor I

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

01-22-2015
06:13 AM

43 Views

Rank updates to pardiso factorization

Hi,

Is it possible to do rank-1-updates of the factorization computed by pardiso? That is, given A = L D L^T, I need to be able to efficiently compute the decomposition of A + alpha w w^T (w is a vector)

I'm using this functionality in an interior-point algorithm for large-scale convex optimization.

Best,

Jens

Link Copied

4 Replies

Kenneth_C_Intel

Employee

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

01-22-2015
11:43 AM

43 Views

Hi, thank you for asking this question I will look into and get back back to as soon as i have an answer.

Regards,

Kenneth

Alexander_K_Intel2

Employee

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

01-22-2015
06:41 PM

43 Views

Hi Jens,

Current Pardiso functionality doesn't support such algorithm, but can i ask you about reason of this request? Pardiso doesn't provide factorization matrices even for matrix A, but allow one to solve system with factorized matrix, compute inertia and etc. So if you want to have ability to solve system with matrix (A+alpha w w^t)x = f that, probably, could be implemented via Schur complement functionality. Сan you provide additional details of your request to give me a chance to help you?

Thanks,

Alex

Jens_E_

New Contributor I

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

01-23-2015
12:13 AM

43 Views

Thanks for your replies, here are some more details:

Given a factorization of A, it is possible (but as I understand, not i pardiso) to compute the factorization of a small-rank update of A very efficiently. In my case, the small-rank update appears in each iteration of an interior-point algorithm for a convex optimization problem.

In particular, the matrix at each iteration in the algorithm is given as A_k = (Q + B^T * Phi_k * B) where the Q and B are fixed, and the Phi is a diagonal matrix which changes at each iteration.

Obviously I don't need the factorization explicitly, just the ability to compute x = A_k^{inv}b_k

Best,

Jens

Alexander_K_Intel2

Employee

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

01-26-2015
08:22 AM

43 Views

Hi Jens,

Thanks a lot for this details, send a private message to you with additional questions to understand possibility of MKL pardiso support such functionality

Thanks,

Alex

Topic Options

- 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.