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

I want to solve some linear equations（Ax=b） with same matrix A and different vector b. So i decided to decompose matrix A with cholesky decomposition to get matrix L (A= LT*L).

Is there any MKL function can outputs L matrix of cholesky decomposition, i have tried some other library, but most of them can not directly output matrix L.

Link Copied

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

Hello,

Is the matrix sparse or dense? Intel MKL provides a way in both cases to solve one system with multiple right-hand sides but functionality is different. If you just want to solve with multiple right-hand sides, you don't actually need the matrix L. So, is there something else which you didn't mention in your description?

Thanks,

Kirill

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

Voronin, Kirill (Intel) wrote:Hello,

Is the matrix sparse or dense? Intel MKL provides a way in both cases to solve one system with multiple right-hand sides but functionality is different. If you just want to solve with multiple right-hand sides, you don't actually need the matrix L. So, is there something else which you didn't mention in your description?

Thanks,

Kirill

thanks for your answer. Matrix A is a 5000x5000 matrix with about 60,000 (0.25%) none zeros elements. I actually need the matrix L for follow-up work.

so， MKL can not output matrix L driectly?

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

I see. For such a tiny matrix and such sparsity I believe there is no need to use sparse matrices. Have a look at https://software.intel.com/en-us/onemkl-developer-reference-c-getrf from LAPACK.

Best,

Kirill

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

Voronin, Kirill (Intel) wrote:I see. For such a tiny matrix and such sparsity I believe there is no need to use sparse matrices. Have a look at https://software.intel.com/en-us/onemkl-developer-reference-c-getrf from LAPACK.

Best,

Kirill

I will try it, by the way ,have you ever try to solve problem like mine, do you know how long will take to do cholesky or LU decomposition. my program is run on a server with 2 Intel(R) Xeon(R) CPU E5-2609 v3 @ 1.90GHz.

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

you may take a look at the published perf results for some of mkl's factorizations routines from intel mkl product page - https://software.intel.com/en-us/mkl/features/benchmarks

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