Computational complexity of best primary evector algorithm?

Open discussion regarding features, bugs, issues, vendors, etc.

Computational complexity of best primary evector algorithm?

Postby tdewolf » Thu Oct 21, 2010 7:46 pm

Hello everyone,

I'm doing some research looking at the computational complexity of calculating the primary eigenvector of large (at least 20,000 x 20,000) matricies, and as I scoured the internet I was directed here and was hoping that I might be able to get some recommendations to good algorithms or places that would be good to search to find the computational cost of various algorithms.
Thanks!
tdewolf
 
Posts: 1
Joined: Thu Oct 21, 2010 2:16 pm

Return to User Discussion

Who is online

Users browsing this forum: No registered users and 5 guests