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

Hello,

I have a serials of structurally identical matrixs such as {A1, A2, A3,....}

and I need to solve A*X=Y, for A1,A2,A3......., note that rho vector Y changes as time goes while all matrixs are kept constant ,

so I need to solve all these equations at each time step. Is there any way I can do factorization only once at the starting time and

stores all the computed factors in a memory efficient way so that I can solve the linear equations whenever the Y vectors are updated?

Thank you!

PS 1: I know I can store a array of pardiso handles like pt(:,N_matrixs) but I am afraid that in this way the internal memory cost would be

too much since all these matrixs are structures identically.

PS 2: I don't understand why most sparse LU factorization package does not provide the users the actually LU matrixs, which are exactly what they are expected to to, instead, they prefer to use some kind of internal memory structures which nobody knows what they really are, except god.

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

Hi,

Looks like you can use parameter maxfct and mnum from pardiso interface that allow you for matrices with same structure have different factorization values.

Thanks,

Alex

Link Copied

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

Hi,

Looks like you can use parameter maxfct and mnum from pardiso interface that allow you for matrices with same structure have different factorization values.

Thanks,

Alex

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