Intel® oneAPI Math Kernel Library
Ask questions and share information with other developers who use Intel® Math Kernel Library.
Announcements
Welcome to the Intel Community. If you get an answer you like, please mark it as an Accepted Solution to help others. Thank you!
6436 Discussions

Speed up performance for a given matrix structure

Dinesh_S_
Beginner
101 Views

Hi

If the logical structure (not actual values) of the matrix remains same, is there a way to avoid symbolic factorization stage for problems requiring large number of of linear system solutions?

Regards

Dinesh

0 Kudos
2 Replies
Gennady_F_Intel
Moderator
101 Views

you may set maxfct ( maximum #of factors with identical sparsity structure) accordingly your case, make symbolic factorizations only once and then do numerical factorization maxfct times. we have a couple of examples show these cases. 

 

Dinesh_S_
Beginner
101 Views

Could you please direct me to an example to achieve this?

My problem involve solving many linear systems (to obtain solution to non linear system)

For example, I would like to solve

A1 x1 = b1

then

A2 x2 = b2

 

where A2 depends on x1, but the sparsity of A1 and A2 are the same (however I do not have A2 until I solve for x1)

Regards

Dinesh

 

Reply