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

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

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

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