- Mark as New
- Bookmark
- Subscribe
- Mute
- Subscribe to RSS Feed
- Permalink
- Report Inappropriate Content
Hi,
is it possible to access directly the LU matrices after the factorization stage in Pardiso?
Alex
is it possible to access directly the LU matrices after the factorization stage in Pardiso?
Alex
Link Copied
10 Replies
- Mark as New
- Bookmark
- Subscribe
- Mute
- Subscribe to RSS Feed
- Permalink
- Report Inappropriate Content
Hi,
LU matrices stored internally but you can get diagonal elements of Cholesky decomposition, number of positive and negative elements on diagonal an so on. What exactly you what to do with LU matrices obtained from PARDISO?
With best regards,
Alexander Kalinkin
- Mark as New
- Bookmark
- Subscribe
- Mute
- Subscribe to RSS Feed
- Permalink
- Report Inappropriate Content
Hi,
I am thinking of using LU matrices to compute some elements (or blocks) of the inverse matrix using recursive
algorithms. For this, I need full access to LU (or L for Cholesky factorization) matrices.
Alex
I am thinking of using LU matrices to compute some elements (or blocks) of the inverse matrix using recursive
algorithms. For this, I need full access to LU (or L for Cholesky factorization) matrices.
Alex
- Mark as New
- Bookmark
- Subscribe
- Mute
- Subscribe to RSS Feed
- Permalink
- Report Inappropriate Content
Could you provide block-scheme of this algorithms or some articles about them? Maybe I could provide some ideas how PARDISO can be used to improve it.
With best regards,
Alexander Kalinkin
- Mark as New
- Bookmark
- Subscribe
- Mute
- Subscribe to RSS Feed
- Permalink
- Report Inappropriate Content
Hi Alexander,
thank you for your help. An example of recursive computing of inverse elements using LU matrices is given in Niessner et al. "On computing the inverse of a sparse matrix," International Journal for Numerical Methods in Engineering, Vol. 19, 1513-1526 (1983).
(I can send a pdf file vie email).
I am thinking of putting the block that I need in the lower right part of the inverse matrix and then applying formulas (21) and (22) [see also Figs.3,4]. My original matrix is symmetric and I was wondering whether PARDISO could be used to make Cholesky factorization and return the L-matrix (instead of actually solving the linear system of equations).
--Alex
thank you for your help. An example of recursive computing of inverse elements using LU matrices is given in Niessner et al. "On computing the inverse of a sparse matrix," International Journal for Numerical Methods in Engineering, Vol. 19, 1513-1526 (1983).
(I can send a pdf file vie email).
I am thinking of putting the block that I need in the lower right part of the inverse matrix and then applying formulas (21) and (22) [see also Figs.3,4]. My original matrix is symmetric and I was wondering whether PARDISO could be used to make Cholesky factorization and return the L-matrix (instead of actually solving the linear system of equations).
--Alex
- Mark as New
- Bookmark
- Subscribe
- Mute
- Subscribe to RSS Feed
- Permalink
- Report Inappropriate Content
Hi,
Could you upload this pdf by this forum? You can do it by private reply on this topic if there are some problem with sharing this article.
With best regards,
Alexander Kalinkin
- Mark as New
- Bookmark
- Subscribe
- Mute
- Subscribe to RSS Feed
- Permalink
- Report Inappropriate Content
Hi Alexander,
I need to access diagonal elements of sparse Cholesky, could you please show how these may be accessed? Thanks, RT
I need to access diagonal elements of sparse Cholesky, could you please show how these may be accessed? Thanks, RT
- Mark as New
- Bookmark
- Subscribe
- Mute
- Subscribe to RSS Feed
- Permalink
- Report Inappropriate Content
Hi Russ,
Are your matrix symmetric? If yes the way how to find diagonal elements from Cholesky decomposition describe in this topic: (http://software.intel.com/en-us/forums/showthread.php?t=77082) or in PARDISO example folder (example name -pardiso_sym_getdiag_c.c).
With best regards,
Alexander Kalinkin
- Mark as New
- Bookmark
- Subscribe
- Mute
- Subscribe to RSS Feed
- Permalink
- Report Inappropriate Content
Thanks for the very quick reply. Yes, matrix is SPD.
thanks again,
RT
thanks again,
RT
- Mark as New
- Bookmark
- Subscribe
- Mute
- Subscribe to RSS Feed
- Permalink
- Report Inappropriate Content
Hi Alexander,
Two questions:
(1) I couldn't tell if LDL' or LL' is being computed?
(2) What is the cost of the two extra steps?
Thanks again,
Russ
Two questions:
(1) I couldn't tell if LDL' or LL' is being computed?
(2) What is the cost of the two extra steps?
Thanks again,
Russ
- Mark as New
- Bookmark
- Subscribe
- Mute
- Subscribe to RSS Feed
- Permalink
- Report Inappropriate Content
Hi Russ,
1. If mtype is equal 2 than LL^T decomposition will be computed,if mtype is equal -2 then LDL^T decomposition will be computed.
2. It's depend on initial matrix size and structure.
With best regards,
Alexander Kalinkin

Reply
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