Turn on suggestions

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

Showing results for

- Intel Community
- Software
- Software Development SDKs and Libraries
- Intel® oneAPI Math Kernel Library
- question about the complexity to calculate just one eigenvalue

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

Ye_C_1

Beginner

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

08-14-2016
09:05 PM

36 Views

question about the complexity to calculate just one eigenvalue

As we know that the complexity of diagonalization of a matrix should be N^3, where N is the dimension of the matrix.

In MKL, there are a lot of functions that can calculate just some of the eigenvalues.

I want to know that when we just calculate one eigenvalue, if the time cost is divided by N?

Link Copied

1 Reply

Konstantin_A_Intel

Employee

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

08-16-2016
09:47 AM

36 Views

Hi Ye,

You cannot expect that the computation time will be N times lower for only one eigenvalue. Of course, some performance benefit can be expected, but you need to know that there're parts common for any number of eigenvalues (like reducing the matrix to triangular form) and which we cannot make faster.

Regards,

Konstantin

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.