Turn on suggestions

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

Showing results for

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

Iosif_M_

Beginner

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

04-12-2016
01:16 AM

72 Views

Sparse eigensolver

1 Solution

Gennady_F_Intel

Moderator

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

04-12-2016
10:44 PM

72 Views

Link Copied

5 Replies

Ying_H_Intel

Employee

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

04-12-2016
02:16 AM

72 Views

Hi Losif,

For general sparse matrix, The Pardiso or DSS solver may be you wanted.

Best Regards,

Ying

Iosif_M_

Beginner

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

04-12-2016
02:24 AM

72 Views

Dear Ying,

Thank you for the response. As far as I understand PARDISO can solve sparse SLAE, but it is not eigensolver.

Best regards,

Iosif

Ying_H_Intel

Employee

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

04-12-2016
06:01 AM

72 Views

Hi Losif,

then other option may be :

The Extended Eigensolver functionality offers:

• Real/Complex and Single/Double precisions: double precision is recommended to provide better accuracy

of eigenpairs.

• Reverse communication interfaces (RCI) provide maximum flexibility for specific applications. RCI are

independent of matrix format and inner system solvers, so you must provide your own linear system

solvers (direct or iterative) and matrix-matrix multiply routines.

• Predefined driver interfaces for dense, LAPACK banded, and sparse (CSR) formats are less flexible but are

optimized and easy to use:

• The Extended Eigensolver interfaces for dense matrices are likely to be slower than the comparable

LAPACK routines because the FEAST algorithm has a higher computational cost.

7 Intel® Math Kernel Library Reference Manual

1628

• The Extended Eigensolver interfaces for banded matrices support banded LAPACK-type storage.

• T**he Extended Eigensolver sparse interfaces support compressed sparse row format and use the Intel
MKL PARDISO solver.**

Best wishes,

Ying

Gennady_F_Intel

Moderator

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

04-12-2016
10:44 PM

73 Views

Iosif_M_

Beginner

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

04-13-2016
07:24 AM

72 Views

Dear Gennady,

I have also found that functionality in the FEAST solver. Just now it is enough for us to use FEAST and switch to MKL/FEAST later.

Iosif

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

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