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

Showing results for

- Intel Community
- Software Development SDKs and Libraries
- Intel® oneAPI Math Kernel Library & Intel® Math Kernel Library
- Speed up performance for a given matrix structure

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

Highlighted
##

Dinesh_S_

Beginner

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

11-27-2017
10:48 AM

24 Views

Speed up performance for a given matrix structure

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

2 Replies

Highlighted
##

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.

Gennady_F_Intel

Moderator

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

11-27-2017
07:28 PM

24 Views

Highlighted
##

Dinesh_S_

Beginner

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

11-28-2017
07:38 AM

24 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

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